COMPUTER SCIENCE AND SYSTEM ENGINEERING CS2108 PC Operating Systems Lab 0 3 50 50 100 1.

5
CS2109 SC Intellectual Property Rights (Internal) 1 2 100 0 100 2
SCHEME AND SYLLABI : (With effect from 2022-23 admitted batch)
CS2110 MC Environmental Science 0 0 - 100 100 0
Common for CSE & IT
Total Credits 21.5
B.Tech & B.Tech + M.Tech (Computer Science & Engineering)
II Year - II Semester
I Year - I Semester
CS2201 ES Microprocessors 4 0 30 70 100 3
Course Category Course Title Hours per Internal External Total Credits CS2202 PC Design and Analysis of Algorithms 4 0 30 70 100 3
code week Marks Marks Marks CS2203 PC Database Management Systems 4 0 30 70 100 3
L T CS2204 PC Formal Languages & Automata Theory 4 0 30 70 100 3
CS1101 BS Engineering Mathematics –I 4 0 30 70 100 3 CS2205 HSS Managerial Economics 4 0 30 70 100 3
CS1102 BS Green Chemistry 4 0 30 70 100 3 CS2206 PC Algorithms Lab through C++. 0 3 50 50 100 1.5
CS1103 HSS English 4 0 30 70 100 3 CS2207 PC Database Management Systems Lab 0 3 50 50 100 1.5
CS1104 ES Computer Programming Using C 4 0 30 70 100 3 CS2208 SC Web Technologies 1 2 50 50 100 2
CS1105 ES IT Essentials 4 0 30 70 100 3 CS2209 MC Professional Ethics & Universal
CS1106 HSS Communication skillsLab 0 3 50 50 100 1.5 Human Values 0 0 0 100 100 0
CS1107 ES Computer Engineering Workshop Lab 0 3 50 50 100 1.5 CS2210 M C NCC/NSS 0 2 - - - 0
CS1108 ES Computer Programming using C lab 0 3 50 50 100 1.5
Total Credits 20
Total Credits 19.5 Internship-I
I Year-II Semester I Year – I Semester
CS1201 BS Engineering Mathematics–II 4 0 30 70 100 3 CS1101 BS Engineering Mathematics –I 4 0 30 70 100 3
CS1202 BS Engineering Physics 4 0 30 70 100 3 CS1102 BS Green Chemistry 4 0 30 70 100 3
CS1203 ES Elements of Electronics Engineering 4 0 30 70 100 3 CS1103 HSS English 4 0 30 70 100 3
CS1204 ES Data Structures Using C 4 0 30 70 100 3 CS1104 ES Computer Programming Using C 4 0 30 70 100 3
CS1205 ES Digital LogicDesign 4 0 30 70 100 3 CS1105 ES IT Essentials 4 0 30 70 100 3
CS1206 ES Linux Administration Lab 0 3 50 50 100 1.5 CS1106 HSS Communication skillsLab 0 3 50 50 100 1.5
CS1207 BS Engineering Physics Lab 0 3 50 50 100 1.5 CS1107 ES Computer Engineering Workshop Lab 0 3 50 50 100 1.5
CS1208 ES Data StructuresLab 0 3 50 50 100 1.5 CS1108 ES Computer Programming using C lab 0 3 50 50 100 1.5
Total Credits 19.5 Total Credits 19.5

II Year - I Semester CS1101 : ENGINEERING MATHEMATICS-I

CS2101 ES Discrete Mathematical Structures 4 0 30 70 100 3
CS2102 PC Computer Organization and
Course Objectives
Architecture 4 0 30 70 100 3 * To transmit the knowledge of Partial differentiation.
CS2103 BS Probability, Statistics and * To know of getting maxima and minima of function of two variables and
Queuing theory 4 0 30 70 100 3
finding errors and approximations.
CS2104 PC Operating Systems 4 0 30 70 100 3
* To evaluate double and triple integrals, volumes of solids and area of
CS2105 PC Object Oriented Programming
Through Java 4 0 30 70 100 3 curved surfaces.
CS2106 PC Computer Organization & * To expand a periodical function as Fourier series and half-range Fourier
Architecture Lab 0 3 30 70 100 1.5 series
CS2107 PC Object Oriented Programming
Through Java Lab 0 3 50 50 100 1.5 Course Outcomes
 * Find the partial derivatives of functions of two or more variables. 5. Higher Engineering Mathematics by B.V. Ramana, Tata Mc Graw Hill
* Evaluate maxima and minima, errors and approximations. Company. 6.
* Evaluate double and triple integrals, volumes of solids and area of 6. Higher Engineering Mathematics by Dr. M.K.Venkataraman.
curved surfaces.
CS1102 : GREEN CHEMISTRY
* To expand a periodical function as Fourier series and half-range Fourier
series. Course Objectives:
* Have a fundamental understanding of Fourier series and be able to give * To apply the basic knowledge of Chemistry to the Engineering Disci-
Fourier expansions of a given function. pline.
* To develop knowledge about water and its treatment for industrial and
SYLLABUS potable purposes.
Partial Differentiation: Introduction - Functions of two or more variables - * To develop understanding in the areas of Batteries, Fuels Mechanism of
Partial derivatives - Homogeneous functions – Euler’s theorem - Total deriva- Corrosion of Metals and Corrosion Control Methods, Green Chemistry and
tive - Change of variables – Jacobins. Mean value Theorems (without proofs) Technology and Processes involving Green Chemistry and apply the knowl-
Applications of Partial Differentiation: Geometrical interpretation -Tan- edge for solving existing challenges faced in various engineering and societal
gent plane and Normal to a surface -Taylor’s theorem for functions of two areas.
variables - Errors and approximations -Total differential. Maxima and Minima
of functions of two variables - Lagrange’s method of undetermined multipliers Learning outcome:
- Differentiation under the integral Sign - Leibnitz’s rule. * The students are able to apply the basic concepts and principles stud-
Multiple Integrals: Introduction - Double Integrals - Change of Order of ied in Chemistry to the field of Engineering.
Integration - Double Integrals in Polar Coordinates - Triple Integrals - Change * The students are able to apply chemistry to different branches of engi-
of Variables. neering
Multiple Integrals-Applications: Area enclosed by plane curves - Volumes * The students are able to acquire the knowledge in the areas of Water
of solids - Area of a curved surface - Calculation of Mass - Centre of gravity - Chemistry, Mechanism of Corrosion of Metals and Corrosion Control Meth-
Moment of inertia - product of inertia – principal axes- Beta Function - Gamma ods, Batteries, Fuel Cells, Green Chemistry and Technology and Processes
Function - Relation between Beta and Gamma Functions. Error Function or involving Green Chemistry and suggest innovative solutions for existing chal-
Probability Integral. lenges in these areas.
Fourier Series: Introduction - Euler’s Formulae - Conditions for a Fourier
SYLLABUS
Expansion - Functions having points of discontinuity - Change of Interval - Odd
and Even Functions - Expansions of Odd or Even Periodic Functions, Half- Water Technology : Sources of Water – Impurities and their influence of
Range Series - Parseval’s Formula. Practical Harmonic analysis living systems – WHO Limits – Hardness and its Determination – Boiler
Troubles and their removal – Water Softening Methods – Lime-Soda, Zeolite
Text Book
and Ion Exchange - Municipal Water Treatment-Break Point Chlorination –
1. Scope and Treatment as in “Higher Engineering Mathematics”, by Dr. Desalination of Sea Water – Reverse Osmosis Method, Electro-dialysis.
B.S. Grewal, 43rd Edition, Khanna publishers.
Batteries : Primary batteries: The chemistry - Types: Zinc-carbon
Reference Books (Leclanche type), zinc alkaline (Duracell), zinc/air batteries; Lithium primary
1. Graduate Engineering Mathematics by V B Kumar Vatti., cells – liquid cathode, solid cathode and lithium-ferrous sulphide cells. Sec-
I.K.International publishing house Pvt. Ltd. ondary batteries: Lead acid and VRLA (valve regulated (sealed) lead acid),
2. Advanced Engineering Mathematics by Erwin Kreyszig. nickel-cadmium, nickel-zinc, nickel-metal hydride batteries, lithium ion batter-
3. A text book of Engineering Mathematics, by N.P. Bali and Dr. Manish ies, ultrathin lithium polymer cells. Advanced Batteries for electric vehicles,
Goyal, Lakshmi Publications. requirements of the battery – sodium-beta and redox batteries.
4. Advanced Engineering Mathematics by H.K. Dass. S. Chand Com- Fuel Cells : Fuel Cells: Description, working principle, anodic, cathodic
pany and cell reactions, fabrication of electrodes and other components, applica-
tions, advantages, disadvantages and environmental aspects of the following * Develop one’s reading and writing abilities for enhanced communica-
types of fuel cells: Proton Exchange Membrane Fuel Cells, alkaline fuel cells, tion; and
phosphoric acid, solid oxide, molten carbonate, direct methanol fuel cells- * Learn to apply the topics in real-life situations for creative and critical
Membranes and Fuels use.
Corrosion : Corrosion: Origin and Theory – Types of Corrosion: Chemical
and Electrochemical; Pitting, Inter granular, Waterline, Stress – Galvanic Se- SYLLABUS
ries – Factors Effecting Corrosion. Corrosion Controlling Methods, Protective On the conduct of life: William Hazlitt
Coatings, Metallic Coatings, Electroplating and Electroless Plating. Life skills: Values and Ethics
Green Chemistry and Technology : Introduction and significance of green If: Rudyard Kipling
chemistry, Goals of green chemistry, 12 principles of green chemistry, toxicity
of chemicals, material safety data sheet (MSDS), concept of zero pollution The Brook: Alfred Tennyson
technologies, atom economy, functional toxicity vs non-functional toxicity, func- Life skills: Self-Improvement
tional group approaches to green chemistry, Elimination of toxic functional How I Became a Public Speaker: George Bernard Shaw
group, optimization of frameworks for the design of greener synthetic path- The Death Trap: Saki
ways, Applications of green chemistry - Green solvents, green fuels and
propellants, biocatalysis. Life skills: Time Management
Text Books On saving Time: Seneca
1. Engineering Chemistry – PC Jain and M. Jain – Dhanpath Rai and Chindu Yellama
Sons, New Delhi. Life skills: Innovation
2. A Text book of Engineering Chemistry – S. S. Dara – S. Chand & Co. Muhammad Yunus
New Delhi. Politics and the English Language: George Orwell
3. Hand Book of Green Chemistry and Technology; by James Clarke Life skills: Motivation
and Duncan Macquarrie; Blakwell Publishing.
Dancer with a White Parasol: Ranjana Dave
CS1103 : ENGLISH Grammar: Prepositions – Articles – Noun-Pronoun Agreement, Subject-
Verb Agreement – Misplaced Modifiers–Clichés, Redundancies.
Course Objectives
Vocabulary: Introduction to Word Formation – Root Words from other
* To make students understand the explicit and implicit meanings of a Languages –Prefixes and Suffixes–Synonyms, Antonyms– Common Abbre-
text/topic; viations
* To give exposure to new words and phrases, and aid to use them in Writing: Clauses and Sentences – Punctuation – Principals of Good
different contexts; Writing – Essay Writing – Writing a Summary
* To apply relevant writing formats to draft essays, letters, emails and Writing: Essay Writing
presentations; and
Life skills: Innovation
* To adapt oneself to a given situation and develop a functional approach
to finding solutions: adaptability and problem solving. Muhammad Yunus
Textbook
Course Outcomes 1. Language and Life: A Skills Approach Board of Editors, Orient
* Students will be able to analyse a given text and discover the various Blackswan Publishers, India.2018.
aspects related to language and literature; References
* Learn the various language structures, parts of speech and figures of 1. Practical English Usage, Michael Swan. OUP. 1995.
speech;
2. Remedial English Grammar, F.T. Wood. Macmillan.2007
 3. On Writing Well, William Zinsser. Harper Resource Book. 2001 Arrays & Strings: One, Two-dimensional Arrays, Character Arrays. Dec-
4. Study Writing, Liz Hamp-Lyons and Ben Heasly. Cambridge Univer- laration and initialization of Strings, reading and writing of strings, String han-
sity Press. 2006. dling functions, Table of strings.
5. Communication Skills, Sanjay Kumar and Pushp Lata. Oxford Uni- Functions: Definition of Functions, Return Values and their Types, Func-
versity Press. 2011. tion Calls, Function Declaration, Category of Functions: No Arguments and no
6. Exercises in Spoken English, Parts. I-III. CIEFL, Hyderabad. Oxford Return Values, Arguments but no Return Values, Arguments with Return Val-
University Press. ues, No Argument but Returns a Value, Functions that Return Multiple Values.
Nesting of functions, recursion, passing arrays to functions, passing strings
CS1104 : COMPUTER PROGRAMMING USING C to functions, the scope, visibility and lifetime of variables.
Course Objectives Pointers: Accessing the address of a variable, declaring pointer vari-
* The course is designed to provide complete knowledge of C language. ables, initializing of pointer variables, accessing variables using pointers, chain
* To provide students with understanding of code organization and func- of pointers, pointer expressions, pointers and arrays, pointers and character
tional hierarchical decomposition with using complex data types. strings, array of pointes, pointers as function arguments, functions returning
pointers, pointers to functions, pointers to structures-Program Applications.
* To provide knowledge to the students to develop logics which will help
them to create programs, applications in C. Structure and Unions: Defining a structure, declaring structure variables,
* This course aims to identify tasks in which the numerical techniques accessing structure members, structure initialization, copying and comparing
learned are applicable and apply them to write programs, and hence use structure variables, arrays of structures, arrays within structures, structures
computers effectively to solve the task. within structures, structures and functions and unions, size of structures and
bit-fields- Program applications.
* This course provides the fundamental knowledge which is useful in
understanding the other programming languages. File handling: Defining and opening a file, closing a file, Input/ Output
operations on files, Error handling during I/O operations, random access to
Course Outcomes files and Command Line Arguments- Program Applications.
* Identify basic elements of C programming structures like data types, Text Books
expressions, control statements, various simple functions and apply them in 1. Programming in ANSI C, E Balagurusamy, 6th Edition. McGraw Hill
problem solving. Education (India) Private Limited.
* Apply various operations on derived data types like arrays and strings in
Reference Books
problem solving.
1. Let Us C ,Yashwant Kanetkar, BPB Publications, 5th Edition.
* Design and implement of modular Programming and memory man-
agement using Functions, pointers. 2. Computer Science, A structured programming approach using C”,
* Apply Structure, Unions and File handling techniques to Design and B.A.Forouzan and R.F.Gilberg, “ 3rd Edition, Thomson, 2007.
Solve different engineering programs with minimal complexity. 3. The C –Programming Language’ B.W. Kernighan, Dennis M. Ritchie,
* Apply Numerical methods to Solve the complex Engineering problems. PHI.
4. Scientific Programming: C-Language, Algorithms and Models in Sci-
SYLLABUS ence, Luciano M. Barone (Author), EnzoMarinari (Author), Giovanni Organtini,
Introduction to C: Basic structure of C program, Constants, Variables World Scientific.
and data types, Operators and Expressions, Arithmetic Precedence and asso-
ciativity, Type Conversions. Managing Input and Output Operations Formatted CS1105 : IT ESSENTIALS
Input, Formatted Output. Course Objectives
Decision Making, Branching, Looping: Decision making with if statement, * Select the appropriate computer components to build, repair, or up-
Simple if statement, The if…else statement, Nesting of if…else statement, the grade personal computers.
else.. if ladder, switch statement, the (?:) operator, the GOTO statement., The
while statement, the do statement, The for statement, Jumps in Loops. * Explain how to correctly use tools and safely work in a lab.
 * Install components to build, repair, or upgrade personal computers. Fundamental Security: Explain Why Security Is Important, Describe Se-
* Configure computers to communicate on a network curity Threats, Identify Security Procedures, Identify Common Preventive Main-
tenance Techniques for Security, Troubleshoot Security.
* Configure devices to connect to the Internet and Cloud services
Text books:
* Explain how to use, configure, and manage laptops and mobile devices
1. IT Essentials: PC Hardware and Software Companion Guide Fourth
Course Outcomes Edition, Cisco Networking Academy.
* Understands the roles and responsibilities of the IT professional References:
* Able to Troubleshoot advanced hardware and software problems 1. Network security essentials application and standrads, by William
stallings, 4th edition, prentice hall.
* Provides an experience-oriented course that employs industry-relevant
instructional approaches to prepare students for entry-level jobs in the industry. 2. Mike Meyers’ CompTIA A+ Guide to Managing and Troubleshooting
PCs, Sixth Edition 6th Edition
SYLLABUS
CS1106 : COMMUNICATION SKILLS LAB
Introduction to the Personal Computer Describe a Computer System,
Identify the Names, Purposes, and Characteristics of Cases and Power Sup- Course Objectives
plies, Identify the Names, Purposes, and Characteristics of Internal Compo-
* To make students recognize the sounds of English through Audio-Vi-
nents, Identify the Names, Purposes, and Characteristics of Ports and Cables,
sual aids;
Identify the Names, Purposes, and Characteristics of Input Devices, Identify
the Names, Purposes, and Characteristics of Output Devices, Explain System * To help students build their confidence and help them to overcome their
Resources and Their Purposes. inhibitions and self- consciousness while speaking in English;
Safe Lab Procedures and Tool Use Explain the Purpose of Safe Working * To familiarize the students with stress and intonation and enable them
Conditions and Procedures, Identify Tools and Software Used with Personal to speak English effectively; and
Computer Components and Their Purposes, Implement Proper Tool Use. * To give learners exposure to and practice in speaking in both formal and
Computer Assembly Attach the Components to the Motherboard and informal contexts.
Install the Motherboard, Install Internal Drives, Install Drives in External Bays, Course Outcomes
Install Adapter Cards, Connect the Power Cables Reattach the Side Panels to
the Case, Boot the Computer for the First Time. Basics of Preventive Mainte- * Students will be sensitized towards recognition of English sound pat-
nance and Troubleshooting Explain the Purpose of Preventive Maintenance, terns and the fluency in their speech will be enhanced;
Identify the Steps of the Troubleshooting Process. * A study of the communicative items in the laboratory will help students
Fundamental Laptops and Portable Devices Identify Common Preven- become successful in the competitive world;
tive Maintenance Techniques for Laptops and Portable Devices, Describe How * Students will be able to participate in group activities like roleplays,
to Troubleshoot Laptops and Portable Devices. group discussions and debates; and
Fundamental Operating Systems Explain the Purpose of an Operating * Students will be able to express themselves fluently and accurately in
System, Describe and Compare Operating Systems to Include Purpose, Limi- social as well professional context.
tations, and Compatibilities, Determine Operating System Based on Cus-
tomer Needs, Install an Operating System, Identify and Apply Common Pre- SYLLABUS
ventive Maintenance Techniques for Operating Systems, Troubleshoot Oper- Introduction to Phonetics: The Sounds of English (Speech sound – vow-
ating Systems. els and consonants) - Stress and Intonation - Accent and Rhythm.
Fundamental Networks Explain the Principles of Networking, Describe Listening Skills: Listening for gist and specific information - listening for
Types of Networks, Describe Basic Networking Concepts and Technologies, Note taking, summarizing and for opinions - Listening to the speeches of
Describe the Physical Components of a Network, Describe LAN Topologies eminent personalities.
and Architectures.
 Speaking Skills: Self-introduction - Conversation Skills (Introducing and 2. Hardware Troubleshooting: Students have to be given a PC which
taking leave) - Giving and asking for information - Role Play - Just A Minute does not boot due to improper assembly or defective peripherals. They should
(JAM) session - Telephone etiquette. identify the problem and fix it to get the computer back to working condition.
Reading and Writing skills: Reading Comprehension – Précis Writing - 3. Software Troubleshooting: Students have to be given a malfunction-
E-Mail writing - Punctuation. ing CPU due to system software problems. They should identify the problem
Presentation skills: Verbal and non-verbal communication - Body Lan- and fix it to get the computer back to working condition.
guage - Making a Presentation 4. Cyber Hygiene: Students should learn about viruses on the internet
Reference Books and install antivirus software. Student should learn to customize the browsers
1. Ashraf Rizvi. Effective Technical Communication. Tata McGraw Hill to block pop ups, block active x downloads to avoid viruses and/or worms.
Education Private Limited, New Delhi. 5. Web Browsers, Surfing the Web: Students customize their web brows-
2. Speak Well. Orient Blackswan Publishers, Hyderabad. ers with the LAN proxy settings, bookmarks, search toolbars and popup
blockers.
3. Allan Pease. Body Language. Manjul Publishing House, New Delhi.
Module III – MS-Office
CS1107 : COMPUTER ENGINEERING WORKSHOP LAB
1. MS Word - Features to be covered: Formatting Fonts in word, Drop
Course Objectives Cap in word, Applying Text effects, Using Character Spacing, Borders and
Colours, Inserting Header and Footer, Using Date.
* Explain the internal parts of a computer, peripherals, I/O ports, connect-
ing cables 2. Creating project abstract Features to be covered: Formatting Styles,
inserting table, Bullets and Numbering, Changing Text Direction, Cell align-
* Demonstrate basic command line interface commands on LINUX
ment, Footnote, Hyperlink, Symbols, Spell Check, Track Changes.
* Teach the usage of Internet for productivity and self-paced lifelong learning
3. Creating a Newsletter: Features to be covered: Table of Content, News-
* Describe about Compression, Multimedia and Antivirus tools paper columns, Images from files and clipart, Drawing toolbar and Word Art,
* Demonstrate Office Tools such as Word processors, Spreadsheets Formatting Images, Textboxes, Paragraphs in word.
and Presentation tools 4. Spreadsheet Orientation: Accessing, overview of toolbars, saving
Course Outcomes spreadsheet files, Using help and resources. Creating a Scheduler: Gridlines,
Format Cells, Summation, auto fill, Formatting Text.
* Assemble and disassemble components of a PC
5. Calculating GPA - Features to be covered: Cell Referencing, Formu-
* Construct a fully functional virtual machine, Summarize various LINUX lae in spreadsheet – average, std. deviation, Charts, Renaming and Inserting
operating system commands. worksheets, Hyper linking, Count function, Sorting, Conditional formatting.
* Able to Troubleshoot hardware and software problems. 6. Creating Power Point: Student should work on basic power point
SYLLABUS utilities and tools in Latex and Ms Office/equivalent (FOSS) which help them
create basic power point presentation. PPT Orientation, Slide Layouts, Insert-
Module I – Hardware Concepts ing Text, Formatting Text, Bullets and Numbering, Auto Shapes, Lines and
1. Every student should identify the peripherals of a computer, compo- Arrows, Hyperlinks, Inserting Images, Tables and charts.
nents in a CPU and its functions. Draw the block diagram of the CPU along CS1108 : Computer Programming Using C Lab
with the configuration of each peripheral and submit to your instructor. Every
student should disassemble and assemble the PC back to working condition. Course Objectives
Module II – Software Installations * To impart writing skill of C programming to the students and solving
problems.
1. Every student should individually install operating system like LINUX
or MS windows on the personal computer. The system should be configured * To write and execute programs in C to solve problems such as Modularize
as dual boot with both windows and LINUX. the problems into small modules and then convert them into programs.,
 * To write and execute programs in C to solve problems such as arrays, 13. Binary Files, Random Accessing of Files, Enum, Typedef, Pre-pro-
files, strings, structures and different numerical methods. cessor Commands.
* This reference has been prepared for the beginners to help them under- 14. Numerical methods: Bisection method, Newton Raphson method,
stand the basic to advanced concepts related to Objective-C Programming Lagrange’s interpolation, Simpson’s rule for numerical integration.
languages. References:
Course Outcomes 1. Programming in ANSI C, E Balagurusamy, 6th Edition. McGraw Hill
Education (India) Private Limited.
* Understand various computer components, Installation of software. C
programming development environment, compiling, debugging, and linking 2. Introduction to Numerical Methods, SS Sastry, Prentice Hall
and executing a program using the development environment.
I Year-II Semester
* Analysing the complexity of problems, Modularize the problems into
small modules and then convert them into programs. CS1201 : ENGINEERING MATHEMATICS – II
* Construct programs that demonstrate effective use of C features includ-
Course Objectives
ing arrays, strings, structures, pointers and files.
* The way of obtaining rank, eigen values and eigen vectors of a matrix.
* Apply and practice logical ability to solve the real-world problems.
* To know the importance of Cayley-Hamilton theorem and getting ca-
* Apply Numerical methods to Solve the complex Engineering problems. nonical form from a given quadratic form.
SYLLABUS * To solve the system of equations by using direct and indirect methods.
Practice the following concepts with algorithm, flow chart and implemen- * To solve first order and higher order differential equations by various
tation. methods.
1. C – Tokens, Data Types - Format Specifiers, I/O Statements. * To obtain the Laplace transforms and inverse Laplace transforms for a
2. Operators in C, their Precedence and Associativity, Arithmetic Expres- given functions and their applications.
sions/Instructions, Type casting, Math.h functions. Course Outcomes
3. Control Statements (Conditional): If and its Variants, Switch (Break). * Find rank, eigen values and eigen vectors of a matrix and understand
4. Goto Statement, Control Statements (Looping): While, Do-While, For the importance of Cayley- Hamilton theorem.
Loop, Continue & Break (Unconditional), Nested Loops * Reduce quadratic form to canonical forms and solving linear systems
5. Arrays, One Dimensional Array: Declaration and Initialization, Access- by direct and indirect methods.
ing Array Elements. * Demonstrate solutions to first order differential equations by various
6. Two Dimensional Array: Declaration and Initialization, Accessing Ar- methods and solve basic applications problems related to electrical circuits,
ray Elements. orthogonal trajectories and Newton’s law of cooling
7. Strings: Read & Write, “String.h” Predefined Functions, without pre- * Discriminate among the structure and procedure of solving higher order
defined functions. differential equations with constant and variable coefficients.
8. Pointers: Declarations, Types, Pointers to Arrays, Pointers to Charac- * Understand Laplace transforms and its properties and finding the solu-
ter Strings, Pointers to Pointers, Array of Pointers tion of ordinary differential equations.
9. Structures: Nested Structures, Pointers to Structures, Unions.
SYLLABUS
10. Functions: Function Declaration, Classification (Arguments and Re-
Linear Algebra: Rank of a matrix- Echelon form, Normal Form - Solution
turn Type), Storage Classes.
of Linear System of Equations - Consistency of Linear System of Equations -
11. Parameter Passing Techniques, Passing Parameters Types, Recur- Direct & Indirect Methods: Gauss elimination method, LU Factorization method,
sion Gauss Seidal Method. Complex Matrices: Hermitian, Skew-Hermitian and
12. Files: Opening, Closing of Files, Reading and Writing of Files. Unitary Matrices and their Properties.
 Eigen Values and Eigen Vectors: Eigen Values and Eigen Vectors of a * To grasp the concepts of physics for electromagnetism and its applica-
Matrix - Cayley-Hamilton theorem - Inverse and Powers of a Matrix using Cayley- tion to engineering. Learn production of Ultrasonics and their applications in
Hamilton’s theorem and its applications. Diagonalization of a Matrix - Qua- engineering.
dratic Forms - Reduction of Quadratic Form to Canonical Form - Nature of a * To Develop understanding of interference, diffraction and polarization:
Quadratic Form. connect it to a few engineering applications.
Ordinary Differential Equations of First Order and its Applications: For- * To Learn basics of lasers and optical fibres and their use in some
mation of ordinary differential equations (ODEs) - Solution of an ordinary differ- applications.
ential equation - Equations of the first order and first degree - Linear differen-
* To Understand concepts and principles in quantum mechanics and
tial equation - Bernoulli’s equation - Exact differential equations - Equations
Nanophase Materials. Relate them to some applications.
reducible to exact equations - Orthogonal Trajectories - Simple Electric (LR &
CR) Circuits - Newton’s Law of Cooling - Law of Natural growth and decay. Course Outcomes
Differential Equations of Higher Order: Solutions of Linear Ordinary Dif- * Understand the fundamentals of Thermodynamics and Laws of ther-
ferential Equations with Constant Coefficients - Rules for finding the compli- modynamics. Understand the working of Carnot cycle and concept of entropy.
mentary function - Rules for finding the particular integral - Method of variation
* Gain Knowledge on the basic concepts of electric and magnetic fields.
of parameters - Cauchy’s linear equation - Legendre’s linear equation - Si-
Understand the concept of the nature of magnetic materials. Gain knowledge
multaneous linear differential equations.
on electromagnetic induction and its applications.
Laplace Transforms: Introduction - Existence Conditions - Transforms of
* Understand the Theory of Superposition of waves. Understand the for-
Elementary Functions - Properties of Laplace Transforms - Transforms of
mation of Newton’s rings and the working of Michelson’s interferometer. Re-
Derivatives - Transforms of Integrals - Multiplication by tn - Division by t –
member the basics of diffraction, Evaluate the path difference. Analysis of
Evaluation of integrals by Laplace Transforms - Inverse Laplace Transform -
Fraunhofer Diffraction due to a single slit
Applications of Laplace Transforms to Ordinary Differential Equations - Simul-
taneous Linear Differential Equations with Constant Coefficients - Second * Understand the interaction of matter with radiation, Characteristics of
Shifting Theorem - Laplace Transforms of Unit Step Function, Unit Impulse Lasers, Principle, working schemes of Laser and Principle of Optical Fibre.
Function and Laplace Transforms of Periodic Functions. Realize their role in optical fibre communication.
Text Book * Understand the intuitive ideas of the Quantum physics and understand
dual nature of matter. Compute Eigen values, Eigen functions, momentum of
1. Scope and Treatment as in “Higher Engineering Mathematics”, by Dr.
B.S. Grewal, 43rd edition, Khanna publishers. Atomic and subatomic particles using Time independent one-Dimensional
Schrodinger’s wave equation. Understand the fundamentals and synthesis
Reference Books processes of Nanophase materials.
1. Graduate Engineering Mathematics by V B Kumar Vatti., I.K. Interna-
tional publishing house Pvt. Ltd. SYLLABUS
2. Advanced Engineering Mathematics by Erwin Kreyszig. Thermodynamics: Introduction, Heat and Work, First law of thermody-
3. A text book of Engineering Mathematics, by N.P. Bali and Dr. Manish namics and applications, Reversible and Irreversible process, Carnot cycle
Goyal. Lakshmi Publications. and Efficiency, Second law of thermodynamics, Carnot’s Theorem, Entropy,
Second law in terms of entropy, Entropy and disorder, Third law of thermody-
4. Advanced Engineering Mathematics by H.K. Dass. S. Chand Company.
namics (statement only).
5. Higher Engineering Mathematics by B.V. Ramana, Tata Mc Graw Hill
Electromagnetism: Concept of electric flux, Gauss’s law - some applica-
Company.
tions, Magnetic field - Magnetic force on current, torque on current loop, The
CS1202 : ENGINERING PHYSICS Biot-Savart’s Law, B near a long wire, B for a circular Current loop, Ampere’s
law, B for a solenoid, Hall effect, Faraday’s law of induction, Lenz’s law, In-
Course Objectives duced magnetic fields, Displacement current, Maxwell’s equations (no deriva-
* To impart knowledge in basic concept of physics of Thermodynamics tion), Magnetic materials: Classification of magnetic materials and properties.
relevant to engineering applications.

190
 Ultrasonics: Introduction, Production of Ultrasonics – Piezoelectric and * To provide theory of PN junction diode, its characteristics and applica-
Magnetostriction methods, acoustic grating, applications of ultrasonics. tions
Optics * To introduce basics of rectifying circuits and bipolar junction transistor
Interference: Principles of superposition – Young’s Experiment – Coher- * To provide basics of transistor biasing, transistor amplifiers and field
ence - Interference in thin films (reflected light), Newton’s Rings, Michelson effect transistors
Interferometer and its applications. Course Outcomes
Diffraction: Introduction, Differences between interference and diffraction, By the end of the course, the student should be able to:
Fresnel and Fraunhofer diffraction, Fraunhofer diffraction at a single slit (Quali-
* Explain the basics of semiconductors and their classification
tative and quantitative treatment).
* Understand the theory of PN junction diode, rectifying circuits and bipo-
Polarisation: Polarisation by reflection, refraction and double refraction in
lar junction transistor
uniaxial crystals, Nicol prism, Quarter and Half wave plate, circular and ellipti-
cal polarization. * Explain the concepts of transistor biasing, transistor amplifiers and field
effect transistors
Lasers And Fibre Optics: Introduction, characteristics of a laser beam,
spontaneous and stimulated emission of radiation, population inversion, Ruby SYLLABUS
laser, He-Ne laser, Semiconductor laser, applications of lasers Introduction to
Introduction to Electronics and Semiconductors: Energy band theory,
optical fibres, principle of propagation of light in optical fibres, Acceptance
Angle and cone of a fibre, Numerical aperture, Modes of propagations, classi- Conduction in Insulators, Semiconductors and metals, Electron emission from
fication of fibres, Fibre optics in communications, Application of optical fibres. metals, Classification of semiconductors, Carrier concentration in an intrinsic
semiconductor, Properties of intrinsic semiconductor, Drift and diffusion cur-
Modern Physics : Introduction, De Broglie concept of matter waves, rents.
Heisenberg uncertainty principle, Schrodinger time independent wave equa-
Semi-Conductor Diode: Theory of PN junction diode, Open circuited PN
tion, application to a particle in a box. Free electron theory of metals, Kronig -
junction, V-I characteristics of a PN diode, Diode current equation, Transition
Penney model (qualitative treatment), Origin of energy band formation in solids,
Classification of materials into conductors, semi-conductors and insulators. and diffusion capacitances, Break down in PN diode, Applications of PN di-
odes. Zener diode, Zener regulator, Tunnel diode, Schottky diode.
Nanophase Materials: Introduction, properties, Top-down and bottom-up
Rectifying circuits: Half wave and full wave rectifiers, Bridge rectifiers,
approaches, Synthesis - Ball milling, Chemical vapour deposition method, sol-
gel methods, Applications of nano materials. Efficiency, Ripple and regulation of each rectifier, Capacitor filters.
Bipolar Junction Transistor: Introduction, construction, Operation of PNP
Text Books
and NPN Transistors – Transistor Circuit configurations- Characteristics of a
1. Physics by David Halliday and Robert Resnick – Part I and Part II -
CE configurations – h parameters, low frequency small signal equivalent cir-
Wiley.
cuit of a Transistor.
2. A textbook of Engineering Physics, Dr. M. N. Avadhanulu, Dr. P.G.
Transistor Biasing and thermal stabilization: Transistor Biasing, Stabili-
Kshirsagar - S. Chand
zation, Different methods of transistor biasing – Fixed bias, Collector feedback
3. Engineering Physics by R.K. Gaurand S.L. Gupta–Dhanpat Rai bias – self bias – Bias compensation.
Reference Books Transistor Amplifiers: CE, CB, CC amplifier configurations –Multistage
1. Modern Engineering Physics by A.S. Vadudeva amplifier – A Two Stage RC coupled amplifier – frequency response curve and
2. University Physics by Young and Freedman bandwidth.
Field Effect Transistors: Junction Field Effect Transistors (JFET) – JFET
CS1203 : ELEMENTS OF ELECTRONICS ENGINEERING characteristics, JFET Parameters, Small signal equivalent circuit – MOSFETS
Course Objectives – Depletion and Enhancement MOSFETS.
* Introduce students to basics of semiconductors, their classification and Text Books:
properties 1. Electronic Device and Circuits by Sanjeev Guptha.

191
Reference Books: Searching: Basic Searching Techniques: Dictionary as an Abstract Data
1. Electronic Device and Circuits Theory by Robert L. Boylested Elec- Type, Algorithmic Notation, Sequential Searching and its Efficiency, Binary
tronic Device and Circuits by David. A. Bell Search, Interpolation Search.
Sorting: General Background: Efficiency, Asymptotic Notations, Efficiency
CS1204 : DATA STRUCTURES USING C of Sorting, Bubble Sort and Quick Sort and their Efficiency, Selection Sorting,
Course objectives Binary Tree Sort, Heap Sort, Insertion Sorts, Shell Sort, Address calculation
Sort, Merge and Radix Sorts.
* Assess how the choice of data structures and algorithm design meth-
ods impacts the performance of programs. Graphs and Their Application: Definition of Graphs, Representation of
Graphs, Transitive closure, Linked Representation of Graphs, Topological
* Choose the appropriate data structure and algorithm design method for
Ordering of nodes, Graph Traversal and Spanning Forests, Undirected Graphs
a specified application. and their Traversals, Applications of Graphs, Minimal Spanning Trees.
* Solve problems using data structures such as linear lists, stacks,
Textbooks
queues, binary trees, heaps binary search trees, and graphs and writing pro-
grams for these solutions. 1. Data Structures Using C and C++ Yddish Langsam, Moshe J.
Augenstein and Aaron M.Tanenbaum, Prentice Hall Of India (2nd Edition)
Course outcomes 2. Data Structures, Algorithms and Applications with C++, Sahani Mc-
* Describe how arrays, records, linked structures, stacks, queues, trees, Graw Hill.
and graphs are represented in memory and used by algorithm.
CS1205 : DIGITAL LOGIC DESIGN
* Demonstrate different methods for traversing trees.
* Compare alternative implementations of data structures with respect to Course objectives
performance. * To introduce the basic principles for design of combinational circuit and
* Discuss the computational efficiency of the principal algorithms for sort- sequential circuits.
ing and searching * To learn simple digital circuits in preparation for computer engineering.
SYLLABUS Course Outcomes
Introduction to Data Structures: Review of C Programming, Recursive A student who successfully fulfils the course requirements will have dem-
Definition and Processes, Recursion in C, Simulation of Recursion, Efficiency onstrated:
of Recursion, Abstract Data Types, Meaning and Definition of Data Structures, * An ability to define different number systems, binary addition and sub-
Arrays. traction, 2’s complement representation and operations with this representa-
Stacks: Stack as an Abstract Data Type, Primitive Operations, Implement- tion.
ing Stack Operations using Arrays, Infix, Postfix and Prefix: Definitions, Evalua- * An ability to understand the different Boolean algebra theorems and
tion and Conversions. apply them for logic functions.
Queues: Queue as an Abstract Data Type, Sequential Representation, * An ability to define the Karnaugh map for a few variables and perform an
Types of Queues, Operations, Implementation using Arrays. algorithmic reduction of logic functions.
Linked List: Operations, Implementation of Stacks, Queues and priority * An ability to define the following combinational circuits: multiplexer, de-
Queues using Linked Lists+, Circular Lists: Insertion, Deletion and Concat- multiplexers encoders/decoders, comparators, arithmetic-logic units; and to
enation Operations, Stacks and Queues as Circular Lists, Doubly Linked Lists. be able to build simple circuits.
Trees: Binary Trees - Definitions and Operations, Binary Tree Represen- * An ability to understand asynchronous and synchronous sequential
tation: Node Representation, Implicit array Representation, Binary Tree Tra- circuits, like counters and shift registers.
versal, Threaded Binary Trees and their Traversal, Trees and their Applica-
* An ability to understand memories like RAM and ROM, Programmable
tions; Tree Searching: Insertion and Deletion of a node from a Binary Search
Logic Array and Programmable Array Logic.
Tree, Efficiency of Binary Search Tree operations.

192
 SYLLABUS Course Outcomes
Binary Systems: Digital Systems. Binary Numbers. Number Base Con- * The student learns about LINUX features for multiuser, multitasking
versions. Octal and Hexadecimal Numbers. Complements. Signed Binary capabilities.
Numbers. Binary Codes. Binary Storage and Registers. Binary Logic * The student learns about file system organization, file and directory
Boolean Algebra and Logic Gates: Basic Definitions. Axiomatic Defini- manipulation, setting file permissions, and disk free space administration.
tion of Boolean Algebra. Basic Theorems and Properties of Boolean Algebra. * The student learns about writing shell scripts for different applications.
Boolean Functions. Canonical and Standard Forms. Other Logic Operations. * The student learns about how users communicate with each other in
Digital Logic Gates. Integrated Circuits.
LINUX environment.
Combinational Logic Design, Gate-Level Minimization: The Map Method.
Four Variable Map. Five-Variable Map. Product of Sums Simplification. Don’t- SYLLABUS
Care Conditions. NAND and NOR Implementation. Other Two- Level Imple- 1) Study and practice on file system / handling files with commands,
mentations. Exclusive-OR Function. Hardware Description Language (HDL). syntax, usage, application.
Combinational Logic: Combinational Circuits. Analysis Procedure. De- 2) Practice on vi editor.
sign Procedure. Binary Adder Subtractor. Decimal Adder. Binary Multiplier. Mag-
3) Study and practice on redirection operators with relevant commands,
nitude Comparator. Decoders. Encoders. Multiplexers. HDL For Combina-
syntax, usage, application.
tional Circuits.
4) Study and practice on filters with relevant commands, syntax, usage,
Sequential Logic Design, Synchronous Sequential Logic: Sequential
application.
Circuits. Latches Flipflops. Analysis of Clocked Sequential Circuits. HDL For
Sequential Circuits. State Reduction and Assignment. Design Procedure. 5) Study and practice on Backup with relevant commands, syntax, us-
age, application.
Registers ad Counters: Registers. Shift Registers. Ripple Counters. Syn-
chronous Counters. Other Counters. HDL for Registers and Counters. 6) Study and practice on internet related commands, syntax, usage,
application.
Memory and Programmable Logic: Introduction. Random-Access
Memory. Memory Decoding, Error Detection and Correction. Read-Only Memory. 7) Study and practice on shells/shell programming with relevant pro-
Programmable Logic Array. Programmable Array Logic. Sequential Program- gramming constructs, syntax, usage, application.
mable Devices. 8) Study and practice on awk with relevant commands, syntax, usage,
Text Book application.
1. DigitalDesign,3rdEdition, M. Morris Mano, Pearson Education. 9) Study and practice on regular expressions and the grep family with
relevant commands, syntax, usage, application.
Reference Books
1. Digital Logic Design Principles, Norman Balabanian & Bradley 10) Study and practice on compilation process of C programs under UNIX.
Carlson, John Wiley &Sons (Asia) Pvt.Ltd.,2002 References:
2. Fundamentals of Digital Logic with VHDL Design, Stephen Brown 1. Unix concepts and applications by Sumitabha Das, TMH Publications.
and ZvonkoVranesic, TataMcGraw-HillEdition,2002. 2. Shell programming by Yashwanth Kanetkar.
CS1206 : LINUX ADMINISTRATION LAB CS1207 : ENGINNERING PHYSICS LAB
Course Objectives Course Objectives
* To understand LINUX operating system and its internals. * To enable the students to acquire skill, technique and utilization of the
* To understand LINUX file system structure and its operations. Instruments
* To understand LINUX shell environment and its programming. * Draw the relevance between the theoretical knowledge and to imply it in
* To understand communication in LINUX and the corresponding primi- a practical manner with respect to analyse various electronic circuits and its
components.
tives.

193
 * To impart the practical knowledge in basic concepts of Wave optics, CS1208 : DATA STRUCTURES LAB
Lasers and fibre optics.
Course Objectives
* To familiarize the handling of basic physical apparatus like Vernier cal-
lipers, screw gauge, spectrometers, travelling microscope, laser device, opti- * To implement stacks and queues using arrays and linked lists.
cal fibre, etc. * To develop programs for searching and sorting algorithms.
Course Outcomes * To write programs using concepts of various trees.
* Ability to design and conduct experiments as well as to analyse and * To implement programs using graphs.
interpret Course Outcomes
* Ability to apply experimental skills to determine the physical quantities * Student will be able to write programs to implement stacks and queues.
related to Heat, Electromagnetism and Optics
* Ability to implement various searching and sorting techniques.
* The student will learn to draw the relevance between theoretical knowl-
* Ability to implement programs using trees and graphs.
edge and the means to imply it in a practical manner by performing various
relative experiments. SYLLABUS
SYLLABUS List of Programs:
1. Determination of Radius of Curvature of a given Convex Lens By 1. Write a C program for sorting a list using Bubble sort and then apply
forming Newton’s Rings. binary search.
2. Determination of Wavelength of Spectral Lines in the Mercury Spec- 2. Write a C program for implementing the operations of a queue.
trum by Normal Incidence method.
3. Write a C program to implement the operations on priority queues.
3. Study the Intensity Variation of the Magnetic Field along axis of Current
4. Write a C to implement the operations on circular queues.
Carrying Circular Coil.
5. Write a C program to implement the operations on stacks.
4. Determination of Cauchy’s Constants of a Given Material of the Prism
using Spectrometer. 6. Write a C program for evaluating a given postfix expression using
stack.
5. Determination of Refractive Index of Ordinary ray ?o and Extraordinary
?e ray. 7. Write a C program for converting a given infix expression to postfix
form using stack.
6. Determination of Thickness Given Paper Strip by Wedge Method.
8. Write a C program to implement the operations on single linked list.
7. Calibration of Low Range Voltmeter.
9. Write a C program for demonstrate operations on double linked list.
8. Calibration of Low Range Ammeter.
10. Write a C program for the representation of polynomials using circu-
9. Determination of Magnetic Moment and Horizontal Component of
lar linked list and for the addition of two such polynomials
Earth’s Magnetic Field.
11. Write a C program to create a binary search tree and for implement-
10. Lees Method - Coefficient of thermal Conductivity of a Bad Conductor.
ing the in order, Pre order, post order traversal using recursion
11. Carey Foster’s Bridge – Verification of laws of Resistance and Deter-
12. a) Write a C program for finding the transitive closure of a digraph b)
mination of Specific Resistance.
Write a C program for finding the shortest path from a given source to any
12. Melde’s Apparatus – Frequency of electrically maintained Tuning Fork. vertex in a digraph using Dijkstra’s algorithm.
13. Photoelectric cell-Characteristics. 13. a) Write a C program for finding the Depth First Search of a graph. b)
14. Planks Constants. Write a C program for finding the Breadth First Search of a graph
15. Laser- Diffraction. References:
1. Data Structures Using C and C++ Yddish Langsam, Moshe J.
Augenstein and Aaron M.Tanenbaum, Prentice Hall Of India (2nd Edition)

194
 2. Data Structures, Algorithms and Applications with C++, Sahani Mc- eralized Permutations and Combinations, Generating Permutations and Com-
Graw Hill. binations.
Advanced Counting Techniques: Recurrence Relations, Solving Linear
II Year - I Semester
Recurrence Relations, Divide-and-Conquer Algorithms and Recursion Rela-
CS2101 : DISCRETE MATHEMATICAL STRUCTURES tions, Generating Functions, Inclusion-Exclusion, and Applications of Inclu-
Course Objectives sion-Exclusion.
* To understand mathematical arguments using logical connectives and Relations: Relations and their properties, n-ary relations, applications,
quantifiers and verify the validity of logical flow of arguments using proposi- Representation, closure, equivalence relations, Partial orderings.
tional, predicate logic and truth tables. Graphs: Graphs and Graph Models, Graph Terminology and Special Types
* To understand about permutations and combinations. of Graphs, Representing Graphs and Graph Isomorphism, Connectivity, Euler
and Hamilton Paths, Shortest-Path Problems, Planar Graphs, Graph Colouring.
* To understand various types of relations and discuss various properties
of the relations. Trees: Introduction to Trees, Applications of Trees, Tree Traversal, Span-
ning Trees, Minimum Spanning Trees,
* To study the graphs, graph isomorphism and spanning trees.
* To study about Boolean algebra and Finite State Machines. Boolean Algebra: Boolean Functions, Representing Boolean Functions,
Logic Gates, Minimization of Circuits
Course Outcomes Modelling Computation: Languages and Grammars, Finite-State Ma-
At the end of the course student will be able to chines with Output, Finite-State Machines with No Output, Language Recogni-
* Rewrite mathematical arguments using logical connectives and quan- tion, Turing Machines.
tifiers and verify the validity of logical flow of arguments using propositional, Text Book
predicate logic. 1. Discrete Mathematics & Its Applications with Combinatorics and Graph
* Identify and give examples of various types of relations and describe Theory by Kenneth H Rosen, Tata McGraw-Hill Publishing Company Ltd., New
various properties of the relations. Delhi.
* Ability to solve problems using permutations and combinations. Reference Books
* Determine isomorphism of graphs and spanning tree of a given graph 1. Discrete Mathematics for Computer Scientists & Mathematicians by
using BFS/DFS algorithms. Also determine minimal spanning tree of a given Joe L. Mott, Abraham Kandel, Theodore P. Baker, Prentice-Hall, India.
graph. 2. Discrete Mathematics by Richard Johnson Baug, Pearson Educa-
tion, New Delhi.
SYLLABUS 3. Discrete and Combinatorial Mathematics by Ralph. G. Grimaldi,
The Foundations-Logic and Proofs: Propositional Logic, Propositional Pearson Education, New Delhi.
Equivalences, Predicates and Quantifiers, Nested Quantifiers Rules of Infer-
ence, Introduction to Proofs, Proof Methods and Strategy, Basic Structures- CS2102 : COMPUTER ORGANIZATION AND ARCHITECTURE
Sets, Functions, Sequences and Sums: Sets, Set Operations, Functions, Se-
Course Objectives
quences and Summations.
* To study about structure and functional components of a computer.
The Fundamentals-Algorithms, the Integers and Matrices: Algorithms,
The Growth of Functions, Complexity of Algorithms, The Integers and Division, * Understanding the hierarchical organization of a computer system which
Primes and Greatest Common Devisors, Integers and Algorithms, Applica- consists of instruction set of commands.
tions of Number Theory, Matrices. * Learn about the architecture of a computer from a programming view.
Induction and Recursion: Mathematical Induction, Strong Induction and * To design a balance system that minimizes performance and utilization
Well-Ordering, Recursive Definitions and Structural Induction, Recursive Algo- of all elements.
rithms, Program Correctness. Counting: The Basics of Counting, The Pigeon-
hole Principle, Permutations and Combinations, Binomial Coefficients, Gen-

195
Course Outcomes Reference Books
By the end of the course, the student should be able to: 1. Computer Architecture and Organization, William Stallings, PHI Pvt.
Ltd., Eastern Economy Edition, Sixth Edition, 2003.
* Demonstrate knowledge about major components of a computer such
as processor, memory and I/O modules along with their interconnections in- 2. Computer Organization and Architecture, Linda Null, Julia Lobur,
ternally with outside world. Narosa Publications ISBN81- 7319-609-5
* have detailed idea about architecture of central processing unit, func- 3. Computer System Architecture”, John. P.Hayes.
tions of control unit, memory, I/O devices and their issues.
CS2103 : PROBABILITY, STATISTICS AND QUEUING THEORY
* Understand simple and multiple processor organization and their is-
sues. Course objectives
* To provide foundations of probabilistic and statistical analysis
SYLLABUS
* To provide an understanding on concepts of probability, random vari-
Register Transfer and Micro operations: Register Transfer Language,
ables, probability distributions, sampling, estimation, hypothesis testing, re-
Register Transfer, Bus and Memory Transfers, Arithmetic Micro operations,
gression, correlation, multiple regression, hypothesis testing, sample test,
Logic Micro operations, Shift Micro operations, Arithmetic Logic Shift Unit.
queuing methods
Basic Computer Organization and Design: Instruction Codes, Computer
* To explore applications of probabilistic and statistical tools to solve real
Registers, Computer Instructions, Timing and Control, Instruction Cycle,
world problems.
Memory-Reference Instructions, Input- Output and Interrupt, Complete Com-
puter Description, Design of Basic Computer, Design of Accumulator Logic. Course outcomes
Micro programmed Control: Control Memory, Address Sequencing, Mi- After completion of the course the student should be able to:
cro program Example, Design of Control Unit.
* Define and explain basic concepts in probability theory and how to trans-
Central Processing Unit: Introduction, General Register Organization, late real-world problems into probability models
Stack Organization, Instruction Formats, Addressing Modes, Data Transfer
* Solve standard problems that include random variables, discrete and
and Manipulation, Program Control, Reduced Instruction Set Computer (RISC),
continuous probability distributions
Architecture and Programming of 8085 Microprocessor
* Perform Test of Hypothesis and construct a confidence interval to esti-
Pipeline and Vector Processing: Parallel Processing, Pipelining, Arith-
mate population parameters
metic Pipeline, Instruction Pipeline, RISK Pipeline, Vector Processing, Array
Processors. * Compute and interpret the results of Correlation Analysis, Multivariate
Regression, Chi-Square test for Independence and Goodness of Fit
Input/output Organization: Peripheral Devices, I/O interface, Asynchro-
nous data transfer, Modes of transfer, priority Interrupt, Direct memory access, * Explain basic concepts in Markov processes, M/M/1 and M/M/C queue-
Input-Output Processor (IOP), Serial Communication. ing systems.
Memory Organization: Memory Hierarchy, Main memory, Auxiliary memory, SYLLABUS
Associate Memory, Cache Memory, and Virtual memory, Memory Management
Probability: Definitions of probability, Addition theorem, Conditional prob-
Hardware.
ability, Multiplication theorem, Bayes Theorem of Probability and Geometric
Text Books Probability.
1. Computer System Architecture, M. Morris Mano, Prentice Hall of India Random variables and their properties: Discrete Random Variable, Con-
Pvt. Ltd., Third Edition, Sept.2008. tinuous Random Variable, Probability Distribution, Joint Probability Distribu-
2. Computer Architecture and Organization, P.Chakraborty. tions their Properties, Transformation Variables, Mathematical Expectations,
3. Microprocessor Architecture, Programming and Applications with the Probability Generating Functions.
8085by Ramesh S Gaonkar Probability Distributions: Discrete Distributions: Binomial, Poisson
Negative Binominal Distributions and Their Properties; Continuous Distribu-

196
tions: Uniform, Normal, Exponential Distributions And Their Properties. * Learn memory hierarchy, allocation and deallocation policies and mecha-
Multivariate Analysis: Correlation, Correlation Coefficient, Rank Corre- nism for main and auxiliary memory, file system design and implementation
lation, Regression Analysis, Multiple Regression, Attributes, Coefficient Of issues.
Association, Chi Square Test For Goodness Of Fit, Test For Independence. * investigate UNIX/ LINUX and Windows OS platforms w.r.t similarities
Estimation: Sample, Populations, Statistic, Parameter, Sampling Distri- and differences in design philosophies.
bution, Standard Error, Un- biasedness, Efficiency, Maximum Likelihood Esti-
SYLLABUS
mator, Notion & Interval Estimation.
Introduction to Operating Systems: Over View of Operating Systems,
Testing of Hypothesis: Formulation of Null hypothesis, critic al region,
Types of Operating Systems, Operating System Structures, Operating System
level of significance, power of the test;
Services, System Calls, Virtual Machines, Operating System Design and Imple-
Sample Tests: Small Sample Tests: Testing equality of means, testing mentation.
equality of variances, test of correlation coefficient, test for Regression Coeffi-
Process Management: Process Concepts, Operations on Processes,
cient; Large Sample tests: Tests based on normal distribution
Cooperating Processes, Threads, Inter Process Communication, Process
Queuing Theory: Queue description, characteristics of a queuing model, Scheduling, Scheduling Algorithms, Multiple- Processor Scheduling, Thread
study state solutions of M/M/1: Model, M/M/1; N Model, M/M/C: Model, M/M/C: N Scheduling.
Model, Case studies.
Process Synchronization: The Critical Section Problem, Peterson’s So-
Text Books lution, Synchronization Hardware, Semaphores, Classical Problems of Syn-
1. Probability & Statistics for Engineers and Scientists, Walpole, Myers, chronization, Critical Regions, Monitors.
Myers, Ye. Pearson Education. Deadlocks: System Model, Deadlock Characterization, Methods For Han-
2. Probability, Statistics and Random Processes T.Veerarajan Tata dling Deadlocks, Deadlock Prevention, Avoidance, Deadlock Detection, Re-
McGraw – Hill covery from Deadlocks.
Reference Book Memory Management: Logical versus Physical Address, Swapping, con-
1. Probability & Statistics with Reliability, Queuing and Computer Appli- tiguous memory allocation, paging, structure of the page table, segmentation,
cations, Kishor S. Trivedi, Prentice Hall of India ,1999 Virtual Memory, Demand Paging, Page Replacement, Allocation of Frames,
Thrashing, Memory-Mapped files.
CS2104 : OPERATING SYSTEMS
File Systems, Implementation, and Secondary-storage Structure: Con-
Course objectives: cept of a file, Access Methods, Directory Structure, Protection, File System
* To understand evolution of Operating System. Structure, Allocation Methods, Free Space Management, Directory Manage-
* To understand operating system as a layer of abstraction above physi- ment, Device Drivers, overview of Mass-storage structure, Disk structure, disk
cal hardware that facilitates usage convenience and efficient resource man- attachment, disk scheduling, swap-space management.
agement of computer system resources. Case study: Overview of LINUX, Windows Operating systems.
* To learn design and implementation of policies and mechanisms for Text Book:
OS subsystem. 1. Operating Systems, Abraham Silberschatz, Peter Baer Galvin, and
* To investigate case studies to understand the design philosophies / Greg Gagne, John
paradigm for popular multiuser or single user operating system. Wiley Publ., Seventh Edition.
Course Outcomes: 2. Operating Systems; A Practical Approach. Rajiv Chopra.
* The student understands OS evolution, its structure and services pro- Reference Books:
vided by it. 1. Modern Operating Systems, Andrew S. Tanenbaum, ,2nd edition,
1995, PHI.
* Learn process life cycle, process scheduling objectives, policies and
mechanisms, process synchronization, inter process communication, dead- 2. Operating Systems, William Stallings 5th Edition -PHI
locks and other process subsystem related concepts.
197
 3. Operating Systems: A Design-Oriented Approach’, Charles Crowley, Java Database Connectivity (JDBC): JDBC Product, Types of Drivers,
‘Tata Hill Co.,1998 edition. Two-Tier Client/Server Model, Three-Tier Client/Server Model, Basic Steps of
JDBC, Creating and Executing SQL Statement, The Result Set Object, Work-
CS2105 : OBJECT ORIENTED PROGRAMMING THROUGH JAVA ing with Database MetaData Interface
Course Objectives: Reference Books:
* This subject will help to improve the analytical skills of object-oriented 1 Introduction to Java Programming (Comprehensive Version), Daniel
programming Liang, Seventh Edition, Pearson.
* Overall development of problem solving and critical analysis 2 Programming in Java, Sachin Malhotra & Saurabh Chaudhary, Oxford
University Press.
* Formal introduction to Java programming language
3 Murach’s Beginning Java 2, Doug Lowe, Joel Murach and Andrea
Course Outcome: Steelman, SPD.
On successful completion of this course, the student should be able to: 4 Core Java Volume-I Fundamentals, Eight Edition, Horstmann &
* Show competence in the use of the Java programming language in the Cornell, Pearson Education.
development of small to medium-sized application programs that demon- 5 The Complete Reference, Java 2 (Fourth Edition), Herbert Schild,
strate professionally acceptable coding and performance standard TMH.
* Understand the basic principles of the object-oriented programming 6 Java Programming, D. S. Malik, Cengage Learning.
* Demonstrate an introductory understanding of graphical user interfaces,
CS2106 : COMPUTER ORGANIZATION & ARCHITECTURE LAB
multi- threaded programming, and event-driven programming.
Course Objectives
SYLLABUS
* to design and analyse the operational behaviour of IC gates, multiplex-
Introduction to Java: Basics of Java programming, Data types, Variables,
ers, decoders, flip-flops, counters, shift registers, binary adders and subtractors
Operators, Control structures including selection, Looping, Java methods, and ALU.
Overloading, Math class, Arrays in java.
* to implement assembly language programming using various trainers.
Objects and Classes: Basics of objects and classes in java, Construc-
tors, Finalizer, Visibility modifiers, Methods and objects, Inbuilt classes like * to make students familiar with Pentium class PC architecture.
String, Character, StringBuffer, File, this reference Course Outcomes
Inheritance and Polymorphism: Inheritance in java, Super and sub class, After completion of the course the student should be able to:
Overriding, Object class, Polymorphism, Dynamic binding, Generic program-
ming, Casting objects, Instance of operator, Abstract class, Interface in java, * analyse the operational behaviour of various digital logic units such as
Package in java, UTIL package. multiplexers, decoders, flip-flops, counters, shift registers, binary adders and
subtractors and ALU.
Event and GUI programming: Event handling in java, Event types, Mouse
and key events, GUI Basics, Panels, Frames, Layout Managers: Flow Layout, * write assembly language code using various trainers.
Border Layout, Grid Layout, GUI components like Buttons, Check Boxes, Ra- * understand Pentium class PC architecture.
dio Buttons, Labels, Text Fields, Text Areas, Combo Boxes, Lists, Scroll Bars,
Sliders, Windows, Menus, Dialog Box, Applet and its life cycle, Introduction to SYLLABUS
swing I - Cycle: Digital Logic Design Experiments
I/O programming: Text and Binary I/O, Binary I/O classes, Object I/O, Ran- TTL Characteristics and TTL IC Gates
dom Access Files. Multiplexers & Decoders
Multithreading in java: Thread life cycle and methods, Runnable inter- Flip-Flops
face, Thread synchronization, Exception handling with try-catch-finally, Collec-
Counters
tions in java, Introduction to JavaBeans and Network Programming.

198
 Shift Registers 4. Program to define class, methods and objects. Demonstrate method
Binary Adders & Subtractors overloading.
ALU 5. Program to define inheritance and show method overriding.
II - CYCLE: 8085 Assembly Language Programming 6. Program to demonstrate Packages.
8085 Assembly Language Programming according to theory course mi- 7. Program to demonstrate Exception Handling.
croprocessors-I using the following trainers: 8. Program to demonstrate Multithreading.
Keyboard Monitor of 8085µP Trainer 9. Program to demonstrate I/O operations.
Serial Monitor of 8085µP Trainer with Terminal 10. Program to demonstrate Network Programming.
8085 Line Assembler of 8085µP Trainer with PC as Terminal 11. Program to demonstrate Applet structure and event handling.
8085 Cross Assembler using In-Circuit Emulator (ICE) with 8085µP Trainer 12. Program to demonstrate Layout managers.
and PC as Terminal
CS2108 : OPERATING SYSTEMS LAB
Graded Problems are to be used according to the syllabus of computer
organization Pentium class pc architecture familiarization hardware & soft- Course Objectives:
ware parts demonstration
* To learn about UNIX/LINUX operating system environment.
Reference Books
* To learn about system calls for UNIX/LINUX Operating System.
1. Computer System Architecture, M. Morris Mano, Prentice Hall of India
* To understand resource management policies and mechanisms and
Pvt. Ltd., Third Edition, Sept.2008
their performance evaluation.
2. Microprocessor Architecture, Programming and Applications with the
8085 by Ramesh S Gaonkar. Course Outcomes:
* The student learns about multiprogramming, and multitasking capabili-
CS2107 : OBJECT ORIENTED PROGRAMMING
ties of UNIX/LINUX.
THROUGH JAVA LAB
* The student develops skill in writing C programs using system calls for
Course Objectives: process management, inter process communication and other aspects.
* To develop programs using basic OOPS concepts such as classes and * The student learns to simulate OS resource management aspects like
objects. process scheduling, page replacement, disk scheduling, free space man-
* To implement programs using Inheritance concepts. agement and others to evaluate performance.
* To implement programs using Exception handling. SYLLABUS
* To develop programs using operator overloading concepts.
Module I
Course Outcomes: 1. OS lab familiarization, Home Assignment on Unix commands, Vi edi-
* Student will be able to use OOPs concepts. tor
* Ability to apply Inheritance concepts to several problems. 2. Simple shell programming exercises
* Ability to use Exception Handling concepts. 3. Shell programming using decision making constructs, loop con-
structs, file and directory manipulation
List of Programs:
4. Simple C programs using command line arguments, system calls,
1. Program to define a structure of a basic JAVA program library function calls, make utility
2. Program to define the data types, variable, operators, arrays and con- 5. C programs using system call to create processes and study parent,
trol structures. child process mechanism
3. Program to define class and constructors. Demonstrate constructors.

199
 6. C programs to create process chaining, spawning * conduct patent search and analyse patentability of the invention
7. C programs to error handling using errno(), perror() function * understand the basic structure of Patent document
8. C programs to use pipe system call for inter process communication * understand the registration and prosecution of different IPs
Module II * understand the basics of IP commercialization and techno/commercial/
legal issues in IPR commercialization
1. C programs to study process scheduling implementing FCFS, Short-
est Job First, and Round Robin algorithms SYLLABUS
2. C programs to study page replacement implementing FIFO, Optimal, Introduction: Concept of property, Intellectual Property (IP) and Intellec-
and LRU page replacement algorithms tual Property Rights (IPR), Importance of IP, Value creation through IP, Advan-
3. C programs to study deadlock avoidance and detection tages of IP protection, Competitive advantage, Promotion of social good, Pre-
4. C Programs to simulate free space management (first fit, best fit, vention of duplicates, counterfeit products and IP.
worst fit). Evolution of IP system: Historical view of IP system in India and abroad,
Legal basis and rationale behind development of IP system, WTO and TRIPS
5. C programs to study disk scheduling algorithms (i.e., SCAN, SSTF,
LOOK, etc.,) agreement, Role of WIPO.
Types of IPR: Major forms of IP in India and globally, Acts enacted in India
References:
related to IP.
1. Unix concepts and applications by Sumitabha Das, TMH Publica-
tions. Patent: Concept, Life of patent, Rights of Patentee, Criteria of patentabil-
ity- novelty, non-obviousness, and utility, Non-patentable inventions.
2. Unix programming by Stevens, Pearson Education.
Patent filing and prosecution: Prior art search, Process of obtaining a
3. Shell programming by Yashwanth Kanetkar.
patent in India, Provisional and complete specification, Convention applica-
4. Operating System Concepts by Silberschatz, and Peter Galvin. tion, Patent Cooperation Treaty (PCT), Patent Infringement and Enforcement.
CS2109 : INTELLECTUAL PROPERTY RIGHTS Trademark: Types of trademarks, Trademark and Brand, Trademark
Registration, Trademark Infringement.
Course Objective: Copyright: Copyrights and related rights, Copyright registration, Copy-
* To introduce the students to Intellectual Property Rights (IPR) which is a right infringement, Section 52 of Indian Copyright Act.
key component in modern knowledge management processes Industrial Design: What is Industrial design, Design registration, Design
* To create consciousness on IPR in students at an early stage of their infringement.
education so that they develop an appreciation for ethical and rightful use of Trade Secret: What are Trade Secrets, How trade secrets are main-
existing knowledge tained in trade and business.
* To make them understand how to take ownership of knowledge they Other forms of IP: Semiconductor Integrated Circuits Layout Design,
may develop as a result of their creative innovations, take ownership and Geographical Indications, Protection of Plant Varieties & Farmers’ right, Tradi-
either drive themselves in becoming entrepreneurs or become responsible tional knowledge.
knowledge users in society
IP commercialization: Licensing & Royalty; Technology Transfer; IP as-
* To expose students some of the recent debates on the societal implica- signment, Compulsory License.
tions of IPR and its role in national/international trade and socio-economic
Emerging areas: Pat informatics, IP and bank loan, IP insurance, IP au-
development.
dit, IP valuation, IP management, Use of artificial intelligence in IP enforce-
Course outcome: ment, Open innovation.
Learners will be able to Text Books
* identify the types of intellectual property protection available for their 1. Ganguli Prabuddha, Gearing up for Patents The Indian Scenario”,
research outcome Universities Press (1998)

200
 2. Ganguli Prahuddha “Intellectual Property Rights-Unleashing the Course Outcomes
Knowledge Economy”. Tata McGraw Hill (2001) After completion of the course the students will have
3. Geographical Indications of Goods Act 1990 Ganguli Piabaddha “Geo- * Knowledge on the fundamental aspects of environment and the envi-
graphical Indications-its evolving contours accessible in http ips. nminsoda/ ronmental management
files/2012/05/main book pdf (2009)
* The knowledge on the salient features of the important international
Reference Books conventions
1. Ganguli Prabuddha and Jahade Siddharth, “Nanotechnology Intel- * Understanding of the importance of natural resources management for
lectual Property Rights Research, Design, and Commercialisation”, CRC
the sustenance of the life and the society.
Press, Taylor and Francis Group, USA (2012)
* Familiarity on various forms of pollution and its impact on the environ-
2. Beyond Intellectual Property: Toward Traditional Resource Rights for ment.
Indigenous Peoples and Local Communities [Paperback J,Darrell A. Posey
and Graham Dotfield, IDRC Books; annotated edition (June (1996) * Understand the elements of Sustainable Development, energy and
environmental management
3. Netancl Neil Weinstock, Copyright’s Paradox, Oxford University Press
(2010) * Knowledge on the new generation waste like e-waste and plastic waste.
4. The Indian Patents Act 1970 (as amended in 2005) SYLLABUS
5. The Indian Copyright Act 1950 as amended in 2017) Introduction: Structure and functions of Ecosystems-Ecosystems and its
6. Indian Trademarks Act 1999 Dynamics-Value of Biodiversity-impact of loss of biodiversity, Conservation of
7. The Indian Industrial Designs Act 2000 bio-diversity. Environmental indicators - Global environmental issues and their
impact on the ecosystems. Salient features of international conventions on
8. The Protection of Plant Varieties and Farmers’ Right Act 2001 Environment: Montreal Protocol, Kyoto protocol, Ramsar Convention on Wet-
9. Inventing the Future: An Introduction to Patents for small and medium lands, Stockholm Convention on Persistent Organic Pollutants, United Na-
sized enterprises, WIPO publication No 917 www.wipo.int/ebookshop tions Framework Convention on Climate Change (UNFCCC),
10. Looking Good: An Introduction to Industrial Designs for Small and Natural Resources Management: Importance of natural resources man-
Medium sized Enterprises; WIPO publication No.498 www.wipo.int/ebookshop agement-Land as resource, Land degradation, Soil erosion and desertifica-
tion, Effects of usage of fertilizer, herbicides and pesticide- watershed man-
CS2110 : ENVIRONMENTAL SCIENCE agement.
Course Objectives Forest resources: Use and over-exploitation, Mining and dams – their
The objectives of the Environmental Science course are to effects on forest ecosystems and the living beings.
* Familiarize the fundamental aspects of environment and the environ- Water resources: Exploitation of surface and groundwater, Floods,
mental management’ droughts, Dams: benefits and costs.
* Provide information of some of the important international conventions Mineral Resources: Impact of mining on the environment and possible
which will be useful during the future endeavours after graduation. environmental management options in mining and processing of the miner-
als. Sustainable resource management (land, water, and energy), and resil-
* Make realize the importance of natural resources management for the ient design under the changing environment.
sustenance of the life and the society.
Environmental Pollution: Local and Global Issues. Causes, effects and
* Apprise the impact of pollution getting generated through the anthropo- control measures. Engineering aspects of environmental pollution control
genic activities on the environment systems.
* Provide the concept of Sustainable Development, energy and environ- Air pollution: impacts of ambient and indoor air pollution on human health.
mental management Water pollution: impacts water pollution on human health and loss of fresh
* Impart knowledge on the new generation waste like e-waste and plastic water resources. Soil pollution and its impact on environment. Marine pollu-
waste. tion and its impact on blue economy. Noise pollution.

201
 and its amendments 2018.
Solid waste management: Important elements in solid waste manage-
ment- Waste to energy concepts. Air (prevention and control of pollution) Act,
Water (prevention and control of pollution) Act and their amendments. Salient
features of Environmental protection Act, 1986.
Sustainable Development: Fundamentals of Sustainable Development–
Sustainability Strategies and Barriers – Industrialization and sustainable devel-
opment. Circular economy concepts in waste (solid and fluid) management.
Energy and Environment: Environmental Benefits and challenges, Avail-
ability and need of conventional energy resources, major environmental prob-
lems related to the conventional energy resources, future possibilities of en-
ergy need and availability. Solar Energy: process of photovoltaic energy con-
version, solar energy conversion technologies and devices, their principles,
working and applications, disposal of solar panel after their usage. Biomass
energy: Concept of biomass energy utilization, types of biomass energy, con-
version processes, Wind Energy, energy conversion technologies, their prin-
ciples, equipment and suitability in context of India.
Management of plastic waste and E-waste: Sources, generation and
characteristics of various e- and plastic wastes generated from various indus-
trial and commercial activities; Waste management practices including onsite
handling, storage, collection and transfer. E-waste and plastic waste process-
ing alternatives. E-Waste management rules and Plastic waste management
rules, 2016 and their subsequent amendments.
Text Books:
1. Bharucha,Erach (2004). Textbook for Environmental Studies for Un-
dergraduate Courses of all Branches of Higher Education, University Grants
Commission, New Delhi.
2. Basu, M., Xavier, S. (2016). Fundamentals of Environmental Studies,
Cambridge University Press, India
3. Masters, G. M., &Ela, W. P. (1991). Introduction to environmental engi-
neering and science. Englewood Cliffs, NJ: Prentice Hall.
4. Enger, E. and Smith, B., Environmental Science: A Study of
Interrela- tionships, Publisher: McGraw-Hill Higher Education; 12th edition,
2010.
Reference Books:
1. Sharma, P. D., & Sharma, P. D. (2005). Ecology and environment.
Rastogi Publications
2. Agarwal, K.C. 2001 Environmental Biology, Nidi Publ. Ltd. Bikaner.
3. Clark R.S. (2001). Marine Pollution, Clanderson Press Oxford (TB)
4. Jadhav, H & Bhosale, V.M. (1995). Environmental Protection and Laws.
Himalaya Pub. House, Delhi 284 p.
5. MoEF&CC, Govt. of India, CPCB: E-waste management rules, 2016

202
 2. The 80x86 Family, Design, Programming and Interfacing, John
6. MoEF&CC, Govt. of India, CPCB: Plastic waste management rules, E.Uffenbeck, 3rdEdition,Pearson Education Inc.,2002
2016.

II Year - II Semester
CS2201 :
MICROPROCESSORS
Course Objectives:
* To discuss the architectures of 8085, 8086 microprocessors, their
in-struction sets and related ALP programs.
* To discuss interfacing semiconductor memories, interfacing
peripheralto Intel 8086.
* To study interfacing data converters to 8086 and discuss about
microcontroller 8051 architecture.
Course Outcomes:
* Understand the basic architectures of 8085 and 8086
microproces-sors.
* Ability to write ALP programs using instruction sets.
* Understand the various interfacing concepts and micro controllers.

SYLLABUS
Introduction to Microprocessors and Microcomputers: A Brief
Architectureand Programming of 8085Microprocessor.
Architecture: Instruction Set and Programming of 8086Microprocessor
Interfacing Semiconductor Memories and I/O Devices:
Semiconductor Memories: Classification Internal Organization& Functional
Description, Inter- facing SRAMs and EPROMs to8086, Interfacing
Characteristics of I/Devices, I/ O Device addressing methods, I/O Device
Programming Methods.
Interfacing Peripherals to Intel8086 -1: Parallel I/O Interface- 8255,
Se- rial I/O Interface –8251, Timer Interface -8253/8254
Interfacing Peripheral to Intel 8086 - 2: Keyboard / Display Interface –
8279, Interrupt Controller Interface – 8259
Interfacing Data Converters to 8086: D/A Conversion Methods, A/D
Con-version methods, Interfacing DAC, Interfacing ADC.
Introduction to Micro controllers: Intel 8051Architecture and
Program- ming
Text Books:
1. Microprocessor Architecture, Programming, and Applications with
the8085 Ramesh S.Gaonkar, 4thEdition, PenramInternational,1999
203
 3. KennethJ.Ayala, 8051 Microcontroller Architecture, Programming And * Describe the greedy paradigm and explain when an algorithmic design
Applications, 2ndEdition, Penram InternationalPublications,1999 situation calls for it. Recite algorithms that employ this paradigm. Synthesize
Reference Books: greedy algorithms, and analysis them.
1. BARRYB.BREY, The Intel Microprocessors 8086 / 8088, 80186 / 80188, SYLLABUS
80286, 80386 and 80486, Pentium, Pentium Pro Processor, Pentium II,
Pentium III, Pentium4, Architecture, Programming and Interfacing, 8th Edition, Introduction: What is an Algorithm, Algorithm Specification, Pseudocode
Pearson Education Inc.,2009 Conventions Recursive Algorithm, Performance Analysis, Space Complexity,
Time Complexity, Amortized Complexity, Amortized Complexity, Asymptotic No-
2. Walter A. Tribeland, Avtar Singh, The 8088 and 8086 Microproces- tation, Practical Complexities, Performance Measurement.
sors, Programming, interfacing, Software, Hardware, and Applications,
4thEdition, Pearson Education Inc.,20033. Microprocessors and Interfacing, Divide and Conquer: General Method, Defective Chessboard, Binary
Programming and Hardware, 2ndEdition, Douglass V. Hall, TMH Edition,1999 Search, Finding the Maximum and Minimum, Merge Sort, Quick Sort, Perfor-
mance Measurement, Randomized Sorting Algorithms.
3. Sanjay K Bose, Hardware and Software of Personal Computers,
New Age International (P)Ltd.,1991 Myke Predko, Programming and Custom- The Greedy Method: The General Method, Knapsack Problem, Job Se-
izing the 8051 Microcontroller, TMH,1999 quencing with Deadlines, Minimum-cost Spanning Trees, Prim’s Algorithm,
Kruskal’s Algorithms, An Optimal Randomized Algorithm, Optimal Merge Pat-
CS2202 : DESIGN AND ANALYSIS OF ALGORITHMS terns, Single Source Shortest Paths.
Dynamic Programming: All - Pairs Shortest Paths, Multistage graphs,
Course Objectives:
optimal binary search tree, String editing, 0/1 Knapsack, Reliability Design.
Upon completion of this course, students will be able to do the following:
Backtracking: The General Method, The 8-Queens Problem, Sum of
* Analyse the asymptotic performance of algorithms. Subsets, Graph Colouring, Hamiltonian Cycles, Knapsack problem
* Write rigorous correctness proofs for algorithms. Branch and Bound: Least cost (LC) Search, The 15-Puzzle, Control Ab-
* Demonstrate a familiarity with major algorithms and data structures. straction for LC-Search, Bounding, FIFO Branch-and-Bound, LC Branch and
* Apply important algorithmic design paradigms and methods of analysis. Bound, 0/1 Knapsack Problem, LC Branch-and Bound Solution, FIFO Branch-
and-Bound Solution, Traveling Salesperson problem.
* Synthesize efficient algorithms in common engineering design situa-
tions Limitations of Algorithm Power: Lower-Bound Arguments, Decision
Trees, P, NP and NP – complete problems – Challenges of Numerical Algo-
Course Outcomes: rithms. Limitations of Algorithms Power: Backtracking – Branch-and Bound–
Students who complete the course will have demonstrated the ability to Approximation Algorithms for NP-hard Problems – Algorithms for solving Non-
do the following: linear Equations.
* Argue the correctness of algorithms using inductive proofs and invari- Text Books:
ants. 1. Fundamentals of computer algorithms E. Horowitz S. Sahni,
* Analysis worst-case running times of algorithms using asymptotic analy- Sanguthevar Rajasekaran, University Press.
sis. 2. Introduction to Algorithms by Thomas H. Corman, Charles E.
* Describe the divide-and-conquer paradigm and explain when an algo- Leiserson, Ronald R. Rivest & Clifford Stein, Prentice Hall of India, New Delhi,
rithmic design situation calls for it. Recite algorithms that employ this para- New Delhi.
digm. Synthesize divide-and conquer algorithms. Derive and solve recurrences Reference Books:
describing the performance of divide and-conquer algorithms. 1. Data structures and algorithm analysis in C++ / Mark Allen Weiss,
* Describe the dynamic-programming paradigm and explain when an Florida International University. — Fourth edition.
algorithmic design situation calls for it. Recite algorithms that employ this 2. Introduction to Design & Analysis of Algorithms by Anany Levitin, Pearson
paradigm. Synthesize dynamic programming algorithms, and analysis them. Education, New Delhi, 2003

204
 3. Introduction to Algorithms by Thomas H. Corman, Charles E. Leiserson, Transaction Management: The ACID Properties, Transactions & Sched-
Ronald R. Rivest & Clifford Stein, Prentice Hall of India, New Delhi, New Delhi. ules, Concurrent Execution of Transactions, Lock-Based Concurrency Control.
4. The Design and Analysis of Computer Algorithms, Alfred V. Aho, John E. Concurrency Control: 2PL, Serializability and Recoverability, Introduction
Hopcroft, Jeffrey D. Ullman to Lock Management, Lock Conversions, Dealing with Deadlocks, Specialized
Locking Techniques, Concurrency Control without Locking.
CS2203 : DATABASE MANAGEMENT SYSTEMS
Crash Recovery: Introduction to ARIES, The Log, Other Recovery-Related
Course Objectives: Structures, The Write-Ahead Log Protocol, Check pointing, Recovering from a
System Crash, Media Recovery.
* To learn the evolution of DBMS Versus File systems, data models, and
layers of abstraction. Text Books:
* To understand conceptual and physical aspects of database design. 1. Database Management Systems; Raghu Ramakrishnan, Johannes
Gehrke 4th Edition, McGraw-Hill.
* To learn formal and commercial query language specifications.
Reference:
* To understand concurrency control, recovery management, and other
1. Database System Concepts; A. Silberschatz, H. Korth 5th Edition,
related issues.
McGraw-Hill
Course Outcomes:
CS2204 : FORMAL LANGUAGES AND AUTOMATA THEORY
* The student will understand ER-modelling for conceptual database
design and relational model. Course objectives:
* The student is introduced to formal and commercial query languages: * To introduce the concepts in automata theory and theory of computation
Relational Algebra, calculus and SQL. to design grammars and recognizers for different formal languages.
* The student will learn schema refinement and normalization. * To employ finite state machines to solve problems in computing.
* The student understands locking protocols concurrency control, and * To introduce finite state machines, context free grammars and Turing
crash recovery methods. Machines and their properties as the basis for the formal expressivity of com-
puter languages for solving linguistic decision problems.
SYLLABUS
* To understand the concepts of tractability and decidability, the concepts
Introduction: File system versus a DBMS, Advantages of a DBMS, De- of NP-completeness and NP-hard problem and also the challenges for Theo-
scribing and Storing Data in a DBMS, The Relational model, Levels of abstrac- retical Computer Science and its contribution to other sciences.
tion, Data Independence, Transaction management, Structure of a DBMS.
Introduction to Database Design and The Relational Model: Database De- Course outcomes:
sign and ER Diagrams, Entities, Attributes and Entity Sets, Relationships & Rela- * Ability to think analytically and intuitively for problem solving situations in
tionship Sets, Additional Features of the ER Model, Conceptual Design with ER related areas of theory in computer science
Model, Introduction to the Relational Model, Integrity Constraints over Relations, * Ability to describe the language accepted by an automata or generated
Enforcing Integrity Constraints, Querying Relational Data, Logical Database De- by a regular expression or a context-free grammar;
sign: ER to Relational, Introduction to Views, Destroying/ Altering Tables and Views.
* Ability to Understand the functioning of Finite-State Machines, Determin-
Relational Algebra and SQL: Preliminaries, Relational Algebra, The form istic Finite-State Automata, Nondeterministic Finite-State Automata and Push-
of a Basic SQL Query, UNION, INTERSECT and EXCEPT, Nested Queries, down Automata and Turing Machines.
Aggregate Operators, Null Values, Complex Integrity Constraints in SQL, Trig-
gers and Active Databases, Embedded SQL, Dynamic SQL, JDBC. SYLLABUS
Database Design: Schema Refinement and Normal Forms, Introduction Introduction to Grammars and Languages: Definitions of alphabet,
to Schema Refinement, Functional Dependencies, Reasoning about FD’s, strings, language, grammar, types of grammar, types of machines, generation
Normal Forms, Properties of Decomposition, Normalization, Other kinds of of languages from grammar, construction of grammar from the given descrip-
Dependencies. tion of languages, Chomsky Hierarchy of languages.

205
 Finite State Machine (FSM): Definition of finite state machine, Represen- * To familiarize the prospective engineers with the concepts and tools of
tation of FSMs. Classification of FSM’s and their construction, Conversion Managerial Economics with an objective to understand the real world of busi-
from NFA to DFA, Elimination of å – transitions from NFA, Equivalence of two ness.
FSM’s, optimization of finite state machine (Equivalence theorem method and
Table filling method), Finite state machine with output: Moore and Mealy ma- Course Outcomes:
chines. Applications of FSM. After completion of the course, student will be able to:
Regular Expression and Languages: Regular Expression, Finite Automata * Understand the various economic activities in business and industry.
and Regular Expressions, Applications of Regular Expressions, Algebraic Laws * Analyse the real-world business problems.
for Regular Expressions, Properties of Regular Languages: Pumping Lemma
* Make optimal business decisions for the effective and efficient manage-
for regular Languages, Application of Pumping Lemma, Closure properties of
ment of Organisations.
Regular Languages, Decision properties of Regular Languages, Equivalence
and Minimization of Automata. SYLLABUS
Context Free Grammars and Languages: Context Free Grammars, Parse Significance of Economics and Managerial Economics:
Trees, Applications of Context-Free Grammars, Ambiguity in Grammars and
Economics: Definitions of Economics- Wealth, Welfare and Scarcity defi-
Languages, Normal Forms, Pumping Lemma for CFL, Closure properties of
nitions Classification of Economics- Micro and Micro Economics.
CFL, Decision properties for CFL.
Managerial Economics: Definition, Nature and Scope of Managerial Eco-
Push down Automata: Definition of push down automata, The Languages
nomics, Differences between Economics and Managerial Economics, Main
of a PDA, push down automata, Equivalence of PDA’s and CFG’s, push down
areas of Managerial Economics, Managerial Economics with other disciplines.
automata to context free grammar, context free grammar to push down au-
tomata, Deterministic Pushdown Automata. Demand and Utility Analysis: Demand - Definition, Meaning, Nature and
types of demand, Demand function, Law of demand - Assumptions and limita-
Turing Machines: The Definition of Turing Machine, Turing Machine Model,
tions. Exceptional demand curve.
Representation of Turing Machines, Language Acceptability by Turing Machines,
Design of Turing Machines, Description of Turing Machines, Techniques for Elasticity of demand - Definition, Measurement of elasticity, Types of Elas-
TM Construction, Variants of Turing Machines, Turing Machines and Type 0 ticity (Price, Income, Cross and Advertisement), Practical importance of Price
Grammars. elasticity of demand, Role of income elasticity in business decisions, Factors
governing Price Elasticity of demand.
Undecidability: A Language That Is Not Recursively Enumerable, An Un-
decidable Problem That Is RE, Undecidable Problems About Turing Machines, Utility Analysis: Utility- Meaning, Types of Economic Utilities, Cardinal
Decidable & Undecidable Problems, Post Correspondence Problem. and Ordinal Utility, Total Utility, Marginal Utility, The law of Diminishing Marginal
Utility and its Limitations.
Text books:
1. Introduction to automata theory, languages and computation, Theory of Production and Cost analysis: Production - Meaning, Produc-
John.E.H.P croft/ Rajeev Motwani & JD Ullman—pearson education- III edition tion function and its assumptions, use of production function in decision mak-
ing; Cost analysis - Nature of cost, Classification of costs - Fixed vs. Variable
2. Theory of computation, K.L.P.Mishra and N.Chandrasekhar, PHI costs, Marginal cost, Controllable vs. Non - Controllable costs, Opportunity
Reference Books: cost, Incremental vs. Sunk costs, Explicit vs. Implicit costs, Replacement costs,
1. Theory of computation, formal languages and automata theory, G P Historical costs, Urgent vs. Postponable costs, Escapable vs. Unavoidable
Saradhi Varma, B.Thirupathi Rao –Sci Tech publications. costs, Economies and Diseconomies of scale.
Market Structures: Definition of Market, Classification of markets; Sa-
CS2205 : MANAGERIAL ECONOMICS
lient features or conditions of different markets - Perfect Competition, Mo-
Course Objectives: nopoly, Duopoly , Oligopoly, Importance of kinked demand curve ;Monopolistic
Competition.
* To bring about an awareness about the nature of Managerial Econom-
ics and its linkages with other disciplines. Pricing and Business Cycles: Pricing Analysis: Pricing – Significance;
Different Pricing methods- Cost plus pricing, Target pricing, Marginal cost
* To understand the Micro and Macro Environment of Business.

206
pricing, Going -rate pricing, Average cost pricing, Peak load pricing , Pricing of * Apply and implement learned algorithm design techniques and data
joint Products, Pricing over the life cycle of a Product, Skimming pricing Pen- structures to solve real-world problems.
etration pricing, Mark- up and Mark- down pricing of retailers.
Programs List:
Business cycles - Definition, Characteristics, Phases, Causes and Con-
sequences; Measures to solve problems arising from Business cycles. 1. a) Create a CPP class called Student with the following details as
variables within it.
Text Books:
(i) Register_number
1. Sankaran,S., Managerial Economics, Marghan Publications, 2015,
Chennai. (ii) Student_name
2. Aryasri, A.R., Managerial Economics and Financial Analysis, MC Graw (iii) Programme_name
Hill Education, New Delhi,2015. (iv) Phone _number
Reference Books: Write a program to create nStudent objects and print the Register_number,
1. Dwivedi, D.N., Managerial Economics, Vikhas Publishing House Pvt. Student_name, Programme_name, and Phone_number of these objects with
Ltd. 6th Edition, New Delhi,2004. suitable headings.
2. Dewett, K.K., Modern Economic Theory, S.Chand & Company Ltd., New b). Write a program to implement the Stack using arrays. Write Push (),
Delhi, 2005. Pop(), and Display() methods to demonstrate its working.
2. a). Design a superclass called Staff with details as StaffId, Name,
CS2206 : ALGORITHMS LAB Through C++ Phone, Salary. Extend this class by writing three subclasses namely Teaching
Course objectives: (domain, publications), Technical (skills), and Contract (period). Write a CPP
program to read and display at least 3 staff objects of all three categories.
* The laboratory component will emphasize two areas:
b). Write a class called Customer to store their name and date_of_birth.
* Implementation of algorithms covered in class: This will involve running
The date_of_birth format should be dd/mm/yyyy. Write methods to read cus-
the algorithms under varying input sets and measuring running times, use of
tomer data as and display as using StringTokenizer class considering the
different data structures for the same algorithm (wherever applicable) to see
delimiter character as “/”.
its effect on time and space, comparison of different algorithms for the same
problem etc. 3. a). Write a program to read two integers a andb. Compute a/b and print,
when b is not zero. Raise an exception when b is equal to zero.
* Design of Algorithms: This will involve design and implementation of
algorithms for problems not covered in class but related to topics covered in b). Write a program that implements a multi-thread application that has
class. three threads. First thread generates a random integer for every 1 second;
second thread computes the square of the number and prints; third thread will
* The exact set of algorithms to design and implement is to be decided by
print the value of cube of the number.
the instructor. In addition, there will be at least one significantly large design
project involving some real world application. An efficient design of the project 4. Sort a given set of n integer elements using Quick Sort method and
should require the use of multiple data structures and a combination of differ- compute its time complexity. Run the program for varied values of n> 5000 and
ent algorithms/techniques. record the time taken to sort. Plot a graph of the time taken versus non graph
sheet. The elements can be read from a file or can be generated using the
Course Outcomes: random number generator. Demonstrate using CPP how the divide-and-con-
The student should be able to: quer method works along with its time complexity analysis: worst case, aver-
age case and best case.
* Design algorithms using appropriate design techniques (brute-force,
greedy, dynamic programming, etc.) 5. Sort a given set of n integer elements using Merge Sort method and
compute its time complexity. Run the program for varied values of n> 5000,
* Implement a variety of algorithms such assorting, graph related, combi-
and record the time taken to sort. Plot a graph of the time taken versus non
natorial, etc., in a high level language.
graph sheet. The elements can be read from a file or can be generated using
* Analyze and compare the performance of algorithms using language the random number generator. Demonstrate using CPP how the divide-and-
features.
207
conquer method works along with its time complexity analysis: worst case, CS2207 : DATABASE MANAGEMENT SYSTEMS LAB
average case and best case.
Course Objectives
6. Implement the Knapsack problem using (a) Dynamic Programming
method (b) Greedy method. * To introduce to a commercial DBMS such as ORACLE.
7. Write a program-from a given vertex in a weighted connected graph, * To learn and practice SQL commands for schema creation, data ma-
find shortest paths to other vertices using Dijkstra’s algorithm.. nipulation.
8. Find Minimum Cost Spanning Tree of a given connected undirected * To learn conceptual and physical database design based on a case
graph using Kruskal’s algorithm. Use Union-Find algorithms in your program. study.
9. Find Minimum Cost Spanning Tree of a given connected undirected * To apply database design stages by studying a case study.
graph using Prim’s algorithm.
Course Outcomes
10. Write programs to
By the end of the course, the student should be able to:
(a) Implement All-Pairs Shortest Paths problem using Floyd’s algorithm.
* The student is exposed to a commercial RDBMS environment such as
(b) Implement Travelling Sales Person problem using Dynamic program- ORACLE.
ming.
* The student will learn SQL commands for data definition and manipula-
11. Design and implement in CPP, to find a subset of a given set S = {Sl, tion.
S2,..... ,Sn} of n positive integers whose SUM is equal to a given positive integer
* The student understands conceptual through physical data base de-
d. For example, if S ={1, 2, 5, 6, 8} and d= 9, there are two solutions {1,2,6}and
sign.
{1,8}. Display a suitable message, if the given problem instance doesn’t have
a solution. * The student takes up a case study and applies the design steps.
12. Design and implement in CPP to find all Hamiltonian Cycles in a SYLLABUS
connected undirected Graph G of n vertices using backtracking principle.
Features of a commercial RDBMS package such as ORACLE/DB2, MS
REFERENCES: Access, MYSQL & Structured Query Language (SQL) used with the RDBMS.
1. T. H. Cormen, C. L. Leiserson, R. L. Rivest, and C. Stein, Introduction I. Laboratory Exercises Should Include:
to Algorithms, MIT Press.
a. Defining Schemas for Applications,
2. J. Kleinberg and E. Tardos, Algorithm Design, Addison-Wesley.
b. Creation of Database,
3. Harry R. Lewis and Larry Denenberg, Data Structures and Their Algo-
rithms, Harper Collins. c. Writing SQL Queries,
4. A. Gibbons, Algorithmic Graph Theory, Cambridge University Press. d. Retrieve Information from Database,
5. Michael T. Goodrich and Roberto Tamassia, Algorithm Design: Foun- e. Creating Views
dations, Analysis, and Internet Examples, John Wiley. f. Creating Triggers
6. R. Sedgewick, Algorithms in C (Parts 1-5), Addison Wesley. g. Normalization up to Third Normal Form
7. M. H. Alsuwaiyel, Algorithm Design Techniques and Analysis, World h. Use of Host Languages,
Scientific. i. Interface with Embedded SQL,
8. Gilles Brassard and Paul Bratley, Algorithmics: theory and practice, j. Use of Forms
Prentice-Hall.
k. Report Writing
9. Udi Manber, Introduction to Algorithms: A Creative Approach, Addison-
II. Some sample applications are given below:
Wesley.
1. Accounting Package for Shops,
10. Sara Baase and Allen Van Gelder, Computer Algorithms: Introduction
to Design and Analysis, Addison-Wesley. 2. Database Manager for Magazine Agency or Newspaper Agency,

208
 3. Ticket Booking for Performances, * Develops comprehensive skills of Programming Languages, Software
4. Preparing Greeting Cards & Birthday Cards process models, methodologies, and able to plan, develop, test, analyze, and
manage the software and hardware intensive systems in heterogeneous plat-
5. Personal Accounts - Insurance, Loans, Mortgage Payments, Etc.,
forms individually or working in teams.
6. Doctor’s Diary & Billing System
* Able to use the professional, managerial, interdisciplinary skill set, and
7. Personal Bank Account domain specific tools in development processes, identify the research gaps,
8. Class Marks Management and provide innovative solutions to them.
9. Hostel Accounting SYLLABUS
10. Video Tape Library,
1. Design the following static web pages required for an online book
11. History of Cricket Scores, store web site.
12. Cable TV Transmission Program Manager, a) HOME PAGE: The static home page must contain three frames.
13. Personal Library. b) LOGIN PAGE
14. Sailors Database c) CATOLOGUE PAGE: The catalogue page should contain the details
15. Suppliers and Parts Database of all the books available in the web site in a table.
Reference Books d) REGISTRATION PAGE
1. Database Management Systems; Raghu Ramakrishnan, Johannes 2. Write JavaScript to validate the following fields of the Registration
Gehrke 4th Edition, McGraw Hill page.
2. Database System Concepts; A. Silberschatz, H. Korth 5th Edition, a) First Name (Name should contains alphabets and the length should
McGraw-Hill not be less than 6 characters).
b) Password (Password should not be less than 6 characters length).
CS2208 : WEB TECHONOLOGIES
c) E-mail id (should not contain any invalid and must follow the stan-
Course objectives dard pattern [email protected])
* To facilitate the graduates with the ability to visualize, gather information, d) Mobile Number (Phone number should contain 10 digits only).
articulate, analyze, solve complex problems, and make decisions. These are e) Last Name and Address (should not be Empty).
essential to address the challenges of complex and computation intensive
problems increasing their productivity. 3. Develop and demonstrate the usage of inline, internal and external
style sheet using CSS
* To facilitate the graduates with the technical skills that prepare them for
immediate employment and pursue certification providing a deeper under- 4. Develop and demonstrate JavaScript with POP-UP boxes and func-
standing of the technology in advanced areas of computer science and related tions for the following problems:
fields, thus encouraging to pursue higher education and research based on a) Input: Click on Display Date button using onclick( ) function
their interest. Output: Display date in the textbox
* To facilitate the graduates with the soft skills that include fulfilling the b) Input: A number n obtained using prompt
mission, setting goals, showing self-confidence by communicating effectively,
Output: Factorial of n number using alert
having a positive attitude, get involved in team-work, being a leader, managing
their career and their life. c) Input: A number n obtained using prompt
Output: A multiplication table of numbers from 1 to 10 of n using alert
Course outcomes
d) Input: A number n obtained using prompt and add another number
* Able to understand the working principles of the computer system and using confirm
its components, apply the knowledge to build, asses, and analyze the soft-
ware and hardware aspects of it. Output: Sum of the entire n numbers using alert

209
 5. Write an HTML page that contains a selection box with a list of 5 2. Programming the World Wide Web by Robert W. Sebesta, Pearson
countries. When the user selects a country, its capital should be printed next in Education.
the list. Add CSS to customize the properties of the font of the capital (colour,
bold and font size). CS2209 : PROFESSIONAL ETHICS AND UNIVERSAL
6. Write an HTML page including any required JavaScript that takes a
HUMAN VALUES
number from text field in the range of 0 to 999 and shows it in words. It should Course Objectives:
not accept four and above digits, alphabets and special characters.
* To recognize the moral values that should guide the Engineering pro-
7. Develop and demonstrate PHP Script for the following problems: fession.
a) Write a PHP Script to find out the Sum of the Individual Digits. * To resolve moral issues concerning one’s profession.
b) Write a PHP Script to check whether the given number is Palindrome or * To develop and exhibit a set of moral beliefs and attitudes that engi-
not neers should inculcate.
8. Create an XML document that contains 10 users information. Write a * To inculcate social values and morality in one’s life.
Java Program, which takes User Id as input and returns the user details by
* To develop awareness about Professional/Engineering Ethics and Hu-
taking the user information from XML document using DOM parser or SAX
man Values.
parser.
9. Implement the following web applications using (a) PHP (b) Servlets Learning Outcomes:
(c) JSP Students will be able to:
a) A web application that takes a name as input and on submit it shows * Apply the conceptual understanding of ethics and values into everyday
a hello page where name is taken from the request. It shows the start time at practice.
the right top corner of the page and provides a logout button. On clicking this
* Understand the importance of moral awareness and reasoning in life.
button, it should show a logout page with Thank You message with the dura-
tion of usage (hint: Use session to store name and time). * Acquire professional and moral etiquette that an engineer requires.
b) Write a PHP Program to display current Date, Time and Day. * Develop the acumen for self-awareness and self-development.
c) A web application that takes name and age from an HTML page. If the * Develop cultural tolerance and integrity.
age is less than 18, it should send a page with “Hello, you are not authorized * Tackle real-life challenges with empathy.
to visit the site” message, where should be replaced with the entered name.
Otherwise, it should send “Welcome to this site” message. SYLLABUS
d) A web application that lists all cookies stored in the browser on clicking HUMAN VALUES : Values - Respect - Caring - Sharing - Honesty- Cour-
“List Cookies” button. Add cookies if necessary. age - Self confidence - Communal Harmony Morals - Virtues
10. Implement the web applications with Database using (a) PHP, (b) PROFESSIONAL VALUES : Integrity - Discipline - Valuing time - Coopera-
Servlets and (c) JSP. tion - Commitment - Code of conduct - Challenges in the workplace
11. Modify the above PHP program to use an xml instead of database PROFESSIONAL ETHICS : Overview - Engineering ethics - Moral issues
- Profession - Models of professional roles - Responsibility
12. Write a program to design a simple calculator using
RESPONSIBILITIES AND RIGHTS : Safety and risk - Collegiality and loy-
(a) JavaScript
alty - Confidentiality - Occupational crime - Human rights - Employee rights -
(b) PHP Intellectual property rights
(c) Servlet and GLOBAL ISSUES : Globalization - Environmental ethics - Computer eth-
(d) JSP. ics - Code of ethics - Multinational corporations - Engineers as advisors in
References: Planning and Policy making
1. Internet and Web Technologies by Raj Kamal, Tata McGraw-Hill.

201
0
Textbook: COMPUTER SCIENCE AND SYSTEM ENGINEERING
1. R.S. Nagarazan. A Textbook on Professional Ethics and Human Val- SCHEME AND SYLLABI : (With effect from 2022-23 admitted batch)
ues. New Age International Publishers. 2006.
B. TECH (Computer Science & Engineering with
Reference Books: Specialization in Artificial Intelligence and Machine Learning)
1. Premvir Kapoor. Professional Ethics and Human Values. Khanna Pub- (Common with CSE and IT)
lishing House. 2019.
For First & Second Years
2. B.S. Raghavan. Human Values and Professional Ethics. S.Chand Pub-
lications. 2012. I Year - I Semester
3. R.R. Gaur & Others. A Foundation Course in Human Values and Proff. Course Category Course Title Hours per Internal External Total Credits
Ethics. Excel Books. 2009. code we ek Marks Marks Marks
4. A. N. Tripathi. Human Values. New Age International (P) Limited. 2009 L T
5. R. Subramanian. Professional Ethics. OUP India. 2013. AI1101 BS Engineering Mathematics –I 4 0 30 70 100 3
AI1102 BS Green Chemistry 4 0 30 70 100 3
AI1103 HSS English 4 0 30 70 100 3
AI1104 ES Computer ProgrammingUsing C 4 0 30 70 100 3
AI1105 ES IT Essentials 4 0 30 70 100 3
AI1106 HSS Communication skills Lab 0 3 50 50 100 1.5
AI1107 ES Computer Engineering Workshop Lab 0 3 50 50 100 1.5
AI1108 ES Computer Programming using C lab 0 3 50 50 100 1.5

Total Credits 19.5

I Year-II Semester
AI1201 BS Engineering Mathematics–II 4 0 30 70 100 3
AI1202 BS Engineering Physics 4 0 30 70 100 3
AI1203 ES Elements of Electronics Engineering 4 0 30 70 100 3
AI1204 ES Data StructuresUsing C 4 0 30 70 100 3
AI1205 ES Digital Logic Design 4 0 30 70 100 3
AI1206 ES Linux Administration Lab 0 3 50 50 100 1.5
AI1207 BS Engineering PhysicsLab 0 3 50 50 100 1.5
AI1208 ES Data Structures Lab 0 3 50 50 100 1.5

Total Credits 19.5

II Year - I Semester
AI2101 ES Discrete Mathematical Structures 4 0 30 70 100 3
AI2102 PC Computer Organization and
Architecture 4 0 30 70 100 3
AI2103 BS Probability, Statistics and
Queuing theory 4 0 30 70 100 3
AI2104 PC Operating Systems 4 0 30 70 100 3
AI2105 PC Object Oriented Programming
Through Java 4 0 30 70 100 3
AI2106 PC Computer Organization &

210
 Architecture Lab 0 3 30 70 100 1.5 AI1101 : ENGINEERING MATHEMATICS-I
AI2107 PC Object Oriented Programming
Through JavaLab 0 3 50 50 100 1.5 Course Objectives
AI2108 PC Operating Systems Lab 0 3 50 50 100 1.5 * To transmit the knowledge of Partial differentiation.
AI2109 SC Intellectual Property Rights (Internal) 1 2 100 0 100 2
* To know of getting maxima and minima of function of two variables and
AI2110 M C Environmental Science 0 0 - 100 100 0
finding errors and approximations.
Total Credits 21.5 * To evaluate double and triple integrals, volumes of solids and area of
II Year - II Semester curved surfaces.
AI2201 ES Microprocessors 4 0 30 70 100 3 * To expand a periodical function as Fourier series and half-range Fourier
AI2202 PC Design and Analysis of Algorithms 4 0 30 70 100 3 series
AI2203 PC Database Management Systems 4 0 30 70 100 3 Course Outcomes
AI2204 PC Formal Languages & Automata Theory 4 0 30 70 100 3
* Find the partial derivatives of functions of two or more variables.
AI2205 HSS Managerial Economics 4 0 30 70 100 3
AI2206 PC Algorithms Lab throughC++. 0 3 50 50 100 1.5 * Evaluate maxima and minima, errors and approximations.
AI2207 PC Database Management Systems Lab 0 3 50 50 100 1.5 * Evaluate double and triple integrals, volumes of solids and area of
AI2208 SC Web Technologies 1 2 50 50 100 2 curved surfaces.
AI2209 MC Professional Ethics & * To expand a periodical function as Fourier series and half-range Fourier
Universal Human Values 0 0 0 100 100 0
series.
AI2210 M C NCC/NSS 0 2 - - - 0
* Have a fundamental understanding of Fourier series and be able to give
Total Credits 20 Fourier expansions of a given function.
Internship-I
SYLLABUS
A. TECH (Computer Science & Engineering with Specialization in Partial Differentiation: Introduction - Functions of two or more variables -
Artificial Intelligence and Machine Learning) Partial derivatives - Homogeneous functions – Euler’s theorem - Total deriva-
tive - Change of variables – Jacobins. Mean value Theorems (without proofs)
(Common with CSE and IT)
Applications of Partial Differentiation: Geometrical interpretation -Tan-
For First & Second Years gent plane and Normal to a surface -Taylor’s theorem for functions of two
I Year – I Semester variables - Errors and approximations -Total differential. Maxima and Minima
of functions of two variables - Lagrange’s method of undetermined multipliers
Course Category Course Title Hours per Internal External Total Credits - Differentiation under the integral Sign - Leibnitz’s rule.
code week Marks Marks Marks
L T Multiple Integrals: Introduction - Double Integrals - Change of Order of
Integration - Double Integrals in Polar Coordinates - Triple Integrals - Change
AI1101 BS Engineering Mathematics –I 4 0 30 70 100 3
of Variables.
AI1102 BS Green Chemistry 4 0 30 70 100 3
AI1103 HSS English 4 0 30 70 100 3
Multiple Integrals-Applications: Area enclosed by plane curves - Volumes
AI1104 ES Computer Programming Using C 4 0 30 70 100 3
of solids - Area of a curved surface - Calculation of Mass - Centre of gravity -
Moment of inertia - product of inertia – principal axes- Beta Function - Gamma
AI1105 ES IT Essentials 4 0 30 70 100 3
Function - Relation between Beta and Gamma Functions. Error Function or
AI1106 HSS Communication skills Lab 0 3 50 50 100 1.5
Probability Integral.
AI1107 ES Computer Engineering Workshop Lab 0 3 50 50 100 1.5
AI1108 ES Computer Programmingusing C lab 0 3 50 50 100 1.5 Fourier Series: Introduction - Euler’s Formulae - Conditions for a Fourier
Expansion - Functions having points of discontinuity - Change of Interval - Odd
Total Credits 19.5

211
and Even Functions - Expansions of Odd or Even Periodic Functions, Half- SYLLABUS
Range Series - Parseval’s Formula. Practical Harmonic analysis
Text Book Water Technology :
1. Scope and Treatment as in “Higher Engineering Mathematics”, by Dr. Sources of Water – Impurities and their influence of living systems –
B.S. Grewal, 43rd Edition, Khanna publishers. WHO Limits – Hardness and its Determination – Boiler Troubles and their
removal – Water Softening Methods – Lime- Soda, Zeolite and Ion Exchange -
Reference Books Municipal Water Treatment-Break Point Chlorination – Desalination of Sea
1. Graduate Engineering Mathematics by V B Kumar Vatti., Water – Reverse Osmosis Method, Electro-dialysis.
I.K.International publishing house Pvt. Ltd.
2. Advanced Engineering Mathematics by Erwin Kreyszig. Batteries
3. A text book of Engineering Mathematics, by N.P. Bali and Dr. Manish Primary batteries: The chemistry - Types: Zinc-carbon (Leclanche type),
Goyal, Lakshmi Publications. zinc alkaline (Duracell), zinc/air batteries; Lithium primary cells – liquid cath-
ode, solid cathode and lithium- ferrous sulphide cells. Secondary batteries:
4. Advanced Engineering Mathematics by H.K. Dass. S. Chand Com- Lead acid and VRLA (valve regulated (sealed) lead acid), nickel-cadmium,
pany nickel-zinc, nickel-metal hydride batteries, lithium ion batteries, ultrathin lithium
5. Higher Engineering Mathematics by B.V. Ramana, Tata Mc Graw Hill polymer cells. Advanced Batteries for electric vehicles, requirements of the
Company. 6. battery – sodium-beta and redox batteries.
6. Higher Engineering Mathematics by Dr. M.K.Venkataraman.
Fuel Cells
AI1102 : GREEN CHEMISTRY Fuel Cells: Description, working principle, anodic, cathodic and cell reac-
tions, fabrication of electrodes and other components, applications, advantages,
Course Objectives: disadvantages and environmental aspects of the following types of fuel cells:
* To apply the basic knowledge of Chemistry to the Engineering Disci- Proton Exchange Membrane Fuel Cells, alkaline fuel cells, phosphoric acid, solid
pline. oxide, molten carbonate, direct methanol fuel cells- Membranes and Fuels
* To develop knowledge about water and its treatment for industrial and
Corrosion
potable purposes.
Corrosion: Origin and Theory – Types of Corrosion: Chemical and Elec-
* To develop understanding in the areas of Batteries, Fuels Mechanism of
trochemical; Pitting, Inter granular, Waterline, Stress – Galvanic Series – Fac-
Corrosion of Metals and Corrosion Control Methods, Green Chemistry and
tors Effecting Corrosion. Corrosion Controlling Methods, Protective Coatings,
Technology and Processes involving Green Chemistry and apply the knowl-
Metallic Coatings, Electroplating and Electroless Plating.
edge for solving existing challenges faced in various engineering and societal
areas. Green Chemistry and Technology
Learning outcome: Introduction and significance of green chemistry, Goals of green chemis-
try, 12 principles of green chemistry, toxicity of chemicals, material safety data
* The students are able to apply the basic concepts and principles stud-
sheet (MSDS), concept of zero pollution technologies, atom economy, func-
ied in Chemistry to the field of Engineering.
tional toxicity vs non-functional toxicity, functional group approaches to green
* The students are able to apply chemistry to different branches of engi- chemistry, Elimination of toxic functional group, optimization of frameworks for
neering the design of greener synthetic pathways, Applications of green chemistry -
* The students are able to acquire the knowledge in the areas of Water Green solvents, green fuels and propellants, biocatalysis.
Chemistry, Mechanism of Corrosion of Metals and Corrosion Control Meth- Text Books
ods, Batteries, Fuel Cells, Green Chemistry and Technology and Processes 1. Engineering Chemistry – PC Jain and M. Jain – Dhanpath Rai and
involving Green Chemistry and suggest innovative solutions for existing chal- Sons, New Delhi.
lenges in these areas.
2. A Text book of Engineering Chemistry – S. S. Dara – S. Chand & Co.
New Delhi.

212
 3. Hand Book of Green Chemistry and Technology; by James Clarke Textbook
and Duncan Macquarrie; Blakwell Publishing. 1. Language and Life: A Skills Approach Board of Editors, Orient Blackswan
Publishers, India.2018.
AI1103 : ENGLISH
References
Course Objectives 1. Practical English Usage, Michael Swan. OUP. 1995.
* To make students understand the explicit and implicit meanings of a 2. Remedial English Grammar, F.T. Wood. Macmillan.2007
text/topic; 3. On Writing Well, William Zinsser. Harper Resource Book. 2001
* To give exposure to new words and phrases, and aid to use them in 4. Study Writing, Liz Hamp-Lyons and Ben Heasly. Cambridge Univer-
different contexts; sity Press. 2006.
* To apply relevant writing formats to draft essays, letters, emails and 5. Communication Skills, Sanjay Kumar and Pushp Lata. Oxford Uni-
presentations; and versity Press. 2011.
* To adapt oneself to a given situation and develop a functional approach 6. Exercises in Spoken English, Parts. I-III. CIEFL, Hyderabad. Oxford
to finding solutions: adaptability and problem solving. University Press.
Course Outcomes
AI1104 : COMPUTER PROGRAMMING USING C
* Students will be able to analyse a given text and discover the various
aspects related to language and literature; Course Objectives
* Learn the various language structures, parts of speech and figures of * The course is designed to provide complete knowledge of C language.
speech; * To provide students with understanding of code organization and func-
* Develop one’s reading and writing abilities for enhanced communica- tional hierarchical decomposition with using complex data types.
tion; and * To provide knowledge to the students to develop logics which will help
* Learn to apply the topics in real-life situations for creative and critical use. them to create programs, applications in C.
* This course aims to identify tasks in which the numerical techniques
SYLLABUS learned are applicable and apply them to write programs, and hence use
On the conduct of life: William Hazlitt computers effectively to solve the task.
Life skills: Values and Ethics If: Rudyard Kipling The Brook: Alfred Tennyson * This course provides the fundamental knowledge which is useful in
Life skills: Self-Improvement How I Became a Public Speaker: George understanding the other programming languages.
Bernard Shaw The Death Trap: Saki
Course Outcomes
Life skills: Time Management On saving Time: Seneca Chindu Yellama
* Identify basic elements of C programming structures like data types,
Life skills: Innovation Muhammad Yunus Politics and the English Lan- expressions, control statements, various simple functions and apply them in
guage: George Orwell problem solving.
Life skills: Motivation Dancer with a White Parasol: Ranjana Dave * Apply various operations on derived data types like arrays and strings in
Grammar: Prepositions – Articles – Noun-Pronoun Agreement, Subject- problem solving.
Verb Agreement – Misplaced Modifiers–Clichés, Redundancies. * Design and implement of modular Programming and memory man-
Vocabulary: Introduction to Word Formation – Root Words from other agement using Functions, pointers.
Languages –Prefixes and Suffixes–Synonyms, Antonyms– Common Abbre- * Apply Structure, Unions and File handling techniques to Design and
viations Solve different engineering programs with minimal complexity.
Writing: Clauses and Sentences – Punctuation – Principals of Good * Apply Numerical methods to Solve the complex Engineering problems.
Writing – Essay Writing – Writing a Summary Writing: Essay Writing Life skills:
Innovation Muhammad Yunus

213
 SYLLABUS 4. Scientific Programming: C-Language, Algorithms and Models in Sci-
Introduction to C: Basic structure of C program, Constants, Variables ence, Luciano M. Barone (Author), EnzoMarinari (Author), Giovanni Organtini,
and data types, Operators and Expressions, Arithmetic Precedence and asso- World Scientific.
ciativity, Type Conversions. Managing Input and Output Operations Formatted AI1105 : IT ESSENTIALS
Input, Formatted Output.
Decision Making, Branching, Looping: Decision making with if state- Course Objectives
ment, Simple if statement, The if…else statement, Nesting of if…else state- * Select the appropriate computer components to build, repair, or up-
ment, the else.. if ladder, switch statement, the (?:) operator, the GOTO state- grade personal computers.
ment., The while statement, the do statement, The for statement, Jumps in * Explain how to correctly use tools and safely work in a lab.
Loops.
* Install components to build, repair, or upgrade personal computers.
Arrays & Strings: One, Two-dimensional Arrays, Character Arrays. Dec-
laration and initialization of Strings, reading and writing of strings, String han- * Configure computers to communicate on a network
dling functions, Table of strings. * Configure devices to connect to the Internet and Cloud services
Functions: Definition of Functions, Return Values and their Types, Func- * Explain how to use, configure, and manage laptops and mobile devices
tion Calls, Function Declaration, Category of Functions: No Arguments and no
Course Outcomes
Return Values, Arguments but no Return Values, Arguments with Return Val-
ues, No Argument but Returns a Value, Functions that Return Multiple Values. * Understands the roles and responsibilities of the IT professional
Nesting of functions, recursion, passing arrays to functions, passing strings * Able to Troubleshoot advanced hardware and software problems
to functions, the scope, visibility and lifetime of variables. * Provides an experience-oriented course that employs industry-relevant in-
Pointers: Accessing the address of a variable, declaring pointer vari- structional approaches to prepare students for entry-level jobs in the industry.
ables, initializing of pointer variables, accessing variables using pointers, chain
of pointers, pointer expressions, pointers and arrays, pointers and character SYLLABUS
strings, array of pointes, pointers as function arguments, functions returning Introduction to the Personal Computer Describe a Computer System,
pointers, pointers to functions, pointers to structures-Program Applications. Identify the Names, Purposes, and Characteristics of Cases and Power Sup-
Structure and Unions: Defining a structure, declaring structure variables, plies, Identify the Names, Purposes, and Characteristics of Internal Compo-
accessing structure members, structure initialization, copying and comparing nents, Identify the Names, Purposes, and Characteristics of Ports and Cables,
structure variables, arrays of structures, arrays within structures, structures Identify the Names, Purposes, and Characteristics of Input Devices, Identify
within structures, structures and functions and unions, size of structures and the Names, Purposes, and Characteristics of Output Devices, Explain System
bit-fields- Program applications. Resources and Their Purposes.
File handling: Defining and opening a file, closing a file, Input/ Output Safe Lab Procedures and Tool Use Explain the Purpose of Safe Working
operations on files, Error handling during I/O operations, random access to Conditions and Procedures, Identify Tools and Software Used with Personal
files and Command Line Arguments- Program Applications. Computer Components and Their Purposes, Implement Proper Tool Use.
Text Books Computer Assembly Attach the Components to the Motherboard and
1. Programming in ANSI C, E Balagurusamy, 6th Edition. McGraw Hill Install the Motherboard, Install Internal Drives, Install Drives in External Bays,
Education (India) Private Limited. Install Adapter Cards, Connect the Power Cables Reattach the Side Panels to
the Case, Boot the Computer for the First Time. Basics of Preventive Mainte-
Reference Books
nance and Troubleshooting Explain the Purpose of Preventive Maintenance,
1. Let Us C ,Yashwant Kanetkar, BPB Publications, 5th Edition. Identify the Steps of the Troubleshooting Process.
2. Computer Science, A structured programming approach using C”, Fundamental Laptops and Portable Devices Identify Common Preven-
B.A.Forouzan and R.F.Gilberg, “ 3rd Edition, Thomson, 2007. tive Maintenance Techniques for Laptops and Portable Devices, Describe How
3. The C –Programming Language’ B.W. Kernighan, Dennis M. Ritchie, to Troubleshoot Laptops and Portable Devices.
PHI.

214
 Fundamental Operating Systems Explain the Purpose of an Operating * Students will be able to express themselves fluently and accurately in
System, Describe and Compare Operating Systems to Include Purpose, Limi- social as well professional context.
tations, and Compatibilities, Determine Operating System Based on Cus-
tomer Needs, Install an Operating System, Identify and Apply Common Pre- SYLLABUS
ventive Maintenance Techniques for Operating Systems, Troubleshoot Oper- Introduction to Phonetics: The Sounds of English (Speech sound – vow-
ating Systems. els and consonants) - Stress and Intonation - Accent and Rhythm.
Fundamental Networks Explain the Principles of Networking, Describe Listening Skills: Listening for gist and specific information - listening for
Types of Networks, Describe Basic Networking Concepts and Technologies, Note taking, summarizing and for opinions - Listening to the speeches of
Describe the Physical Components of a Network, Describe LAN Topologies eminent personalities.
and Architectures. Speaking Skills: Self-introduction - Conversation Skills (Introducing and
Fundamental Security: Explain Why Security Is Important, Describe Se- taking leave) - Giving and asking for information - Role Play - Just A Minute
curity Threats, Identify Security Procedures, Identify Common Preventive Main- (JAM) session - Telephone etiquette.
tenance Techniques for Security, Troubleshoot Security. Reading and Writing skills: Reading Comprehension – Précis Writing -
Text books: E-Mail writing - Punctuation.
1. IT Essentials: PC Hardware and Software Companion Guide Fourth Presentation skills: Verbal and non-verbal communication - Body Lan-
Edition, Cisco Networking Academy. guage - Making a Presentation
References: Reference Books
1. Network security essentials application and standrads, by William 1. Ashraf Rizvi. Effective Technical Communication. Tata McGraw Hill
stallings, 4th edition, prentice hall. Education Private Limited, New Delhi.
2. Mike Meyers’ CompTIA A+ Guide to Managing and Troubleshooting 2. Speak Well. Orient Blackswan Publishers, Hyderabad.
PCs, Sixth Edition 6th Edition
3. Allan Pease. Body Language. Manjul Publishing House, New Delhi.
AIS1106 : COMMUNICATION SKILLS LAB
AI1107 : COMPUTER ENGINEERING WORKSHOP LAB
Course Objectives
Course Objectives
* To make students recognize the sounds of English through Audio-Vi-
* Explain the internal parts of a computer, peripherals, I/O ports, connect-
sual aids;
ing cables
* To help students build their confidence and help them to overcome their
* Demonstrate basic command line interface commands on LINUX
inhibitions and self- consciousness while speaking in English;
* Teach the usage of Internet for productivity and self-paced lifelong learn-
* To familiarize the students with stress and intonation and enable them
ing
to speak English effectively; and
* Describe about Compression, Multimedia and Antivirus tools
* To give learners exposure to and practice in speaking in both formal and
informal contexts. * Demonstrate Office Tools such as Word processors, Spreadsheets
and Presentation tools
Course Outcomes
Course Outcomes
* Students will be sensitized towards recognition of English sound pat-
terns and the fluency in their speech will be enhanced; * Assemble and disassemble components of a PC
* A study of the communicative items in the laboratory will help students * Construct a fully functional virtual machine, Summarize various LINUX
become successful in the competitive world; operating system commands.
* Students will be able to participate in group activities like roleplays, * Able to Troubleshoot hardware and software problems.
group discussions and debates; and

215
 SYLLABUS 6. Creating Power Point: Student should work on basic power point
utilities and tools in Latex and Ms Office/equivalent (FOSS) which help them
Module I – Hardware Concepts create basic power point presentation. PPT Orientation, Slide Layouts, Insert-
1. Every student should identify the peripherals of a computer, compo- ing Text, Formatting Text, Bullets and Numbering, Auto Shapes, Lines and
nents in a CPU and its functions. Draw the block diagram of the CPU along Arrows, Hyperlinks, Inserting Images, Tables and charts.
with the configuration of each peripheral and submit to your instructor. Every
student should disassemble and assemble the PC back to working condition. AI1108 : Computer Programming Using C Lab

Module II – Software Installations Course Objectives

1. Every student should individually install operating system like LINUX * To impart writing skill of C programming to the students and solving
or MS windows on the personal computer. The system should be configured problems.
as dual boot with both windows and LINUX. * To write and execute programs in C to solve problems such as Modularize
2. Hardware Troubleshooting: Students have to be given a PC which the problems into small modules and then convert them into programs.,
does not boot due to improper assembly or defective peripherals. They should * To write and execute programs in C to solve problems such as arrays,
identify the problem and fix it to get the computer back to working condition. files, strings, structures and different numerical methods.
3. Software Troubleshooting: Students have to be given a malfunction- * This reference has been prepared for the beginners to help them under-
ing CPU due to system software problems. They should identify the problem stand the basic to advanced concepts related to Objective-C Programming
and fix it to get the computer back to working condition. languages.
4. Cyber Hygiene: Students should learn about viruses on the internet
Course Outcomes
and install antivirus software. Student should learn to customize the browsers
to block pop ups, block active x downloads to avoid viruses and/or worms. * Understand various computer components, Installation of software. C
programming development environment, compiling, debugging, and linking
5. Web Browsers, Surfing the Web: Students customize their web brows- and executing a program using the development environment.
ers with the LAN proxy settings, bookmarks, search toolbars and popup
blockers. * Analysing the complexity of problems, Modularize the problems into
small modules and then convert them into programs.
Module III – MS-Office * Construct programs that demonstrate effective use of C features includ-
1. MS Word - Features to be covered: Formatting Fonts in word, Drop ing arrays, strings, structures, pointers and files.
Cap in word, Applying Text effects, Using Character Spacing, Borders and * Apply and practice logical ability to solve the real-world problems.
Colours, Inserting Header and Footer, Using Date.
* Apply Numerical methods to Solve the complex Engineering problems.
2. Creating project abstract Features to be covered: Formatting Styles,
inserting table, Bullets and Numbering, Changing Text Direction, Cell align- SYLLABUS
ment, Footnote, Hyperlink, Symbols, Spell Check, Track Changes. Practice the following concepts with algorithm, flow chart and implemen-
3. Creating a Newsletter: Features to be covered: Table of Content, News- tation.
paper columns, Images from files and clipart, Drawing toolbar and Word Art, 1. C – Tokens, Data Types - Format Specifiers, I/O Statements.
Formatting Images, Textboxes, Paragraphs in word.
2. Operators in C, their Precedence and Associativity, Arithmetic Expres-
4. Spreadsheet Orientation: Accessing, overview of toolbars, saving sions/Instructions, Type casting, Math.h functions.
spreadsheet files, Using help and resources. Creating a Scheduler: Gridlines,
Format Cells, Summation, auto fill, Formatting Text. 3. Control Statements (Conditional): If and its Variants, Switch (Break).
4. Goto Statement, Control Statements (Looping): While, Do-While, For
5. Calculating GPA - Features to be covered: Cell Referencing, Formu-
Loop, Continue & Break (Unconditional), Nested Loops
lae in spreadsheet – average, std. deviation, Charts, Renaming and Inserting
worksheets, Hyper linking, Count function, Sorting, Conditional formatting. 5. Arrays, One Dimensional Array: Declaration and Initialization, Access-
ing Array Elements.

216
 6. Two Dimensional Array: Declaration and Initialization, Accessing Ar- * Discriminate among the structure and procedure of solving higher order
ray Elements. differential equations with constant and variable coefficients.
7. Strings: Read & Write, “String.h” Predefined Functions, without pre- * Understand Laplace transforms and its properties and finding the solu-
defined functions. Pointers: Declarations, Types, Pointers to Arrays, Pointers tion of ordinary differential equations.
to Character Strings, Pointers to Pointers, Array of Pointers
SYLLABUS
8. Structures: Nested Structures, Pointers to Structures, Unions.
Linear Algebra: Rank of a matrix- Echelon form, Normal Form - Solution
9. Functions: Function Declaration, Classification (Arguments and Re-
of Linear System of Equations - Consistency of Linear System of Equations -
turn Type), Storage Classes.
Direct & Indirect Methods: Gauss elimination method, LU Factorization method,
10. Parameter Passing Techniques, Passing Parameters Types, Recursion Gauss Seidal Method. Complex Matrices: Hermitian, Skew-Hermitian and
11. Files: Opening, Closing of Files, Reading and Writing of Files. Unitary Matrices and their Properties.
12. Binary Files, Random Accessing of Files, Enum, Typedef, Pre-pro- Eigen Values and Eigen Vectors: Eigen Values and Eigen Vectors of a
cessor Commands. Matrix - Cayley- Hamilton theorem - Inverse and Powers of a Matrix using
13. Numerical methods: Bisection method, Newton Raphson method, Cayley-Hamilton’s theorem and its applications. Diagonalization of a Matrix -
Lagrange’s interpolation, Simpson’s rule for numerical integration. Quadratic Forms - Reduction of Quadratic Form to Canonical Form - Nature of
a Quadratic Form.
References:
Ordinary Differential Equations of First Order and its Applications: For-
1. Programming in ANSI C, E Balagurusamy, 6th Edition. McGraw Hill
Education (India) Private Limited. mation of ordinary differential equations (ODEs) - Solution of an ordinary differ-
ential equation - Equations of the first order and first degree - Linear differen-
2. Introduction to Numerical Methods, SS Sastry, Prentice Hall tial equation - Bernoulli’s equation - Exact differential equations - Equations
reducible to exact equations - Orthogonal Trajectories - Simple Electric (LR &
I Year-II Semester
CR) Circuits - Newton’s Law of Cooling - Law of Natural growth and decay.
AI1201: ENGINEERING MATHEMATICS – II Differential Equations of Higher Order: Solutions of Linear Ordinary Dif-
ferential Equations with Constant Coefficients - Rules for finding the compli-
Course Objectives mentary function - Rules for finding the particular integral - Method of variation
* The way of obtaining rank, eigen values and eigen vectors of a matrix. of parameters - Cauchy’s linear equation - Legendre’s linear equation - Si-
* To know the importance of Cayley-Hamilton theorem and getting ca- multaneous linear differential equations.
nonical form from a given quadratic form. Laplace Transforms: Introduction - Existence Conditions - Transforms of
* To solve the system of equations by using direct and indirect methods. Elementary Functions - Properties of Laplace Transforms - Transforms of
Derivatives - Transforms of Integrals - Multiplication by tn - Division by t –
* To solve first order and higher order differential equations by various
Evaluation of integrals by Laplace Transforms - Inverse Laplace Transform -
methods.
Applications of Laplace Transforms to Ordinary Differential Equations - Simul-
* To obtain the Laplace transforms and inverse Laplace transforms for a taneous Linear Differential Equations with Constant Coefficients - Second
given functions and their applications. Shifting Theorem - Laplace Transforms of Unit Step Function, Unit Impulse
Course Outcomes Function and Laplace Transforms of Periodic Functions.
* Find rank, eigen values and eigen vectors of a matrix and understand Text Book
the importance of Cayley- Hamilton theorem. 1. Scope and Treatment as in “Higher Engineering Mathematics”, by Dr.
B.S. Grewal, 43rd edition, Khanna publishers.
* Reduce quadratic form to canonical forms and solving linear systems
by direct and indirect methods. Reference Books
* Demonstrate solutions to first order differential equations by various 1. Graduate Engineering Mathematics by V B Kumar Vatti., I.K. Interna-
methods and solve basic applications problems related to electrical circuits, tional publishing house Pvt. Ltd.
orthogonal trajectories and Newton’s law of cooling 2. Advanced Engineering Mathematics by Erwin Kreyszig.

217
 3. A text book of Engineering Mathematics, by N.P. Bali and Dr. Manish SYLLABUS
Goyal. Lakshmi Publications. Thermodynamics: Introduction, Heat and Work, First law of thermody-
4. Advanced Engineering Mathematics by H.K. Dass. S. Chand Com- namics and applications, Reversible and Irreversible process, Carnot cycle
pany. and Efficiency, Second law of thermodynamics, Carnot’s Theorem, Entropy,
5. Higher Engineering Mathematics by B.V. Ramana, Tata Mc Graw Hill Second law in terms of entropy, Entropy and disorder, Third law of thermody-
Company. namics (statement only).
Electromagnetism: Concept of electric flux, Gauss’s law - some applica-
AI1202 : ENGINERING PHYSICS tions, Magnetic field - Magnetic force on current, torque on current loop, The
Course Objectives Biot-Savart’s Law, B near a long wire, B for a circular Current loop, Ampere’s
law, B for a solenoid, Hall effect, Faraday’s law of induction, Lenz’s law, In-
* To impart knowledge in basic concept of physics of Thermodynamics
duced magnetic fields, Displacement current, Maxwell’s equations (no deriva-
relevant to engineering applications. tion), Magnetic materials: Classification of magnetic materials and properties.
* To grasp the concepts of physics for electromagnetism and its applica- Ultrasonics: Introduction, Production of Ultrasonics – Piezoelectric and
tion to engineering. Learn production of Ultrasonics and their applications in Magnetostriction methods, acoustic grating, applications of ultrasonics.
engineering.
* To Develop understanding of interference, diffraction and polarization: Optics-
connect it to a few engineering applications. Interference: Principles of superposition – Young’s Experiment – Coher-
* To Learn basics of lasers and optical fibres and their use in some ence - Interference in thin films (reflected light), Newton’s Rings, Michelson
applications. Interferometer and its applications.
* To Understand concepts and principles in quantum mechanics and Diffraction: Introduction, Differences between interference and diffraction,
Nanophase Materials. Relate them to some applications. Fresnel and Fraunhofer diffraction, Fraunhofer diffraction at a single slit (Quali-
tative and quantitative treatment).
Course Outcomes Polarisation: Polarisation by reflection, refraction and double refraction in
* Understand the fundamentals of Thermodynamics and Laws of ther- uniaxial crystals, Nicol prism, Quarter and Half wave plate, circular and ellipti-
modynamics. Understand the working of Carnot cycle and concept of entropy. cal polarization.
* Gain Knowledge on the basic concepts of electric and magnetic fields. Lasers And Fibre Optics: Introduction, characteristics of a laser beam,
Understand the concept of the nature of magnetic materials. Gain knowledge spontaneous and stimulated emission of radiation, population inversion, Ruby
on electromagnetic induction and its applications. laser, He-Ne laser, Semiconductor laser, applications of lasers Introduction to
* Understand the Theory of Superposition of waves. Understand the for- optical fibres, principle of propagation of light in optical fibres, Acceptance
mation of Newton’s rings and the working of Michelson’s interferometer. Re- Angle and cone of a fibre, Numerical aperture, Modes of propagations, classi-
member the basics of diffraction, Evaluate the path difference. Analysis of fication of fibres, Fibre optics in communications, Application of optical fibres.
Fraunhofer Diffraction due to a single slit Modern Physics- Introduction, De Broglie concept of matter waves,
* Understand the interaction of matter with radiation, Characteristics of Heisenberg uncertainty principle, Schrodinger time independent wave equa-
Lasers, Principle, working schemes of Laser and Principle of Optical Fibre. tion, application to a particle in a box. Free electron theory of metals, Kronig -
Realize their role in optical fibre communication. Penney model (qualitative treatment), Origin of energy band formation in sol-
* Understand the intuitive ideas of the Quantum physics and understand ids, Classification of materials into conductors, semi-conductors and insula-
dual nature of matter. Compute Eigen values, Eigen functions, momentum of tors.
Atomic and subatomic particles using Time independent one-Dimensional Nanophase Materials: Introduction, properties, Top-down and bottom-up
Schrodinger’s wave equation. Understand the fundamentals and synthesis approaches, Synthesis - Ball milling, Chemical vapour deposition method, sol-
processes of Nanophase materials. gel methods, Applications of nano materials.

218
Text Books CE configurations – h parameters, low frequency small signal equivalent cir-
1. Physics by David Halliday and Robert Resnick – Part I and Part II - Wiley. cuit of a Transistor.
2. A textbook of Engineering Physics, Dr. M. N. Avadhanulu, Dr. P.G. Transistor Biasing and thermal stabilization: Transistor Biasing, Stabili-
Kshirsagar - S. Chand zation, Different methods of transistor biasing – Fixed bias, Collector feedback
3. Engineering Physics by R.K. Gaurand S.L. Gupta–Dhanpat Rai bias – self bias – Bias compensation.
Reference Books Transistor Amplifiers: CE, CB, CC amplifier configurations –Multistage
amplifier – A Two Stage RC coupled amplifier – frequency response curve and
1. Modern Engineering Physics by A.S. Vadudeva
bandwidth.
2. University Physics by Young and Freedman
Field Effect Transistors: Junction Field Effect Transistors (JFET) – JFET
AI1203 : ELEMENTS OF ELECTRONICS ENGINEERING characteristics, JFET Parameters, Small signal equivalent circuit – MOSFETS
– Depletion and Enhancement MOSFETS.
Course Objectives
Text Books:
* Introduce students to basics of semiconductors, their classification and
properties 1. Electronic Device and Circuits by Sanjeev Guptha.
Reference Books:
* To provide theory of PN junction diode, its characteristics and applications
1. Electronic Device and Circuits Theory by Robert L. Boylested Elec-
* To introduce basics of rectifying circuits and bipolar junction transistor tronic Device and Circuits by David. A. Bell
* To provide basics of transistor biasing, transistor amplifiers and field
effect transistors AI1204 : DATA STRUCTURES USING C
Course Outcomes Course objectives
* By the end of the course, the student should be able to: * Assess how the choice of data structures and algorithm design meth-
* Explain the basics of semiconductors and their classification ods impacts the performance of programs.
* Understand the theory of PN junction diode, rectifying circuits and bipo- * Choose the appropriate data structure and algorithm design method for
lar junction transistor a specified application.
* Explain the concepts of transistor biasing, transistor amplifiers and field * Solve problems using data structures such as linear lists, stacks,
effect transistors queues, binary trees, heaps binary search trees, and graphs and writing pro-
grams for these solutions.
SYLLABUS
Course outcomes
Introduction to Electronics and Semiconductors: Energy band theory,
* Describe how arrays, records, linked structures, stacks, queues, trees,
Conduction in Insulators, Semiconductors and metals, Electron emission from
and graphs are represented in memory and used by algorithm.
metals, Classification of semiconductors, Carrier concentration in an intrinsic
semiconductor, Properties of intrinsic semiconductor, Drift and diffusion cur- * Demonstrate different methods for traversing trees.
rents. * Compare alternative implementations of data structures with respect to
Semi-Conductor Diode: Theory of PN junction diode, Open circuited PN performance.
junction, V-I characteristics of a PN diode, Diode current equation, Transition * Discuss the computational efficiency of the principal algorithms for sort-
and diffusion capacitances, Break down in PN diode, Applications of PN di- ing and searching
odes. Zener diode, Zener regulator, Tunnel diode, Schottky diode.
Rectifying circuits: Half wave and full wave rectifiers, Bridge rectifiers,
SYLLABUS
Efficiency, Ripple and regulation of each rectifier, Capacitor filters. Introduction to Data Structures: Review of C Programming, Recursive
Bipolar Junction Transistor: Introduction, construction, Operation of PNP Definition and Processes, Recursion in C, Simulation of Recursion, Efficiency
and NPN Transistors – Transistor Circuit configurations- Characteristics of a of Recursion, Abstract Data Types, Meaning and Definition of Data Structures,
Arrays.

219
 Stacks: Stack as an Abstract Data Type, Primitive Operations, Implement- * An ability to define different number systems, binary addition and sub-
ing Stack Operations using Arrays, Infix, Postfix and Prefix: Definitions, Evalua- traction, 2’s complement representation and operations with this representa-
tion and Conversions. tion.
Queues: Queue as an Abstract Data Type, Sequential Representation, * An ability to understand the different Boolean algebra theorems and
Types of Queues, Operations, Implementation using Arrays. apply them for logic functions.
Linked List: Operations, Implementation of Stacks, Queues and priority * An ability to define the Karnaugh map for a few variables and perform an
Queues using Linked Lists+, Circular Lists: Insertion, Deletion and Concat- algorithmic reduction of logic functions.
enation Operations, Stacks and Queues as Circular Lists, Doubly Linked Lists. * An ability to define the following combinational circuits: multiplexer, de-
Trees: Binary Trees - Definitions and Operations, Binary Tree Represen- multiplexers encoders/decoders, comparators, arithmetic-logic units; and to
tation: Node Representation, Implicit array Representation, Binary Tree Tra- be able to build simple circuits.
versal, Threaded Binary Trees and their Traversal, Trees and their Applica- * An ability to understand asynchronous and synchronous sequential
tions; Tree Searching: Insertion and Deletion of a node from a Binary Search circuits, like counters and shift registers.
Tree, Efficiency of Binary Search Tree operations.
* An ability to understand memories like RAM and ROM, Programmable
Searching: Basic Searching Techniques: Dictionary as an Abstract Data Logic Array and Programmable Array Logic.
Type, Algorithmic Notation, Sequential Searching and its Efficiency, Binary
Search, Interpolation Search. SYLLABUS
Sorting: General Background: Efficiency, Asymptotic Notations, Efficiency Binary Systems: Digital Systems. Binary Numbers. Number Base Con-
of Sorting, Bubble Sort and Quick Sort and their Efficiency, Selection Sorting, versions. Octal and Hexadecimal Numbers. Complements. Signed Binary
Binary Tree Sort, Heap Sort, Insertion Sorts, Shell Sort, Address calculation Numbers. Binary Codes. Binary Storage and Registers. Binary Logic
Sort, Merge and Radix Sorts. Boolean Algebra and Logic Gates: Basic Definitions. Axiomatic Defini-
Graphs and Their Application: Definition of Graphs, Representation of tion of Boolean Algebra. Basic Theorems and Properties of Boolean Algebra.
Graphs, Transitive closure, Linked Representation of Graphs, Topological Boolean Functions. Canonical and Standard Forms. Other Logic Operations.
Ordering of nodes, Graph Traversal and Spanning Forests, Undirected Graphs Digital Logic Gates. Integrated Circuits.
and their Traversals, Applications of Graphs, Minimal Spanning Trees. Combinational Logic Design, Gate-Level Minimization: The Map Method.
Textbooks Four Variable Map. Five-Variable Map. Product of Sums Simplification. Don’t-
1. Data Structures Using C and C++ Yddish Langsam, Care Conditions. NAND and NOR Implementation. Other Two- Level Imple-
Moshe J. Augenstein and Aaron M.Tanenbaum, Prentice Hall Of India (2nd mentations. Exclusive-OR Function. Hardware Description Language (HDL).
Edition) Combinational Logic: Combinational Circuits. Analysis Procedure. De-
2. Data Structures, Algorithms and Applications with C++, Sahani Mc- sign Procedure. Binary Adder Subtractor. Decimal Adder. Binary Multiplier. Mag-
Graw Hill. nitude Comparator. Decoders. Encoders. Multiplexers. HDL For Combina-
tional Circuits.
AI1205 : DIGITAL LOGIC DESIGN Sequential Logic Design, Synchronous Sequential Logic: Sequential
Course objectives Circuits. Latches Flipflops. Analysis of Clocked Sequential Circuits. HDL For
Sequential Circuits. State Reduction and Assignment. Design Procedure.
* To introduce the basic principles for design of combinational circuit and
sequential circuits. Registers ad Counters: Registers. Shift Registers. Ripple Counters. Syn-
chronous Counters. Other Counters. HDL for Registers and Counters.
* To learn simple digital circuits in preparation for computer engineering.
Memory and Programmable Logic: Introduction. Random-Access
Course Outcomes Memory. Memory Decoding, Error Detection and Correction. Read-Only Memory.
A student who successfully fulfils the course requirements will have dem- Programmable Logic Array. Programmable Array Logic. Sequential Program-
onstrated: mable Devices.

220
Text Book 8) Study and practice on awk with relevant commands, syntax, usage,
1. DigitalDesign,3rdEdition, M. Morris Mano, Pearson Education. application.
Reference Books 9) Study and practice on regular expressions and the grep family with
1. Digital Logic Design Principles, Norman Balabanian & Bradley relevant commands, syntax, usage, application.
Carlson, John Wiley &Sons (Asia) Pvt.Ltd.,2002 10) Study and practice on compilation process of C programs under UNIX.
2. Fundamentals of Digital Logic with VHDL Design, Stephen Brown References:
and ZvonkoVranesic, TataMcGraw-HillEdition,2002. 1. Unix concepts and applications by Sumitabha Das, TMH Publications.
AI1206 : LINUX ADMINISTRATION LAB 2. Shell programming by Yashwanth Kanetkar.

Course Objectives AI1207 : ENGINNERING PHYSICS LAB

* To understand LINUX operating system and its internals. Course Objectives
* To understand LINUX file system structure and its operations. * To enable the students to acquire skill, technique and utilization of the
* To understand LINUX shell environment and its programming. Instruments
* To understand communication in LINUX and the corresponding primi- * Draw the relevance between the theoretical knowledge and to imply it in
tives. a practical manner with respect to analyse various electronic circuits and its
components.
Course Outcomes
* To impart the practical knowledge in basic concepts of Wave optics,
* The student learns about LINUX features for multiuser, multitasking Lasers and fibre optics.
capabilities.
* To familiarize the handling of basic physical apparatus like Vernier cal-
* The student learns about file system organization, file and directory lipers, screw gauge, spectrometers, travelling microscope, laser device, opti-
manipulation, setting file permissions, and disk free space administration. cal fibre, etc.
* The student learns about writing shell scripts for different applications.
Course Outcomes
* The student learns about how users communicate with each other in
* Ability to design and conduct experiments as well as to analyse and
LINUX environment.
interpret
SYLLABUS * Ability to apply experimental skills to determine the physical quantities
1) Study and practice on file system / handling files with commands, related to Heat, Electromagnetism and Optics
syntax, usage, application. * The student will learn to draw the relevance between theoretical knowl-
2) Practice on vi editor. edge and the means to imply it in a practical manner by performing various
relative experiments.
3) Study and practice on redirection operators with relevant commands,
syntax, usage, application. SYLLABUS
4) Study and practice on filters with relevant commands, syntax, usage, 1. Determination of Radius of Curvature of a given Convex Lens By
application. forming Newton’s Rings.
5) Study and practice on Backup with relevant commands, syntax, us- 2. Determination of Wavelength of Spectral Lines in the Mercury Spec-
age, application. trum by Normal Incidence method.
6) Study and practice on internet related commands, syntax, usage, 3. Study the Intensity Variation of the Magnetic Field along axis of Current
application. Carrying Circular Coil.
7) Study and practice on shells/shell programming with relevant pro- 4. Determination of Cauchy’s Constants of a Given Material of the Prism
gramming constructs, syntax, usage, application. using Spectrometer.

221
 5. Determination of Refractive Index of Ordinary ray ?o and Extraordinary 7. Write a C program for converting a given infix expression to postfix
?e ray. form using stack.
6. Determination of Thickness Given Paper Strip by Wedge Method. 8. Write a C program to implement the operations on single linked list.
7. Calibration of Low Range Voltmeter. 9. Write a C program for demonstrate operations on double linked list.
8. Calibration of Low Range Ammeter. 10. Write a C program for the representation of polynomials using circu-
9. Determination of Magnetic Moment and Horizontal Component of lar linked list and for the addition of two such polynomials
Earth’s Magnetic Field. 11. Write a C program to create a binary search tree and for implement-
10. Lees Method - Coefficient of thermal Conductivity of a Bad Conductor. ing the in order, Pre order, post order traversal using recursion
11. Carey Foster’s Bridge – Verification of laws of Resistance and Deter- 12. a) Write a C program for finding the transitive closure of a digraph
mination of Specific Resistance. b) Write a C program for finding the shortest path from a given source to
12. Melde’s Apparatus – Frequency of electrically maintained Tuning Fork. any vertex in a digraph using Dijkstra’s algorithm.
13. Photoelectric cell-Characteristics. 13. a) Write a C program for finding the Depth First Search of a graph.
14. Planks Constants. b) Write a C program for finding the Breadth First Search of a graph
15. Laser- Diffraction. References:
1. Data Structures Using C and C++ Yddish Langsam, Moshe J.
AI1208 : DATA STRUCTURES LAB Augenstein and Aaron M.Tanenbaum, Prentice Hall Of India (2nd Edition)
Course Objectives 2. Data Structures, Algorithms and Applications with C++, Sahani Mc-
Graw Hill.
* To implement stacks and queues using arrays and linked lists.
* To develop programs for searching and sorting algorithms. II Year – I Semester
* To write programs using concepts of various trees. AI2101 : DISCRETE MATHEMATICAL STRUCTURES
* To implement programs using graphs.
Course Objectives
Course Outcomes
* To understand mathematical arguments using logical connectives and
* Student will be able to write programs to implement stacks and queues. quantifiers and verify the validity of logical flow of arguments using proposi-
* Ability to implement various searching and sorting techniques. tional, predicate logic and truth tables.
* Ability to implement programs using trees and graphs. * To understand about permutations and combinations.
* To understand various types of relations and discuss various properties
SYLLABUS of the relations.
List of Programs: * To study the graphs, graph isomorphism and spanning trees.
1. Write a C program for sorting a list using Bubble sort and then apply * To study about Boolean algebra and Finite State Machines.
binary search.
Course Outcomes
2. Write a C program for implementing the operations of a queue.
At the end of the course student will be able to
3. Write a C program to implement the operations on priority queues.
* Rewrite mathematical arguments using logical connectives and quan-
4. Write a C to implement the operations on circular queues. tifiers and verify the validity of logical flow of arguments using propositional,
5. Write a C program to implement the operations on stacks. predicate logic.
6. Write a C program for evaluating a given postfix expression using * Identify and give examples of various types of relations and describe
stack. various properties of the relations.

222
 * Ability to solve problems using permutations and combinations. Reference Books
* Determine isomorphism of graphs and spanning tree of a given graph 1. Discrete Mathematics for Computer Scientists & Mathematicians by
using BFS/DFS algorithms. Also determine minimal spanning tree of a given Joe L. Mott, Abraham Kandel, Theodore P. Baker, Prentice-Hall, India.
graph. 2. Discrete Mathematics by Richard Johnson Baug, Pearson Educa-
tion, New Delhi.
SYLLABUS
3. Discrete and Combinatorial Mathematics by Ralph. G. Grimaldi,
The Foundations-Logic and Proofs: Propositional Logic, Propositional Pearson Education, New Delhi.
Equivalences, Predicates and Quantifiers, Nested Quantifiers Rules of Infer-
ence, Introduction to Proofs, Proof Methods and Strategy, Basic Structures- AI2102 : COMPUTER ORGANIZATION AND ARCHITECTURE
Sets, Functions, Sequences and Sums: Sets, Set Operations, Functions, Se-
quences and Summations. Course Objectives
The Fundamentals-Algorithms, the Integers and Matrices: Algorithms, * To study about structure and functional components of a computer.
The Growth of Functions, Complexity of Algorithms, The Integers and Division, * Understanding the hierarchical organization of a computer system which
Primes and Greatest Common Devisors, Integers and Algorithms, Applica- consists of instruction set of commands.
tions of Number Theory, Matrices. * Learn about the architecture of a computer from a programming view.
Induction and Recursion: Mathematical Induction, Strong Induction and * To design a balance system that minimizes performance and utilization
Well-Ordering, Recursive Definitions and Structural Induction, Recursive Algo- of all elements.
rithms, Program Correctness.
Counting: The Basics of Counting, The Pigeonhole Principle, Permuta- Course Outcomes
tions and Combinations, Binomial Coefficients, Generalized Permutations By the end of the course, the student should be able to:
and Combinations, Generating Permutations and Combinations. * Demonstrate knowledge about major components of a computer such
Advanced Counting Techniques: Recurrence Relations, Solving Linear as processor, memory and I/O modules along with their interconnections in-
Recurrence Relations, Divide-and-Conquer Algorithms and Recursion Rela- ternally with outside world.
tions, Generating Functions, Inclusion-Exclusion, and Applications of Inclu- * have detailed idea about architecture of central processing unit, func-
sion-Exclusion. tions of control unit, memory, I/O devices and their issues.
Relations: Relations and their properties, n-ary relations, applications, * Understand simple and multiple processor organization and their is-
Representation, closure, equivalence relations, Partial orderings. sues.
Graphs: Graphs and Graph Models, Graph Terminology and Special Types
of Graphs, Representing Graphs and Graph Isomorphism, Connectivity, Euler SYLLABUS
and Hamilton Paths, Shortest-Path Problems, Planar Graphs, Graph Colouring. Register Transfer and Micro operations: Register Transfer Language,
Trees: Introduction to Trees, Applications of Trees, Tree Traversal, Span- Register Transfer, Bus and Memory Transfers, Arithmetic Micro operations,
ning Trees, Minimum Spanning Trees, Logic Micro operations, Shift Micro operations, Arithmetic Logic Shift Unit.
Boolean Algebra: Boolean Functions, Representing Boolean Functions, Basic Computer Organization and Design: Instruction Codes, Computer
Logic Gates, Minimization of Circuits Registers, Computer Instructions, Timing and Control, Instruction Cycle,
Memory-Reference Instructions, Input- Output and Interrupt, Complete Com-
Modelling Computation: Languages and Grammars, Finite-State Ma-
puter Description, Design of Basic Computer, Design of Accumulator Logic.
chines with Output, Finite-State Machines with No Output, Language Recogni-
tion, Turing Machines. Micro programmed Control: Control Memory, Address Sequencing, Mi-
cro program Example, Design of Control Unit.
Text Book
1. Discrete Mathematics & Its Applications with Combinatorics and Graph Central Processing Unit: Introduction, General Register Organization,
Theory by Kenneth H Rosen, Tata McGraw-Hill Publishing Company Ltd., New Stack Organization, Instruction Formats, Addressing Modes, Data Transfer
Delhi. and Manipulation, Program Control, Reduced Instruction Set Computer (RISC),
Architecture and Programming of 8085 Microprocessor
223
 Pipeline and Vector Processing: Parallel Processing, Pipelining, Arith- * Compute and interpret the results of Correlation Analysis, Multivariate
metic Pipeline, Instruction Pipeline, RISK Pipeline, Vector Processing, Array Regression, Chi-Square test for Independence and Goodness of Fit
Processors. * Explain basic concepts in Markov processes, M/M/1 and M/M/C queue-
Input/output Organization: Peripheral Devices, I/O interface, Asynchro- ing systems.
nous data transfer, Modes of transfer, priority Interrupt, Direct memory access,
Input-Output Processor (IOP), Serial Communication. SYLLABUS
Memory Organization: Memory Hierarchy, Main memory, Auxiliary memory, Probability: Definitions of probability, Addition theorem, Conditional prob-
Associate Memory, Cache Memory, and Virtual memory, Memory Management ability, Multiplication theorem, Bayes Theorem of Probability and Geometric
Hardware. Probability.
Text Books Random variables and their properties: Discrete Random Variable, Con-
1. Computer System Architecture, M. Morris Mano, Prentice Hall of India tinuous Random Variable, Probability Distribution, Joint Probability Distribu-
Pvt. Ltd., Third Edition, Sept.2008. tions their Properties, Transformation Variables, Mathematical Expectations,
Probability Generating Functions.
2. Computer Architecture and Organization, P.Chakraborty.
Probability Distributions: Discrete Distributions: Binomial, Poisson
3. Microprocessor Architecture, Programming and Applications with the Negative Binominal Distributions and Their Properties; Continuous Distribu-
8085by Ramesh S Gaonkar tions: Uniform, Normal, Exponential Distributions And Their Properties.
Reference Books Multivariate Analysis: Correlation, Correlation Coefficient, Rank Correla-
1. Computer Architecture and Organization, William Stallings, PHI Pvt. tion, Regression Analysis, Multiple Regression, Attributes, Coefficient Of As-
Ltd., Eastern Economy Edition, Sixth Edition, 2003. sociation, Chi Square Test For Goodness Of Fit, Test For Independence.
2. Computer Organization and Architecture, Linda Null, Julia Lobur, Estimation: Sample, Populations, Statistic, Parameter, Sampling Distri-
Narosa Publications ISBN81- 7319-609-5 bution, Standard Error, Un- biasedness, Efficiency, Maximum Likelihood Esti-
3. Computer System Architecture”, John. P.Hayes. mator, Notion & Interval Estimation.
Testing of Hypothesis: Formulation of Null hypothesis, critic al region,
AI2103 : PROBABILITY, STATISTICS AND QUEUING THEORY
level of significance, power of the test;
Course objectives Sample Tests: Small Sample Tests: Testing equality of means, testing
* To provide foundations of probabilistic and statistical analysis equality of variances, test of correlation coefficient, test for Regression Coeffi-
cient; Large Sample tests: Tests based on normal distribution
* To provide an understanding on concepts of probability, random vari-
ables, probability distributions, sampling, estimation, hypothesis testing, re- Queuing Theory: Queue description, characteristics of a queuing model,
gression, correlation, multiple regression, hypothesis testing, sample test, study state solutions of M/M/1: Model, M/M/1; N Model, M/M/C: Model, M/M/C: N
queuing methods Model, Case studies.
* To explore applications of probabilistic and statistical tools to solve real Text Books
world problems. 1. Probability & Statistics for Engineers and Scientists, Walpole, Myers,
Myers, Ye. Pearson Education.
Course outcomes
2. Probability, Statistics and Random Processes T.Veerarajan Tata
After completion of the course the student should be able to: McGraw – Hill
* Define and explain basic concepts in probability theory and how to trans- Reference Book
late real-world problems into probability models
1. Probability & Statistics with Reliability, Queuing and Computer Appli-
* Solve standard problems that include random variables, discrete and cations, Kishor S. Trivedi, Prentice Hall of India ,1999
continuous probability distributions
* Perform Test of Hypothesis and construct a confidence interval to esti-
mate population parameters

224
 AI2104 : OPERATING SYSTEMS File Systems, Implementation, and Secondary-storage Structure: Con-
cept of a file, Access Methods, Directory Structure, Protection, File System
Course objectives: Structure, Allocation Methods, Free Space Management, Directory Manage-
* To understand evolution of Operating System. ment, Device Drivers, overview of Mass-storage structure, Disk structure, disk
* To understand operating system as a layer of abstraction above physi- attachment, disk scheduling, swap-space management.
cal hardware that facilitates usage convenience and efficient resource man- Case study: Overview of LINUX, Windows Operating systems.
agement of computer system resources. Text Book:
* To learn design and implementation of policies and mechanisms for 1. Operating Systems, Abraham Silberschatz, Peter Baer Galvin, and
OS subsystem. Greg Gagne, John Wiley Publ., Seventh Edition.
* To investigate case studies to understand the design philosophies / 2. Operating Systems; A Practical Approach. Rajiv Chopra.
paradigm for popular multiuser or single user operating system. Reference Books:
Course Outcomes: 1. Modern Operating Systems, Andrew S. Tanenbaum, ,2nd edition,
* The student understands OS evolution, its structure and services pro- 1995, PHI.
vided by it. 2. Operating Systems, William Stallings 5th Edition -PHI
* Learn process life cycle, process scheduling objectives, policies and 3. Operating Systems: A Design-Oriented Approach’, Charles Crowley,
mechanisms, process synchronization, inter process communication, dead- ‘Tata Hill Co.,1998 edition.
locks and other process subsystem related concepts.
AI2105 : OBJECT ORIENTED PROGRAMMING THROUGH JAVA
* Learn memory hierarchy, allocation and deallocation policies and mecha-
nism for main and auxiliary memory, file system design and implementation Course Objectives:
issues. * This subject will help to improve the analytical skills of object-oriented
* investigate UNIX/ LINUX and Windows OS platforms w.r.t similarities programming
and differences in design philosophies. * Overall development of problem solving and critical analysis
SYLLABUS * Formal introduction to Java programming language
Introduction to Operating Systems: Over View of Operating Systems, Types Course Outcome:
of Operating Systems, Operating System Structures, Operating System Services,
On successful completion of this course, the student should be able to:
System Calls, Virtual Machines, Operating System Design and Implementation.
* Show competence in the use of the Java programming language in the
Process Management: Process Concepts, Operations on Processes,
development of small to medium-sized application programs that demon-
Cooperating Processes, Threads, Inter Process Communication, Process
strate professionally acceptable coding and performance standard
Scheduling, Scheduling Algorithms, Multiple- Processor Scheduling, Thread
Scheduling. * Understand the basic principles of the object-oriented programming
Process Synchronization: The Critical Section Problem, Peterson’s So- * Demonstrate an introductory understanding of graphical user interfaces,
lution, Synchronization Hardware, Semaphores, Classical Problems of Syn- multi- threaded programming, and event-driven programming.
chronization, Critical Regions, Monitors.
SYLLABUS
Deadlocks: System Model, Deadlock Characterization, Methods For Han-
Introduction to Java: Basics of Java programming, Data types, Variables,
dling Deadlocks, Deadlock Prevention, Avoidance, Deadlock Detection, Re-
Operators, Control structures including selection, Looping, Java methods,
covery from Deadlocks.
Overloading, Math class, Arrays in java.
Memory Management: Logical versus Physical Address, Swapping, con-
Objects and Classes: Basics of objects and classes in java, Construc-
tiguous memory allocation, paging, structure of the page table, segmentation,
tors, Finalizer, Visibility modifiers, Methods and objects, Inbuilt classes like
Virtual Memory, Demand Paging, Page Replacement, Allocation of Frames,
String, Character, StringBuffer, File, this reference
Thrashing, Memory-Mapped files.

225
 Inheritance and Polymorphism: Inheritance in java, Super and sub class, Course Outcomes
Overriding, Object class, Polymorphism, Dynamic binding, Generic program- After completion of the course the student should be able to:
ming, Casting objects, Instance of operator, Abstract class, Interface in java,
* analyse the operational behaviour of various digital logic units such as
Package in java, UTIL package.
multiplexers, decoders, flip-flops, counters, shift registers, binary adders and
Event and GUI programming: Event handling in java, Event types, Mouse subtractors and ALU.
and key events, GUI Basics, Panels, Frames, Layout Managers: Flow Layout,
* write assembly language code using various trainers.
Border Layout, Grid Layout, GUI components like Buttons, Check Boxes, Ra-
dio Buttons, Labels, Text Fields, Text Areas, Combo Boxes, Lists, Scroll Bars, * understand Pentium class PC architecture.
Sliders, Windows, Menus, Dialog Box, Applet and its life cycle, Introduction to
swing
SYLLABUS
I - Cycle: Digital Logic Design Experiments TTL Characteristics and TTL
I/O programming: Text and Binary I/O, Binary I/O classes, Object I/O, Ran-
dom Access Files. IC Gates Multiplexers & Decoders
Multithreading in java: Thread life cycle and methods, Runnable inter- Flip-Flops Counters
face, Thread synchronization, Exception handling with try-catch-finally, Collec- Shift Registers
tions in java, Introduction to JavaBeans and Network Programming. Binary Adders & Subtractors A L U
Java Database Connectivity (JDBC): JDBC Product, Types of Drivers, II - CYCLE: 8085 Assembly Language Programming
Two-Tier Client/Server Model, Three-Tier Client/Server Model, Basic Steps of 8085 Assembly Language Programming according to theory course mi-
JDBC, Creating and Executing SQL Statement, The Result Set Object, Work- croprocessors-I using the following trainers:
ing with Database MetaData Interface
Keyboard Monitor of 8085µP Trainer
Reference Books:
Serial Monitor of 8085µP Trainer with Terminal
1 Introduction to Java Programming (Comprehensive Version), Daniel
Liang, Seventh Edition, Pearson. 8085 Line Assembler of 8085µP Trainer with PC as Terminal
2 Programming in Java, Sachin Malhotra & Saurabh Chaudhary, Oxford 8085 Cross Assembler using In-Circuit Emulator (ICE) with 8085µP Trainer
University Press. and PC as Terminal
3 Murach’s Beginning Java 2, Doug Lowe, Joel Murach and Andrea Graded Problems are to be used according to the syllabus of computer
Steelman, SPD. organization Pentium class pc architecture familiarization hardware & soft-
ware parts demonstration
4 Core Java Volume-I Fundamentals, Eight Edition, Horstmann &
Cornell, Pearson Education. Reference Books
5 The Complete Reference, Java 2 (Fourth Edition), Herbert Schild, 1. Computer System Architecture, M. Morris Mano, Prentice Hall of India
TMH. Pvt. Ltd., Third Edition, Sept.2008
6 Java Programming, D. S. Malik, Cengage Learning. 2. Microprocessor Architecture, Programming and Applications with the
8085 by Ramesh S Gaonkar.
AI2106 : COMPUTER ORGANIZATION & ARCHITECTURE LAB
AI2107 : OBJECT ORIENTED PROGRAMMING THROUGH JAVA LAB
Course Objectives
Course Objectives:
* to design and analyse the operational behaviour of IC gates, multiplex-
ers, decoders, flip-flops, counters, shift registers, binary adders and subtractors * To develop programs using basic OOPS concepts such as classes and
and ALU. objects.
* to implement assembly language programming using various trainers. * To implement programs using Inheritance concepts.
* to make students familiar with Pentium class PC architecture. * To implement programs using Exception handling.
* To develop programs using operator overloading concepts.

226
Course Outcomes: SYLLABUS
* Student will be able to use OOPs concepts. Module I
* Ability to apply Inheritance concepts to several problems.
1. OS lab familiarization, Home Assignment on Unix commands, Vi edi-
* Ability to use Exception Handling concepts. tor
List of Programs: 2. Simple shell programming exercises
1. Program to define a structure of a basic JAVA program 3. Shell programming using decision making constructs, loop con-
2. Program to define the data types, variable, operators, arrays and con- structs, file and directory manipulation
trol structures. 4. Simple C programs using command line arguments, system calls,
3. Program to define class and constructors. Demonstrate construc- library function calls, make utility
tors. 5. C programs using system call to create processes and study parent,
child process mechanism
4. Program to define class, methods and objects. Demonstrate method
overloading. 6. C programs to create process chaining, spawning
5. Program to define inheritance and show method overriding. 7. C programs to error handling using errno(), perror() function
6. Program to demonstrate Packages. 8. C programs to use pipe system call for inter process communication
7. Program to demonstrate Exception Handling. Module II
8. Program to demonstrate Multithreading. 1. C programs to study process scheduling implementing FCFS, Short-
9. Program to demonstrate I/O operations. est Job First, and Round Robin algorithms
10. Program to demonstrate Network Programming. 2. C programs to study page replacement implementing FIFO, Optimal,
11. Program to demonstrate Applet structure and event handling. and LRU page replacement algorithms
12. Program to demonstrate Layout managers. 3. C programs to study deadlock avoidance and detection
4. C Programs to simulate free space management (first fit, best fit,
AI2108 : OPERATING SYSTEMS LAB worst fit).
Course Objectives: 5. C programs to study disk scheduling algorithms (i.e., SCAN, SSTF,
LOOK, etc.,)
* To learn about UNIX/LINUX operating system environment.
References:
* To learn about system calls for UNIX/LINUX Operating System.
1. Unix concepts and applications by Sumitabha Das, TMH Publica-
* To understand resource management policies and mechanisms and tions.
their performance evaluation.
2. Unix programming by Stevens, Pearson Education.
Course Outcomes: 3. Shell programming by Yashwanth Kanetkar.
* The student learns about multiprogramming, and multitasking capabili- 4. Operating System Concepts by Silberschatz, and Peter Galvin.
ties of UNIX/LINUX.
* The student develops skill in writing C programs using system calls for AI2109 : INTELLECTUAL PROPERTY RIGHTS
process management, inter process communication and other aspects.
Course Objective:
* The student learns to simulate OS resource management aspects like
* To introduce the students to Intellectual Property Rights (IPR) which is a
process scheduling, page replacement, disk scheduling, free space man-
key component in modern knowledge management processes
agement and others to evaluate performance.
* To create consciousness on IPR in students at an early stage of their
education so that they develop an appreciation for ethical and rightful use of

227
existing knowledge Trade Secret: What are Trade Secrets, How trade secrets are main-
* To make them understand how to take ownership of knowledge they tained in trade and business.
may develop as a result of their creative innovations, take ownership and Other forms of IP: Semiconductor Integrated Circuits Layout Design,
either drive themselves in becoming entrepreneurs or become responsible Geographical Indications, Protection of Plant Varieties & Farmers’ right, Tradi-
knowledge users in society tional knowledge.
* To expose students some of the recent debates on the societal implica- IP commercialization: Licensing & Royalty; Technology Transfer; IP as-
tions of IPR and its role in national/international trade and socio-economic signment, Compulsory License.
development. Emerging areas: Pat informatics, IP and bank loan, IP insurance, IP au-
dit, IP valuation, IP management, Use of artificial intelligence in IP enforce-
Course outcome:
ment, Open innovation.
Learners will be able to
Text Books
* identify the types of intellectual property protection available for their
1. Ganguli Prabuddha, Gearing up for Patents The Indian Scenario”,
research outcome
Universities Press (1998)
* conduct patent search and analyse patentability of the invention
2. Ganguli Prahuddha “Intellectual Property Rights-Unleashing the
* understand the basic structure of Patent document Knowledge Economy”. Tata McGraw Hill (2001)
* understand the registration and prosecution of different IPs 3. Geographical Indications of Goods Act 1990 Ganguli Piabaddha “Geo-
* understand the basics of IP commercialization and techno/commercial/ graphical Indications-its evolving contours accessible in http ips. nminsoda/
legal issues in IPR commercialization files/2012/05/main book pdf (2009)
Reference Books
SYLLABUS
1. Ganguli Prabuddha and Jahade Siddharth, “Nanotechnology Intel-
Introduction: Concept of property, Intellectual Property (IP) and Intellec- lectual Property Rights Research, Design, and Commercialisation”, CRC
tual Property Rights (IPR), Importance of IP, Value creation through IP, Advan- Press, Taylor and Francis Group, USA (2012)
tages of IP protection, Competitive advantage, Promotion of social good, Pre-
2. Beyond Intellectual Property: Toward Traditional Resource Rights for
vention of duplicates, counterfeit products and IP.
Indigenous Peoples and Local Communities [Paperback J,Darrell A. Posey
Evolution of IP system: Historical view of IP system in India and abroad, and Graham Dotfield, IDRC Books; annotated edition (June (1996)
Legal basis and rationale behind development of IP system, WTO and TRIPS
3. Netancl Neil Weinstock, Copyright’s Paradox, Oxford University Press
agreement, Role of WIPO.
(2010)
Types of IPR: Major forms of IP in India and globally, Acts enacted in India
4. The Indian Patents Act 1970 (as amended in 2005)
related to IP.
5. The Indian Copyright Act 1950 as amended in 2017)
Patent: Concept, Life of patent, Rights of Patentee, Criteria of patentabil-
ity- novelty, non- obviousness, and utility, Non-patentable inventions. 6. Indian Trademarks Act 1999
Patent filing and prosecution: Prior art search, Process of obtaining a 7. The Indian Industrial Designs Act 2000
patent in India, Provisional and complete specification, Convention applica- 8. The Protection of Plant Varieties and Farmers’ Right Act 2001
tion, Patent Cooperation Treaty (PCT), Patent Infringement and Enforcement. 9. Inventing the Future: An Introduction to Patents for small and medium
Trademark: Types of trademarks, Trademark and Brand, Trademark sized enterprises, WIPO publication No 917 www.wipo.int/ebookshop
Registration, Trademark Infringement. 10. Looking Good: An Introduction to Industrial Designs for Small and
Copyright: Copyrights and related rights, Copyright registration, Copy- Medium sized Enterprises; WIPO publication No.498 www.wipo.int/ebookshop
right infringement, Section 52 of Indian Copyright Act.
Industrial Design: What is Industrial design, Design registration, Design
infringement.

228
 AI2110 : ENVIRONMENTAL SCIENCE tion, Effects of usage of fertilizer, herbicides and pesticide- watershed man-
agement.
Course Objectives
Forest resources: Use and over-exploitation, Mining and dams – their
The objectives of the Environmental Science course are to effects on forest ecosystems and the living beings.
* Familiarize the fundamental aspects of environment and the environ- Water resources: Exploitation of surface and groundwater, Floods,
mental management’ droughts, Dams: benefits and costs.
* Provide information of some of the important international conventions Mineral Resources: Impact of mining on the environment and possible
which will be useful during the future endeavours after graduation. environmental management options in mining and processing of the miner-
* Make realize the importance of natural resources management for the als. Sustainable resource management (land, water, and energy), and resil-
sustenance of the life and the society. ient design under the changing environment.
* Apprise the impact of pollution getting generated through the anthropo- Environmental Pollution: Local and Global Issues. Causes, effects and
genic activities on the environment control measures. Engineering aspects of environmental pollution control
* Provide the concept of Sustainable Development, energy and environ- systems.
mental management Air pollution: impacts of ambient and indoor air pollution on human health.
* Impart knowledge on the new generation waste like e-waste and plastic Water pollution: impacts water pollution on human health and loss of fresh
waste. water resources. Soil pollution and its impact on environment. Marine pollu-
tion and its impact on blue economy. Noise pollution.
Course Outcomes Solid waste management: Important elements in solid waste manage-
After completion of the course the students will have ment- Waste to energy concepts. Air (prevention and control of pollution) Act,
* Knowledge on the fundamental aspects of environment and the envi- Water (prevention and control of pollution) Act and their amendments. Salient
ronmental management features of Environmental protection Act, 1986.
* The knowledge on the salient features of the important international Sustainable Development: Fundamentals of Sustainable Development–
conventions Sustainability Strategies and Barriers – Industrialization and sustainable de-
velopment. Circular economy concepts in waste (solid and fluid) manage-
* Understanding of the importance of natural resources management for
ment.
the sustenance of the life and the society.
Energy and Environment: Environmental Benefits and challenges, Avail-
* Familiarity on various forms of pollution and its impact on the environ-
ability and need of conventional energy resources, major environmental prob-
ment.
lems related to the conventional energy resources, future possibilities of en-
* Understand the elements of Sustainable Development, energy and ergy need and availability. Solar Energy: process of photovoltaic energy con-
environmental management version, solar energy conversion technologies and devices, their principles,
* Knowledge on the new generation waste like e-waste and plastic waste. working and applications, disposal of solar panel after their usage. Biomass
energy:
SYLLABUS
Concept of biomass energy utilization, types of biomass energy, conver-
Introduction: Structure and functions of Ecosystems-Ecosystems and its sion processes, Wind Energy, energy conversion technologies, their principles,
Dynamics-Value of Biodiversity-impact of loss of biodiversity, Conservation of equipment and suitability in context of India.
bio-diversity. Environmental indicators - Global environmental issues and their
Management of plastic waste and E-waste: Sources, generation and
impact on the ecosystems. Salient features of international conventions on
characteristics of various e- and plastic wastes generated from various indus-
Environment: Montreal Protocol, Kyoto protocol, Ramsar Convention on Wet-
trial and commercial activities; Waste management practices including onsite
lands, Stockholm Convention on Persistent Organic Pollutants, United Na-
handling, storage, collection and transfer. E-waste and plastic waste process-
tions Framework Convention on Climate Change (UNFCCC),
ing alternatives. E-Waste management rules and Plastic waste management
Natural Resources Management: Importance of natural resources man- rules, 2016 and their subsequent amendments.
agement-Land as resource, Land degradation, Soil erosion and desertifica-

229
Text Books: SYLLABUS
1. Bharucha,Erach (2004). Textbook for Environmental Studies for Un- Introduction to Microprocessors and Microcomputers: A Brief Architec-
dergraduate Courses of all Branches of Higher Education, University Grants ture and Programming of 8085Microprocessor.
Commission, New Delhi.
Architecture: Instruction Set and Programming of 8086Microprocessor
2. Basu, M., Xavier, S. (2016). Fundamentals of Environmental Studies,
Interfacing Semiconductor Memories and I/O Devices: Semiconductor
Cambridge University Press, India
Memories: Classification Internal Organization& Functional Description, Inter-
3. Masters, G. M., &Ela, W. P. (1991). Introduction to environmental engi- facing SRAMs and EPROMs to8086, Interfacing Characteristics of I/Devices, I/
neering and science. Englewood Cliffs, NJ: Prentice Hall. O Device addressing methods, I/O Device Programming Methods.
4. Enger, E. and Smith, B., Environmental Science: A Study of Interfacing Peripherals to Intel8086 -1: Parallel I/O Interface- 8255, Se-
Interrela- tionships, Publisher: McGraw-Hill Higher Education; 12th edition, rial I/O Interface – 8251, Timer Interface -8253/8254
2010.
Interfacing Peripheral to Intel 8086 - 2: Keyboard / Display Interface –
Reference Books: 8279, Interrupt Controller Interface – 8259
1. Sharma, P. D., & Sharma, P. D. (2005). Ecology and environment. Interfacing Data Converters to 8086: D/A Conversion Methods, A/D Con-
Rastogi Publications version methods, Interfacing DAC, Interfacing ADC.
2. Agarwal, K.C. 2001 Environmental Biology, Nidi Publ. Ltd. Bikaner. Introduction to Micro controllers: Intel 8051Architecture and Program-
3. Clark R.S. (2001). Marine Pollution, Clanderson Press Oxford (TB) ming
4. Jadhav, H & Bhosale, V.M. (1995). Environmental Protection and Laws. Text Books:
Himalaya Pub. House, Delhi 284 p. 1. Microprocessor Architecture, Programming, and Applications with the
5. MoEF&CC, Govt. of India, CPCB: E-waste management rules, 2016 8085 Ramesh S.Gaonkar, 4thEdition, PenramInternational,1999
and its amendments 2018. 2. The 80x86 Family, Design, Programming and Interfacing, John
6. MoEF&CC, Govt. of India, CPCB: Plastic waste management rules, E.Uffenbeck, 3rdEdition,Pearson Education Inc.,2002
2016. 3. KennethJ.Ayala, 8051 Microcontroller Architecture, Programming And
Applications, 2ndEdition, Penram InternationalPublications,1999
II Year – II Semester
Reference Books:
AI2201 : MICROPROCESSORS 1. BARRYB.BREY, The Intel Microprocessors 8086 / 8088, 80186 / 80188,
80286, 80386 and 80486, Pentium, Pentium Pro Processor, Pentium II,
Course Objectives:
Pentium III, Pentium4, Architecture, Programming and Interfacing, 8th Edition,
* To discuss the architectures of 8085, 8086 microprocessors, their in- Pearson Education Inc.,2009
struction sets and related ALP programs.
2. Walter A. Tribeland, Avtar Singh, The 8088 and 8086 Microproces-
* To discuss interfacing semiconductor memories, interfacing peripheral sors, Programming, interfacing, Software, Hardware, and Applications,
to Intel 8086. 4thEdition, Pearson Education Inc.,20033. Microprocessors and Interfacing,
* To study interfacing data converters to 8086 and discuss about micro Programming and Hardware, 2ndEdition, Douglass V. Hall, TMH Edition,1999
controller 8051 architecture. 3. Sanjay K Bose, Hardware and Software of Personal Computers,
New Age International (P)Ltd.,1991 Myke Predko, Programming and Custom-
Course Outcomes:
izing the 8051 Microcontroller, TMH,1999
* Understand the basic architectures of 8085 and 8086 microproces-
sors. AI2202 : DESIGN AND ANALYSIS OF ALGORITHMS
* Ability to write ALP programs using instruction sets.
Course Objectives:
* Understand the various interfacing concepts and micro controllers. Upon completion of this course, students will be able to do the following:
* Analyse the asymptotic performance of algorithms.
230
 * Write rigorous correctness proofs for algorithms. Limitations of Algorithm Power: Lower-Bound Arguments, Decision
* Demonstrate a familiarity with major algorithms and data structures. Trees, P, NP and NP – complete problems – Challenges of Numerical Algo-
rithms. Limitations of Algorithms Power: Backtracking – Branch-and Bound–
* Apply important algorithmic design paradigms and methods of analysis.
Approximation Algorithms for NP-hard Problems – Algorithms for solving Non-
* Synthesize efficient algorithms in common engineering design situations linear Equations.
Course Outcomes: Text Books:
Students who complete the course will have demonstrated the ability to 1. Fundamentals of computer algorithms E. Horowitz S. Sahni,
do the following: Sanguthevar Rajasekaran, University Press.
* Argue the correctness of algorithms using inductive proofs and invariants. 2. Introduction to Algorithms by Thomas H. Corman, Charles E.
Leiserson, Ronald R. Rivest & Clifford Stein, Prentice Hall of India, New Delhi,
* Analysis worst-case running times of algorithms using asymptotic analysis. New Delhi.
* Describe the divide-and-conquer paradigm and explain when an algo- Reference Books:
rithmic design situation calls for it. Recite algorithms that employ this para-
1. Data structures and algorithm analysis in C++ / Mark Allen Weiss,
digm. Synthesize divide-and conquer algorithms. Derive and solve recurrences
Florida International University. — Fourth edition.
describing the performance of divide and-conquer algorithms.
2. Introduction to Design & Analysis of Algorithms by Anany Levitin,
* Describe the dynamic-programming paradigm and explain when an
Pearson Education, New Delhi, 2003
algorithmic design situation calls for it. Recite algorithms that employ this
paradigm. Synthesize dynamic programming algorithms, and analysis them. 3. Introduction to Algorithms by Thomas H. Corman, Charles E.
Leiserson, Ronald R. Rivest & Clifford Stein, Prentice Hall of India, New Delhi,
* Describe the greedy paradigm and explain when an algorithmic design
New Delhi.
situation calls for it. Recite algorithms that employ this paradigm. Synthesize
greedy algorithms, and analysis them. 4. The Design and Analysis of Computer Algorithms, Alfred V. Aho, John
E. Hopcroft, Jeffrey D. Ullman
SYLLABUS
AI2203 : DATABASE MANAGEMENT SYSTEMS
Introduction: What is an Algorithm, Algorithm Specification, Pseudocode
Conventions Recursive Algorithm, Performance Analysis, Space Complexity, Course Objectives:
Time Complexity, Amortized Complexity, Amortized Complexity, Asymptotic No-
* To learn the evolution of DBMS Versus File systems, data models, and
tation, Practical Complexities, Performance Measurement.
layers of abstraction.
Divide and Conquer: General Method, Defective Chessboard, Binary
* To understand conceptual and physical aspects of database design.
Search, Finding the Maximum and Minimum, Merge Sort, Quick Sort, Perfor-
mance Measurement, Randomized Sorting Algorithms. * To learn formal and commercial query language specifications.
The Greedy Method: The General Method, Knapsack Problem, Job Se- * To understand concurrency control, recovery management, and other
quencing with Deadlines, Minimum-cost Spanning Trees, Prim’s Algorithm, related issues.
Kruskal’s Algorithms, An Optimal Randomized Algorithm, Optimal Merge Pat- Course Outcomes:
terns, Single Source Shortest Paths.
* The student will understand ER-modelling for conceptual database
Dynamic Programming: All - Pairs Shortest Paths, Multistage graphs, design and relational model.
optimal binary search tree, String editing, 0/1 Knapsack, Reliability Design.
* The student is introduced to formal and commercial query languages:
Backtracking: The General Method, The 8-Queens Problem, Sum of Relational Algebra, calculus and SQL.
Subsets, Graph Colouring, Hamiltonian Cycles, Knapsack problem
* The student will learn schema refinement and normalization.
Branch and Bound: Least cost (LC) Search, The 15-Puzzle, Control Ab-
straction for LC- Search, Bounding, FIFO Branch-and-Bound, LC Branch and * The student understands locking protocols concurrency control, and
Bound, 0/1 Knapsack Problem, LC Branch-and Bound Solution, FIFO Branch- crash recovery methods.
and-Bound Solution, Traveling Salesperson problem.

231
 SYLLABUS * To introduce finite state machines, context free grammars and Turing
Introduction: File system versus a DBMS, Advantages of a DBMS, De- Machines and their properties as the basis for the formal expressivity of com-
scribing and Storing Data in a DBMS, The Relational model, Levels of abstrac- puter languages for solving linguistic decision problems.
tion, Data Independence, Transaction management, Structure of a DBMS. * To understand the concepts of tractability and decidability, the concepts
Introduction to Database Design and The Relational Model: Database of NP- completeness and NP-hard problem and also the challenges for Theo-
Design and ER Diagrams, Entities, Attributes and Entity Sets, Relationships & retical Computer Science and its contribution to other sciences.
Relationship Sets, Additional Features of the ER Model, Conceptual Design Course outcomes:
with ER Model, Introduction to the Relational Model, Integrity Constraints over
* Ability to think analytically and intuitively for problem solving situations in
Relations, Enforcing Integrity Constraints, Querying Relational Data, Logical
related areas of theory in computer science
Database Design: ER to Relational, Introduction to Views, Destroying/ Altering
Tables and Views. * Ability to describe the language accepted by an automata or generated
by a regular expression or a context-free grammar;
Relational Algebra and SQL: Preliminaries, Relational Algebra, The form
of a Basic SQL Query, UNION, INTERSECT and EXCEPT, Nested Queries, * Ability to Understand the functioning of Finite-State Machines, Determin-
Aggregate Operators, Null Values, Complex Integrity Constraints in SQL, Trig- istic Finite- State Automata, Nondeterministic Finite-State Automata and Push-
gers and Active Databases, Embedded SQL, Dynamic SQL, JDBC. down Automata and Turing Machines.
Database Design: Schema Refinement and Normal Forms, Introduction SYLLABUS
to Schema Refinement, Functional Dependencies, Reasoning about FD’s,
Introduction to Grammars and Languages: Definitions of alphabet,
Normal Forms, Properties of Decomposition, Normalization, Other kinds of
Dependencies. strings, language, grammar, types of grammar, types of machines, generation
of languages from grammar, construction of grammar from the given descrip-
Transaction Management: The ACID Properties, Transactions & Sched- tion of languages, Chomsky Hierarchy of languages.
ules, Concurrent Execution of Transactions, Lock-Based Concurrency Con-
Finite State Machine (FSM): Definition of finite state machine, Represen-
trol.
tation of FSMs. Classification of FSM’s and their construction, Conversion
Concurrency Control: 2PL, Serializability and Recoverability, Introduction from NFA to DFA, Elimination of å – transitions from NFA, Equivalence of two
to Lock Management, Lock Conversions, Dealing with Deadlocks, Specialized FSM’s, optimization of finite state machine (Equivalence theorem method and
Locking Techniques, Concurrency Control without Locking. Table filling method), Finite state machine with output: Moore and Mealy ma-
Crash Recovery: Introduction to ARIES, The Log, Other Recovery-Related chines. Applications of FSM.
Structures, The Write-Ahead Log Protocol, Check pointing, Recovering from a Regular Expression and Languages: Regular Expression, Finite Automata
System Crash, Media Recovery. and Regular Expressions, Applications of Regular Expressions, Algebraic Laws
Text Books: for Regular Expressions, Properties of Regular Languages: Pumping Lemma
1. Database Management Systems; Raghu Ramakrishnan, Johannes for regular Languages, Application of Pumping Lemma, Closure properties of
Gehrke 4th Edition, McGraw-Hill. Regular Languages, Decision properties of Regular Languages, Equivalence
Reference: and Minimization of Automata.
1. Database System Concepts; A. Silberschatz, H. Korth 5th Edition, Context Free Grammars and Languages: Context Free Grammars, Parse
McGraw-Hill Trees, Applications of Context-Free Grammars, Ambiguity in Grammars and
Languages, Normal Forms, Pumping Lemma for CFL, Closure properties of
AI2204 : FORMAL LANGUAGES AND AUTOMATA THEORY CFL, Decision properties for CFL.
Course objectives: Push down Automata: Definition of push down automata, The Languages
of a PDA, push down automata, Equivalence of PDA’s and CFG’s, push down
* To introduce the concepts in automata theory and theory of computation automata to context free grammar, context free grammar to push down au-
to design grammars and recognizers for different formal languages. tomata, Deterministic Pushdown Automata.
* To employ finite state machines to solve problems in computing.

232
 Turing Machines: The Definition of Turing Machine, Turing Machine Model, Demand and Utility Analysis: Demand - Definition, Meaning, Nature and
Representation of Turing Machines, Language Acceptability by Turing Machines, types of demand, Demand function, Law of demand - Assumptions and limita-
Design of Turing Machines, Description of Turing Machines, Techniques for tions. Exceptional demand curve.
TM Construction, Variants of Turing Machines, Turing Machines and Type 0 Elasticity of demand - Definition, Measurement of elasticity, Types of
Grammars. Elasticity(Price, Income, Cross and Advertisement), Practical importance of
Undecidability: A Language That Is Not Recursively Enumerable, An Un- Price elasticity of demand, Role of income elasticity in business decisions,
decidable Problem That Is RE, Undecidable Problems About Turing Machines, Factors governing Price Elasticity of demand.
Decidable & Undecidable Problems, Post Correspondence Problem. Utility Analysis: Utility- Meaning, Types of Economic Utilities, Cardinal
Text books: and Ordinal Utility, Total Utility, Marginal Utility, The law of Diminishing Marginal
1. Introduction to automata theory, languages and computation, Utility and its Limitations.
John.E.H.P croft/ Rajeev Motwani & JD Ullman—pearson education- III edition Theory of Production and Cost analysis: Production - Meaning, Produc-
2. Theory of computation, K.L.P.Mishra and N.Chandrasekhar, PHI tion function and its assumptions, use of production function in decision mak-
Reference Books: ing; Cost analysis - Nature of cost, Classification of costs - Fixed vs. Variable
costs, Marginal cost, Controllable vs. Non - Controllable costs, Opportunity
1. Theory of computation, formal languages and automata theory, G P cost, Incremental vs. Sunk costs, Explicit vs. Implicit costs, Replacement costs,
Saradhi Varma, B.Thirupathi Rao –Sci Tech publications.
Historical costs, Urgent vs. Postponable costs, Escapable vs. Unavoidable
AI2205 : MANAGERIAL ECONOMICS costs, Economies and Diseconomies of scale.
Market Structures: Definition of Market, Classification of markets; Sa-
Course Objectives: lient features or conditions of different markets - Perfect Competition, Mo-
* To bring about an awareness about the nature of Managerial Econom- nopoly, Duopoly , Oligopoly, Importance of kinked demand curve ;Monopolistic
ics and its linkages with other disciplines. Competition.
* To understand the Micro and Macro Environment of Business. Pricing and Business Cycles: Pricing Analysis: Pricing – Significance;
* To familiarize the prospective engineers with the concepts and tools of Different Pricing methods- Cost plus pricing, Target pricing, Marginal cost
Managerial Economics with an objective to understand the real world of busi- pricing, Going -rate pricing, Average cost pricing, Peak load pricing , Pricing of
ness. joint Products, Pricing over the life cycle of a Product, Skimming pricing Pen-
etration pricing, Mark- up and Mark- down pricing of retailers.
Course Outcomes: Business cycles - Definition, Characteristics, Phases, Causes and Con-
After completion of the course, student will be able to: sequences; Measures to solve problems arising from Business cycles.
* Understand the various economic activities in business and industry. Text Books:
* Analyse the real-world business problems. 1. Sankaran,S., Managerial Economics, Marghan Publications, 2015,
* Make optimal business decisions for the effective and efficient manage- Chennai.
ment of Organisations. 2. Aryasri, A.R., Managerial Economics and Financial Analysis, MC Graw
Hill Education, New Delhi,2015.
SYLLABUS
Reference Books:
Significance of Economics and Managerial Economics: 1. Dwivedi, D.N., Managerial Economics, Vikhas Publishing House Pvt.
Economics: Definitions of Economics- Wealth, Welfare and Scarcity defi- Ltd. 6th Edition, New Delhi,2004.
nitions Classification of Economics- Micro and Micro Economics. 2. Dewett, K.K., Modern Economic Theory, S.Chand & Company Ltd.,
Managerial Economics: Definition, Nature and Scope of Managerial Eco- New Delhi, 2005.
nomics, Differences between Economics and Managerial Economics, Main
areas of Managerial Economics, Managerial Economics with other disciplines.

233
 AI2206 : ALGORITHMS LAB Through C++ 2. a). Design a superclass called Staff with details as StaffId, Name,
Phone, Salary. Extend this class by writing three subclasses namely Teaching
Course objectives: (domain, publications), Technical (skills), and Contract (period). Write a CPP
* The laboratory component will emphasize two areas: program to read and display at least 3 staff objects of all three categories.
* Implementation of algorithms covered in class: This will involve running b). Write a class called Customer to store their name and date_of_birth.
the algorithms under varying input sets and measuring running times, use of The date_of_birth format should be dd/mm/yyyy. Write methods to read cus-
different data structures for the same algorithm (wherever applicable) to see tomer data as and display as using StringTokenizer class considering the
its effect on time and space, comparison of different algorithms for the same delimiter character as “/”.
problem etc. 3. a). Write a program to read two integers a andb. Compute a/b and
* Design of Algorithms: This will involve design and implementation of print, when b is not zero. Raise an exception when b is equal to zero.
algorithms for problems not covered in class but related to topics covered in b). Write a program that implements a multi-thread application that has
class. three threads. First thread generates a random integer for every 1 second;
* The exact set of algorithms to design and implement is to be decided by second thread computes the square of the number and prints; third thread will
the instructor. In addition, there will be at least one significantly large design print the value of cube of the number.
project involving some real world application. An efficient design of the project 4. Sort a given set of n integer elements using Quick Sort method and
should require the use of multiple data structures and a combination of differ- compute its time complexity. Run the program for varied values of n> 5000 and
ent algorithms/techniques. record the time taken to sort. Plot a graph of the time taken versus non graph
sheet. The elements can be read from a file or can be generated using the
Course Outcomes:
random number generator. Demonstrate using CPP how the divide-and-con-
The student should be able to: quer method works along with its time complexity analysis: worst case, aver-
* Design algorithms using appropriate design techniques (brute-force, age case and best case.
greedy, dynamic programming, etc.) 5. Sort a given set of n integer elements using Merge Sort method and
* Implement a variety of algorithms such assorting, graph related, combi- compute its time complexity. Run the program for varied values of n> 5000,
natorial, etc., in a high level language. and record the time taken to sort. Plot a graph of the time taken versus non
* Analyze and compare the performance of algorithms using language graph sheet. The elements can be read from a file or can be generated using
features. the random number generator. Demonstrate using CPP how the divide-and-
conquer method works along with its time complexity analysis: worst case,
* Apply and implement learned algorithm design techniques and data
average case and best case.
structures to solve real-world problems.
6. Implement the Knapsack problem using (a) Dynamic Programming
Programs List: method (b) Greedy method.
1. a) Create a CPP class called Student with the following details as 7. Write a program-from a given vertex in a weighted connected graph,
variables within it. find shortest paths to other vertices using Dijkstra’s algorithm..
(i) Register_number 8. Find Minimum Cost Spanning Tree of a given connected undirected
(ii) Student_name graph using Kruskal’s algorithm. Use Union-Find algorithms in your program.
(iii) Programme_name 9. Find Minimum Cost Spanning Tree of a given connected undirected
graph using Prim’s algorithm.
(iv) Phone _number
Write a program to create nStudent objects and print the Register_number, 10. Write programs to
Student_name, Programme_name, and Phone_number of these objects with (a) Implement All-Pairs Shortest Paths problem using Floyd’s algorithm.
suitable headings. (b) Implement Travelling Sales Person problem using Dynamic program-
b). Write a program to implement the Stack using arrays. Write Push (), ming.
Pop(), and Display() methods to demonstrate its working.

234
 11. Design and implement in CPP, to find a subset of a given set S = {Sl, * The student will learn SQL commands for data definition and manipulation.
S2, ,Sn} of n positive integers whose SUM is equal to a given positive integer * The student understands conceptual through physical data base design.
d. For example, if S ={1, 2, 5, 6, 8} and d= 9, there are two solutions {1,2,6}and
* The student takes up a case study and applies the design steps.
{1,8}. Display a suitable message, if the given problem instance doesn’t have
a solution. SYLLABUS
12. Design and implement in CPP to find all Hamiltonian Cycles in a Features of a commercial RDBMS package such as ORACLE/DB2, MS
connected undirected Graph G of n vertices using backtracking principle. Access, MYSQL & Structured Query Language (SQL) used with the RDBMS.
REFERENCES: I. Laboratory Exercises Should Include:
1. T. H. Cormen, C. L. Leiserson, R. L. Rivest, and C. Stein, Introduction
a. Defining Schemas for Applications,
to Algorithms, MIT Press.
b. Creation of Database,
2. J. Kleinberg and E. Tardos, Algorithm Design, Addison-Wesley.
c. Writing SQL Queries,
3. Harry R. Lewis and Larry Denenberg, Data Structures and Their Algo-
rithms, Harper Collins. d. Retrieve Information from Database,
4. A. Gibbons, Algorithmic Graph Theory, Cambridge University Press. e. Creating Views
5. Michael T. Goodrich and Roberto Tamassia, Algorithm Design: Foun- f. Creating Triggers
dations, Analysis, and Internet Examples, John Wiley. g. Normalization up to Third Normal Form
6. R. Sedgewick, Algorithms in C (Parts 1-5), Addison Wesley. h. Use of Host Languages,
7. M. H. Alsuwaiyel, Algorithm Design Techniques and Analysis, World i. Interface with Embedded SQL,
Scientific. j. Use of Forms
8. Gilles Brassard and Paul Bratley, Algorithmics: theory and practice, k. Report Writing
Prentice-Hall.
II. Some sample applications are given below:
9. Udi Manber, Introduction to Algorithms: A Creative Approach, Addison-
1. Accounting Package for Shops
Wesley.
2. Database Manager for Magazine Agency or Newspaper Agency,
10. Sara Baase and Allen Van Gelder, Computer Algorithms: Introduction
to Design and Analysis, Addison-Wesley. 3. Ticket Booking for Performances,
4. Preparing Greeting Cards & Birthday Cards
AI2207 : DATABASE MANAGEMENT SYSTEMS LAB
5. Personal Accounts - Insurance, Loans, Mortgage Payments, Etc.,
Course Objectives 6. Doctor’s Diary & Billing System
* To introduce to a commercial DBMS such as ORACLE. 7. Personal Bank Account
* To learn and practice SQL commands for schema creation, data ma- 8. Class Marks Management
nipulation.
9. Hostel Accounting
* To learn conceptual and physical database design based on a case 10. Video Tape Library,
study.
11. History of Cricket Scores,
* To apply database design stages by studying a case study.
12. Cable TV Transmission Program Manager,
Course Outcomes 13. Personal Library.
By the end of the course, the student should be able to: 14. Sailors Database
* The student is exposed to a commercial RDBMS environment such as 15. Suppliers and Parts Database
ORACLE.

235
Reference Books d) REGISTRATION PAGE
1. Database Management Systems; Raghu Ramakrishnan, Johannes 2. Write JavaScript to validate the following fields of the Registration
Gehrke 4th Edition, McGraw Hill page.
2. Database System Concepts; A. Silberschatz, H. Korth 5th Edition, a) First Name (Name should contains alphabets and the length should
McGraw-Hill not be less than 6 characters).
AI2208 : WEB TECHONOLOGIES b) Password (Password should not be less than 6 characters length).
c) E-mail id (should not contain any invalid and must follow the stan-
Course objectives dard pattern [email protected])
* To facilitate the graduates with the ability to visualize, gather information, d) Mobile Number (Phone number should contain 10 digits only).
articulate, analyze, solve complex problems, and make decisions. These are
e) Last Name and Address (should not be Empty).
essential to address the challenges of complex and computation intensive
problems increasing their productivity. 3. Develop and demonstrate the usage of inline, internal and external
style sheet using CSS
* To facilitate the graduates with the technical skills that prepare them for
immediate employment and pursue certification providing a deeper under- 4. Develop and demonstrate JavaScript with POP-UP boxes and func-
standing of the technology in advanced areas of computer science and related tions for the following problems:
fields, thus encouraging to pursue higher education and research based on a) Input: Click on Display Date button using onclick( ) function Output:
their interest. Display date in the textbox
* To facilitate the graduates with the soft skills that include fulfilling the b) Input: A number n obtained using prompt Output: Factorial of n num-
mission, setting goals, showing self-confidence by communicating effectively, ber using alert
having a positive attitude, get involved in team-work, being a leader, managing c) Input: A number n obtained using prompt
their career and their life.
Output: A multiplication table of numbers from 1 to 10 of n using alert
Course outcomes d) Input: A number n obtained using prompt and add another number
* Able to understand the working principles of the computer system and using confirm Output: Sum of the entire n numbers using alert
its components, apply the knowledge to build, asses, and analyze the soft- 5. Write an HTML page that contains a selection box with a list of 5
ware and hardware aspects of it. countries. When the user selects a country, its capital should be printed next in
* Develops comprehensive skills of Programming Languages, Software the list. Add CSS to customize the properties of the font of the capital (colour,
process models, methodologies, and able to plan, develop, test, analyze, and bold and font size).
manage the software and hardware intensive systems in heterogeneous plat- 6. Write an HTML page including any required JavaScript that takes a
forms individually or working in teams. number from text field in the range of 0 to 999 and shows it in words. It should
* Able to use the professional, managerial, interdisciplinary skill set, and not accept four and above digits, alphabets and special characters.
domain specific tools in development processes, identify the research gaps, 7. Develop and demonstrate PHP Script for the following problems:
and provide innovative solutions to them.
a) Write a PHP Script to find out the Sum of the Individual Digits.
SYLLABUS b) Write a PHP Script to check whether the given number is Palindrome
1. Design the following static web pages required for an online book or not
store web site. 8. Create an XML document that contains 10 users information. Write a
a) HOME PAGE: The static home page must contain three frames. Java Program, which takes User Id as input and returns the user details by
taking the user information from XML document using DOM parser or SAX
b) LOGIN PAGE parser.
c) CATOLOGUE PAGE: The catalogue page should contain the details 9. Implement the following web applications using (a) PHP (b) Servlets
of all the books available in the web site in a table. (c) JSP

236
 a) A web application that takes a name as input and on submit it shows a hello page where name is
taken from the request. It shows the start time at the right top corner of the page and provides a logout button.
On clicking this button, it should show a logout page with Thank You message with the dura- tion of usage
(hint: Use session to store name and time).
b) Write a PHP Program to display current Date, Time and Day.
c) A web application that takes name and age from an HTML page. If the age is less than 18, it should
send a page with “Hello, you are not authorized to visit the site” message, where should be replaced with the
entered name. Otherwise, it should send “Welcome to this site” message.
d) A web application that lists all cookies stored in the browser on click- ing “List Cookies” button. Add
cookies if necessary.
10. Implement the web applications with Database using (a) PHP, (b) Servlets and (c) JSP.
11. Modify the above PHP program to use an xml instead of database
12. Write a program to design a simple calculator using
(a) JavaScript
(b) PHP
(c) Servlet and
(d) JSP.References:
1. Internet and Web Technologies by Raj Kamal, Tata McGraw-Hill.
2. Programming the World Wide Web by Robert W. Sebesta, PearsonEducation.

AI2209 : PROFESSIONAL ETHICS AND UNIVERSAL HUMAN VALUES

Course Objectives:
* To recognize the moral values that should guide the Engineering pro-fession.
* To resolve moral issues concerning one’s profession.
* To develop and exhibit a set of moral beliefs and attitudes that engi- neers should inculcate.
* To inculcate social values and morality in one’s life.
* To develop awareness about Professional/Engineering Ethics and Hu-man Values.
Learning Outcomes:
Students will be able to:

237
 * Apply the conceptual understanding of ethics and values into everydaypractice.
* Understand the importance of moral awareness and reasoning in life.
* Acquire professional and moral etiquette that an engineer requires.
* Develop the acumen for self-awareness and self-development.
* Develop cultural tolerance and integrity.
* Tackle real-life challenges with empathy.

SYLLABUS
HUMAN VALUES : Values - Respect - Caring - Sharing - Honesty- Cour-age - Self confidence -
Communal Harmony Morals - Virtues
PROFESSIONAL VALUES : Integrity - Discipline - Valuing time - Coopera-tion - Commitment - Code of
conduct - Challenges in the workplace
PROFESSIONAL ETHICS : Overview - Engineering ethics - Moral issues
- Profession - Models of professional roles - Responsibility
RESPONSIBILITIES AND RIGHTS : Safety and risk - Collegiality and loy- alty - Confidentiality -
Occupational crime - Human rights - Employee rights - Intellectual property rights
GLOBAL ISSUES : Globalization - Environmental ethics - Computer eth- ics - Code of ethics -
Multinational corporations - Engineers as advisors in Planning and Policy making
Textbook:
1. R.S. Nagarazan. A Textbook on Professional Ethics and Human Val- ues. New Age International
Publishers. 2006.
2. Reference Books:
1. Premvir Kapoor. Professional Ethics and Human Values. KhannaPublishing House. 2019.
2. B.S. Raghavan. Human Values and Professional Ethics. S.ChandPublications. 2012.
3. R.R. Gaur & Others. A Foundation Course in Human Values andProff. Ethics. Excel Books.
2009.
4. A. N. Tripathi. Human Values. New Age International (P) Limited. 2009
5. R. Subramanian. Professional Ethics. OUP India. 2013.

238