BTech - CSE Syllabus

CURRICULUM & SYLLABUS
CHOICE BASED CREDIT SYSTEM (CBCS)

FOR
BACHELOR OF TECHNOLOGY (B.Tech.)
(4 Year Undergraduate Degree Programme)
IN
COMPUTER SCIENCE AND ENGINEERING

[w. e. f. 2020-2021]
FACULTY OF ENGINEERING AND TECHNOLOGY

SRM UNIVERSITY DELHI-NCR, SONEPAT
Plot No.39, Rajiv Gandhi Education City, P.S. Rai, Sonepat
Haryana-131029
SRM UNIVERSITY DELHI-NCR, SONEPAT (HARYANA)
VISION
SRM University Delhi-NCR, Sonepat, Haryana aims to emerge as a leading
world-class university that creates and disseminates knowledge upholding the
highest standards of instruction in Medicine & Health Sciences, Engineering &
Technology, Management, Law, Science & Humanities. Along with academic
excellence and skills, our curriculum imparts integrity and social sensitivity to
mould our graduates who may be best suited to serve the nation and the world.
MISSION
1. To create a diverse community campus that inspires freedom and innovation.
2. Promote excellence in educational & skill development processes.
Continue to build productive international alliances.
3. Explore optimal development opportunities available to students and faculty.
4. Cultivate an exciting and rigorous research environment.
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
VISION
Department is committed to provide Intellectual, Innovative & Inspirational
environment and contribute to academic, scientific, research and technical
knowledge through excellence and to produce technocrats, researchers and
bureaucrats.
MISSION
1. To improve the problem-solving capability of students through continual
learning to produce quality engineers in the field of Computer Science.
2. To bridge the gap between industry and academia by bringing state-of-the-

art technology.
3. To encourage innovation through multidisciplinary research and

development activities.
4. To inculcate human values and ethics into students to serve the society in all
possible ways.
PROGRAM REQUIREMENT
The Computer Science and Engineering curriculum is geared towards providing the student with a strong
foundation in the discipline and the tools and competence to address new and challenging problems that they
have not seen before. In order to earn a B. Tech. degree in Computer Science and Engineering, a student
should earn a minimum of 155 credits in the course of their study. The credit requirements for their program
of study is comprised of 4 parts:
 General Education Requirements – Humanities and Social Science (HS)
 Science and Engineering Requirements – Basic Sciences (BS) and Engineering Science (ES)
 Disciplinary Requirements comprising of:
 Computer Science and Engineering Core course (CSE)
 Computer Science and Engineering Electives (CSE-E)
 Research, Design, and Industry Practice component -- Undergraduate Research Opportunities
Program (UROP), Summer Internships, Specialized courses through the Study Abroad
program, Senior Thesis Project, and Industry CO-OP through the semester.
 Open Electives (OE)
One credit corresponds to one hour of lecture, 2 hours of recitation or 2 hours of lab work. Typically, one
credit translates to 3 hours of work per week for a student as a combination of in-class and out-of-class
engagement with the course work. In-class work corresponds to time spent in lecture, recitation, and
discussion sessions. Out-of-class student work includes homework assignments, project work, independent
or group study, or other work relating to the course.
General Education Requirements (GER)
The General Education Requirements consist of courses in Humanities and Social Sciences that are aimed at
developing communication skills, both oral and written; understanding human cultures, past and present;
awareness of concepts, ideas, and systems of thought that underlie human activities; understanding of the
social, political, and economic framework of societies; understanding the impact of science and technology
on society. Courses pertaining to communication skills, law and ethics, and the relationship between science,
technology and society are required of every student.
Science and Engineering Requirements (SER)
The Basic Sciences courses aim to provide the outgoing graduates with a strong foundation in the sciences.
Required courses include courses is Mathematics, Physics, Chemistry, Biology, and Environmental Science.
The Engineering Sciences requirements support multiple objectives: first, the courses provide a foundation
in the basic tools and methodologies common to all engineering disciplines; second, all students are exposed
to basics of each discipline allowing for cross-disciplinary competencies; last, there is a multi-disciplinary
project component where students from different engineering disciplines come together on a design project,
allowing for practice in collaborative team work.
Computer Science and Engineering Requirements
The disciplinary core courses are aimed at providing the student with a solid foundation in their chosen field
of study. The disciplinary electives, on the other hand, provide the student with an option to gain exposure to
different specializations within the discipline, or an opportunity to study one of the subfields in some depth.
Open Electives
The open subject elective courses provide the student wide latitude to pursue their interests, be it in
humanities, arts, their chosen field of study, a related discipline, or use it towards developing a concentration
in another field as a Minor.
Advanced Undergraduate Subjects, and courses from within and outside engineering disciplines for “minor”
fields of study in addition to their major are being evolved in partnerships with international experts. The
students can elect to consider these additional options upon joining the university.
SEMESTER-I
Teaching Scheme
Category
Subject Code Subject Name
L T P C
Theory
Technical Communication-I
20LE0101 G 1 0 2 2
Calculus and Linear Algebra
20MA0101 B 3 1 0 4
Materials Science
20PH0102 B 3 0 0 3
Biology for Engineers
20GE0102 B 2 0 0 2
Environmental Studies
20GE0104 B 2 0 0 2
Basic Engineering-I
20GE0101 E 3 0 0 3
Introduction to computer and
P Programming
19CS1001 3 0 0 3
Practical
Personality Development-I
20PD0101 G 1 0 0 1
NSS/NCC/NSO/YOGA
20GE0107 G 0 0 2 1
Computer Programming Lab
19CS1111 P 0 0 2 1
Materials Science Laboratory

20PH0104 B 0 0 2 1
Workshop Practice
20ME0120 E 1 0 2 2
Total 19 1 10 25
SEMESTER-II
Teaching Scheme
Category
L T P C
Theory
Value Education
20GE0108 G 1 0 0 1
Advanced Calculus and Complex
20MA0102 B 3 1 0 4
Analysis
Chemistry
20CY0101 B 3 0 0 3
Physics
20PH0101 B 3 0 0 3
20CS1006 P Data Structures & Algorithms 3 1 0 4

Basic Engineering-II
20GE0106 E 3 1 0 3
Technical Communication-II
20LE0102 G 1 0 2 2
Practical
Personality Development-II
20PD0102 G 1 0 0 1
B Chemistry Laboratory 0
20CY0103 0 2 1
20CS 1116 P Data Structures Lab 0 0 2 1

Engineering Graphics
20ME0130 E 1 0 2 2
Physics Laboratory
20PH0103 B 0 0 2 1
Total 19 2 10 26
SEMESTER-III
Teaching Scheme
Category
L T P C
Theory
xxx G Open Elective Course – I 2 0 0 2

Transforms and Boundary Value
20MA0310 B 3 1 0 4
Problems
20CS2009 P Python using OOP 3 0 0 3
CS 2003 P Discrete Structures 3 1 0 4

CS 2005 P Database Management Systems 3 1 0 4
Computer Architecture &
CS 2007 P 3 1 0 4
Organization
Practical
20 PD 0201 G Personality Development – III 0 0 2 1
CS 2111 P DBMS Lab 0 0 2 1

20CS2117 Python using OOP Lab 0 2 1
P 0
CS 2115 E Programming using MATLAB 1 0 2 2
Total 18 4 8 26
SEMESTER-IV
Teaching Scheme
Category
L T P C
Theory
Xxx G Open Elective Course – II 2 0 0 2

CS 2002 E Microprocessor & Interfacing 3 0 0 3
CS 2004 P Theory of Computation 3 1 0 4
CS 2006 P Operating Systems 3 0 0 3
CS 2008 P Analysis and Design of Algorithms 3 1 0 4
CS 2010 P JAVA Programming 3 1 0 4
Practical
20PD 0202 G Personality Development –IV 0 0 2 1
CS 2112 E Microprocessor Lab 0 0 2 1
CS 2114 P Operating Systems Lab 0 0 2 1
CS 2116 P Java Programming Lab 0 0 2 1
CS 2118 P ADA Lab 0 0 2 1
Total 17 2 10 24
SEMESTER-V
Teaching Scheme
Category
L T P C
Theory
CS 3001 P Compiler Design 3 1 0 4
CS 3003 E Computer Networks 3 1 0 4
Xxx B Open Elective Course – III 3 1 0 4

CS 3xxx P Department Elective Course – I 1 1 4 4
CS 3xxx P Department Elective Course – II 3 1 0 4
Practical
20PD 0301 G Personality Development –V 0 0 2 1
CS 3113 E Computer Network Lab 0 0 2 1
CS 3115 P Industrial Training - I 0 0 2 1
CS 3117 P Compiler Design Lab 0 0 2 1
Total 15 5 8 24
SEMESTER-VI
Teaching Scheme
Category
L T P C
Theory
Artificial Intelligence & Expert
CS 3002 P 3 1 0 4
Systems
CS 3004 P Software Engineering 3 1 0 4
CS 3xxx P Department Elective Course – III 3 1 0 4
CS 3010 P Multimedia & Web Technologies 3 0 0 3
CS 3xxx P Department Elective Course – IV 3 1 0 4
Practical
CS 3112 P Comprehension 0 0 2 1
20PD 0302 G Personality Development –VI 0 0 2 1
CS 3114 P Artificial Intelligence Lab 0 0 2 1
CS 3116 P Multimedia and Web Technologies Lab 0 0 2 1
CS 3118 P Software Engineering Lab 0 0 2 1
Total 15 4 10 24
SEMESTER-VII
Teaching Scheme
Category
L T P C
Theory
CS 4xxx P Department Elective Course – V 3 1 0 4
CS 4003 P Cloud Computing 3 1 0 4
CS 4xxx P Department Elective Course – VI 3 1 0 4

CS 4xxx P Department Elective Course – VII 3 1 0 4
Practical
CS 4113 P Cloud Computing Lab 0 0 2 1
CS 4115 P Industrial Training - II 0 0 2 1
CS 4117 P Minor Project 0 0 8 4
Total 12 4 12 22
SEMESTER-VIII
Teaching Scheme
Category
L T P C
Practical
CS 4114 P Project 0 0 16 8
Total 0 0 16 8
SUMMARY OF CREDITS
Category I II III IV V VI VII VIII Total %
G
4 4 3 3 1 1 - - 16 9
(General)
B
12 12 4 0 4 - - - 32 18
(Basic Sciences)
E (Engineering
5 5 2 4 5 - - - 21 12
Sciences)
P (Professional) 4 5 17 18 14 23 22 8 111 61
Total 25 26 26 25 24 24 22 8 180 100

EVALUATION SCHEME
Internal Evaluation (Theory)
Assessment Assessment 1 Assessment 2 Assessment 3 Assessment 4 Assessment 5 Total
Marks 10 10 10 10 10 50
Internal Evaluation (Practical)
Assessment Daily Assessment Programs Programs performed ViVa- Total

performed during during Internal practical Voce
(Observations) Lab hours Examinations
Marks 10 10 10 10 40
External Evaluation (Theory)
Assessment End-semester Examination Total
Marks 100 Converted into 50 marks
External Evaluation (Practical)
Assessment Record File Programs performed Written Viva- Voce Total

during External Practical Work
Examinations
Marks 20 20 10 10 60
Internal Evaluation (Industrial Training)
Assessment Review 1 Review 2 Final Total

Presentation/
Viva-voce
Marks 10 10 20 40
External Evaluation (Industrial Training)
Assessment Report Final Presentation Total

and ViVa-voce
Marks 20 40 60
Internal Evaluation (Comprehension)
Assessment Internal 1 (MCQ) Internal 2 (MCQ) Total
Marks 20 20 40
External Evaluation (Comprehension)
Assessment MCQ ViVa-voce (any two Total

CSE subject)
Marks 20 40 60
Internal Evaluation (Project)
Assessment Review 1 Review 2 Final Total

Presentation/
Viva-voce
Marks 10 10 20 40
External Evaluation (Project)
Assessment Project Development Power point Usage of Innovativeness Individual Total

Report of Prototype/ presentation Modern Tool/ contribution
Model Technology
Marks 10 10 10 10 10 10 60
Note:
1. The evaluation Scheme may change as per the university guidelines.

2. Evaluation scheme of Industrial training may vary department wise.
3. Evaluation scheme project/minor project may vary department wise.
4. Department are advised to add the evaluation scheme in their respective curriculum.
PROGRAM OBJECTIVE
1. Graduates will be able to apply knowledge of mathematics, science,

engineering fundamentals, and an engineering specialization to the
solution of complex computer science engineering problems in the field
of hardware / software.
2. Graduates will be able to Identify, formulate and analyse complex
computer science engineering problems related to the computing system
design, development, testing and maintenance.
3. Graduates will be able to design systematic solutions under research-
based knowledge and research methods in the form of component,
process or a program for complex computer science engineering
problems that meet the specified needs with appropriate consideration for
the public health and safety, cultural, societal and environmental factors.
4. Graduates will be able to create, select, and apply best tools and
techniques in designing, developing, testing and maintaining a hardware
/ software in the field of computer science engineering or
interdisciplinary engineering with an understanding of the limitations.
PROGRAM OUTCOME
.
1. Graduates will be able to apply ethical principles in their professional and

troth to norms / responsibilities in the computer science engineering
practice.
2. Graduates will be able to communicate effectively on complex
software/system engineering activities with the peer community and
society through reports& presentations.
3. Graduates will able to identify the need for and involve in lifelong
learning in the rapidly evolving disciplines of computer science
engineering and multidisciplinary engineering domains.
LIST OF OPEN ELECTIVES
Code Category Course L T P C
Open Elective-I
20LE0201 German Language Phase-I 2 0 0 2
G
20LE0205 French Language Phase-I 2 0 0 2
G
Open Elective-II
20LE0202 German Language Phase-II 2 0 0 2
G
20LE0206 French Language Phase-II 2 0 0 2
G
Open Elective-III
20MA 3005 Computer Based Numerical and 3 1 0 4
B
Statistical Techniques
MB 3001 Engineering Economics and 3 1 0 4
B
Management
MB 3003 Industrial Management 3 1 0 4
B
MB 3005 Reliability and quality 3 1 0 4
B
Management
ET 3001 Production and Operation 3 1 0 4
B
Management
ET 3003 Entrepreneurship Development 3 1 0 4
B
ET 3005 Non-Conventional Energy 3 1 0 4
B
Resources
ET 3007 Nanotechnology 3 1 0 4
B
20MA0410 Probability & Statistics 3 1 0 4
B
LIST OF MODULE ELECTIVES
Code Category Course L T P C
Departmental Elective-I
NASSCOM Associate 1 1 4 4
P
CS 3033
Analytics
P Distributed Databases 1 1 4 4
CS 3035
Departmental Elective-II
P Computer Graphics 3 1 0 4
CS 3019
System Modelling and 3 1 0 4
CS 3021 P
Simulation
P Digital Image Processing 3 1 0 4

CS 3023
P Visual Programming 3 1 0 4
CS 3025
Operational Research 3 1 0 4
CS 3027 P
Techniques
Principles of Programming 3 1 0 4
CS 3029 P
Languages
P Soft Computing 3 1 0 4
CS 3031
Departmental Elective-III
P Theory of App Development 3 1 0 4
CS 3037
P Network Programming 3 1 0 4
CS 3039
P Distributed Operating System 3 1 0 4
CS 3020
P System Software 3 1 0 4
CS 3022
P Software Project Management 3 1 0 4
CS 3024
Departmental Elective-IV
P Grid Computing 3 1 0 4
CS 3026
P Object Oriented Analysis & 3 1 0 4
CS 3028
Design
P Neural Networks & Fuzzy 3 1 0 4

CS 3030
Logic
P Cyber Security 3 1 0 4
CS 3032
Departmental Elective-V
Network Security & 3 1 0 4
CS 4019 P
Cryptography
P Big Data & Analytics 3 1 0 4

CS 4021
Wireless Adhoc and Sensor 3 1 0 4
P
CS 4023
Network
Web Application Development 3 1 0 4

CS 4039 P
Departmental Elective-VI
Data Warehousing & Data 3 1 0 4
CS 4025 P
Mining
Mobile Computing 3 1 0 4
CS 4027 P
Machine Learning 3 1 0 4
CS 4029 P
Departmental Elective-VII
Open Source Software 3 1 0 4
CS 4031 P
Software Testing 3 1 0 4
CS 4033 P
Advanced Java Programming 3 1 0 4
CS 4035 P
Game Theory 3 1 0 4
CS 4037 P
LIST OF OPEN ELECTIVE COURSES
Sr. No. Subject Code Subjects Elective No.
1 20LE 0201 German Language Phase-I

OEC-I
2 20LE 0205 French Language Phase-I
3 20LE 0202 German Language Phase-II

OEC-II
4 20LE 0206 French Language Phase-II
5 20MA 3005 Computer Based Numerical and Statistical

Techniques
6 MB 3001 Engineering Economics and Management
7 MB 3003 Industrial Management
8 MB 3005 Reliability and Quality Management
9 ET 3001 OEC-III
Production and Operation Management
10 ET 3003 Entrepreneurship Development
11 ET 3005 Non-Conventional Energy Resources
12 ET 3007 Nanotechnology
13 20MA 0410 Probability & Statistics

SEMESTER – I
L T P C
Course Code: 20LE 0101 Subject Name: TECHNICAL ENGLISH – I 1 0 2 2
Course Category: Pre-requisite :
Co-requisite:
Designed by Computer Science & Engineering
COURSE OBJECTIVE:-
The students need to prepare themselves for their career which may require them to listen to, read, speak, and
write in English both for their professional as well as interpersonal communication in the globalized context.
The aim of Technical English course is to empower the students to improve both abilities to communicate
and your linguistic competence in the chosen language. A balance of Input (reading, listening) and output
(speaking, writing) s abilities are created through open classes and self‐ study.
UNIT COURSE CONTENTS CONTACT

HOURS
UNIT-I Nuances of English Language I 9
 Basic Grammar.
 Parts of speech and agreement (voice, tense, number).
 Modals and Auxiliaries.
 Phrasal Verbs
UNIT-II Nuances of English Language II 9
 Preposition
 Types of sentences (Interrogatives, Declaratives, Exclamatory and Imperative)
 Direct and Indirect speech
 Question Tags
 Common mistakes in English (spelling mistakes, uncountable noun mistakes,
irregular plural mistakes, irregular verb mistakes, collocation mistakes,
mistakes in the use of articles, prepositions, subject-verb agreement etc.)
UNIT-III Language and Regional Variation 9
 Accent and Dialect
 Dialectology
 Regional Dialects
 Style, Slang and Jargon
UNIT-IV Writing Skills 9
 Effective writing practice – Vocabulary expansion
 Effective sentences: role of acceptability, appropriateness, brevity & clarity in
writing
 Cohesion & coherence in writing
 Writing of definitions, descriptions
 Paragraph writing.
UNIT-V Academic Writing Skills 9
 Reciprocal relationship between reading and writing
 Thinking and Writing
 Argument Writing Practice
 Perspectives in Writing
 Professional Writing
 Narrative Writing.
LEARNING OUTCOME:
1. Understand and appreciate the need of communication training.
2. Use different strategies of effective communication.
3. Select the most appropriate mode of communication for a given situation.
4. Speak assertively and effectively.
5. Correspond effectively through different modes of written communication.
6. Write effective reports, proposals and papers.
7. Present himself / herself professionally through effective resumes and interviews.
Learning Resources
Text Book 1. Practical English Grammar – A J Thomson and A V Martinet
(OUP)
2. 1. M. Ashraf Rizvi, Effective Technical Communication, Tata
McGraw-Hill, New Delhi, 2005.
3. 2. Strunk, William, and E B. White, the Elements of Style.
Boston: Allyn and Bacon, Pearson Edition, 1999.
4. 3. Garner, Bryan A, HBR Guide to Better Business Writing,
Harvard Business Review Press, Boston, Massachusetts,
2013.
L T P C
Course Code: 20MA 0101 Subject Name: CALCULUS AND LINEAR ALGEBRA 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
The goal of this course is to achieve conceptual understanding of calculus and linear algebra. The syllabus is
designed to provide the basic tools of calculus for the purpose of modelling the engineering problems
mathematically and obtaining solutions. The course also gives the opportunity to the learner to understand
linear algebra and it’s application to Engineering.
HOURS
UNIT-I MATRICES: Types of Matrices- Elementary operations and their uses to finding the 9
Rank, Consistent and Inconsistent System of Equation, Solution of linear simultaneous
equations, Characteristic equation - Eigen values and Eigen vectors - Properties of
Eigen values - Caley - Hamilton theorem-Statement and Application, Quadratic Form,
Nature of Quadratic form, Reduction of Quadratic Form into Canonical form by
orthogonal transformation
UNIT-II MULTIVARIATE DIFFERENTIAL CALCULUS: Function of two variables – 9
limits and continuity, Partial derivatives, Partial derivatives of higher order,
Homogeneous Function Euler’s theorem on Homogeneous Function, - Total
derivatives - Taylor's expansion –Jacobians, Maxima & Minima of Function of two
variables, Lagrange’s Multiplier method of Undetermined Multipliers.
UNIT-III ORDINARY DIFFERENTIAL EQUATIONS: Simultaneous first order linear 9
equations with constant coefficients, Linear higher order ordinary differential
equations with constant co-efficient -solutions of homogenous and non-homogenous
equations - method of undetermined coefficients – method of variation of parameters
– equations - Homogeneous equation of Euler type - Equations reducible to
homogeneous form.
UNIT-IV VECTOR SPACES: Vectors in two dimensional space and n-dimensional space, 9
Vectors addition and scalar multiplication of Vectors, Vector Spaces: Definition and
Examples General properties of vector spaces, Linear combination of Vectors, Linear
independence and Linear dependence of Vectors.
UNIT-V LINEAR TRANSFORMATION: Linear transformations, linear operators, 9
Properties of Linear Transformation, Algebra of Linear transformation, Matrix
Representation of linear transformation, Linear map Associated with Linear
Transformation.
LEARNING OUTCOME:
1. Apply advanced matrix knowledge to Engineering problems
2. Equip themselves familiar with the functions of several variables
3. Familiarize with the applications of differential equations
4. Apply various techniques in solving differential equations.
5. Know vectors and vector spaces
6. Understand Linear Transformation and it’s properties
Learning Resources
Text Book 1. Grewal B.S, Higher Engineering Mathematics, Khanna
Publications, 44th Edition, 2017.
2. Ramana B. V., Higher Engineering Mathematics, Tata
McGraw – Hill Education, New Delhi, 2012.
3. Veerajan, T., Engineering Mathematics, Tata McGraw Hill
Publishing Co., New Delhi,2012
4. Kandasamy P etal. Engineering Mathematics, S.Chand&Co.,
New Delhi, Redevised edition2014.
5. Gilbert Strang and Kunze, Linear Algebra, Pearson, 5th
Edition, 2016.
Reference Book and other 1. Kreyszig.E, Advanced Engineering Mathematics, 10th edition,
materials John Wiley & Sons. Singapore, 2015
2. Dass H. K., Advanced Engineering Mathematics, Sultan
Chand Publication, Delhi, 2013.
3. Dr.V.Ramamurthy& Dr. SundarammalKesavan, "Engineering
Mathematics" - Vol I & II Anuradha Publications, Revised
Edition 2006
4. Seymour Lipschutz,Marc Lars Lipson Schaum's Outline of
Linear Algebra, McGraw-Hill Education, Sixth Edition,2018
5. Bali N.P., Goyal M, Watkins C, Advanced Engineering
Mathematics: A Complete Approach., Advanced Engineering
Mathematics, Laxmi Publications, New, Delhi.2018
L T P C
Course Code: 20PH 0102 Subject Name: MATERIALS SCIENCE 3 0 0 3
Co-requisite:
COURSE OBJECTIVE:-
To develop comprehension of the rapidly changing technological scenario and the requisite expertise for
appropriate selection of materials for specific engineering applications.
HOURS
UNIT-I ELECTRONIC MATERIALS 7
Electric conductivity and its temperature dependence, Free electron theory of electrical
conduction, free electron density, mobility and relaxation time, Explanation of Ohm’s
law -Drude-Lorentz model. Simple numericals. Band Theory of Solids-Bloch
Theorem, Kronig-Penny Model (Elementary Ideas), Allowed Energy bands.
Distinction between insulators, semiconductors and conductors.
UNIT-II SEMICONDUCTORS 9
Fermi Energy, Fermi-Dirac probability function & Density of states. Intrinsic &
Extrinsic Semiconductor (p and n- type)-Electrons & holes concentration in
conduction & valence band, Energy band & Fermi Level diagram. Variation of Fermi
level with temperature & impurity concentration, Hall Effect. Simple numerical.
UNIT-III PHOTONIC AND OPTOELECTRONIC MATERIALS 7
Photoconductivity-Simple model of Photoconductor, Variation of photoconductivity
with illumination, response time, gain factor, dark current, Applications of
photoconductivity -Photo conductive cell, Light dependent resistor (LDR),
Photovoltaic effect, Solar cell- Working and applications.
UNIT-IV MAGNETIC MATERIALS 6
Magnetic parameters and their relationships, Types of magnetic materials
(diamagnetic, paramagnetic, ferromagnetic and antiferro magnetic materials) and
comparison based on their response to temperature & applied magnetic field,
Langevin’s theory of diamagnetism.
UNIT-V INTRODUCTION TO NANOMATERIALS 6
Significance of nanoscale-surface area & quantum confinement effect, Degrees of
freedom and confinement- Quantum well, quantum wire and quantum dot, Size
dependent electronic properties. Synthesis of Nanomaterials-Sol Gel method, Ball
Milling. Introduction to SEM, TEM and AFM. Properties and applications of
nanomaterials.
LEARNING OUTCOME:
1. Understand electrical properties of materials,
2. Understand the properties and applications of semi conducting materials,
3. Understand general properties and applications of magnetic and dielectric materials,
4. Understand the behaviour of materials on exposure to light,
5. Understand general properties and application of modern engineering and bio materials, and get
familiarized with the concepts of Nano Science and Technology.
Learning Resources
Reference Book and other 1. Balasubramaniam, Calister’s Material Science, Wiley 2nd
materials edition.
2. J. D. Thiruvadigal, S. Ponnusamy and P. S. Vasuhi, Materials
Science, 5th edition, Vibrant Publications, Chennai, 2007
3. L. H. Van Vlack, Elements of Materials Science and
Engineering, 6th Edition, Wesley, 1985
4. V. K. Puri and R. K. Babbar, Solid State Physics, S. Chand
and Company
5. H. K. Malik and A. K. Singh, Engineering Physics, Mc Graw
Hill Education, India
6. Raghvan-Material Science and Engineering, 5th Ed. Eastern
Economy Edition
7. Solid State Physics, S. O. Pillai, 7th Ed. New Age International
Publishers.
8. B.K. Pandey and S. Chaturvedi, Engineering Physics,
Cengage Learning, New Delhi 2012.
9. R. S. Khurmi and R. S. Sedha, Material Science, 5th Ed. S.
Chand Publishers
10. K. G. Budinski and M. K. Budinski, Engineering Materials:
Properties and selection, 9th Ed.
11. K. K. Chattopadhyayy and A. N. Banerjee, Introduction to
Nano Science and Nano Technology, Eastern Economy
Edition
12. Ferroelectrics: Principles and Applications, A. K. bain & Prem
Chand, Wiley- VCH, 2017
L T P C
Course Code: 20GE 0102 Subject Name: BIOLOGY FOR ENGINEERS 2 0 0 2
Co-requisite:
COURSE OBJECTIVE:-
1. To familiarize the students with the basic organization of organisms and subsequent building to a living
being
2. To impart an understanding about the machinery of the cell functions that is ultimately responsible for
various daily activities.
3. To provide knowledge about biological problems that requires engineering expertise to solve them

HOURS
UNIT-I BASIC CELL BIOLOGY AND MOLECULAR BIOLOGY 10
Information transfer in organisms is like information transfer in a computer, Cell
structure and its comparison to computers, function of cell organelles, Eukaryotic and
prokaryotic cells working as it is like computers, Basic idea for Cell division, Mitosis,
Meiosis. Basic idea how Central Dogma of life and Genetic information in body works
like a computer system.
UNIT-II ENGINEERING IN BIO-ORGANIC CHEMISTRY INDUSTRY AND 6
HOSPITALS
Introduction to major biomolecules Carbohydrates, fats and proteins. Role of Robotics
and automation for human welfare like synthesis of biomolecules. Role of robotics in
hospital aid like providing food or medicines to the patients.
UNIT-III MICROBIAL TECHNOLOGY IN ENVIRONMENT REMEDIATION 4
Phases of microbial growth, Microbial growth curve, Sterilisation, Disinfection. Role
of engineers in environment biology, characterisation of sludge, Aerobic and anaerobic
sludge treatment, Trickling filters and other waste treatment systems.
UNIT-IV ENGINEERS IN FERMENTATION TECHNOLOGY & DOWNSTREAM 4
PROCESSING
Fermentation, Fermentors/Bioreactors and their components, Role of engineers in
fermentation industry and synthesis of essential commodities like antibiotics, vaccines
etc. Understanding for the stages in downstream operations.
UNIT-V PATHOGENS, CATASTROPHE AND DATA SCINECE 6
Immunity, Active and passive, Vaccine, Immunization, Viruses, Fungi and bacteria,
Data compilation in case of a catastrophe, Role of Artificial Intelligence and machine
learning in Biology, Pandemics, Epidemics and outbreaks.
LEARNING OUTCOME:
1. To familiarize the students with the basic organization of organisms and subsequent building to a living
being.
2. With this knowledge, the student will be then imparted with an understanding about the machinery of the
cell functions that is ultimately responsible for arious daily activities.
3. To provide knowledge about biological problems that require engineering expertise to solve them
Learning Resources
Text Book 1. Satyanarayana, Biotechnology, 4th Edition, Books and Allied
(p) Ltd. 2005-01-01, ISBN .
2. Lehninger A.L, Nelson D.L, Cox .M.M, Principles of
Biochemistry. CBS Publications 1993
3. Shuler.M.L. and Kargi.F, Bioprocess Engineering 1st Edition.
Pearson Education India, 2003.
4. Stanbury P.F., A.Whitaker, and Hall S.J. , Principles of
Fermentation Technology, 2nd Edition, Butterworth-Heinemann
1997.
L T P C
Course Code: 20GE 0104 Subject Name: ENVIRONMENTAL STUDIES 2 0 0 2
Co-requisite:
COURSE OBJECTIVE:-
The course provides the comprehensive knowledge in environmental science, environmental issues and the
management.
HOURS
UNIT-I The Multidisciplinary Nature of Environmental Studies 6
Definition, scope and importance, Need for public awareness.
UNIT-II Natural Resources 6
Renewable and Non-renewable Resources:
* Natural resources and associated problems.
(a) Forest resources: Use and over-exploitation, deforestation, case studies. Timber
Extraction, mining, dams and their effects on forests and tribal people.
(b) Water resources: Use and over-utilization of surface and ground water, floods,
drought, conflicts over water, dams-benefits and problems.
(c) Energy resources: Growing energy needs, renewable and non-renewable energy
sources, use of alternate energy sources. Case studies.
UNIT-III Ecosystems 6
* Concept of an ecosystem.
* Structure and function of an ecosystem.
* Producers, consumers and decomposers.
* Energy flow in the ecosystem.
* Ecological succession.
* Food chains, food webs and ecological pyramids.
* Introduction, types, characteristic features, structure and function of the following
Ecosystem:
o Forest ecosystem
o Grassland ecosystem
o Desert ecosystem
o Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries)
UNIT-IV Biodiversity and Its Conservation 6
* Introduction, definition: genetic, species and ecosystem diversity.
* Biogeographical classification of India.
* Value of biodiversity: consumptive use, productive use, social, ethical, aesthetic
and option values.
* Biodiversity at global, National and local levels.
* India as a mega-diversity nation.
* Hot-spots of biodiversity.
* Threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife conflicts.
* Endangered and endemic species of India.
* Conservation of biodiversity: in-situ and ex-situ conservation of biodiversity
UNIT-V Environmental Pollution 6
* Definition
* Types of pollutants
* Causes, effects and control measures of
(a) Air pollution (b) Water pollution
LEARNING OUTCOME:
1. The importance of environmental education, ecosystem and ethics.
2. Knowledge with respect to biodiversity and its conservation.
3. To create awareness on various environmental pollution aspects and issues.
4. To educate the ways and means to protect the environment.
5. Important environmental issues and protection
Learning Resources
Text Book 1. Environmental Studies from crisis to cure, by R. Rajagopalan,
3rd edition, Oxford Higher Education
2. Kurian Joseph & R. Nagendran, “Essential of Environmental
Studies” Pearson Education, 2004.
Reference Book and other 1. Dara S.S., A Text Book of Environmental Chemistry and
materials pollution control, S.Chand & Company Ltd., New Delhi, 2004.
2. Jeyalakshmi.R, Principles of Environmental Science, 1st
Edition, Devi Publications, Chennai 2006.
3. Kamaraj.P & Arthanareeswari.M, Environmental Science –
Challenges and Changes, 1st Edition, Sudhandhira Publications,
2007.
4. Arivalagan.K, Ramar.P & Kamatchi.P, Principles of
Environmental Science, 1st Edition, Suji Publications, 2007.
L T P C
Course Code: 20GE 0101 Subject Name: BASIC ENGINEERING – I 3 0 0 3
Co-requisite:
COURSE OBJECTIVE:-
To familiarize the students with the concepts of thermodynamics, hydraulic turbines and dams, building
materials and manufacturing processes.
HOURS
UNIT-I BASIC CONCEPT OF THERMODYNAMICS 12
Introduction, systems and surroundings, property, state and process; reversible and
irreversible process, heat, work and energy, Zeroth law, 1st, and 2nd law of
thermodynamics, Enthalpy and Entropy, working of external and internal combustion
engines, Introduction to refrigeration and air -conditioning, Rating of refrigeration
machines, Coefficient of performance, Simple refrigeration vapour compression cycle.
UNIT-II HYDRAULIC TURBINES & DAMS 11
Introduction, Classification and working of Pelton, Francis and Kaplan turbines,
Specific speed and selection of turbines.
Dams -classification of dams - Selection of the type of dam - Selection of dam site.
Introduction to Hydropower plant.
UNIT-III BUILDING MATERIALS AND THEIR PROPERTIES 11
General Introduction to Civil Engineering, Types, Property and Application of
materials- Brick, Stone, Cement, Steel, Concrete, timber.
Concept of Stress and Strain, yield stress, ultimate stress, proportional limit, elastic
limit, working stress , factor of safety, Hooke’s law, Young’s modulus, Rigidity
modulus, bulk modulus, Poisson’s ratio.
UNIT-IV MANUFACTURING PROCESSES 11
Welding: Introduction, classification, welding rods and fluxes, principles of gas and
electric arc welding processes (no other specific welding processes), soldering and
brazing.
Machine tools: Classification, description and function of lathe parts list of operations
performed on a lathe. Classification, operations on drilling machine, principles of
grinding operations.
LEARNING OUTCOME:
 Understand basics of thermodynamics and its properties.
 Understand basics of heat transfer, refrigeration and internal combustion engines.
 Understand concept of hydraulic turbines, its types and application.
 Understand concept of hydraulic dams, its types and application.
 Understand different types of construction materials, their properties and applications.
 Understand functions and operations of different machine tools.
Learning Resources
Text Book 1. Dr. B C Punmia, “Basic Civil Engineering”, Laxmi
publications, New Delhi
2. R.K. Rajput, Elements of Mechanical Engineering, Laxmi
Publications (P) Ltd.
3. D. S. Kumar, Basic of Mechanical Engineering, S. K. Kataria
& Sons.
4. Shanmugasundaram , K. Mylsamy, “Basic Civil and
Mechanical Engineering”, Cengage Publication, New Delhi.
Reference Book and other 1. P. K. Nag, “Engineering Thermodynamics” Tata McGrawa-

materials Hill
2. R. K. Bansal , “Fluid Mechanics and Hydraulic Machines”,
Laxmi Publications (P) Ltd.
3. Kalpakjian, Manufacturing Engineering and Technology,
Addision Wesley Congmen Pvt. Ltd., Singapore, 2000
L T P C
INTRODUCTION TO COMPUTER AND
CS 1001 3 0 0 3
PROGRAMMING
Course Pre-requisite
Category Co-requisite
COURSE OBJECTIVE:-
To impart a sound knowledge on working of the computer involving the different basic concepts of
programming oriented topics required for developing computer software.

HOURS
UNIT-I INTRODUCTION OF COMPUTER SYSTEM 9
Anatomy of a digital Computer, Different Units of Computer, System, Hardware &
Software, Classification of Computer Systems, Number systems, Operating System:
Definition, working & its functions, Basic concepts of Computer Networks, Network
Topologies
UNIT-II PROGRAMMING FUNDAMENTS 9
Programming language- Definition, types; Syntax & Semantics, Type of programming
errors, Assembler, Linker, Loader, Compiler, Interpreter, debuggers, Algorithms,
flowcharts and their symbols
UNIT-III BASICS OF ‘C’ LANGUAGE 9

C Fundamentals, Basic data types, variables and scope, formatted input/ output,
expressions, selection statements, loops and their applications
UNIT-IV ARRAY & FUNCTION 9

Arrays, functions, recursive functions, pointers and arrays. Strings literals, arrays of
strings; applications.
UNIT-V STRUCTURE & FILE SYSTEM 9

Structures, Declaring a Structure, Accessing Structure Elements, Storing Structure
elements, Array of Structures Unions and Enumerations
File Input/Output, Data Organization, File Operations, Opening a File, Reading from
a File, Closing the File, Writing to a File, File Opening Modes.
LEARNING OUTCOME:
On completion of this course, the students will be able to:-

1. Comprehend concepts related to computer hardware and software, draw flowcharts and write
algorithm/pseudocode.
2. Write, compile and debug programs in C language, use different data types, operators and console I/O
function in a computer program.
3. Design programs involving decision control statements, loop control statements, case control
structures, arrays, strings, pointers, functions and implement the dynamics of memory by the use of
pointers.
4. Comprehend the concepts of linear and Non-Linear data structures by implementing linked lists,
stacks and queues.
Learning Resources
Text Book 1. The C Programming Language by Dennis M
Ritchie, Brian W. Kernigham, 1988, PHI.
2. Computer System & Programming in C by S
Kumar & S Jain, Nano Edge Publications, Meerut.
3. Fundamentals of Computing and C Programming,
R. B. Patel, Khanna Publications, 2010, New Delhi.
4. Let Us C Yashwant Kanetkar 5th Edition
5.
Reference Book and other 1. Computer Fundamentals and Programming in C, Reema
materials Theraja, Oxford
2. Information technology, Dennis P. Curtin, Kim Foley,
Kunal Sen, Cathleen Morin, 1998, TMH
3. Theory and problem of programming with C, Byron C
Gottfried, TMH
L T P C
Course Code: 20PD 0101 Subject Name: PERSONALITY DEVELOPMENT- I 1 0 0 1
Co-requisite:
COURSE OBJECTIVE:-
The purpose of this course is to build confidence and inculcate various soft skills and to help Students to
identify and achieve their personal potential.

HOURS
UNIT-I Self-analysis SWOT - Time management - Creative chain story telling 3
UNIT-II Vocabulary games I – Attitude - Interpersonal skills-Goal Setting 3
UNIT-III Motivation I - Vocabulary games II - Article review-Case Study 3
UNIT-IV Team building exercise - Critical Thinking - Event Management- Email Writing 3
skills
UNIT-V Business situation & Corporate Skills - Leadership Qualities - Review 3
LEARNING OUTCOME:
1. To guide thought process.
2. To groom students' attitude.
3. To develop communication skill.
4. To build confidence.
5. To Prepare Students for Campus Recruitment
L T P C
Course Code: 20PH 0104 Subject Name: MATERIALS SCIENCE LAB 3 1 0 3
Co-requisite:
COURSE OBJECTIVE:-
The Material Science Laboratory course is intended to provide hands-on practical training to students
for better understanding of the concepts of Materials Science. It will give an opportunity to gain
insight into some of the characterization techniques of materials.
Experiment 1: Solar Cell characteristics

Experiment 2: P-N Junction Characteristics
Experiment 3: To determine the Hall coefficient of the given n type or p type semiconductor and
determine the majority charge carrier concentration.
Experiment 4: To determine the dielectric constant of the given sample at different temperatures.
Experiment 5: To study the photoconductive nature of the given light dependent resistor (LDR).
Experiment 6: To determine the energy band gap of a semiconductor (Germanium) using four probe
method.
Experiment 7: To measure the susceptibility of paramagnetic solution by Quincke’s tube method.
Experiment 8: To find the thermal conductivity of given bad conductor of heat (card board- disc) by
Lee’s Disc Method.
Experiment 9: To determine the temperature coefficient of resistance
Experiment 10: Magnetic hysteresis and B-H Curve Tracer
LEARNING OUTCOME:
1. The students are expected to familiarize with various characterization techniques of materials.
They should have developed better understanding of the underlying science behind the
properties of various materials.
Learning Resources
Reference Book and other 1. Chattopadhyay, D., Rakshit, P. C and Saha, B., “An advanced Course in
materials Practical Physics”, 2nd edition, Books & Allied Ltd, Calcutta, 1990.
2. Chauhan and Singh , “ Advanced practical physics”, Revised edition,

Pragati Prakashan Meerut, 1985.
3. Thiruvadigal. J. D., Ponnusamy S. Vasuhi, P. S. and Kumar. C, “Hand Book

of Practical physics”, 5th edition, Vibrant Publication, Chennai, 2007.
L T P C
Course Code: 20GE 0107 Subject Name: NCC/NSS/NSO/YOGA 0 0 2 1
Co-requisite:
Unit Lecture Practical
Yoga- History, Classification and Practice of Relaxing asanas (Savasana,

1
importance Shashankasana, Makarasana & its Variations)
Practice of Meditative Asanas (Padmasana,

Asanas- Meaning, Classifications of
2 Swastrikasana, Sukhasana, Vajrasana,
Asanas
Siddhasana)
Practice of Cultural Asanas ( Bhujangasana,

Sarvangasana, Salabhasana, Ardha
3 Asanas- General Benefits of Asanas Matsyendrasana, Matsyasana, Dhanurasana,
Setubandhasana, Chakrasana, Ardha Halasana,
Purna Halasana)
Suryanamaskar- Meaning, Steps &

4 Practice of Suryanakaskar
Benefits
Practice of Pranayam (Purak, Rechak,

Pranayam – Meaning,Types, Steps &
5 Khumbhak, anulom-Vilom, Kapal-Bhathi,
Benefits
Bhramri, Shitli & Shitkari)
Meditation- Meaning, Rules & General

6 Practice of Meditation
Benefits
Hours = 22
NSO Curriculum
Lecture Practical
Basketball- History, Measurements,

rules & regulations, basic skills, Practise of basic skills with the implementation of
1
Awardees, Important Tournaments, basic rules of Basketball
Standard Venues
Cricket- History, Measurements, rules

& regulations, basic skills, Awardees, Practise of basic skills with the implementation of
2
Important Tournaments, Standard basic rules of Cricket
Venues
Football- History, Measurements, rules
& regulations, basic skills, Awardees, Practise of basic skills with the implementation of
3
Important Tournaments, Standard basic rules of Football
Venues
Volleyball- History, Measurements,

rules & regulations, basic skills,
4
Awardees, Important Tournaments, Practise of basic skills with the implementation of
Standard Venues basic rules of Volleyball
Hours = 8
LEARNING OUTCOME:
1. Increased balance, strength, and flexibility

2. A beginning sense of alignment in the body
3. Competence of all five breath techniques and variations
4. An internal sense of focus and clarity in the movement meditation
5. Understanding of the cultural and philosophical approaches to yoga
6. Desire to learn, excel and continue studies on the art of yoga
7. Basic knowledge of Basketball, Cricket, Football & Volleyball
Learning Resources
Text Book 1. Vedatri Maharshi , “Yoga for Modern Age”
2. Vedatri Maharshi, “ Simplified Physical Exercises”
3. Dr. Kalpana Sharma, “Rules of Games & Sports 2018”

L T P C
CS 1111 COMPUTER PROGRAMMING LAB 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
This fundamental course will enable the students to learn the concepts of Programming Language
and design principles along with understanding of C Language, syntax and functional concepts.
LIST OF PROGRAMS
1. Write a program to find the largest of three numbers. (if-then-else)

2. Write a program to find the largest number out of ten numbers (for-statement)
3. Write a program to find the average mail height & average female heights in the class (input is in
form of sex code, height).
4. Write a program to find roots of quadratic equation using functions and switch statements.
5. Write a program using arrays to find the largest and second largest no. out of given 50 nos.
6. Write a program to multiply two matrices.
7. Write a program to sort numbers using the sorting Algorithm.
8. Represent a deck of playing cards using arrays.
9. Write a program to check that the input string is a palindrome or not.
10. Write a program to read a string and write it in reverse order.
11. Write a program to concatenate two strings.
12. Write a program which manipulates structures (write, read, and update records).
13. Write a program which creates a file and writes into it supplied input.
14. Write a program which manipulates structures into files (write, read, and update records).
Note: At least 5 to 10 more exercises to be given by the teacher concerned.
Course Learning Outcomes (CLOs): -

1. To understand the concepts of Programming language
2. To learn the basics of C declarations, operators and expressions
3. To learn on the manipulation of strings, functions and pointers
4. To apply concepts and techniques for implementation
Learning Resources
Reference Book and other 1. Let Us C Yashwant Kanetkar 5th Edition
materials
L T P C
Course Code: 20ME 0120 Subject Name: WORKSHOP PRACTICE 1 0 2 2
Co-requisite:
COURSE OBJECTIVE:-
To provide the students with, hands on experience on different trades of engineering like fitting,
carpentry, smithy, welding and sheet metal.
LIST OF EXPERIMENTS
FITTING
Tools & Equipments – Practice in Filing and Drilling.
Making Vee Joints, Square, dovetail joints, Key Making.
CARPENTARY
Tools and Equipments – Planning practice. Making Half Lap, dovetail, Mortise & Tenon joints, and
a mini model of a single door window frame.
SHEET METAL
Tools and equipments - Fabrication of a small cabinet, Rectangular Hopper, etc.
WELDING
Tools and equipments - Arc welding of butt joint, Lap Joint, Tee Fillet. Demonstration of Gas
welding, TIG & MIG.
SMITHY
Tools and Equipments –Simple exercises base on smithy operations such as upsetting, drawing down,
punching, bending, fullering & swaging, Making simple parts like hexagonal headed bolt, chisel.
EMPHASIS TO BE LAID ON REAL LIFE APPLICATIONS WHEN FRAMING THE

EXERCISES.
LEARNING OUTCOME:
1. Use different manufacturing (Fitting, carpentry, sheet metal, welding, smithy working, etc)
processes required to manufacture a product from the raw materials.
2. Use different measuring, marking, cutting tools used in workshop.
3. Aware of the safety precautions while working in workshop.
Learning Resources
Text Book 1. Gopal, T.V., Kumar, T., and Murali, G., “A first course on
workshop practice –Theory, practice and workbook”, Suma
Publications, 2005.
Reference Book and other 1. Kannaiah,P. & Narayanan,K.C. ―Manual onWorkshop
materials Practice”, Scitech Publications, Chennai, 1999.
2. Venkatachalapathy, V.S. ―First year Engineering Workshop
Practice”, Ramalinga Publications, Madurai, 1999.
SEMESTER – II
L T P C
Course Code: 20LE 0102 Subject Name: TECHNICAL ENGLISH – II 1 0 2 2
Co-requisite:
COURSE OBJECTIVE:-
The paper aims at giving the students an opportunity to develop writing skill, concentrating on the
various techniques involved in the competitive examinations. The students will be able to express
themselves in a meaningful manner to different levels of people in their academic and social domains.
The students will have knowledge of the various uses of English in their professional environment
and they will be able to communicate themselves effectively in their chosen profession.
HOURS
UNIT-I Technical Writing Skills 6
 Report Writing
 Article Writing
 Curriculum Vitae – Resume Writing
 Email Writing
 Abstract and Synopsis Writing
 Reviewing
UNIT-II Language for specific Speech events 6
 Drafting an Invitation
 Drafting the Minutes of a Meeting
 Addressing a Gathering (Welcome Address)
 Formal Speech (Occasions) Public Speech (Topics)
 Proposing Vote of Thanks
UNIT-III Presentation Skills 6
 Oral Presentation Skills
 PowerPoint Presentation
 Poster Presentation
 Body Language
UNIT-IV Language and communication 6
 Reading Strategies: Skimming, Scanning, Inferring,
 Predicting and Responding to Content
 Guessing from Context
 Note Making
 Vocabulary Extension
 Speed Reading Practice
 Use of Extensive Reading Texts.
UNIT-V Acquisition of Corporate Communication/ Speaking Skills 6
 Group Discussion
 Stage Dynamics
 Role Play
 Interview
 Mock Interview
LEARNING OUTCOME:
1. To provide for the acquisition of basic communication skills in English in relation to the
requirements of the students of Engineering and Technology.
2. To facilitate the holistic, integrated development of LSRW involved in language learning through
a series of intensely practical tasks and activities.
3. To offer professionally sustainable language content by which to address the special needs of the
target learners to ensure that they are adequately equipped with discoursal and grammatical
competencies.
4. To help acquire the use of language simultaneously through the electronic media such as the
Internet so as to enable the learners to deal effectively with E-materials.
5. To expose the learners to a wide range of lexical and grammatical skills needed for their special
professional demands.
Learning Resources
Reference Book and other 1. M. Ashraf Rizvi, Effective Technical Communication,
materials Tata McGraw-Hill, New Delhi, 2005.
2. Strunk, William, and E B. White, The Elements of Style.
Boston: Allyn and Bacon, Pearson Edition, 1999.
3. Garner, Bryan A, HBR Guide to Better Business Writing,
Hardvard Business Review Press, Boston, Massachusetts,
2013.
4. Shirley Taylor (1999), ‘Communication for Business’,
Longman, New Delhi.
5. Robert Gannon (2000), ‘Best Science Writing: Readings
and Insights’, University Press, Hyderabad.
6. Richard A. Boning (1990), ‘Multiple Reading Skills’,
McGraw Hill, Singapore.
7. Albert J. Harris, Edward R.Sipay (1990), ‘How to
Increase Reading Ability’, Longman.
8. David Martin (1994), ‘Tough Talking’, University press,
Hyderabad.
L T P C
Course Code: 20GE 0108 Subject Name: VALUE EDUCATION 1 0 0 1
Co-requisite:
COURSE OBJECTIVE:-
To provide guiding principles and tools for the development of the whole person, recognizing that
the individual is comprised of Physical Intellectual, Emotional and Spiritual dimensions.

HOURS
UNIT-I Concept of Values 3
Definition and Classification of values- type of values Espoused and Applied values
Education – Natural and Social processes of Value Education – Fundamental values -
Best practices of education - Knowledge and understanding – Cognitive Process –
Instruction and Learning –Mahatma Gandhi – Jawaharlal Nehru – Rabindranath
Tagore - Swami Vivekananda.
UNIT-II Need of the hour 1
The need for education in Values - Implications of education in Values-Vision of a
better India.
UNIT-III Education in India 2
Indian Society - Ancient Education in India - Modern education in India –English
Education – culture – Technology in Education: Technology and its values in
education.
UNIT-IV Educational Values 2
Personal values - Social values - Learning values - equality& brotherhood – unity -
freedom – responsibility - Religions – people groups – different faiths – respect for
other faiths – social evils.
UNIT-V Professional Values and Professional Ethics 1
Openness – Transparency – Impartiality – Objective – Confidentiality – Diligent –
Loyalty.
UNIT-VI Moral Values 1
Morality – Descriptive Morality – Normative Morality – Aristotle and his ideas on
Moral values.
UNIT-VII Social Values and Justice 1
Definition – Need – Parameters of Social Justice – Factors Causing – Social Injustice
UNIT-VIII Challenges in Value Adoption 1
Cultural Challenges- Social Challenges- Religious Challenges- Intellectual and
Personal Challenges.
LEARNING OUTCOME:
1. To help individuals think about and reflect on different values.
2. To deepen understanding, motivation and responsibility with regard to making personal and
social choices and the practical implications of expressing them in relation to themselves, others,
the Community and the world at large.
3. To inspire individuals to choose their own personal, social, moral and spiritual values and be
aware of practical methods for developing and deepening them
Learning Resources
Reference Book and other 1. NCERT, Basics in Education, 2012.
materials 2. CBSE, Value Education: A Handbook for Teachers,
2012.
3. K. Gandhi, Value Education
4. NCERT, Education for Values in Schools: A
Framework
5. NCERT, Value education, 2005.
L T P C
Course Code: 20PH 0101 Subject Name: PHYSICS 3 0 0 3
Co-requisite:
COURSE OBJECTIVE:-
To provide students with the knowledge of variety of important concepts of Physics and their
applications in Engineering and Technology.

HOURS
UNIT-I OSCILLATIONS & ULTRASONIC WAVES 8
Oscillations: Simple Harmonic Motion (SHM), Differential Equation of SHM and its
Solutions, Conservation of Energy. Mass-string System. Damped Harmonic
Oscillator-Over damped, Critically Damped, Under Damped motions, Relaxation
Time, Forced vibrations. Resonance & Quality Factor. Ultrasonic Waves: Methods of
production-Magnetostriction & Piezoelectric, Applications of Ultrasonic.
UNIT-II ELECTROMAGNETISM 8
Mathematical Background: Gradient, Divergence, curl (Physical Significance),
Irrotational & Solenoidal Field, Gauss Divergence and Stoke’s Theorem, Important
Vector Identities. Maxwell’s Equations: Modification in Ampere’s Circuital Law,
Maxwell’s Equation in Integral & Differential forms. Wave equation for
Electromagnetic (EM) Waves-Propagation in free space, Characteristic Impedance,
Poynting Vector (simple numericals), EM Energy Density.
UNIT-III INTERFERENCE & DIFFRACTION 8
Interference: Superposition Principle, Division of Amplitude-Interference in Thin
films, Application: Michelson’s Interferometer, Interference in Wedge shaped Film,
Application: Newton’s Ring. Diffraction: Huygen’s Wave Theory, Fraunhofer Vs
Fresnel Diffractions, Fraunhofer Diffraction in Single & Multiple slits (Grating),
Diffraction Vs Interference, Resolving power & Dispersive power of grating and
prism.
UNIT-IV LASERS & FIBER OPTICS 9
Lasers: Basic Theory- Einstein Coefficients, Properties of Laser, Population inversion,
Pumping Schemes, Three and Four level Lasers. Principle, Construction and working
of Helium-Neon (He-Ne) & Nd:YAG Lasers. Optical Fibers (OFs): Physical
Structure and Principles, Modes, V-Number. Classification of Optical Fibers based on
(a) Refractive Index-Step & Graded Index Fibers (b) Modes-Single & Multimode
Fibers. Basic Application of OFs in Sensing & Communication. Hollow Core Photonic
Crystal Fibers (Elementary Idea).
UNIT-V MODERN PHYSICS & QUANTUM MECHANICS 7

Qualitative review of different experiments, Planck’s Hypothesis, de-Broglie waves,
Dual Nature of Matter, Uncertainty principle, Matter waves, Significance of Wave
Functions, Schrodinger Wave Equation, Operators in Quantum Mechanics, Particle in
a One-Dimensional Box, The Potential Barrier Problem and Tunnelling Effect
(Qualitatively).
LEARNING OUTCOME:
1. To understand the general scientific concepts required for technology
2. To apply the Physics concepts in solving engineering problems
3. To educate scientifically the new developments in engineering and technology
4. To emphasize the significance of Green technology through Physics principles
Learning Resources
Reference Book and other 1. 1. Beiser A, Concepts of Modern Physics, 5th Ed., McGraw
materials
Hill International, 2003.
2. Ajoy Ghatak, Optics, 5th Ed., Tata McGraw Hill, 2012.
3. David J. Griffiths, Introduction to Electrodynamics,
Pearson Education Limited, London, 2015.
4. Arumugam, M., Engineering Physics, 2nd edition,
Anuradha Publishers, Kumbakonam, 2003.
5. Gaur and Gupta, Engineering Physics, 7th edition,
Dhandapani and Sons, New Delhi, 1997.
6. Thiruvadigal, J. D., Ponnusamy, S., Vasuhi, P. S. And
Kumar, C., Physics for Technologists, 5th edition, Vibrant
Publication, Chennai, 2007.
7. H.K. Malik and A.K. Singh, Engineering Physics,
McGraw Hill Education Private Limited, New Delhi,
2014.
8. N. Subrahmanyam and Brij Lal, Waves and Oscillations.
L T P C
Course Code: 20CY 0101 Subject Name: CHEMISTRY 3 0 0 3
Co-requisite:
COURSE OBJECTIVE:-
1. To enable the students to acquire knowledge of the principles of chemistry for engineering
applications.
2. To bring adaptability to new developments in engineering chemistry and a knowledge of
contemporary issues relevant to engineering.
3. To make them apply the knowledge of fundamental chemistry for identification, solution and
analysis of complex engineering problems and design system components or processes that
meet the specified needs with appropriate consideration for the public health and safety, and
the cultural, societal, and environmental considerations.

HOURS
UNIT-I Water Treatment 9
Impurities in Water, Hardness of Water-Softening Methods (Lime-Soda Process,
Zeolite, Ion-Exchange Methods), Boiler feed Water-Sludge and scale formation,
Caustic embrittlement, priming and foaming, boiler corrosion, Desalination of
Brackish Water-Electrodialysis and Reverse Osmosis, Water for Domestic Use-
Chlorination, Ozonization, UV treatment, Analysis of Water-Alkalinity, Hardness
(EDTA Method), Dissolved Oxygen (Winkel’s method).
UNIT-II Phase Equllibrium and Fuels 9
Terminologies-Phase, Components, Degree of Freedom, Phase Rule (W. Gibbs), One
Component system-Water only (Area, Curve, Triple Point), Two component System
and Reduced phase Rule, Eutectic System, Pb-Ag System (Area, Lines), KI-H2O
System (Area, Lines), Technical applications: freeze drying, solders, safety plugs and
freezing mixtures. Fuel and their classification, Caloric value, Cracking, Fuel for
Internal Combustion Engine-Knocking, Octane Number, Diesel Engine Fuels-Cetane
Rating, Non-Conventional Source-Solar Energy, Biomass, Biogas.
UNIT-III Polymers 9
Terminologies-Functionality, Degree of Polymerization, Classification of polymer,
Molecular Weight of Polymer (Mw, Mn), Polymerization- Addition (ionic, free-
radical), Co-ordination (Ziegler-Natta), Plastics- PE, Polystyrene, PVC, Teflon,
PMMA, Polyesters, Epoxy Resins, Polyamide (Nylon-66, Nylon-6), Phenolic Resins
(Bakelite), Amino Resins (Urea-Formaldehyde), Elastomer-Synthetic Rubber, Silicon
Rubber.
UNIT-IV Corrosion 9
Corrosion: Basic concepts - mechanism of chemical, electrochemical corrosion, Types
of Electrochemical corrosion - galvanic corrosion - differential aeration corrosion -
pitting corrosion - stress corrosion, Factors Affecting Corrosion-Metal, Environment,
Corrosion control: Cathodic protection - sacrificial anodic method - corrosion
inhibitors. Protective coatings: surface preparation for metallic coatings - electro
plating (copper plating) and electroless plating (Nickel plating) - chemical conversion
coatings - anodizing, phosphating & chromate coating.
UNIT-V Engineering Materials 9
High energy materials (HEMs)-Introduction; classification (explosives, propellants,
pyrotechnics); requirements of HEM: sensitivity, detonation performance, oxygen
balance; Important explosives (structure, preparation, properties): Lead azide, DDNP,
dynamites, TNT, PETN, RDX, and plastic explosives.
LEARNING OUTCOME:
1. The students should be conversant with
2. The role of applied chemistry in the field of engineering.
3. The knowledge of water quality parameters and the treatment of water.
4. The principles involves in corrosion and its inhibitions.
5. Important analytical techniques, instrumentation and the applications.
6. Knowledge with respect to the phase equilibrium of different systems.
Learning Resources
Text Book 1. Prasanta Rath , “Engineering Chemistry”, 2015, Cenage
Learning India Private Ltd.,
2. Shashi Chawla “A text book of Engineering Chemistry”,
Dhanpat Rai & Co.
Reference Book and other 1. S.S. Dara, A Text book of Engineering Chemistry, 10th Edition,
materials
S. Chand & Company Ltd., New Delhi, 2003
2. Jain. P. C. and Monika Jain, "Engineering Chemistry", Danpat
Rai publishing company (P) Ltd, New Delhi, 2010.
L T P C
Course Code: 20MA 0102 Subject Name: ADVANCED CALCULUS AND COMPLEX 3 1 0 4
ANALYSIS
Co-requisite:
COURSE OBJECTIVE:-
The course aims to familiarize the learner with the advanced concepts of Integral and Vector Calculus.
It also provides the knowledge of Laplace Transforms and it’s application. The course gives the
insights of functions of a complex variable including contour integration and residue theorem.

HOURS
UNIT-I INTEGRAL CALCULUS 9
Improper Integral: Beta and Gamma function, Multiple Integral: Introduction of
multiple integration by examples of Double and Triple integral, Evaluation of double
and Triple Integration(in both Cartesian and polar coordinates),Change of order of
integration ,Application of double integral- Area and Centre of gravity - Triple
integration in Cartesian coordinates , Application of triple integral-volume.
UNIT-II LAPLACE TRANSFORMS 9
Laplace Transforms of simple functions, Basic operational properties, transforms of
derivatives and integrals, Unit step function, periodic functions, Inverse Laplace
transforms, Inverse Laplace transforms of derivatives and integrals, Convolution
theorem, Applications of Laplace transforms for solving linear ordinary differential
equations up to second order with constant coefficients only.
UNIT-III VECTOR CALCULUS 9
Differentiation of vectors: Scalar and vector point functions, Gradient, divergence, curl
Solenoidal and irrotational vectors, Vector identities (without proof) ,Normal and
Directional derivatives, Solenoidal and irrotational field, Integration of vectors: Line,
surface and volume integrals , Green's, Gauss divergence and Stroke's theorems
(Statements only) - Verification and applications to cubes and parallelepipeds only.
UNIT-IV FUNCTIONS OF COMPLEX VARIABLE 9
Limit, continuity, differentiability and analyticity of functions, Cauchy-Riemann
equations (Cartesian and polar), Harmonic functions, Determination of harmonic
conjugate, Milne-Thomson's method, and conformal mappings: rotation, reflection,
inversion and bilinear transformation.
UNIT-V COMPLEX INTEGRATION 9
Line integral, Cauchy's integral theorem (without proof), Cauchy's integral formulae
(with proof), application of Cauchy's integral formulae, Taylor’s and Laurent's
expansions (statements only), Singularities, Poles and Residues, Cauchy's residue
theorem and application.
LEARNING OUTCOME:
1. Evaluate Double & Triple integration
2. Understand the applications of multiple integral
3. Describe Laplace and inverse Laplace transform
4. Expose the concept of line, surface and volume integrals.
5. Familiar with Analytic functions, conformal mappings, complex integration
Learning Resources
Text Book 1. Grewal B.S, Higher Engineering Mathematics, Khanna
Publications, 44th Edition, 2017.
2. Bali N.P., Goyal M, Watkins C, Advanced Engineering
Mathematics: A Complete Approach., Advanced Engineering
Mathematics, Laxmi Publications, New, Delhi.2018
3. Dass H. K., Advanced engineering Mathematics, Sultan
Chand Publication, Delhi, 2013.
4. Kandasamy P etal. Engineering Mathematics, S.Chand & Co.,
New Delhi, Redevised edition2014.
Reference Book and other 1. Kreyszig.E, Advanced Engineering Mathematics, 10th
materials edition, John Wiley & Sons. Singapore, 2015.
2. Ramana B. V., Higher Engineering Mathematics, Tata
McGraw – Hill Education, New Delhi, 2012.
3. Veerajan, T., Engineering Mathematics, Tata McGraw Hill
Publishing Co., New Delhi, 2012.
L T P C
Course Code: 20GE 0106 Subject Name: BASIC ENGINEERING – II 3 1 0 3
Co-requisite:
COURSE OBJECTIVE:-
This course provides a comprehensive idea about circuit analysis, working principles of machines and
common measuring instruments. It also provides fundamentals of electronic devices, transducers and
integrated circuits.

HOURS
UNIT-I AC & DC CIRCUITS 9
Basic Circuit Elements; Work, Power, Energy; Basic Circuit laws: Ohms law,
Kirchhoff's law; Series & Parallel Networks (with resistances, inductances &
capacitances); Voltage Division & Current Division Rule; Star Delta Transformation;
Average and RMS value
UNIT-II FUNDAMENTALS OF ELECTRICAL MACHINES 9
Single phase transformers: Theory & Necessity of Transformers, Principle of
Operation, Construction &types, EMF equation, losses (hysteresis& eddy current).
UNIT-III DIODE PRINCIPLES & BASICS OF BIPOLAR JUNCTION TRANSISTOR 9
P-N Junction Diode: Construction, characteristics, parameters, applications; Half-
Wave, Full Wave Rectifiers, Bridge Rectifiers; Zener Diode Bipolar Junction
Transistors: Operation, Input & Output Characteristics of BJT: CB configuration, CE
configuration, CC configuration, Transistor Applications: BJT as Amplifier.
UNIT-IV BASICS OF FIELD EFFECT TRANSISTORS & OPERATION AMPLIFIERS 9
JFET: Introduction, Construction, Theory of Operation of JFET &Characteristics;
MOSFET: construction, working & characteristics
Introduction to Operation Amplifiers: Ideal OP- Amp, Inverting & Non-Inverting Op-
Amp circuits, Op-Amp application: Adder, Integrator & Differentiator
UNIT-V FUNDAMENTALS OF DIGITAL SYSTEMS 9
Introduction, Switching & logic levels, Digital Waveforms; Number Systems &
conversion of Number Systems; Boolean Algebra Theorems, De- Morgan’s Theorem;
Digital Circuits, Logic gates; Algebraic Simplification, NAND & NOR
Implementation;
LEARNING OUTCOME:
1. To understand the basic concepts of magnetic circuits, AC & DC circuits.
2. To explain the working principle, construction, applications of DC & AC machines and measuring
instruments.
3. To gain knowledge about the fundamentals of electric components, devices, transducers and
integrated circuits.
Learning Resources
Text Book 1. Srivastav, Verma, Singh and Singh, Basics of Electronics and
Electrical Engineering, 1st Edition, Nanoedge Publication,
2017.
2. Robert Boylestad, Louis Nashelsky, Electronic Devices and
Circuit Theory, prentice-hall, seventh addition, 2010.
3. Muthusubramanian.R, Salivahanan.S, Muraleedharan.K.A,
“Basic Electrical, Electronics andComputer Engineering”,
Tata McGraw - Hill, 1999.
Reference Book and other 1. Kothari D P and Nagrath I J , “Basic Electrical Engineering “,
materials Tata McGraw Hill,1991
2. Mithal G K , “Electronic Devices and Circuits”, Khanna
Publications,1997
3. Kothari D. P and Nagrath IJ, “Basic Electrical Engineering”,
Tata McGraw- Hill, 1991
L T P C
20CS 1006 DATA STRUCTURES AND ALGORITHMS 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
1. Understand analysis of algorithm and its time complexity
2. Be familiar with and implement the Linked list data structure
3. Be familiar with and implement the Stack and Queue data structure
4. Have a comprehensive knowledge of Trees and their implementations
5. Learn advanced data structures like Graphs and their implementation, hash tables and
Hashing methods
HOURS
UNIT-I 9
INTRODUCTION
Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important
Problem Types
– Fundamentals of the Analysis of Algorithmic Efficiency. Introduction, Basic
terminology, Data structures, Data structure operations, ADT, Algorithms:
Complexity, Time, Space trade off, Mathematical notations and functions, Asymptotic
notations, Linear and Binary search, Bubble sort, Insertion sort
UNIT-II ARRAYS AND LIST 9
Array implementation of List, Traversing, Insertion, Deletion, Application of List,

Polynomial Arithmetic, Linked list, Implementation, Insertion, Deletion and Search,
Sparse Matrix, Circular Linked List, Applications, Josephus Problem, Double linked
list, Cursor based implementation.
UNIT-III STACK AND QUEUE 9

STACK: Array implementation, Linked list implementation, Applications of stack:
Infix to Postfix, Evaluation of Postfix, Balancing symbols, Nested function calls,
Recursion, Towers of Hanoi.
QUEUE: Array implementation, Linked List implementation, Circular Queue,
Applications of queue: Priority queue, Double ended queue.
UNIT-IV TREES 9
General trees, Terminology, Representation of trees, Tree traversal- Binary tree,

Representation, Expression tree, Binary tree traversal, Threaded Binary Tree, Binary
Search Tree: Construction, Searching, Insertion, Deletion, AVL trees: Rotation,
Insertion, Deletion, B-Trees, Splay trees, Red-Black Trees.
UNIT-V GRAPHS 9
Graph Terminology, Graph Traversal, Topological sorting, Minimum spanning tree,

Prims, Kruskals, Network flow problem, Bi-connected components, Hashing, Hash
functions, Collision avoidance, Separate chaining, Open addressing, Linear probing,
Quadratic Probing, Rehashing, Extensible Hashing
LEARNING OUTCOME:
1. On completion of this course, the students will be able to:-
1. To introduce the concepts of linear data structures
2. 2.To learn about non-linear data structures, sorting
3. 3.To introduce the concepts of balanced search tress, indexing and
4. To understand the graph structures
5. To get exposure to the various algorithm design and analysis techniques.
Learning Resources
Reference Book and other 1. Seymour Lipschutz, “Data Structures with C”, McGraw Hill
materials Education, Special Indian Edition, 2014.
2.Mark Allen Weiss, "Data Structures and Algorithm Analysis in
C", 2nd Edition, Pearson Education, 2011.
Reference Books
1.A.V.Aho, J.E Hopcroft and J.D.Ullman, “Data structures and
Algorithms”, Pearson Education, First Edition Reprint 2003.
2.R.F.Gilberg, B.A.Forouzan, “Data Structures”, Second Edition,

Thomson India Edition, 2005.
3.ReemaThareja, “Data Structures Using C”, Oxford Higher
Education , First Edition, 2011.
L T P C
20PD 0102 PERSONALITY DEVELOPMENT – II 1 0 0 1
COURSE OBJECTIVE:-
This course is to build confidence and inculcate various soft skills and to help Students to identify
and achieve their personal potential.

HOURS
UNIT-I Resume & Cover Letter Writing Skills 3
UNIT-II Effective Communication Skills – Presentation Skills 3
UNIT-III Public Speaking-Time Management-Interview Skills 3

UNIT-IV Mock Interviews-Group Discussion-Debate 3
UNIT-V Body Language-Non Verbal Activities-Role Plays 3
LEARNING OUTCOME:
1. The importance of public speaking and written communication
2. Develop skills of effective speaking via Debate, GD, etc.
L T P C
Course Code: 20PH 0103 Subject Name: PHYSICS LABORATORY 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
To develop scientific temper and analytical capability among the engineering students.
LIST OF EXPERIMENTS
Experiment 1: To determine the dispersive power of a given prism
Experiment 2: To determine the width of single slit by diffraction
Experiment 3: To determine the wavelength of the given laser source using standard grating
Experiment 4: To determine Planck’s Constant (h)
Experiment 5: To determine the attenuation, numerical aperture and acceptance angle of the
given optical fiber
Experiment 6: To determine the wavelength of sodium light by Michelson Interferometer

Experiment
Experiment 7: To determine the velocity of ultrasonic waves in liquids
Experiment 8: To determine the wavelength of sodium light by Newton’s ring experiment
Experiment 9: To determine the moment of inertia of the disc and rigidity modulus of the wire by
torsional pendulum
Experiment10: Ballistic Galvanometer
LEARNING OUTCOME:
1. Understand scientific concepts in measurement of different physical variables
2. Develop the skill in arranging and handling different measuring instruments and
3. Get familiarized with the errors in various measurements and planning / suggesting how these
contributions may be made of the same order so as to make the error in the final result small.
Learning Resources
Reference Book and other 1. Chattopadhyay, D., Rakshit, P. C and Saha, B., “An advanced
materials Course in Practical Physics”, 2nd edition, Books & Allied Ltd,
Calcutta, 1990.
2. Chauhan and Singh , “ Advanced practical physics”, Revised
edition, Pragati Prakashan Meerut, 1985.
3. Thiruvadigal. J. D., Ponnusamy S. Vasuhi, P. S. and Kumar.
C, “Hand Book of Practical physics”, 5th edition, Vibrant
Publication, Chennai, 2007.
L T P C
Course Code: 20CY 0103 Subject Name: CHEMISTRY LABORATORY 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
An integrated laboratory course consists of experiments from applied chemistry and is designed to
illustrate the underlying principles of measurement techniques, synthesis, dynamics and chemical
transformation.
LIST OF EXPERIMENTS
1. Preparation of standard solutions.
2. Estimation of total hardness, permanent and temporary hardness by EDTA method.
3. Conductometric titration – determination of strength of an acid.
4. Estimation of iron by potentiometer – titration.
5. Determination of molecular weight of polymer by viscosity average – method.
6. Determination of dissolved oxygen in a water sample by Winkler”s method
7. Estimation of Copper.
8. Estimation of nickel in steel.
9. Determination of total alkalinity and acidity of a water sample.
10. Chromatography Technique: Paper Chromatography.
LEARNING OUTCOME:
1. Understand the basic concept and its applications.
Learning Resources
Reference Book and other 1. Chemistry: Department Manual
materials
L T P C
20CS1116 DATA STRUCTURES LAB 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
1. This laboratory course gives a thorough understanding of the concepts of various Data
Structures and its applications. It also gives a comprehensive understanding of the various
algorithms for problems given
LIST OF PROGRAMS
1. Write a program to search an element in a link list.

2. Write a program to maintain a link list.
3. Write a program of link list implementation of a stack.
4. Write a program of array implementation of a stack.
5. Write a program of link list implementation of a queue.
6. Write a program of array implementation of a queue.
7. Write a program to implement BST
8. Write a program to perform binary search in an array.
9. Write a program to perform binary search using recursion.
10. Write a program to perform linear search in 2D array.
11. Write a program to implement bubble sort.
12. Write a program to implement insertion sort.
13. Write a program to implement selection sort.
Course Learning Outcomes (CLOs):-

1. Implementing Stack, Queue , Linked List , Binary tree
2. Sorting and Searching Techniques
3. Divide and Conquer, Dynamic Programming methods
4. Greedy method , Traversals and Backtracking
Learning Resources
Reference Book and other 1. Laboratory Manual
materials
L T P C
Course Code: 20ME 0130 Subject Name: ENGINEERING GRAPHICS 1 0 2 2
Co-requisite:
COURSE OBJECTIVE:-
The objective of this course is to provide the basic knowledge about Engineering Drawing. Detailed
concepts are given in projections, technical drawing, dimensioning and specifications, so useful for
a student in preparing for an engineering career.
HOURS
UNIT-I FUNDAMENTALS OF ENGINEERING GRAPHICS 2
Introduction to Engineering Drawing covering, Principles of Engineering Graphics and
their significance, usage of Drawing instruments, lettering, Conic sections including
the Rectangular Hyperbola (General method only); Cycloid, Epicycloid, Hypocycloid
and Involute; Scales – Plain, Diagonal and Vernier Scales.
UNIT-II PROJECTION OF POINTS, LINES AND PLANES 4
Orthographic Projections covering, Principles of Orthographic Projections
Conventions - Projections of Points and lines inclined to both planes; Projections of
planes inclined Planes - Auxiliary Planes.
UNIT-III PROJECTION OF SOLIDS 3
Projections of Regular Solids covering, those inclined to both the Planes- Auxiliary
Views.
UNIT-IV SECTIONS AND DEVELOPMENTS 4
Sections and Sectional Views of Right Angular Solids covering, Prism, Cylinder,
Pyramid, Cone – Auxiliary Views; Development of surfaces of Right Regular Solids -
Prism, Pyramid, Cylinder and Cone.
UNIT-V PICTORIAL PROJECTIONS 2
Isometric Projections covering, Principles of Isometric projection – Isometric Scale,
Isometric Views, Conventions; Isometric Views of lines, Planes, Simple and
compound Solids; Conversion of Isometric Views to Orthographic Views and Vice-
versa.
LEARNING OUTCOME:
1. Basic knowledge of construction of geometrical figures.
2. Dimension and annotate two-dimensional engineering drawings.
3. The projection of 1D, 2D and 3D elements.
4. Sectioning of solids and development of surfaces.
5. Sketch two-dimensional orthographic drawings and three-dimensional isometric views.
Learning Resources
Text Book 1. Venugopal, K. and Prabhu Raja, V., Engineering Graphics,
Eighth Edition (Revised), New Age International Publishers,
Chennai, 2007.
2. Natarajan, K.V., A Text Book of Engineering Graphics, 21st
Edition, Dhanalakshmi Publishers, Chennai, 2007
3. Jeyapoovan, T., Engineering Drawing and Graphics using
AutoCAD 2000, Vikas Publishing House Pvt. Ltd., New Delhi,
2005.
Reference Book and other 1. Bhatt, N.D., Elementary Engineering Drawing (First Angle
materials Projection), Charotar Publishing Co., Anand, 1999.
2. Narayanan, K. L. and Kannaiah, P., Engineering Graphics,
Scitech Publications, Chennai, 1999.
3. Shah, M. B. and Rana, B. C., Engineering Drawing, Pearson
Education (Singapore) Pvt. Ltd., New Delhi , 2005.
SEMESTER – III
L T P C
Course Code: 20MA0310 Subject Name: TRANSFORMS AND BOUNDARY VALUE 3 1 0 4
PROBLEMS
Co-requisite:
COURSE OBJECTIVE:-
1. To impart knowledge about the subject of integral transformation with its application.
2. The focus of the course will be the study of certain structures called Fourier Series, Fourier
Transform, Z Transform, Hankel Transform and Boundary Value Problems.
3. An understanding of Integral Transformation and Applications to solve real world problems.
HOURS
UNIT-I FOURIER SERIES 9
Introduction of Fourier series -Dirichlet’s conditions for existence of Fourier series.
Fourier series –related problems in (0, 2π), (− π, π) and (0,2l). Fourier series –related
problems in (− l, l). Half Range Cosine series-related problems. Half Range sine series-
related problems. Parseval’s Identity (without proof)-related problems. Harmonic
Analysis for finding fundamental harmonic, second and third harmonic. Harmonic
Analysis for finding fundamental harmonic, second and third harmonic.
UNIT-II FOURIER TRANSFORM 9
Fourier Transform: Fourier Transforms- Elementary properties of Fourier transforms.
Fourier Transforms and related problems- Fast Fourier Transform. Fourier Sine
Transforms and their properties-problems. Fourier Cosine Transforms and their
properties-problems. Convolution Theorem (without proof)-applications. Parseval’s
Identity (without proof)-applications.
UNIT-III Z – TRANSFORMS 9
Z Transforms: Definition and properties of Z- Transforms, Inverse Z- Transforms, and
Application of Z- Transforms to difference equations.
UNIT-IV HANKEL TRANSFORM 9
Elementary properties, Inversion theorem, transform of derivatives of functions,
transform of elementary functions, Parseval relation, relation between Fourier and
Hankel transform, use of Hankel Transform in the solution of Partial differential
equations, Dual integral equations and mixed boundary value problems.
UNIT-V BOUNDARY VALUE PROBLEMS 9
Classification of partial differential equations. Method of separation of variables. One
dimensional Wave Equation and its possible solutions. Initial and Boundary value
Problems with zero velocity – related problems and Non-zero velocity- related
problems. One dimensional heat equation and its possible solutions. Steady state
conditions and zero boundary conditions related problems.
LEARNING OUTCOME:
1. Understand the need for a function or its approximation as an infinite series (Fourier Series)
to represent discontinuous
2. Function which occurs in signal processing and electrical circuits.
3. Demonstrate the use of Fourier Transform to connect the time domain and frequency domain.
4. Distinguish between an ordinary differential equation, forming and solving PDEs.
5. Demonstrate understanding of basic concepts in application of partial differential equations
in heat passing through rod, vibrating membrane, two dimensional heat conduction problems.
6. Demonstrate understanding Z-transform and analyzing discrete signals by using Z-transform.
Learning Resources
Reference Book and other 1. E. Kreyszig, Advanced Engineering Mathematics, Wiley-
materials India, 10th Edition, 2017.
2. Ian N. Sneddon, The use of Integral Transforms, Mc Graw Hill;
Second Printing edition,1982.
3. Ian N. Sneddon, Fourier Transforms, Dover Publications,
2010.
4. Loknath Debnath, Integral Transforms and their applications
,Chapman and Hall/CRC; 2 edition, 2014.
5. R.V. Churchill and J. Brown.: “Fourier Series and Boundary
Value Problems” McGraw-Hill Book Company 8th edition-
2017.
6. W. E. Boyce and R. C. DiPrima, “Elementary Differential
Equations and Boundary Value Problems”, John Wiley and
Sons.9-th Edition-2017
L T P C
20CS 2009 PYTHON USING OOP 3 0 0 3
Co-requisite:
COURSE OBJECTIVE:-
programming oriented topics required for Python programming.
HOURS
UNIT-I INTRODUCTION 9
Introduction, comparison between procedural programming paradigm and object-
oriented programming paradigm, basic concepts of object-oriented programming-
abstraction, encapsulation, data hiding
UNIT-II OBJECT & CLASS 9

concepts of an object and a class, interface and implementation of a class, operations
on objects, relationship among objects, specifying a class, creating class objects,
accessing class members, access specifiers, static members, use of const keyword,
friends of a class, empty classes, nested classes, local classes, abstract classes,
container classes, bit fields and classes, Need for constructors and destructors, copy
constructor, dynamic constructors, explicit constructors, destructors, constructors and
destructors with static members, initializer lists.
UNIT-III INHERITANCE 9
Introduction, Base Classes and Derived Classes, Protected Members, type of
inheritance, Using Member Functions, Overriding Base -Class Members in a Derived
Class, Using Constructors and Destructors in derived Classes, Concept of binding -
early binding and late binding, virtual functions, pure virtual functions, abstract
classes, virtual destructors
UNIT-IV POLYMORPHISM 9
Polymorphism: Overloading, Overriding, Abstract Classes, Operator Overloading:
Introduction, Fundamentals of Operator Overloading, Restrictions on Operators
Overloading, Operator Functions as Class Members vs. as Friend Functions,
UNIT-V OVERVIEW OF PYTHON 9

What is Python, Advantages and disadvantages, Downloading and installing, which
version of Python, Running Python Scripts, Using the interpreter interactively.
LEARNING OUTCOME:
1. Write, compile and debug programs in Python, use different data types, operators and I/O
function in a computer program.
2. Comprehend the concepts of classes, objects and apply basics of object oriented programming,
polymorphism and inheritance.
3. Demonstrate use of file handling.
4. Demonstrate use of templates and exception handling.
5. Demonstrate use of windows programming concepts using Python.
Learning Resources
Text Book 1. Object Oriented Programming in Turbo C++ by
Robert Lafore, 1994, The WAITE Group Press.
2. Programming with C++ By D Ravichandran,
2003, T.M.H
3. Object oriented Programming with C++ by E
Balagurusamy, 2001, Tata McGraw-Hill
Reference Book and other 1. C++ How to Program by H M Deitel and P J Deitel, 1998,
materials Prentice Hall
2. Computing Concepts with C++ Essentials by Horstmann,
2003, John Wiley,
3. The Complete Reference in C++ By Herbert Schildt, 2002,
TMH.
4. C++ Programming Fundamentals by Chuck Easttom,
Firewall Media
L T P C
Course Code: CS 2003 Subject Name: DISCRETE STRUCTURES 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
To provide knowledge of combinatorial problems, algebraic structures and graph theory required for
building mathematical foundation of computer science.
HOURS
UNIT-I MATHEMATICAL LOGIC 9
Propositions and Logical operators - Truth tables and propositions generated by a set -
Equivalence and Implication - Tautologies - Laws of logic - Proofs in Propositional
calculus - Direct proofs - Conditional conclusions - Indirect proofs - Propositions over
a universe - Mathematical Induction - The existential and universal quantifiers -
Predicate calculus including theory of inference.
UNIT-II SET THEORY 9

Laws of Set theory - Partition of a set - Minsets - The duality principle - Relations –
Graphs of relations - Hasse diagram - Matrices of relations - Closure operations on
relations - Warshall's algorithm - Functions - Combinatorics.
UNIT-III RECURRENCE RELATION & ALGEBRAIC SYSTEMS 9
Recurrence relations - Solving a recurrence relation - Recurrence relations obtained
from solutions - Generating functions - Solution of a recurrence relation using
generating functions - Closed form expression for generating function. Groups - Cyclic
groups and subgroups - Normal subgroups - Coding theory - Group codes.
UNIT-IV GRAPH THEORY 9
Graphs: Definition and terminology, Representation of graphs, Multigraphs, Bipartite
graphs, Planar graphs, Isomorphism and Homeomorphism of graphs, Euler and
Hamiltonian paths, Graph coloring .Basic concepts - Data structures for graphs -
Connectivity - Traversals graph optimization - The traveling salesman problem and
networks and the maximum flow problem - Trees - Spanning Trees - Rooted trees -
Binary Trees - Kruskal's algorithm - Traversals of Binary trees.
UNIT-V BOOLEAN ALGEBRA; POSETS; LATTICES 9
Boolean algebra – Duality, Boolean Functions, Simplification of Boolean Functions,
Canonical Form. Posets – Partially Ordered Set, Hasse Diagram, Elements in Posets,
Linearly ordered Set, Well ordered Set, Product order, Lexicographic Order,
Topological Sorting and Consistent Enumeration , Isomorphism. Lattices – Properties
of Lattices, Some Special Lattices, Product of lattices, Lattice Homomorphism.
Application of Boolean algebra to switching theory.
LEARNING OUTCOME:
1. Perform operations on various discrete structures such as set, function and relation.
2. Apply basic concepts of asymptotic notation in analysis of algorithm.
3. Illustrate the basic properties and algorithms of graphs and apply them in modeling and solving
real-world problems.
4. Comprehend formal logical arguments and translate statements from a natural language into its
symbolic structures in logic.
5. Identify and prove various properties of rings, fields and group.
Learning Resources
Reference Book and other 1. Alan Doerr and Kenneth Levasseur, "Applied Discrete
materials Structures for Computer Science",Galgotia Publications (P)
Ltd, 1992. (Unit I - Chapter 3 Section 3.1 - 3.8, Unit II -Chapter
2, Chapter 4 Section 4.2 - 4.5, Chapter 6 Section 6.1, 6.2, 6.4,
6.5, Chapter 7,Unit III - Chapter 8 Section 8.3, 8.4 Chapter 11
Section 11.25 Chapter 15 Section 15.1,15.2, 15.4 15.5, Unit IV
- Chapter 9, Section 9.1 - 9.5, Chapter 10 Section 10.1 -
10.5,Unit V - Chapter 13 Section 13.1 - 13.3, 13.7, Chapter 14
Section 14.2, 14.3)
2. Bondy J. A., Murty U. S. R., Graph Theroy, Springer, 2013.
3. Tremblay J. P. and Manohar R., "Discrete Mathematical
Structures with applications to Computer Science", Tata Mc
Graw Hill Publishing Co., 2000
4. V. Sundaresan, K.S. Ganapathy Subramanian and K. Ganesan,
Discrete Mathematics, New Revised Edition, A. R.
Publications, 2001
5. Kolman and Busby, "Discrete Mathematical Structures for
Computer Science", 1987
6. Kenneth H.Rosen, Discrete Mathematics and its Application,
Fifth edition, Tata McGraw-Hill Publishing company PVT
.Ltd., New Delhi, 2003
7. Seymour Lipschutz, Marc Lars Lipson, "Discrete
Mathematics", Mc Graw Hill Inc., 1992
8. Narsing Deo, Graph Theory with applications to Engineering
and Computer science, Prentice-Hall of India pvt. Ltd., New
Delhi, 1987
9. C.L. Liu, Elements of Discrete Mathematics, 2nd Edition,
McGraw Hill Publications, 1985.
10. Yadav S. K., Discrete Mathematics with Graph Theory, Ane
Books Pvt. Ltd., 2013. 1
11. Sharma J. K., Discrete Mathematics, Macmillan Publishers
India Limited, New Delhi – 110002, 2011.
12. Satyenarayana B., Prashad K. S., Discrete Mathematics and
Graph Theory, PHI Learning Private Limited, New Delhi,
2009.
13. Sarkar S. K., Discrete Mathematics, Sultan Chand
Publication, Delhi, 2012.
14. Bisht R.K. and Dhami H.S., Discrete Mathematics, Oxford
University Press, 2015.
L T P C
Course Code: CS 2005 Subject Name: DATABASE MANAGEMENT SYSTEMS 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
To study the concepts of Relational Database design and query languages

HOURS
DBMS, Structure Advantages & disadvantages, Models: -Data, Network, Hierarchical,
Relational Model, Levels of abstraction, Data Independence, Instances and schemes,
Data independence Application Programmers & Data Base administrators – their
function, Entity Relationship Model: Entities, Attributes and Entity Sets, Relation and
Relationships sets, mapping and participation constraints, Aggregation, Specialization
and Generalization.
UNIT-II E-R MODEL 9
Relational Model: Features, Integrity constraints over relations, Enforcing Data
Integrity, Integrity Constraints, Relational Data, Logical Data Base Design, E-R
diagram Symbols, Reduction of E-R Diagrams to relations, Keys. Relational Algebra
and Relational Calculus, Operations on Relational Algebra, Operations on Relational
Calculus.
UNIT-III NORMALIZATION 9
Database Design, Data Redundancy, Introduction to Schema Refinement, Functional
Dependencies, Normal Forms
UNIT-IV SQL 9
Structured Query Language: Basic SQL Queries, Nested Queries, Aggregate operator,
Null Values, implementation of Various Relational Algebra operations, Embedded
SQL
UNIT-V TRANSACTIONS & RECOVERY 9
Transaction management: ACID Properties, Transaction states, Concurrency control:
Concurrency Control –Overview, Concurrency control problems, Locks, Locking
Protocols, Deadlocks, Serializability, Recovery System: Types of Failures, Recovery
Techniques.
LEARNING OUTCOME:
1. Analyze the Information Systems as socio-technical systems, its need and advantages as compared
to traditional file based systems.
2. Comprehend architecture of DBMS, conceptual data modelling, logical database design and
physical database design.
3. Analyze Database design using E-R data model by identifying entities, attributes, relationships,
generalization and specialization along with relational algebra.
4. Apply and create Relational Database Design process with Normalization and Denormalization of
data.
5. Demonstrate use of SQL and PL/SQL to implementation database applications with usage of DDL
aspect of SQL, DML aspect of SQL, aggregate functions, group by clause, sub query, joins,
Learning Resources
Text Book 1. S.K. Singh, Database Systems: Concepts, Design and
Applications, Pearson Education India, 2009
2. Korth, Silberschatz, Database System Concepts, 4th Ed.,
TMH, 2000.
3. Date C. J., An Introduction to Database Systems , 7th Ed.,
Narosa Publishing, 2004
Reference Book and other 1. Elmasri Navathe, Fundamentals of Database Systems, 5th
materials Edition Pearson Education
2. Vipin.C.Desai , An introduction to Database System , West
Pub. Co
L T P C
Course Code: CS 2007 Subject Name: COMPUTER ARCHITECTURE & 3 1 0 4
ORGANIZATION
Co-requisite:
COURSE OBJECTIVE:-
The Objective of this course is to give a strong foundation of the computer organization and its
internal architecture.
HOURS
Evolution of Computer Systems-Computer Types-Functional units-Basic operational
concepts-Bus structures- location and addresses-memory operations- Addressing
modes-Design of a computer system- Memory Instruction and instruction sequencing,
RISC versus CISC.
UNIT-II CENTRAL PROCESSING UNIT 9
Introduction-Arithmetic Logic Unit - Fixed point arithmetic, floating point
arithmetic-Execution of complete instruction-Basic concepts of pipelining.
UNIT-III CONTROL UNIT DESIGN 9
Introduction-Control Transfer-Fetch cycle- Instruction Interpretation & Execution,
Hardwired control- Microprogrammed control
UNIT-IV MEMORIES AND SUBSYSTEMS 9
Semiconductor memory - Static and Dynamic -Associative memory- Cache memory-
Virtual memory-Secondary memories-Optical magnetic tape & magnetic disks &
controllers.
UNIT-V I/O PROCESSING 9
Introduction-Data transfer techniques- Bus Interface- I/O Channel-I/O Processor, I/O
devices -Direct memory access.
LEARNING OUTCOME:
1. Illustrate various elementary concepts of computer architecture including, syntax of register
transfer language, micro operations, instruction cycle, and control unit.
2. Describe the design of basic computer with instruction formats & addressing modes.
3. Explore various memory management techniques and algorithms for performing addition,
subtraction and division etc.
4. Interpret the concepts of pipelining, multiprocessors, and inter processor communication.
Learning Resources
Text Book 1. Carl Hamacher,”Computer Organization”,Fifth
Edition,McGrawHill International Edition, 2002
Reference Book and other 1. P.Pal Chaudhuri, "Computer Organization and Design" , 2nd
materials Edition, PHI ‘ 2003
2. William Stallings, “Computer Organization and Architecture
– Designing for Performance”, PHI, 2004.
3. John P.Hayes, "Computer Architecture and Organization",
III Edition, McGraw Hill International Editions, 1998.
L T P C
Course Code: CBD 2003 Subject Name: PYTHON PROGRAMMING 2 0 0 2
Co-requisite:
COURSE OBJECTIVE:-
Data, which is available in abundance and in accessible forms, if analyzed in an efficient manner
unfolds many patterns and promising solutions. Data has to be pre-processed, converted to required
format and fed to appropriately chosen algorithm to yield better results. This course aims at applying
such techniques to raw data, using Python, to arrive at meaningful results
HOURS
UNIT-I OVERVIEW OF PYTHON 8
What is Python, Advantages and disadvantages, Downloading and installing, which

version of Python, Running Python Scripts, Using the interpreter interactively.
UNIT-II INTRODUCTION TO PYTHON 9
Using variables, String types: normal, raw and Unicode, String operators and
expressions, Math operators and expressions, Writing to the screen, Reading from the
keyboard, Indenting is significant, The if and elif statements, While Loops, Using List,
Dictionaries, Using the for statement, Opening, reading and writing a text file, Using
Pandas, the python data analysis library and data frames, Grouping, aggregating and
applying, merging and joining, Dealing with syntax errors, Exceptions, Handling
exceptions with try/except.
UNIT-III DATA HANDLING 6
RE Pattern Matching, Parsing Data, Introduction to Regression, Types of Regression.
UNIT-IV USE CASES 8
Use Cases, Exploratory data analysis, Correlation Matrix, Visualization using
Metplotlib, Implementing linear regression.
UNIT-V ADVANCE CONCEPTS 9
Machine Learning – Algorithm, Algorithms – Random forest, Super vector Machine,
Random Forest, Build your own model in python, Comparison between random forest
and decision tree.
LEARNING OUTCOME:
1. Understand the basic concepts of Python
2. Learn how to write functions and pass arguments in Python
3. Design object‐oriented programs with Python classes.
4. Define the structure and components of a Python program.
Learning Resources
Reference Book and other 1. IBM Books/Manual
materials
L T P C
Course Code: 20 PD 0201 Subject Name: PERSONALITY DEVELOPMENT - III 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
The objective of this course is to build confidence and inculcate various soft skills and to help
Students to identify and achieve their personal potential

HOURS
UNIT-I Goal Setting - Problem Solving - Emotional Quotient 6
UNIT-II Stress Management – Sign of Stress – Ways to cope up with stress 6
UNIT-III Lateral Thinking (Situational) - Team Work (Role Plays) 6

UNIT-IV Time Management – Smart Work - Prioritize your work 6
UNIT-V Leadership Skills – Roles & Responsibilities – Decision Making 6
LEARNING OUTCOME:
1. Apply the conceptual understanding of Personality Development topics in day-to-day life.
2. Develop confidence and make use of techniques for self-analysis & development.
3. Understand the importance of teamwork, stress & time management and apply it in life.
Learning Resources
materials
L T P C
Course Code: CS 2111 Subject Name: DBMS LAB 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
This laboratory course gives a thorough understanding of the concepts of database design model and
its applications. It also gives a comprehensive understanding of using a query language.
LIST OF PROGRAMS
1. Data Definition Language (DDL) commands in RDBMS

2. Data Manipulation Language (DML)
3. Data Control Language (DCL)
4. High level language extensions with cursors
5. High level language extension with Triggers
6. Procedures and Functions
7. Embedded SQL
8. Database design using E-R model and Normalization
9. Design and implementation of system
10. Automatic Backup of Files and Recovery of Files
LEARNING OUTCOME:
1. Designing a database
2. Using DDL and DML commands
3. Backing up of files
Learning Resources
materials
L T P C
CS 2115 PROGRAMMING USING MATLAB 1 0 2 2
Co-requisite:
COURSE OBJECTIVE:-
To learn and Practice the basics of MATLAB
LIST OF PROGRAMS
Programs based on MATLAB.
LEARNING OUTCOME:
1. Become familiar with fundamental operations in MATLAB

2. Perform statistical data analysis, data interpolation by MATLAB , solve differentiation
equation with MATLAB
3. Acquire a reasonable level of competence in designing optimization algorithms, solve linear
programming, constrained and unconstrained optimization problems by MATLAB
4. Apply MATLAB to solve practical engineering problems Master used skills in MATLAB
5. programming, code debugging
Learning Resources
materials
L T P C
20CS 2117 PYTHON USING OOP LAB 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
programming oriented topics required for Python Programming.
PROGRAMS
Programs based on Python Programming.
LEARNING OUTCOME:
1. The working of OOPS programming approach.
2. The knowledge of object oriented programming style.
3. The basic concepts involved in computer programming.
4. Important programming aspects i.e object, class, inheritance and polymorphism.
5. Knowledge with respect to the software development phase of OOPS.
Learning Resources
materials
SEMESTER – IV
L T P C
CS 2002 MICROPROCESSOR & INTERFACING 3 0 0 3
Co-requisite:
COURSE OBJECTIVE:-
The objective of this course is to impart knowledge of microprocessor architecture and programming,
interfacing and coprocessors which gives foundation to advanced microprocessor architecture and
programming.
HOURS
UNIT-I INTEL 8085 ARCHITECTURE 9
Evolution and introduction to microprocessor, origin of microprocessor, classifications,
types of memory, input and output devices, Introduction to 8085 - 8085 architecture,
pin diagram and interrupts and its types.
UNIT-II INSTRUCTION SET & ASSEMBLY LANGUAGE PROGRAMMING WITH 9

8085
Classification of Instruction Set of 8085, sample programmes, method of data transfer
modes, memory mapped and I/O mapped data transfer, programmed data transfer, direct
memory access, parallel data transfer, serial data transfer & Assembler Directives-
Assembly Language Programming with 8085.
UNIT-III INTEL 8086 ARCHITECTURE 9

Introduction to 8086, 8086 architecture-EU, BIU, maximum and minimum modes, pin
diagrams & functioning, interrupts.
UNIT-IV INSTRUCTION SET & ASSEMBLY LANGUAGE PROGRAMMING WITH 9

8086
Instruction sets, addressing modes, instruction format and sample programs, data
transfer & Assembler Directives- Assembly Language Programming with 8085, Basic
Peripherals &their interfacing with 8086-Semiconductor Memory Interfacing.
UNIT-V PERIPHERAL INTERFACES 9

Dynamic RAM Interfacing-Interfacing I/O Ports-PIO 8255-Modes of Operation-
Interfacing Analog to Digital Data Converters-Stepper Motor Interfacing, Timer-
8253Programmable Interrupt Controller 8259A-DMA Controller 8257-DMA Transfers
& Operations-Programmable, DMA Interface 8237
LEARNING OUTCOME:
1. Architecture of 8086 & 8088 microprocessors
2. Instruction sets of 8086/88 and programming.
3. Math Coprocessor & I/O processor and multiprocessor configuration
4. Interfacing of microprocessor with various peripheral devices
Learning Resources
Reference Book and other Text Book
materials 1. Ray A K, K M Bhurchandi, “Advanced Microprocessor &
Peripherals”, Tata McGraw Hill,1st
Edition,2000.(CH1,CH2,CH3,CH4,CH5,CH6,CH7,CH8,CH16.)
Reference Books
1. Douglas V Hall, “Microprocessor & Interfacing”, Tata McGraw
Hill, 2nd Edition,1999.
2. Rafiquzzuman M, “Microprocessor theory & Applications”,
Prentice Hall of India,1994.
3. Yuchenhiu, Glenn A Gibson, “Microprocessor
Systems - 8086/8088 Family”, Prentice Hall of
India, 2nd Edition, 1986.
L T P C
Course Code: CS 2004 Subject Name: THEORY OF COMPUTATION 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
The objective of this course is to impart concepts of Theory of Computation
HOURS
UNIT-I 10
BASIC COMPUTATIONAL CONSTRUCTS
Finite State Systems, Basic Definitions Non-Deterministic finite automata (NDFA),
Deterministic finite automata (DFA), Equivalence of DFA and NDFA Finite automata
with E-moves, minimization of finite Automata, Concept of basic Machine, Properties
and limitations of FSM, Moore and Mealy Machines, Equivalence of Moore and Mealy
machines.
UNIT-II REGULAR EXPRESSIONS 10
Regular grammars, regular expressions, equivalence between regular languages,
properties of regular languages, Regular Expressions, Equivalence of finite automata
and Regular Expressions, Regular expression conversion and vice versa. Conversion
of NFA to DFA by Arden’s Method, pumping lemma.
UNIT-III GRAMMAR 9
Context Free Languages – Leftmost and rightmost derivation, parsing and ambiguity,
ambiguity in grammar and languages, normal forms
UNIT-IV PUSHDOWN AUTOMATA 8
Pushdown Automata – Introduction to Pushdown Machines, Applications of
Pushdown Machines NDPDA, DPDA, context free languages and PDA, comparison
of deterministic and non-deterministic versions, closure properties, pumping lemma
for CFL.
UNIT-V TURING MACHINES 8
Turing Machines, variations, Chomsky Hierarchy, LR(k) Grammars, properties of
LR(k) grammars, Decidability and Recursively Enumerable Languages, Halting
problem of T.M., Post’s Correspondence Problem, Introduction to NP-Hardness and
NP-Completeness.
LEARNING OUTCOME:
1. Comprehend regular languages and finite automata and develop ability to provide the
equivalence between regular expressions, NFAs, and DFAs.
2. Disambiguate context-free grammars by mastering the concepts of context‐ free
languages and push‐ down automata.
3. Apply the concepts of recursive and recursively enumerable languages and design
efficient Turing Machines.
4. Solve analytical problems in related areas of theory in computer science
Learning Resources
Text Book 1. E. Hopcroft and J. D. Ullman, “Introduction to Automata
Theory, Languages and Computation”, Pearson,
Education Publishers, 2nd Edition, 2004
Reference Book and other 1. Michael Sipser, “Introduction to the Theory of
materials Computation”, Thomson Asia, 2004
2. J.C.Martin, “Introduction to Languages and Theory of
Computation”, McGraw Hill,2003
3. K.L.P. Mishra, N.Chandrasekaran , “ Theoretical
Computer Science “, PHI, 3rd Edition, 2007
L T P C
Course Code: CS 2006 Subject Name: OPERATING SYSTEMS 3 0 0 3
Co-requisite:
COURSE OBJECTIVE:-
Every computer professional should have a basic understanding of how an operating system controls the
computing resources and provide services to the users. This course provides an introduction to the
operating system functions, design and implementation. It serves as strong foundation for other courses
like networks, compiler design, data base systems.

HOURS
Operating system overview-objectives and functions, Concept of Multitasking,
multiprogramming, multi user, Multithreading etc, Types of Operating Systems;
Various Operating system services, architecture, System programs and calls
UNIT-II PROCESSES & SCHEDULING 9
Process concept, process scheduling, operation on processes; CPU scheduling,
scheduling criteria, scheduling algorithms.
UNIT-III CONCURRENCY 9
Principles of concurrency - mutual exclusion, semaphores, monitors, Readers/Writers
problem; Deadlocks – prevention- avoidance – detection
UNIT-IV MEMORY 9
Logical & Physical Address Space, swapping, contiguous memory allocation, non-
contiguous memory allocation paging and segmentation techniques, segmentation with
paging; virtual memory management - Demand Paging & Page-Replacement
Algorithms; Demand Segmentation.
UNIT-V INPUT/OUTPUT AND FILE SYSTEMS 9
I/O management and disk scheduling – I/O devices, organization of I/O functions;
OS design issues, I/O buffering, disk scheduling, Disk cache, File management –
organization, directories, file sharing, record blocking, secondary storage
management.
LEARNING OUTCOME:
1. Explain basic operating system concepts such as overall architecture, interrupts, APIs,
user mode and kernel mode.
2. Distinguish concepts related to concurrency including, synchronization primitives,
race conditions, critical sections and multi-threading.
3. Analyze and apply CPU scheduling algorithms, deadlock detection and prevention
algorithms.
4. Examine and categorise various memory management techniques like caching,
paging, segmentation, virtual memory, and thrashing.
5. Appraise high-level operating systems concepts such as file systems, security,
protection, virtualization and device-management, disk-scheduling algorithms and
various file systems.
Learning Resources
Text Book 1. William Stallings, “Operating Systems – internals and
design principles”, Prentice Hall India, 5th Edition, 2005.
2. Silberschatz, Peter Galvin, “Operating System
Concepts”, AWL 6th Edition, 2002,
Reference Book and other 1. Andrew S. Tannenbaum & Albert S. Woodhull,
materials “Operating System Design and Implementation”,
Prentice Hall India, 2nd Edition, 1998.
2. Gary Nutt, “Operating System - A Modern
Perspective”, Pearson Education Asia, 2nd Edition
2000. Harvey .M. Deitel, “Operating Systems”, 2nd
Edition , 2000.
3. Ida M. Flynn, Ann Mclver McHoes, “Understanding
Operating Systems”, 3rd Edition,Thomson Learning
2001s
L T P C
Course Code: CS 2008 Subject Name: ANALYSIS AND DESIGN OF ALGORITHMS 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
This course will provide an understanding of how to write algorithms for various problems
and do an analysis of the same
HOURS
UNIT-I ANALYSIS OF ALGORITHM 9
Introduction - Algorithms – Pseudo code for algorithms – present – future.
Mathematics for Algorithms – Definitions – Notation and Basic results – Asymptotic
Notation- Mathematical Induction– Analysis of Algorithms.
UNIT-II DIVIDE AND CONQUER METHOD 9
General Method - Binary Search – Finding Maximum and Minimum – Merge Sort –
Quick Sort GreedyMethod – General Method – KnapSack Problem – Minimum
Spanning Tree Algorithm – Single Source Shortest Path Algorithm.
UNIT-III DYNAMIC PROGRAMMING 9
General Method–Multistage Graph – All Pairs Shortest Path Algorithm – 0/1
Knapsack Problem – Traveling Salesman Problem - Basic search techniques and
traversal techniques –bi-connected components – Depth First Search – Breadth First
Search.
UNIT-IV BACKTRACKING 9
The General Method – 8-Queens Problem- Sum of Subsets – Graph Coloring-
Hamiltonian Cycle-Knapsack Problem – Branch and Bound Method – 0/1 Knapsack
Problem – Traveling Salesman Problem
UNIT-V P and NP 9
Polynomial time – Nondeterministic Algorithms and NP – Reducibility and NP
completeness – NO complete Problems – More on NP completeness. Case studies
LEARNING OUTCOME:
1. Implement the different tree structures algorithm and analyze in context of asymptotic
notation.
2. Identify basic properties of graphs and apply their algorithms to solve real life problems.
3. Demonstrate the usage of algorithms under several categories like string matching,
randomized algorithms and genetic algorithms.
4. Implement various advanced data structures using C/Java/Python or related languages.
Learning Resources
Text Book 1. E.Horowitz , Sahni & Sanguthevar Rajasekaran, “Fundamentals of Computer
Algorithms”, Galgotia Publications,1997
2. Richard Johnsonbaugh , Marcus Schaefer , “ Algorithms “ , Pearson Education, 2006 3rd
edition (chapter 1,2,10)
Reference 1. Aho, Ullman & Hopcraft, “The Design and Analysis of Algorithms”, Pearson Education,
Book and 2001
other materials
2. S.E.Goodman , S.T.Hedetniemi , “Introduction to the Design and Analysis of
Algorithms”, McGraw Hill , 2002
3. Sara Baase , “Computer Algorithms - Introduction to design and analysis”, Pearson
Education, 1998
L T P C
CS2010 JAVA PROGRAMMING 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
To understand concepts of Java, event driven, and concurrent programming paradigms and
develop skills in using these paradigms using Java.
HOURS
Introduction to Java Language, the Evolution of Java, Object-Oriented Programming
Concepts and Java, Differences between C++ and Java, the Primary Characteristics of
Java, the Architecture, Programming with Java, Tokens, Expressions, Using Data
Types, Declarations, Control Flow, Looks
UNIT-II CLASSES, PACKAGES AND INTERFACES 9

Introduction, Classes, Working with Objects, Constructor, De-constructor, Packages,
Abstract Classes, Interfaces Java Streams, Input Streams, Output Streams, Inheritance
& Polymorphism
UNIT-III THREAD 9
Introduction, Exception Methods, Try-catch block, Threads, Creating Threads, Life
Cycle of a Thread, Thread Methods, Using Threads, Multi-Threading, Synchronization
of Threads
UNIT-IV 9
APPLETS & AWT
Introduction of Applet, Examples, Applet's Life Cycle, Methods for Adding UI
Components, Methods for Drawing and Event Handling, AWT- Introduction, Control
Classes, layout manager, different layout, Event handling
UNIT-V JDBC 9
Java Database Connectivity, JDBC Product, Types of Drivers, Two-Tier Client/Server
Model, Three-Tier Client/Server Model, Basic Steps of JDBC, Creating and
Executing SQL Statement, The Result Set Object, Working with Database Metadata,
Connection Pool.
LEARNING OUTCOME:
1. Demonstrate proficient use of a text editor to independently create, store, and edit Java
source programs (applications and applets) from instructor supplied specifications,
which illustrate comprehension of object oriented programming concepts.
2. Compile Java source programs and to debug the source program using compiler
generated error/warning messages so that no errors or warnings are generated.
3. Include in their Java source program, clear, concise, internal documentation, in the
form of commentary statements.
4. Write a Java program and correct all logic errors to achieve the correct/desired output
illustrating.
Learning Resources
Reference Book and other 1. TextBooks:
materials 1. Java: The Complete Reference, Ninth
Edition Paperback by Herbert Schildt
2. The Java Handbook, by Patrick Naughton, Michael
Morrison
L T P C
Course Code: 20 PD 0202 Subject Name: PERSONALITY DEVELOPMENT – IV 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
The objective of this course is to make the student understand the importance various corporate etiquettes,
written and oral communication skills and to build self-awareness and self-development.

HOURS
UNIT-I Etiquettes – Professional Etiquette, Meeting Etiquette, Technology Etiquette 6
(Phone & Email), Dressing Etiquette
UNIT-II Resume – Types of Resume, Basic Resume writing skills 6
UNIT-III Ethics – Ethical Values, Importance of Work Ethics 6
UNIT-IV Extempore (JAM), Current affairs – I 6
UNIT-V Letter Writing – Business Letters, Application letters, Covering letters, etc. 6
LEARNING OUTCOME:
1. Implementation of etiquettes in organization and society at large
2. Importance of ethics in life as well as career
3. Importance of written communication in organization
L T P C
CS2112 MICROPROCESSOR LAB 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
This Lab Course will enable the students to implement the small logic at assembly
language level.
LIST OF PROGRAMS
1. Study of Peripherals & interfacing.
8085 Experiments:
1. 8-bit Addition, Multiplication & Division.
2. 16-bit Addition, Multiplication &Division. Counters and Time delay
3. BCD to Hexadecimal & vice-versa. Traffic light control.
4. Stepper motor control.
8086 Experiments:
1. Basic arithmetic & Logical operations.
2. Sorting & searching algorithms.
3. Data transfer instructions.
4. RAM size & system date.
5. Digital clock
6. Key board & printer status.
7. Password checking.
8. Serial interface & parallel interface
9. Trouble shooting.
LEARNING OUTCOME:
1. To do any kind of operations (8 bit addition, subtraction, Multiplication and

division) with 8085 microprocessor To implement interfacing of 8086 with
various peripheral devices
Learning Resources
Reference Book and other 1. Books/Manual
materials
L T P C
Course Code: CS 2114 Subject Name: OPERATING SYSTEMS LAB 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
This laboratory course gives a complete understanding of the operating systems principles
and its implementations
LIST OF PROGRAMS
1. Write a program to implement CPU scheduling for first come first serve.
2. Write a program to implement CPU scheduling for shortest job first.
3. Write a program to perform priority scheduling.
4. Write a program to implement CPU scheduling for Round Robin.
5. Write a program for page replacement policy using a LRU
6. Write a program for page replacement policy using FIFO
7. Write a program for page replacement policy using Optimal.
8. Write a program to implement first fit, best fit and worst fit algorithm for Memory
management.
9. Write a program to implement reader/writer problem using semaphore.
10. Write a program to implement Banker’s algorithm for deadlock avoidance.
LEARNING OUTCOME:
1. Implement Scheduling algorithms
2. Implement Deadlock algorithms and page replacement algorithms
3. Implement Memory management schemes, Thread and synchronization
Learning Resources
materials
L T P C
CS2116 JAVA PROGRAMMING LAB 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
This laboratory course gives a complete understanding of the Java programming principles
and its implementations
LIST OF PROGRAMS
JAVA BASICS
1. Programs illustrating various data types in Java
2. Programs illustrating class, objects and methods
3. Programs for addition and multiplication of Matrices
4. Programs illustrating Overloading in Java
5. Programs illustrating the implementation of Various forms of Inheritance (Single,
Hierarchical, Multilevel )
6. Programs illustrating Overriding methods in Java
7. Programs illustrating Exception Handling
8. Programs to manipulate strings
9. Programs illustrating Interfaces in Java
10. Programs to create Packages in Java
11. Programs illustrating Threads in Java
12. Programs to write applets to draw the various shapes
13. Programs to manipulate labels, lists, text fields and panels
14. Programs to handle mouse events
15. Programs using layout mangers
LEARNING OUTCOME:
1. To learn & practice the Object Oriented concepts like Inheritance, Overloading etc.
2. To learn & practice Interfaces and Packages
3. To learn &practice Java applet programming
Learning Resources
materials
L T P C
Course Code: CS 2118 Subject Name: ADA LAB 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
To study a variety of useful algorithms and analyse their complexity; by that experience to gain
insight into principles and data-structures useful in algorithm design.
PROGRAMS
Programs based on
1. Methods for expressing and comparing complexity of algorithms: worst and average cases
2. Lower bounds on algorithm classes, verification of correctness.
3. Application of such analysis to variety of specific algorithms: searching, merging, sorting (including
quick and heap internal and Fibonacci external sorts); graph problems including connected
components, shortest path, minimum spanning tree and bi-connected components); language
problems (including string matching and parsing).
4. Consideration of a number of hard problems: knapsack, satisfiability, traveling salesman problems.
5. Development of NP-complete classification and its consequence.
6. Approximation algorithms.
LEARNING OUTCOME:
1. Contribute to a rapidly changing field by acquiring a thorough grounding in the core principles
and foundations of computer science (e.g., techniques of program design, creation, and testing;
key aspects of computer hardware; algorithmic principles).
2. Acquire a deeper understanding on (elective) topics of more specialized interest, and be able to
critically review, assess, and communicate current developments in the field.
3. Prepare for the next step in their careers, for example, by having done a research project (for
those headed to graduate school), a programming project (for those going into the software
industry), or some sort of business plan (for those going into startups).
SEMESTER - V
L T P C
Course Code: CS 3001 Subject Name: COMPILER DESIGN 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
To learn the Design aspects of a Compiler, and study other system software tools

HOURS
UNIT-I ASSEMBLER, MACRO, LOADER & LINKER 9
Assembler: Overview of the assembly process - Design of two pass assembler-
Single pass assembler - Macros: Macro definition and usage- schematics for macro
expansion - Design of a Macro pre- processor, Design of a Macro assembler;
Introduction to Loaders and Linkers.
UNIT-II 9
INTRODUCTION TO COMPILERS
Compiler: Introduction, need of translator, compiler and translator, phases of a
compiler - Compiler construction tools-Lexical analysis - Role of the lexical
analyzer - Specification of tokens –Recognition of tokens -Lexical analyzer
generators- Design aspects of Lexical Analyzer
UNIT-III 9
SYNTAX ANALYSIS & PARSING
Syntax Analysis: Role of the parser - Context free grammars, Parsing Techniques
Top-down parsing: Shift reduce - predictive parsing; Bottom-up parsing: Operator
precedence parsing, LR parsers (SLR, Canonical LR, LALR).
UNIT-IV 9
SYMBOL TABLE & ERROR DETECTION AND RECOVERY
Symbol tables- its contents and data structure for symbol table, Trees, Arrays,
Linked List, Hash Tables, Errors, Lexical phase error, syntactic phase error,
semantic error
UNIT-V 9
CODE OPTIMIZATION
Code optimization: Introduction - Sources of optimization - Introduction to data
flow analysis- Code generator: Issues in the design of a code generator- the target
machine- A simple code generator- Design aspects of Code Optimizer.
LEARNING OUTCOME:
1. Design and construction of compilers and knowledge of working of major phases of compilation.
2. Construct parsers.
3. Implement a simple compiler for a language chosen.
4. Classify various parameters passing scheme, explain memory management of a programming
languages and perform code optimization.
Learning Resources
Text Book 1. Alfred V. Aho, Ravi Sethi & Jeffrey. D. Ullman, “Compilers Principles,
Techniques & Tools”, Pearson Education, third edition, 2007.
2. D.M.Dhamdhere, "System Programming and Operating Systems", 2nd
Edition., Tata Mcgraw Hill,1995
Reference Book and 1. Kenneth C. Louden, Compiler Construction, Principles and Practice,
other materials Thomson Books, 2007.
2. Aho. A.V & Ullman J.D, “Principles of Compiler Design”, Narosa
publications, 1985.
3. S.S. Muchnick Harcourt Asra,” Advanced Compiler Design
implementation”, Morgan Kaufman, 1997.
4. Anrew W. Appel, “Modern Compiler Implementation in JAVA”,
Cambridge University Press, 2003.
L T P C
Course Code: CS 3003 Subject Name: COMPUTER NETWORKS 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
To learn the concepts of the networking and its models.

HOURS
UNIT-I 8
INTRODUCTION
OSI Reference Model and Network Architecture: Introduction to Computer Networks,
Example networks ARPANET, Internet, Private Networks, Network Topologies: Bus,
Star, Ring, Hybrid, Tree, Complete, Irregular - Topology; Types of Networks : Local
Area Networks, Metropolitan Area Networks, Wide Area Networks, Functions of each
layer, Services and Protocols of each layer.
UNIT-II 10
PHYSICAL AND DATA LINK LAYERS
Basics for Data communications, Transmission Media, Guided and unguided
transmission media, Communication satellites - Data link Layer design issues, Error
Detection & Correction, Elementary Data link Protocols-Sliding window Protocols.
UNIT-III 10
MAC & NETWORK LAYERS
Media access control and LANs: Channel Access Methods, Aloha, CSMA,
CSMA/CD, Token Passing, Ethernet, Layer 2 & 3 switching, Fast Ethernet and Gigabit
Ethernet, Token Ring, LAN interconnecting devices: Hubs, Switches, Bridges,
Routers, Gateways. - Network layer design issues - Routing Algorithms - Congestion
Control Algorithms
UNIT-IV 9
TRANSPORT LAYER
TCP/IP: Introduction, History of TCP/IP, Layers of TCP/IP, Protocols, Internet
Protocol, Transmission Control Protocol, User Datagram Protocol, IP Addressing, IP
address classes, Subnet Addressing, Overview of IP version
UNIT-V 8
APPLICATION LAYER
Internet Control Protocols, ARP, RARP, ICMP, Application Layer, Domain Name
System, Email – SMTP, POP,IMAP; FTP, NNTP, HTTP, DNS, E-mail, WWW-
Multimedia-Introduction to Cryptography–basic concepts-firewalls
LEARNING OUTCOME:
1. Conceptualise and explain the functionality of the different layers within a network architecture
2. Analyze the requirements for a given organizational structure and select the most appropriate
networking architecture and technologies, subnetting and routing mechanism.
3. Demonstrate the operation of various routing protocols and their performance analysis.
4. Illustrate design and implementation of datalink, transport and network layer protocols within a
simulated/real networking environment.
Learning Resources
Text Book 1. Andrew S. Tanenbaum, “Computer Networks”, Pearson, Fourth
Edition, 2005
Reference Book and other 1. Behrouz A. Forouzan, “Data communication and
materials Networking”, Tata McGraw-Hill, 2004.
2. James F. Kurose and Keith W. Ross, “Computer Networking:
A Top-Down Approach Featuring the Internet”, Pearson
Education, Third Edition 2003.
3. William Stallings, “Data and Computer Communication”,
Seventh Edition, Pearson Education, 2003.
L T P C
Course Code: 20 PD 0301 Subject Name: PERSONALITY DEVELOPMENT – V 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
The objective of this course is to foster the confidence of student in public speaking by making them learn
the style of effective communication skills, business correspondence skills both as individual and in group.

HOURS
UNIT-I Debate – Argument & Counter Argument, Modulation in Communication – 6

Voice Modulation, Assertive & Aggressive
UNIT-II Conversation Skills – Word –stress, Types of tones, Pronunciation, Body 6

language
UNIT-III Business Correspondence – Notice, Agenda, Minutes of meeting, Memo, etc. 6

UNIT-IV Resume Making - I 6
UNIT-V Importance of Listening skills, Chinese Whisper 6
LEARNING OUTCOME:
1. Rules and means of business correspondence
2. Effective public speaking
3. Role of general knowledge / current affairs in social communication
L T P C
Course Code: CS 3113 Subject Name: COMPUTER NETWORK LAB 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
This laboratory course deals with the complete implementation aspects of Networking and their
applications
LIST OF EXPERIMENTS
1. Introduction to Discrete Event Simulation tools NS2/NS3 and installation of NS2/NS3.
2. Simulate point to point topology using NS2/NS3.
3. Simulate Bus Topology using NS2/NS3.
4. Create a Straight Cable and crossover cable using RS232C Connector.
5. Implementation and study of Stop and Wait Protocol.
6. Implementation and study of Go-back-n and Selective Repeat Protocol.
7. Implementation and study of Distance Vector Routing algorithm.
8. Implementation and study of Link state routing protocol.
9. Simulate Star Topology using TCP server in NS2/NS3.
10. Write a socket Program for Echo/Ping/Talk commands.
LEARNING OUTCOME:
1. Understand the requirements of an enterprise and outline its major design areas
2. Identify functional areas to construct high level modules for enterprise architecture and analyze
them.
3. Identify the networking devices, prepare a bill of materials and configure the devices as per the
Core, Acess and Distribution layers
4. Design the Server Farm for an enterprise network and discuss up gradations if needed.
5. Identify and select the technology for Remote site Connectivity, suitable IP addressing plan and
routing protocol for an enterprise network.
6. Test and monitor the enterprise network using a tool
Learning Resources
materials
L T P C
Course Code: CS 3115 Subject Name: INDUSTRIAL TRAINING – I 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
To provide hands-on experience at site where Computer Science and engineering projects are executed.
INDUSTRIAL TRAINING - I
Students have to undergo six weeks practical training in Computer Science and Engineering related
project sites. At the end of the training they have to submit a report together with a certificate in the
format prescribed and make a presentation which shall be evaluated.
(Training to be undergone after IV Semester)
LEARNING OUTCOME:
1. To enable the students to gather a first-hand experience on site.
L T P C
Course Code: CS 3117 Subject Name: COMPILER DESIGN LAB 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
1. Be exposed to compiler writing tools.
2. Learn to implement the different Phases of compiler
3. Be familiar with control flow and data flow analysis
4. Learn simple optimization techniques
LIST OF EXPERIMENTS:
1. Implementation of Symbol Table

2. Develop a lexical analyzer to recognize a few patterns in C. (Ex. identifiers, constants, comments,
operators etc.)
3. Implementation of Lexical Analyzer using Lex Tool
4. Design a lexical analyzer for given language and the lexical analyzer should ignore redundant
spaces, tabs and new lines
5. Simulate First and Follow of a Grammar.
6. Develop an operator precedence parser for a given language.
7. Construct a recursive descent parser for an expression.
8. Construct a LL(1) parser for an expression
9. Design predictive parser for the given language
10. Implementation of shift reduce parsing algorithm.
11. Design a LALR bottom up parser for the given language.
12. Implement the lexical analyzer using JLex, flex or lex or other lexical analyzer generating tools
13. Write a program to perform loop unrolling. Construction of DAG
LEARNING OUTCOME:
1. Demonstrate a working understanding of the process of lexical analysis, parsing and other
compiler design aspects.
SEMESTER - VI
L T P C
CS3002 ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
The objective of this course is to impart concepts of Artificial Intelligence and Expert System,methods of
solving problems using Artificial Intelligence and introduce the concepts of Expert Systems and machine
learning.
HOURS
UNIT-I INTRODUCTION TO Al AND PRODUCTION SYSTEMS 10
Introduction to Al - Problem formulation, Problem Definition - Production
systems, Control strategies, Search strategies. Problem characteristics, Production
system characteristics - Specialized production systems,- Problem solving methods
-Problem graphs, Matching, Indexing and Heuristic functions -Hill Climbing,
Depth first and Breath first, Constraints satisfaction - Related algorithms, Measure
of performance and analysis of search algorithms.
UNIT-II REPRESENTATION OF KNOWLEDGE 10

Game playing - Knowledge representation, Knowledge representation using
Predicate logic, Introduction to predicate calculus, Resolution, Use of predicate
calculus, Knowledge representation using other logic - Structured representation
of knowledge.
UNIT-III FUNDAMENTALS OF EXPERT SYSTEMS 9

Basic plan generation systems - Strips - Advanced plan generation systems - K
strips - Expert systems -Architecture of expert systems, Roles of expert systems -
Knowledge Acquisition -Meta knowledge, Heuristics.
UNIT-IV KNOWLEDGE INFERENCE 8

Knowledge representation — Production based system, Frame based system.
Inference - Backward chaining, Forward chaining, Rule value approach, Fuzzy
reasoning - Certainty factors, Bayesian probability.
UNIT-V MACHINE LEARNING 8

Strategic explanations - Why, Why not and how explanations. Learning Machine
learning, adaptive learning. - Typical expert systems - MYCIN, PIP,
INTERNIST, DART, XOON, Expert systems shells
LEARNING OUTCOME:
1. Learn the basics and applications of artificial intelligence and categorize various problem domains,
basic knowledge representation and reasoning methods.
2. Analyze basic and advanced search techniques including game playing, evolutionary search algorithms,
and constraint satisfaction.
3. Learn and design intelligent agents for concrete computational problems.
4. Design of programs in AI language(s).
5. Acquire knowledge about the architecture of an expert system and design new expert systems for real
life applications.
Learning Resources
Reference Book and other Text Books:
materials 1. Elaine Rich, “Artificial Intelligence”, 2nd Edition, McGraw
Hill, 2005
2. Dan W.Patterson, “ Introduction to AI and ES”, Pearson
Education, 2007
Reference Books
1. Peter Jackson,” Introduction to Expert Systems”, 3rd
Edition, Pearson Education, 2007
2. Stuart Russel, Peter Norvig “AI – A Modern Approach”, 2nd
Edition, Pearson Education 2007.
L T P C
CS3004 SOFTWARE ENGINEERING 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
This course in Software Engineering provides an in-depth understanding of the Software Engineering
principles and methodologies.

HOURS
Some Definitions, FAQs about software engineering, the evolving role of software,
Software characteristics, SW applications,Soft.ware Crisis
Software Processes: Software process models, Waterfall model, the prototyping
model, spiral model, RAD and Incremental model.
Project Management: Management activities, Project planning, Project scheduling,
Risk Management.
UNIT-II SOFTWARE REQUIREMENTS ANALYSIS 9

Functional and non functional requirements, User requirements, System
requirements, the software requirements document. IEEE standard of SRS, Quality
of good SRS, Requirements elicitation and analysis.
UNIT-III SOFTWARE DESIGN CONCEPTS 9

System Design: Design Concepts, design models for architecture, Abstraction,
Coupling and Cohesion, Types of Coupling and cohesion, Top Down and Bottom
Up design approaches; Functional Versus Object Oriented Approach, Design
Specification, Information Hiding.
UNIT-IV TESTING, VERIFICATION AND VALIDATION 9

Verification and Validation ,Software Testing : Testing functions, Test case design,
White Box testing: cyclomatic complexity Black box testing:Boundary value
Analysis,Equivalence class partitioning, Unit testing, Integration Testing, System
testing,Alpha Testing,Beta Testing and Acceptance Testing .
UNIT-V SOFTWARE MAINTENANCE & RELIABILITY ISSUES 9

Need for Maintenance, Categories of Maintenance: Preventive, Corrective and
Perfective Maintenance, Cost of Maintenance, Software reliability – issues-
Software reliability Vs Hardware reliability – Failures and Faults - Classification
of Failures.
LEARNING OUTCOME:
1. Analyze software development process models, including agile models and traditional models like
waterfall.
2. Demonstrate the use of software life cycle through requirements gathering, choice of process model
and design model
3. Apply and use various UML Models for software analysis, design and testing.
4. Acquire knowledge about the concepts of application of formal specification, CASE tools and
configuration management for software development.
5. Analysis of software estimation techniques for creating project baselines.
Learning Resources
Text 1. Richard Fairley, “Software Engineering Concepts”, McGraw Hill, 1985.
Book 2. Roger S. Pressman, “Software Engineering A Practitioner Approach” 4th
edition , McGraw Hill, 1999
Reference 1. Roger S. Pressman, Software engineering- A practitioner’s Approach, McGraw-Hill

Book and International Edition, 5th edition, 2001.
other
materials
2. Ian Sommerville, Software engineering, Pearson education Asia, 6th edition, 2000.
3. Pankaj Jalote- An Integrated Approach to Software Engineering, Springer Verlag, 1997.
4. Shooman, Software Engineering, McGraw Hill, 1983.
L T P C
CS3010 MULTIMEDIA AND WEB TECHNOLOGIES 3 0 0 3
Co-requisite:
COURSE OBJECTIVE:-
This course makes the student to know about basic concepts of multi-media and web
technologies.
HOURS
UNIT-I BASICS OF MULTIMEDIA TECHNOLOGY 9
Computers, communication and entertainment; multimedia an introduction;
framework for multimedia systems; multimedia devices; CD- Audio, CD-ROM,
CD-I, presentation devices and the user interface; multimedia presentation and
authoring; professional development tools; LANs and multimedia; internet, World
Wide Web & multimedia distribution network-ATM & ADSL; multimedia
servers & databases; vector graphics; 3D graphics programs; animation
techniques; shading; anti aliasing; morphing; video on demand.
UNIT-II IMAGES 9
Image Compression & Standards: Making still images; editing and capturing
images; scanning images; computer color models; color palettes; vector drawing;
3D drawing and rendering; JPEG-objectives and architecture; JPEGDCT
encoding and quantization, JPEG statistical coding, JPEG predictive lossless
coding; JPEG performance; overview of other image file formats as GIF, TIFF,
BMP, PNG etc.
UNIT-III WEB CONCEPTS 9

Internet Principles – Basic Web Concepts – Client/Server model – retrieving data
from Internet – HTML and Scripting Languages – Standard Generalized Mark –
up languages – Next Generation – Internet –Protocols and Applications
UNIT-IV SCRIPTING LANGUAGES 9

Java Script Programming-Dynamic HTML-Cascading style sheets-Object model
and Event model - Filters and Transitions-Active X Controls-Multimedia-Client
side script.- VB Script programming – Forms – Scripting Object
UNIT-V SERVER SIDE PROGRAMMING 9

Dynamic Web content – cascading style sheets – DHTML – XML – Server side
includes – communication – Active and Java Server Pages – Firewalls – Proxy
Servers.
LEARNING OUTCOME:
1. Developed understanding of technical aspect of Multimedia Systems.
2. Understand various file formats for audio, video and text media.
3. Develop various Multimedia Systems applicable in real time.
4. Design interactive multimedia software.
5. Apply various networking protocols for multimedia applications.
6. To evaluate multimedia application for its optimum performance.
Learning Resources
Text 1. An introduction, Villamil & Molina, Multimedia Mc Milan, 1997
Book 2. Multimedia: Sound & Video, Lozano, 1997, PHI, (Que)
3. Eric Ladd, Jim O’ Donnel, “Using HTML 4, XML and Java”, Prentice Hall
of India – QUE,1999
Reference
Book and
other
materials
L T P C
Course Code: CS 3112 Subject Name: COMPREHENSION 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
To provide a complete picture of Computer Science and engineering topics so that students are well
prepared to face job interviews and subjects related competitive examinations.
INSTRUCTIONAL OBJECTIVES
To assess the overall knowledge level of Computer Science and engineering standards and guide them
to take corrective measures where deficiencies are detected.
COMPREHENSION
A. Review of the following topics of Computer Science and engineering: Digital Computer
Fundamentals
1. Programming in C
2. Data Structures
3. Design and Analysis of algorithms
4. Microprocessor and Interfacing
5. Principles of Programming Languages
6. Theory of Computation
7. Operating Systems
8. Java Programming
B. Seminar/group discussion
Students shall have seminar/group discussion sessions on the topics listed under A above under the
guidance of staff.
LEARNING OUTCOME:
1. To assess the overall knowledge level of Computer Science and engineering standards and guide them
to take corrective measures where deficiencies are detected.
L T P C
Course Code: 20PD 0302 Subject Name: PERSONALITY DEVELOPMENT –VI 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
The objective of the course is to prepare students to take part in group discussion and job interviews
successfully and to gain self-confidence for placement process.

HOURS
UNIT-I Interview skills, basic interview questions, Interview Etiquettes 6
UNIT-II Group Discussion, Role & importance of GD in job placement, preparation for 6
GD
UNIT-III Resume making -II, SWOT Analysis 6
UNIT-IV Mock Interview I & GD Practice sessions 6

UNIT-V Interview Dressing Etiquettes and Behaviour Etiquettes, Mock Interview –II 6
LEARNING OUTCOME:
1. Builds self-confidence by self-analysis of SWOT.
2. To perform in job interviews
3. Build confidence to speak confidently in job interview as well as group discussions
L T P C
CS 3114 ARTIFICIAL INTELLIGENCE LAB 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
To learn & implement the various concepts & algorithms of AI & Expert Systems.
LIST OF PROGRAMS
1. Water Jug Problem (Using DFS And BFS)
2. Single Player Game(Using Heuristic Function)
3. Two Player Game(Using Heuristic Function)
4. A* Algorithm
5. AO* Algorithm
6. Predicate To Prepositional Logic
7. Syntax Checking of English sentences-English Grammar.
8. Develop an Expert system for Medical diagnosis.
9. Develop any Rule based system for an application of your choice.
10. Develop an algorithm for morphological derivation / verb derivation and implement it.
LEARNING OUTCOME:
1On completion of this course, the students will be able to

1. To implement Heuristic functions & Prepositional Logic
2. To implement A* & AO* algorithms
3. To implement an Expert system for medical diagnosis
Learning Resources
materials
L T P C
CS3116 MULTIMEDIA AND WEB TECHNOGIES LAB 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
1. Demonstrate knowledge of terminology related to desktop publishing, graphics and animation, and
multimedia.
2. Identify and use hardware components (input and output devices) used in desktop publishing,
graphics/animation and multimedia.
3. Analyze the impact of desktop publishing, graphics/animation and multimedia on society.
4. Model respect for intellectual property when manipulating, morphing, and editing video, graphics,
sound, and text.
5. Use strategies to obtain and evaluate print and digital information from a variety of electronic
resources and in a variety of electronic formats.
6. Identify and use appropriate software and documentation for an identified audience to create projects
in desktop publishing, graphics/animation and multimedia
Programs based on HTML, DHTML, XML, Scripting Languages and Multi-media
LEARNING OUTCOME:
1. Explain the history of the internet and related internet concepts that are vital in understanding
web development.
2. Discuss the insights of internet programming and implement complete application over the
web.
3. Demonstrate the important HTML tags for designing static pages and separate design from
content using Cascading Style sheet.
4. Utilize the concepts of JavaScript and Java
5. Use web application development software tools i.e. Ajax, PHP and XML etc. and identify the
environments currently available on the market to design web sites.
6. Define multimedia to potential clients.
7. Identify and describe the function of the general skill sets in the multimedia industry.
8. Identify the basic components of a multimedia project.
9. Identify the basic hardware and software requirements for multimedia development and
playback..
Learning Resources
materials
L T P C
CS 3118 SOFTWARE ENGINEERING LAB 0 0 2 1
COURSE OBJECTIVE:-
To understand the concepts and implement the software engineering methodologies in the list of
applications given below. Each UML diagram is designed to let developers and customers view a software
system from a different perspective and in varying degrees of abstraction. UML diagrams commonly
created in RSA visual modelling tools.
S.No PROGRAM NAME

Structure Diagram :
1. To display a relationship among the various structures using Class diagram.
2. Manifestation concept of Component Diagram.
3. Network architect process using the Deployment Diagram.
Behavior Diagram :
4. Use-Case Diagram – To display the relationship among actors & Use-cases.
5. Activity Diagram – To display the action states & source transition states.
6. State Machine Diagram – sequence of state response & action on the interaction.
Interaction Diagram :
7. Sequence Diagram – To display the time sequence of objects interactions.
8. Communication Diagram – To display the elements of frame, lifeline, messages.
Case Study :
9. UML interaction overview diagram for online shopping
10. Bank ATM behavioral using state machine diagram
11. Library Domain model using Class diagram
12. Hospital Management system using Use-case diagram
13. UML activity diagramdescribing behavior of the Purchase Ticket use-casefor a

Ticket vending machine.
14. UML sequence diagram for Online Bookshop

LEARNING OUTCOME:

1. Able to prepare SRS document, design document, test cases and software configuration management
and risk management related document.
2. Develop function oriented and object oriented software design using tools like rational rose.
3. Able to perform unit testing and integration testing.
4. Apply various white box and black box testing techniques
5. Able to track the progress of a project using Openproj tool.
SEMESTER – VII
L T P C
CS 4003 CLOUD COMPUTING 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
To learn & implement the various concepts of Cloud computing

HOURS
UNIT-I Introduction: Cloud computing history, architecture and essential characteristics, 9
cloud service models, Cloud Deployment models, advantages of cloud computing,
cloud v/s grid computing.
UNIT-II Virtualization: Virtualization techniques, Benefits and drawbacks of 9

virtualization, VM migration with its types, hypervisors, types of hypervisors,
distributed management of virtual infrastructures, scheduling techniques for
advance reservation of capacity, Service-oriented architectures, SOA
implementation, SOAP v/s REST, web 2.0.
UNIT-III PaaS: Introduction, advantages and disadvantages of PaaS, introduction to google 9

app engine, GAE cost structure, Apache hadoop: MapReduce, HDFS, Hive,
Mapreduce programming model, Hadoop as a service.
UNIT-IV Migrating into the cloud: Introduction, challenges in the cloud, legal issues in 9
cloud computing, Cloud Economics and Capacity Management: Restricted
Choices, Capacity Planning, Queuing and Response Time, Evidence Based
Decision Making, Instrumentation (Measuring Resource Consumption),
Bottlenecks, Key Volume Indicators.
UNIT-V Security in clouds, protocols, algorithms, Security as a service, Multi-cloud. 9
LEARNING OUTCOME:
On completion of this course, the students will be able to

1. To explain the basic concepts along with evolution and features of cloud computing.
2. To demonstrate the concept of existing cloud paradigms and platforms.
3. To explore the issues of cloud computing in addition with various cloud models.
4. To attain the knowledge of virtualization through virtualization technologies.
5. To interpret the concept of Map reduce framework using SQL and NO SQL databases.
Learning Resources
Reference Book and other Text Books:
materials Cloud Computing Principles and Paradigms, Rajkumar
Buyya, Wiley & Sons pub.
Reference Books
1. Cloud Computing Web-Based dynamic IT services:
Christian Baun, Springer.
2. Implementing and Developing Cloud Computing
Applications: David E.Y Sarna, CRC Press.
L T P C
CS 4113 CLOUD COMPUTING LAB 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
To learn and Practice the basics of cloud computing

PROGRAMS
Programs based on cloud computing
Course Learning Outcomes (CLOs):-

1. Develop and deploy cloud application using popular cloud platforms
2. Design and develop highly scalable cloud-based applications by creating and configuring virtual
machines on the cloud and building private cloud.
3. Explain and identify the techniques of big data analysis in cloud.
4. Compare, contrast, and evaluate the key trade-offs between multiple approaches to cloud system
design, and Identify appropriate design choices when solving real-world cloud computing problems.
5. Write comprehensive case studies analysing and contrasting different cloud computing solutions.
6. Make recommendations on cloud computing solutions for an enterprise.
Learning Resources
materials
L T P C
Course Code: CS 4115 Subject Name: INDUSTRIAL TRAINING – II 0 0 2 1
Co-requisite:
COURSE OBJECTIVE:-
To provide hands-on experience at site where Computer Science and engineering projects are executed.
INDUSTRIAL TRAINING II
Students have to undergo six weeks practical training in Computer Science and Engineering related
project sites. At the end of the training they have to submit a report together with a certificate in the
format prescribed and make a power point presentation which shall be evaluated.
LEARNING OUTCOME:
1. To enable the students to gather a first-hand experience on site.
L T P C
Course Code: CS 4117 Subject Name: MINOR PROJECT 0 0 8 4
Co-requisite:
COURSE OBJECTIVE: -
To simulate real life situations related to Computer Science and engineering and impact adequate training
so that confidence to face and tackle any problem in the field is developed.
PROJECT
Each student is given an exercise which will cover all the aspects ( to the extent possible) like
investigation, planning, designing, detailing and estimating of a Computer Science and engineering
structure in which the aspects like analysis, application of relevant codes, etc., will find a place.
Alternately, a few research problems also may be identified for investigation and the use of laboratory
facilities to the fullest extent may be taken as a project work. Alternately, a student is encouraged to take
an industrial project with any Computer Science and engineering organization or firm. A project report
is to be submitted on the topic which will be evaluated.
LEARNING OUTCOME:
1. Identify, formulate and analyse existing problem in the (non-automated) work flow for performing a
specific task.
2. Design and implement automated solutions for the assigned/identified real world problems.
3. Write technical reports.
4. Practice and develop skills in time management and reporting within an industrial or research laboratory
setting.
5. Contribute to an ethical and professional work culture and also to learn to work in diverse teams.
SEMESTER - VIII
L T P C
Course Code: CS 4114 Subject Name: PROJECT 0 0 16 8
Co-requisite:
Course objective:-
The objective of the project semester is to make the students solve real world problems using automated
solutions, while developing management and writing skills amongst them.
PROJECT
Each student is given an exercise which will cover all the aspects ( to the extent possible) like
investigation, planning, designing, detailing and estimating of a Computer Science and engineering
structure in which the aspects like analysis, application of relevant codes, etc., will find a place.
Alternately, a few research problems also may be identified for investigation and the use of laboratory
facilities to the fullest extent may be taken as a project work. Alternately, a student is encouraged to take
an industrial project with any Computer Science and engineering organization or firm. A project report
is to be submitted on the topic which will be evaluated.
LEARNING OUTCOME:
1. Identify, formulate and analyse existing problem in the (non-automated) work flow for performing a
specific task.
2. Design and implement automated solutions for the assigned/identified real world problems.
3. Write technical reports.
4. Practice and develop skills in time management and reporting within an industrial or research laboratory
setting.
5. Contribute to an ethical and professional work culture and also to learn to work in diverse teams.
SYLLABUS OF DEPARTMENTAL ELECTIVES
L T P C
CS3019 COMPUTER GRAPHICS 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
This course makes the student to know about basic concepts of Distributed operating system.
HOURS
UNIT-I INTRODUCTION TO COMPUTER GRAPHICS 9
What is Computer Graphics, Computer Graphics Applications, Computer
Graphics Hardware and software, Two dimensional Graphics Primitives: Points
and Lines, Line drawing algorithms: DDA, Bresenham’s; Circle drawing
algorithms: Using polar coordinates, Bresenham’s circle drawing, mid-point
circle drawing algorithm; Filled area algorithms: Scanline: Polygon filling
algorithm, boundary filled algorithm.
UNIT-II 9
TWO/THREE DIMENSIONAL VIEWING
The 2-D viewing pipeline, windows, viewports, window to view port mapping;
Clipping: point, clipping line (algorithms):- 4 bit code algorithm, Sutherland-
cohen algorithm, parametric line clipping algorithm (Cyrus Beck).
UNIT-III CLIPPING & TRANSFORMATION 9

Polygon clipping algorithm: Sutherland - Hodgeman polygon clipping algorithm.
Two dimensional transformations: transformations, translation, scaling, rotation,
reflection, composite transformation.
Three dimensional transformations: Three dimensional graphics concept, Matrix
representation of 3-D Transformations, Composition of 3-D transformation.
UNIT-IV 9
VIEWING IN 3D
Projections, types of projections, the mathematics of planner geometric
projections, coordinate systems.
Hidden surface removal: Introduction to hidden surface removal .Z- buffer
algorithm, scanline algorithm, area sub-division algorithm.
UNIT-V 9
REPRESENTING CURVES AND SURFACES
Parametric representation of curves: Bezier curves, B-Spline curves. Parametric
representation of surfaces; Interpolation method.
Illumination, shading, image manipulation: Illumination models, shading models
for polygons, shadows, transparency. What is an image? Filtering, image
processing, geometric transformation of images.
LEARNING OUTCOME:
1. To provide main notions of graphics
2. To learn Formal framework to draw basic elements
3. To study graphics system along with completeness
Learning Resources
Text Book 1. Computer Graphics Principles and Practices
second edition by James D. Foley, Andeies van
Dam, Stevan K. Feiner and Johb F. Hughes, 2000,
Addision Wesley.
2. Computer Graphics by Donald Hearn and
M.Pauline Baker, 2nd Edition, 1999, PHI
Reference Book and other 1. Procedural Elements for Computer Graphics – David F.
materials Rogers, 2001, T.M.H Second Edition
2. Fundamentals of 3Dimensional Computer Graphics by
Alan Watt, 1999, Addision Wesley.
3. Computer Graphics: Secrets and Solutions by Corrign
John, BPB
4. Graphics, GUI, Games & Multimedia Projects in C by
Pilania & Mahendra, Standard Publ.
L T P C
CS3021 SYSTEM MODELLING AND SIMULATION 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
This course provides a complete understanding of the various mathematical models, simulation
techniques and its applications
.
HOURS
Systems & Environment – Discrete & Continuous systems- model of a system –
Types- Discrete event system simulation – steps; Simulation Example – Queuing
systems – Inventory systems – other examples; General Principles – concepts in
Discrete event simulation – List processing.
UNIT-II 10
MATHEMATICAL & STATISTICAL MODELS
Statistical models – Discrete & Continuous distributions – Poisson process;
Queuing models – Characteristics – notations; long run measure of performance
of queuing systems – server utilization – costs in queuing problems; steady-state
behavior of infinite population Markovian models- Multiserver Queue
UNIT-III 9
RANDOM NUMBERS
Random number generation – Properties – Generation of Pseudo Random numbers
– Techniques for generation– Tests for Random numbers – Random variate
generation –Inverse Transform Technique – Exponential, Uniform, Weibull,
Triangular, Empirical continuous, Discrete distributions- Acceptance Rejection
principle
UNIT-IV ANALYSIS OF SIMULATION DATA 9

Input modelling – Identifying the distribution – parameter estimations – Goodness
of Fit test– Fitting a non-stationery poison process – selecting input models
without data; Verification and Validation of simulation models- model building –
verification of models – calibration and validation of models – output analysis for
a single model.
UNIT-V 9
APPLICATION & SIMULATION SOFTWARES
Simulation of Computer systems – simulation Tools – model input – High level
system simulation – CPU and memory simulation; Simulation of Computer
networks – Traffic modeling – media access control – Data Link layer, TCP ,
Model construction.
History of Simulation Software - Simulation in Java, GPSS, SSF; Introduction to
various simulation softwares.
LEARNING OUTCOME:
1. Mathematical models for simulation
2. Random numbers generation
3. Analysis of simulation data and modelling
4. Applications of Simulation, and, simulation software
Learning Resources
Text Book 1. 1 Jerry Banks, John S.Carson, Barry L.Nelson, David M. Nicol, “Discrete Event
System Simulation”, Pearson Education, Fourth Edition, 2005
Reference 1. 1. Geoffery Gordon, “System Simulation”, Pearson Education, 2nd Edition, 2007
Book and 2. Arerill M.Law, David Kelton, “ Simulation Modelling & Analysis”, McGraw
other
materials
Hill International Edition, 2000
L T P C
CS3023 DIGITAL IMAGE PROCESSING 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
This course provides a complete understanding of the various image processing techniques
HOURS
UNIT-I 8
INTRODUCTION
Origin of Digital Image processing – fundamental steps – Components of Image
processing system – Visual perception – Light and EM spectrum – Image sensing
and acquisition – Image sampling and Quantization – relationship between pixels
UNIT-II 9
IMAGE ENHANCEMENT
Spatial Domain: Gray level transformation – Histogram processing – Arithmetic
/ Logic operations- Spatial filtering – smoothing filters – sharpening filters
Frequency Domain: Fourier transform – smoothing frequency domain filters –
sharpening filters – Homographic filtering
UNIT-III 10
IMAGE RESTORATION
Model of Image degradation/ restoration process – Noise models – mean filters –
order statistics – adaptive filters – band reject – bandpass – notch – optimum notch
filters – Linear, position invariant degradations – establishing degradation
functions – Inverse filtering – Weiner – least square – Geometric mean filters
UNIT-IV 9
IMAGE COMPRESSION
Fundamentals – Image compression models – Information theory – error free
compression: variable length – LZW – Bitplane – Lossless predictive coding;
Lossy compression: Lossy predictive – transform – wavelet coding; Image
compression standards
UNIT-V 9
IMAGE SEGMENTATION, REPRESENTATION & DESCRIPTION9
Segmentation: Detection of discontinuities – Edge linking & Boundary detection
– Thresholding – region based segmentation
Representation & Description: Chain codes – Polygonal approximations –
signatures – Boundary segments – Skeletons; Boundary Descriptors – Regional
descriptors
LEARNING OUTCOME:
1. Comprehend the need and usage of concepts of image processing.
2. Enhance the visual quality of given grey/color image using well known transformations and filters.
3. Distinguish between lossy and lossless image compression model.
4. Segment the regions of given image using various feature extraction algorithms in order to recognize
object.
5. Demonstrate the use of MATLAB to create interactive image processing applications.
Learning Resources
Text Book 1. Rafael C. Gonzalez, Richard E. Woods, “Digital Image Processing”
, 2nd edition , Pearson Education, 2007.
Reference Book and other 1. S.Annadurai, R.Shanmugalakshmi, “fundamentals of Digital

materials Image Processing”, Pearson Education, 2007
2. Rafael C. Gonzalez, Richard E. Woods, Eddins, “Digital
Image Processing using MATLAB” , Pearson Education, 2005
3. Anil Jain K. “Fundamentals of Digital Image Processing”, PHI,
1999.
4. William Pratt , “Digital Image Processing”, Wiley Interscience,
2nd edition 1991
L T P C
CS3025 VISUAL PROGRAMMING 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
This course gives a strong foundation to the Visual Programming concepts

HOURS
UNIT-I 8
INTRODUCTION TO WINDOWS PROGRAMMING
Different paradigms of programming – Structured Programming- Object Oriented
Programming-Functional Programming- Logic programming- Visual
Programming-– Comparison – Concurrent Programming Event driven
programming – Windows programming fundamentals – Applications.
UNIT-II 10
VISUAL BASIC PROGRAMMING
Visual Basic Applications – Creating and using Controls – Menus and Dialogs –
Managing projects – Programming fundamentals – Objects and instances –
Debugging – Responding to mouse events – Using grid control – Creating graphics
for application – Displaying and printing information – Interacting with the
environment – File system controls - Processing files – Accessing databases with
the data controls.
UNIT-III 9
VISUAL C++ PROGRAMMING
Visual C++ components – Developing simple applications – Microsoft Foundation
classes – Controls – Message handling - Document-view architecture – Dialog
based applications – Mouse and keyboard events.
UNIT-IV 9
VISUAL JAVA – INTRODUCTION
Java basics – Java classes – Object references – Inheritance –- File I/O – Java
Exception handling tools – Developing Java applications.
UNIT-V JAVA APPLETS AND NETWORKING 9

Visual J++ Applet wizard – Handling events – Multithreading – Animation
techniques – Animating images – Applets and HTML – Java beans – JavaScript –
Combining scripts and Applets – Applets over web and networking.
LEARNING OUTCOME:
1. To define the fundamentals of animation, virtual reality and its related technologies.
2. To understand a typical graphics pipeline
3. To design an application with the principles of virtual reality
Learning Resources
Text Book 1. Charles Petzold, “Windows Programming”,
Microsoft Press, 1995.(Unit – I)
2. Marion Cottingham “Visual Basic”, Peachpit Press,
1999. (Unit – II)
3. Kate Gregory ‘Using Visual C++”, Prentice Hall
of India Pvt., Ltd., 1999. (Unit – III)
4. H.M.Deitel and P.J.Deitel, “Java how to program
with an Introduction to Visual
5. J++”, Prentice Hall, 1998. (Unit – IV & V)
Reference Book and other 1. C.H. Pappas, W.H. Murray, III “Visual C++: The
materials Complete Reference”, Tata McGraw-Hill Publishing
Company, 1999.
2. Stephen R.Davis, “Lean Java Now”, Microsoft Press,
1996.
3. Jamie Jaworski, “Java Unleashed”, SAMS Techmedia
Publication, 1999.
4. Jason Blooberg. Jeff Kawski, and Paul Treffers, “Web
Page Scripting Techniques”,Hayden books, 1996
L T P C
CS3027 OPERATIONAL RESEARCH TECHNIQUES 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
To enlighten the students with the various optimized techniques
HOURS
UNIT-I LINEAR PROGRAMMING 9
Operations research and decision making, Types of mathematical models and
constructing the model, Formulation of linear programming problem, Simplex
method (Analytical & Graphical), Two phase and Big - M methods
UNIT-II ASSIGNMENT & TRANSPORTATION MODELS 9

Assignment models, Transportation problem – North west corner method – Least
cost method – Vogel’s approximation method – Modi method, Unbalance and
degeneracy in transportation model, Replacement model – Replacement of items
that deteriorate, gradually, fail suddenly, group replacement policy analysis.
UNIT-III SCHEDULING AND NETWORK ANALYSIS 9

Problem of sequencing – Processing ‘n’ jobs through two machines and three
machines, processing two jobs through ‘m’ machines. Network analysis – PERT
and CPM, Total slack, free slack, Probability of achieving completion date, Cost
analysis.
UNIT-IV INVENTORY CONTROL 9

Inventory models – Deterministic models – Economic ordering quantity, Reorder
level, optimum cost – Instantaneous and Non-instantaneous receipt of goods with
or without shortages.
UNIT-V PRINCIPLES OF QUEUEING THEORY 9

Introduction to Markovian queueing models – Single server model with finite and
infinite system capacity – Characteristics of the model; Applications of queueing
theory to computer science and engineering.
LEARNING OUTCOME:
1. Concepts of Linear programming technique
2. Applications and use of Assignment, Transportation and Replacement models
3. Techniques of PERT, CPM
4. Detailed knowledge of Inventory control
5. Gain strong knowledge in principles of queuing theory.
Learning Resources
Text Book 1. Handy .A. Taha, “Operations Research”, Prentice
Hall of India., 5th Edition, 2012
2. P. K. Gupta, D. S. Hira, Operations Research,
Sultan Chand Publication, Delhi, 2012.
Reference Book and other 1. Kanti Swarup, Gupta P.K., and Man Mohan, Operations
materials Research, Sultan Chand & Sons, 1994.
2. Sharma S.D., Operations Research, Kedarnath Ramnath &
Co., Meerut, 2013.
3. Sharma J. K., Operations Research: Theory and
Applications, Macmillan Publishers India Limited, 2011.
4. Sundaresan.V, Ganapathy Subramanian.K.S. and
Ganesan.K, Resource Management Techniques, A.R.
Publications,2002
L T P C
CS3029 PRINCIPLES OF PROGRAMMING LANGUAGES 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
The objective of this course is to impart concepts of Programming Languages
HOURS
UNIT-I 9
PRELIMINARY CONCEPTS
High Level Languages, Issues in Programming - Case studies, Programming
paradigms, Language implementation. Syntactic Structure — Language
representation, Abstract Syntax tree, Lexical syntax, Context Free Grammars,
Variants of CFG, Issues involved and Normal Forms for CFG
UNIT-II 9
IMPERATIVE LANGUAGES
Structured Programming — Need and Design issues. Block Structures (Pascal),
type’s arrays, records, sets, pointers, procedures, parameter passing, scope rules (in
C).
UNIT-III 9
OBJECT ORIENTED LANGUAGES
Grouping of data and Operations — Constructs for Programming Structures,
abstraction Information Hiding, Program Design with Modules, Defined types,
Object oriented programming — concept of Object, inheritance, Derived classes
and Information hiding – Templates- Exception handling (Using C++ and Java as
example language).
UNIT-IV 9
FUNCTIONAL PROGRAMMING
Functional Programming — Features, Implementation, Types — values and
operations, Product of types. Lists and Operations on Lists, Functions from a
domain to a range, Function Application, Lexical Scope. Bindings of values and
functions (Using Haskell/ Lisp as example language)
UNIT-V 9
LOGIC PROGRAMMING
Formal Logic Systems, Working with relations and their implementation (Using
Prolog as example). Database query Languages, Exception handling (Using SQL
as example)
LEARNING OUTCOME:
1. Concepts of High level languages and its grammar
2. Study of Imperative languages ( Pascal and C)
3. Study of Object oriented Programming ( C++ and JAVA)
4. Study of Functional Programming ( Haskell / Lisp)
5. Study of Logic Programming ( Prolog and SQL)
Learning Resources
Text Book 1. Pratt, Zelkowitz, “Programming
Languages: Design and
Implementation Edition, Pearson
Education,” 2nd Edition, 2004
Reference Book and other 1. Ravi Sethi, “Programming Language Concepts and
materials Constructs”, Pearson Education, 2006
2. Kenneth C.Louden, “Programming Languages- Principles
& Practice”, Thomson, 2nd Edition
3. Doris Appleby, Julius J. Vandekopple, “Programming
Languages: Paradigms and Practice”, McGraw Hill, 1997
4. Damir Medak and Gerhard Navratil, “Haskell-Tutorial”,
Available on the Web, Feb2003.
5. Paul Hudak, John Peterson and Joseph H. Fasel, “A gentle
Introduction to Haskell-98”,2004
6. A.B.Tucker, Robert, Noonan, “Programming Languages”,
McGraw Hill, 2002.
L T P C
CS3031 SOFT COMPUTING 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
This course provides a way to understand the concepts of Artificial Intelligence, ANN, Genetic
Algorithms and Fuzzy systems and its applications

HOURS
UNIT-I BASICS OF NEUROSCIENCE AND ANN MODELS 9
The Brain as a Neural network-Basic Properties of Neurons – Neuron Models –
Rosenblatt’s Prceptron – The widrow -Hoff LMS Learning Algorithm-Order of a
Predicate and a Perceptron – Complexity of Learning using Feedforward
Networks.
UNIT-II 9
FUZZY SYSTEMS
Fuzzy Sets and Fuzzy Matrices Fuzzy Functions – Decompositions Fuzzy
Automata and Languages Fuzzy Control Method – Fuzzy Decision Making.
UNIT-III 9
NEURO-FUZZY SYSTEMS
Introduction to Neuro – Fuzzy Systems – Fuzzy System Design Procedures –
Fuzzy Sets and Logic Background - Fuzzy / ANN Design and Implementation
UNIT-IV 9
GENETIC ALGORITHMS
Introduction – Robustness of Traditional Optimization and Search Techniques –
The goals of optimization-Computer Implementation-Data Structures,
Reproduction, Crossover and Mutation – Mapping Objective Functions to fitness
form – Some Applications of Genetic Algorithms.
UNIT-V 9
ARTIFICIAL INTELLIGENCE
AI technique-Level of the Model – Problems, Problem Spaces and Search – Issues
in the Design of Search Programs – Heuristic Search Techniques – Knowledge
Representations and Mappings
LEARNING OUTCOME:
1. List the facts and outline the different process carried out in fuzzy logic, ANN and Genetic Algorithms.
2. Explain the conceptsand meta-cognitiveof soft computing.
3. Apply Soft computingtechniques the solvecharacterrecognition, patternclassification,regression
andsimilar problems.
4. Outline facts toidentify process/procedures tohandle real worldproblems using softcomputing.
5. Evaluate varioustechniques of softcomputing to defendthe best workingsolutions.
6. Design hybrid systemto revise theprinciples of softcomputing in various
applications.
Learning Resources
Text Book 1. N. K. Bose and P. Liang , “Neural Network
Fundamentals”
2. Timothy J. Ross , “Fuzzy Logic with Engineering
Applications”, McGraw- Hill International
Editions,1995 ( UNIT 2& III)
Reference Book and other Elaine Rich and Kelvin knight

materials
1. ,“ArtificialIntelligence”,McGraw- Hill 2000
David E. Goldberg, “Genetic Algorithms-In Search,
2. optimization and Machine
Learning”, Pearson Education.
Robert J. Schalkoff, “Artificial Neural
3. Networks”, McGraw-Hill Internation
Editions,1997.
4. Freeman J.A. & D.M. Skapura , “Neural Networks:
Algorithms, Applications and ProgrammingTechniques”,
Addison Wesley, 1992.
5. G.J. Klir & B. Yuan, “Fuzzy Sets & Fuzzy Logic”, PHI,
1995.
6. Melanie Mitchell , “An Introduction to Genetic Algorithm”,
PHI, 1998.
1.
L T P C
CS3033 NASSCOM Associate Analytics 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
 To introduce the terminology, technology and its applications

 To introduce the concept of Analytics for Business
 To introduce the tools, technologies & programming languages which is used in day to day
analytics cycle
Associate Analytics – I

HOURS
UNIT-I Introduction to Analytics and R programming (NOS 2101) 9
Introduction to R, R Studio (GUI): R Windows Environment, introduction to
various data types, Numeric, Character, date, data frame, array, matrix etc.,
Reading Datasets, Working with different file types .txt,.csv etc. Outliers,
Combining Datasets, R Functions and loops.
Summary Statistics - Summarizing data with R, Probability, Expected,
Random, Bivariate Random variables, Probability distribution. Central Limit
Theorem etc.
UNIT-II SQL using R & Correlation and Regression Analysis (NOS 2101) 9
Introduction to NoSQL, Connecting R to NoSQL databases. Excel and R
integration with R connector.
Regression Analysis, Assumptions of OLS Regression, Regression Modelling.
Correlation, ANOVA, Forecasting, Heteroscedasticity, Autocorrelation,
Introduction to Multiple Regression etc.
UNIT-III Understand the Verticals - Engineering, Financial and others (NOS 2101) 9
Understanding systems viz. Engineering Design, Manufacturing, Smart
Utilities, Production lines, Automotive, Technology etc.
Understanding Business problems related to various businesses
UNIT-IV Manage your work to meet requirements (NOS 9001) 9

Understanding Learning objectives, Introduction to work & meeting
requirements, Time Management, Work management & prioritization, Quality
& Standards Adherence,
UNIT-V Work effectively with Colleagues (NOS 9002) 9

Introduction to work effectively, Team Work, Professionalism, Effective
Communication skills, etc.
Associate Analytics – II
HOURS
UNIT-I Data Management & Introduction to Big Data Tools (NOS 2101) 9
Design Data Architecture and manage the data for analysis, understand various
sources of Data like Sensors/signal/GPS etc.
Export all the data onto Cloud ex. AWS/Rackspace etc.
Introduction to Big Data tools like Hadoop, Spark, Impala etc., Data ETL
process, Identify gaps in the data and follow-up for decision making.
UNIT-II Big Data Analytics & Machine Learning Algorithms (NOS 2101) 9
Run descriptive’ s to understand the nature of the available data, collate all the
data sources to suffice business requirement, Run descriptive statistics for all
the variables and observer the data ranges, Outlier detection and elimination.
Hypothesis testing and determining the multiple analytical methodologies,
Train Model on 2/3 sample data using various Statistical/Machine learning
algorithms, Test model on 1/3 sample for prediction etc.
UNIT-III Data Visualization (NOS 2101) 9

Prepare the data for Visualization, Use tools like Tableau, QlickView and D3,
Draw insights out of Visualization tool.
UNIT-IV Maintain Healthy, Safe & Secure Working Environment (NOS 9003) 9
Introduction, workplace safety, Report Accidents & Emergencies, Protect
health & safety as your work, course conclusion, assessment
UNIT-V Provide Data/Information in Standard Formats (NOS 9004) 9

Introduction, Knowledge Management, Standardized reporting & compliances,
Decision Models, course conclusion. Assessment
Associate Analytics – III

HOURS
UNIT-I Introduction to Predictive Analytics & Linear Regression (NOS 2101) 9
What and Why Analytics, Introduction to Tools and Environment, Application
of Modelling in Business, Databases & Types of data and variables, Data
Modelling Techniques, Missing imputations etc.
Need for Business Modelling, Regression – Concepts, Blue property-
assumptions-Least Square Estimation, Variable Rationalization, and Model
Building etc.
UNIT-II Logistic Regression Objective Segmentation (NOS 2101) 9

Model Theory, Model fit Statistics, Model Conclusion, Analytics applications
to various Business Domains etc.
Regression Vs Segmentation – Supervised and Unsupervised Learning, Tree
Building – Regression, Classification, Overfitting, Pruning and complexity,
Multiple Decision Trees etc.
UNIT-III Time Series Methods/Forecasting, Feature Extraction (NOS 2101) 9

Arima, Measures of Forecast Accuracy, STL approach, Extract features from
generated model as Height, Average, Energy etc and Analyze for prediction.
UNIT-IV Working with Documents (NOS 0703) 9

Standard Operating Procedures for documentation and knowledge sharing,
Defining purpose and scope documents, Understanding structure of documents
– case studies, articles, white papers, technical reports, minutes of meeting etc.,
Style and format, Intectual Property and Copyright, Document preparation
tools – Visio, PowerPoint, Word, Excel etc., Version Control, Accessing and
updating corporate knowledge base, Peer review and feedback.
UNIT-V Develop Knowledge, Skill and Competences (NOS 9005) 9

Introduction to Knowledge skills & competences, Training & Development,
Learning & Development, Policies and Record keeping, etc.
LEARNING OUTCOME:
 Understand the concept of Analytics for Business.
 Understand the tools, technologies & programming languages which is used in day to day
analytics cycle.
Learning Resources
Text Book 1. NASSCOMM
Reference Book and other
materials
L T P C
CS3020 DISTRIBUTED OPERATING SYSTEM 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
This course makes the student to know about basic concepts of Distributed operating system.

HOURS
UNIT-I INTRODUCTION TO DISTRIBUTED SYSTEM 9
Definition, Characteristics of Distributed system, Design issues, Resource sharing
and the Web Challenges, System models - Architectural and fundamental models
-Networking and internetworking Communication in distributed system: Layered
protocols, ATM networks, Client –Server model, Remote Procedure Calls and
Group Communication.
UNIT-II CONCURRENCY CONTROL 9

Clock synchronization, Mutual Exclusion, Election algorithm, the Bully
algorithm, a Ring algorithm, Transactions - Nested transactions - Locks -
Optimistic concurrency control - Timestamp ordering - Comparison - Flat and
nested distributed transactions - Atomic commit protocols - Concurrency control
in distributed transactions
UNIT-III DEADLOCK 9
Deadlock in Distributed Systems, Distributed Deadlock Prevention, Distributed
Deadlock Detection, Threads, System models, Processors Allocation, Scheduling
in Distributed System, Real Time Distributed Systems.
UNIT-IV DISTRIBUTED FILE SYSTEM 9

Distributed file systems: Distributed file system Design, Distributed file system
Implementation, Trends in Distributed file systems. Distributed Shared Memory:
What is shared memory, Consistency models, Page based distributed shared
memory, shared variables distributed shared memory.
UNIT-V SECURITY 9
Overview of security techniques, Cryptographic algorithms ,Digital signatures ,
Cryptography pragmatics, Replication , System model and group
communications, Fault tolerant services, Highly available services , Transactions
with replicated data
LEARNING OUTCOME:
1. Knowledge and understanding
a. Outline the potential benefits of distributed systems
b. Summarize the major security issues associated with distributed systems along with the range
of techniques available for increasing system security
2. Cognitive skills (thinking and analysis).
a. Apply standard design principles in the construction of these systems
b. Select appropriate approaches for building a range of distributed systems, including some that
employ middleware
3. Communication skills (personal and academic).
4. Practical and subject specific skills (Transferable Skills).
Learning Resources
Text Book 1. Andrew S. Tanenbaum, Maartenvan Steen, Distibuted
Systems, ―Principles and Pardigms, Pearson Education,
2002.
2. George Coulouris, Jean Dollimore and Tim Kindberg,
―Distributed Systems Concepts and Design, 3rd Edition,
Pearson Education, 2002.
Reference Book and other 1. Tanenbaum and Steen, Distributed Systems PHI, 2002.
materials 2. Sape Mullender, Distributed Systems 2nd Edition, Addison
Wesley, 1993.
3. Albert Fleishman, Distributed Systems: Software Design
and Implementation, Springer Verlag, 1994.
4. M. L. Liu, Distributed Computing Principles and
Applications, Pearson Education, 2004.
5.
L T P C
CS3022 SYSTEM SOFTWARE 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
To have an understanding of foundations of design of assemblers, loaders, linkers, and

Macro processors.

HOURS
System software and machine architecture – The Simplified Instructional

Computer (SIC) - Machine architecture - Data and instruction formats - addressing
modes - instruction sets - I/O and programming.
UNIT-II ASSEMBLERS 10
Basic assembler functions - A simple SIC assembler – Assembler algorithm and
data structures - Machine dependent assembler features - Instruction formats and
addressing modes – Program relocation - Machine independent assembler features
- Literals – Symbol-defining statements – Expressions - One pass assemblers and
Multi pass assemblers - Implementation example - MASM assembler.
UNIT-III LOADERS AND LINKERS 9

Basic loader functions - Design of an Absolute Loader – A Simple Bootstrap
Loader - Machine dependent loader features - Relocation – Program Linking –
Algorithm and Data Structures for Linking Loader - Machine-independent loader
features - Automatic Library Search – Loader Options - Loader design options -
Linkage Editors – Dynamic Linking – Bootstrap Loaders - Implementation
example - MSDOS linker.
UNIT-IV MACRO PROCESSORS 9

Basic macro processor functions - Macro Definition and Expansion – Macro
Processor Algorithm and data structures - Machine-independent macro processor
features - Concatenation of Macro Parameters – Generation of Unique Labels –
Conditional Macro Expansion – Keyword Macro Parameters-Macro within Macro-
Implementation example - MASM Macro Processor – ANSI C Macro language.
UNIT-V SYSTEM SOFTWARE TOOLS 9

Text editors - Overview of the Editing Process - User Interface – Editor Structure.
- Interactive debugging systems - Debugging functions and capabilities –
Relationship with other parts of the system – User-Interface Criteria.
LEARNING OUTCOME:
On completion of this course, the students will be able to

1. To understand the relationship between system software and machine architecture.
2. To know the design and implementation of assemblers
3. To know the design and implementation of linkers and loaders.
4. To have an understanding of macro processors.
5. To have an understanding of system software tools.
Learning Resources
Text Book Leland L. Beck, “System Software – An Introduction to Systems Programming”, 3r
d
Edition, Pearson Education Asia, 2006.
REFERENCE . D. M. Dhamdhere, “Systems Programming and Operating Systems”, Second
S Revised Edition, Tata McGraw-Hill, 2000.
2. John J. Donovan “Systems Programming”, Tata McGraw-Hill Edition, 2000.
3. John R. Levine, Linkers & Loaders – Harcourt India Pvt. Ltd., Morgan Kaufma
nn
Publishers, 2000.
L T P C
CS 3024 SOFTWARE PROJECT MANAGEMENT 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
To learn & implement the various concepts of Software development phases

HOURS
UNIT-I INTRODUCTION TO SOFTWARE PROJECT MANAGEMENT 9
Project Definition – Contract Management – Activities Covered By Software
Project
Management – Overview of Project Planning – Stepwise Project Planning
UNIT-II PROJECT EVALUATION 9
Strategic Assessment – Technical Assessment – Cost Benefit Analysis –Cash
Flow Forecasting – Cost Benefit Evaluation Techniques – Risk Evaluation.
UNIT-III ACTIVITY PLANNING 9

Objectives – Project Schedule – Sequencing and Scheduling Activities –Network
Planning Models – Forward Pass – Backward Pass – Activity Float – Shortening
Project Duration – Activity on Arrow Networks – Risk Management – Nature Of
Risk – Types Of Risk – Managing Risk – Hazard Identification – Hazard Analysis
– Risk Planning And Control.
UNIT-IV MONITORING AND CONTROL 9

Creating Framework – Collecting The Data – Visualizing Progress – Cost
Monitoring Earned Value – Priortizing Monitoring – Getting Project Back To
Target – Change Control – Managing Contracts – Introduction – Types Of
Contract – Stages In Contract Placement – Typical Terms Of A Contract –
Contract Management – Acceptance.
UNIT-V MANAGING PEOPLE AND ORGANIZING TEAMS 9

Introduction – Understanding Behavior – Organizational Behaviour: A
Background –Selecting The Right Person For The Job – Instruction In The Best
Methods – Motivation– The Oldman – Hackman Job Characteristics Model –
Working In Groups – Becoming A Team –Decision Making – Leadership –
Organizational Structures – Stress –Health And Safety – Case Studies.
LEARNING OUTCOME:

1. Describe and apply basic concepts related to software project planning, scope and feasibility.
2. Analyze various project estimation techniques, especially size estimation (FP), effort estimation
(COCOMO models), schedule estimation (GANTT charts), and cost estimation.
3. Illustrate the concept of team structure and project communication management.
4. Acquire knowledge about quality assurance, quality control, and risk management.
5. Describe various project management activities such as tracking, project procurement, configuration
management, monitoring.
Learning Resources
Text Book Bob Hughes, Mikecotterell, “Software Project Management”,
Third Edition, Tata McGraw Hill, 2004.
Reference Book and other 2. Ramesh, Gopalaswamy, "Managing Global

materials Projects", Tata McGraw Hill, 2001.
3. Royce, “Software Project Management”, Pearson
Education, 1999.
4. Jalote, “Software Project Management in
Practice”, Pearson Education, 2002.
L T P C
CS 3026 GRID COMPUTING 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
To understand the technology application and tool kits for grid computing

HOURS
UNIT-I INTRODUCTION AND OVERVIEW OF GRID COMPUTING 9
Early Grid Activities-Current Grid Activities-An Overview of Grid Business
Areas-Grid Applications-Grid Infrastructure
UNIT-II WEB SERVICES AND RELATED TECHNOLOGIES 9

Oriented Architecture-Web Service Architecture-XML, Related Technologies and
Their Relevance to Web services-XML Messages and Enveloping–,-Service
Message Description Mechanisms-Relationship between Web Service and Grid
Service – Web Service Interoperability and the Role of the WS-I Organization
UNIT-III DISTRIBUTED OBJECT TECHNOLOGY FOR GRID COMPUTING 9

(OGSA)
Introduction to Open Grid Services Architecture (OGSA)- Commercial Data
Center- National Fusion Collaboratory- The OGSA Platform Components
UNIT-IV OPEN GRID SERVICES INFRASTRUCTURE (OGSI) 9

Introduction-Grid Services-A High-Level Introduction to OGSI – Introduction to
Service Data Concepts – Grid Service: Naming and Change Management
Recommendations.
UNIT-V OGSA BASIC SERVICES AND THE GRID COMPUTING TOOLKITS 9
Common Management Model (CMM)-Security Architecture- GLOBUS GT3

Toolkit: Architecture- GLOBUS GT3 Toolkit: - Architecture, Programming
model, High level services.
LEARNING OUTCOME:

1. To understand the genesis of grid computing
2. To know the application of grid computing
3. To understand the technology and tool kits for facilitating grid computing
4. be able to evaluate enabling technologies such as high-speed links and storage area networks for
building computer grids;
5. be able to utilise grid computing and clustering middleware, such as Parallel Virtual Machine
(PVM), Message Passing Interface (MPI), HPC Portals, and Peer-to-Peer networks for
implementing virtual super computing resources;
6. be able to design a grid computing application in one of the key application areas e.g. Computer
Animation, E-Research;
7. be able to install a grid computing environment; develop communications skills and accept the
code of professional conduct and practice through short presentations and group work.
Learning Resources
Text Book 1. Joshy Joseph & Craig Fellenstein, “Grid
Computing”, Pearson/PHI PTR-2003.
Reference Books 1. Ahmar Abbas, “Grid Computing: A Practical Guide to

technology and Applications”, Charles River media –
2003.
L T P C
CS3028 OBJECT ORIENTED ANALYSIS & DESIGN 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
This course separates and makes explicit the decisions that make up an object oriented analysis and
design. We show how to use the UML notations most effectively both to discuss designs with
colleagues, and in documents.

HOURS
Categories of Information systems, traditional paradigm Vs Object oriented
paradigm – Objects and Classes, Inheritance, Object relationship – Examples of
UML class modeling, Unified Process – Iteration and incrementation within the
unified process
UNIT-II DECISION TREE LEARNING 9
Overview of requirements – Initial understanding of the domain – Business Model
– Requirements workflow – Osbert Oglesby case study- MSG Foundation case
study – revising the requirements – MSG Foundation case study Continuing the
requirements workflow Refining the– MSG Foundation case study - revised
requirements – MSG Foundation case study.
UNIT-III 10
OBJECT ORIENTED ANALYSIS
Extracting entity classes – Initial dynamic model – Extracting control classes-
refining use cases – incrementing the class diagram – Initial dynamic model –
MSG Foundation case study – revising the entity classes- Extracting – USE case
realization – MSG Foundation case study – incrementing the class diagram – more
on use cases - risk
UNIT-IV 10
OBJECT ORIENTED DESIGN WORKFLOW
Design workflow – format of the attributes – allocation of operations – Osbert
Oglesby case study – Workflows of the unified process – Phases of the unified
process – class diagrams – Use case diagrams – Interaction diagrams – state charts
– package diagrams – Deployment diagrams
UNIT-V TESTING AND MANAGEMNET ISSUES 8

Quality issues – Non execution based testing – execution based testing – cost
benefit analysis – risk analysis – Improving the process - Metrics – CPM/PERT _-
Choice of programming language – Reuse case studies – Portability – planning
and estimating duration and cost – testing the project management plan –
maintenance and the object oriented paradigm - CASE Tools for maintenance
LEARNING OUTCOME:
1. Understanding Object Basics, Classes and Objects, Inheritance
2. How software objects are altered to build software systems that are more robust
3. Gaining enough competence in object-oriented analysis and design (OOAD) to tackle a complete
object oriented project
4. Understanding the issues and options in reuse
5. Using UML, a common language for talking about requirements, designs, and component interfaces
Learning Resources
Text Book 1. 1 S. R Schach, Introduction to Object Oriented analysis
and Design, Mc Graw Hill, 2003
2. Ali Bahrami , “Object Oriented System Development”,
McGraw Hill International Edition, 1999.
Reference Book and other 1. 1. Booch G., “Object Oriented Analysis and Design”,
materials Addison Wesley Publishing Company, 2nd Edition, 2000.
2. Rambaugh.J, Blaha. M. Premerlani.W, Eddy F and
Loresen W, “Object Oriented Modeling
andDesign”,Prentice Hall of India, 1997.
3. Coad P, Yourdon E., “Object oriented analysis”, Yourdon
Press, 1991.
L T P C
CS3030 NEURAL NETWORKS & FUZZY LOGIC 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
To cater the knowledge of Neural Networks and Fuzzy Logic and use these for controlling real time
systems.

HOURS
UNIT-I ARCHITECTURE 9
Artificial Neuron Model, Operations of Artificial Neuron, Types of Neuron
Activation Function, ANN Architectures, Classification Taxonomy of ANN -
Connectivity, Learning Strategy (Supervised, Unsupervised, Reinforcement),
Learning Rules.
UNIT-II SINGLE LAYER & MULTI- LAYER FEED FORWARD NETWORKS 9

Introduction, Perceptron Models: Discrete, Continuous and Multi-Category,
Training Algorithms: Discrete and Continuous Perceptron Networks, Limitations
of the Perceptron Model. Generalized Delta Rule, Algorithm,
Kolmogorov Theorem, Learning Difficulties and Improvements.
UNIT-III ASSOCIATIVE MEMORIES 9

Paradigms of Associative Memory, Pattern Mathematics, Hebbian Learning,
General Concepts of Associative Memory, Bidirectional Associative Memory
(BAM) Architecture, Architecture of Hopfield Network: Discrete and Continuous
Neural network applications
UNIT-IV FUZZY SYSTEMS 9

Classical sets- Fuzzy sets-Fuzzy relations-Fuzzification – Defuzzification- Fuzzy
rules.
UNIT-V FUZZY LOGIC CONTROL 9

Membership function – Knowledge base-Decision –making logic – Optimizations
of membership function using neural networks-Adaptive fuzzy systems-
Introduction to generate to genetic algorithm.
LEARNING OUTCOME:
1. To Expose the students to the concepts of feed forward neural networks
2. To provide adequate knowledge about feedback networks.
3. To teach about the concept of fuzziness involved in various systems.
4. To provide adequate knowledge about fuzzy set theory.
5. To provide comprehensive knowledge of fuzzy logic control and adaptive fuzzy logic and to design
the fuzzy control using genetic algorithm.
6. To provide adequate knowledge of application of fuzzy logic control to real time systems.
Learning Resources
Text Book 1. J.M. Zurada, “Introduction to artificial neural
systems”, Jaico Pub.
2. Simon Haykin, “Neural Networks”, PHI
Reference Book and other 1. Laurene Fausett, "Fundamentals of Neural Networks",
materials Pearson Education, 2004.
2. Simon Haykin, "Neural Networks- A comprehensive
foundation", Pearson
Education, 2003.
3. S. N. Sivanandam, S. Sumathi, S. N. Deepa "Introduction
to Neural Networks
using MATLAB 6.0", TATA Mc Graw Hill, 2006.
4. S. Rajasekharan and G. A. Vijayalakshmi Pai, "Neural
Networks, Fuzzy logic,
Genetic algorithms: synthesis and applications", PHI
Publication, 2004.
5. Timothy J. Ross, " Fuzzy Logic With Engineering
Applications", Tata McGraw-
Hill Inc. 2000
L T P C
CS 3032 CYBER SECURITY 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
To aware the students about the cyber security and its implications

HOURS
UNIT-I 9
INTRODUCTION
Cyber-attacks, types of attacks, Introduction to cyber security, objectives of
security, elements of cyber security, Introduction to Information Security,
Introduction to Data and Network Security, Finding vulnerabilities and exploits.
UNIT-II INTRUSION DETECTION SYSTEMS 9

Overview of intrusions, system intrusion process, dangers of system intrusions,
anomaly detection, misuse detection, types of IDS, the limitations and open
problems of intrusion detection systems, Statistical and machine approaches to
detection of attacks on computers, Techniques for studying the Internet attacks,
network based attacks, host based attacks.
UNIT-III SECURITY IN CLOUD COMPUTING 9

What is Cloud Computing, Essential Characteristics, Cloud security challenges,
Software as a service security, secure software development life cycle, data usage,
data privacy, identity access management, physical security.
UNIT-IV DATA PRIVACY 9
Fundamental Concepts, Definitions, Data Privacy Attacks, Data linking and
profiling, access control models, role based access control, privacy in different
domains- medical, financial, etc.
UNIT-V CRYPTOGRAPHY 9
Services, mechanisms and attacks, the OSI security architecture, Network security
Model, classical Encryption techniques, Private and Public Key Cryptography.
LEARNING OUTCOME:
1. Define the concept of ethical hacking and its associated applications in Information Communication
Technology (ICT) world.
2. Underline the need of digital forensic and role of digital evidences.
3. Explain the methodology of incident response and various security issues in ICT world, and identify
digital forensic tools for data collection.
4. Recognize the importance of digital forensic duplication and various tools for analysis to achieve
adequate perspectives of digital forensic investigation in various applications /devices like
Windows/Unix system.
5. Apply the knowledge of IDS to secure network and performing router and network
analysis
6. List the method to generate legal evidence and supporting investigation reports and will also be able to
use various digital forensic tools
Learning Resources
Text Books 1. Michael T. Goodrich and Roberto Tamassia, “Introduction to
Computer Security”, Addison Wesley, 2011.
2. B. Raghunathan, “The Complete Book of Data
Anonymization: From Planning to Implementation”,
Auerbach Pub, 2013.
3. John W. Rittinghouse, “Cloud Computing: Implementation
Management & Security”, CRC Press.
4. Roberto Di Pietro, Luigi V. Mancini, “Intrusion Detection
System”, Springer ,2008
5. William Stallings-“Cryptography and Network Security”,
Pearson education, 6th edition, SBN 10: 0133354695, 2013.
6.
Reference Books 7. Russell Dean Vines and Ronald L. Krutz ,”Cloud Security: A
Comprehensive Guide To Secure Cloud Computing”, Wiley
India Pvt Ltd, 2010.
8. Anderson, James P., "Computer Security Threat Monitoring
and Surveillance," Washing, PA, James P. Anderson Co.,
1980.
9. L. Sweeney, “Computational Disclosure Control: A Primer on
Data Privacy Protection”, MIT Computer Science, 2002.
10.
L T P C
CS 4019 NETWORK SECURITY & CRYPTOGRAPHY 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
To learn & implement the various concepts of network security

HOURS
UNIT-I Introduction Plain text and cipher text, substitution techniques, transposition 8
techniques, encryption and decryption, symmetric and asymmetric key
cryptography.
UNIT-II Number Theory – Prime number – Modular arithmetic – Euclid’s algorithm - 9

Fermet’s and Euler’s theorem – Key distribution – Key management – Diffie
Hellman key exchange Symmetric key algorithms: introduction, algorithms types
and modes, DES, AES.
Asymmetric key algorithms: introduction, history of asymmetric key
cryptography, RSA symmetric and asymmetric key cryptography together, Digital
signature.
UNIT-III 10
Internet security protocols: basic concepts, Secure Socket Layer (SSL), Transport
Layer Security (TLS), Secure Hyper Text Transfer protocol (SHTTP), Time
Stamping Protocol (TSP), Secure Electronic Transaction (SET), SSL versus SET,
Email Security.
UNIT-IV User Authentication and Kerberos: Introduction, Authentication basics, Passwords, 9

authentication tokens, certificate based authentication
UNIT-V Intruder– Intrusion detection system Virus and related threats Countermeasures – 9
Firewalls
design principles – Trusted systems – Practical implementation of cryptography
and security
LEARNING OUTCOME:

1. Comprehend and implement various cryptographic algorithms to protect the confidential data.
2. Identify network vulnerabilities and apply various security mechanisms to protect networks from
security attacks.
3. Apply security tools to locate and fix security leaks in a computer network/software.
4. Secure a web server and web application
5. Configure firewalls and IDS
Learning Resources
Text Book 1. Cryprotography and Network Security, 2nd Edition
by Atul Kahate, TMH
2. Network Management Principles & Practices by
Subramanian, Mani (AWL)
3. SNMP, Stalling, Willian (AWL)
Reference Book and other 1. SNMP: A Guide to Network Management (MGH)
materials 2. Telecom Network Management by H.H. Wang (MGH)
3. Network Management by U. Dlack (MGH)
L T P C
Course Code: CS 4021 Subject Name: BIG DATA & ANALYTICS 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
1. Introduce students the concept and challenge of big data (3 V’s: volume, velocity, and variety).
2. Teach students in applying skills and tools to manage and analyze the big data.

HOURS
UNIT-I Big Data and its importance, Four Vs, Drivers for Big data, Big data analytics, Big 9
data applications. Algorithms using map reduce, Matrix-Vector Multiplication by
Map Reduce, Basic Statistics, Descriptive Statistics, Frequency Distributions,
Histograms, Shapes of Distributions, Measures of Central Tendency Computing
the Mean, Measuring Variability, Measures of Relationship, Regression,
Reliability Indices, Standard Scores (Zscores),Inferential Statistics, Populations
and Samples
UNIT-II The Null Hypothesis, Chi-Square and T-Test, Statistical Decisions, Making 9
Process, Testing for Mean Differences, Power of a Statistical Test, Statistical
versus Practical Significance, Effect Size, MetaAnalysis.
UNIT-III Data Visualization: Meaning and significance, Traits of Meaning full Data, Brief 9
History of Information Visualization, Power of visual perception, Making abstract
data Visible, Building Blocks of information Visualization. Analytical Techniques.
UNIT-IV Big Data, In-Memory Processing, limitations of In Memory Processing. Big Data 9
Privacy, Big data Visualization, Map Reduce algorithm, OLAP and its
applications, Data Mining Process, Knowledge Discovery, Decision Support
Systems
UNIT-V Apache Hadoop & Hadoop EcoSystem – Moving Data in and out of Hadoop – 9
Understanding inputs and outputs of MapReduce, Hadoop Architecture, Hadoop
Storage: HDFS, Common Hadoop Shell commands, Anatomy of File Write and
Read., NameNode, Secondary NameNode, and DataNode, Hadoop MapReduce
paradigm, Map and Reduce tasks, Job, Task trackers - Cluster Setup – SSH &
Hadoop Configuration – HDFS Administering –Monitoring & Maintenance.
LEARNING OUTCOME:
1. Explain the motivation for big data systems and identify the main sources of Big Data in the real world.
2. Demonstrate an ability to use frameworks like Hadoop, NOSQL to efficiently store retrieve and process
Big Data for Analytics.
3. Implement several Data Intensive tasks using the Map Reduce Paradigm
4. Apply several newer algorithms for Clustering Classifying and finding associations in Big Data
5. Design algorithms to analyze big data like streams, Web
Learning Resources
Text Book 1. Stephen Few, “Now You See It: Simple Visualization
Techniques for Quantitative Analysis” Publisher: Jonathan G
Koomey
2. Frank J. Ohlhorst, “Big Data Analytics: Turning Big Data
into Big Money Publisher : Wiley
Reference Book and other 6. Gelman, Andrew, and Jennifer Hill. Data Analysis Using
materials Regression and Multilevel/Hierarchical Models. 1st ed.
Cambridge, UK: Cambridge University Press, 2006. ISBN:
9780521867061.
7. Gelman, Andrew, John B. Carlin, Hal S. Stern, and Donald
B. Rubin. Bayesian Data Analysis. 2nd ed. New York, NY:
Chapman & Hall, 2003. ISBN: 9781584883883
L T P C
Course Code: CS 4023 Subject Name: WIRELESS ADHOC AND SENSOR NETWORK 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
This course covers major aspects of ad hoc and sensor networking, from design through performance
issues to application requirements. It starts with the design issues and challenges associated with
implementations of ad hoc and sensor network applications. This includes mobility, disconnections, and
battery power consumption. The course provides a detailed treatment of proactive, reactive, and hybrid
routing protocols in mobile wireless networks. It also covers the IEEE 802.11 Wireless LAN and
Bluetooth standards and discusses their characteristics and operations. About half of the course time is
spent on wireless sensor networks (architecture, design, protocols, and applications). Through a project,
the course gives students hands-on experience in designing a mobile ad hoc network using the NS2
network simulator

HOURS
UNIT-I AD HOC Wireless 9
Introduction, Mobile Ad Hoc Networks, Technologies for Ad Hoc Network, Issues
in Ad hoc wireless Networks IEEE 802.11 Architecture and protocols. Protocol for
AD HOC Wireless Networks. Issues and classification of MAC protocol, other
MAC protocols, Dynamic Source Routing (DBR), Adhoc Distance Vector (AoDV)
routing, Routing Protocols
UNIT-II Transport Layer & Security Protocols 9
Issues in designing transport layer protocols, TCP over Ad Hoc Wireless Networks,
Network Security Attacks
UNIT-III Wire Sensor Networks 9
Basic Sensor Network Architectural Elements, Applications of Sensor Networks,
Comparison with Ad Hoc Wireless Networks, Challenges and Hurdles.
Architecture of WSNs Hardware components, Operating systems and execution
environments, some examples of sensor nodes, Network Architecture, Sensor
networks scenarios, Optimization goals and figures of merit Design principles for
WSNs.
UNIT-IV Communication Protocols 9
Physical Layer and Transceiver design considerations in WSNs, Fundamentals of
(wireless) MAC protocol, Address and name management in wireless sensor
networks, Localization and positioning Routing protocols Data Dissemination
and Gathering, Routing Challenges and Design Issues in Wireless, Routing
Strategies in Wireless Sensor Networks
UNIT-V Transport & QoS in WSN 9
Data-Centric and Contention-Based Networking – Transport Layer and QoS in
Wireless Sensor Networks – Congestion Control in network processing –
Operating systems for wireless sensor networks – Examples
LEARNING OUTCOME:
1. Student has an understanding of the principles of mobile ad hoc networks (MANETs) and what
distinguishes them from infrastructure-based networks.
2. Student have an understanding of the principles and characteristics of wireless sensor networks
(WSNs).
3. Student understand how proactive protocols function and their implications on data transmission
delay and bandwidth consumption.
4. Student understands how reactive routing protocols function and their implications on data
transmission delay and bandwidth consumption.
5. Student understands how proactive routing protocols function and their implications on data
6. Student understand how reactive routing protocols function and their implications on data
7. Student are familiar with the mechanisms for implementing security and trust mechanisms in
MANETs and WSNs.
8. Student have acquired skills to design and implement a basic mobile ad hoc or wireless sensor
network via simulations or programming of PDAs.
Learning Resources
Text Book 1. Ad Hoc Wireless Networks: Architectures and
Protocols, Prentice Hall PTR, 2007.
2. Protocols & Architectures for Wireless Sensor
Networks, Wiley, 2005
L T P C
Course Code: CS 4025 Subject Name: DATA WAREHOUSING & DATA MINING 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
To understand and discuss the development in the area of Data warehousing and Data Mining Techniques.

HOURS
UNIT-I Concept of Data warehouse, usage and trends. DBMS vs data warehouse, Data 9
marts, Metadata, Multidimensional data mode, Data cubes, Schemas for
Multidimensional Database: stars, snowflakes and fact constellations.
Data warehouse process & architecture, OLTP vs OLAP, ROLAP vs MOLAP,
types of OLAP, servers, 3-Tier data warehouse architecture, distributed and virtual
data warehouses, data warehouse manager.
UNIT-II Data Warehouse Architecture: Two and Three tier Data Warehouse architecture. 9
Types of OLAP Services, ROAP versus MOAM versus HOAP. Distributed and
Virtual Data warehouse, Data warehouse Manager.
Data warehouse implementation, computation of data cubes, modelling OLAP
data, OLAP queries manager, data warehouse back end tools, complex aggregation
at multiple granularities, tuning and testing of data warehouse.
UNIT-III Introduction to Data mining, KDD versus data mining, data mining techniques, 9
tools and applications. Data mining query languages, data specification, specifying
knowledge, hierarchy specification, pattern presentation & visualisation
specification, data mining languages and standardisation of data mining.
UNIT-IV Data mining techniques: Association rules, Clustering techniques, Decision tree 9
knowledge discovery through Neural Networks & Genetic Algorithm, Rough Sets,
and Support Victor Machines and Fuzzy techniques.
UNIT-V Mining complex data objects, Spatial databases, Multimedia databases, Time series 9
and Sequence data; mining Text Databases and mining Word Wide Web.
LEARNING OUTCOME:
1. Data pre-processing and data quality.
2. Modeling and design of data warehouses.
3. Algorithms for data mining.
Learning Resources
Text Book 1. Data Warehousing In the Real World; Sam Anahory &
Dennis Murray; 1997, Pearson
2. Data Mining- Concepts & Techniques; Jiawei Han &
Micheline Kamber- 2001, Morgan Kaufmann.
3. Data Mining Techniques; Arun Pujari; 2001, University
Press; Hyderbad.
Reference Book and other 1. Data Mining; Pieter Adriaans & Dolf Zantinge; 1997,
materials Pearson,
2. Data Warehousing, Data Miniing and OLTP; Alex Berson,
1997, Mc Graw Hill.
3. Data warehousing System; Mallach; 2000, Mc Graw Hill.
4. Building the Data Warehouse; W.H. Inman, 1996, John
Wiley & Sons.
5. Developing the Data Warehouses; W.H Ionhman,C.Klelly,
John Wiley & Sons.
6. Managing the Data Warehouses; W.H.Inman, C.L.Gassey,
John Wiley & Sons.
L T P C
Course Code: CS 4027 Subject Name: MOBILE COMPUTING 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
An introduction to mobile computing with a strong emphasis on its working concepts and models. It
discuss Dimensions of Mobile Computing, Condition of the Mobile User, Architecture of Mobile Software
Applications and provide introduction to Mobile Development Frameworks.

HOURS
UNIT-I Overview of Ad Hoc Networks: Why Ad Hoc Networks?, Challenges, and benefits 9
of Mobile Computing, Breakthrough Technology, Wireless Computing, Nomadic
Computing, Mobile Computing, Pervasive Computing, Invisible Computing,
Wearable Computing, Applications of mobile computing
UNIT-II Wireless and Mobile Computing Models, LAN Protocols: IEEE 802.11/a /g/n & 9
Bluetooth, Data Management Issues. Sensor Networks- Challenges, Architecture,
and Applications.
UNIT-III Routing: Taxonomy, Applications, Challenges in Mobile Environments, Hidden 9
and exposed terminal problems, Routing Protocols- Proactive, Reactive, and
Hybrid protocols, Dynamic State Routing (DSR), Ad hoc On-Demand Distance
Vector (AODV), Destination Sequenced Distance – Vector Routing (DSDV), and
Cluster Based Routing Protocol (CBRP), and Temporally Ordered Routing
algorithm (TORA), Directed-diffusion, Low Energy Adaptive Clustered
Hierarchical (LEACH) routing protocol.
UNIT-IV Distributed location and data management: Mobile IP- Problem with Mobility, 9
Terminology, Operation, Tunneling, Data transfer to the mobile system, Transport
Control Protocol (TCP) Over wireless- Indirect TCP (I-TCP), Snoop TCP, Mobile
TCP (M-TCP), Data management issues, Data delivery models, Broadcast disks,
data replication, Data caching and design issues, Air indexing, Transaction
processing in mobile computing environment.
UNIT-V Mobile Agents: Introduction to Mobile Agents, Mobile agents vs. Client server, 9
Agent migration and design issues, Mobile agent communication, Mobile Agent
Security – Security Requirements and Cryptographic Techniques, Taxonomy of
Possible Attacks – Malicious Agents, Malicious Agencies, Protecting Mobile
Agents - Preventing Attacks on Mobile Agents, Detecting Attacks on Mobile
Agents, Protecting Agencies - Agent Authentication and Authorization.
LEARNING OUTCOME:
1. Grasp the concepts and features of mobile computing technologies and applications
2. Have a good understanding of how the underlying wireless and mobile communication networks work,
their technical features, and what kinds of applications they can support
3. Identify the important issues of developing mobile computing systems and applications
4. Organize the functionalities and components of mobile computing systems into different layers and
apply various techniques for realizing the functionalities
5. Develop mobile computing applications by analyzing their characteristics and requirements, selecting
the appropriate computing models and software architectures, and applying standard programming
languages and tools
6. Organize and manage software built for deployment and demonstration.
Learning Resources
Text Book 2. Charles E. Perkins, Ad hoc Networks, Addison Wesley, 2008.
3. Mazliza Othman, Principles of mobile computing and
communications, Auerbach Publications, 2007.
L T P C
Course Code: CS 4029 Subject Name: MACHINE LEARNING 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
This course provides a broad introduction to machine learning and statistical pattern recognition. It offers
some of the most cost-effective approaches to automated knowledge acquisition in emerging data-rich
disciplines and focuses on the theoretical understanding of these methods, as well as their computational
implications.
HOURS
Well-Posed learning problems, Basic concepts, Designing a learning system,
Issues in machine learning. Types of machine learning: Learning associations,
Supervised learning (Classification and Regression Trees, Support vector
machines), Unsupervised learning (Clustering), Instance-based learning (K-nearest
Neighbor, Locally weighted regression, Radial Basis Function), Reinforcement
learning (Learning Task, Q-learning, Value function approximation, Temporal
difference learning).
UNIT-II DECISION TREE LEARNING 9
Decision tree representation, appropriate problems for decision tree learning,
Univariate Trees (Classification and Regression), Multivariate Trees, Basic
Decision Tree Learning algorithms, Hypothesis space search in decision tree
learning, Inductive bias in decision tree learning, Issues in decision tree learning.
UNIT-III BAYESIAN LEARNING 9
Bayes theorem and concept learning, Bayes optimal classifier, Gibbs algorithms,
Naive Bayes Classifier, Bayesian belief networks, The EM algorithm.
UNIT-IV GENETIC ALGORITHMS 9
Basic concepts, Hypothesis space search, Genetic programming, Models of
evolution and learning, Parallelizing Genetic Algorithms.
UNIT-V INDUCTIVE AND ANALYTICAL LEARNING 9
Learning rule sets, Comparison between inductive and analytical learning,
Analytical learning with perfect domain theories: Prolog-EBG.
InductiveAnalytical approaches to learning, Using prior knowledge to initialize
hypothesis (KBANN Algorithm), to alter search objective (Tangent Prop and
EBNN Algorithm), to augment search operators (FOCL Algorithm).
LEARNING OUTCOME:
1. Analyze methods and theories in the field of machine learning and provide an introduction to the basic
principles, techniques, and applications of machine learning, classification tasks, decision tree
learning.
2. Apply decision tree learning, bayesian learning and artificial neural network in real world problems.
3. Understand the use of genetic algorithms and genetic programming.
4. Apply inductive and analytical learning with perfect domain theories.
5. Critically evaluate and compare different learning models and learning algorithms and be able to adapt
or combine some of the key elements of existing machine learning algorithms to design new algorithms
as needed.
Learning Resources
Text Book 1. Mitchell T.M., Machine Learning, McGraw Hill (1997).
2. Alpaydin E., Introduction to Machine Learning, MIT Press
(2010).
Reference Book and other 1. Bishop C., Pattern Recognition and Machine Learning,
materials Springer-Verlag (2006).
2. Michie D., Spiegelhalter D. J., Taylor C. C., Machine Learning,
Neural and Statistical Classification. Overseas Press (2009).
L T P C
Course Code: CS 4031 Subject Name: OPEN SOURCE SOFTWARE 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
Introduces concepts, principles and applications of open source software. Discuss about open source
software development process. Cover economy, business, societal and intellectual property aspects of
open source software. Obtain hands‐on experiences on open source software and related tools thr0ugh
developing various open source software applications such as mobile applications and Web applications.

HOURS
UNIT-I PHILOSOPHY 6
Linux, GNU and Freedom, Brief history of GNU, Licensing free software – GPL
and copy Left, trends and potential – global and Indian, overview and usage of
various Linux Distributions – user-friendliness perspective – scientific perspective
UNIT-II SYSTEM ADMINISTRATION 10
GNU and Linux installation – Boot process, Commands Using bash features, The
man pages, files and file systems, File security, Partitions, Processes, Managing
processes, I/O redirection, Graphical environment, Installing software, Backup
techniques
UNIT-III FOSS PROGRAMMING PRACTICES 10
GNU debugging tools, Using source code versioning and managing tools, Review
of common programming practices and guidelines for GNU/Linux and FOSS,
Documentation
UNIT-IV PROGRAMMING TECHNIQUES 10
Application programming - Basics of X Windows server architecture - QT
programming - GTK + Programming- Python programming - Open source
equivalent of existing Commercial software
UNIT-V PROJECTS AND CASE STUDIES 9
Linux for portable Devices, Creation of Bootable CD and USB from command
line, Case Studies - Samba, Libreoffice, Assistive technology
LEARNING OUTCOME:
1. Understand concepts, strategies, and methodologies related to open source software development.
2. Understand the business, economy, societal and intellectual property issues of open source software.
3. Be familiar with open source software products and development tools currently available on the
market.
4. Be able to utilize open source software for developing a variety of software applications, particularly
Web applications.
Learning Resources
Text Book 3. Ellen Siever, Stephen Figgins, Robert Love, Arnold Robbins,
Linux in a nutshell, Sixth edition, OReilly media, September
2009.
Reference Book and other 1. Philosophy of GNU URL: http://www.gnu.org/philosophy/
materials 2. Version control system, URL: http://git-scm.com/
3. SVN version control, URL: http://svnbook.red-bean.com
L T P C
Course Code: CS 4033 Subject Name: SOFTWARE TESTING 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
1. Basic software debugging methods.

2. White box testing methods and techniques.
3. Black Box testing methods and techniques.
4. Designing test plans.
5. Different testing tools (familiar with open source tools)
6. Quality Assurance models.

HOURS
What is software testing and why it is so hard? Basic Definitions: Error, Fault,
Failure, Incident, Test Cases, Testing Process, Limitations of Testing.
UNIT-II TESTING TECHNIQUES 9

White –Box &Black –Box Testing, Boundary Value Analysis, Equivalence Class
Testing, Decision table based Testing, Cause-Effect Graph Technique, Cyclomatic
Complexity Analysis.
UNIT-III REDUCING THE NUMBER OF TEST CASES 9

Prioritization guidelines, Priority category, Scheme, Risk Analysis, Regression
Testing, Slice based testing, Regression Testing
Testing Activities: Unit Testing, Levels of Testing, Integration Testing,
Debugging, Domain Testing.
UNIT-IV SYSTEM TESTING 9

Verification and Validation Testing, Alpha Testing, Beta Testing, Stress Testing,
Load Testing, Volume Testing, Usability testing, Bug, Bug life cycle.
UNIT-V TESTING TOOLS 9

Static Testing Tools, Dynamic Testing Tools, Characteristics of Modern Tools.
LEARNING OUTCOME:
1. Investigate the reason for bugs and analyse the principles in software testing to prevent and remove
bugs.
2. Implement various test processes for quality improvement
3. Design test planning.
4. Manage the test process
5. Apply the software testing techniques in commercial environment
6. Use practical knowledge of a variety of ways to test software and an understanding of some of the
tradeoffs between testing techniques
Learning Resources
Reference Book and other 11. Effective Methods for Software Testing, William E. Perry,
materials John Wiley and Sons,
12. Effective Software Testing: 50 Specific Ways to Improve
Your Testing, Dustin, Pearson Education, 2002.
13. An Integrated Approach to Software Engineering, Pankej
Jalote, Narosa Publishing House, New Delhi 1997.
14. The Art of Software Testing, Glenford J.Myers, John Wiley &
Sons, 1979.
15. Software Testing: A Craftman's Approach, P. C. Jorgensen,
CRC Press, 1995.
16. Software Testing Techniques, Boris Beizer, Dreamtech, 2006.
17. Software Testing: Principles and Practices, Srinivasan
Desikan, Gopalaswamy Ramesh, Pearson Education, 2008.
18. Software Testing, Aditya P. Mathur, Pearson Education, 2008.
19. Software Testing: Principle, Techniques and Tools, M. G.
Limaye, Tata McGraw Hill, 2009.
L T P C
Course Code: CS 4035 Subject Name: ADVANCED JAVA PROGRAMMING 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
1. To learn Java Applets, Beans and Networking concepts

2. To learn Advanced Java Networking concepts
3. To learn the JDBC and Graphics in Java

HOURS
UNIT-I INTRODUCTION TO ADVANCED JAVA 8
Java Streaming – Components and events handling – Threading concepts –
Networking features – Byte code interpretation – Media Techniques.
UNIT-II JAVA APPLETS AND BEANS 9

Applets and HTML – Bean Concepts – Events in Bean Box – Bean customization
and persistence – JavaScript – Combining scripts and Applets – Applets over web
- Animation techniques – Animating images.
UNIT-III ADVANCED NETWORKING 10
Client- Sever computing – Sockets – Content and Protocols handlers – Developing
distributed applications – RMI – Remote objects – Object serialization
UNIT-IV JAVA DATABASE PROGRAMMING 9
Connecting to Databases – JDBC principles – Databases access – Interacting –
Database search – Accessing Multimedia databases – Database support in Web
applications.
UNIT-V RELATED JAVA TECHNIQUES 9
3D graphics – JAR file format and creation – Internationalization – Swing
Programming – Advanced Java Scripting Techniques.
LEARNING OUTCOME:
1. Learn the Internet Programming, using Java Applets
2. create a full set of UI widgets and other components, including windows, menus, buttons,
checkboxes, text fields, scrollbars and scrolling lists, using Abstract Windowing Toolkit (AWT) &
Swings
3. Apply event handling on AWT and Swing components.
4. learn to access database through Java programs, using Java Data Base Connectivity (JDBC)
5. Create dynamic web pages, using Servlets and JSP.
6. Make a resusable software component, using Java Bean.
7. Invoke the remote methods in an application using Remote Method Invocation (RMI).
8. Understand the multi-tier architecture of web-based enterprise applications using Enterprise
JavaBeans (EJB).
9. Develop Stateful, Stateless and Entity Beans.
10. Use Struts frameworks, which gives the opportunity to reuse the codes for quick
development.
11. Map Java classes and object associations to relational database tables with Hibernate mapping files
Learning Resources
Text Book 4. Jame Jaworski, “Java Unleashed”, SAMS Techmedia
Publications, 1999.
5. H.M.Deitel and P.J.Deitel, “Java how to program with an
Introduction to Visual J++”, Pearson Education, 1998.
Reference Book and other 1. Campione, Walrath and Huml, “The Java Tutorial”, Addison
materials Wesley, 1999.
2. Duane A.Bailey, “Java Structures”, McGraw-Hill
Publications, 1999.
3. Jeff Frentzen and Sobotka, ‘Java Script”, Tata McGraw-Hill,
1999.
4. Jamie Jaworski, “Java Unleashed”, SAMS Techmedia
Publication, 1999.
5. Jason Blooberg. Jeff Kawski, and Paul Treffers, “Web
Page Scripting Techniques”,Hayden books, 1996.
SYLLABUS OF OPEN ELECTIVES
L T P C
Course Code: 20LE0201 Subject Name: GERMAN LANGUAGE – I 2 0 0 2
Co-requisite:
COURSE OBJECTIVE:-
Enabling the Engineering Students to one more Foreign Language, especially German, which is scientific
and technical language. This may be useful in the field of employment opportunities as well as helping
them to develop projects on browsing German websites.

HOURS
UNIT-I Topics: Alphabet 10
Aussprache
Zahlen
Zeit
Vocabulary: Zahlen
Zeitangaben (Uhrzeit, Tag, Wochentage, Monate, usw.)
UNIT-II Topics: Über Personen sprechen (Name, Land, Stadt, Sprache, 10
Alter, Beruf, Familie, usw.)
Grammar: Personalpronomen im Nominativ
Konjugation von regelmäßigen Verben im Präsens
(wohnen, lernen, arbeiten, usw.)
Konjugation von unregelmäßigen Verben im Präsens (sein,
haben, heißen, lesen, sprechen, usw.)
Possessiv-Artikel
Wortposition, Aussagen, W-Fragen, Ja-Nein-Fragen
Vocabulary: Deutsche Familiennamen und Vornamen

Namen von Ländern, Städten und Sprachen
Berufsbezeichnungen
Familienmitglieder
UNIT-III Topics: Über Sachen sprechen 10
Essen und Trinken
Grammar: Bestimmter Artikel, Unbestimmter Artikel, kein
(Nominativ)
Singular und Plural
Personalpronomen im Akkusativ
Bestimmter Artikel, Unbestimmter Artikel, kein
(Akkusativ)
Vocabulary: Sachen des täglichen Lebens (Haus, Möbel, Schreibwaren,
Lebensmittel, usw.)
Einige allgemeine Adjektive und Adverbien, Gegenteile,
Farben
LEARNING OUTCOME:
1. Developing pronunciation so that they can read the text and e-mail during their employment,
instructing them to write their own C V and developing a fundamental conversation with any German
national.
Learning Resources
Reference Book and other 1. Rosa-Maria Dallapiazza, u.a.: Tangram aktuell 1 (Lektion 1-
materials 4, Lektion 5-8, Übungsheft und Glossar). Max Hueber Verlag
1. Wolfgang Hieber: Lernziel Deutsch, Teil 1. Max Hueber
Verlag
2. Korbinian Braun, u.a.: Deutsch als Fremdsprache IA,
Grundkurs. Ernst Klett Stuttgart
3. Christiane Lemcke, u.a.: Moment mal, Teil 1: Langenscheidt
4. Ulrike Albrecht, u.a.: Passwort Deutsch 1. Ernst Klett
Sprachen
5. Rolf Brüseke: Starten Wir! A1. München: Hueber Verlag
L T P C
Course Code: 20LE0205 Subject Name: FRENCH LANGUAGE PHASE I 2 0 0 2
Co-requisite:
COURSE OBJECTIVE:-
1. The course develops oral and written skills of understanding, expressing and exchanging Information
/interacting.
2. The course develops the ability to construct sentences and frame questions.
3. French language provides a competitive edge in career choices.
Sujets:
 L’Alphabet
 Le Prounciation
 Les Nombres
 Décrire votre pays, ville,
 Les Professions
 Parler de choses
 L’Heure
 Les Repas et les boissons
Grammaire:
 Le Nom et le pluriel des noms

 Les Articles
 Les Adjectifs Possessifs
 Les Adjectifs Qualificatifs
 Les Verbes(Regular,irregular, pronominaux)
 Les Pronoms Sujets
 Les Prepositions
 L’interrogation
Lexique
 Se présenter
 Présenter quelq’un
 Les nationalités
 Les Pays
 Les Nombres
 Parler des jours de la semaine
 Les mois de l’année
 Les Professions
 Les Couleurs
 Les Contraires
 Les phrase avec l’heure
LEARNING OUTCOME:
1. To read and write short, simple texts.
2. To understand a dialogue between two native speakers and also to take part in short, simple
conversations using the skills acquired.
3. Fluency in reading and writing.
Learning Resources
Reference Book and other 1. Nathan verbs conjugasion
materials 2. Larrouse French to English Dictionary
L T P C
Course Code: 20LE0202 Subject Name: GERMAN LANGUAGE II 2 0 0 2
Co-requisite:
COURSE OBJECTIVE:-
Enabling the Engineering Students to one more Foreign Language, especially German, which is scientific
and technical language. This may be useful in the field of employment opportunities as well as helping
them to develop projects on browsing German websites.

HOURS
UNIT-I Topics: Einkaufen 10
Tagesablauf
Grammar: Trennbare und untrennbare Verben
Dativ
Modalverben
Vocabulary: Kleidung
Haushaltswaren
Sachen zum Essen und Trinken
Maßeinheiten
UNIT-II Topics: Reisen 10
Ortsangaben und Richtungen
Grammar: Imperativ
Präpositionen mit Dativ und Akkusativ
Wechselpräpositionen
Vocabulary: Verkehrsmittel
Namen von Orten und Sehenswürdigkeiten
Information über Deutschland
UNIT-III Topics: Ereignisse der Vergangenheit erzählen 10
Lebenslauf
Grammar: Präteritum von sein, haben
Perfekt
Vocabulary: Erweiterung des Wortschatzes von verschiedenen
Bereichen
Ordinalzahlen
LEARNING OUTCOME:
1. Developing pronunciation so that they can read the text and e-mail during their employment,
instructing them to write their own C V and developing a fundamental conversation with any German
national.
Learning Resources
Reference Book and other 1. Rosa-Maria Dallapiazza, u.a.: Tangram aktuell 1 (Lektion 1-
materials 4, Lektion 5-8, Übungsheft und Glossar). Max Hueber Verlag
2. Wolfgang Hieber: Lernziel Deutsch, Teil 1. Max Hueber
Verlag
3. Korbinian Braun, u.a.: Deutsch als Fremdsprache IA,
Grundkurs. Ernst Klett Stuttgart
4. Christiane Lemcke, u.a.: Moment mal, Teil 1: Langenscheidt
5. Ulrike Albrecht, u.a.: Passwort Deutsch 1. Ernst Klett
Sprachen
6. Rolf Brüseke: Starten Wir! A1. München: Hueber Verlag
L T P C
Course Code: 20LE0206 Subject Name: FRENCH LANGUAGE PHASE II 2 0 0 2
Co-requisite:
COURSE OBJECTIVE:-
 A language skills are as valuable as technical skills a Knowledge of French enables the graduates in
career orientation.
 As a second International global Language after English there is a wider choice of job opportunities
in the International employment market and also multinationals in India and an understanding of
French culture through language.
Sujets:
 La France

 Le Fromage, le vin
 Les saisons
 Les recettes
 Indiquer un chemin
 Demander la direction
 Donner des indications
 Le corps
 Les elements du passé
 Raconteur une journée
Grammaire:
 La negation
 L’imperatif
 Le passé recent
 Le future
 Le passé compose
 L’imparfait
 Les nombres ordinaux
Lexique:
 Les vêtements
 Les animaux
 Parler de prix
 Le corps
 Vocabulaire de la gare et du train
 Le voyage
 Les achats
LEARNING OUTCOME:
1. A strong awareness of the culture of the countries where the language is spoken.
2. A passion for languages and a commitment to the subject.
3. The ability to use language creatively and spontaneously.
4. An Independence in their studies and the ability to draw upon a wide range of resources.
5. Fluency in reading.
6. Fluency and Imagination in writing.
L T P C
Course Code: 20MA 3005 Subject Name: COMPUTER BASED NUMERICAL AND 3 1 0 4
STATISTICAL TECHNIQUES
Co-requisite:
COURSE OBJECTIVE:-
To impart analytical ability in solving mathematical problems as applied to the respective branches of
Engineering.

HOURS
UNIT-I NUMERICAL SOLUTION OF EQUATIONS, FINITE DIFFERENCES 9
AND INTERPOLATION
Bisection Method, Newton-Raphson method - Gauss Elimination method - Gauss

Jacobi method - Gauss Seidel method. First and Higher order differences - Forward
differences and backward differences and Central Differences - Differences of a
polynomial - Properties of operators - Factorial polynomials - Shifting operator E
- Relations between the operators. Interpolation - Newton-Gregory Forward and
Backward Interpolation formulae - Divided differences - Newton's Divided
difference formula - Lagrange's Interpolation formula –Inverse Interpolation.
UNIT-II NUMERICAL DIFFERENTIATION AND INTEGRATION 9
Numerical Differentiation and Integration: Newton's forward and backward
differences formulae to compute first and higher order derivatives - The
Trapezoidal rule - Simpson's one third rule and three eighth rule.
UNIT-III NUMERICAL SOLUTIONS OF ORDINARY DIFFERENTIAL 9
EQUATIONS
Solution by Taylor's series - Euler's method - Improved and modified Euler method
- Runge-Kutta methods of fourth order (No proof) - Milne's Method.
UNIT-IV STATISTICS – I 9
Moments - Skewness and kurtosis based on moments - Linear correlation and
regression. Probability and probability distributions: Binomial distribution,
Possion distribution, Normal distribution.
UNIT-V STATISTICS – II 9
Large sample tests based on Normal Distribution – Small sample tests based on t,
F distributions – Chi square tests for goodness of fit and independence of attributes.
LEARNING OUTCOME:
1. To the familiar with numerical solution of equations
2. To get exposed to finite differences and interpolation
3. To be thorough with the numerical Differentiation and integration
4. To find numerical solutions of ordinary differential equations
5. Be thorough with probability concepts and the corresponding distributions.
6. Get exposed to the testing of hypothesis using distributions
.
Learning Resources
Text Book 1. B.S. Grewal, Numerical Methods, Khanna Publishers, 6th
edition,
(Unit I - Chapter 5 Section 5.3, 5.5, 5.6, 5.8, Chapter 2
Section 2.1, 2.9, 2.10, 2.12, Chapter 3 Section 3.4 (4),
3.5(1,2), Chapter 4 Section 4.2 Unit II - Chapter 7 Section
7.1, 7.2, 7.4, 7.12 - 7.14 Chapter 6 Section 6.6, 6.7 Unit III -
Chapter 8 Section 8.2, 8.10 (1,2), 8.41 - 8.43 Unit IV -
Chapter 10 Section 10.3 - 10.6, 10.8 - 10.10 Unit V -
Chapter 11 section 11.3 - 11.6, 11.8, 11.9(1,2), 11.11,11.12).
2. Davi Prasad, An Introduction to Numerical Analysis, Narsoa
Publishing House, New Delhi, 2010
Reference Book and other 1. Dr. M.K. Venkataraman, Numerical Methods in Science and
materials Engineering, National Publishing Co., 1999
2. Gerald C. F., Wheatley P. O., Applied Numerical Analysis,
Pearson, 2011.
3. Arumugam S., Isaac A. T., Somasundaram A., Numerical
Methods, Scitech Publications Pvt. Ltd, 2009.
4. S.S. Sastry, Introductory Methods of Numerical Analysis,
2001
5. E. Balagurusamy, Computer Oriented Statistical and
Numerical Methods - Tata McGraw Hill., 2000
6. , M.K.Jain, SRK Iyengar and R.L.Jain, Numerical Methods
for Scientific and Engineering Computation, Wiley Eastern
Ltd., 1987
7. M.K.Jain, Numerical Solution of Differential Equations,
1979
8. Dr.P.Kandasamy etal., Numerical Methods, S.Chand & Co.,
New Delhi, 2003
L T P C
Course Code: MB 3001 Subject Name: ENGINEERING ECONOMICS AND 3 1 0 4
MANAGEMENT
Co-requisite:
COURSE OBJECTIVE:-
To expose the students on Economics and management aspects

HOURS
Introduction to management: - Nature and scope of management - Functions-
Planning-Organizing - Staffing-Leading-controlling, Role and Importance of
Economics for Engineers, Law of demand and supply, Break-even analysis,
pricing Policies.
UNIT-II PRODUCTION AND MANAGEMENT 9
Production & Management - Plant location – Factors Influencing location –
Process – Methods-Procedures – Production routing, scheduling, Production
Costs, Inventory and Controlling Techniques.
UNIT-III MANAGERIAL ECONOMICS 9

Managerial economics for Industry-Demand-Types-Supply-Factors-Determining
Demand-Elasticity of Demand-Forecasting Methods-Utility-Theories of Utility -
Pricing - Methods of Pricing, Cost determination, Balance Sheet, Cost benefit
analysis.
UNIT-IV ENGINEERING ETHICS 9
Engineering Ethics - Social experimentation - Responsibility for safety - Collective
bargaining - Global issues, Environmental Ethics, Sample Code & Conducts
UNIT-V ACCOUNTING AND FINANCE 9

Accounting for Management - Concepts, Conventions - Introduction to financial
statements - tools and techniques of Financial Statements - Budget and Budgetary
control - Cost Concepts - Financial information System.
LEARNING OUTCOME:
1. To apply theoretical economic concepts to practical business situation and to take decision in the
Industrial Engineering Situation.
Learning Resources
Text Book 1. Koontz, “Essential of Management”, McGraw Hill
Publishing Company, International edition.
2. Dr.S.N.Maheswari, “Financial and Management
Accounting”, sultan chand & sons, New delhi., 1998.
3. Mike Martin, Roland Sehinzinger, “Ethics in
Engineering”, Mc Graw Hill New Yord, 1996.
Reference Book and other 1.
materials
L T P C
Course Code: MB 3003 Subject Name: INDUSTRIAL MANAGEMENT 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
To expose the students on Industrial management aspects

HOURS
UNIT-I Introduction to Management: Entrepreneurship and organization - Nature and 9
Importance
of Management, Functions of Management, Taylor’s Scientific Management
Theory, Fayol’s Principles of Management, Maslow’s Theory of Human Needs,
Douglas McGregor’s Theory X and Theory Y, Herzberg’s Two-Factor Theory of
Motivation, Systems Approach to Management, Leadership Styles, Social
responsibilities of Management
UNIT-II Designing Organizational Structures: Departmentation and Decentralization, 9
Types of Organization structures - Line organization, Line and staff organization,
functional organization, Committee organization, matrix organization, Virtual
Organization, Cellular Organization, team structure, boundary less organization,
inverted pyramid structure, lean and flat organization structure and their merits,
demerits and suitability.
UNIT-III Operations Management: Objectives- product design process- Process selection- 9
Types of
Production system (Job, batch and Mass Production),-Plant location-factors-
Urban-Rural
sites comparison- Types of Plant Layouts-Design of product layout- Line balancing
(RPW method) Value analysis-Definition-types of values- Objectives- Phases of
value analysis- Fast diagram
UNIT-IV Work Study: Introduction – definition – objectives – steps in work study – Method 9
study –definition – objectives – steps of method study. Work Measurement –
purpose – types of study – stop watch methods – steps – key rating – allowances –
standard time calculations –work sampling.
Statistical Quality Control: variables-attributes, Shewart control charts for
variables- X
chart, R chart, - Attributes-Defective-Defect- Charts for attributes-p-chart -c chart
(simple
Problems), Acceptance Sampling- Single sampling- Double sampling plans-OC
curves.
UNIT-V Job Evaluation: methods of job evaluation – simple routing objective systems – 9
classification method – factor comparison method – point method – benefits of job
evaluation and limitations.
Project Management (PERT/CPM): Network Analysis, Programme Evaluation
and Review Technique (PERT), Critical Path Method (CPM), Identifying critical
path,
Probability of Completing the project within given time, Project Cost Analysis,
Project
Crashing. (Simple problems)
LEARNING OUTCOME:
1. Students will be able to perform the Management Functions.
2. Students will be able to compare selected Theories of Management.
3. Students will be able to perform the functions in the Marketing Mix.
4. Students will be able to use basic Business Application Software.
5. Students will be able to assess ethical issues in Business situations.
Learning Resources
Text Book 1. Industrial Engineering and Management/O.P. Khanna/Khanna
Publishers
2. Industrial Engineering and Management Science/T.R. Banga
and S. C. Sarma/Khanna
Publishers
Reference Book and other 1. Motion and Time Study by Ralph M Barnes/ John Willey & Sons
materials Work Study by ILO
2. Human factors in Engineering & Design/Ernest J McCormick /
TMH
3. Production & Operation Management /Paneer Selvam /PHI
4. Industrial Engineering Management/NVS Raju/Cengage
Learning
5. Industrial Engineering Hand Book /Maynard
6. Industrial Engineering Management / Ravi Shankar/ Galgotia
L T P C
Course Code: MB 3005 Subject Name: RELIABILITY AND QUALITY MANAGEMENT 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
1. Introduce The Concept Of SQC
2. To Understand Process Control And Acceptance Sampling Procedure And Their Application.
3. To Learn The Concept Of Reliability

HOURS
UNIT-I INTRODUCTION AND PROCESS CONTROL FOR VARIABLES 9
Introduction, Definition of Quality, Basic Concept Of Quality, Definition Of SQC,
Benefits And Limitation of SQC, Quality Assurance, Quality Control: Quality
Cost-Variation In Process Causes Of Variation –Theory Of Control Chart- Uses Of
Control Chart – Control Chart For Variables – X Chart, R Chart and  Chart -
Process Capability – Process Capability Studies And Simple Problems. Six Sigma
Concepts
UNIT-II PROCESS CONTROL FOR ATTRIBUTES 9
Control Chart For Attributes –Control Chart For Non-Conforming– P Chart and Np
Chart – Control Chart For Nonconformities– C And U Charts, State Of Control And
Process Out Of Control Identification In Charts, Pattern Study
UNIT-III ACCEPTANCE SAMPLING 9
Lot By Lot Sampling – Types – Probability of Acceptance in Single, Double,
Multiple Sampling Techniques – O.C. Curves – Producer’s Risk and Consumer’s
Risk. AQL, LTPD, AOQL Concepts-Standard Sampling Plans for AQL and LTPD-
Uses Of Standard Sampling Plans.
UNIT-IV LIFE TESTING– RELIABILITY 9
Life Testing – Objective – Failure Data Analysis, Mean Failure Rate, Mean Time
To Failure, Mean Time Between Failure, Hazard Rate – Weibull Model, System
Reliability, Series, Parallel and Mixed Configuration – Simple Problems.
Maintainability and Availability – Simple Problems. Acceptance Sampling Based
On Reliability Test – O.C Curves.
UNIT-V QUALITY AND RELIABLITY 9
Reliability Improvements – Techniques- Use of Pareto Analysis – Design For
Reliability – Redundancy Unit and Standby Redundancy – Optimization in
Reliability – Product Design – Product Analysis – Product Development – Product
Life Cycles
LEARNING OUTCOME:
1. Apply the Concept of SQC in Process Control for Reliable Component Production
Learning Resources
Text Book 1. Douglas.C. Montgomery, “Introduction to Statistical Quality
Control”, 4th Edition, John Wiley 2001.
2. Srinath. L.S., “Reliability Engineering”, Affiliated East West
Press, 1991.
Reference Book and other 1. John.S. Oakland. “Statistical Process Control”, 5th Edition,
materials
Elsevier, 2005
2. Connor, P.D.T.O., “Practical Reliability Engineering”,
John Wiley, 1993
L T P C
Course Code: ET 3001 Subject Name: PRODUCTION AND OPERATION MANAGEMENT 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
To familiarize and knowledge on production and operations management principles in manufacturing.

HOURS
UNIT-I PRODUCTION SYSTEMS 9
Nature, Importance and organizational function. Characteristics of Modern
Production and Operations function. Organization of Production function. Recent
Trends in Production and Operations Management. Role of Operations in Strategic
Management. Production and Operations strategy – Elements and Competitive
Priorities. Nature of International Operations Management.
UNIT-II PROJECT AND FACILITY PLANNING 9
Project Management – Scheduling Techniques, PERT, CPM, Crashing CPM
networks – Simple Problems. Facility Location – Theories, Steps in Selection,
Location Models – Simple Problems. Facility Layout – Principles, Types, Planning
tools and techniques.
UNIT-III MATERIALS MANAGEMENT 9
Objectives, Planning, Budgeting and Control. Overview of Materials Management
Information Systems (MMIS). Purchasing – Objectives, Functions, Policies,
Vendor rating and Value Analysis. Stores Management – Nature, Layout,
Classification and Coding. Inventory – Objectives, Costs and control techniques.
Overview of JIT.
UNIT-IV STATISTICAL QUALITY CONTROL 9
Control Charts – Mean, Range, Number of Defectives, Number of Defects Charts,
OC Curves, Acceptance Sampling-Work Study – Method Study – Symbols, Charts,
Diagrams. Time Study
UNIT-V SUPPLY CHAIN 9
Decision Phases, Process View- Supplier- Manufacturer-Customer chain- Supply
chain drivers and modeling systems- strategic sourcing- In- sourcing and Out-
sourcing- supply chain network design- Sourcing and Inventory Management.
LEARNING OUTCOME:
1. Apply problem-solving and critical-thinking skills as required in materials and operations
management.
2. Recognize and apply basic appropriate analytical techniques related to decision making in supply
chains, inventory theory, and inventory control systems.
Learning Resources
Text Book 1. Richard Francis, L. Leon McGinnis, F. Jr., John White, A.,
“Facility Layout and Location - an Analytical Approach”, 2nd
Ed, Phi Learning Publisher, 2006
2. Ebert J Ronald, Adams E Everett, “Production and
Operations Management”, 5th edition, Phi Learning
Publisher, 2009
3. Norman Gaither and Gregory Frazier, “Operations
Management”, South Western Cengage Learning, 2002.
4. Elwood S. Buffa, Rakesh K. Sarin, “Modern
Production/Operations Management”, 8 th Ed., Wiley
Publisher, 2007.
Reference Book and other 1. Donald J. Bowersox, David J. Closs and M. Bixby Cooper,
materials “Supply Chain Logistics Management”, Tata McGraw Hill,
2008
2. Joseph Monks, “Operations Management”, 2 nd Ed., Tata
McGraw-Hill Education.
3. Mahadevan. B, “Operations Management Theory and
practice”,Pearson Education, 2007.
L T P C
Course Code: ET 3003 Subject Name: ENTREPRENEURSHIP DEVELOPMENT 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
1. To develop and strengthen entrepreneurial quality and motivation in students
2. To impart basic entrepreneurial skills and understanding
3. To run a business efficiently and effectively.
HOURS
UNIT-I ENTREPRENEURSHIP 9
Entrepreneur – Types Of Entrepreneurs – Difference Between Entrepreneur And
Entrepreneur Entrepreneurship In Economic Growth, Factors Affecting
Entrepreneurial Growth.
UNIT-II MOTIVATION 9
Major Motives Influencing An Entrepreneur – Achievement Motivation Training,
Self-Rating, Business Games, Thematic Apperception Test – Stress Management,
Entrepreneurship Development Programs – Need, Objectives.
UNIT-III BUSINESS 9
Small Enterprises – Definition, Classification – Characteristics, Ownership
Structures – Project Formulation – Steps Involved In Setting Up A Business –
Identifying, Selecting A Good Business Opportunity, Market Survey And
Research, Techno Economic Feasibility Assessment – Preparation Of Preliminary
Project Reports – Project Appraisal – Sources Of Information – Classification Of
Needs And Agencies.
UNIT-IV FINANCING AND ACCOUNTING 9
Need – Sources Of Finance, Term Loans, Capital Structure, Financial Institution,
Management Of Working Capital, Costing, Break Even Analysis, Taxation –
Income Tax, Excise Duty – Sales Tax.
UNIT-V SUPPORT TO ENTREPRENEURS 9
Sickness In Small Business – Concept, Magnitude, Causes And Consequences,
Corrective Measures – Business Incubators – Government Policy For Small Scale
Enterprises – Growth Strategies In Small Industry – Expansion, Diversification,
Joint Venture, Merger And Sub Contracting.
LEARNING OUTCOME:
1. Gain Knowledge and Skills needed to run a Business Successfully.
Learning Resources
Text Book 1. Khanka. S.S., “Entrepreneurial Development” S.Chand &
Co. Ltd. Ram Nagar, New Delhi, 2013.
2. Donald F Kuratko, “Entrepreneurship – Theory, Process and
Practice”, 9th Edition, Cengage Learning 2014.
Reference Book and other 1. Hisrich R D, Peters M P, “Entrepreneurship” 8th Edition,
materials
Tata McGraw-Hill, 2013.
2. Mathew J Manimala, “Entrepreneurship Theory At Cross
Roads: Paradigms And Praxis” 2nd Edition Dream Tech,
2005.
L T P C
Course Code: ET 3005 Subject Name: NON-CONVENTIONAL ENERGY RESOURCES 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
It introduces solar energy its radiation, collection, storage and application. It also introduces the Wind
energy, Biomass energy, geothermal energy and ocean energy as alternative energy sources.

HOURS
UNIT-I PRINCIPLES OF SOLAR RADIATION: 9
Role and potential of new and renewable source, the solar energy option,
Environmental impact of solar power, physics of the sun, the solar constant, extra-
terrestrial and terrestrial solar radiation, solar radiation on titled surface, instruments
for measuring solar radiation and sun shine, solar radiation data.
UNIT-II SOLAR ENERGY COLLECTION: 9
Flat plate and concentrating collectors, classification of concentrating collectors,
orientation and thermal analysis, advanced collectors.
SOLAR ENERGY STORAGE AND APPLICATIONS: Different methods,
Sensible, latent heat and stratified storage, solar ponds. Solar Applications- solar
heating/cooling technique, solar distillation and drying, photovoltaic energy
conversion.
UNIT-III WIND ENERGY: 9
Sources and potentials, horizontal and vertical axis windmills, performance
characteristics, Betz criteria
BIO-MASS: Principles of Bio-Conversion, Anaerobic/aerobic digestion, types of
Bio-gas digesters, gas yield, combustion characteristics of bio-gas, utilization for
cooking, I.C Engine operation and economic aspects.
UNIT-IV GEOTHERMAL ENERGY: 9
Resources, types of wells, methods of harnessing the energy, potential in India.
OCEAN ENERGY: OTEC, Principles utilization, setting of OTEC plants,
thermodynamic cycles. Tidal and wave energy: Potential and conversion
techniques, mini-hydel power plants, and their economics.
UNIT-V DIRECT ENERGY CONVERSION: 9
Need for DEC, Carnot cycle, limitations, principles of DEC. Thermoelectric
generators, seebeck, peltier and joul Thomson effects, Figure of merit, materials,
applications, MHD generators, principles, dissociation and ionization, hall effect,
magnetic flux, MHD accelerator, MHD Engine, power generation systems, electron
gas dynamic conversion, economic aspects. Fuel cells, principles, faraday’s law’s,
thermodynamic aspects, selection of fuels and operating conditions.
LEARNING OUTCOME:
1. Acquired knowledge about different energy resources.
2. Ability to convert the energy from one form to another form.
Learning Resources
Text Book 1. Non-Conventional Energy Sources /G.D. Rai
2. Renewable Energy Technologies /Ramesh & Kumar
/Narosa:
Reference Book and other 1. Renewable energy resources/ Tiwari and Ghosal/ Narosa.
materials 2. Non-Conventional Energy / Ashok V Desai /Wiley Eastern.
L T P C
Course Code: ET 3007 Subject Name: NANOTECHNOLOGY 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
The objective of this course is to make students familiar with the important concepts applicable to small
electronic devices, their fabrication, characterization and application.

HOURS
UNIT-I LIMITATIONS OF CMOS 9
Fundamentals of MOSFET devices - Scaling of CMOS – Limitations – Alternative
concepts in materials – Structures of MOS devices: SOI MOSFET, FINFETS,
Dual Gate MOSFET, Ferro electric FETs.
UNIT-II MICRO AND NANO FABRICATION 9
Optical Lithography – Electron beam Lithography – Atomic Lithography –
Molecular beam epitaxy - Nano lithography.
UNIT-III CHARACTERIZATION EQUIPMENTS 9
Principles of Electron Microscopes – Scanning Electron Microscope –
Transmission Electron Microscope - Atomic Force Microscope – Scanning
Tunneling Microscope
UNIT-IV NANO DEVICES – I 9
Resonant tunneling diodes – Single electron devices – Josephson junction – Single
Flux Quantum logic – Molecular electronics.
UNIT-V NANO DEVICES – II 9
Quantum computing: principles – Qrbits – Carbon nanotubes (CNT):
Characteristics, CNTFET, Application of CNT - Spintronics: Principle, Spin valves,
Magnetic Tunnel Junctions, Spin FETs, MRAM.
LEARNING OUTCOME:
1. The various opportunities in the emerging field of nano electronics and nano technologies
Learning Resources
Text Book 1. Rainer Waser (Ed.), “Nano electronics and information
technology”, Wiley- VCH, Edition II, 2005.
Reference Book and other 1. Thomas Heinzel, “A Microscopic Electronics in Solid State
materials Nanostructure”, Wiley- VCH.
2. Mick Wilson, Kamali Kannangara, Geoff Smith, Michelle
Simmons and Burkhard Raguse “Nanotechnology – (Basic
Science and Emerging Technologies)”, Overseas Press.
3. Mark Ratner and Daniel Ratner, “Nanotechnology: A
Gentle Introduction to the Next Big Idea”, Pearson
education, 2003.
L T P C
Course Code: 20MA0410 Subject Name: Probability & Statistics 3 1 0 4
Co-requisite:
COURSE OBJECTIVE:-
1. Probability and Random variables
2. Discrete and Continuous probability distributions
3. The concepts of Stochastic Process
4. Correlation and Regression Analysis
5. Hypothesis testing and Quality Control
HOURS
UNIT-I PROBABILITY AND RANDOM VARIABLES 9
Probability theory - Random Variables, discrete random variables; probability
mass functions; continuous random variables, probability density functions,
Expectation, Moments - Moment generating function, Characteristics function.
UNIT-II DISCRETE & CONTINUOUS PROBABILITY DISTRIBUTION 9
Bernouli distribution, Binomial distribution, Poisson distribution, Geometric
distribution, Exponential distribution, Normal distributions, functions of Random
Variables, Chebyshev inequality.
UNIT-III 9
STOCHASTIC PROCESS
Stochastic processes: Introduction: Bernoulli and Poisson processes, renewal
process, renewal model of program behavior; Discrete parameter Markov chains:
transition probabilities, limiting distributions; Queuing: M/M1 and M/G/1, birth
and death process; Finite Markov chains, program execution times.
UNIT-IV CORRELATION AND REGRESSION 9
Correlation and regression: The nature of correlation and regression, definitions;
Definition and calculation of correlation coefficients; Approaches to correlation:
the linear model approach, the least squares fitting approach, strengths and
weaknesses of these and conditions for applicability.
UNIT-V SAMPLING, TESTING OF HYPOTHESIS AND STATISTICAL QUALITY 9
CONTROL
Introduction , Sampling Theory (Small and Large) , Hypothesis, Null hypothesis,
Alternative hypothesis, Testing a Hypothesis, Level of significance, Confidence
limits, Test of significance of difference of means, T-test, F-test and Chi-square
test. Statistical Quality Control (SQC), Control Charts, Control Charts for variables
( X and R Charts), Control Charts for Variables ( p, np and C charts).
LEARNING OUTCOME:
1. Students will demonstrate knowledge of basic probability & random variables
2. Students will be introduced to the techniques of developing discrete & continuous probability
distributions and its applications
3. Students will be able to describe a stochastic process and its applications.
4. Students will demonstrate knowledge of correlation, regression and their applicability.
5. Students will demonstrate testing of hypothesis and statistical quality control
Learning Resources
Text Book
1. T. Veerarajan, "Probability, Statistics and Random
Processes", Tata McGraw – Hill, 3 edition, 2017.
2. Erwin Kreyszig, Advanced Engineering Mathematics,
10thEdition, John Wiley & Sons, 2010.
3. Walpole R. E., Myers S. L., Ye K., Probabilty and Statistics
for Engineers and Scientists, Pearson, 2017.
4. Blake, An Introduction to Applied Probability, John Wiley
(2018)
Reference Book and other

materials 1. Trivedi K S, "Probability and Statistics with reliability,
Queueing and Computer Science Applications", Prentice Hall of
India, New Delhi, 2011
2. B.S. Grewal, Higher Engineering Mathematics, Khanna
Publishers, 42th Edition, 2017.
3. J.N. Kapur: Mathematical Statistics; S. Chand & Sons
Company Limited, New Delhi, 2010.

BTech - CSE Syllabus

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

BTech - CSE Syllabus

Uploaded by

Copyright:

Available Formats

CURRICULUM & SYLLABUS

CHOICE BASED CREDIT SYSTEM (CBCS)

COMPUTER SCIENCE AND ENGINEERING

FACULTY OF ENGINEERING AND TECHNOLOGY

2. To bridge the gap between industry and academia by bringing state-of-the-

3. To encourage innovation through multidisciplinary research and

Materials Science Laboratory

20CS1006 P Data Structures & Algorithms 3 1 0 4

20CS 1116 P Data Structures Lab 0 0 2 1

xxx G Open Elective Course – I 2 0 0 2

CS 2003 P Discrete Structures 3 1 0 4

20 PD 0201 G Personality Development – III 0 0 2 1

CS 2111 P DBMS Lab 0 0 2 1

Xxx G Open Elective Course – II 2 0 0 2

CS 2006 P Operating Systems 3 0 0 3

CS 2008 P Analysis and Design of Algorithms 3 1 0 4

CS 2010 P JAVA Programming 3 1 0 4

CS 2112 E Microprocessor Lab 0 0 2 1

CS 2114 P Operating Systems Lab 0 0 2 1

CS 2116 P Java Programming Lab 0 0 2 1

CS 2118 P ADA Lab 0 0 2 1

CS 3001 P Compiler Design 3 1 0 4

CS 3003 E Computer Networks 3 1 0 4

Xxx B Open Elective Course – III 3 1 0 4

CS 3113 E Computer Network Lab 0 0 2 1

CS 3115 P Industrial Training - I 0 0 2 1

CS 3117 P Compiler Design Lab 0 0 2 1

CS 3xxx P Department Elective Course – III 3 1 0 4

CS 3010 P Multimedia & Web Technologies 3 0 0 3

CS 3xxx P Department Elective Course – IV 3 1 0 4

CS 4003 P Cloud Computing 3 1 0 4

CS 4xxx P Department Elective Course – VI 3 1 0 4

CS 4113 P Cloud Computing Lab 0 0 2 1

CS 4115 P Industrial Training - II 0 0 2 1

CS 4117 P Minor Project 0 0 8 4

Total 25 26 26 25 24 24 22 8 180 100

Assessment Assessment 1 Assessment 2 Assessment 3 Assessment 4 Assessment 5 Total

Internal Evaluation (Practical)

Assessment Daily Assessment Programs Programs performed ViVa- Total

External Evaluation (Theory)

Assessment End-semester Examination Total

Marks 100 Converted into 50 marks

External Evaluation (Practical)

Assessment Record File Programs performed Written Viva- Voce Total

Internal Evaluation (Industrial Training)

Assessment Review 1 Review 2 Final Total

External Evaluation (Industrial Training)

Assessment Report Final Presentation Total

Assessment Internal 1 (MCQ) Internal 2 (MCQ) Total

External Evaluation (Comprehension)

Assessment MCQ ViVa-voce (any two Total

Internal Evaluation (Project)

Assessment Review 1 Review 2 Final Total

External Evaluation (Project)

Assessment Project Development Power point Usage of Innovativeness Individual Total

1. The evaluation Scheme may change as per the university guidelines.

1. Graduates will be able to apply knowledge of mathematics, science,

1. Graduates will be able to apply ethical principles in their professional and

Code Category Course L T P C

Code Category Course L T P C

P Digital Image Processing 3 1 0 4

P Neural Networks & Fuzzy 3 1 0 4

P Big Data & Analytics 3 1 0 4