ANNA UNIVERSITY, CHENNAI AFFILIATED INSTITUTIONS

B.E. COMPUTER SCIENCE AND ENGINEERING REGULATIONS – 2017

CHOICE BASED CREDIT SYSTEM
PROGRAM EDUCATIONAL OBJECTIVES (PEOs):
1. To enable graduates to pursue higher education and research, or have a successful career in industries associa
with Computer Science and Engineering, or as entrepreneurs. To ensure that graduates will have the ability and attit
adapt to emerging technological changes.
PROGRAM OUTCOMES POs:
Engineering Graduates will be able to:
1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals and a
engineering specialization to the solution of complex engineering problems.
2. Problem analysis: Identify, formulate, review research literature, and analyze complex engineering prob
reaching substantiated conclusions using first principles of mathematics, natural sciences, and engineering
sciences.
3. Design/development of solutions: Design solutions for complex engineering problems and design syst
components or processes that meet the specified needs with appropriate consideration for the public hea
and safety, and the cultural, societal, and environmental considerations.
4. Conduct investigations of complex problems: Use research-based knowledge and research methods
including design of experiments, analysis and interpretation of data, and synthesis of the information to provide valid
conclusions.
5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineerin
IT tools including prediction and modeling to complex engineering activities with an understanding of the limitations.
6. The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal,
health, safety, legal and cultural issues and the consequent responsibilities relevant to the professional
engineering practice.
7. Environment and sustainability: Understand the impact of the professional engineering solutions in societal an
environmental contexts, and demonstrate the knowledge of, and need for sustainable development.
8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineer
practice.
9. Individual and team work: Function effectively as an individual, and as a member or leader in diverse t
and in multidisciplinary settings.
10. Communication: Communicate effectively on complex engineering activities with the engineering commun
with society at large, such as, being able to comprehend and write effective reports and design documentation, mak
effective presentations, and give
and receive clear instructions.
practice.
9. Individual and team work: Function effectively as an individual, and as a member or leader in diverse t
and in multidisciplinary settings.
10. Communication: Communicate effectively on complex engineering activities with the engineering commun
with society at large, such as, being able to comprehend and write effective reports and design documentation, mak
effective presentations, and give
and receive clear instructions.

11. Project management and finance: Demonstrate knowledge and understanding of the engineering and
management principles and apply these to one’s own work, as a member and leader in a team, to manage projects
multidisciplinary environments.
12. Life-long learning: Recognize the need for, and have the preparation and ability to engage in independ
and life-long learning in the broadest context of technological change.
PROGRAM SPECIFIC OBJECTIVES (PSOs)
To analyze, design and develop computing solutions by applying foundational concepts of Computer Science
Engineering.
To apply software engineering principles and practices for developing quality software for scientific and business
applications.
To adapt to emerging Information and Communication Technologies (ICT) to innovate ideas and solutions to existing
problems.
Mapping of POs/PSOs to PEOs
Contribution 1: Reasonable 2:Significant 3:Strong
 PEOs

POs 1. Graduates will pursue 2. Graduates will have

higher education and the ability and attitude t
research, or have a adapt to emerging
successful career in industries technological changes.
associated with Computer
Science and Engineering, or
as entrepreneurs.

1. Engineering knowledge: Apply the knowledge of

mathematics, science, engineering fundamentals,
and an engineering 3 1
specialization to the solution of complex
engineering problems.
2. Problem analysis: Identify, formulate, review
research literature, and analyze complex
engineering problems reaching substantiated
3 1
conclusions using first principles of
mathematics, natural sciences, and
engineering sciences.
3. Design/development of solutions: Design
solutions for 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, 3 2
and environmental considerations.

4. Conduct investigations of complex

problems: Use research-based knowledge and research
methods including design of experiments,
analysis and interpretation of data, and synthesis 3 2
of the information to provide valid conclusions.

5. Modern tool usage: Create, select, and apply

appropriate techniques, resources, and modern
engineering and IT tools including prediction and
2 3
modeling to complex engineering activities with an
understanding of the limitations.

6. The engineer and society: Apply reasoning

informed by the contextual knowledge to assess
societal, health, safety, legal and cultural issues
and the consequent responsibilities relevant to
2 2
the professional engineering practice.
7. Environment and sustainability:
Understand the impact of the professional engineering
solutions in societal and environmental contexts,
and demonstrate the knowledge of, and need for 2 1
sustainable development.

8. Ethics: Apply ethical principles and commit to 3 1

professional ethics and responsibilities and norms of
the engineering practice.

9. Individual and team work: Function effectively as an 3 2

individual, and as a member or leader in diverse teams, and
in multidisciplinary settings.

10. Communication: Communicate effectively on complex

engineering activities with the engineering
community and with society at large, such as, being
able to comprehend and write effective reports
and design documentation, make effective 3 2
presentations, and give and receive clear instructions.

11. Project management and finance:

Demonstrate knowledge and understanding of the
engineering and management principles and apply these to
one’s own work, as a member and leader in a team, to 2 2
manage projects and in multidisciplinary environments.

12. Life-long learning: Recognize the need for, and 1 3

have the preparation and ability to engage in independent
and life-long learning in the
broadest context of technological change.

PSOs
1. Analyze, design and develop computing solutions by applying foundational concepts of
computer science and engineering.
2. Apply software engineering principles and practices for developing quality software for
scientific and business applications.
3. Adapt to emerging information and communication technologies (ICT) to innovate ideas and
solutions to existing/novel problems.
MAPPING OF COURSE OUTCOMES WITH PROGRAMME OUTCOMES
A broad relation between the Course Outcomes and Programme Outcomes is given in the following table

Course Title Programme Outcome (PO)

1 2 3 4 5 6 7 8 9 10 11 12
Communicative English √ √ √ √

Engineering √ √ √ √
Mathematics - I
Engineering Physics √ √ √
Engineering √ √ √
Chemistry
SEMESTER I

Problem Solving √ √ √
and Python
Programming
Engineering Graphics √ √ √ √ √ √ √ √

Problem Solving and √ √ √ √ √ √ √ √

Python Programming
Laboratory

Physics and Chemistry √ √ √ √ √ √

Laboratory

Technical English √ √ √ √
Engineering √ √ √ √
Mathematics II
Physics for Information √ √ √
Science

Basic Electrical, √ √ √
SEMESTER II

Electronics and
Measurement
Engineering
Environmental √ √ √ √ √ √ √ √
Science and
Engineering
Programming in C √ √ √ √ √ √ √
Engineering Practices √ √ √ √ √ √ √ √ √ √
Laboratory

C Programming √ √ √ √ √ √ √
Laboratory
PROGRAMME OUTCOME (PO)
 COURSE TITLE 1 2 3 4 5 6 7 8 9 10 11

Discrete √ √ √ √
Mathematics
Digital Principles
and √ √ √
Design
Data Structures √ √ √
SEMESTER III

Object Oriented √ √ √
Programming
Communication √ √ √
Engineering
Data Structures √ √ √ √ √ √
Laboratory
Object Oriented √ √ √ √ √ √
Programming
Laboratory
Digital Systems √ √ √ √ √ √ √
Laboratory
Interpersonal
Skills/Listening √ √ √
YEAR II

&Speaking

Probability and √ √ √ √ √
Queueing Theory

Computer √ √ √
Architecture
Database
Management √ √ √
Systems
SEMESTER IV

Design and Analysis √ √ √ √ √

of
Algorithms
Operating Systems √ √ √

Software √ √ √ √ √ √ √ √
Engineering
Database √ √ √ √ √ √
Management
Systems
Laboratory
Operating Systems √ √ √ √ √ √
Laboratory

Advanced Reading
and √ √ √
Writing

Algebra and √ √ √ √
Number Theory
 Computer Networks √ √ √

Microprocessors and √ √ √
Microcontrollers

Theory of √ √ √
Computation
SEMESTER V

Object Oriented √ √ √
Analysis and Design √
YEAR III

Open Elective I
Microprocessors and √ √ √ √ √ √
Microcontrollers
Laboratory

Object Oriented √ √ √ √ √ √ √ √
Analysis and
Design Laboratory

Networks Laboratory √ √ √ √ √ √

Internet √ √ √ √ √ √
Programming
Artificial √ √ √
Intelligence
Mobile Computing √ √ √
SEMESTER VI

Compiler Design √ √ √ √ √ √
Distributed Systems √ √ √

Professional Elective
I
Internet √ √ √ √ √ √ √
Programming
Laboratory
Mobile Application √ √ √ √ √ √ √ √
Development
Laboratory

Mini Project √ √ √ √ √ √ √ √ √ √ √
Professional  
Communication

Principles of √ √ √ √
Management
SEMESTER VII

Cryptography and
Network Security √ √ √
YEAR IV
 SEMESTER VII
YEAR IV Cloud Computing √ √ √
Open Elective II
Professional
Elective II
Professional
Elective III
Cloud Computing √ √ √ √ √ √ √
Laboratory
Security Laboratory √ √ √ √ √ √ √

Professional
Elective IV
SEMESTER VIII

Professional
Elective V
Project Work
√ √ √ √ √ √ √ √ √ √ √

PROFESSIONAL ELECTIVES
SEM COURSE TITLE PROGRAMME OUTCOME (PO)
1 2 3 4 5 6 7 8 9 10
VI Data Warehousing and Data √ √ √
Mining
Software Testing √ √ √ √ √ √
Embedded Systems √ √ √
Agile Methodologies √ √ √
Graph Theory and Applications- √ √ √
Intellectual Property Rights √ √ √ √ √
Digital Signal Processing √ √ √
VII Big Data Analytics √ √ √ √ √ √
Machine Learning Techniques √ √ √ √ √ √
Computer Graphics and √ √ √
Multimedia
Software Project Management √ √ √ √ √ √ √
Internet of Things √ √ √
Service Oriented Architecture √ √ √
Total Quality Management √ √ √
Multi-core Architectures √ √ √
and Programming
Human Computer Interaction √ √ √
 C# and .Net Programming √ √ √ √ √ √
Wireless Adhoc and Sensor √ √ √
Networks
Advanced Topics on Databases √ √ √
Foundation Skills in Integrated Product √ √ √
Development
Human Rights √ √ √
Disaster Management √ √ √ √
VIII Digital Image Processing √ √ √
Social Network Analysis √ √ √
Information Security √ √ √ √
Software Defined Networks √ √ √
Cyber Forensics √ √ √ √
Soft Computing √ √ √
Professional Ethics in √ √ √ √ √
Engineering
Information Retrieval Techniques √ √ √
Green Computing √ √ √
GPU Architecture and √ √ √
Programming
Natural Language Processing √ √ √
Parallel Algorithms √ √ √
Speech Processing √ √ √
Fundamentals of Nanoscience √ √ √
ANNA UNIVERSITY, CHENNAI
AFFILIATED INSTITUTIONS
B.E. COMPUTER SCIENCE AND ENGINEERING REGULATIONS – 2017
CHOICE BASED CREDIT SYSTEM
I - VIII SEMESTERS CURRICULA AND SYLLABI

SEMESTER I
SI. COURSE COURSE TITLE CATEGORY CONTACT L T P
No CODE PERIODS
THEORY
1 HS8151 Communicative English HS 4 4 0 0
2 MA8151 Engineering BS 4 4 0 0
Mathematics - I
3 PH8151 Engineering Physics BS 3 3 0 0
4 CY8151 Engineering Chemistry BS 3 0 0
3

5 GE8151 Problem Solving and Python ES 3 3 0 0

Programming
6 GE8152 Engineering Graphics ES 6 2 0 4
PRACTICALS
 7 GE8161 Problem Solving and Python ES 4
Programming Laboratory 0 0 4

8 BS8161 Physics and Chemistry BS 4 0 0 4

Laboratory
TOTAL 31 19 0 12
SEMESTER II

SI.No COURSE COURSE TITLE CATEGORY CONTACT L T P

CODE PERIODS
THEORY
1 HS8251 Technical English HS 4 4 0 0
2 MA8251 Engineering BS 4 4 0 0
Mathematics - II
3 PH8252 Physics for Information BS 3 3 0 0
Science
4 BE8255 Basic Electrical, Electronics ES 3 3 0 0
and Measurement
Engineering

5 GE8291 Environmental Science HS 3 3 0 0

and Engineering
6 CS8251 Programming in C PC 3 3 0 0
PRACTICALS
7 GE8261 Engineering Practices ES 4 0 0 4
Laboratory
8 CS8261 C Programming PC 4 0 0 4
Laboratory
TOTAL 28 20 0 8
SEMESTER III
Sl.No COURSE COURSE TITLE CATEGORY CONTACT L T P
CODE PERIODS
THEORY
1 MA8351 Discrete Mathematics BS 4 4 0 0
2 CS8351 Digital Principles and System ES 4 4 0 0
Design
3 CS8391 Data Structures PC 3 3 0 0
4 CS8392 Object Oriented PC 3 3 0 0
Programming
5 EC8395 Communication ES 3 3 0 0
Engineering
PRACTICALS
6 CS8381 Data Structures PC 4 0 0 4
Laboratory
7 CS8383 Object Oriented PC 4 0 0 4
Programming Laboratory
 8 CS8382 Digital Systems Laboratory ES 4 0 0 4

9 HS8381 Interpersonal Skills/Listening EEC 2 0 0 2

&Speaking

TOTAL 31 17 0 14
SEMESTER IV

Sl. No COURSE COURSE TITLE CATEGORY CONTACT L T P

CODE PERIODS
THEORY
1 MA8402 Probability and Queueing BS 4 4 0 0
Theory
2 CS8491 Computer Architecture PC 3 3 0 0
3 CS8492 Database Management PC 3 3 0 0
Systems
4 CS8451 Design and Analysis of PC 3 3 0 0
Algorithms
5 CS8493 Operating Systems PC 3 3 0 0
6 CS8494 Software Engineering PC 3 3 0 0
PRACTICALS
7 CS8481 Database Management PC 4 0 0 4
Systems Laboratory
8 CS8461 Operating Systems PC 4 0 0 4
Laboratory
9 HS8461 Advanced Reading and EEC 2 0 0 2
Writing
TOTAL 29 19 0 10
SEMESTER V
Sl. No COURSE COURSE TITLE CATEGORY CONTACT L T P
CODE PERIODS
THEORY
1 MA8551 Algebra and Number Theory BS 4 4 0 0

2 CS8591 Computer Networks PC 3 3 0 0

3 EC8691 Microprocessors and PC 3 3 0 0
Microcontrollers
4 CS8501 Theory of Computation PC 3 3 0 0
5 CS8592 Object Oriented Analysis and PC 3 3 0 0
Design
6 Open Elective I OE 3 3 0 0
PRACTICALS
7 EC8681 Microprocessors and PC 4 0 0 4
Microcontrollers Laboratory
8 CS8582 Object Oriented Analysis PC 4 0 0 4
and Design Laboratory
9 CS8581 Networks Laboratory PC 4 0 0 4
 TOTAL 31 19 0 12
SEMESTER VI

Sl. No COURSE COURSE TITLE CATEGORY CONTACT L T P

CODE PERIODS
THEORY
1 CS8651 Internet Programming PC 3 3 0 0
2 CS8691 Artificial Intelligence PC 3 3 0 0
3 CS8601 Mobile Computing PC 3 3 0 0
4 CS8602 Compiler Design PC 5 3 0 2
5 CS8603 Distributed Systems PC 3 3 0 0
6 Professional Elective I PE 3 3 0 0
PRACTICALS
7 CS8661 Internet Programming PC 4 0 0 4
Laboratory
8 CS8662 Mobile Application PC 4 0 0 4
Development Laboratory
9 CS8611 Mini Project EEC 2 0 0 2
10 HS8581 Professional EEC 2 0 0 2
Communication
TOTAL 32 18 0 14
SEMESTER VII

SI. COURSE COURSE TITLE CATEGORY CONTACT L T P

No CODE PERIODS
THEORY
1 MG8591 Principles of HS 3 3 0 0
Management
2 CS8792 Cryptography and PC 3 3 0 0
Network Security
3 CS8791 Cloud Computing PC 3 3 0 0
4 Open Elective II OE 3 3 0 0
5 Professional Elective II PE 3 3 0 0
6 Professional PE 3 3 0 0
Elective III
PRACTICALS
7 CS8711 Cloud Computing PC 4 0 0 4
Laboratory
8 IT8761 Security Laboratory PC 4 0 0 4
TOTAL 26 18 0 8
SEMESTER VIII

Sl. No COURSE COURSE TITLE CATEGORY CONTACT L T P

CODE PERIODS
THEORY
1 Professional Elective IV PE 3 3 0 0

2 Professional Elective V PE 3 3 0 0

PRACTICALS
3 CS8811 Project Work EEC 20 0 0 20

TOTAL 26 6 0 20

TOTAL NO. OF CREDITS: 185

HUMANITIES AND SOCIAL SCIENCES (HS)

Sl. COURSE COURSE TITLE CATEGORY CONTACT L T P

NO CODE PERIODS
1 HS8151 Communicative English HS 4 4 0 0
2 HS8251 Technical English HS 4 4 0 0
3 GE8291 Environmental Science HS 3 3 0 0
and Engineering
4 MG8591 Principles of Management HS 3 3 0 0
BASIC SCIENCES (BS)

Sl. COURSE COURSE TITLE CATEGORY CONTACT L T P

NO CODE PERIODS
1 MA8151 Engineering Mathematics I BS 4 4 0 0

2 PH8151 Engineering Physics BS 3 3 0 0

3 CY8151 Engineering Chemistry BS 3 3 0 0
4 BS8161 Physics and Chemistry BS 4 0 0 4
Laboratory
5 MA8251 Engineering BS 4 4 0 0
Mathematics II
6 PH8252 Physics for Information BS 3 3 0 0
Science
7 MA8351 Discrete Mathematics BS 4 4 0 0
8 MA8402 Probability and Queueing BS 4 4 0 0
Theory
9 MA8551 Algebra and Number Theory BS 4 4 0 0

ENGINEERING SCIENCES (ES)

Sl. COURSE COURSE TITLE CATEGORY CONTACT L T P

NO CODE PERIODS
1 GE8151 Problem Solving and Python ES 3 3 0 0
Programming
 2 GE8152 Engineering Graphics ES 6 2 0 4
3 Problem Solving and
GE8161 Python Programming ES 4 0 0 4
Laboratory
4 BE8255 Basic Electrical, Electronics ES 3 3 0 0
and Measurement Engineering

5 GE8261 Engineering Practices ES 4 0 0 4

Laboratory
6 CS8351 Digital Principles and System ES 4 4 0 0
Design
7 EC8395 Communication ES 3 3 0 0
Engineering
8 CS8382 Digital Systems Laboratory ES 4 0 0 4

PROFESSIONAL CORE (PC)

Sl. COURSE COURSE TITLE CATEGORY CONTACT L T P
NO CODE PERIODS
1 CS8251 Programming in C PC 3 3 0 0
2 CS8261 C Programming Laboratory PC 4 0 0 4
3 CS8391 Data Structures PC 3 3 0 0
4 CS8392 Object Oriented Programming PC 3 3 0 0

5 CS8381 Data Structures Laboratory PC 4 0 0 4

6 CS8383 Object Oriented PC 4 0 0 4
Programming Laboratory
7 CS8491 Computer Architecture PC 3 3 0 0
8 CS8492 Database Management PC 3 3 0 0
Systems
9 CS8451 Design and Analysis of PC 3 3 0 0
Algorithms
10 CS8493 Operating Systems PC 3 3 0 0
11 CS8494 Software Engineering PC 3 3 0 0
12 CS8481 Database Management PC 4 0 0 4
Systems Laboratory
13 CS8461 Operating Systems Laboratory PC 4 0 0 4

14 CS8591 Computer Networks PC 3 3 0 0

15 EC8691 Microprocessors and PC 3 3 0 0
Microcontrollers
16 CS8501 Theory of Computation PC 3 3 0 0
17 CS8592 Object Oriented Analysis and PC 3 3 0 0
Design
18 EC8681 Microprocessors and PC 4 0 0 4
Microcontrollers Laboratory
19 CS8582 Object Oriented Analysis and PC 4 0 0 4
Design Laboratory
20 CS8581 Networks Laboratory PC 4 0 0 4
21 CS8651 Internet Programming PC 3 3 0 0
22 CS8691 Artificial Intelligence PC 3 3 0 0
23 CS8601 Mobile Computing PC 3 3 0 0
24 CS8602 Compiler Design PC 5 3 0 2
25 CS8603 Distributed Systems PC 3 3 0 0
26 CS8661 Internet Programming PC 4 0 0 4
Laboratory
27 CS8662 Mobile Application Development PC 4 0 0 4
Laboratory
28 CS8792 Cryptography and Network PC 3 3 0 0
Security
29 CS8791 Cloud Computing PC 3 3 0 0
30 CS8711 Cloud Computing PC 4 0 0 4
Laboratory
31 IT8761 Security Laboratory PC 4 0 0 4
PROFESSIONAL ELECTIVES (PE)

SEMESTER VI ELECTIVE - I

SI. COURSE COURSE TITLE CATEGORY CONTACT L T P

No CODE PERIODS

1 CS8075 Data Warehousing and PE 3 3 0 0

Data Mining
2 IT8076 Software Testing PE 3 3 0 0
3 IT8072 Embedded Systems PE 3 3 0 0
4 CS8072 Agile Methodologies PE 3 3 0 0
5 CS8077 Graph Theory and PE 3 3 0 0
Applications-
6 IT8071 Digital Signal Processing PE 3 3 0 0
7 GE8075 Intellectual Property PE 3 3 0 0
Rights
SEMESTER VII ELECTIVE - II

SI. COURSE COURSE TITLE CATEGORY CONTACT L T P

No CODE PERIODS
1 CS8091 Big Data Analytics PE 3 3 0 0
2 CS8082 Machine Learning PE 3 3 0 0
Techniques
3 CS8092 Computer Graphics and PE 3 3 0 0
Multimedia
 4 IT8075 Software Project Management PE 3 3 0 0

5 CS8081 Internet of Things PE 3 3 0 0

6 IT8074 Service Oriented Architecture PE 3 3 0 0

7 GE8077 Total Quality Management PE 3 3 0 0

SEMESTER VII ELECTIVE - III

SI. COURSE COURSE TITLE CATEGORY CONTACT L T P

No CODE PERIODS
1 CS8083 Multi-core Architectures and PE 3 3 0 0
Programming
2 CS8079 Human Computer Interaction PE 3 3 0 0

3 CS8073 C# and .Net Programming PE 3 3 0 0

4 CS8088 Wireless Adhoc and Sensor PE 3 3 0 0
Networks
5 CS8071 Advanced Topics on PE 3 3 0 0
Databases
6 GE8072 Foundation Skills in Integrated PE 3 3 0 0
Product
Development
7 GE8074 Human Rights PE 3 3 0 0
8 GE8071 Disaster Management PE 3 3 0 0
SEMESTER VIII
ELECTIVE - IV
SI. COURSE COURSE TITLE CATEGORY CONTACT L T P
No CODE PERIODS
1 EC8093 Digital Image Processing PE 3 3 0 0
2 CS8085 Social Network Analysis PE 3 3 0 0
3 IT8073 Information Security PE 3 3 0 0
4 CS8087 Software Defined Networks PE 3 3 0 0
5 CS8074 Cyber Forensics PE 3 3 0 0
6 CS8086 Soft Computing PE 3 3 0 0
7 GE8076 Professional Ethics in Engineering PE 3 3 0 0

SEMESTER VIII ELECTIVE - V

SI. COURSE COURSE TITLE CATEGORY CONTACT L T P

No CODE PERIODS
1 CS8080 Information Retrieval PE 3 3 0 0
Techniques
2 CS8078 Green Computing PE 3 3 0 0
3 CS8076 GPU Architecture and PE 3 3 0 0
Programming
 4 CS8084 Natural Language Processing PE 3 3 0 0
5 CS8001 Parallel Algorithms PE 3 3 0 0
6 IT8077 Speech Processing PE 3 3 0 0
7 GE8073 Fundamentals of Nanoscience PE 3 3 0 0

EMPLOYABILITY ENHANCEMENT COURSES (EEC)

Sl. COURSE COURSE TITLE CATEGORY CONTACT L T P
NO CODE PERIODS
1 HS8381 Interpersonal Skills/Listening & EEC 2 0 0 2
Speaking
2 HS8461 Advanced Reading and EEC 2 0 0 2
Writing
3 CS8611 Mini Project EEC 2 0 0 2
4 HS8581 Professional Communication EEC 2 0 0 2
5 CS8811 Project Work EEC 20 0 0 20

SUMMARY
S.NO. SUBJECT AREA CREDITS AS PER SEMESTER CREDITS Percentage
TOTAL
II III IV V VI VII VIII
I

1 HS 4 7 3 14 7.60%
2 BS 12 7 4 4 4 31 16.8%
3 ES 9 5 9 23 12.5%
4 PC 5 10 19 18 20 10 82 44.5%
5 PE 3 6 6 15 8.15%
6 OE 3 3 6 3.3%
7 EEC 1 1 2 10 14 7.65%
Total 25 24 24 24 25 25 22 16 185
8 Non Credit /
Mandatory
L
4
HS8151
COMMUNICATIVE ENGLISH
OBJECTIVES:
 To develop the basic reading and writing skills of first year engineering and technology students.
 To help learners develop their listening skills, which will, enable them listen to lectures and comprehe
them by asking questions; seeking clarifications.
 To help learners develop their speaking skills and speak fluently in real contexts.
 To help learners develop vocabulary of a general kind by developing their reading skills

UNIT I SHARING INFORMATION RELATED TO ONESELF/FAMILY& FRIENDS 12

Reading- short comprehension passages, practice in skimming-scanning and predicting- Writing- completing
sentences- - developing hints. Listening- short texts- short formal and informal conversations. Speaking
introducing oneself - exchanging personal information- Language development- Wh- Questions- asking a
answering-yes or no questions- parts of speech. Vocabulary development-- prefixes- suffixes- articles.- cou
uncount nouns.

UNIT II GENERAL READING AND FREE WRITING 12

Reading - comprehension-pre-reading-post reading- comprehension questions (multiple choice questions an
short questions/ open-ended questions)-inductive reading- short narratives and descriptions from newspapers inc
dialogues and conversations (also used as short Listening texts)- register- Writing – paragraph writing- topic
sentence- main ideas- free writing, short narrative descriptions using some suggested vocabulary and
structures –Listening- telephonic conversations. Speaking – sharing information of a personal kind—gree
taking leave- Language development – prepositions, conjunctions Vocabulary development- guess
meanings of words in context.

UNIT III GRAMMAR AND LANGUAGE DEVELOPMENT 12

Reading- short texts and longer passages (close reading) Writing- understanding text structure- use of referenc
words and discourse markers-coherence-jumbled sentences Listening – listening to longer texts and filling up
table- product description- narratives from different sources. Speaking- asking about routine actions and
expressing opinions. Language development- degrees of comparison- pronouns- direct vs indirect questions-
Vocabulary development – single word substitutes- adverbs.

UNIT IV READING AND LANGUAGE DEVELOPMENT 12

Reading- comprehension-reading longer texts- reading different types of texts- magazines Writing-
writing, informal or personal letters-e-mails-conventions of personal email- Listening- listening to dialo
or conversations and completing exercises based on them. Speaking- speaking about oneself- speaking
one’s friend- Language development- Tenses- simple present-simple past- present continuous and pas
continuous- Vocabulary development- synonyms-antonyms- phrasal verbs

UNIT V EXTENDED WRITING 12

Reading- longer texts- close reading –Writing- brainstorming -writing short essays – developing an outline-
identifying main and subordinate ideas- dialogue writing-Listening – listening to talks- conversations- Speaking
participating in conversations- short group conversations-Language development-modal verbs- present/ pas
perfect tense - Vocabulary development-collocations- fixed and semi-fixed expressions.

TOTAL: 60 PERIODS
OUTCOMES:
AT THE END OF THE COURSE, LEARNERS WILL BE ABLE TO:
• Read articles of a general kind in magazines and newspapers.
 • Participate effectively in informal conversations; introduce themselves and their friends and express op
in English.
• Comprehend conversations and short talks delivered in English
• Write short essays of a general kind and personal letters and emails in English.
TEXT BOOKS:
1. Board of Editors. Using English A Coursebook for Undergarduate Engineers and Technologists. O
BlackSwan Limited, Hyderabad: 2015
2. Richards, C. Jack. Interchange Students’ Book-2 New Delhi: CUP, 2015.
REFERENCES:
1. Bailey, Stephen. Academic Writing: A practical guide for students. New York: Rutledge,2011.
2. Means,L. Thomas and Elaine Langlois. English & Communication For Colleges.
CengageLearning ,USA: 2007
3. Redston, Chris &Gillies Cunningham Face2Face (Pre-intermediate Student’s Book& Workbook)
Cambridge University Press, New Delhi: 2005
4. Comfort, Jeremy, et al. Speaking Effectively: Developing Speaking Skills for Business English. Cambridge
University Press, Cambridge: Reprint 2011
5. Dutt P. Kiranmai and Rajeevan Geeta. Basic Communication Skills, Foundation Books: 2013.

MA8151
ENGINEERING MATHEMATICS – I

OBJECTIVES :
The goal of this course is to achieve conceptual understanding and to retain the best traditions of traditional calcu
The syllabus is designed to provide the basic tools of calculus mainly for the purpose of modelling the engineerin
problems mathematically and obtaining solutions. This is a foundation course which mainly deals with topics
as single variable and multivariable calculus and plays an important role in the understanding of science,
engineering, economics and computer science, among other disciplines.

UNIT I DIFFERENTIAL CALCULUS 12

Representation of functions - Limit of a function - Continuity - Derivatives - Differentiation rules - Maxima and Min
functions of one variable.
UNIT II FUNCTIONS OF SEVERAL VARIABLES 12
Partial differentiation – Homogeneous functions and Euler’s theorem – Total derivative – Change of variables – Jaco
– Partial differentiation of implicit functions – Taylor’s series for functions of two variables – Maxima and minima
functions of two variables – Lagrange’s method of undetermined multipliers.
UNIT III INTEGRAL CALCULUS 12
Definite and Indefinite integrals - Substitution rule - Techniques of Integration - Integration by parts, Trigono
integrals, Trigonometric substitutions, Integration of rational functions by partial fraction, Integration of irrational
functions - Improper integrals.
UNIT IV MULTIPLE INTEGRALS 12
Double integrals – Change of order of integration – Double integrals in polar coordinates – Area enclosed by plane c
– Triple integrals – Volume of solids – Change of variables in double and triple integrals.
UNIT V DIFFERENTIAL EQUATIONS 12
Higher order linear differential equations with constant coefficients - Method of variation of parameters –
Homogenous equation of Euler’s and Legendre’s type – System of simultaneous linear differential equations w
constant coefficients - Method of undetermined coefficients.

TOTAL: 60 PERIODS
OUTCOMES:
After completing this course, students should demonstrate competency in the following skills:
 Use both the limit definition and rules of differentiation to differentiate functions.
 Apply differentiation to solve maxima and minima problems.
 Evaluate integrals both by using Riemann sums and by using the Fundamental Theorem of Calculus.
 Apply integration to compute multiple integrals, area, volume, integrals in polar coordinates, in additi
change of order and change of variables.
 Evaluate integrals using techniques of integration, such as substitution, partial fractions and integration by
 Determine convergence/divergence of improper integrals and evaluate convergent improper integrals.
 Apply various techniques in solving differential equations.
TEXT BOOKS :
1. Grewal B.S., “Higher Engineering Mathematics”, Khanna Publishers, New Delhi, 43 rd Edition, 2014.
2. James Stewart, "Calculus: Early Transcendentals", Cengage Learning, 7 th Edition, New Delhi, 2015. [For U
& III - Sections 1.1, 2.2, 2.3, 2.5, 2.7(Tangents problems only), 2.8,
3.1 to 3.6, 3.11, 4.1, 4.3, 5.1(Area problems only), 5.2, 5.3, 5.4 (excluding net change
theorem), 5.5, 7.1 - 7.4 and 7.8].
REFERENCES:
1. Anton, H, Bivens, I and Davis, S, "Calculus", Wiley, 10 th Edition, 2016.
2. Jain R.K. and Iyengar S.R.K., “Advanced Engineering Mathematics”, Narosa Publications, New Delhi, 3 rd E
2007.
3. Narayanan, S. and Manicavachagom Pillai, T. K., “Calculus" Volume I and II,
S. Viswanathan Publishers Pvt. Ltd., Chennai, 2007.
4. Srimantha Pal and Bhunia, S.C, "Engineering Mathematics" Oxford University Press, 2015.
5. Weir, M.D and Joel Hass, "Thomas Calculus", 12th Edition, Pearson India, 2016.

L
3
PH8151 ENGINEERING PHYSICS
OBJECTIVES:
 To enhance the fundamental knowledge in Physics and its applications relevant to various streams of
Engineering and Technology.

UNIT I PROPERTIES OF MATTER 9

Elasticity – Stress-strain diagram and its uses - factors affecting elastic modulus and tensile strength –
torsional stress and deformations – twisting couple - torsion pendulum: theory and experiment - bending o
beams - bending moment – cantilever: theory and experiment – uniform and non-uniform bending: theory and
experiment - I-shaped girders - stress due to bending in beams.
UNIT II WAVES AND FIBER OPTICS 9
Oscillatory motion – forced and damped oscillations: differential equation and its solution – plane progressive wa
wave equation. Lasers : population of energy levels, Einstein’s A and B coefficients derivation – resonant
optical amplification (qualitative) – Semiconductor lasers: homojunction and heterojunction – Fiber optics: pri
numerical aperture and acceptance angle - types of optical fibres (material, refractive index, mode) – losses
associated with optical fibers - fibre optic sensors: pressure and displacement.
UNIT III THERMAL PHYSICS 9
Transfer of heat energy – thermal expansion of solids and liquids – expansion joints - bimetallic strips - thermal
conduction, convection and radiation – heat conductions in solids – thermal conductivity - Forbe’s and
disc method: theory and experiment - conduction through compound media (series and parallel) – therma
insulation – applications: heat exchangers, refrigerators, ovens and solar water heaters.

UNIT IV QUANTUM PHYSICS 9

Black body radiation – Planck’s theory (derivation) – Compton effect: theory and experimental verification
wave particle duality – electron diffraction – concept of wave function and its physical significance – Schrödinger’
equation – time independent and time dependent equations – particle in a one-dimensional rigid box – tunnelling
(qualitative) - scanning tunnelling microscope.
UNIT V CRYSTAL PHYSICS 9
Single crystalline, polycrystalline and amorphous materials – single crystals: unit cell, crystal systems, Bra
lattices, directions and planes in a crystal, Miller indices – inter-planar distances
- coordination number and packing factor for SC, BCC, FCC, HCP and diamond structures - crystal
imperfections: point defects, line defects – Burger vectors, stacking faults – role of imperfections in plast
deformation - growth of single crystals: solution and melt growth techniques.

TOTAL :45 PERIODS

OUTCOMES:
Upon completion of this course,
 The students will gain knowledge on the basics of properties of matter and its applications,
 The students will acquire knowledge on the concepts of waves and optical devices and their applic
in fibre optics,
 The students will have adequate knowledge on the concepts of thermal properties of materials an
their applications in expansion joints and heat exchangers,
 The students will get knowledge on advanced physics concepts of quantum theory and its applications in
tunneling microscopes, and
 The students will understand the basics of crystals, their structures and different crystal growth
techniques.
 TEXT BO
1. Bhattacharya, D.K. & Poonam, T. “Engineering Physics”. Oxford University Press
2. Gaur, R.K. & Gupta, S.L. “Engineering Physics”. Dhanpat Rai Publishers
3. Pandey, B.K. & Chaturvedi, S. “Engineering Physics”. Cengage Learning India
REFERE
1. Halliday, D., Resnick, R. & Walker, J. “Principles of Physics”. Wiley
2. Serway, R.A. & Jewett, J.W. “Physics for Scientists and Engineers”. Cengage Learning
3. Tipler, P.A. & Mosca, G. “Physics for Scientists and Engineers with Modern Physics’. W.H.Freeman
CY8151 ENGINEERING CHEMISTRY L
3

OBJECTIVES:
 To make the students conversant with boiler feed water requirements, related problems and water treatment
techniques.
 To develop an understanding of the basic concepts of phase rule and its applications to single and two componen
systems and appreciate the purpose and significance of alloys.
 Preparation, properties and applications of engineering materials.
 Types of fuels, calorific value calculations, manufacture of solid, liquid and gaseous fuels.
 Principles and generation of energy in batteries, nuclear reactors, solar cells, wind mills and fuel cells.
UNIT I WATER AND ITS TREATMENT 9
Hardness of water – types – expression of hardness – units – estimation of hardness of water by EDTA – numerical
problems – boiler troubles (scale and sludge) – treatment of boiler feed water – Internal treatment (phosphate, coll
sodium aluminate and calgon conditioning) external treatment – Ion exchange process, zeolite process –
desalination of brackish water - Reverse Osmosis.
UNIT II SURFACE CHEMISTRY AND CATALYSIS 9
Adsorption: Types of adsorption – adsorption of gases on solids – adsorption of solute from solutions –
adsorption isotherms – Freundlich’s adsorption isotherm – Langmuir’s adsorption isotherm – contact theory –
kinetics of surface reactions, unimolecular reactions, Langmuir - applications of adsorption on pollution abateme
Catalysis: Catalyst – types of catalysis – criteria – autocatalysis – catalytic poisoning and catalytic promoters - acid b
catalysis – applications (catalytic convertor) – enzyme catalysis– Michaelis – Menten equation.
UNIT III ALLOYS AND PHASE RULE 9
Alloys: Introduction- Definition- properties of alloys- significance of alloying, functions and effect of alloying elements
Nichrome and stainless steel (18/8) – heat treatment of steel. Phase rule: Introduction, definition of terms wit
examples, one component system -water system - reduced phase rule - thermal analysis and cooling curves - two
component systems - lead-silver system - Pattinson process.
UNIT IV FUELS AND COMBUSTION 9
Fuels: Introduction - classification of fuels - coal - analysis of coal (proximate and ultimate) - carbonization
manufacture of metallurgical coke (Otto Hoffmann method) - petroleum - manufacture of synthetic petrol
(Bergius process) - knocking - octane number - diesel oil - cetane number - natural gas - compressed natural gas (C
liquefied petroleum gases (LPG) - power alcohol and biodiesel. Combustion of fuels: Introduction - calorific value - h
and lower calorific
values- theoretical calculation of calorific value - ignition temperature - spontaneous ignition temperature - ex
range - flue gas analysis (ORSAT Method).
liquefied petroleum gases (LPG) - power alcohol and biodiesel. Combustion of fuels: Introduction - calorific value - h
and lower calorific
values- theoretical calculation of calorific value - ignition temperature - spontaneous ignition temperature - ex
range - flue gas analysis (ORSAT Method).

UNIT V ENERGY SOURCES AND STORAGE DEVICES 9

Nuclear fission - controlled nuclear fission - nuclear fusion - differences between nuclear fission and fusion - nuclear
reactions - nuclear energy - light water nuclear power plant - breeder reactor - solar energy conversion - sola
cells - wind energy. Batteries, fuel cells and supercapacitors: Types of batteries – primary battery (dry
secondary battery (lead acid
battery, lithium-ion-battery) fuel cells – H -O fuel cell.
2 2

TOTAL: 45 PERIODS
OUTCOMES:
 The knowledge gained on engineering materials, fuels, energy sources and water treatment technique
facilitate better understanding of engineering processes and applications for further le
TEXT BO
1. S. S. Dara and S. S. Umare, “A Textbook of Engineering Chemistry”, S. Chand & Company LTD, New Delh
2. P. C. Jain and Monika Jain, “Engineering Chemistry” Dhanpat Rai Publishing Company (P) LTD, New Delh
3. S. Vairam, P. Kalyani and Suba Ramesh, “Engineering Chemistry”, Wiley India PVT, LTD, New Delhi
REFERE
1. Friedrich Emich, “Engineering Chemistry”, Scientific International PVT, LTD, New Delhi
2. Prasanta Rath, “Engineering Chemistry”, Cengage Learning India PVT, LTD, Delhi
3. Shikha Agarwal, “Engineering Chemistry-Fundamentals and Applications”, Cambridge University Press, Delhi
GE8151 PROBLEM SOLVING AND PYTHON PROGRAMMING L
3
OBJECTIVES:
 To know the basics of algorithmic problem solving
 To read and write simple Python programs.
 To develop Python programs with conditionals and loops.
 To define Python functions and call them.
 To use Python data structures –- lists, tuples, dictionaries.
 To do input/output with files in Python.
UNIT I ALGORITHMIC PROBLEM SOLVING 9
Algorithms, building blocks of algorithms (statements, state, control flow, functions), notation (pseudo code, flo
chart, programming language), algorithmic problem solving, simple strategies for developing algorithms (iteration,
recursion). Illustrative problems: find minimum in a list, insert a card in a list of sorted cards, guess an integer numbe
range, Towers of Hanoi.
UNIT II DATA, EXPRESSIONS, STATEMENTS 9
Python interpreter and interactive mode; values and types: int, float, boolean, string, and list; variables,
expressions, statements, tuple assignment, precedence of operators, comments; modules and functions, func
definition and use, flow of execution, parameters and arguments; Illustrative programs: exchange the values of tw
variables, circulate the values of n variables, distance between two points.
UNIT III CONTROL FLOW, FUNCTIONS 9
Conditionals: Boolean values and operators, conditional (if), alternative (if-else), chained conditional (if-e
else); Iteration: state, while, for, break, continue, pass; Fruitful functions: return values, parameters, local and global
scope, function composition, recursion; Strings: string slices,

immutability, string functions and methods, string module; Lists as arrays. Illustrative programs: square root, gc
exponentiation, sum an array of numbers, linear search, binary search.
UNIT IV LISTS, TUPLES, DICTIONARIES 9
Lists: list operations, list slices, list methods, list loop, mutability, aliasing, cloning lists, list parameters; Tup
tuple assignment, tuple as return value; Dictionaries: operations and methods; advanced list processing
comprehension; Illustrative programs: selection sort, insertion sort, mergesort, histogram.
UNIT V FILES, MODULES, PACKAGES 9
Files and exception: text files, reading and writing files, format operator; command line arguments, errors and excep
handling exceptions, modules, packages; Illustrative programs: word count, copy file.
TOTAL: 45 PERIODS
OUTCOMES:
Upon completion of the course, students will be able to
 Develop algorithmic solutions to simple computational problems
 Read, write, execute by hand simple Python programs.
 Structure simple Python programs for solving problems.
 Decompose a Python program into functions.
 Represent compound data using Python lists, tuples, dictionaries.
 Read and write data from/to files in Python Programs.

TEXT BOOKS:1. Allen B. Downey, ``Think Python: How to Think Like a Computer Scientist’’, 2nd edition, Updated for Python 3, Shrof

OBJECTIVES:
 To develop in students, graphic skills for communication of concepts, ideas and design of Engineering
products.
 T o expose them to existing national standards related to technical drawings.
CONCEPTS AND CONVENTIONS (Not for Examination) 1
Importance of graphics in engineering applications – Use of drafting instruments – BIS conventions a
specifications – Size, layout and folding of drawing sheets – Lettering and
dimensioning.
UNIT I PLANE CURVES AND FREEHAND SKETCHING 7+12
Basic Geometrical constructions, Curves used in engineering practices: Conics – Construction of ellipse, parabola a
hyperbola by eccentricity method – Construction of cycloid – construction of involutes of square and circle – Drawing
tangents and normal to the above curves.
Visualization concepts and Free Hand sketching: Visualization principles –Representation of Three Dimension
objects – Layout of views- Freehand sketching of multiple views from pictorial views of objects
UNIT II PROJECTION OF POINTS, LINES AND PLANE SURFACE 6+12
Orthographic projection- principles-Principal planes-First angle projection-projection of points. Projection of stra
lines (only First angle projections) inclined to both the principal planes - Determination of true lengths and true
inclinations by rotating line method and traces Projection of planes (polygonal and circular surfaces) inclined to both
principal planes by rotating object method.
UNIT III PROJECTION OF SOLIDS 5+12
Projection of simple solids like prisms, pyramids, cylinder, cone and truncated solids when the axis is inclined
one of the principal planes by rotating object method.
UNIT IV PROJECTION OF SECTIONED SOLIDS AND DEVELOPMENT OF
SURFACES 5+12
Sectioning of above solids in simple vertical position when the cutting plane is inclined to the one of the principal p
and perpendicular to the other – obtaining true shape of section. Development of lateral surfaces of simple a
sectioned solids – Prisms, pyramids cylinders and cones.
UNIT V ISOMETRIC AND PERSPECTIVE PROJECTIONS 6 +12
Principles of isometric projection – isometric scale –Isometric projections of simple solids and truncated solids
Prisms, pyramids, cylinders, cones- combination of two solid objects in simple vertical positions - Perspective proje
of simple solids-Prisms, pyramids and cylinders by visual ray method .

TOTAL: 90 PERIODS
OUTCOMES:
On successful completion of this course, the student will be able to:
 Familiarize with the fundamentals and standards of Engineering graphics
 Perform freehand sketching of basic geometrical constructions and multiple views of objects.
 Project orthographic projections of lines and plane surfaces.
 Draw projections and solids and development of surfaces.
 Visualize and to project isometric and perspective sections of simple solids.
TEXT BOOKS:
1. Natrajan K.V., “A text book of Engineering Graphics”, Dhanalakshmi Publishers, Chennai, 2009.
2. Venugopal K. and Prabhu Raja V., “Engineering Graphics”, New Age International (P) Limited, 2008.
REFERENCES:
1. Bhatt N.D. and Panchal V.M., “Engineering Drawing”, Charotar Publishing House, 50th Edition, 2010.
2. Basant Agarwal and Agarwal C.M., “Engineering Drawing”, Tata McGraw Hill Publishing Company Limited, New
2008.
3. Gopalakrishna K.R., “Engineering Drawing” (Vol. I&II combined), Subhas Stores, Bangalore, 2007.

4. Luzzader, Warren.J. and Duff,John M., “Fundamentals of Engineering Drawing with an

introduction to Interactive Computer Graphics for Design and Production, Eastern Economy Edition, Prentice Ha
India Pvt. Ltd, New Delhi, 2005.
5 N. S. Parthasarathy and Vela Murali, “ Engineering Graphics”, Oxford University, Press,
New Delhi, 2015.
6. Shah M.B., and Rana B.C., “Engineering Drawing”, Pearson, 2 nd Edition
Publication of Bureau of Indian Stan
1. IS 10711 – 2001: Technical products Documentation – Size and lay out of drawing s
2. IS 9609 (Parts 0 & 1) – 2001: Technical products Documentation – Le
3. IS 10714 (Part 20) – 2001 & SP 46 – 2003: Lines for technical dra
4. IS 11669 – 1986 & SP 46 – 2003: Dimensioning of Technical Dra
5. IS 15021 (Parts 1 to 4) – 2001: Technical drawings – Projection Me
Special points applicable to University Examinations on Engineering Gra
1. There will be five questions, each of either or type covering all units of the sy
2. All questions will carry equal marks of 20 each making a total
3. The answer paper shall consist of drawing sheets of A3 size only. The students will be permitted t
appropriate scale to fit solution within A
4. The examination will be conducted in appropriate sessions on the sam
GE8161 PROBLEM SOLVING AND PYTHON PROGRAMMING LABORATORY L
0
OBJECTIVES:
 To write, test, and debug simple Python programs.
 To implement Python programs with conditionals and loops.
 Use functions for structuring Python programs.
 Represent compound data using Python lists, tuples, dictionaries.
 Read and write data from/to files in Python.
LIST OF PROGRAMS:
1. Compute the GCD of two numbers.
2. Find the square root of a number (Newton’s method)
3. Exponentiation (power of a number)
4. Find the maximum of a list of numbers
5. Linear search and Binary search
6. Selection sort, Insertion sort
7. Merge sort
8. First n prime numbers
9. Multiply matrices
10. Programs that take command line arguments (word count)
11. Find the most frequent words in a text read from a file
12. Simulate elliptical orbits in Pygame
13. Simulate bouncing ball using Pygame
PLATFORM NEEDED
Python 3 interpreter for Windows/Linux
OUTCOMES:
Upon completion of the course, students will be able to:
 Write, test, and debug simple Python programs.
 Implement Python programs with conditionals and loops.

TOTAL: 60 PERIODS
 Develop Python programs step-wise by defining functions and calling them.

 Use Python lists, tuples, dictionaries for representing compound data.

 Read and write data from/to files in Python.

BS8161
PHYSICS AND CHEMISTRY LABORATORY L T P C
(Common to all branches of B.E. / B.Tech Programmes) 0 0 4 2
OBJECTIVES:
 To introduce different experiments to test basic understanding of physics concepts applied in optics, thermal phy
properties of matter and liquids.
LIST OF EXPERIMENTS: PHYSICS LABORATORY (Any 5 Experiments)
1. Determination of rigidity modulus – Torsion pendulum
2. Determination of Young’s modulus by non-uniform bending method
3. (a) Determination of wavelength, and particle size using Laser
(b) Determination of acceptance angle in an optical fiber.
4. Determination of thermal conductivity of a bad conductor – Lee’s Disc method.
5. Determination of velocity of sound and compressibility of liquid – Ultrasonic interferometer
6. Determination of wavelength of mercury spectrum – spectrometer grating
7. Determination of band gap of a semiconductor
8. Determination of thickness of a thin wire – Air wedge method

TOTAL: 30 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to

 Apply principles of elasticity, optics and thermal properties for engineering applications.
CHEMISTRY LABORATORY: (Any seven experiments to be conducted) OBJECTIVES:
 To make the student to acquire practical skills in the determination of water quality parameters through
volumetric and instrumental analysis.
 To acquaint the students with the determination of molecular weight of a polymer by viscometery.
1. Estimation of HCl using Na CO as primary standard and Determination of alkalinity in water
2 3 sample.
2. Determination of total, temporary & permanent hardness of water by EDTA method.
3. Determination of DO content of water sample by Winkler’s method.
4. Determination of chloride content of water sample by argentometric method.
5. Estimation of copper content of the given solution by Iodometry.
6. Determination of strength of given hydrochloric acid using pH meter.
7. Determination of strength of acids in a mixture of acids using conductivity meter.
8. Estimation of iron content of the given solution using potentiometer.
9. Estimation of iron content of the water sample using spectrophotometer (1, 10- Phenanthroline / thiocyanate meth
10. Estimation of sodium and potassium present in water using flame photometer.
11. Determination of molecular weight of polyvinyl alcohol using Ostwald viscometer.
12. Pseudo first order kinetics-ester hydrolysis.
13. Corrosion experiment-weight loss method.
14. Determination of CMC.
15. Phase change in a solid.

16. Conductometric titration of strong acid vs strong base.

OUTCOMES:
 The students will be outfitted with hands-on knowledge in the quantitative chemical analysis of water quality
related parameters.
TOTAL: 30 PERIODS
TEXTBOOK:
1. Vogel’s Textbook of Quantitative Chemical Analysis (8TH edition, 2014).
HS8251
TECHNICAL ENGLISH
L
4
OBJECTIVES:
The Course prepares second semester engineering and Technology students to:
• Develop strategies and skills to enhance their ability to read and comprehend engineering and techn
texts.
• Foster their ability to write convincing job applications and effective reports.
• Develop their speaking skills to make technical presentations, participate in group discussions.
• Strengthen their listening skill which will help them comprehend lectures and talks in their areas of
specialization.

UNIT I INTRODUCTION TECHNICAL ENGLISH 12

Listening- Listening to talks mostly of a scientific/technical nature and completing information-gap exercises-
Speaking –Asking for and giving directions- Reading – reading short technical texts from journals- newsapapers
Writing- purpose statements – extended definitions – issue- writing instructions – checklists-recommendations
Vocabulary Development- technical vocabulary Language Development –subject verb agreement - compo
words.

UNIT II READING AND STUDY SKILLS 12

Listening- Listening to longer technical talks and completing exercises based on them-Speaking – describing a
process-Reading – reading longer technical texts- identifying the various transitions in a text- paragraphing-
Writing- interpreting cgarts, graphs- Vocabulary Development- vocabulary used in formal letters/emai
reports Language Development- impersonal passive voice, numerical adjectives.

UNIT III TECHNICAL WRITING AND GRAMMAR 12

Listening- Listening to classroom lectures/ talkls on engineering/technology -Speaking – introduction
technical presentations- Reading – longer texts both general and technical, practice in speed reading;
Writing-Describing a process, use of sequence words- Vocabulary Development- sequence words-
Misspelled words. Language Development- embedded sentences

UNIT IV REPORT WRITING 12

Listening- Listening to documentaries and making notes. Speaking – mechanics of presentations-
Reading – reading for detailed comprehension- Writing- email etiquette- job application – cover letter –Ré
preparation( via email and hard copy)- analytical essays and issue based essays--Vocabulary Developmen
finding suitable synonyms-paraphrasing-. Language Development- clauses- if conditionals.
UNIT V GROUP DISCUSSION AND JOB APPLICATIONS 12
Listening- TED/Ink talks; Speaking –participating in a group discussion -Reading– reading and understanding tec
articles Writing– Writing reports- minutes of a meeting- accident and survey-Vocabulary Development- ve
analogies Language Development- reported speech.

TOTAL :60 PERIODS

OUTCOMES:
At the end of the course learners will be able to:
 Read technical texts and write area- specific texts effortlessly.


Listen and comprehend lectures and talks in their area of specialisation succe
 Speak appropriately and effectively in varied formal and informal co
 Write reports and winning job applic
TEXT BO
1. Board of editors. Fluency in English A Course book for Engineering and Techn
Orient Blackswan, Hyderabad
2. Sudharshana.N.P and Saveetha. C. English for Technical Communication. Cambridge University Pres
Delhi
REFERE
1. Raman, Meenakshi and Sharma, Sangeetha- Technical Communication Principles and Practice.
University Press: New Delh
2. Kumar, Suresh. E. Engineering English. Orient Blackswan: Hyderaba
3. Booth-L. Diana, Project Work, Oxford University Press, Oxford
4. Grussendorf, Marion, English for Presentations, Oxford University Press, Oxford
5. Means, L. Thomas and Elaine Langlois, English & Communication For Co
Cengage Learning, USA
Students can be asked to read Tagore, Chetan Bhagat and for supplementary re
MA8251 ENGINEERING MATHEMATICS – II L T
4 0
OBJECTIVES:
This course is designed to cover topics such as Matrix Algebra, Vector Calculus, Complex Analysis and Lap
Transform. Matrix Algebra is one of the powerful tools to handle practical problems arising in the field of engineerin
Vector calculus can be widely used for modelling the various laws of physics. The various methods of complex analy
and Laplace transforms can be used for efficiently solving the problems that occur in various branches of engineerin
disciplines.
UNIT I MATRICES 12
Eigenvalues and Eigenvectors of a real matrix – Characteristic equation – Properties of Eigenvalues
Eigenvectors – Cayley-Hamilton theorem – Diagonalization of matrices – Reduction of a quadratic form to cano
form by orthogonal transformation – Nature of quadratic forms.
UNIT II VECTOR CALCULUS 12
Gradient and directional derivative – Divergence and curl - Vector identities – Irrotational and Solenoidal ve
fields – Line integral over a plane curve – Surface integral - Area of a curved surface - Volume integral - Green’s, Ga
divergence and Stoke’s theorems – Verification and
application in evaluating line, surface and volume integrals.

UNIT III ANALYTIC FUNCTIONS 12

Analytic functions – Necessary and sufficient conditions for analyticity in Cartesian and polar coordinates -
Properties – Harmonic conjugates – Construction of analytic function - Conformal

mapping – Mapping by functions w  z  c, cz, 1 ,z2 - Bilinear transformation.

z
UNIT IV COMPLEX INTEGRATION 12
Line integral - Cauchy’s integral theorem – Cauchy’s integral formula – Taylor’s and Laurent’s series – Singu
– Residues – Residue theorem – Application of residue theorem for evaluation of real integrals – Use of circu
contour and semicircular contour.
UNIT V LAPLACE TRANSFORMS 12
Existence conditions – Transforms of elementary functions – Transform of unit step function and unit impulse funct
Basic properties – Shifting theorems -Transforms of derivatives and integrals – Initial and final value theore
Inverse transforms – Convolution theorem – Transform of periodic functions – Application to solution of linear sec
order ordinary differential equations with constant coefficients.

TOTAL: 60 PERIODS
OUTCOMES :
After successfully completing the course, the student will have a good understanding of the following to
and their applications:
 Eigen values and eigenvectors, diagonalization of a matrix, Symmetric matrices, Positive definite matrices and si
matrices.
 Gradient, divergence and curl of a vector point function and related identities.
 Evaluation of line, surface and volume integrals using Gauss, Stokes and Green’s theorems and their
verification.
 Analytic functions, conformal mapping and complex integration.
 Laplace transform and inverse transform of simple functions, properties, various related theorems and applicat
differential equations with constant coefficients.
TEXT BOOKS:
1. Grewal B.S., “Higher Engineering Mathematics”, Khanna Publishers, New Delhi, 43 rd Edition, 2014.
2. Kreyszig Erwin, "Advanced Engineering Mathematics ", John Wiley and Sons, 10 th Edition, New Delh
2016.
REFERENCES :
1. Bali N., Goyal M. and Watkins C., “Advanced Engineering Mathematics”, Firewall Media (An imprint
Lakshmi Publications Pvt., Ltd.,), New Delhi, 7th Edition, 2009.
2. Jain R.K. and Iyengar S.R.K., “ Advanced Engineering Mathematics ”, Narosa Publications, New D
3rd Edition, 2007.
3. O’Neil, P.V. “Advanced Engineering Mathematics”, Cengage Learning India Pvt., Ltd, New Del
2007.
4. Sastry, S.S, “Engineering Mathematics", Vol. I & II, PHI Learning Pvt. Ltd, 4 th Edition, New
2014.
5. Wylie, R.C. and Barrett, L.C., “Advanced Engineering Mathematics “Tata McGraw Hill Education Pvt. Ltd,
Edition, New Delhi, 2012.

PH8252 PHYSICS FOR INFORMATION SCIENCE L T P C

(Common to CSE & IT) 3 0 0 3

OBJECTIVES:
 To understand the essential principles of Physics of semiconductor device and Electron
transport properties. Become proficient in magnetic and optical properties of materials and Nano-electronic dev
UNIT I ELECTRICAL PROPERTIES OF MATERIALS 9
Classical free electron theory - Expression for electrical conductivity – Thermal conductivity, expression -
Wiedemann-Franz law – Success and failures - electrons in metals – Particle in a three dimensional box – degene
states – Fermi- Dirac statistics – Density of energy states – Electron in periodic potential – Energy bands in solid
tight binding approximation - Electron effective mass – concept of hole.
UNIT II SEMICONDUCTOR PHYSICS 9
Intrinsic Semiconductors – Energy band diagram – direct and indirect band gap semiconductors – Carrier concen
in intrinsic semiconductors – extrinsic semiconductors - Carrier concentration in N-type & P-type
semiconductors – Variation of carrier concentration with temperature – variation of Fermi level with tempera
and impurity concentration – Carrier transport in Semiconductor: random motion, drift, mobility and diffusion – Hal
and devices – Ohmic contacts – Schottky diode.
UNIT III MAGNETIC PROPERTIES OF MATERIALS 9
Magnetic dipole moment – atomic magnetic moments- magnetic permeability and susceptibility - Magnetic materi
classification: diamagnetism – paramagnetism – ferromagnetism – antiferromagnetism – ferrimagnetis
Ferromagnetism: origin and exchange interaction- saturation magnetization and Curie temperature – Domain T
M versus H behaviour – Hard and soft magnetic materials – examples and uses-– Magnetic principle in computer d
storage – Magnetic hard disc (GMR sensor).
UNIT IV OPTICAL PROPERTIES OF MATERIALS 9
Classification of optical materials – carrier generation and recombination processes - Absorption emission and scatte
of light in metals, insulators and semiconductors (concepts only) - photo current in a P-N diode – solar cell - LED –
Organic LED – Laser diodes – Optical data storage techniques.
UNIT V NANO DEVICES 9
Electron density in bulk material – Size dependence of Fermi energy – Quantum confinement – Quantum structures
Density of states in quantum well, quantum wire and quantum dot structure
- Band gap of nanomaterials – Tunneling: single electron phenomena and single electron transistor – Quantu
laser. Conductivity of metallic nanowires – Ballistic transport – Quantum resistance and conductance – Carbon nano
Properties and applications .

TOTAL :45 PERIODS

OUTCOMES:
At the end of the course, the students will able to
 Gain knowledge on classical and quantum electron theories, and energy band structuues,
 Acquire knowledge on basics of semiconductor physics and its applications in various devices,
 Get knowledge on magnetic properties of materials and their applications in data storage,
 Have the necessary understanding on the functioning of optical materials for optoelectronics,
 Understand the basics of quantum structures and their applications in carbon electronics..
TEXT BOOKS:
1. Jasprit Singh, “Semiconductor Devices: Basic Principles”, Wiley 2012.
2. Kasap, S.O. “Principles of Electronic Materials and Devices”, McGraw-Hill Education, 2007.
3. Kittel, C. “Introduction to Solid State Physics”. Wiley, 2005.

REFERENCES:
1. Garcia, N. & Damask, A. “Physics for Computer Science Students”. Springer-Verlag, 2012.
2. Hanson, G.W. “Fundamentals of Nanoelectronics”. Pearson Education, 2009.
3. Rogers, B., Adams, J. & Pennathur, S. “Nanotechnology: Understanding Small Systems”. CRC Press, 2014.
BE8255 BASIC ELECTRICAL, ELECTRONICS AND MEASUREMENT L T P C ENGINEERING
3 003
OBJECTIVES:
 To understand the fundamentals of electronic circuit constructions.
 To learn the fundamental laws, theorems of electrical circuits and also to analyze them
 To study the basic principles of electrical machines and their performance
 To study the different energy sources, protective devices and their field applications
 To understand the principles and operation of measuring instruments and transducers
UNIT I ELECTRICAL CIRCUITS ANALYSIS 9
Ohms Law, Kirchhoff’s Law-Instantaneous power- series and parallel circuit analysis with resistive, capacitive and
inductive network - nodal analysis, mesh analysis- network theorems - Thevenins theorem, Norton theorem, maxim
power transfer theorem and superposition theorem, three phase supply-Instantaneous, Reactive and apparent p
star delta conversion.
UNIT II ELECTRICAL MACHINES 9
DC and AC ROTATING MACHINES:Types, Construction, principle, Emf and torque equation, application Spe
Control- Basics of Stepper Motor – Brushless DC motors- Transformers- Introduction- types and construction,
working principle of Ideal transformer-Emf equation- All day efficiency calculation.
UNIT III UTILIZATION OF ELECTRICAL POWER 9
Renewable energy sources-wind and solar panels. Illumination by lamps- Sodium Vapour, Mercury vapour,
Fluorescent tube. Domestic refrigerator and air conditioner-Electric circuit, construction and working principle.
Batteries-NiCd, Pb Acid and Li ion–Charge and Discharge Characteristics. Protection-need for earthing, fuses a
circuit breakers.Energy Tariff calculation for domestic loads.
UNIT IV ELECTRONIC CIRCUITS 9
PN Junction-VI Characteristics of Diode, zener diode, Transistors configurations - amplifiers. Op amps- Amplifiers,
oscillator,rectifiers, differentiator, integrator, ADC, DAC. Multi vibrator using 555 Timer IC . Voltage regulator IC usin
723,LM 317.
UNIT V ELECTRICAL MEASUREMENT 9
Characteristic of measurement-errors in measurement, torque in indicating instruments- moving coil and mov
iron meters, Energy meter and watt meter. Transducers- classification-thermo electric, RTD, Strain gauge, LVD
LDR and piezoelectric. Oscilloscope-CRO.
TOTAL: 45 PERIODS

OUTCOMES:
Upon completion of the course, the students will be able to:
 Discuss the essentials of electric circuits and analysis.
 Discuss the basic operation of electric machines and transformers
 Introduction of renewable sources and common domestic loads.
 Introduction to measurement and metering for electric circuits.
 TEXT BO
1. D.P. Kotharti and I.J Nagarath, Basic Electrical and Electronics
Engineering, Mc Gra
2016,Third E
2. M.S. Sukhija and T.K. Nagsarkar, Basic Electrical and Electronic Engineering, Oxford
REFERE
1. S.B. Lal Seksena and Kaustuv Dasgupta, Fundaments of Electrical Engineering, Cambridge
2. B.L Theraja, Fundamentals of Electrical Engineering and Electronics. Chand & Co
3. S.K.Sahdev, Basic of Electrical Engineering, Pearson
4. John Bird, ―Electrical and Electronic Principles and Technologyǁ, Fourth Edition, E

5. Mittle,Mittal, Basic Electrical Engineeringǁ, 2nd Edition, Tata McGraw-Hill Edition

6. C.L.Wadhwa, “Generation, Distribution and Utilisation of Electrical Energy”, New Age intern
pvt.ltd
GE8291 ENVIRONMENTAL SCIENCE AND ENGINEERING L
3
OBJECTIVES:
 To study the nature and facts about environment.
 To finding and implementing scientific, technological, economic and political solutions to environmental pro
 To study the interrelationship between living organism and environment.
 To appreciate the importance of environment by assessing its impact on the human world; envision the surround
environment, its functions and its value.
 To study the dynamic processes and understand the features of the earth‟s interior and
surface.
 To study the integrated themes and biodiversity, natural resources, pollution control and waste management.
UNIT I ENVIRONMENT, ECOSYSTEMS AND BIODIVERSITY 14
Definition, scope and importance of environment – need for public awareness - 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 (a) forest ecosystem (b) grassland ecosystem (c) desert ecosystem (d) a
ecosystems (ponds, streams, lakes, rivers, oceans, estuaries) – Introduction to biodiversity 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
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-si
conservation of biodiversity. Field study of common plants, insects, birds; Field study of simple ecosystems – pond,
hill slopes, etc.
UNIT II ENVIRONMENTAL POLLUTION 8
Definition – causes, effects and control measures of: (a) Air pollution (b) Water pollution (c) Soil pollution (d) Marine
pollution (e) Noise pollution (f) Thermal pollution (g) Nuclear hazards – solid waste management: causes, effects an
control measures of municipal solid wastes – role of an individual in prevention of pollution – pollution case stud
disaster management: floods, earthquake, cyclone and landslides. Field study of local polluted site – Urban / Rural
Industrial /
Agricultural.
UNIT III NATURAL RESOURCES 10
Forest resources: Use and over-exploitation, deforestation, case studies- timber extraction, mining, dams and their e
on forests and tribal people – Water resources: Use and over- utilization of surface and ground water, floods, dro
conflicts over water, dams-benefits and problems – Mineral resources: Use and exploitation, environmental e
of extracting and using mineral resources, case studies – Food resources: World food problems, changes caused
agriculture and overgrazing, effects of modern agriculture, fertilizer-pesticide problems, water logging, salinity, case
studies – Energy resources: Growing energy needs, renewable and non renewable energy sources, use of alternate
energy sources. case studies – Land resources: Land as a resource, land degradation, man induced landslides, s
erosion and desertification – role of an individual in conservation of natural resources – Equitable use of
resources for sustainable lifestyles. Field study of local area to document environmental assets – river / forest /
grassland / hill / mountain.
UNIT IV SOCIAL ISSUES AND THE ENVIRONMENT 7
From unsustainable to sustainable development – urban problems related to energy – water conserv
rain water harvesting, watershed management – resettlement and rehabilitation of people; its problems
concerns, case studies – role of non-governmental organization- environmental ethics: Issues and possible
solutions – climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and holocau
case studies. – wasteland reclamation – consumerism and waste products – environment production act – A
(Prevention and Control of Pollution) act – Water (Prevention and control of Pollution) act – Wildlife protec
act – Forest conservation act – enforcement machinery involved in environmental legislation- central and
pollution control boards- Public awareness.
UNIT V HUMAN POPULATION AND THE ENVIRONMENT 6
Population growth, variation among nations – population explosion – family welfare programme – environment and
human health – human rights – value education – HIV / AIDS – women and child welfare – role of informatio
technology in environment and human health – Case studies.

TOTAL: 45 PERIODS
OUTCOMES:
 Environmental Pollution or problems cannot be solved by mere laws. Public participation is an important aspect
serves the environmental Protection. One will obtain knowledge on the following after completing the course.
 Public awareness of environmental is at infant stage.
 Ignorance and incomplete knowledge has lead to misconceptions
 Development and improvement in std. of living has lead to serious environmental disasters
TEXTBOOKS:
1. Benny Joseph, ‘Environmental Science and Engineering’, Tata McGraw-Hill, New Delhi, 2006.
2. Gilbert M.Masters, ‘Introduction to Environmental Engineering and Science’, 2 nd edition, Pearson Education,
REFERENCES :
1. Dharmendra S. Sengar, ‘Environmental law’, Prentice hall of India PVT LTD,New Delhi, 2007.
2. Erach Bharucha, “Textbook of Environmental Studies”, Universities Press(I) PVT, LTD, Hydrabad, 2015.
3. Rajagopalan, R, ‘Environmental Studies-From Crisis to Cure’, Oxford University Press, 2005.
4. G. Tyler Miller and Scott E. Spoolman, “Environmental Science”, Cengage Learning India
PVT, LTD, Delhi, 2014.

CS8251 PROGRAMMING IN C L
3
OBJECTIVES:
 To develop C Programs using basic programming constructs
 To develop C programs using arrays and strings
 To develop applications in C using functions , pointers and structures
 To do input/output and file handling in C
UNIT I BASICS OF C PROGRAMMING 9
Introduction to programming paradigms - Structure of C program - C programming: Data Types – Storage classes -
Constants – Enumeration Constants - Keywords – Operators: Precedence and Associativity - Expressions - Input/O
statements, Assignment statements – Decision making statements - Switch statement - Looping statements – P
processor directives - Compilation process
UNIT II ARRAYS AND STRINGS 9
Introduction to Arrays: Declaration, Initialization – One dimensional array – Example Program: Computing M
Median and Mode - Two dimensional arrays – Example Program: Matrix Operations (Addition, Scaling, Determ
and Transpose) - String operations: length, compare, concatenate, copy – Selection sort, linear and binary search
UNIT III FUNCTIONS AND POINTERS 9
Introduction to functions: Function prototype, function definition, function call, Built-in functions (string function
math functions) – Recursion – Example Program: Computation of Sine series, Scientific calculator using built-in
functions, Binary Search using recursive functions – Pointers – Pointer operators – Pointer arithmetic – Arrays a
pointers – Array of pointers – Example Program: Sorting of names – Parameter passing: Pass by value, Pass b
reference – Example Program: Swapping of two numbers and changing the value of a variable using pass by refere
UNIT IV STRUCTURES 9
Structure - Nested structures – Pointer and Structures – Array of structures – Example Program using structures a
pointers – Self referential structures – Dynamic memory allocation - Singly linked list - typedef
UNIT V FILE PROCESSING 9
Files – Types of file processing: Sequential access, Random access – Sequential access file - Example Progr
Finding average of numbers stored in sequential access file - Random access file - Example Program: Transactio
processing using random access files – Command line arguments
OUTCOMES:
Upon completion of the course, the students will be able to
 Develop simple applications in C using basic constructs
 Design and implement applications using arrays and strings
 Develop and implement applications in C using functions and pointers.
 Develop applications in C using structures.
 Design applications using sequential and random access file processing.
TEXT BOOKS:
1. Reema Thareja, “Programming in C”, Oxford University Press, Second Edition, 2016.
2. Kernighan, B.W and Ritchie,D.M, “The C Programming language”, Second Edition, Pearson Education
2006
REFERENCES:
1. Paul Deitel and Harvey Deitel, “C How to Program”, Seventh edition, Pearson Publication
2. Juneja, B. L and Anita Seth, “Programming in C”, CENGAGE Learning India pvt. Ltd., 2011
Upon completion of the course, the students will be able to
 Develop simple applications in C using basic constructs
 Design and implement applications using arrays and strings
 Develop and implement applications in C using functions and pointers.
 Develop applications in C using structures.
 Design applications using sequential and random access file processing.
TEXT BOOKS:
1. Reema Thareja, “Programming in C”, Oxford University Press, Second Edition, 2016.
2. Kernighan, B.W and Ritchie,D.M, “The C Programming language”, Second Edition, Pearson Education
2006
REFERENCES:
1. Paul Deitel and Harvey Deitel, “C How to Program”, Seventh edition, Pearson Publication
2. Juneja, B. L and Anita Seth, “Programming in C”, CENGAGE Learning India pvt. Ltd., 2011

3. Pradip Dey, Manas Ghosh, “Fundamentals of Computing and Programming in C”, First Edition, Oxford Un
Press
4. Anita Goel and Ajay Mittal, “Computer Fundamentals and Programming in C”, Dorling Kindersley (Ind
Ltd., Pearson Education in South Asia
5. Byron S. Gottfried, "Schaum's Outline of Theory and Problems of Programming with C",McGraw-Hill Edu

GE8261 ENGINEERING PRACTICES LABORATORY L

0

OBJECTIVES:
 To provide exposure to the students with hands on experience on various basic engineering practices in Civil,
Mechanical, Electrical and Electronics Engineering.
GROUP A (CIVIL & MECHANICAL)
I CIVIL ENGINEERING PRACTICE 13
BUILDINGS:
(a) Study of plumbing and carpentry components of residential and industrial buildings.
Safety
aspects.
PLUMBING WORKS:
(a) Study of pipeline joints, its location and functions: valves, taps, couplings, unions, reducers,
elbows in household fittings.
(b) Study of pipe connections requirements for pumps and turbines.
(c) Preparation of plumbing line sketches for water supply and sewage works.
(d) Hands-on-exercise:
Basic pipe connections – Mixed pipe material connection – Pipe connections with different joining components.
(e) Demonstration of plumbing requirements of high-rise buildings.
CARPENTRY USING POWER TOOLS ONLY:
(a) Study of the joints in roofs, doors, windows and furniture.
(b) Hands-on-exercise:
Wood work, joints by sawing, planing and cutting.
II MECHANICAL ENGINEERING PRACTICE 18
WELDING:
(a) Preparation of butt joints, lap joints and T- joints by Shielded metal arc welding.
(b) Gas welding practice
BASIC MACHINING:
(a) Simple Turning and Taper turning
(b) Drilling Practice
SHEET METAL WORK:
(a) Forming & Bending:
(b) Model making – Trays and funnels.
(c) Different type of joints.
MACHINE ASSEMBLY PRACTICE:
(a) Study of centrifugal pump
(b) Study of air conditioner
DEMONSTRATION ON:
(a) Smithy operations, upsetting, swaging, setting down and bending. Example – Exercise – Production of hexagon
headed bolt.
(b) Foundry operations like mould preparation for gear and step cone pulley.
(c) Fitting – Exercises – Preparation of square fitting and V – fitting models.
GROUP B (ELECTRICAL & ELECTRONICS)
III ELECTRICAL ENGINEERING PRACTICE 13
1. Residential house wiring using switches, fuse, indicator, lamp and energy meter.
2. Fluorescent lamp wiring.
3. Stair case wiring
4. Measurement of electrical quantities – voltage, current, power & power factor in RLC circuit.
5. Measurement of energy using single phase energy meter.
6. Measurement of resistance to earth of an electrical equipment.
IV ELECTRONICS ENGINEERING PRACTICE 16
1. Study of Electronic components and equipments – Resistor, colour coding measurement of AC s
parameter (peak-peak, rms period, frequency) using CR.
2. Study of logic gates AND, OR, EX-OR and NOT.
3. Generation of Clock Signal.
4. Soldering practice – Components Devices and Circuits – Using general purpose PCB.
5. Measurement of ripple factor of HWR and FWR.

TOTAL: 60 PERIODS
OUTCOMES:
On successful completion of this course, the student will be able to

Fabricate carpentry components and pipe connections including plumbing works. Use welding equipments to
the structures.
Carry out the basic machining operations Make the models using sheet metal works
Illustrate on centrifugal pump, Air conditioner, operations of smithy, foundary and fittings
Carry out basic home electrical works and appliances Measure the electrical quantities
Elaborate on the components, gates, soldering practices.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

CIVIL
1. Assorted components for plumbing consisting of metallic pipes, plastic pipes, flexible pipes, couplings, unions, elb
plugs and
other fittings. 15 Sets.
2. Carpentry vice (fitted to work bench) 15 Nos.
3. Standard woodworking tools 15 Sets.
4. Models of industrial trusses, door joints, furniture joints 5 each
5. Power Tools: (a) Rotary Hammer 2 Nos
(b) Demolition Hammer 2 Nos
(c) Circular Saw 2 Nos
(d) Planer 2 Nos
(e) Hand Drilling Machine 2 Nos
(f) Jigsaw 2 Nos
MECHANICAL
1. Arc welding transformer with cables and holders 5 Nos.

2. Welding booth with exhaust facility

3. Welding accessories like welding shield, chipping ha
wire brush, etc.
4. Oxygen and acetylene gas cylinders, blow pipe an
welding outfit.
5. Centre lathe
6. Hearth furnace, anvil and smithy tools
7. Moulding table, foundry tools
8. Power Tool: Angle Grinder
9. Study-purpose items: centrifugal pump, air-conditioner One
ELECT
1. Assorted electrical components for house wiring 1
2. Electrical measuring instruments 1
3. Study purpose items: Iron box, fan and regulator, emergency lamp
4. Megger (250V/500V)
5. Power Tools: (a) Range Finder
(b) Digital Live-wire detector
 ELECTR
1. Soldering guns 1
2. Assorted electronic components for making circuits 5
3. Small PCBs 1
4. Multimeters 1
5. Study purpose items: Telephone, FM radio, low-voltage power
CS8261 C PROGRAMMING LABORATORY L
0

OBJECTIVES:
 To develop programs in C using basic constructs.
 To develop applications in C using strings, pointers, functions, structures.
 To develop applications in C using file processing.
LIST OF EXPERIMENTS:
1. Programs using I/O statements and expressions.
2. Programs using decision-making constructs.
3. Write a program to find whether the given year is leap year or Not? (Hint: not every centurion year is a leap. For
example 1700, 1800 and 1900 is not a leap year)
4. Design a calculator to perform the operations, namely, addition, subtraction, multiplication, division and square o
number.
5. Check whether a given number is Armstrong number or not?
6. Given a set of numbers like <10, 36, 54, 89, 12, 27>, find sum of weights based on the following conditions.
 5 if it is a perfect cube.
 4 if it is a multiple of 4 and divisible by 6.
 3 if it is a prime number.
Sort the numbers based on the weight in the increasing order as shown below
<10,its weight>,<36,its weight><89,its weight>
7. Populate an array with height of persons and find how many persons are above the average height.
8. Populate a two dimensional array with height and weight of persons and compute the Body Mass Index of the
individuals.
9. Given a string “a$bcd./fg” find its reverse without changing the position of special characters.
(Example input:a@gh%;j and output:j@hg%;a)
 10. Convert the given decimal number into binary, octal and hexadecimal numbers using user defined functions.
11. From a given paragraph perform the following using built-in functions:
a. Find the total number of words.
b. Capitalize the first word of each sentence.
c. Replace a given word with another word.
12. Solve towers of Hanoi using recursion.
13. Sort the list of numbers using pass by reference.
14. Generate salary slip of employees using structures and pointers.
15. Compute internal marks of students for five different subjects using structures and functions.
16. Insert, update, delete and append telephone details of an individual or a company into a telephone directory u
random access file.
17. Count the number of account holders whose balance is less than the minimum balance using sequent
access file.
Mini project
18. Create a “Railway reservation system” with the following modules
 Booking
 Availability checking
 Cancellation
 Prepare chart

TOTAL: 60 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to:

 Develop C programs for simple applications making use of basic constructs, arrays and s
 Develop C programs involving functions, recursion, pointers, and stru
 Design applications using sequential and random access file proc
MA8351 DISCRETE MATHEMATICS L T
4 0
OBJECTIVES:
 To extend student’s logical and mathematical maturity and ability to deal with abstraction.
 To introduce most of the basic terminologies used in computer science courses and application of ideas
solve practical problems.
 To understand the basic concepts of combinatorics and graph theory.
 To familiarize the applications of algebraic structures.
 To understand the concepts and significance of lattices and boolean algebra which are widely used in
computer science and engineering.
UNIT I LOGIC AND PROOFS 12
Propositional logic – Propositional equivalences - Predicates and quantifiers – Nested quantifiers – Rules of inferenc
Introduction to proofs – Proof methods and strategy.
UNIT II COMBINATORICS 12
Mathematical induction – Strong induction and well ordering – The basics of counting – The pigeonhole pri
– Permutations and combinations – Recurrence relations – Solving linear recurrence relations – Generating
functions – Inclusion and exclusion principle and its applications
UNIT III GRAPHS 12
Graphs and graph models – Graph terminology and special types of graphs – Matrix representation
graphs and graph isomorphism – Connectivity – Euler and Hamilton paths.

UNIT IV ALGEBRAIC STRUCTURES 12

Algebraic systems – Semi groups and monoids - Groups – Subgroups – Homomorphism’s – Normal
subgroup and cosets – Lagrange’s theorem – Definitions and examples of Rings and Fields.

UNIT V LATTICES AND BOOLEAN ALGEBRA 12

Partial ordering – Posets – Lattices as posets – Properties of lattices - Lattices as algebraic systems – S
lattices – Direct product and homomorphism – Some special lattices – Boolean algebra.

TOTAL: 60 PERIODS
OUTCOMES:
At the end of the course, students would:
 Have knowledge of the concepts needed to test the logic of a program.
 Have an understanding in identifying structures on many levels.
 Be aware of a class of functions which transform a finite set into another finite set which relates to in
and output functions in computer science.
 Be aware of the counting principles.
 Be exposed to concepts and properties of algebraic structures such as groups, rings and fields.

TEXTBOOKS:
1. Rosen, K.H., "Discrete Mathematics and its Applications", 7 th Edition, Tata McGraw Hill Pub. Co.
New Delhi, Special Indian Edition, 2011.
2. Tremblay, J.P. and Manohar.R, " Discrete Mathematical Structures with Applications to Computer Scie
Tata McGraw Hill Pub. Co. Ltd, New Delhi, 30th Reprint, 2011.
REFERENCES:
1. Grimaldi, R.P. "Discrete and Combinatorial Mathematics: An Applied Introduction", 4 th Edition, Pearson Educa
Asia, Delhi, 2007.
2. Lipschutz, S. and Mark Lipson., "Discrete Mathematics", Schaum’s Outlines, Tata McGraw Hill Pub. Co. Ltd.,
Delhi, 3rd Edition, 2010.
3. Koshy, T. "Discrete Mathematics with Applications", Elsevier Publications, 2006.
 CS8351
DIGITAL PRINCIPLES AND SYSTEM DESIGN L
4
OBJECTIVES:
• To design digital circuits using simplified Boolean functions
• To analyze and design combinational circuits
• To analyze and design synchronous and asynchronous sequential circuits
• To understand Programmable Logic Devices
• To write HDL code for combinational and sequential circuits

UNIT I BOOLEAN ALGEBRA AND LOGIC GATES 12

Number Systems - Arithmetic Operations - Binary Codes- Boolean Algebra and Logic Gates
- Theorems and Properties of Boolean Algebra - Boolean Functions - Canonical and Standard Forms
Simplification of Boolean Functions using Karnaugh Map - Logic Gates – NAND and NOR Implementations.

UNIT II COMBINATIONAL LOGIC 12

Combinational Circuits – Analysis and Design Procedures - Binary Adder-Subtractor - Decimal Adder -
Binary Multiplier - Magnitude Comparator - Decoders – Encoders – Multiplexers - Introduction to HDL – H
Models of Combinational circuits.

UNIT III SYNCHRONOUS SEQUENTIAL LOGIC 12

Sequential Circuits - Storage Elements: Latches , Flip-Flops - Analysis of Clocked Sequential Circuits
State Reduction and Assignment - Design Procedure - Registers and Counters - HDL Models of Sequential Circu
UNIT IV ASYNCHRONOUS SEQUENTIAL LOGIC 12
Analysis and Design of Asynchronous Sequential Circuits – Reduction of State and Flow Tables – Race-fr
State Assignment – Hazards.
UNIT V MEMORY AND PROGRAMMABLE LOGIC 12
RAM – Memory Decoding – Error Detection and Correction - ROM - Programmable Logic Array – Programmable
Logic – Sequential Programmable Devices.
TOTAL : 60 PERIODS
 OUTCOMES:
On Completion of the course, the students should be able to:
 Simplify Boolean functions using KMap
 Design and Analyze Combinational and Sequential Circuits
 Implement designs using Programmable Logic Devices
 Write HDL code for combinational and Sequential Circuits
TEXT BOOK:
1. M. Morris R. Mano, Michael D. Ciletti, “Digital Design: With an Introduction to the Verilog HDL, VHDL, and
SystemVerilog”, 6th Edition, Pearson Education, 2017.
REFERENCES:
1. G. K. Kharate, Digital Electronics, Oxford University Press, 2010
2. John F. Wakerly, Digital Design Principles and Practices, Fifth Edition, Pearson Education, 2017.
3. Charles H. Roth Jr, Larry L. Kinney, Fundamentals of Logic Design, Sixth Edition, CENGAGE Learning, 2013
4. Donald D. Givone, Digital Principles and Designǁ, Tata Mc Graw Hill, 2003.
CS8391 DATA STRUCTURES LT PC30 0 3

OBJECTIVES:
 To understand the concepts of ADTs
 To Learn linear data structures – lists, stacks, and queues
 To understand sorting, searching and hashing algorithms
 To apply Tree and Graph structures
UNIT I LINEAR DATA STRUCTURES – LIST 9
Abstract Data Types (ADTs) – List ADT – array-based implementation – linked list implementation ––singly linked l
circularly linked lists- doubly-linked lists – applications of lists –Polynomial Manipulation – All operations (Insertio
Deletion, Merge, Traversal).
UNIT II LINEAR DATA STRUCTURES – STACKS, QUEUES 9
Stack ADT – Operations - Applications - Evaluating arithmetic expressions- Conversion of Infix to
postfix expression - Queue ADT – Operations - Circular Queue – Priority Queue - deQueue – applications o
queues.
UNIT III NON LINEAR DATA STRUCTURES – TREES 9
Tree ADT – tree traversals - Binary Tree ADT – expression trees – applications of trees – binary search tree ADT –
Threaded Binary Trees- AVL Trees – B-Tree - B+ Tree - Heap – Applications of heap.
UNIT IV NON LINEAR DATA STRUCTURES - GRAPHS 9
Definition – Representation of Graph – Types of graph - Breadth-first traversal - Depth-first traversal – Topo
Sort – Bi-connectivity – Cut vertex – Euler circuits – Applications of graphs.
UNIT V SEARCHING, SORTING AND HASHING TECHNIQUES 9
Searching- Linear Search - Binary Search. Sorting - Bubble sort - Selection sort - Insertion sort - Shell sort – Radix
Hashing- Hash Functions – Separate Chaining – Open Addressing – Rehashing – Extendible Hashing.

TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to:
 Implement abstract data types for linear data structures.

 Apply the different linear and non-linear data structures to problem so

 Critically analyze the various sorting algo
TEXT BO
1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition, Pearson Education
2. Reema Thareja, “Data Structures Using C”, Second Edition , Oxford University Press
REFERE
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, “Introduction to Algorithms", Second E
Mcgraw Hill
2. Aho, Hopcroft and Ullman, “Data Structures and Algorithms”, Pearson Education
3. Stephen G. Kochan, “Programming in C”, 3rd edition, Pearson Edu
4. Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, “Fundamentals of Data Structures in C”, Second Edition, Un
Press
CS8392 OBJECT ORIENTED PROGRAMMING L
3
OBJECTIVES:
 To understand Object Oriented Programming concepts and basic characteristics of Java
 To know the principles of packages, inheritance and interfaces
 To define exceptions and use I/O streams
 To develop a java application with threads and generics classes
 To design and build simple Graphical User Interfaces
UNIT I INTRODUCTION TO OOP AND JAVA FUNDAMENTALS 10
Object Oriented Programming - Abstraction – objects and classes - Encapsulation- Inheritance - Polymorphism- OO
Java – Characteristics of Java – The Java Environment - Java Source File -Structure – Compilation. Fundamenta
Programming Structures in Java – Defining classes in Java – constructors, methods -access specifiers - static
members -Comments, Data Types, Variables, Operators, Control Flow, Arrays , Packages - JavaDoc comments.
UNIT II INHERITANCE AND INTERFACES 9
Inheritance – Super classes- sub classes –Protected members – constructors in sub classes- the
Object class – abstract classes and methods- final methods and classes – Interfaces – defining an interface,
implementing interface, differences between classes and interfaces and extending

interfaces - Object cloning -inner classes, Array Lists - Strings

UNIT III EXCEPTION HANDLING AND I/O 9
Exceptions - exception hierarchy - throwing and catching exceptions – built-in exceptions, creating own exceptions,
Trace Elements. Input / Output Basics – Streams – Byte streams and Character streams – Reading and Wri
Console – Reading and Writing Files
UNIT IV MULTITHREADING AND GENERIC PROGRAMMING 8
Differences between multi-threading and multitasking, thread life cycle, creating threads, synchronizing
threads, Inter-thread communication, daemon threads, thread groups. Generic Programming – Generic classe
generic methods – Bounded Types – Restrictions and Limitations.
UNIT V EVENT DRIVEN PROGRAMMING 9
Graphics programming - Frame – Components - working with 2D shapes - Using color, fonts, and images - Basics o
event handling - event handlers - adapter classes - actions - mouse events - AWT event hierarchy - Introduction to S
– layout management - Swing Components – Text Fields , Text Areas – Buttons- Check Boxes – Radio Butto
Lists- choices- Scrollbars –
Windows –Menus – Dialog Boxes.

TOTAL: 45 PERIODS
OUTCOMES:
Upon completion of the course, students will be able to:
 Develop Java programs using OOP principles
 
Develop Java programs with the concepts inheritance and inte
 Build Java applications using exceptions and I/O s
 Develop Java applications with threads and generics c
 Develop interactive Java programs using
TEXT BO
1. Herbert Schildt, “Java The complete reference”, 8 th Edition, McGraw Hill Education
2. Cay S. Horstmann, Gary cornell, “Core Java Volume –I Fundamentals”, 9 th Edition, Prentice Hall
REFERE
1. Paul Deitel, Harvey Deitel, “Java SE 8 for programmers”, 3 rd Edition, Pearson
2. Steven Holzner, “Java 2 Black book”, Dreamtech press
3. Timothy Budd, “Understanding Object-oriented programming with Java”, Updated Edition, Pearson Edu

EC8395 COMMUNICATION ENGINEERING L

3

OBJECTIVES:
 To introduce the relevance of this course to the existing technology through demonstrations, case studies,
simulations, contributions of scientist, national/international policies with a futuristic vision along with socio-econ
impact and issues
 To study the various analog and digital modulation techniques
 To study the principles behind information theory and coding
 To study the various digital communication techniques
UNIT I ANALOG MODULATION 9
Amplitude Modulation – AM, DSBSC, SSBSC, VSB – PSD, modulators and demodulators – Angle modulation – PM
FM – PSD, modulators and demodulators – Superheterodyne receivers
UNITII PULSE MODULATION 9
Low pass sampling theorem – Quantization – PAM – Line coding – PCM, DPCM, DM, and ADPCM And AD
Channel Vocoder - Time Division Multiplexing, Frequency Division Multiplexing
UNIT III DIGITAL MODULATION AND TRANSMISSION 9
Phase shift keying – BPSK, DPSK, QPSK – Principles of M-ary signaling M-ary PSK & QAM – Comparison, ISI –
shaping – Duo binary encoding – Cosine filters – Eye pattern, equalizers
UNIT IV INFORMATION THEORY AND CODING 9
Measure of information – Entropy – Source coding theorem – Shannon–Fano coding, Huffman Coding, LZ Co
– Channel capacity – Shannon-Hartley law – Shannon's limit – Error control codes – Cyclic codes, Syndrome
calculation – Convolution Coding, Sequential and Viterbi decoding
UNIT V SPREAD SPECTRUM AND MULTIPLE ACCESS 9
PN sequences – properties – m-sequence – DSSS – Processing gain, Jamming – FHSS – Synchronisation
tracking – Multiple Access – FDMA, TDMA, CDMA,

TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the student should be able to:

 Ability to comprehend and appreciate the significance and role of this course in the present contemporar
 Apply analog and digital communication tech
 Use data and pulse communication tech
 Analyze Source and Error control
TEXT BO
1. H Taub, D L Schilling, G Saha, “Principles of Communication Systems” 3/e, TMH
2. S. Haykin “Digital Communications” John Wile
REFERE
1. B.P.Lathi, “Modern Digital and Analog Communication Systems”, 3 edition, Oxford University Press
rd

2. H P Hsu, Schaum Outline Series – “Analog and Digital Communications” TMH

3. B.Sklar, Digital Communications Fundamentals and Applications” 2/e Pearson Education
CS8381 DATA STRUCTURES LABORATORY L
0
OBJECTIVES
 To implement linear and non-linear data structures
 To understand the different operations of search trees
 To implement graph traversal algorithms
 To get familiarized to sorting and searching algorithms
1. Array implementation of Stack and Queue ADTs
2. Array implementation of List ADT
3. Linked list implementation of List, Stack and Queue ADTs
4. Applications of List, Stack and Queue ADTs
5. Implementation of Binary Trees and operations of Binary Trees
6. Implementation of Binary Search Trees
7. Implementation of AVL Trees
8. Implementation of Heaps using Priority Queues.

9. Graph representation and Traversal algo

10. Applications of G
11. Implementation of searching and sorting algo
12. Hashing – any two collision tech
TOTAL: 60 PE

OUTCO
At the end of the course, the students will be a
 Write functions to implement linear and non-linear data structure ope
 Suggest appropriate linear / non-linear data structure operations for solving a given p
 Appropriately use the linear / non-linear data structure operations for a given p
 Apply appropriate hash functions that result in a collision free scenario for data storage and re
CS8383 OBJECT ORIENTED PROGRAMMING LABORATORY L
0
OBJECTIVES
 To build software development skills using java programming for real-world applications.
 To understand and apply the concepts of classes, packages, interfaces, arraylist, exception handling and file
processing.
 To develop applications using generic programming and event handling.
LIST OF EXPERIMENTS
1. Develop a Java application to generate Electricity bill. Create a class with the following members: Cons
no., consumer name, previous month reading, current month reading, type of EB connection (i.e domestic o
commercial). Compute the bill amount using the following tariff.
If the type of the EB connection is domestic, calculate the amount to be paid as follows:
 First 100 units - Rs. 1 per unit
 101-200 units - Rs. 2.50 per unit
 201 -500 units - Rs. 4 per unit
 > 501 units - Rs. 6 per unit
If the type of the EB connection is commercial, calculate the amount to be paid as follows:
 First 100 units - Rs. 2 per unit
 101-200 units - Rs. 4.50 per unit
 201 -500 units - Rs. 6 per unit
 > 501 units - Rs. 7 per unit
2. Develop a java application to implement currency converter (Dollar to INR, EURO to INR, Yen to INR and vice v
distance converter (meter to KM, miles to KM and vice versa) , time converter (hours to minutes, seconds and vice v
using packages.
3. Develop a java application with Employee class with Emp_name, Emp_id, Address, Mail_id, Mobile_no as mem
Inherit the classes, Programmer, Assistant Professor, Associate Professor and Professor from employee class.
Basic Pay (BP) as the member of all the inherited classes with 97% of BP as DA, 10 % of BP as HRA, 12% of BP as
0.1% of BP for staff club fund. Generate pay slips for the employees with their gross and net salary.
4. Design a Java interface for ADT Stack. Implement this interface using array. Provide necessary exception handl
both the implementations.
5. Write a program to perform string operations using ArrayList. Write functions for the following
a. Append - add at end
b. Insert – add at particular index
c. Search
d. List all string starts with given letter
6. Write a Java Program to create an abstract class named Shape that contains two integers and an empty method
named print Area(). Provide three classes named Rectangle, Triangle and Circle such that each one of the classes
extends the class Shape. Each one of the classes contains only the method print Area () that prints the area of the
shape.
7. Write a Java program to implement user defined exception handling.
8. Write a Java program that reads a file name from the user, displays information about whether the file exists, wh
the file is readable, or writable, the type of file and the length of the file in bytes.
9. Write a java program that implements a multi-threaded application that has three threads. First thread generate
random integer every 1 second and if the value is even, second thread computes the square of the number and
prints. If the value is odd, the third thread will print the value of cube of the number.
10. Write a java program to find the maximum value from the given type of elements using a generic funct
11. Design a calculator using event-driven programming paradigm of Java with the following options.
a) Decimal manipulations
b) Scientific manipulations
12. Develop a mini project for any application using Java concepts.

TOTAL : 60 PERIODS
OUTCOMES
Upon completion of the course, the students will be able to

 Develop and implement Java programs for simple applications that make use of classes, packages and inte
 Develop and implement Java programs with arraylist, exception handling and multithre
 Design applications using file processing, generic programming and event ha
CS8382 DIGITAL SYSTEMS LABORATORY L T
0 0
OBJECTIVES:
 To understand the various basic logic gates
 To design and implement the various combinational circuits
 To design and implement combinational circuits using MSI devices.
 To design and implement sequential circuits
 To understand and code with HDL programming
LIST OF EXPERIMENTS
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary

functions, code converters.

3. Design and implement Half/Full Adder and Subtractor.
4. Design and implement combinational circuits using MSI devices:
 4 – bit binary adder / subtractor
 Parity generator / checker
 Magnitude Comparator
 Application using multiplexers
5. Design and implement shift-registers.
6. Design and implement synchronous counters.
7. Design and implement asynchronous counters.
8. Coding combinational circuits using HDL.
9. Coding sequential circuits using HDL.
10. Design and implementation of a simple digital system (Mini Project). TOTAL: 60 PERIODS
OUTCOMES:
Upon Completion of the course, the students will be able to:
 Implement simplified combinational circuits using basic logic gates
 Implement combinational circuits using MSI devices
 Implement sequential circuits like registers and counters
 Simulate combinational and sequential circuits using HDL

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

LABORATORY REQUIREMENT FOR BATCH OF 30 STUDENTS HARDWARE:
1. Digital trainer kits - 30
2. Digital ICs required for the experiments in sufficient numbers

SOFTWARE:
1. HDL simulator.
L
0
HS8381 INTERPERSONAL SKILLS/LISTENING&SPEAKING
 OBJECTIVES:
The Course will enable learners to:
• Equip students with the English language skills required for the successful undertaking of academic stu
with primary emphasis on academic speaking and listening skills.
• Provide guidance and practice in basic general and classroom conversation and to engage in specific academ
speaking activities.
• improve general and academic listening skills
• Make effective presentations.

UNIT I
Listening as a key skill- its importance- speaking - give personal information - ask for personal information - ex
ability - enquire about ability - ask for clarification Improving pronunciation - pronunciation basics taking lecture no
preparing to listen to a lecture - articulate a complete idea as opposed to producing fragmented utterances.

UNIT II
Listen to a process information- give information, as part of a simple explanation - conversation starters: small tal
stressing syllables and speaking clearly - intonation patterns - compare and contrast information and ideas from
multiple sources- converse with reasonable accuracy over a wide range of everyday topics.

UNIT III
Lexical chunking for accuracy and fluency- factors influence fluency, deliver a five-minute informal talk - greet - resp
greetings - describe health and symptoms - invite and offer - accept - decline - take leave - listen for and follow
gist- listen for detail
UNIT IV
Being an active listener: giving verbal and non-verbal feedback - participating in a group discussion - summa
academic readings and lectures conversational speech listening to and participating in conversations - persuade.
UNIT V
Formal and informal talk - listen to follow and respond to explanations, directions and instructions in academic and
business contexts - strategies for presentations and interactive communication - group/pair presentations - negotiate
disagreement in group work.

TOTAL :30PERIODS
OUTCOMES:
At the end of the course Learners will be able to:
 Listen and respond appropriately.
 Participate in group discussions
 Make effective presentations
  Participate confidently and appropriately in conversations both formal and in
TEXT BO
1. Brooks,Margret. Skills for Success. Listening and Speaking. Level 4 Oxford University Press, Oxford
2. Richards,C. Jack. & David Bholke. Speak Now Level 3. Oxford University Press, Oxford
REFERE
1. Bhatnagar, Nitin and MamtaBhatnagar. Communicative English for Engineers and Professionals. Pearson: New

2. Hughes, Glyn and Josephine Moate. Practical English Classroom. Oxford University Press: Oxford
3. Vargo, Mari. Speak Now Level 4. Oxford University Press: Oxford
4. Richards C. Jack. Person to Person (Starter). Oxford University Press: Oxford
5. Ladousse, Gillian Porter. Role Play. Oxford University Press: Oxford
MA8402 PROBABILITY AND QUEUING THEORY L T
4 0

OBJECTIVES:
 To provide necessary basic concepts in probability and random processes for applications such as random signa
linear systems in communication engineering.
 To understand the basic concepts of probability, one and two dimensional random variables and to introd
some standard distributions applicable to engineering which can describe real life phenomenon.
 To understand the basic concepts of random processes which are widely used in IT fields.
 To understand the concept of queueing models and apply in engineering.
 To understand the significance of advanced queueing models.
 To provide the required mathematical support in real life problems and develop probabilistic mode
which can be used in several areas of science and engineering.
UNIT I PROBABILITY AND RANDOM VARIABLES 12
Probability – Axioms of probability – Conditional probability – Baye’s theorem - Discrete and continuous ran
variables – Moments – Moment generating functions – Binomial, Poisson, Geometric, Uniform, Exponential an
Normal distributions.
UNIT II TWO - DIMENSIONAL RANDOM VARIABLES 12
Joint distributions – Marginal and conditional distributions – Covariance – Correlation and linear regression –
Transformation of random variables – Central limit theorem (for independent and identically distributed random
variables).
UNIT III RANDOM PROCESSES 12
Classification – Stationary process – Markov process - Poisson process – Discrete parameter Markov chain
Chapman Kolmogorov equations – Limiting distributions.
UNIT IV QUEUEING MODELS 12
Markovian queues – Birth and death processes – Single and multiple server queueing models – Little’s formula - Qu
with finite waiting rooms – Queues with impatient customers : Balking and reneging.
UNIT V ADVANCED QUEUEING MODELS 12
Finite source models - M/G/1 queue – Pollaczek Khinchin formula - M/D/1 and M/E /1 as special
K cases – Series queues – Open Jackson networks.

TOTAL : 60 PERIODS
OUTCOMES:
Upon successful completion of the course, students should be able to:
 Understand the fundamental knowledge of the concepts of probability and have knowledge of standard distribu
which can describe real life phenomenon.
 Understand the basic concepts of one and two dimensional random variables and apply in engineering applica
 Apply the concept of random processes in engineering disciplines.
 Acquire skills in analyzing queueing models.
 Understand and characterize phenomenon which evolve with respect to time in a probabilistic manner
TEXTBOOKS:
1. Gross, D., Shortle, J.F, Thompson, J.M and Harris. C.M., “Fundamentals of Queueing Theory", Wiley Student 4 t
Edition, 2014.
2. Ibe, O.C., “Fundamentals of Applied Probability and Random Processes", Elsevier, 1 st Indian Reprint, 2007.
REFERENCES :
1. Hwei Hsu, "Schaum’s Outline of Theory and Problems of Probability, Random Variables and Random Processe
Tata McGraw Hill Edition, New Delhi, 2004.
2. Taha, H.A., "Operations Research", 9th Edition, Pearson India Education Services, Delhi, 2016.
3. Trivedi, K.S., "Probability and Statistics with Reliability, Queueing and Computer Science Applications", 2
Edition, John Wiley and Sons, 2002.
4. Yates, R.D. and Goodman. D. J., "Probability and Stochastic Processes", 2 nd Edition, Wiley India Pvt. Ltd., Bang
2012.

CS8491 COMPUTER ARCHITECTURE L T P

3 0 0
OBJECTIVES:
• To learn the basic structure and operations of a computer.
• To learn the arithmetic and logic unit and implementation of fixed-point and floating point arithmetic unit.
• To learn the basics of pipelined execution.
• To understand parallelism and multi-core processors.
• To understand the memory hierarchies, cache memories and virtual memories.
• To learn the different ways of communication with I/O devices.
UNIT I BASIC STRUCTURE OF A COMPUTER SYSTEM 9
Functional Units – Basic Operational Concepts – Performance – Instructions: Language of the Computer – Operatio
Operands – Instruction representation – Logical operations – decision making – MIPS Addressing.
UNIT II ARITHMETIC FOR COMPUTERS 9
Addition and Subtraction – Multiplication – Division – Floating Point Representation – Floating Point Operatio
– Subword Parallelism
UNIT III PROCESSOR AND CONTROL UNIT 9
A Basic MIPS implementation – Building a Datapath – Control Implementation Scheme – Pipelining – Pipelined
datapath and control – Handling Data Hazards & Control Hazards – Exceptions.
UNIT IV PARALLELISIM 9
Parallel processing challenges – Flynn’s classification – SISD, MIMD, SIMD, SPMD, and Vector Architectures
Hardware multithreading – Multi-core processors and other Shared Memory Multiprocessors - Introduction to
Graphics Processing Units, Clusters, Warehouse Scale Computers and other Message-Passing Multiprocessors.
UNIT V MEMORY & I/O SYSTEMS 9
Memory Hierarchy - memory technologies – cache memory – measuring and improving cache performance
virtual memory, TLB’s – Accessing I/O Devices – Interrupts – Direct Memory Access – Bus structure – Bus operation
Arbitration – Interface circuits - USB.

TOTAL : 45 PERIODS
OUTCOMES:
On Completion of the course, the students should be able to:
 Understand the basics structure of computers, operations and instructions.
 Design arithmetic and logic unit.
 Understand pipelined execution and design control unit.
 Understand parallel processing architectures.
 Understand the various memory systems and I/O communication.
TEXT BOOKS:
1. David A. Patterson and John L. Hennessy, Computer Organization and Design: The Hardware/Software
Interface, Fifth Edition, Morgan Kaufmann / Elsevier, 2014.
2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky and Naraig Manjikian, Computer Organization and Embedded
Systems, Sixth Edition, Tata McGraw Hill, 2012.
REFERENCES:
1. William Stallings, Computer Organization and Architecture – Designing for Performance, Eighth Edition, Pears
Education, 2010.
2. John P. Hayes, Computer Architecture and Organization, Third Edition, Tata

McGraw Hill
3. John L. Hennessey and David A. Patterson, Computer Architecture – A Quantitative Approachǁ, Morgan Kauf
Elsevier Publishers, Fifth Edition
CS8492 DATABASE MANAGEMENT SYSTEMS L
3
OBJECTIVES
 To learn the fundamentals of data models and to represent a database system using ER diagrams.
 To study SQL and relational database design.
 To understand the internal storage structures using different file and indexing techniques which will help in physi
design.
 To understand the fundamental concepts of transaction processing- concurrency control techniques and recover
procedures.
 To have an introductory knowledge about the Storage and Query processing Techniques
UNIT I RELATIONAL DATABASES 10
Purpose of Database System – Views of data – Data Models – Database System Architecture – Introduction to rela
databases – Relational Model – Keys – Relational Algebra – SQL fundamentals – Advanced SQL features –
Embedded SQL– Dynamic SQL
UNIT II DATABASE DESIGN 8
Entity-Relationship model – E-R Diagrams – Enhanced-ER Model – ER-to-Relational Mapping – Functional
Dependencies – Non-loss Decomposition – First, Second, Third Normal Forms, Dependency Preservation –
Boyce/Codd Normal Form – Multi-valued Dependencies and Fourth Normal Form – Join Dependencies and Fifth No
Form
UNIT III TRANSACTIONS 9
Transaction Concepts – ACID Properties – Schedules – Serializability – Concurrency Control – Need for Concurre
Locking Protocols – Two Phase Locking – Deadlock – Transaction Recovery - Save Points – Isolation Levels
Facilities for Concurrency and Recovery.
UNIT IV IMPLEMENTATION TECHNIQUES 9
RAID – File Organization – Organization of Records in Files – Indexing and Hashing –Ordered Indices – B+ tree
Files – B tree Index Files – Static Hashing – Dynamic Hashing – Query Processing Overview – Algorithms for SELE
and JOIN operations – Query optimization using Heuristics and Cost Estimation.
UNIT V ADVANCED TOPICS 9
Distributed Databases: Architecture, Data Storage, Transaction Processing – Object-based Databases: Ob
Database Concepts, Object-Relational features, ODMG Object Model, ODL, OQL - XML Databases: XML
Hierarchical Model, DTD, XML Schema, XQuery – Information Retrieval: IR Concepts, Retrieval Models, Querie
systems.

TOTAL: 45 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to:

 Classify the modern and futuristic database applications based on size and complexity
 Map ER model to Relational model to perform database design effectively
 Write queries using normalization criteria and optimize queries
 Compare and contrast various indexing strategies in different database systems
 Appraise how advanced databases differ from traditional databases.
 TEXT BO
1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, “Database System Concepts”, Sixth Editio
McGraw Hill
2. Ramez Elmasri, Shamkant B. Navathe, “Fundamentals of Database Systems”, Sixth Edition, Pearson Edu

REFERE
1. C.J.Date, A.Kannan, S.Swamynathan, “An Introduction to Database Systems”, Eighth Edition, Pearson Edu

2. Raghu Ramakrishnan, ―Database Management Systemsǁ, Fourth Edition, McGraw-Hill College Publications
3. G.K.Gupta,"Database Management Systems”, Tata McGraw Hill
CS8451 DESIGN AND ANALYSIS OF ALGORITHMS LTPC3
OBJECTIVES:
 To understand and apply the algorithm analysis techniques.
 To critically analyze the efficiency of alternative algorithmic solutions for the same problem
 To understand different algorithm design techniques.
 To understand the limitations of Algorithmic power.
UNIT I INTRODUCTION 9
Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important Problem Types – Fundamentals
the Analysis of Algorithmic Efficiency –Asymptotic Notations and their properties. Analysis Framework – Emp
analysis - Mathematical analysis for Recursive and Non-recursive algorithms - Visualization
UNIT II BRUTE FORCE AND DIVIDE-AND-CONQUER 9
Brute Force – Computing an – String Matching - Closest-Pair and Convex-Hull Problems - Exhaustive Searc
Travelling Salesman Problem - Knapsack Problem - Assignment problem.
Divide and Conquer Methodology – Binary Search – Merge sort – Quick sort – Heap Sort - Multiplication o
Large Integers – Closest-Pair and Convex - Hull Problems.
UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE 9
Dynamic programming – Principle of optimality - Coin changing problem, Computing a Binomial Coefficient – Floy
algorithm – Multi stage graph - Optimal Binary Search Trees – Knapsack Problem and Memory functions.
Greedy Technique – Container loading problem - Prim’s algorithm and Kruskal's Algorithm – 0/1 Knapsack problem,
Optimal Merge pattern - Huffman Trees.
UNIT IV ITERATIVE IMPROVEMENT 9
The Simplex Method - The Maximum-Flow Problem – Maximum Matching in Bipartite Graphs, Stable marria
Problem.
UNIT V COPING WITH THE LIMITATIONS OF ALGORITHM POWER 9
Lower - Bound Arguments - P, NP NP- Complete and NP Hard Problems. Backtracking – n-Queen problem - Hamilt
Circuit Problem – Subset Sum Problem. Branch and Bound – LIFO Search and FIFO search - Assignment proble
Knapsack Problem – Travelling Salesman Problem - Approximation Algorithms for NP-Hard Problems – Trave
Salesman problem – Knapsack
problem.

TOTAL: 45 PERIODS
OUTCOMES:At the end of the course, the students should be able to: Design algorithms for various computing problems. Analyze
OBJECTIVES:
 To understand the basic concepts and functions of operating systems.
 To understand Processes and Threads
 To analyze Scheduling algorithms.
 To understand the concept of Deadlocks.
 To analyze various memory management schemes.
 To understand I/O management and File systems.
 To be familiar with the basics of Linux system and Mobile OS like iOS and Android.
UNIT I OPERATING SYSTEM OVERVIEW 7
Computer System Overview-Basic Elements, Instruction Execution, Interrupts, Memory Hierarchy, Cache Memory,
Memory Access, Multiprocessor and Multicore Organization. Operating system overview-objectives and funct
Evolution of Operating System.- Computer System Organization Operating System Structure and Operations- Sy
Calls, System Programs, OS Generation and System Boot.
UNIT II PROCESS MANAGEMENT 11
Processes - Process Concept, Process Scheduling, Operations on Processes, Inter-process Communication;
Scheduling - Scheduling criteria, Scheduling algorithms, Multiple-processor scheduling, Real time scheduling; Thre
Overview, Multithreading models, Threading issues; Process Synchronization - The critical-section problem,
Synchronization hardware, Mutex locks, Semaphores, Classic problems of synchronization, Critical regions, Monito
Deadlock - System model, Deadlock characterization, Methods for handling deadlocks, Deadlock preven
Deadlock avoidance, Deadlock detection, Recovery from deadlock.
UNIT III STORAGE MANAGEMENT 9
Main Memory – Background, Swapping, Contiguous Memory Allocation, Paging, Segmentation, Segmentation
paging, 32 and 64 bit architecture Examples; Virtual Memory – Background,

Demand Paging, Page Replacement, Allocation, Thrashing; Allocating Kernel Memory, OS Examples.

UNIT IV FILE SYSTEMS AND I/O SYSTEMS 9

Mass Storage system – Overview of Mass Storage Structure, Disk Structure, Disk Scheduling and Management,
space management; File-System Interface - File concept, Access methods, Directory Structure, Directory
organization, File system mounting, File Sharing and Protection; File System Implementation- File System Stru
Directory implementation, Allocation Methods, Free Space Management, Efficiency and Performance, Recover
Systems – I/O Hardware, Application I/O interface, Kernel I/O subsystem, Streams, Performance.

UNIT V CASE STUDY 9

Linux System - Design Principles, Kernel Modules, Process Management, Scheduling, Memory Management, In
Output Management, File System, Inter-process Communication; Mobile OS - iOS and Android - Architecture
SDK Framework, Media Layer, Services Layer, Core OS Layer, File System.

TOTAL : 45 PERIODS
OUTCOMES:
At the end of the course, the students should be able to:
 Analyze various scheduling algorithms.
 Understand deadlock, prevention and avoidance algorithms.
 Compare and contrast various memory management schemes.
 Understand the functionality of file systems.
 Perform administrative tasks on Linux Servers.
 Compare iOS and Android Operating Systems.
TEXT BOOK :

1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, 9 th Edition, John W
and Sons Inc., 2012.
REFERENCES :
1. Ramaz Elmasri, A. Gil Carrick, David Levine, “Operating Systems – A Spiral Approach”, Tata McGraw Hill Edit
2010.
2. Achyut S.Godbole, Atul Kahate, “Operating Systems”, McGraw Hill Education, 2016.
3. Andrew S. Tanenbaum, “Modern Operating Systems”, Second Edition, Pearson Education, 2004.
4. Gary Nutt, “Operating Systems”, Third Edition, Pearson Education, 2004.
5. Harvey M. Deitel, “Operating Systems”, Third Edition, Pearson Education, 2004.
6. Daniel P Bovet and Marco Cesati, “Understanding the Linux kernel”, 3rd edition, O’Reilly, 2005.
7. Neil Smyth, “iPhone iOS 4 Development Essentials – Xcode”, Fourth Edition, Payload media, 2011.

CS8494
SOFTWARE ENGINEERING

OBJECTIVES:
 To understand the phases in a software project
 To understand fundamental concepts of requirements engineering and Analysis Modeling.
 To understand the various software design methodologies
 To learn various testing and maintenance measures

UNIT I SOFTWARE PROCESS AND AGILE DEVELOPMENT 9

Introduction to Software Engineering, Software Process, Perspective and Specialized Process Models –
Introduction to Agility-Agile process-Extreme programming-XP Process.
UNIT II REQUIREMENTS ANALYSIS AND SPECIFICATION 9
Software Requirements: Functional and Non-Functional, User requirements, System requirements, Software Requi
Document – Requirement Engineering Process: Feasibility Studies, Requirements elicitation and analysis,
requirements validation, requirements management- Classical analysis: Structured system Analysis, Petri Nets-
Dictionary.
UNIT III SOFTWARE DESIGN 9
Design process – Design Concepts-Design Model– Design Heuristic – Architectural Design - Architectural sty
Architectural Design, Architectural Mapping using Data Flow- User Interface Design: Interface analysis, Interface
–Component level Design: Designing Class based components, traditional Components.
UNIT IV TESTING AND MAINTENANCE 9
Software testing fundamentals-Internal and external views of Testing-white box testing - basis path testing-c
structure testing-black box testing- Regression Testing – Unit Testing – Integration Testing – Validation T
– System Testing And Debugging –Software
Implementation Techniques: Coding practices-Refactoring-Maintenance and Reengineering-BPR model-Reenginee
process model-Reverse and Forward Engineering.

9
UNIT V PROJECT MANAGEMENT
Software Project Management: Estimation – LOC, FP Based Estimation, Make/Buy Decision COCOMO I &
Model – Project Scheduling – Scheduling, Earned Value Analysis Planning –
Project Plan, Planning Process, RFP Risk Management – Identification, Projection - Risk Management-Risk
Identification-RMMM Plan-CASE TOOLS
TOTAL :45 PERIODS
 OUTCOMES:On Completion of the course, the students should be able to: Identify the key activities in managing a software project.

CS8481 DATABASE MANAGEMENT SYSTEMS LABORATORY

AIM:
The aim of this laboratory is to inculcate the abilities of applying the principles of the database management s
This course aims to prepare the students for projects where a proper implementation of databases will be re
OBJECTIVES:
 To understand data definitions and data manipulation commands
 To learn the use of nested and join queries
 To understand functions, procedures and procedural extensions of data bases
 To be familiar with the use of a front end tool
 To understand design and implementation of typical database applications
1. Data Definition Commands, Data Manipulation Commands for inserting, deleting, updating and retrieving Tables
Transaction Control statements
2. Database Querying – Simple queries, Nested queries, Sub queries and Joins
3. Views, Sequences, Synonyms
4. Database Programming: Implicit and Explicit Cursors
5. Procedures and Functions
6. Triggers
7. Exception Handling
8. Database Design using ER modeling, normalization and Implementation for any application
9. Database Connectivity with Front End Tools
10. Case Study using real life database applications

TOTAL: 60 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to:
 Use typical data definitions and manipulation commands.
 Design applications to test Nested and Join Queries
 Implement simple applications that use Views
 Implement applications that require a Front-end Tool

 Critically analyze the use of Tables, Views, Functions and Proc

CS8461 OPERATING SYSTEMS LABORATORY L
0
OBJECTIVES
 To learn Unix commands and shell programming
 To implement various CPU Scheduling Algorithms
 To implement Process Creation and Inter Process Communication.
 To implement Deadlock Avoidance and Deadlock Detection Algorithms
 To implement Page Replacement Algorithms
 To implement File Organization and File Allocation Strategies
LIST OF EXPERIMENTS
1. Basics of UNIX commands
2. Write programs using the following system calls of UNIX operating system fork, exec, getpid, exit, wait, close, stat
opendir, readdir
3. Write C programs to simulate UNIX commands like cp, ls, grep, etc.
4. Shell Programming
5. Write C programs to implement the various CPU Scheduling Algorithms
6. Implementation of Semaphores
7. Implementation of Shared memory and IPC
8. Bankers Algorithm for Deadlock Avoidance
9. Implementation of Deadlock Detection Algorithm
10. Write C program to implement Threading & Synchronization Applications
11. Implementation of the following Memory Allocation Methods for fixed partition
a) First Fit b) Worst Fit c) Best Fit
12. Implementation of Paging Technique of Memory Management
13. Implementation of the following Page Replacement Algorithms
a) FIFO b) LRU c) LFU

14. Implementation of the various File Organization Techniques

15. Implementation of the following File Allocation Strategies
a) Sequential b) Indexed c) Linked

TOTAL: 60 PERIODS
OUTCOMES:
At the end of the course, the student should be able to
 Compare the performance of various CPU Scheduling Algorithms
 Implement Deadlock avoidance and Detection Algorithms
 Implement Semaphores
 Create processes and implement IPC

 Analyze the performance of the various Page Replacement Algorithms

 Implement File Organization and File Allocation Strategies
L
0
HS8461
ADVANCED READING AND WRITING
OBJECTIVES:
• Strengthen the reading skills of students of engineering.
• Enhance their writing skills with specific reference to technical writing.
• Develop students’ critical thinking skills.
• Provide more opportunities to develop their project and proposal writing skills.

UNIT I
Reading - Strategies for effective reading-Use glosses and footnotes to aid reading comprehension
Read and recognize different text types-Predicting content using photos and title Writing-Plan before writing-
Develop a paragraph: topic sentence, supporting sentences, concluding sentence –Write a descriptive
paragraph

UNIT II
Reading-Read for details-Use of graphic organizers to review and aid comprehension Writing- State reason
examples to support ideas in writing- Write a paragraph with reasons and examples- Write an opinion para

UNIT III
Reading- Understanding pronoun reference and use of connectors in a passage- speed reading techniques-Writ
Elements of a good essay-Types of essays- descriptive-narrative- issue- based-argumentative-analytical.

UNIT IV
Reading- Genre and Organization of Ideas- Writing- Email writing- visumes – Job application- project writing-wr
convincing proposals.
UNIT V
Reading- Critical reading and thinking- understanding how the text positions the reader- identify
Writing- Statement of Purpose- letter of recommendation- Vision statement

TOTAL: 30 PERIODS
OUTCOMES:
At the end of the course Learners will be able to:
 Write different types of essays.
 Write winning job applications.
  Read and evaluate texts cr
 Display critical thinking in various professional co
TEXT BO
1. Gramer F. Margot and Colin S. Ward Reading and Writing (Level 3) Oxford University Press: Oxford
2. Debra Daise, CharlNorloff, and Paul Carne Reading and Writing (Level 4) Oxford University Press: Oxford
REFERE
1. Davis, Jason and Rhonda LIss.Effective Academic Writing (Level 3) Oxford University Press: Oxford
2. E. Suresh Kumar and et al. Enriching Speaking and Writing Skills. Second Edition. Orient Black
Hyderabad
3. Withrow, Jeans and et al. Inspired to Write. Readings and Tasks to develop writing skills. Cambridge Un
Press: Cambridge
4. Goatly, Andrew. Critical Reading and Writing. Routledge: United States of America
5. Petelin, Roslyn and Marsh Durham. The Professional Writing Guide: Knowing Well and Knowing
Business & Professional Publishing: Australia
MA8551 ALGEBRA AND NUMBER THEORY L T
4 0
OBJECTIVES:
 To introduce the basic notions of groups, rings, fields which will then be used to solve related problems.
 To introduce and apply the concepts of rings, finite fields and polynomials.
 To understand the basic concepts in number theory
 To examine the key questions in the Theory of Numbers.
 To give an integrated approach to number theory and abstract algebra, and provide a firm basis for further readi
study in the subject.
UNIT I GROUPS AND RINGS 12
Groups : Definition - Properties - Homomorphism - Isomorphism - Cyclic groups - Cosets - Lagrange's theo
Rings: Definition - Sub rings - Integral domain - Field - Integer modulo n - Ring homomorphism.
UNIT II FINITE FIELDS AND POLYNOMIALS 12
Rings - Polynomial rings - Irreducible polynomials over finite fields - Factorization of polynomials over finite fields.
UNIT III DIVISIBILITY THEORY AND CANONICAL DECOMPOSITIONS 12
Division algorithm – Base - b representations – Number patterns – Prime and composite numbers – GCD – Euclidea
algorithm – Fundamental theorem of arithmetic – LCM.
UNIT IV DIOPHANTINE EQUATIONS AND CONGRUENCES 12
Linear Diophantine equations – Congruence’s – Linear Congruence’s - Applications: Divisibility tests - Modula
exponentiation-Chinese remainder theorem – 2 x 2 linear systems.
UNIT V CLASSICAL THEOREMS AND MULTIPLICATIVE FUNCTIONS 12
Wilson’s theorem – Fermat’s little theorem – Euler’s theorem – Euler’s Phi functions – Tau and Sigma functions.

TOTAL: 60 PERIODS
OUTCOMES:
Upon successful completion of the course, students should be able to:
 Apply the basic notions of groups, rings, fields which will then be used to solve related proble
 Explain the fundamental concepts of advanced algebra and their role in modern mathem
contexts.
 Demonstrate accurate and efficient use of advanced algebraic techniques.
 Demonstrate their mastery by solving non - trivial problems related to the concepts, and by proving si
the, statements proven by the text.
 Apply integrated approach to number theory and abstract algebra, and provide a firm basis f
and study in the subject.
TEXTBOOKS:
1. Grimaldi, R.P and Ramana, B.V., "Discrete and Combinatorial Mathematics", Pearson Educatio
Delhi, 2007.
2. Koshy, T., “Elementary Number Theory with Applications”, Elsevier Publications, New
REFERENCES:
1. Lidl, R. and Pitz, G, "Applied Abstract Algebra", Springer Verlag, New Delhi, 2 nd Edition, 2006.
2. Niven, I., Zuckerman.H.S., and Montgomery, H.L., “An Introduction to Theory of Numbers”, Joh
Singapore, 2004.
3. San Ling and Chaoping Xing, “Coding Theory – A first Course”, Cambridge Publications, Cam

CS8591 COMPUTER NETWORKS L

3
OBJECTIVES:
• To understand the protocol layering and physical level communication.
• To analyze the performance of a network.
• To understand the various components required to build different networks.
• To learn the functions of network layer and the various routing protocols.
• To familiarize the functions and protocols of the Transport layer.

UNIT I INTRODUCTION AND PHYSICAL LAYER 9

Networks – Network Types – Protocol Layering – TCP/IP Protocol suite – OSI Model – Physic
Performance – Transmission media – Switching – Circuit-switched Networks – Packet Switch

UNIT II DATA-LINK LAYER & MEDIA ACCESS 9

Introduction – Link-Layer Addressing – DLC Services – Data-Link Layer Protocols – HDLC – PPP - M
Control - Wired LANs: Ethernet - Wireless LANs – Introduction – IEEE 802.11, Bluetooth – Connec
UNIT III
NETWORK LAYER 9

Network Layer Services – Packet switching – Performance – IPV4 Addresses – Forwarding of IP Pac
Layer Protocols: IP, ICMP v4 – Unicast Routing Algorithms – Protocols – Multicasting Basics – IP
IPV6 Protocol.
 UNIT IV TRANSPORT LAYER 9
Introduction – Transport Layer Protocols – Services – Port Numbers – User Datagram Protoco
Control Protocol – SCTP.

UNIT V APPLICATION LAYER 9

WWW and HTTP – FTP – Email –Telnet –SSH – DNS – SNMP.
TOTAL : 45 PERIODS
OUTCOMES:
On Completion of the course, the students should be a
 Understand the basic layers and its functions in computer ne
 Evaluate the performance of a n
 Understand the basics of how data flows from one node to a
 Analyze and design routing algo
 Design protocols for various functions in the n
 Understand the working of various application layer pro
TEXT B
1. Behrouz A. Forouzan, Data Communications and Networking, Fifth Edition TMH
REFERE
1. Larry L. Peterson, Bruce S. Davie, Computer Networks: A Systems Approach, Fifth Edition, Morgan Kau
Publishers Inc.
2. William Stallings, Data and Computer Communications, Tenth Edition, Pearson Education
3. Nader F. Mir, Computer and Communication Networks, Second Edition, Prentice Hall
4. Ying-Dar Lin, Ren-Hung Hwang and Fred Baker, Computer Networks: An Open Source Approach, McGr
Publisher
5. James F. Kurose, Keith W. Ross, Computer Networking, A Top-Down Approach Featuring the Internet, Sixth E
Pearson Education
EC8691 MICROPROCESSORS AND MICROCONTROLLERS L
3
OBJECTIVES:
 To understand the Architecture of 8086 microprocessor.
 To learn the design aspects of I/O and Memory Interfacing circuits.
 To interface microprocessors with supporting chips.
 To study the Architecture of 8051 microcontroller.
 To design a microcontroller based system
UNIT I THE 8086 MICROPROCESSOR 9
Introduction to 8086 – Microprocessor architecture – Addressing modes - Instruction set and assembler direc
– Assembly language programming – Modular Programming - Linking and Relocation - Stacks - Procedures – Mac
Interrupts and interrupt service routines – Byte and String Manipulation.
UNIT II 8086 SYSTEM BUS STRUCTURE 9
8086 signals – Basic configurations – System bus timing –System design using 8086 – I/O programming –
Introduction to Multiprogramming – System Bus Structure – Multiprocessor configurations – Coprocessor, Clos
coupled and loosely Coupled configurations – Introduction to advanced processors.
UNIT III I/O INTERFACING 9
Memory Interfacing and I/O interfacing - Parallel communication interface – Serial communication interface – D/A a
A/D Interface - Timer – Keyboard /display controller – Interrupt controller – DMA controller – Programming and
applications Case studies: Traffic Light control, LED display , LCD display, Keyboard display interface and Alarm
Controller.
UNIT IV MICROCONTROLLER 9
Architecture of 8051 – Special Function Registers(SFRs) - I/O Pins Ports and Circuits - Instruction set - Addressing
- Assembly language programming.

UNIT V INTERFACING MICROCONTROLLER 9

Programming 8051 Timers - Serial Port Programming - Interrupts Programming – LCD & Keyboard Interfaci
ADC, DAC & Sensor Interfacing - External Memory Interface- Stepper Motor and Waveform generation -
Comparison of Microprocessor, Microcontroller, PIC and ARM processors

TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the students should be able to:
 Understand and execute programs based on 8086 microprocessor.
 Design Memory Interfacing circuits.
 Design and interface I/O circuits.
 Design and implement 8051 microcontroller based systems.
 TEXT BO
1. Yu-Cheng Liu, Glenn A.Gibson, “Microcomputer Systems: The 8086 / 8088 Family - Archite
Programming and Design”, Second Edition, Prentice Hall of India, 2007. (UNIT I
2. Mohamed Ali Mazidi, Janice Gillispie Mazidi, Rolin McKinlay, “The 8051 Microcontroller and Emb
Systems: Using Assembly and C”, Second Edition, Pearson education, 2011. (UNIT
REFERE
1. Doughlas V.Hall, “Microprocessors and Interfacing, Programming and Hardware”,TMH
2. A.K.Ray,K.M.Bhurchandi,”Advanced Microprocessors and Peripherals “3 rd edition, Tata McGrawH
CS8501 THEORY OF COMPUTATION L
3

OBJECTIVES:
 To understand the language hierarchy
 To construct automata for any given pattern and find its equivalent regular expressions
 To design a context free grammar for any given language
 To understand Turing machines and their capability
 To understand undecidable problems and NP class problems
UNIT I AUTOMATA FUNDAMENTALS 9
Introduction to formal proof – Additional forms of Proof – Inductive Proofs –Finite Automata – Deterministic
Automata – Non-deterministic Finite Automata – Finite Automata with Epsilon Transitions
UNIT II REGULAR EXPRESSIONS AND LANGUAGES 9
Regular Expressions – FA and Regular Expressions – Proving Languages not to be regular – Closure Prop
of Regular Languages – Equivalence and Minimization of Automata.
UNIT III CONTEXT FREE GRAMMAR AND LANGUAGES 9
CFG – Parse Trees – Ambiguity in Grammars and Languages – Definition of the Pushdown
Automata – Languages of a Pushdown Automata – Equivalence of Pushdown Automata and CFG, Deterministic
Pushdown Automata.
 UNIT IV PROPERTIES OF CONTEXT FREE LANGUAGES
Normal Forms for CFG – Pumping Lemma for CFL – Closure Properties of CFL – Turing Machines – Progr
Techniques
UNIT V UNDECIDABILITY
Non Recursive Enumerable (RE) Language – Undecidable Problem with RE – Undecidable Problems abo
Post’s Correspondence Problem, The Class P
TOTAL :45PE

OUTC
Upon completion of the course, the students will be
 Construct automata, regular expression for any
 Write Context free grammar for any co
 Design Turing machines for any la
 Propose computation solutions using Turing m
 Derive whether a problem is decidabl
TEXT
1. J.E.Hopcroft, R.Motwani and J.D Ullman, “Introduction to Automata Theory, Languages and Compu
Second Edition, Pearson Educatio
REFERE
1. H.R.Lewis and C.H.Papadimitriou, “Elements of the theory of Computation”, Second Edition, PH
2. J.Martin, “Introduction to Languages and the Theory of Computation”, Third Edition, TMH
3. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Brokecol
CS8592 OBJECT ORIENTED ANALYSIS AND DESIGN
OBJECTIVES:
 To understand the fundamentals of object modeling
 To understand and differentiate Unified Process from other approaches.
 To design with static UML diagrams.
 To design with the UML dynamic and implementation diagrams.
 To improve the software design with design patterns.
 To test the software against its requirements specification
UNIT I UNIFIED PROCESS AND USE CASE DIAGRAMS 9
Introduction to OOAD with OO Basics - Unified Process – UML diagrams – Use Case –Case study – the Next Gen P
system, Inception -Use case Modelling – Relating Use cases –
include, extend and generalization – When to use Use-cases
UNIT II STATIC UML DIAGRAMS 9
Class Diagram–– Elaboration – Domain Model – Finding conceptual classes and description classes – Asso
– Attributes – Domain model refinement – Finding conceptual class Hierarchies – Aggregation and Compositio
Relationship between sequence diagrams and use cases – When to use Class Diagrams
UNIT III DYNAMIC AND IMPLEMENTATION UML DIAGRAMS 9
Dynamic Diagrams – UML interaction diagrams - System sequence diagram – Collaboration diagram – Whe
use Communication Diagrams - State machine diagram and Modelling –When to use State Diagrams - Activity diagr
When to use activity diagrams

Implementation Diagrams - UML package diagram - When to use package diagrams - Component and
Deployment Diagrams – When to use Component and Deployment diagrams
UNIT IV DESIGN PATTERNS 9
GRASP: Designing objects with responsibilities – Creator – Information expert – Low Coupling – High Cohesion –
Controller
Design Patterns – creational – factory method – structural – Bridge – Adapter – behavioural – Strategy – observ
Applying GoF design patterns – Mapping design to code
UNIT V TESTING 9
Object Oriented Methodologies – Software Quality Assurance – Impact of object orientation on Testing – De
Test Cases and Test Plans
 TOTAL: 45 PE
OUTC
At the end of the course, the students will be
 Express software design with UML d
 Design software applications using OO co
 Identify various scenarios based on software requi
 Transform UML based software design into pattern based design using design
 Understand the various testing methodologies for OO s
TEXT B
1. Craig Larman, “Applying UML and Patterns: An Introduction to Object-Oriented Analysis and Design and
Development”, Third Edition, Pearson Educatio
2. Ali Bahrami - Object Oriented Systems Development - McGraw Hill International Editio
REFERE
1. Erich Gamma, a n d Richard Helm, Ralph Johnson, John Vlissides, “Design patterns: Elements of Reusable
Oriented Software”, Addison-Wesle
2. Martin Fowler, “UML Distilled: A Brief Guide to the Standard Object Modeling Language”, Third edition, Addison

EC8681 MICROPROCESSORS AND MICROCONTROLLERS LABORATORY L

0

OBJECTIVES:
 To Introduce ALP concepts, features and Coding methods
 Write ALP for arithmetic and logical operations in 8086 and 8051
 Differentiate Serial and Parallel Interface
 Interface different I/Os with Microprocessors
 Be familiar with MASM
LIST OF EXPERIMENTS:
8086 Programs using kits and MASM
1. Basic arithmetic and Logical operations
2. Move a data block without overlap
3. Code conversion, decimal arithmetic and Matrix operations.
4. Floating point operations, string manipulations, sorting and searching
5. Password checking, Print RAM size and system date
6. Counters and Time Delay
Peripherals and Interfacing Experiments
7. Traffic light controller
8. Stepper motor control
9. Digital clock
10. Key board and Display
11. Printer status
12. Serial interface and Parallel interface
13. A/D and D/A interface and Waveform Generation

8051 Experiments using kits and MASM

14. Basic arithmetic and Logical operations
15. Square and Cube program, Find 2’s complement of a number
16. Unpacked BCD to ASCII
TOTAL: 60 PERIODS

OUTCO
At the end of the course, the student should be a
 Write ALP Programmes for fixed and Floating Point and Arithmetic ope
 Interface different I/Os with pro
 Generate waveforms using Microproc
 Execute Programs i
 Explain the difference between simulator and Em
LAB EQUIPMENT FOR A BATCH OF 30 STUD
HARDW
8086 development kits - 30 nos Interfacing Units - Each 10 nos Microcontroller -
SOFTW
Intel Desktop Systems with MASM - 30 nos 8086 Ass
8051 Cross Ass
CS8582 OBJECT ORIENTED ANALYSIS AND DESIGN LABORATORY L
0
OBJECTIVES:
 To capture the requirements specification for an intended software system
 To draw the UML diagrams for the given specification
 To map the design properly to code
 To test the software system thoroughly for all scenarios
 To improve the design by applying appropriate design patterns.
Draw standard UML diagrams using an UML modeling tool for a given case study and map design to code and imple
a 3 layered architecture. Test the developed code and validate whether the SRS is satisfied.
1. Identify a software system that needs to be developed.
2. Document the Software Requirements Specification (SRS) for the identified system.
3. Identify use cases and develop the Use Case model.
4. Identify the conceptual classes and develop a Domain Model and also derive a Class Diagram from that.
5. Using the identified scenarios, find the interaction between objects and represent them using
UML Sequence and Collaboration Diagrams
6. Draw relevant State Chart and Activity Diagrams for the same system.
7. Implement the system as per the detailed design
8. Test the software system for all the scenarios identified as per the usecase diagram
9. Improve the reusability and maintainability of the software system by applying appropriate

design patterns.
10. Implement the modified system and test it for various scenarios
SUGGESTED DOMAINS FOR MINI-PROJECT:
1. Passport automation system.
2. Book bank
3. Exam registration
4. Stock maintenance system.
5. Online course reservation system
6. Airline/Railway reservation system
7. Software personnel management system
8. Credit card processing
9. e-book management system
10. Recruitment system
11. Foreign trading system
12. Conference management system
13. BPO management system
14. Library management system
15. Student information system
OUTCOMES:
Upon completion of this course, the students will be able to:
 Perform OO analysis and design for a given problem specification.
 Identify and map basic software requirements in UML mapping.

TOTAL: 60 PERIODS
 Improve the software quality using design patterns and to explain the rationale behind applying specific
p
 Test the compliance of the software with th
HARDWARE REQUIREM
Standa
SOFTWARE REQUIREM
1. Windows 7 or
2. ArgoUML that supports UML 1.4 and
3. Selenium, JUnit or Apache
CS8581 NETWORKS LABORATORY L T
0 0
OBJECTIVES:
 To learn and use network commands.
 To learn socket programming.
 To implement and analyze various network protocols.
 To learn and use simulation tools.
 To use simulation tools to analyze the performance of various network protocols.
LIST OF EXPERIMENTS
1. Learn to use commands like tcpdump, netstat, ifconfig, nslookup and traceroute. Capture ping and traceroute P
using a network protocol analyzer and examine.
2. Write a HTTP web client program to download a web page using TCP sockets.
3. Applications using TCP sockets like:
 Echo client and echo server
 Chat
 File Transfer

4. Simulation of DNS using UDP sockets.

5. Write a code simulating ARP /RARP protocols.
6. Study of Network simulator (NS) and Simulation of Congestion Control Algorithms using NS.
7. Study of TCP/UDP performance using Simulation tool.
8. Simulation of Distance Vector/ Link State Routing algorithm.
9. Performance evaluation of Routing protocols using Simulation tool.
10. Simulation of error correction code (like CRC).

TOTAL: 60 PERIODS
OUTCOMES:
Upon Completion of the course, the students will be able to:
 Implement various protocols using TCP and UDP.
 Compare the performance of different transport layer protocols.

 Use simulation tools to analyze the performance of various network protocols.

 Analyze various routing algorithms.
 Implement error correction codes.

LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:

LABORATORY REQUIREMENT FOR BATCH OF 30 STUDENTS: HARDWARE:
1. Standalone desktops 30 Nos

SOFTWARE:
1. C / C++ / Java / Python / Equivalent Compiler 30
2. Network simulator like NS2/Glomosim/OPNET/ Packet Tracer / Equivalent

CS8651
INTERNET PROGRAMMING L
3
OBJECTIVES:
 To understand different Internet Technologies.
 To learn java-specific web services architecture
 UNIT I WEBSITE BASICS, HTML 5, CSS 3, WEB 2.0 9
Web Essentials: Clients, Servers and Communication – The Internet – Basic Internet protocols – World
web – HTTP Request Message – HTTP Response Message – Web Clients – Web Servers – HTML5 – Tab
Lists – Image – HTML5 control elements – Semantic elements – Drag and Drop – Audio – Video controls
CSS3 – Inline, embedded and external style sheets – Rule cascading – Inheritance – Backgrounds – Border I
– Colors – Shadows – Text – Transformations – Transitions – Animations.

UNIT II CLIENT SIDE PROGRAMMING 9

Java Script: An introduction to JavaScript–JavaScript DOM Model-Date and Objects,- Regular Express
Exception Handling-Validation-Built-in objects-Event Handling- DHTML with JavaScript- JSON introduct
Syntax – Function Files – Http Request – SQL.

UNIT III SERVER SIDE PROGRAMMING 9

Servlets: Java Servlet Architecture- Servlet Life Cycle- Form GET and POST actions- Session Handling
Understanding Cookies- Installing and Configuring Apache Tomcat Web Server- DATABASE CONNECTIVITY
JDBC perspectives, JDBC program example - JSP: Understanding Java Server Pages-JSP Standard Tag Lib
(JSTL)-Creating HTML forms by embedding JSP code.

UNIT IV PHP and XML 9

An introduction to PHP: PHP- Using PHP- Variables- Program control- Built-in functions- Form Validation-
Regular Expressions - File handling – Cookies - Connecting to Database. XML: Basic XML- Document Type Defi
XML Schema DOM and Presenting XML, XML Parsers and Validation, XSL and XSLT Transformation, News Fee
(RSS and ATOM).
UNIT V INTRODUCTION TO AJAX and WEB SERVICES 9
AJAX: Ajax Client Server Architecture-XML Http Request Object-Call Back Methods; Web Services: Introductio
Java web services Basics – Creating, Publishing, Testing and Describing a Web services (WSDL)-Consu
a web service, Database Driven web
service from an application –SOAP.
 TOTAL 45PE
OUTCO
At the end of the course, the students should be a
 Construct a basic website using HTML and Cascading Style S
 Build dynamic web page with validation using Java Script objects and by applying different event ha
mecha
 Develop server side programs using Servlets an
 Construct simple web pages in PHP and to represent data in XML
 Use AJAX and web services to develop interactive web appli
TEXT B
1. Deitel and Deitel and Nieto, “Internet and World Wide Web - How to Program”, Prentice Hall, 5th E

REFERE
1. Stephen Wynkoop and John Burke “Running a Perfect Website”, QUE, 2nd Edition
2. Chris Bates, Web Programming – Building Intranet Applications, 3rd Edition, Wiley Publications
3. Jeffrey C and Jackson, “Web Technologies A Computer Science Perspective”, Pearson Education
4. Gopalan N.P. and Akilandeswari J., “Web Technology”, Prentice Hall of India
5. UttamK.Roy, “Web Technologies”, Oxford University Press
CS8691 ARTIFICIAL INTELLIGENCE L T
3 0

OBJECTIVES:
 To understand the various characteristics of Intelligent agents
 To learn the different search strategies in AI
 To learn to represent knowledge in solving AI problems
 To understand the different ways of designing software agents
 To know about the various applications of AI.
UNIT I INTRODUCTION 9
Introduction–Definition - Future of Artificial Intelligence – Characteristics of Intelligent Agents– Typical Intellige
Agents – Problem Solving Approach to Typical AI problems.
UNIT II PROBLEM SOLVING METHODS 9
Problem solving Methods - Search Strategies- Uninformed - Informed - Heuristics - Local Search Algorithms and
Optimization Problems - Searching with Partial Observations - Constraint Satisfaction Problems – Constrain
Propagation - Backtracking Search - Game Playing - Optimal Decisions in Games – Alpha - Beta Pruning - Stochast
Games
UNIT III KNOWLEDGE REPRESENTATION 9
First Order Predicate Logic – Prolog Programming – Unification – Forward Chaining-Backward Chaining –
Resolution – Knowledge Representation - Ontological Engineering-Categories and Objects – Events - Menta
Events and Mental Objects - Reasoning Systems for Categories - Reasoning with Default Information
UNIT IV SOFTWARE AGENTS 9
Architecture for Intelligent Agents – Agent communication – Negotiation and Bargaining – Argumentation amo
Agents – Trust and Reputation in Multi-agent systems.
UNIT V APPLICATIONS 9
AI applications – Language Models – Information Retrieval- Information Extraction – Natural Language Proce
- Machine Translation – Speech Recognition – Robot – Hardware – Perception – Planning – Moving

TOTAL :45 PERIODS

OUTCOMES:
Upon completion of the course, the students will be able to:
 Use appropriate search algorithms for any AI problem
 Represent a problem using first order and predicate logic
 Provide the apt agent strategy to solve a given problem
 Design software agents to solve a problem
 Design applications for NLP that use Artificial Intelligence.

TEXT BOOKS:
1
S. Russell and P. Norvig, "Artificial Intelligence: A Modern Approach”, Prentice Hall, Third Edition, 2009.
2 I. Bratko, “Prolog: Programming for Artificial Intelligence”, Fourth edition, Addison-Wesley Educational
Publishers Inc., 2011.
REFERENCES:
1. M. Tim Jones, “Artificial Intelligence: A Systems Approach(Computer Science)”, Jones and Bartlett Publisher
Inc.; First Edition, 2008
2. Nils J. Nilsson, “The Quest for Artificial Intelligence”, Cambridge University Press, 2009.
3. William F. Clocksin and Christopher S. Mellish,” Programming in Prolog: Using the ISO Standard”, Fifth Edition,
Springer, 2003.
4. Gerhard Weiss, “Multi Agent Systems”, Second Edition, MIT Press, 2013.
5. David L. Poole and Alan K. Mackworth, “Artificial Intelligence: Foundations of Computational Agents”, Cambridg
University Press, 2010.
 CS8601 MOBILE COMPUTING L T
3 0
OBJECTIVES:
 To understand the basic concepts of mobile computing.
 To learn the basics of mobile telecommunication system .
 To be familiar with the network layer protocols and Ad-Hoc networks.
 To know the basis of transport and application layer protocols.
 To gain knowledge about different mobile platforms and application development.
UNIT I INTRODUCTION 9
Introduction to Mobile Computing – Applications of Mobile Computing- Generations of Mobile Communication
Technologies- Multiplexing – Spread spectrum -MAC Protocols – SDMA- TDMA- FDMA- CDMA
UNIT II MOBILE TELECOMMUNICATION SYSTEM 9
Introduction to Cellular Systems - GSM – Services & Architecture – Protocols – Connection Establishment – Freque
Allocation – Routing – Mobility Management – Security – GPRS- UMTS – Architecture – Handover - Security
UNIT III MOBILE NETWORK LAYER 9
Mobile IP – DHCP – AdHoc– Proactive protocol-DSDV, Reactive Routing Protocols – DSR, AODV , Hybrid routing
ZRP, Multicast Routing- ODMRP, Vehicular Ad Hoc networks ( VANET) –MANET Vs VANET – Security.
UNIT IV MOBILE TRANSPORT AND APPLICATION LAYER 9
Mobile TCP– WAP – Architecture – WDP – WTLS – WTP –WSP – WAE – WTA Architecture – WML
UNIT V MOBILE PLATFORMS AND APPLICATIONS 9
Mobile Device Operating Systems – Special Constraints & Requirements – Commercial Mobile Operating Sys
– Software Development Kit: iOS, Android, BlackBerry, Windows Phone – MCommerce – Structure – Pros & C
Mobile Payment System – Security Issues

TOTAL 45 PE
OUTCO
At the end of the course, the students should be a
 Explain the basics of mobile telecommunication s
 Illustrate the generations of telecommunication systems in wireless networks
 Determine the functionality of MAC, network layer and Identify a routing protocol for a given Ad hoc network
 Explain the functionality of Transport and Application layers
 Develop a mobile application using android/blackberry/ios/Windows SDK
TEXT BOOKS:
1. Jochen Schiller, “Mobile Communications”, PHI, Second Edition, 2003.
2. Prasant Kumar Pattnaik, Rajib Mall, “Fundamentals of Mobile Computing”, PHI Learning Pvt.Ltd, New Delhi – 2
REFERENCES
1. Dharma Prakash Agarval, Qing and An Zeng, "Introduction to Wireless and Mobile systems",Thomson Asia Pv
2005.
2. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, “Principles of Mobile Computing”, Sprin
2003.
3. William.C.Y.Lee,“Mobile Cellular Telecommunications-Analog and Digital Systems”, Second Edition,TataMcGr
Edition ,2006.
4. C.K.Toh, “AdHoc Mobile Wireless Networks”, First Edition, Pearson Education, 2002.

5. Android Developers : http://developer.android.com/index.html6. Apple Developer : https://developer.apple.com/7.

CS8602 COMPILER DESIGN

OBJECTIVES:
 To learn the various phases of compiler.
 To learn the various parsing techniques.
 To understand intermediate code generation and run-time environment.
 To learn to implement front-end of the compiler.
 To learn to implement code generator.
UNIT I INTRODUCTION TO COMPILERS 9
Structure of a compiler – Lexical Analysis – Role of Lexical Analyzer – Input Buffering – Speci
Recognition of Tokens – Lex – Finite Automata – Regular Expressions to Automata – Minimizing DFA.
UNIT II SYNTAX ANALYSIS 12
Role of Parser – Grammars – Error Handling – Context-free grammars – Writing a grammar – Top Do
General Strategies Recursive Descent Parser Predictive Parser-LL(1) Parser-Shift Reduce Parse
(0)Item Construction of SLR Parsing Table - Introduction to LALR Parser - Error Handling and R
Analyzer-YACC.
UNIT III INTERMEDIATE CODE GENERATION 8
Syntax Directed Definitions, Evaluation Orders for Syntax Directed Definitions, Intermediate Langu
Tree, Three Address Code, Types and Declarations, Translation of Expressions, Type Check
UNIT IV RUN-TIME ENVIRONMENT AND CODE GENERATION 8
Storage Organization, Stack Allocation Space, Access to Non-local Data on the Stack, Heap Ma
in Code Generation - Design of a simple Code Generator.
UNIT V CODE OPTIMIZATION 8
Principal Sources of Optimization – Peep-hole optimization - DAG- Optimization of Basic Blocks- Globa
- Efficient Data Flow Algorithm.

LIST OF EXPERIMENTS:
1. Develop a lexical analyzer to recognize a few patterns in C. (Ex. identifiers, constants, comments, o
Create a symbol table, while recognizing identifiers.
2. Implement a Lexical Analyzer using Lex Tool
3. Implement an Arithmetic Calculator using LEX and YACC
4. Generate three address code for a simple program using LEX and YACC.
5. Implement simple code optimization techniques (Constant folding, Strength reduction and Algebraic
6. Implement back-end of the compiler for which the three address code is given as input and the 8086
code is produced as output.

PRACTICALS 30
THEORY 45
TOTAL : 75
OUTCOMES:
On Completion of the course, the students should be able to:
 Understand the different phases of compiler.
 Design a lexical analyzer for a sample language.
  Apply different parsing algorithms to develop the parsers for a given gra
 Understand syntax-directed translation and run-time enviro
 Learn to implement code optimization techniques and a simple code gen
 Design and implement a scanner and a parser using LEX and YACC
TEXT B
1. Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman, Compilers: Principles, Techniques and Toolsǁ, S
Edition, Pearson Education
REFERE
1. Randy Allen, Ken Kennedy, Optimizing Compilers for Modern Architectures: A Dependence based App
Morgan Kaufmann Publishers
2. Steven S. Muchnick, Advanced Compiler Design and Implementationǁ, Morgan Kau
Publishers - Elsevier Science, India, Indian Reprin
3. Keith D Cooper and Linda Torczon, Engineering a Compilerǁ, Morgan Kau
Publishers Elsevier Science
4. V. Raghavan, Principles of Compiler Designǁ, Tata McGraw Hill Education Pub

5. Allen I. Holub, Compiler Design in Cǁ, Prentice-Hall Software Series

CS8603 DISTRIBUTED SYSTEMS L
3
OBJECTIVES:
 To understand the foundations of distributed systems.
 To learn issues related to clock Synchronization and the need for global state in distributed systems.
 To learn distributed mutual exclusion and deadlock detection algorithms.
 To understand the significance of agreement, fault tolerance and recovery protocols in Distributed System
 To learn the characteristics of peer-to-peer and distributed shared memory systems.
UNIT I INTRODUCTION 9
Introduction: Definition –Relation to computer system components –Motivation –Relation to parallel systems
Message-passing systems versus shared memory systems –Primitives for distributed communication –Synchr
versus asynchronous executions –Design issues and challenges. A model of distributed computations: A dist
program –A model of distributed executions –Models of communication networks –Global state – Cuts –Past and fu
cones of an event –Models of process communications. Logical Time: A framework for a system of logical clocks –
time –Vector time – Physical clock synchronization: NTP.
UNIT II MESSAGE ORDERING & SNAPSHOTS 9
Message ordering and group communication: Message ordering paradigms –Asynchronous execution with
synchronous communication –Synchronous program order on an asynchronous system –Group communication
Causal order (CO) - Total order. Global state and snapshot recording algorithms: Introduction –System mod
definitions –Snapshot algorithms for FIFO channels
UNIT III DISTRIBUTED MUTEX & DEADLOCK 9
Distributed mutual exclusion algorithms: Introduction – Preliminaries – Lamport’s algorithm – Ricart-Agrawala
algorithm – Maekawa’s algorithm – Suzuki–Kasami’s broadcast algorithm. Deadlock detection in distrib
systems: Introduction – System model – Preliminaries –
Models of deadlocks – Knapp’s classification – Algorithms for the single resource model, the AND model an
OR model.

UNIT IV RECOVERY & CONSENSUS 9

Checkpointing and rollback recovery: Introduction – Background and definitions – Issues in failure recove
Checkpoint-based recovery – Log-based rollback recovery – Coordinated checkpointing algorithm – Algorithm
asynchronous checkpointing and recovery. Consensus and agreement algorithms: Problem definition – Overvi
results – Agreement in a failure – free system – Agreement in synchronous systems with failures.
UNIT V P2P & DISTRIBUTED SHARED MEMORY 9
Peer-to-peer computing and overlay graphs: Introduction – Data indexing and overlays – Chord – Content
addressable networks – Tapestry. Distributed shared memory: Abstraction and advantages – Memory consis
models –Shared memory Mutual Exclusion.

TOTAL: 45 PERIODS
OUTCOMES:
At the end of this course, the students will be able to:
 Elucidate the foundations and issues of distributed systems
  Understand the various synchronization issues and global state for distributed sy
 Understand the Mutual Exclusion and Deadlock detection algorithms in distributed s
 Describe the agreement protocols and fault tolerance mechanisms in distributed sy
 Describe the features of peer-to-peer and distributed shared memory s
TEXT BO
1. Kshemkalyani, Ajay D., and Mukesh Singhal. Distributed computing: principles, algorithms, and systems. Cam
University Press
2. George Coulouris, Jean Dollimore and Tim Kindberg, “Distributed Systems Concepts and Design”, Fifth E
Pearson Education
REFERE
1. Pradeep K Sinha, "Distributed Operating Systems: Concepts and Design", Prentice Hall of India
2. Mukesh Singhal and Niranjan G. Shivaratri. Advanced concepts in operating systems. McGraw-Hill, Inc.
3. Tanenbaum A.S., Van Steen M., “Distributed Systems: Principles and Paradigms”, Pearson Edu

4. Liu M.L., “Distributed Computing, Principles and Applications”, Pearson Education

5. Nancy A Lynch, “Distributed Algorithms”, Morgan Kaufman Publishers, USA
CS8661 INTERNET PROGRAMMING LABORATORY L T
0 0

OBJECTIVES:
 To be familiar with Web page design using HTML/XML and style sheets
 To be exposed to creation of user interfaces using Java frames and applets.
 To learn to create dynamic web pages using server side scripting.
 To learn to write Client Server applications.
 To be familiar with the PHP programming.
 To be exposed to creating applications with AJAX
LIST OF EXPERIMENTS
1. Create a web page with the following using HTML
a. To embed a map in a web page
b. To fix the hot spots in that map
c. Show all the related information when the hot spots are clicked.
2. Create a web page with the following.
a. Cascading style sheets.
b. Embedded style sheets.
c. Inline style sheets. Use our college information for the web pages.
3. Validate the Registration, user login, user profile and payment by credit card pages using JavaScript.
4. Write programs in Java using Servlets:
i. To invoke servlets from HTML forms
ii. Session tracking using hidden form fields and Session tracking for a hit count
5. Write programs in Java to create three-tier applications using servlets for conducting on- line examination for
displaying student mark list. Assume that student information is available in a database which has been stored in a
database server.
6. Install TOMCAT web server. Convert the static web pages of programs into dynamic web pages using servlets
JSP) and cookies. Hint: Users information (user id, password, credit card number) would be stored in web.
Each user should have a separate Shopping Cart.
7. Redo the previous task using JSP by converting the static web pages into dynamic web pages. Create a data
with user information and books information. The books catalogue should be dynamically loaded from the datab
8. Create and save an XML document at the server, which contains 10 users Information. Write a Program, wh
takes user Id as an input and returns the User details by taking the user information from the XML document
9. i. Validate the form using PHP regular expression.
ii. PHP stores a form data into database.
10. Write a web service for finding what people think by asking 500 people’s opinion for any consumer product.

TOTAL: 60PE
OUTCO
Upon Completion of the course, the students will be a
 Construct Web pages using HTML/XML and style

 Build dynamic web pages with validation using Java Script objects and by applying different event ha
mecha
 Develop dynamic web pages using server side sc
 Use PHP programming to develop web applic
 Construct web applications using AJAX and web se
SOFTWARE REQU
 Dream Weaver or Equivalent, MySQL or Equivalent, Apache Server, WAMP/X
CS8662 MOBILE APPLICATION DEVELOPMENT LABORATORY L T
0 0
OBJECTIVES:
 To understand the components and structure of mobile application development frameworks for Android and win
OS based mobiles.
 To understand how to work with various mobile application development frameworks.
 To learn the basic and important design concepts and issues of development of mobile applications.
 To understand the capabilities and limitations of mobile devices.

LIST OF EXPERIMENTS
1. Develop an application that uses GUI components, Font and Colours
2. Develop an application that uses Layout Managers and event listeners.
3. Write an application that draws basic graphical primitives on the screen.
4. Develop an application that makes use of databases.
5. Develop an application that makes use of Notification Manager
6. Implement an application that uses Multi-threading
7. Develop a native application that uses GPS location information
8. Implement an application that writes data to the SD card.
9. Implement an application that creates an alert upon receiving a message
10. Write a mobile application that makes use of RSS feed
11. Develop a mobile application to send an email.
12. Develop a Mobile application for simple needs (Mini Project)

TOTAL: 60 PERIODS
OUTCOMES:
Upon Completion of the course, the students will be able to:
 Develop mobile applications using GUI and Layouts.
 Develop mobile applications using Event Listener.
 Develop mobile applications using Databases.
  Develop mobile applications using RSS Feed, Internal/External Storage, SMS, Multi- threading
 Analyze and discover own mobile app for sim
REFE
1. Build Your Own Security Lab, Michael Gregg, W
LIST OF EQUIPMENT FOR A BATCH OF 30 S
Standalone desktops with Windows or Android or iOS or Equivalent Mobile Application De
Tools with appropriate emulators and debuggers
HS8581 PROFESSIONAL COMMUNICATION L T
0 0

OBJECTIVES:
The course aims to:
 Enhance the Employability and Career Skills of students
 Orient the students towards grooming as a professional
 Make them Employable Graduates
 Develop their confidence and help them attend interviews successfully.
UNIT I
Introduction to Soft Skills-- Hard skills & soft skills - employability and career Skills—Grooming as a professional with
Time Management—General awareness of Current Affairs
UNIT II
Self-Introduction-organizing the material - Introducing oneself to the audience – introducing the topic –
answering questions – individual presentation practice–– presenting the visuals effectively – 5 minute presentations

UNIT III
Introduction to Group Discussion— Participating in group discussions – understanding group dynamics
- brainstorming the topic -– questioning and clarifying –GD strategies- activities to improve GD skills
UNIT IV
Interview etiquette – dress code – body language – attending job interviews– telephone/skype interview -one
interview &panel interview – FAQs related to job interviews
UNIT V
Recognizing differences between groups and teams- managing time-managing stress- networking professiona
respecting social protocols-understanding career management-developing a long-term career plan-making career ch
TOTAL : 30 PERIODS
OUTCOMES:
At the end of the course Learners will be able to:
• Make effective presentations
• Participate confidently in Group Discussions.
• Attend job interviews and be successful in them.
• Develop adequate Soft Skills required for the workplace
Recommended Software
1. Open Source Software
2. Win English

REFE
1. Butterfield, Jeff Soft Skills for Everyone. Cengage Learning: New D
2. E. Suresh Kumar et al. Communication for Professional Success. Orient Blackswan: Hydera
3. Interact English Lab Manual for Undergraduate Students,. OrientBalckSwan: Hyderab
4. Raman, Meenakshi and Sangeeta Sharma. Professional Communication. Oxford University Press: Ox
5. S. Hariharanetal. Soft Skills. MJP Publishers: Chen
MG8591 PRINCIPLES OF MANAGEMENT

OBJECTIVES:
 To enable the students to study the evolution of Management, to study the functions and principles of
management and to learn the application of the principles in an organization .
UNIT I INTRODUCTION TO MANAGEMENT AND ORGANIZATIONS 9
Definition of Management – Science or Art – Manager Vs Entrepreneur - types of managers - manageria
skills – Evolution of Management – Scientific, human relations , system and contingency approaches – Types of
Business organization - Sole proprietorship, partnership, company-public and private sector enterprises - Organ
culture and Environment – Current trends and issues in Management.
UNIT II PLANNING 9
Nature and purpose of planning – planning process – types of planning – objectives – setting objectives
– Planning premises – Strategic Management – Planning Tools and Techniques – Decision making steps an
process.
UNIT III ORGANISING 9
Nature and purpose – Formal and informal organization – organization chart – organization structure – typ
Line and staff authority – departmentalization – delegation of authority –
centralization and decentralization – Job Design - Human Resource Management – HR Planning, Recruit
Training and Development, Performance Management , Career planning and management
UNIT IV DIRECTING 9
Foundations of individual and group behaviour – motivation – motivation theories – motivational techniqu
– job enrichment – leadership – types and theories of leadership – communication – process of communi
communication – effective communication –communication and IT.
UNIT V CONTROLLING 9
System and process of controlling – budgetary and non-budgetary control techniques – use of com
Management control – Productivity problems and management – control and
performance – direct and preventive control – reporting.

TOTAL: 45 PERIODS
OUTCOMES:
 Upon completion of the course, students will be able to have clear understanding of manageria
planning, organizing, staffing, leading & controlling and have same basic knowledge on international aspe
TEXTBOOKS:
1. Stephen P. Robbins & Mary Coulter, “Management”, Prentice Hall (India) Pvt. Ltd., 10 th Edition, 2009.
2. JAF Stoner, Freeman R.E and Daniel R Gilbert “Management”, Pearson Education, 6th Edition
REFERENCES:
1. Stephen A. Robbins & David A. Decenzo & Mary Coulter, “Fundamentals of Management” Pearson E
Edition, 2011.
2. Robert Kreitner & Mamata Mohapatra, “ Management”, Biztantra, 2008.
3. Harold Koontz & Heinz Weihrich “Essentials of management” Tata McGraw Hill,1998.
4. Tripathy PC & Reddy PN, “Principles of Management”, Tata McGraw Hill, 1999

CS8792 CRYPTOGRAPHY AND NETWORK SECURITY L

3
OBJECTIVES:

 To understand Cryptography Theories, Algorithms and Systems.

 To understand necessary Approaches and Techniques to build protection mechanisms in orde
networks.
 UNIT I INTRODUCTION 9
Security trends - Legal, Ethical and Professional Aspects of Security, Need for Security at Multiple le
Policies - Model of network security – Security attacks, services and mechanisms – OSI security a
Classical encryption techniques: substitution techniques, transposition techniques, steganography-
modern cryptography: perfect security – information theory – product cryptosystem – cryptanalysis.

UNIT II SYMMETRIC KEY CRYPTOGRAPHY 9

MATHEMATICS OF SYMMETRIC KEY CRYPTOGRAPHY: Algebraic structures - Modular arithmetic
Congruence and matrices - Groups, Rings, Fields- Finite fields- SYMMETRIC KEY CIPHERS:
cipher Principles of DES – Strength of DES – Differential and linear cryptanalysis - Block cipher desig
cipher
mode of operation – Evaluation criteria for AES – Advanced Encryption Standard - RC4 –
Key distribution.
UNIT III PUBLIC KEY CRYPTOGRAPHY 9
MATHEMATICS OF ASYMMETRIC KEY CRYPTOGRAPHY: Primes – Primality Testing – Factorization – Euler’s
totient function, Fermat’s and Euler’s Theorem - Chinese Remainder Theorem – Exponentiation and logarith
ASYMMETRIC KEY CIPHERS: RSA cryptosystem – Key distribution – Key management – Diffie Hellm
key exchange - ElGamal cryptosystem – Elliptic curve arithmetic-Elliptic curve cryptography.
UNIT IV MESSAGE AUTHENTICATION AND INTEGRITY 9
Authentication requirement – Authentication function – MAC – Hash function – Security of hash function and MAC
SHA –Digital signature and authentication protocols – DSS- Entity Authentication: Biometrics, Passwords,
Challenge Response protocols- Authentication applications - Kerberos, X.509
UNIT V SECURITY PRACTICE AND SYSTEM SECURITY 9
Electronic Mail security – PGP, S/MIME – IP security – Web Security - SYSTEM SECURITY: Intrude
Malicious software – viruses – Firewalls.
 TOTAL 45 PE
OUTCO
At the end of the course, the student should be a
 Understand the fundamentals of networks security, security architecture, threats and vulnera
 Apply the different cryptographic operations of symmetric cryptographic algo
 Apply the different cryptographic operations of public key crypto
 Apply the various Authentication schemes to simulate different applic
 Understand various Security practices and System security sta
TEXT B
1. William Stallings, Cryptography and Network Security: Principles and Practice, PHI 3rd Edition
REFERE
1. C K Shyamala, N Harini and Dr. T R Padmanabhan: Cryptography and Network Security, Wiley India
2. BehrouzA.Foruzan, Cryptography and Network Security, Tata McGraw Hil
3. Charlie Kaufman, Radia Perlman, and Mike Speciner, Network Security: PRIVATE Communication in a P
World, Prentice Hall, ISBN 0-13-04
CS8791 CLOUD COMPUTING L
3

OBJECTIVES:
 To understand the concept of cloud computing.
 To appreciate the evolution of cloud from the existing technologies.
 To have knowledge on the various issues in cloud computing.
 To be familiar with the lead players in cloud.
 To appreciate the emergence of cloud as the next generation computing paradigm.
UNIT I INTRODUCTION 9
Introduction to Cloud Computing – Definition of Cloud – Evolution of Cloud Computing –
Underlying Principles of Parallel and Distributed Computing – Cloud Characteristics – Elasticity in Cloud – On-dema
Provisioning.
UNIT II CLOUD ENABLING TECHNOLOGIES 10
Service Oriented Architecture – REST and Systems of Systems – Web Services – Publish- Subscribe Mode
Basics of Virtualization – Types of Virtualization – Implementation Levels of Virtualization – Virtualization Struc
– Tools and Mechanisms – Virtualization of CPU – Memory – I/O Devices –Virtualization Support and Disaster
Recovery.
UNIT III CLOUD ARCHITECTURE, SERVICES AND STORAGE 8
Layered Cloud Architecture Design – NIST Cloud Computing Reference Architecture – Public, Private and H
Clouds - laaS – PaaS – SaaS – Architectural Design Challenges – Cloud Storage – Storage-as-a-Service –
Advantages of Cloud Storage – Cloud Storage Providers – S3.
UNIT IV RESOURCE MANAGEMENT AND SECURITY IN CLOUD 10
Inter Cloud Resource Management – Resource Provisioning and Resource Provisioning Methods – Global Exchan
Cloud Resources – Security Overview – Cloud Security Challenges – Software-as-a-Service Security – Secu
Governance – Virtual Machine Security – IAM – Security Standards.
UNIT V CLOUD TECHNOLOGIES AND ADVANCEMENTS 8
Hadoop – MapReduce – Virtual Box -- Google App Engine – Programming Environment for Google App E
–– Open Stack – Federation in the Cloud – Four Levels of Federation – Federated Services and Applicatio
Future of Federation.

TOTAL: 45 PERIODS
OUTCOMES:
On Completion of the course, the students should be able to:
 Articulate the main concepts, key technologies, strengths and limitations of cloud computing.
 Learn the key and enabling technologies that help in the development of cloud.
 Develop the ability to understand and use the architecture of compute and storage cloud, service and delivery m
 Explain the core issues of cloud computing such as resource management and security.
 Be able to install and use current cloud technologies.
 Evaluate and choose the appropriate technologies, algorithms and approaches for implementation an
of cloud.
TEXT BOOKS:
1. Kai Hwang, Geoffrey C. Fox, Jack G. Dongarra, "Distributed and Cloud Computing, From Parallel Proces
to the Internet of Things", Morgan Kaufmann Publishers, 2012.
2. Rittinghouse, John W., and James F. Ransome, “Cloud Computing: Implementation, Management and
Security”, CRC Press, 2017.
REFERENCES:
1. Rajkumar Buyya, Christian Vecchiola, S. ThamaraiSelvi, “Mastering Cloud Computing”, Tata Mcgraw Hill, 2
2. Toby Velte, Anthony Velte, Robert Elsenpeter, "Cloud Computing - A Practical Approach”, Tata Mcgraw Hill, 2009
3. George Reese, "Cloud Application Architectures: Building Applications and Infrastructure in the Cloud: Transactio
Systems for EC2 and Beyond (Theory in Practice)”, O'Reilly, 2009.

CS8711 CLOUD COMPUTING LABORATORY L

0
OBJEC
 To develop web applications i
 To learn the design and development process involved in creating a cloud based app
 To learn to implement and use parallel programming using H
1. Install Virtualbox/VMware Workstation with different flavours of linux or windows OS on top of windows
2. Install a C compiler in the virtual machine created using virtual box and execute Simple Pro
3. Install Google App Engine. Create hello world app and other simple web applications using pytho
4. Use GAE launcher to launch the web applic
5. Simulate a cloud scenario using CloudSim and run a scheduling algorithm that is not present in Clo
6. Find a procedure to transfer the files from one virtual machine to another virtual ma
7. Find a procedure to launch virtual machine using trystack (Online Openstack Demo V
8. Install Hadoop single node cluster and run simple applications like word
TOTAL : 60 PE
 OUTCO
On completion of this course, the students will be a
 Configure various virtualization tools such as Virtual Box, VMware works
 Design and deploy a web application in a PaaS enviro
 Learn how to simulate a cloud environment to implement new sche
 Install and use a generic cloud environment that can be used as a private
 Manipulate large data sets in a parallel enviro
IT8761 SECURITY LABORATORY L T
0 0

OBJECTIVES:
 To learn different cipher techniques
 To implement the algorithms DES, RSA,MD5,SHA-1
 To use network security tools and vulnerability assessment tools
LIST OF EXPERIMENTS
1. Perform encryption, decryption using the following substitution techniques
(i) Ceaser cipher, (ii) playfair cipher iii) Hill Cipher iv) Vigenere cipher
2. Perform encryption and decryption using following transposition techniques
i) Rail fence ii) row & Column Transformation
3. Apply DES algorithm for practical applications.
4. Apply AES algorithm for practical applications.
5. Implement RSA Algorithm using HTML and JavaScript
6. Implement the Diffie-Hellman Key Exchange algorithm for a given problem.
7. Calculate the message digest of a text using the SHA-1 algorithm.
8. Implement the SIGNATURE SCHEME - Digital Signature Standard.
9. Demonstrate intrusion detection system (ids) using any tool eg. Snort or any other s/w.

10. Automated Attack and Penetration

Exploring N-Stalker, a Vulnerability Assessme
11. Defeating M
i) Building Trojans ii) Rootkit
TOTAL: 60 PE
 OUTCO
Upon Completion of the course, the students will be a
 Develop code for classical Encryption Techniques to solve the pro
 Build cryptosystems by applying symmetric and public key encryption algo
 Construct code for authentication algo
 Develop a signature scheme using Digital signature sta
 Demonstrate the network security system using open sourc
REFERE
1. Build Your Own Security Lab, Michael Gregg, Wile
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS: SOFTWARE: C / C++ / J
equivalent compiler GnuPG, Snort, N-Stalker or Equivalent HARDWARE: Standalone desktops - 30 Nos. (or)
supporting 30 terminals o
CS8811 PROJECT WORK L T
0 0

OBJECTIVES:
 To develop the ability to solve a specific problem right from its identification and literature review
the successful solution of the same. To train the students in preparing project reports and to face reviews and
voce examination.
The students in a group of 3 to 4 works on a topic approved by the head of the department under the guidance of a
member and prepares a comprehensive project report after completing the work to the satisfaction of the supervisor
progress of the project is evaluated based on a minimum of three reviews. The review committee may be cons
by the Head of the Department. A project report is required at the end of the semester. The project w
is evaluated based on oral presentation and the project report jointly by external and internal
examiners constituted by the Head of the Department.

TOTAL: 300 PE
OUTC
 On Completion of the project work students will be in a position to take up any challenging p
problems and find solution by formulating proper metho
CS8075 DATA WAREHOUSING AND DATA MINING L T
3 0

OBJECTIVES:
 To understand data warehouse concepts, architecture, business analysis and tools
 To understand data pre-processing and data visualization techniques
 To study algorithms for finding hidden and interesting patterns in data
 To understand and apply various classification and clustering techniques using tools.
UNIT I DATA WAREHOUSING, BUSINESS ANALYSIS AND ON-LINE ANALYTICAL PROCESSING (OLA
9
Basic Concepts - Data Warehousing Components – Building a Data Warehouse – Database Architectures fo
Parallel Processing – Parallel DBMS Vendors - Multidimensional Data Model – Data Warehouse Schemas for Decis
Support, Concept Hierarchies -Characteristics of OLAP Systems – Typical OLAP Operations, OLAP and OLTP.
UNIT II DATA MINING – INTRODUCTION 9
Introduction to Data Mining Systems – Knowledge Discovery Process – Data Mining Techniques – Issues –
applications- Data Objects and attribute types, Statistical description of data, Data Preprocessing – Cleanin
Integration, Reduction, Transformation and discretization, Data Visualization, Data similarity and dissimilarity
measures.
UNIT III DATA MINING - FREQUENT PATTERN ANALYSIS 9
Mining Frequent Patterns, Associations and Correlations – Mining Methods- Pattern Evaluation Method – Pa
Mining in Multilevel, Multi Dimensional Space – Constraint Based Frequent Pattern Mining, Classification using
Frequent Patterns
UNIT IV CLASSIFICATION AND CLUSTERING 9
Decision Tree Induction - Bayesian Classification – Rule Based Classification – Classification by Back Propagation
Support Vector Machines –– Lazy Learners – Model Evaluation and Selection-Techniques to improve Classific
Accuracy.
Clustering Techniques – Cluster analysis-Partitioning Methods - Hierarchical Methods – Density Based Methods -
Based Methods – Evaluation of clustering – Clustering high dimensional data- Clustering with constraints, Outlie
analysis-outlier detection methods.
UNIT V WEKA TOOL 9
Datasets – Introduction, Iris plants database, Breast cancer database, Auto imports database - Introduction to
WEKA, The Explorer – Getting started, Exploring the explorer, Learning algorithms,
Clustering algorithms, Association–rule learners.

TOTAL: 45 PERIODS
OUTCOMES:
Upon completion of the course, the students should be able to:
 Design a Data warehouse system and perform business analysis with OLAP tools.
 Apply suitable pre-processing and visualization techniques for data analysis
 Apply frequent pattern and association rule mining techniques for data analysis
 Apply appropriate classification and clustering techniques for data analysis
TEXT BOOK:
1. Jiawei Han and Micheline Kamber, “Data Mining Concepts and Techniques”, Third Edition, Elsevier, 2012.
REFERENCES:
1. Alex Berson and Stephen J.Smith, “Data Warehousing, Data Mining & OLAP”, Tata McGraw – Hill Edition
Reprint 2016.
2. K.P. Soman, Shyam Diwakar and V. Ajay, “Insight into Data Mining Theory and Practice”, Eastern Economy Ed
Prentice Hall of India, 2006.
3. Ian H.Witten and Eibe Frank, “Data Mining: Practical Machine Learning Tools and
Techniques”, Elsevier, Second Edition.

IT8076 SOFTWARE TESTING LTPC300 3

OBJECTIVES:
 To learn the criteria for test cases.
 To learn the design of test cases.
 To understand test management and test automation techniques.
 To apply test metrics and measurements.
UNIT I INTRODUCTION 9
Testing as an Engineering Activity – Testing as a Process – Testing Maturity Model- Testing axioms – Bas
definitions – Software Testing Principles – The Tester’s Role in a Software Development Organization – Origin
Defects – Cost of defects – Defect Classes – The Defect Repository and Test Design –Defect Examples-
Developer/Tester Support of Developing a Defect Repository.
UNIT II TEST CASE DESIGN STRATEGIES 9
Test case Design Strategies – Using Black Box Approach to Test Case Design – Boundary Value Analysis – Equiv
Class Partitioning – State based testing – Cause-effect graphing – Compatibility testing – user documenta
testing – domain testing - Random Testing – Requirements based testing – Using White Box Approach to Te
design – Test Adequacy Criteria
– static testing vs. structural testing – code functional testing – Coverage and Control Flow Graphs
– Covering Code Logic – Paths – code complexity testing – Additional White box testing approaches- Evalu
Test Adequacy Criteria.
UNIT III LEVELS OF TESTING 9
The need for Levels of Testing – Unit Test – Unit Test Planning – Designing the Unit Tests – The Test Harness –
Running the Unit tests and Recording results – Integration tests – Designing Integration Tests – Integration T
Planning – Scenario testing – Defect bash elimination System Testing – Acceptance testing – Performance testi
Regression Testing – Internationalization testing – Ad-hoc testing – Alpha, Beta Tests – Testing OO systems – Usa
and Accessibility testing – Configuration testing –Compatibility testing – Testing the documentation – W
testing.
UNIT IV TEST MANAGEMENT 9
People and organizational issues in testing – Organization structures for testing teams – testing services – T
Planning – Test Plan Components – Test Plan Attachments – Locating Test Items – test management – tes
process – Reporting Test Results – Introducing the test specialist – Skills needed by a test specialist – Building
Testing Group- The Structure of Testing Group- .The Technical Training Program.
UNIT V TEST AUTOMATION 9
Software test automation – skills needed for automation – scope of automation – design and architecture f
automation – requirements for a test tool – challenges in automation – Test metrics and measurements – pro
progress and productivity metrics.

TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course the students will be able to:

 Design test cases suitable for a software development for different domains.
 Identify suitable tests to be carried out.
 Prepare test planning based on the document.
 Document test plans and test cases designed.
 Use automatic testing tools.
 Develop and validate a test plan.
 TEXT BO
1. Srinivasan Desikan and Gopalaswamy Ramesh, “Software Testing – Principles and Practices”, Pearson Edu

2. Ron Patton, “Software Testing”, Second Edition, Sams Publishing, Pearson Education, 2007. AU Libra
REFERE
1. Ilene Burnstein, “Practical Software Testing”, Springer International Edition
2. Edward Kit,” Software Testing in the Real World – Improving the Process”, Pearson Education
3. Boris Beizer,” Software Testing Techniques” – 2nd Edition, Van Nostrand Reinhold, New York
4. Aditya P. Mathur, “Foundations of Software Testing _ Fundamental Algorithms and Techniques”, Dorling Kind
(India) Pvt. Ltd., Pearson Education
IT8072 EMBEDDED SYSTEMS LTPC3
 OBJEC
 To learn the architecture and programming of ARM proc
 To become familiar with the embedded computing platform design and an
 To get thorough knowledge in interfacing co
 To design an embedded system and to develop pro
UNIT I INTRODUCTION TO EMBEDDED COMPUTING AND ARM PROCESSORS
Complex systems and micro processors– Embedded system design process –Design example: Model train con
Instruction sets preliminaries - ARM Processor – CPU: programming input and output- supervisor mode, excep
and traps – Co-processors- Memory system mechanisms – CPU performance- CPU power consum
UNIT II EMBEDDED COMPUTING PLATFORM DESIGN
The CPU Bus-Memory devices and systems–Designing with computing platforms – consumer elect
architecture – platform-level performance analysis - Components for embedded programs- Models of pro
Assembly, linking and loading – compilation techniques- Program level performance analysis – Software perform
optimization – Program level energy and power analysis and optimization – Analysis and optimization of program
Program validation and
UNIT III SENSOR INTERFACING WITH ARDUINO
Basics of hardware design and functions of basic passive components-sensors and actuators- Arduino code -
file for sensor interfacing-construction of basic appli
UNIT IV EMBEDDED FIRMWARE
Reset Circuit, Brown-out Protection Circuit-Oscillator Unit - Real Time Clock-Watchdog Timer - Emb
Firmware Design Approaches and Development Lang
UNIT V EMBEDDED C PROGRAMMING
Introduction-Creating ‘hardware delays’ using Timer 0 and Timer 1-Reading switches-Adding Structure to the
Generating a minimum and maximum delay-Example: Creating a portable hardware delay- Timeout mecha
Creating loop timeouts-Testing loop timeouts- hardware timeouts-Testing a hardware t
TOTAL : 45 PE
OUTCOMES:Upon completion of the course, students will be able to: Describe the architecture and programming of ARM processor.
OBJECTIVES:
 To provide students with a theoretical as well as practical understanding of agile software development pra
and how small teams can apply them to create high-quality software.
 To provide a good understanding of software design and a set of software technologies and APIs.
 To do a detailed examination and demonstration of Agile development and testing techniques.
 To understand the benefits and pitfalls of working in an Agile team.
 To understand Agile development and testing.
UNIT I AGILE METHODOLOGY 9
Theories for Agile Management – Agile Software Development – Traditional Model vs. Agile Model
- Classification of Agile Methods – Agile Manifesto and Principles – Agile Project Management – Agile Team
Interactions – Ethics in Agile Teams - Agility in Design, Testing – Agile Documentations – Agile Drive
Capabilities and Values
UNIT II AGILE PROCESSES 9
Lean Production - SCRUM, Crystal, Feature Driven Development- Adaptive Software Development - Ext
Programming: Method Overview – Lifecycle – Work Products, Roles and Practices.
UNIT III AGILITY AND KNOWLEDGE MANAGEMENT 9
Agile Information Systems – Agile Decision Making - Earl‘S Schools of KM – Institutional Knowledge Evolut
Cycle – Development, Acquisition, Refinement, Distribution, Deployment , Leveraging – KM in Software
Engineering – Managing Software Knowledge – Challenges of
Migrating to Agile Methodologies – Agile Knowledge Sharing – Role of Story-Cards – Story-Card Maturity Model (SM

UNIT IV AGILITY AND REQUIREMENTS ENGINEERING 9

Impact of Agile Processes in RE–Current Agile Practices – Variance – Overview of RE Using Agile – Managing Uns
Requirements – Requirements Elicitation – Agile Requirements Abstraction Model – Requirements Management
Agile Environment, Agile Requirements Prioritization – Agile Requirements Modeling and Generation – Concurre
Agile Requirements Generation.
UNIT V AGILITY AND QUALITY ASSURANCE 9
Agile Product Development – Agile Metrics – Feature Driven Development (FDD) – Financial and Production Metrics
FDD – Agile Approach to Quality Assurance - Test Driven Development – Agile Approach in Global Software
Development.
 TOTAL: 45 PE
OUTCO
Upon completion of the course, the students will be a
 Realize the importance of interacting with business stakeholders in determining the requirements for a so


Perform iterative software development processes: how to plan them, how to execute
 Point out the impact of social aspects on software development su
 Develop techniques and tools for improving team collaboration and software
 Perform Software process improvement as an ongoing task for development
 Show how agile approaches can be scaled up to the enterpris
TEXT BO
1. David J. Anderson and Eli Schragenheim, “Agile Management for Software Engineering: Applying the Th
Constraints for Business Results”, Prentice Hall
2. Hazza and Dubinsky, “Agile Software Engineering, Series: Undergraduate Topics in Computer Science”, Sp

REFERE
1. Craig Larman, “Agile and Iterative Development: A Manager‘s Guide”, Addison-Wesley
2. Kevin C. Desouza, “Agile Information Systems: Conceptualization, Construction, and Management”, Butte
Heinemann
CS8077 GRAPH THEORY AND APPLICATIONS L T
3 0

OBJECTIVES:
 To understand fundamentals of graph theory.
 To study proof techniques related to various concepts in graphs.
 To explore modern applications of graph theory.
UNIT I 9
Introduction - Graph Terminologies - Types of Graphs - Sub Graph- Multi Graph - Regular Graph - Isomorphism
Isomorphic Graphs - Sub-graph - Euler graph - Hamiltonian Graph - Related Theorems.
UNIT II 9
Trees -Properties- Distance and Centres - Types - Rooted Tree-- Tree Enumeration- Labeled Tree -
Unlabeled Tree - Spanning Tree - Fundamental Circuits- Cut Sets - Properties - Fundamental Circui
and Cut-set- Connectivity- Separability -Related
Theorems.
 UNIT III 9
Network Flows - Planar Graph - Representation - Detection - Dual Graph - Geometric and Combinatorial Dual -
Related Theorems - Digraph - Properties - Euler Digraph.
UNIT IV 9
Matrix Representation - Adjacency matrix- Incidence matrix- Circuit matrix - Cut-set matrix - Path Matrix- Prop
- Related Theorems - Correlations. Graph Coloring - Chromatic Polynomial - Chromatic Partitioning - Match
Covering - Related Theorems.
UNIT V 9
Graph Algorithms- Connectedness and Components- Spanning Tree- Fundamental Circuits- Cut Vertice
Directed Circuits- Shortest Path - Applications overview.

TOTAL : 45 PERIODS
OUTCOMES:
Upon completion of this course, the students should be able to
 Understand the basic concepts of graphs, and different types of graphs
 Understand the properties, theorems and be able to prove theorems.
 Apply suitable graph model and algorithm for solving applications.
TEXT BOOKS:
1. Narsingh Deo, "Graph Theory with Application to Engineering and Computer Science", Prentice-
India Pvt.Ltd, 2003.
2. L.R.Foulds , "Graph Theory Applications", Springer ,2016.
REFERENCES:
1. Bondy, J. A. and Murty, U.S.R., "Graph Theory with Applications", North Holland Publication,2008.
2. West, D. B., “Introduction to Graph Theory”, Pearson Education, 2011.
3. John Clark, Derek Allan Holton, “A First Look at Graph Theory”, World Scientific Publishing Company, 1991
4. Diestel, R, "Graph Theory", Springer,3rd Edition,2006.
5. Kenneth H.Rosen, "Discrete Mathematics and Its Applications", Mc Graw Hill , 2007.

L T P C
3 0 0 3
IT8071 DIGITAL SIGNAL PROCESSING
OBJECTIVES:
 To understand the basics of discrete time signals, systems and their classifications.
 To analyze the discrete time signals in both time and frequency domain.
 To design lowpass digital IIR filters according to predefined specifications based on analog filter theory and anal
digital filter transformation.
 To design Linear phase digital FIR filters using fourier method, window technique
 To realize the concept and usage of DSP in various engineering fields.
UNIT I DISCRETE TIME SIGNALS AND SYSTEMS 9
Introduction to DSP – Basic elements of DSP– Sampling of Continuous time signals–Representation, Operation and
Classification of Discrete Time Signal–Classification of Discrete Time Systems– Discrete Convolution: Linear a
Circular–Correlation.
UNIT II ANALYSIS OF LTI DISCRETE TIME SIGNALS AND SYSTEMS 9
Analysis of LTI Discrete Time Systems using DFT–Properties of DFT–Inverse DFT– Analysis of LTI Discrete Time
Systems using FFT Algorithms– Inverse DFT using FFT Algorithm.

UNIT III INFINITE IMPULSE RESPONSE FILTERS 9

Frequency response of Analog and Digital IIR filters–Realization of IIR filter–Design of analog low pass filter–A
to Digital filter Transformation using Bilinear Transformation and Impulse Invariant method–Design of digital IIR fil
(LPF, HPF, BPF, and BRF) using various transformation techniques.
UNIT IV FINITE IMPULSE RESPONSE FILTERS 9
Linear Phase FIR filter–Phase delay–Group delay–Realization of FIR filter–Design of Causal and Non-causal
filters (LPF, HPF, BPF and BRF) using Window method (Rectangular, Hamming window, Hanning window) –
Frequency Sampling Technique.
UNIT V APPLICATIONS OF DSP 9
Multirate Signal Processing: Decimation, Interpolation, Spectrum of the sampled signal –Processing of Audio and Ra
signal.

TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the students should be able to:
 Perform mathematical operations on signals.
 Understand the sampling theorem and perform sampling on continuous-time signals to get discrete time si
by applying advanced knowledge of the sampling theory.
 Transform the time domain signal into frequency domain signal and vice-versa.
 Apply the relevant theoretical knowledge to design the digital IIR/FIR filters for the given analog specifica
TEXT BOOK:
1. John G. Proakis & Dimitris G.Manolakis, “Digital Signal Processing – Principles, Algorithms & Applications”, Fo
Edition, Pearson Education / Prentice Hall, 2007.
REFERENCES
1. Richard G. Lyons, “Understanding Digital Signal Processing”. Second Edition, Pearson Education.
2. A.V.Oppenheim, R.W. Schafer and J.R. Buck, “Discrete-Time Signal Processing”, 8th Indian Reprint, Pearson
2004.
3. Emmanuel C.Ifeachor, & Barrie.W.Jervis, “Digital Signal Processing”, Second Edition, Pearson Education / Pr
Hall, 2002.
4. William D. Stanley, “Digital Signal Processing”, Second Edition, Reston Publications.

GE8075 INTELLECTUAL PROPERTY RIGHTS L

3
OBJECTIVE:
 To give an idea about IPR, registration and its enforcement.
UNIT I INTRODUCTION 9
Introduction to IPRs, Basic concepts and need for Intellectual Property - Patents, Copyrights, Geographical
Indications, IPR in India and Abroad – Genesis and Development – the way from WTO to WIPO –TRIPS, Natu
Intellectual Property, Industrial Property, technological Research, Inventions and Innovations – Important exam
of IPR.
UNIT II REGISTRATION OF IPRs 10
Meaning and practical aspects of registration of Copy Rights, Trademarks, Patents, Geographical Indications, Trade
Secrets and Industrial Design registration in India and Abroad

UNIT III AGREEMENTS AND LEGISLATIONS 10

International Treaties and Conventions on IPRs, TRIPS Agreement, PCT Agreement, Patent Act of India, Patent
Amendment Act, Design Act, Trademark Act, Geographical Indication Act.
UNIT IV DIGITAL PRODUCTS AND LAW 9
Digital Innovations and Developments as Knowledge Assets – IP Laws, Cyber Law and Digital Content
Protection – Unfair Competition – Meaning and Relationship between Unfair Competition and IP Laws – Case St

UNIT V ENFORCEMENT OF IPRs 7

Infringement of IPRs, Enforcement Measures, Emerging issues – Case Studies.
TOTAL : 45 PERIODS
OUTCOME:
 Ability to manage Intellectual Property portfolio to enhance the value of the firm.
TEXT BOOKS:
1. V. Scople Vinod, Managing Intellectual Property, Prentice Hall of India pvt Ltd, 2012
2. S. V. Satakar, “Intellectual Property Rights and Copy Rights, Ess Ess Publications, New Delhi,
2002

REFERENCES:
1. Deborah E. Bouchoux, “Intellectual Property: The Law of Trademarks, Copyrights, Patents and Trade Secrets
Cengage Learning, Third Edition, 2012.
2. Prabuddha Ganguli,”Intellectual Property Rights: Unleashing the Knowledge Economy”, McGraw Hil
Education, 2011.
3. Edited by Derek Bosworth and Elizabeth Webster, The Management of Intellectual Property, Edward Elgar
Publishing Ltd., 2013.
CS8091
BIG DATA ANALYTICS OBJECTIVES:
 To know the fundamental concepts of big data and analytics.
 To explore tools and practices for working with big data
 To learn about stream computing.
 To know about the research that requires the integration of large amounts of data.

L T
3 0
UNIT I INTRODUCTION TO BIG DATA 9
Evolution of Big data - Best Practices for Big data Analytics - Big data characteristics - Validating
- The Promotion of the Value of Big Data - Big Data Use Cases- Characteristics of Big Data Applicatio
Perception and Quantification of Value -Understanding Big Data Storage - A General Overview of High
Performance Architecture - HDFS - MapReduce and YARN - Map Reduce Programming Model

UNIT II CLUSTERING AND CLASSIFICATION 9

Advanced Analytical Theory and Methods: Overview of Clustering - K-means - Use Cases - Overview o
Method - Determining the Number of Clusters - Diagnostics - Reasons to Choose and Cautions .-
Classification: Decision Trees - Overview of a Decision Tree - The General Algorithm - Decision Tree
Algorithms - Evaluating a Decision Tree - Decision Trees in R - Naïve Bayes - Bayes’ Theorem - Naïve Baye
Classifier.
UNIT III ASSOCIATION AND RECOMMENDATION SYSTEM 9
Advanced Analytical Theory and Methods: Association Rules - Overview - Apriori Algorithm - Evaluation of
Candidate Rules - Applications of Association Rules - Finding Association& finding similarity - Recommendation
System: Collaborative Recommendation- Content Based Recommendation - Knowledge Based Recommend
Hybrid Recommendation Approaches.
UNIT IV STREAM MEMORY 9
Introduction to Streams Concepts – Stream Data Model and Architecture - Stream Computing, Sampling Data in a
Stream – Filtering Streams – Counting Distinct Elements in a Stream – Estimating moments – Counting onen
a Window – Decaying Window – Real time Analytics Platform(RTAP) applications - Case Studies - Real Time
Sentiment Analysis, Stock Market Predictions. Using Graph Analytics for Big Data: Graph Analytics
UNIT V NOSQL DATA MANAGEMENT FOR BIG DATA AND VISUALIZATION 9
NoSQL Databases : Schema-less Models”: Increasing Flexibility for Data Manipulation-Key Value Stores- Documen
Stores - Tabular Stores - Object Data Stores - Graph Databases Hive - Sharding –- Hbase – Analyzing big d
with twitter - Big data for E-Commerce Big data for blogs
- Review of Basic Data Analytic Methods using R.

TOTAL: 45 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to:
 Work with big data tools and its analysis techniques
 Analyze data by utilizing clustering and classification algorithms
 Learn and apply different mining algorithms and recommendation systems for large volumes of data
 Perform analytics on data streams
 Learn NoSQL databases and management.
TEXT BOOKS:
1. Anand Rajaraman and Jeffrey David Ullman, "Mining of Massive Datasets", Cambridge University Press, 2012
2. David Loshin, "Big Data Analytics: From Strategic Planning to Enterprise Integration with Tools, Techniques, N
and Graph", Morgan Kaufmann/El sevier Publishers, 2013.
REFERENCES:
1. EMC Education Services, "Data Science and Big Data Analytics: Discovering, Analyzing, Visualizing and Pres
Data", Wiley publishers, 2015.
2. Bart Baesens, "Analytics in a Big Data World: The Essential Guide to Data Science and its Applications", Wiley
Publishers, 2015.
3. Dietmar Jannach and Markus Zanker, "Recommender Systems: An Introduction", Cambridge Univer
Press, 2010.
4. Kim H. Pries and Robert Dunnigan, "Big Data Analytics: A Practical Guide for Managers " CRC Press, 2015.
5. Jimmy Lin and Chris Dyer, "Data-Intensive Text Processing with MapReduce", Synthesis
Lectures on Human Language Technologies, Vol. 3, No. 1, Pages 1-177, Morgan Claypool publishers, 2010.
 CS8082 MACHINE LEARNING TECHNIQUES L
3
OBJECTIVES:
 To understand the need for machine learning for various problem solving
 To study the various supervised, semi-supervised and unsupervised learning algorithms in machine learning
 To understand the latest trends in machine learning
 To design appropriate machine learning algorithms for problem solving
UNIT I INTRODUCTION 9
Learning Problems – Perspectives and Issues – Concept Learning – Version Spaces and Candidate Eliminat
Inductive bias – Decision Tree learning – Representation – Algorithm – Heuristic Space Search.
UNIT II NEURAL NETWORKS AND GENETIC ALGORITHMS 9
Neural Network Representation – Problems – Perceptrons – Multilayer Networks and Back Propagation Algo
– Advanced Topics – Genetic Algorithms – Hypothesis Space Search – Genetic Programming – Models of Evaluatio
Learning.
UNIT III BAYESIAN AND COMPUTATIONAL LEARNING 9
Bayes Theorem – Concept Learning – Maximum Likelihood – Minimum Description Length Principle – Bayes
Optimal Classifier – Gibbs Algorithm – Naïve Bayes Classifier – Bayesian Belief Network – EM Algorithm –
Probability Learning – Sample Complexity – Finite and Infinite Hypothesis Spaces – Mistake Bound Model.
UNIT IV INSTANT BASED LEARNING 9
K- Nearest Neighbour Learning – Locally weighted Regression – Radial Basis Functions – Case
Learning.
UNIT V ADVANCED LEARNING 9
Learning Sets of Rules – Sequential Covering Algorithm – Learning Rule Set – First Order Rules – Sets of F
Order Rules – Induction on Inverted Deduction – Inverting Resolution – Analytical Learning – Perfect Domain
Theories – Explanation Base Learning – FOCL Algorithm – Reinforcement Learning – Task – Q-Learning –
Temporal Difference Learning

TOTAL :45 PERIODS

OUTCOMES:
At the end of the course, the students will be able to
 Differentiate between supervised, unsupervised, semi-supervised machine learning approaches
 Discuss the decision tree algorithm and indentity and overcome the problem of overfitting
 Discuss and apply the back propagation algorithm and genetic algorithms to various problems
 Apply the Bayesian concepts to machine learning
 Analyse and suggest appropriate machine learning approaches for various types of problems
TEXT BOOK:
1. Tom M. Mitchell, “Machine Learning”, McGraw-Hill Education ( India) Private Limited, 2013 .
REFERENCES:
1. Ethem Alpaydin, “Introduction to Machine Learning (Adaptive Computation and Machine Learning)”, The M
Press 2004.
2. Stephen Marsland, “Machine Learning: An Algorithmic Perspective”, CRC Press, 2009.

CS8092 COMPUTER GRAPHICS AND MULTIMEDIA L

3

OBJECTIVES:
 To develop an understanding and awareness how issues such as content, information architecture, m
design, and technology merge to form effective and compelling interactive experiences for a wide range o
users.
 To become familiar with various software programs used in the creation and implementation of multi-
 To appreciate the importance of technical ability and creativity within design practice.
 To gain knowledge about graphics hardware devices and software used.
 To understand the two-dimensional graphics and their transformations.
 To understand the three-dimensional graphics and their transformations.
 To appreciate illumination and color models
 To become familiar with understand clipping techniques
 To become familiar with Blender Graphics
UNIT I ILLUMINATION AND COLOR MODELS 9
Light sources - basic illumination models – halftone patterns and dithering techniques; Properties of light
primaries and chromaticity diagram; Intuitive colour concepts - RGB colour model - YIQ colour mod
model - HSV colour model - HLS colour model; Colour selection. Output primitives – points and lines, line
loading the frame buffer, line function; circle and ellipse generating algorithms; Pixel addressing and obje
area primitives.
UNIT II TWO-DIMENSIONAL GRAPHICS 9
Two dimensional geometric transformations – Matrix representations and homogeneous coordi
transformations; Two dimensional viewing – viewing pipeline, viewing coordinate reference frame;
coordinate transformation, Two dimensional viewing functions; clipping operations – point, line, and poly
algorithms.
UNIT III THREE-DIMENSIONAL GRAPHICS 9
Three dimensional concepts; Three dimensional object representations – Polygon surfaces- Polygo
equations - Polygon meshes; Curved Lines and surfaces, Quadratic surfaces; Blobby objects; Spline
Bezier curves and surfaces -B-Spline curves and surfaces. TRANSFORMATION AND VIEWING: Three
geometric and modeling transformations – Translation, Rotation, Scaling, composite transformations
viewing – viewing pipeline, viewing coordinates, Projections, Clipping; Visible surface detection me
UNIT IV MULTIMEDIA SYSTEM DESIGN & MULTIMEDIA FILE HANDLING 9
Multimedia basics − Multimedia applications − Multimedia system architecture − Evolving tech
multimedia − Defining objects for multimedia systems − Multimedia data interface standards − Multimed
Compression and decompression − Data and file format standards − Multimedia I/O technologies − D
audio − Video image and animation − Full motion video − Storage and retrieval technologies.
UNIT V HYPERMEDIA 9
Multimedia authoring and user interface - Hypermedia messaging -Mobile messaging − Hype
component − Creating hypermedia message − Integrated multimedia message standards − Integra
 viewing – viewing pipeline, viewing coordinates, Projections, Clipping; Visible surface detection me
UNIT IV MULTIMEDIA SYSTEM DESIGN & MULTIMEDIA FILE HANDLING 9
Multimedia basics − Multimedia applications − Multimedia system architecture − Evolving tech
multimedia − Defining objects for multimedia systems − Multimedia data interface standards − Multimed
Compression and decompression − Data and file format standards − Multimedia I/O technologies − D
audio − Video image and animation − Full motion video − Storage and retrieval technologies.
UNIT V HYPERMEDIA 9
Multimedia authoring and user interface - Hypermedia messaging -Mobile messaging − Hype
component − Creating hypermedia message − Integrated multimedia message standards − Integra
management − Distributed multimedia systems.CASE STUDY: BLENDER GRAPHICS Blender Fundam
Basic Shapes – Modelling –
Shading & Textures

TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the students should be able to:
 Design two dimensional graphics.
 Apply two dimensional transformations.
 Design three dimensional graphics.
 Apply three dimensional transformations.
 Apply Illumination and color models.
 Apply clipping techniques to graphics.
 Understood Different types of Multimedia File Format
 Design Basic 3d Scenes using Blender

TEXT BOOKS:
1. Donald Hearn and Pauline Baker M, “Computer Graphics", Prentice Hall, New Delhi, 2007 [ UNIT I – III ]
2. Andleigh, P. K and Kiran Thakrar, “Multimedia Systems and Design”, PHI, 2003. [ UNIT IV,V ]

REFERENCES:
1. Judith Jeffcoate, “Multimedia in practice: Technology and Applications”, PHI, 1998.
2. Foley, Vandam, Feiner and Hughes, “Computer Graphics: Principles and Practice”, 2 nd Edition, Pe
Education, 2003.
3. Jeffrey McConnell, “Computer Graphics: Theory into Practice”, Jones and Bartlett Publishers,2006.
4. Hill F S Jr., "Computer Graphics", Maxwell Macmillan , 1990.

5. Peter Shirley, Michael Ashikhmin, Michael Gleicher, Stephen R Marschner, Erik Reinhard, KelvinSung, and AK Peters, “Fund

IT8075
 SOFTWARE PROJECT MANAGEMENT L
3
OBJECTIVES:
 To understand the Software Project Planning and Evaluation techniques.
 To plan and manage projects at each stage of the software development life cycle (SDLC).
 To learn about the activity planning and risk management principles.
 To manage software projects and control software deliverables.
 To develop skills to manage the various phases involved in project management and people management.
 To deliver successful software projects that support organization’s strategic goals.

UNIT I PROJECT EVALUATION AND PROJECT PLANNING 9

Importance of Software Project Management – Activities - Methodologies – Categorization of Software Pr
– Setting objectives – Management Principles – Management Control – Project portfolio Management – C
benefit evaluation technology – Risk evaluation – Strategic program Management – Stepwise Project Planni

UNIT II PROJECT LIFE CYCLE AND EFFORT ESTIMATION 9

Software process and Process Models – Choice of Process models - Rapid Application development – Agile metho
Dynamic System Development Method – Extreme Programming– Managing interactive processes – Basics
Software estimation – Effort and Cost estimation techniques – COSMIC Full function points - COCOMO II - a
Parametric Productivity Model.
UNIT III ACTIVITY PLANNING AND RISK MANAGEMENT 9
Objectives of Activity planning – Project schedules – Activities – Sequencing and scheduling – Network Pla
models – Formulating Network Model – Forward Pass & Backward Pass techniques – Critical path (CRM) me
Risk identification – Assessment – Risk Planning –Risk Management – – PERT technique – Monte Carlo simul
– Resource Allocation – Creation of critical paths – Cost schedules.
UNIT IV PROJECT MANAGEMENT AND CONTROL 9
Framework for Management and control – Collection of data – Visualizing progress – Cost monitoring – Earned Va
Analysis – Prioritizing Monitoring – Project tracking – Change control – Software Configuration Management
Managing contracts – Contract Management.
UNIT V STAFFING IN SOFTWARE PROJECTS 9
Managing people – Organizational behavior – Best methods of staff selection – Motivation – The Oldham –
Hackman job characteristic model – Stress – Health and Safety – Ethical and Professional concerns – Working in te
Decision making – Organizational structures – Dispersed and Virtual
teams – Communications genres – Communication plans – Leadership.

TOTAL 45 PERIODS
OUTCOMES:
At the end of the course, the students should be able to:
 Understand Project Management principles while developing software.
 Gain extensive knowledge about the basic project management concepts, framework and the process models.
 Obtain adequate knowledge about software process models and software effort estimation techniques.
 Estimate the risks involved in various project activities.
 Define the checkpoints, project reporting structure, project progress and tracking mechanisms using project
management principles.
 Learn staff selection process and the issues related to people management
TEXT BOOK:
1. Bob Hughes, Mike Cotterell and Rajib Mall: Software Project Management – Fifth Edition, Tata McGraw
New Delhi, 2012.
REFERENCES:
1. Robert K. Wysocki “Effective Software Project Management” – Wiley Publication, 2011.
2. Walker Royce: “Software Project Management”- Addison-Wesley, 1998.
3. Gopalaswamy Ramesh, “Managing Global Software Projects” – McGraw Hill Education (India), Fourteen
Reprint 2013.

CS8081 INTERNET OF THINGS L

3
 OBJEC
 To understand Smart Objects and IoT Archite
 To learn about various IOT-related pr
 To build simple IoT Systems using Arduino and Raspb
 To understand data analytics and cloud in the contex
 To develop IoT infrastructure for popular appli
UNIT I FUNDAMENTALS OF IoT
Evolution of Internet of Things - Enabling Technologies – IoT Architectures: oneM2M, IoT World Forum (IoTW
Alternative IoT models – Simplified IoT Architecture and Core IoT Functional Stack -– Fog, Edge and Cloud in
Functional blocks of an IoT ecosystem – Sensors, Actuators, Smart Objects and Connecting Smart O
UNIT II IoT PROTOCOLS
IoT Access Technologies: Physical and MAC layers, topology and Security of IEEE 802.15.4, 802.1
802.15.4e, 1901.2a, 802.11ah and LoRaWAN – Network Layer: IP versions, Constrained Nod
Constrained Networks – Optimizing IP for IoT: From 6LoWPAN to 6Lo, Routing over Low Power and Lossy Ne
– Application Transport Methods: Supervisory Control and Data Acquisition – Application Layer Protocols: CoA

UNIT III DESIGN AND DEVELOPMENT

Design Methodology - Embedded computing logic - Microcontroller, System on Chips - IoT system building bloc
Arduino - Board details, IDE programming - Raspberry Pi - Interfaces and Raspberry Pi with Python Program
UNIT IV DATA ANALYTICS AND SUPPORTING SERVICES
Structured Vs Unstructured Data and Data in Motion Vs Data in Rest – Role of Machine Learning – No SQL Data
– Hadoop Ecosystem – Apache Kafka, Apache Spark – Edge Streaming Analytics and Network Analytics –
Cloud for IoT, Python Web Application Framework – Django – AWS for IoT – System Management with NET

UNIT V CASE STUDIES/INDUSTRIAL APPLICATIONS

Cisco IoT system - IBM Watson IoT platform – Manufacturing - Converged Plantwide Ethernet Model (CP
Power Utility Industry – GridBlocks Reference Model - Smart and Connected Cities: Layered architecture,
Lighting, Smart Parking Architecture and Smart Traffic C
TOTAL : 45 PE

OUTCOMES:
Upon completion of the course, the student should be able to:
 Explain the concept of IoT.
 Analyze various protocols for IoT.
 Design a PoC of an IoT system using Rasperry Pi/Arduino
 Apply data analytics and use cloud offerings related to IoT.
 Analyze applications of IoT in real time scenario
TEXTBOOK:
1. David Hanes, Gonzalo Salgueiro, Patrick Grossetete, Rob Barton and Jerome Henry, “IoT
Fundamentals: Networking Technologies, Protocols and Use Cases for Internet of Things, Cisco Press, 2017
REFERENCES:1. Arshdeep Bahga, Vijay Madisetti, “Internet of Things – A hands-on approach”, Universities Press, 20152. Olivier

IT8074 SERVICE ORIENTED ARCHITECTURE L

3
OBJECTIVES:
 To learn fundamentals of XML
 To provide an overview of Service Oriented Architecture and Web services and their importance
 To learn web services standards and technologies
 To learn service oriented analysis and design for developing SOA based applications
UNIT I XML 9
XML document structure – Well-formed and valid documents – DTD – XML Schema – Parsing XML using DOM,
– XPath - XML Transformation and XSL – Xquery
UNIT II SERVICE ORIENTED ARCHITECTURE (SOA) BASICS 9
Characteristics of SOA, Benefits of SOA , Comparing SOA with Client-Server and Distributed architectures –
Principles of Service Orientation – Service layers
UNIT III WEB SERVICES (WS) AND STANDARDS 8
Web Services Platform – Service descriptions – WSDL – Messaging with SOAP – Service discovery – UDD
Service-Level Interaction Patterns – Orchestration and Choreography
UNIT IV WEB SERVICES EXTENSIONS 8
WS-Addressing - WS-ReliableMessaging - WS-Policy – WS-Coordination – WS -Transactions - WS-Security - Exa
UNIT V SERVICE ORIENTED ANALYSIS AND DESIGN 11
SOA delivery strategies – Service oriented analysis – Service Modelling – Service oriented design – Standards and
composition guidelines -- Service design – Business process design – Case Study
TOTAL : 45 PERIODS
OUTCOMES:
Upon successful completion of this course, the students will be able to:
 Understand XML technologies
 Understand service orientation, benefits of SOA
 Understand web services and WS standards
 Use web services extensions to develop solutions
 Understand and apply service modeling, service oriented analysis and design for application development

TEXTBO
1. Thomas Erl, “ Service Oriented Architecture: Concepts, Technology, and Design”, Pearson Education
2. Sandeep Chatterjee and James Webber, “Developing Enterprise Web Services: An Architect's Guide”, Prentic

REFERE
1. James McGovern, Sameer Tyagi, Michael E Stevens, Sunil Mathew, “Java Web Services Architecture”, E

2. Ron Schmelzer et al. “ XML and Web Services”, Pearson Education

3. Frank P.Coyle, “XML, Web Services and the Data Revolution”, Pearson Education
GE8077 TOTAL QUALITY MANAGEMENT L
3
OBJECTIVE:
 To facilitate the understanding of Quality Management principles and process.
UNIT I INTRODUCTION 9
Introduction - Need for quality - Evolution of quality - Definitions of quality - Dimensions of product and service quali
Basic concepts of TQM - TQM Framework - Contributions of Deming, Juran and Crosby - Barriers to TQM - Cus
focus - Customer orientation, Customer satisfaction, Customer complaints, Customer retention.
UNIT II TQM PRINCIPLES 9
Leadership - Quality Statements, Strategic quality planning, Quality Councils - Employee involvement
Motivation, Empowerment, Team and Teamwork, Recognition and Reward, Performance appraisal - Cont
process improvement - PDCA cycle, 5S, Kaizen - Supplier partnership - Partnering, Supplier selection, Supplier Rati
UNIT III TQM TOOLS AND TECHNIQUES I 9
The seven traditional tools of quality - New management tools - Six sigma: Concepts, Methodology,
applications to manufacturing, service sector including IT - Bench marking - Reason to bench mark, Bench marking
process - FMEA - Stages, Types.
UNIT IV TQM TOOLS AND TECHNIQUES II 9
Quality Circles - Cost of Quality - Quality Function Deployment (QFD) - Taguchi quality loss function - TPM
Concepts, improvement needs - Performance measures.
UNIT V QUALITY MANAGEMENT SYSTEM 9
Introduction—Benefits of ISO Registration—ISO 9000 Series of Standards—Sector-Specific Standards—A
9100, TS16949 and TL 9000-- ISO 9001 Requirements—Implementation— Documentation—Internal Audits—
Registration- ENVIRONMENTAL MANAGEMENT SYSTEM: Introduction—ISO 14000 Series Standards—Con
of ISO 14001—Requirements of ISO
14001—Benefits of EMS.

TOTAL: 45 PERIODS
OUTCOME:
 The student would be able to apply the tools and techniques of quality management to manufacturing a
services processes.
 TEXT B
1. Dale H.Besterfiled, Carol B.Michna,Glen H. Besterfield,Mary B.Sacre,Hemant Urdhwareshe and R
Urdhwareshe, “Total Quality Management”, Pearson Education Asia, Revised Third Edition, Indian Reprin
Impression
REFERE
1. James R. Evans and William M. Lindsay, "The Management and Control of Quality", 8 th Edition, First
Edition, Cengage Learning
2. Janakiraman. B and Gopal .R.K., "Total Quality Management - Text and Cases", Prentice Hall (India) Pvt. Ltd.
3. Suganthi.L and Anand Samuel, "Total Quality Management", Prentice Hall (India) Pvt. Ltd.
4. ISO9001-2015 sta
CS8083 MULTI-CORE ARCHITECTURES AND PROGRAMMING L
3

OBJECTIVES:
 To understand the need for multi-core processors, and their architecture.
 To understand the challenges in parallel and multi-threaded programming.
 To learn about the various parallel programming paradigms,
 To develop multicore programs and design parallel solutions.
UNIT I MULTI-CORE PROCESSORS 9
Single core to Multi-core architectures – SIMD and MIMD systems – Interconnection networks - Symmetric and
Distributed Shared Memory Architectures – Cache coherence - Performance Issues – Parallel program design.
UNIT II PARALLEL PROGRAM CHALLENGES 9
Performance – Scalability – Synchronization and data sharing – Data races – Synchronization primitives
(mutexes, locks, semaphores, barriers) – deadlocks and livelocks – communication between threads (condition
variables, signals, message queues and pipes).
UNIT III SHARED MEMORY PROGRAMMING WITH OpenMP 9
OpenMP Execution Model – Memory Model – OpenMP Directives – Work-sharing Constructs - Library functio
Handling Data and Functional Parallelism – Handling Loops - Performance Considerations.
UNIT IV DISTRIBUTED MEMORY PROGRAMMING WITH MPI 9
MPI program execution – MPI constructs – libraries – MPI send and receive – Point-to-point and Collective commun
– MPI derived datatypes – Performance evaluation
UNIT V PARALLEL PROGRAM DEVELOPMENT 9
Case studies - n-Body solvers – Tree Search – OpenMP and MPI implementations and comparison.
TOTAL: 45 PERIODS
OUTCOMES:
At the end of the course, the students should be able to:

 Describe multicore architectures and identify their characteristics and challenges.

 Identify the issues in programming Parallel Processors.
 Write programs using OpenMP and MPI.
 Design parallel programming solutions to common problems.
 Compare and contrast programming for serial processors and programming for parallel processors.

TEXT BO
1. Peter S. Pacheco, “An Introduction to Parallel Programming”, Morgan-Kauffman/Elsevier
2. Darryl Gove, “Multicore Application Programming for Windows, Linux, and Oracle Solaris”, Pearson, 2011
REFERE
1. Michael J Quinn, “Parallel programming in C with MPI and OpenMP”, Tata McGraw Hil
2. Victor Alessandrini, Shared Memory Application Programming, 1st Edition, Concepts and Strategies in Mu
Application Programming, Morgan Kaufmann
3. Yan Solihin, Fundamentals of Parallel Multicore Architecture, CRC Press
CS8079 HUMAN COMPUTER INTERACTION LTPC3
OBJECTIVES: To learn the foundations of Human Computer Interaction. To become familiar with the design technologies fo

TOTAL :45 PERIODS

OUTCOMES:
Upon completion of the course, the students should be able to:
 Design effective dialog for HCI
 Design effective HCI for individuals and persons with disabilities.
 Assess the importance of user feedback.

 Explain the HCI implications for designing multimedia/ ecommerce/ e-learning Web sites.
 Develop meaningful user interface.
 TEXT BO
1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, “Human Computer Interaction”, 3rd Edition, Pearson Edu
2004 (UNIT I,
2. Brian Fling, “Mobile Design and Development”, First Edition, O’Reilly Media Inc., 2009 (UNI
3. Bill Scott and Theresa Neil, “Designing Web Interfaces”, First Edition, O’Reilly, 2009. (U
CS8073
C# AND .NET PROGRAMMING L

3 0

OBJECTIVES:
 To learn basic programming in C# and the object oriented programming concepts.
 To update and enhance skills in writing Windows applications, ADO.NET and ASP
.NET.
 To study the advanced concepts in data connectivity, WPF, WCF and WWF with C# and .NET 4.5.
 To implement mobile applications using .Net compact framework
 To understand the working of base class libraries, their operations and manipulation of data using XML.
UNIT I C# LANGUAGE BASICS 9
.Net Architecture - Core C# - Variables - Data Types - Flow control - Objects and Types- Classes and
Structs - Inheritance- Generics – Arrays and Tuples - Operators and Casts - Indexers
UNIT II C# ADVANCED FEATURES 9
Delegates - Lambdas - Lambda Expressions - Events - Event Publisher - Event Listener - Strings and
Regular Expressions - Generics - Collections - Memory Management and Pointers - Errors and Exceptions
Reflection
UNIT III BASE CLASS LIBRARIES AND DATA MANIPULATION 9
Diagnostics -Tasks, Threads and Synchronization - .Net Security - Localization - Manipulating XML- SAX
DOM - Manipulating files and the Registry- Transactions - ADO.NET- Peer-to-Peer Networking - PNRP - Bu
P2P Applications - Windows Presentation Foundation (WPF).
UNIT IV WINDOW BASED APPLICATIONS, WCF AND WWF 9
Window based applications - Core ASP.NET- ASP.NET Web forms -Windows Communication
Foundation (WCF)- Introduction to Web Services - .Net Remoting - Windows Service - Windows Workflow
Foundation (WWF) - Activities – Workflows
UNIT V .NET FRAMEWORK AND COMPACT FRAMEWORK 9
Assemblies - Shared assemblies - Custom Hosting with CLR Objects - Appdomains - Core XAML - Bubbling
Tunneling Events- Reading and Writing XAML - .Net Compact Framework - Compact Edition Data Stores –
Errors, Testing and Debugging –
Optimizing performance – Packaging and Deployment – Networking and Mobile Devices
 TOTAL :45 PERIODS
OUTCO
Upon completion of the course, the students will be a
 Write various applications using C# Language in the .NET Fram
 Develop distributed applications using .NET Fram
 Create mobile applications using .NET compact Fram
TEXT BO
1. Christian Nagel, Bill Evjen, Jay Glynn, Karli Watson, Morgan Skinner . ―Profe
C# 2012 and .NET 4.5ǁ, Wiley
2. Harsh Bhasin, ―Programming in C#ǁ, Oxford University Press
REFERE
1. Ian Gariffiths, Mathew Adams, Jesse Liberty, ―Programming C# 4.0ǁ, O
Fourth Edition
2. Andrew Troelsen, Pro C# 5.0 and the .NET 4.5 Framework, Apress publication
3. Andy Wigley, Daniel Moth, Peter Foot, ―Mobile Development Handbookǁ, Mi
Press
CS8088 WIRELESS ADHOC AND SENSOR NETWORKS L
3
OBJECTIVES:
 To learn about the issues and challenges in the design of wireless ad hoc networks.
 To understand the working of MAC and Routing Protocols for ad hoc and sensor networks
 To learn about the Transport Layer protocols and their QoS for ad hoc and sensor networks.
 To understand various security issues in ad hoc and sensor networks and the corresponding solu
UNIT I MAC & ROUTING IN AD HOC NETWORKS 9
Introduction – Issues and challenges in ad hoc networks – MAC Layer Protocols for wireless ad hoc networks –
Contention-Based MAC protocols – MAC Protocols Using Directional Antennas – Multiple-Channel MAC Protoc
Power-Aware MAC Protocols – Routing in Ad hoc Networks – Design Issues – Proactive, Reactive and Hybrid Routi
Protocols
UNIT II TRANSPORT & QOS IN AD HOC NETWORKS 9
TCP‟s challenges and Design Issues in Ad Hoc Networks – Transport protocols for ad hoc networks – Issues and
Challenges in providing QoS – MAC Layer QoS solutions – Network Layer QoS solutions – QoS Model
UNIT III MAC & ROUTING IN WIRELESS SENSOR NETWORKS 9
Introduction – Applications – Challenges – Sensor network architecture – MAC Protocols for wireless sensor netwo
Low duty cycle protocols and wakeup concepts – Contention- Based protocols – Schedule-Based protocols – IE
802.15.4 Zigbee – Topology Control – Routing Protocols
UNIT IV TRANSPORT & QOS IN WIRELESS SENSOR NETWORKS 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

UNIT V SECURITY IN AD HOC AND SENSOR NETWORKS 9

Security Attacks – Key Distribution and Management – Intrusion Detection – Software based Anti-tamper techniqu
Water marking techniques – Defense against routing attacks - Secure Ad hoc routing protocols – Broadcast
authentication WSN protocols – TESLA – Biba – Sensor Network Security Protocols – SPINS

TOTAL :45 PERIODS

OUTCOMES:
Upon completion of the course, the students will be able to:
 Identify different issues in wireless ad hoc and sensor networks .
 To analyze protocols developed for ad hoc and sensor networks .

 To identify and understand security issues in ad hoc and sensor networks.

TEXT BOOKS:
1. C.Siva Ram Murthy and B.S.Manoj, “Ad Hoc Wireless Networks – Architectures and 2 Protocols”, Pear
Education, 2006.

2. Holger Karl, Andreas Willing, “Protocols and Architectures for Wireless Sensor Networks”, John Wiley &
Inc.
REFERE
1. Subir Kumar Sarkar, T G Basavaraju, C Puttamadappa, “Ad Hoc Mobile Wireless Networks”, Auerbach Public

2. Carlos De Morais Cordeiro, Dharma Prakash Agrawal, “Ad Hoc and Sensor Networks: Theory and Applicatio
Edition)”, World Scientific Publishing
3. Waltenegus Dargie, Christian Poellabauer, “Fundamentals of Wireless Sensor Networks Theory and Pra
John Wiley and Sons
4. Xiang-Yang Li , “Wireless Ad Hoc and Sensor Networks: Theory and Applications”, 1227 th edition, Cam
university Press
CS8071 ADVANCED TOPICS ON DATABASES L
3

OBJECTIVES:
 To learn the modeling and design of databases.
 To acquire knowledge on parallel and distributed databases and their applications.
 To study the usage and applications of Object Oriented and Intelligent databases.
 To understand the usage of advanced data models.
 To learn emerging databases such as XML, Cloud and Big Data.
 To acquire inquisitive attitude towards research topics in databases.
UNIT I PARALLEL AND DISTRIBUTED DATABASES 9
Database System Architectures: Centralized and Client-Server Architectures – Server System Architectures –
Parallel Systems- Distributed Systems – Parallel Databases: I/O Parallelism – Inter and Intra Query Parallelism – Int
Intra operation Parallelism – Design of Parallel Systems- Distributed Database Concepts - Distributed Data Storag
Distributed Transactions – Commit Protocols – Concurrency Control – Distributed Query Processing – Case Studie
UNIT II OBJECT AND OBJECT RELATIONAL DATABASES 9
Concepts for Object Databases: Object Identity – Object structure – Type Constructors – Encapsulation of
Operations – Methods – Persistence – Type and Class Hierarchies – Inheritance
– Complex Objects – Object Database Standards, Languages and Design: ODMG Model – ODL –
OQL – Object Relational and Extended – Relational Systems: Object Relational features in SQL/Oracle – Ca
Studies.
UNIT III INTELLIGENT DATABASES 9
Active Databases: Syntax and Semantics (Starburst, Oracle, DB2)- Taxonomy- Applications- Design Principle
Active Rules- Temporal Databases: Overview of Temporal Databases- TSQL2- Deductive Databases: Logic of
Languages – Datalog- Recursive Rules-Syntax and Semantics of Datalog Languages- Implementation of Rules and
Recursion- Recursive Queries in SQL- Spatial Databases- Spatial Data Types- Spatial Relationships- Spatial D
Structures- Spatial Access Methods- Spatial DB Implementation.
UNIT IV ADVANCED DATA MODELS 9
Mobile Databases: Location and Handoff Management - Effect of Mobility on Data Management - Location Depend
Data Distribution - Mobile Transaction Models -Concurrency Control - Transaction Commit Protocols- Multimed
Databases- Information Retrieval- Data Warehousing- Data Mining- Text Mining.
UNIT V EMERGING TECHNOLOGIES 9
XML Databases: XML-Related Technologies-XML Schema- XML Query Languages- Storing XML in Databases-XM
SQL- Native XML Databases- Web Databases- Geographic Information Systems- Biological Data Managemen
Cloud Based Databases: Data Storage Systems on the Cloud- Cloud Storage Architectures-Cloud Data Models-
Query Languages- Introduction to Big Data-Storage-Analysis.

TOTAL: 45 PERIODS
OUTCOMES:
Upon Completion of the course, the students will be able,

 To develop in-depth understanding of relational databases and skills to optimize database performance in
practice.
 To understand and critique on each type of databases.
 To design faster algorithms in solving practical database problems.
 To implement intelligent databases and various data models.
TEXT BOOKS:
1. Ramez Elmasri, Shamkant B. Navathe, “Fundamentals of Database Systems”, Sixth Edition , Pearson, 2011.
2. Thomas Cannolly and Carolyn Begg, “Database Systems, A Practical Approach to Design, Implementation
Management”, Fourth Edition, Pearson Education, 2008.
REFERENCES:
1. Henry F Korth, Abraham Silberschatz, S. Sudharshan, “Database System Concepts”, Sixth Edition, McGraw
2011.
2. C.J.Date, A.Kannan, S.Swamynathan, “An Introduction to Database Systems”, Eighth Edition, Pearson
Education, 2006.
3. Carlo Zaniolo, Stefano Ceri, Christos Faloutsos, Richard T.Snodgrass, V.S.Subrahmanian, Roberto Zicari,
“Advanced Database Systems”, Morgan Kaufmann publishers,2006.
 GE8072 FOUNDATION SKILLS IN INTEGRATED PRODUCT L T P C
DEVELOPMENT 3 0 0 3
OBJECTIVES:
 To understand the global trends and development methodologies of various types of
products and services
 To conceptualize, prototype and develop product management plan for a new product based on the type of the n
product and development methodology integrating the hardware, software, controls, electronics and mechanical
systems
 To understand requirement engineering and know how to collect, analyze and arrive at requirements for new
product development and convert them in to design specification
 To understand system modeling for system, sub-system and their interfaces and arrive at the optimum sy
specification and characteristics
 To develop documentation, test specifications and coordinate with various teams to validate and sustain u
the EoL (End of Life) support activities for engineering customer
UNIT I FUNDAMENTALS OF PRODUCT DEVELOPMENT 9
Global Trends Analysis and Product decision - Social Trends - Technical Trends- Economical Trends -
Environmental Trends - Political/Policy Trends - Introduction to Product Development Methodologies and
Management - Overview of Products and Services - Types of Product Development - Overview of Product
Development methodologies
- Product Life Cycle – Product Development Planning and Management.
UNIT II REQUIREMENTS AND SYSTEM DESIGN 9
Requirement Engineering - Types of Requirements - Requirement Engineering - traceability Matrix and
Analysis - Requirement Management - System Design & Modeling - Introduction to System Modeling - System
Optimization - System Specification - Sub-System Design - Interface Design.
UNIT III DESIGN AND TESTING 9
Conceptualization - Industrial Design and User Interface Design - Introduction to Concept generation Techniques
Challenges in Integration of Engineering Disciplines - Concept Screening & Evaluation - Detailed Design
Component Design and Verification – Mechanical, Electronics and Software Subsystems - High Level
Design/Low Level Design of S/W Program - Types of Prototypes, S/W Testing- Hardware Schematic, Compo
design, Layout and Hardware Testing – Prototyping - Introduction to Rapid Prototyping and Rapid Manufacturing -
System Integration, Testing, Certification and Documentation
UNIT IV SUSTENANCE ENGINEERING AND END-OF-LIFE (EOL) SUPPORT 9
Introduction to Product verification processes and stages - Introduction to Product Validation processes and stages
Product Testing Standards and Certification - Product Documentation
- Sustenance -Maintenance and Repair – Enhancements - Product EoL - Obsolescence Management –
Configuration Management - EoL Disposal
UNIT V BUSINESS DYNAMICS – ENGINEERING SERVICES INDUSTRY 9
The Industry - Engineering Services Industry - Product Development in Industry versus Academia –The IP
Essentials - Introduction to Vertical Specific Product Development processes -Manufacturing/Purchase and
Assembly of Systems - Integration of Mechanical, Embedded and Software Systems – Product Development
Trade-offs - Intellectual Property Rights and Confidentiality – Security and Configuration Management.
Introduction to Product verification processes and stages - Introduction to Product Validation processes and stages
Product Testing Standards and Certification - Product Documentation
- Sustenance -Maintenance and Repair – Enhancements - Product EoL - Obsolescence Management –
Configuration Management - EoL Disposal
UNIT V BUSINESS DYNAMICS – ENGINEERING SERVICES INDUSTRY 9
The Industry - Engineering Services Industry - Product Development in Industry versus Academia –The IP
Essentials - Introduction to Vertical Specific Product Development processes -Manufacturing/Purchase and
Assembly of Systems - Integration of Mechanical, Embedded and Software Systems – Product Development
Trade-offs - Intellectual Property Rights and Confidentiality – Security and Configuration Management.

TOTAL: 45 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to:
 Define, formulate and analyze a problem
 Solve specific problems independently or as part of a team

 Gain knowledge of the Innovation & Product Development process in the Business Context
 Work independently as well as in teams
  Manage a project from start t
TEXTBO
1. Book specially prepared by NASSCOM as per the
2. Karl T Ulrich and Stephen D Eppinger, "Product Design and Development", Tata McGraw Hill, Fifth Edition
3. John W Newstorm and Keith Davis, "Organizational Behavior", Tata McGraw Hill, Eleventh Edition
REFERE
1. Hiriyappa B, “Corporate Strategy – Managing the Business”, Author House
2. Peter F Drucker, “People and Performance”, Butterworth – Heinemann [Elsevier], Oxford
3. Vinod Kumar Garg and Venkita Krishnan N K, “Enterprise Resource Planning – Concepts”, Second E
Prentice Hall
4. Mark S Sanders and Ernest J McCormick, "Human Factors in Engineering and Design", McGraw Hill Edu
Seventh Edition
GE8074 HUMAN RIGHTS L
3

OBJECTIVE :
 To sensitize the Engineering students to various aspects of Human Rights.
UNIT I 9
Human Rights – Meaning, origin and Development. Notion and classification of Rights – Natural, Moral and Legal
Rights. Civil and Political Rights, Economic, Social and Cultural Rights; collective / Solidarity Rights.
UNIT II 9
Evolution of the concept of Human Rights Magana carta – Geneva convention of 1864. Universal Declaration of Hu
Rights, 1948. Theories of Human Rights.
UNIT III 9
Theories and perspectives of UN Laws – UN Agencies to monitor and compliance.
UNIT IV 9
Human Rights in India – Constitutional Provisions / Guarantees.
UNIT V 9
Human Rights of Disadvantaged People – Women, Children, Displaced persons and Disabled persons, includi
Aged and HIV Infected People. Implementation of Human Rights – National and State Human Rights Commissio
Judiciary – Role of NGO’s, Media, Educational
Institutions, Social Movements.
TOTAL: 45 PERIODS
OUTCOME:
 Engineering students will acquire the basic knowledge of human rights.
REFERENCES:
1. Kapoor S.K., “Human Rights under International law and Indian Laws”, Central Law Agency, Allahabad, 2014.
2. Chandra U., “Human Rights”, Allahabad Law Agency, Allahabad, 2014.
3. Upendra Baxi, The Future of Human Rights, Oxford University Press, New Delhi.

GE8071 DISASTER MANAGEMENT L

3
OBJECTIVES:
 To provide students an exposure to disasters, their significance and types.
 To ensure that students begin to understand the relationship between vulnerability,
 disasters, disaster prevention and risk reduction
 To gain a preliminary understanding of approaches of Disaster Risk Reduction (DRR)
 To enhance awareness of institutional processes in the country and
 To develop rudimentary ability to respond to their surroundings with potential
 disaster response in areas where they live, with due sensitivity
UNIT I INTRODUCTION TO DISASTERS 9
Definition: Disaster, Hazard, Vulnerability, Resilience, Risks – Disasters: Types of disasters – Earthquake,
Landslide, Flood, Drought, Fire etc - Classification, Causes, Impacts including social, economic, political, environm
health, psychosocial, etc.- Differential impacts- in terms of caste, class, gender, age, location, disability - Gl
trends in disasters: urban disasters, pandemics, complex emergencies, Climate change- Dos and Don’ts dur
various types of Disasters.
UNIT II APPROACHES TO DISASTER RISK REDUCTION (DRR) 9
Disaster cycle - Phases, Culture of safety, prevention, mitigation and preparedness community based DRR,
Structural- nonstructural measures, Roles and responsibilities of- community, Panchayati Raj
Institutions/Urban Local Bodies (PRIs/ULBs), States, Centre, and other stake-holders- Institutional Processess and
Framework at State and Central Level- State Disaster Management Authority(SDMA) – Early Warning S
– Advisories from Appropriate Agencies.
UNIT III INTER-RELATIONSHIP BETWEEN DISASTERS AND DEVELOPMENT 9
Factors affecting Vulnerabilities, differential impacts, impact of Development projects such as dams, embankm
changes in Land-use etc.- Climate Change Adaptation- IPCC Scenario and Scenarios in the context of India - Rele
of indigenous knowledge, appropriate technology and local resources.
UNIT IV DISASTER RISK MANAGEMENT IN INDIA 9
Hazard and Vulnerability profile of India, Components of Disaster Relief: Water, Food, Sanitation, Shelter, Health,
Waste Management, Institutional arrangements (Mitigation, Response and Preparedness, Disaster Managem
Act and Policy - Other related policies, plans, programmes and legislation – Role of GIS and Information Techn
Components in Preparedness, Risk Assessment, Response and Recovery Phases of Disaster – Disaster Damag
Assessment.
UNIT V DISASTER MANAGEMENT: APPLICATIONS AND CASE STUDIES AND FIELD WORKS
9
Landslide Hazard Zonation: Case Studies, Earthquake Vulnerability Assessment of Buildings and Infrastructure: Cas
Studies, Drought Assessment: Case Studies, Coastal Flooding: Storm Surge Assessment, Floods: Fluvial and Pluvia
Flooding: Case Studies; Forest Fire: Case Studies, Man Made disasters: Case Studies, Space Based Inputs for Disa
Mitigation and Management and field works related to disaster management.
 Components in Preparedness, Risk Assessment, Response and Recovery Phases of Disaster – Disaster Damag
Assessment.
UNIT V DISASTER MANAGEMENT: APPLICATIONS AND CASE STUDIES AND FIELD WORKS
9
Landslide Hazard Zonation: Case Studies, Earthquake Vulnerability Assessment of Buildings and Infrastructure: Cas
Studies, Drought Assessment: Case Studies, Coastal Flooding: Storm Surge Assessment, Floods: Fluvial and Pluvia
Flooding: Case Studies; Forest Fire: Case Studies, Man Made disasters: Case Studies, Space Based Inputs for Disa
Mitigation and Management and field works related to disaster management.

TOTAL: 45 PERIODS
OUTCOMES:
The students will be able to

 Differentiate the types of disasters, causes and their impact on environment and society
 Assess vulnerability and various methods of risk reduction measures as well as mitigation.
 Draw the hazard and vulnerability profile of India, Scenarious in the Indian context, Disaster damage assessme
management.
TEXTBOOKS:
1. Singhal J.P. “Disaster Management”, Laxmi Publications, 2010. ISBN-10: 9380386427 ISBN- 13: 978-938038
2. Tushar Bhattacharya, “Disaster Science and Management”, McGraw Hill India Education Pvt. Ltd., 2012. ISB
1259007367, ISBN-13: 978-1259007361]
3. Gupta Anil K, Sreeja S. Nair. Environmental Knowledge for Disaster Risk Management, NIDM, New Delhi, 20
4. Kapur Anu Vulnerable India: A Geographical Study of Disasters, IIAS and Sage Publishers, New Delhi, 2

REFERENCES
1. Govt. of India: Disaster Management Act , Government of India, New Delhi, 2005
2. Government of India, National Disaster Management Policy,2009.

EC8093
DIGITAL IMAGE PROCESSING

OBJECTIVES:
 To become familiar with digital image fundamentals
 To get exposed to simple image enhancement techniques in Spatial and Frequency domain.
 To learn concepts of degradation function and restoration techniques.
 To study the image segmentation and representation techniques.
 To become familiar with image compression and recognition methods

UNIT I DIGITAL IMAGE FUNDAMENTALS 9

Steps in Digital Image Processing – Components – Elements of Visual Perception – Image Sensing and
Acquisition – Image Sampling and Quantization – Relationships between pixels - Color image fundamental
RGB, HSI models, Two-dimensional mathematical preliminaries, 2D transforms - DFT, DCT.
UNIT II IMAGE ENHANCEMENT 9
Spatial Domain: Gray level transformations – Histogram processing – Basics of Spatial Filtering– Smoothing an
Sharpening Spatial Filtering, Frequency Domain: Introduction to Fourier Transform– Smoothing and
Sharpening frequency domain filters – Ideal, Butterworth and Gaussian filters, Homomorphic filtering, Colo
image enhancement.
UNIT III IMAGE RESTORATION 9
Image Restoration - degradation model, Properties, Noise models – Mean Filters – Order Statistics – Ada
filters – Band reject Filters – Band pass Filters – Notch Filters – Optimum Notch Filtering – Inverse Filtering – Wie
filtering
UNIT IV IMAGE SEGMENTATION 9
Edge detection, Edge linking via Hough transform – Thresholding - Region based segmentation – Region growin
Region splitting and merging – Morphological processing- erosion and dilation, Segmentation by morphological
watersheds – basic concepts – Dam construction – Watershed segmentation algorithm.

UNIT V IMAGE COMPRESSION AND RECOGNITION 9

Need for data compression, Huffman, Run Length Encoding, Shift codes, Arithmetic coding, JPEG standard, MP
Boundary representation, Boundary description, Fourier Descriptor, Regional Descriptors – Topological featu
Texture - Patterns and Pattern classes - Recognition based on matching.

TOTAL 45 PERIODS
 OUTCO
At the end of the course, the students should be a
 Know and understand the basics and fundamentals of digital image processing, such as digitization, sam
quantization, and 2D-trans
 Operate on images using the techniques of smoothing, sharpening and enhanc
 Understand the restoration concepts and filtering tech
 Learn the basics of segmentation, features extraction, compression and recognition methods for color m
TEXT BO
1. Rafael C. Gonzalez, Richard E. Woods, ‘Digital Image Processing’, Pearson, Third Edition
2. Anil K. Jain, ‘Fundamentals of Digital Image Processing’, Pearson
REFERE
1. Kenneth R. Castleman, ‘Digital Image Processing’, Pearson
2. Rafael C. Gonzalez, Richard E. Woods, Steven Eddins, ‘Digital Image Processing using MATLAB’, P
Education, Inc.
3. D,E. Dudgeon and RM. Mersereau, ‘Multidimensional Digital Signal Processing’, Prentice Hall Profe
Technical Reference
4. William K. Pratt, ‘Digital Image Processing’, John Wiley, New York
5. Milan Sonka et al ‘Image processing, analysis and machine vision’, Brookes/Cole, Vikas Publishing Hous
edition
CS8085 SOCIAL NETWORK ANALYSIS L
3
OBJECTIVES:
 To understand the concept of semantic web and related applications.
 To learn knowledge representation using ontology.
 To understand human behaviour in social web and related communities.
 To learn visualization of social networks.
UNIT I INTRODUCTION 9
Introduction to Semantic Web: Limitations of current Web - Development of Semantic Web - Emergence of
Social Web - Social Network analysis: Development of Social Network Analysis
- Key concepts and measures in network analysis - Electronic sources for network analysis: Electronic
discussion networks, Blogs and online communities - Web-based networks - Applications of Social Netw
Analysis.
UNIT II MODELLING, AGGREGATING AND KNOWLEDGE
REPRESENTATION 9
Ontology and their role in the Semantic Web: Ontology-based knowledge Representation - Ontology languag
the Semantic Web: Resource Description Framework - Web Ontology Language - Modelling and aggregatin
social network data: State-of-the-art in network data representation - Ontological representation of social indivi
Ontological representation of social relationships - Aggregating and reasoning with social network data
Advanced representations.
UNIT III EXTRACTION AND MINING COMMUNITIES IN WEB SOCIAL
NETWORKS 9
Extracting evolution of Web Community from a Series of Web Archive - Detecting communities in social networks
Definition of community - Evaluating communities - Methods for community
detection and mining - Applications of community mining algorithms - Tools for detecting

communities social network infrastructures and communities - Decentralized online social netw
Relational characterization of dynamic social network communities.
UNIT IV PREDICTING HUMAN BEHAVIOUR AND PRIVACY ISSUES 9
Understanding and predicting human behaviour for social communities - User data management - Inferen
- Enabling new human experiences - Reality mining - Context - Awareness - Privacy in online soci
online environment - Trust models based on subjective logic - Trust network analysis - Trust transiti
Combining trust and reputation - Trust derivation based on trust comparisons - Attack spectrum and cou
UNIT V VISUALIZATION AND APPLICATIONS OF SOCIAL NETWORKS 9
Graph theory - Centrality - Clustering - Node-Edge Diagrams - Matrix representation - Visualizing online
Visualizing social networks with matrix-based representations - Matrix and
Node-Link Diagrams - Hybrid representations - Applications - Cover networks - Community welfare
networks - Co-Citation networks.
TOTAL: 45 PERIODS
OUTCOMES:
Upon completion of the course, the students should be able to:
 Develop semantic web related applications.
 Represent knowledge using ontology.
 Predict human behaviour in social web and related communities.
 Visualize social networks.

TEXT BOOKS:
1. Peter Mika, “Social Networks and the Semantic Web”, First Edition, Springer 2007.
2. Borko Furht, “Handbook of Social Network Technologies and Applications”, 1 st Edition, Springer, 2010
REFERENCES:
1. Guandong Xu ,Yanchun Zhang and Lin Li, “Web Mining and Social Networking – Techniques and app
Edition, Springer, 2011.
2. Dion Goh and Schubert Foo, “Social information Retrieval Systems: Emerging Technologies and Ap
Searching the Web Effectively”, IGI Global Snippet, 2008.
3. Max Chevalier, Christine Julien and Chantal Soulé-Dupuy, “Collaborative and Social Inform
and Access: Techniques for Improved user Modelling”, IGI Global Snippet, 2009.
4. John G. Breslin, Alexander Passant and Stefan Decker, “The Social Semantic Web”, Springer, 2009.

IT8073 INFORMATION SECURITY L

3
OBJECTIVES:

 To understand the basics of Information Security

 To know the legal, ethical and professional issues in Information Security
 To know the aspects of risk management
 To become aware of various standards in this area
 To know the technological aspects of Information Security

UNIT I INTRODUCTION 9
History, What is Information Security?, Critical Characteristics of Information, NSTISSC Security
of an Information System, Securing the Components, Balancing Security and Access, The SDLC, The
UNIT II SECURITY INVESTIGATION 9
Need for Security, Business Needs, Threats, Attacks, Legal, Ethical and Professional Issues - An Overview of
Computer Security - Access Control Matrix, Policy-Security policies, Confidentiality policies, Integrity policie
and Hybrid policies
UNIT III SECURITY ANALYSIS 9
Risk Management: Identifying and Assessing Risk, Assessing and Controlling Risk - Systems: Access
Control Mechanisms, Information Flow and Confinement Problem
UNIT IV LOGICAL DESIGN 9
Blueprint for Security, Information Security Policy, Standards and Practices, ISO 17799/BS 7799, NIST Models,
VISA International Security Model, Design of Security Architecture, Planning for Continuity
UNIT V PHYSICAL DESIGN 9
Security Technology, IDS, Scanning and Analysis Tools, Cryptography, Access Control Devices, Physical
Security, Security and Personnel

TOTAL 45 PERIODS
OUTCOMES:
At the end of this course, the students should be able to:
 Discuss the basics of information security

 Illustrate the legal, ethical and professional issues in information sec

 Demonstrate the aspects of risk managem
 Become aware of various standards in the Information Security Sy
 Design and implementation of Security Techniq
TEXT BO
1. Michael E Whitman and Herbert J Mattord, “Principles of Information Security”, Vikas Publishing House,
Delhi,
REFEREN
1. Micki Krause, Harold F. Tipton, “ Handbook of Information Security Management”, Vol 1-3 CRCPress LLC, 2
2. Stuart McClure, Joel Scrambray, George Kurtz, “Hacking Exposed”, Tata McGraw- Hill, 2
3. Matt Bishop, “ Computer Security Art and Science”, Pearson/PHI, 2
CS8087
SOFTWARE DEFINED NETWORKS L T

3 0 0
OBJECTIVES:
 To learn the fundamentals of software defined networks.
 To understand the separation of the data plane and the control plane.
 To study about the SDN Programming.
 To study about the various applications of SDN
UNIT I INTRODUCTION 9
History of Software Defined Networking (SDN) – Modern Data Center – Traditional Switch Architecture – Why SDN
Evolution of SDN – How SDN Works – Centralized and Distributed Control and Date Planes
UNIT II OPEN FLOW & SDN CONTROLLERS 9
Open Flow Specification – Drawbacks of Open SDN, SDN via APIs, SDN via Hypervisor-

Based Overlays – SDN via Opening up the Device – SDN Controllers – General Concepts
UNIT III DATA CENTERS 9
Multitenant and Virtualized Multitenant Data Center – SDN Solutions for the Data Center Network – V
VxLAN – NVGRE
UNIT IV SDN PROGRAMMING 9
Programming SDNs: Northbound Application Programming Interface, Current Languages and T
of SDNs – Network Functions Virtualization (NFV) and Software Defined Networks: Concepts, Imp
Applications
UNIT V SDN 9
Juniper SDN Framework – IETF SDN Framework – Open Daylight Controller – Floodlight Controller
Calendaring – Data Center Orchestration

TOTAL :45 PERIODS

OUTCOMES:
Upon completion of the course, the students will be able to:
 Analyze the evolution of software defined networks
 Express the various components of SDN and their uses
 Explain the use of SDN in the current networking scenario
 Design and develop various applications of SDN
TEXT BOOKS:
1. Paul Goransson and Chuck Black, ―Software Defined Networks: A Comprehensive
Approach, First Edition, Morgan Kaufmann, 2014.
2. Thomas D. Nadeau, Ken Gray, ―SDN: Software Defined Networks, O'Reilly Media, 2013.
REFERENCES:
1. Siamak Azodolmolky, ―Software Defined Networking with Open Flow, Packet Publishing, 2013
2. Vivek Tiwari, ―SDN and Open Flow for Beginnersǁ, Amazon Digital Services, Inc.,
2013.
3. Fei Hu, Editor, ―Network Innovation through Open Flow and SDN: Principles and Design, CRC

CS8074 CYBER FORENSICS L

3
OBJECTIVES:
 To learn computer forensics
 To become familiar with forensics tools
 To learn to analyze and validate forensics data

UNIT I INTRODUCTION TO COMPUTER FORENSICS 9

Introduction to Traditional Computer Crime, Traditional problems associated with Computer Crime. In
Identity Theft & Identity Fraud. Types of CF techniques - Incident and incident response methodolog
duplication and investigation. Preparation for IR: Creating response tool kit and IR team. -
Technology and Systems - Understanding Computer Investigation – Data Acquisition.

UNIT II EVIDENCE COLLECTION AND FORENSICS TOOLS 9

Processing Crime and Incident Scenes – Working with Windows and DOS Systems.
Current Computer Forensics Tools: Software/ Hardware Tools.
 UNIT III ANALYSIS AND VALIDATION
Validating Forensics Data – Data Hiding Techniques – Performing Remote Acquisition – Network Forensic
Email Investigations – Cell Phone and Mobile Devices Forens
UNIT IV ETHICAL HACKING
Introduction to Ethical Hacking - Footprinting and Reconnaissance - Scanning Networks - Enumeration - Sys
Hacking - Malware Threats - Snif
UNIT V ETHICAL HACKING IN WEB
Social Engineering - Denial of Service - Session Hijacking - Hacking Web servers - Hacking Web Applications – S
Injection - Hacking Wireless Networks - Hacking Mobile Platfor
TOTAL 45 PERIO
OUTCOM
At the end of the course, the student should be able
 Understand the basics of computer forens
 Apply a number of different computer forensic tools to a given scen
 Analyze and validate forensics d
 Identify the vulnerabilities in a given network infrastruct
 Implement real-world hacking techniques to test system secu
TEXT BOO
1. Bill Nelson, Amelia Phillips, Frank Enfinger, Christopher Steuart, “Computer Forensics
Investigations”, Cengage Learning, India Edition, 20
2. CEH official Certfied Ethical Hacking Review Guide, Wiley India Edition, 20
REFERENC
1. John R.Vacca, “Computer Forensics”, Cengage Learning, 2
2. MarjieT.Britz, “Computer Forensics and Cyber Crime”: An Introduction”, 3 rd Edition, Prentice Hall, 20
3. AnkitFadia “ Ethical Hacking” Second Edition, Macmillan India Ltd, 2
4. Kenneth C.Brancik “Insider Computer Fraud” Auerbach Publications Taylor &amp; Francis Group–20
CS8086 SOFT COMPUTING L T P
3 0 0
OBJECTIVES:
 To learn the basic concepts of Soft Computing
 To become familiar with various techniques like neural networks, genetic algorithms and fuzzy systems.
 To apply soft computing techniques to solve problems.
UNIT I INTRODUCTION TO SOFT COMPUTING 9
Introduction-Artificial Intelligence-Artificial Neural Networks-Fuzzy Systems-Genetic Algorithm and
Evolutionary Programming-Swarm Intelligent Systems-Classification of ANNs-McCulloch and Pitts Neuron Mod
Learning Rules: Hebbian and Delta- Perceptron Network-Adaline Network-Madaline Network.
UNIT II ARTIFICIAL NEURAL NETWORKS 9
Back propagation Neural Networks - Kohonen Neural Network -Learning Vector Quantization -Hamming
Neural Network - Hopfield Neural Network- Bi-directional

Associative Memory -Adaptive Resonance Theory Neural Networks- Support Vector Machines - Spike
Neuron Models.
UNIT III FUZZY SYSTEMS 9
Introduction to Fuzzy Logic, Classical Sets and Fuzzy Sets - Classical Relations and Fuzzy Relations -Membersh
Functions -Defuzzification - Fuzzy Arithmetic and Fuzzy Measures - Fuzzy Rule Base and Approximate Reasonin
Introduction to Fuzzy Decision Making.
UNIT IV GENETIC ALGORITHMS 9
Basic Concepts- Working Principles -Encoding- Fitness Function - Reproduction - Inheritance Operato
Cross Over - Inversion and Deletion -Mutation Operator - Bit-wise Operators -Convergence of Genetic Algorithm.
UNIT V HYBRID SYSTEMS 9
Hybrid Systems -Neural Networks, Fuzzy Logic and Genetic -GA Based Weight Determination - LR
Fuzzy Numbers - Fuzzy Neuron - Fuzzy BP Architecture - Learning in Fuzzy BP- Inference by Fuzzy BP -
ArtMap: A Brief Introduction - Soft Computing Tools - GA in Fuzzy Logic Controller Design - Fuzzy Logic Controll

TOTAL : 45 PERIODS
OUTCOMES:
 Upon completion of this course, the students should be a
Apply suitable soft computing techniques for various applic
 Integrate various soft computing techniques for complex pro
TEXT BO
1. N.P.Padhy, S.P.Simon, "Soft Computing with MATLAB Programming", Oxford University Press
2. S.N.Sivanandam , S.N.Deepa, "Principles of Soft Computing", Wiley India Pvt. Ltd., 2nd Edition
3. S.Rajasekaran, G.A.Vijayalakshmi Pai, "Neural Networks, Fuzzy Logic and Genetic Algorithm, Synthe
Applications ", PHI Learning Pvt. Ltd.
REFERE
1. Jyh-Shing Roger Jang, Chuen-Tsai Sun, Eiji Mizutani, “Neuro-Fuzzy and Soft Computing”, Prentice-Hall o

2. Kwang H.Lee, “First course on Fuzzy Theory and Applications”, Springer

3. George J. Klir and Bo Yuan, “Fuzzy Sets and Fuzzy Logic-Theory and Applications”, Prentice Hall
4. James A. Freeman and David M. Skapura, “Neural Networks Algorithms, Applications, and Progra
Techniques”, Addison Wesley
GE8076 PROFESSIONAL ETHICS IN ENGINEERING

OBJECTIVES:
 To enable the students to create an awareness on Engineering Ethics and Human Values, to instill Moral and So
Values and Loyalty and to appreciate the rights of others.
UNIT I HUMAN VALUES 10
Morals, values and Ethics – Integrity – Work ethic – Service learning – Civic virtue – Respect for others – Living pea
– Caring – Sharing – Honesty – Courage – Valuing time – Cooperation –
Commitment – Empathy – Self confidence – Character – Spirituality – Introduction to Yoga and meditation for
professional excellence and stress management.
UNIT II ENGINEERING ETHICS 9
Senses of ‘Engineering Ethics’ – Variety of moral issues – Types of inquiry – Moral dilemmas – Moral Autonomy –
Kohlberg’s theory – Gilligan’s theory – Consensus and Controversy – Models of professional roles - Theories about
action – Self-interest – Customs and Religion – Uses of Ethical Theories.
UNIT III ENGINEERING AS SOCIAL EXPERIMENTATION 9
Engineering as Experimentation – Engineers as responsible Experimenters – Codes of Ethics – A Balanced Outloo
Law.
UNIT IV SAFETY, RESPONSIBILITIES AND RIGHTS 9
Safety and Risk – Assessment of Safety and Risk – Risk Benefit Analysis and Reducing Risk - Respect for Autho
Collective Bargaining – Confidentiality – Conflicts of Interest – Occupational Crime – Professional Rights
Employee Rights – Intellectual Property Rights (IPR) – Discrimination.
UNIT V GLOBAL ISSUES 8
Multinational Corporations – Environmental Ethics – Computer Ethics – Weapons Development – Engineers as Man
– Consulting Engineers – Engineers as Expert Witnesses and Advisors –
Moral Leadership –Code of Conduct – Corporate Social Responsibility.

TOTAL: 45 PERIODS
OUTCOMES:
 Upon completion of the course, the student should be able to apply ethics in society, discuss the ethical issues related to engineering

CS8080 INFORMATION RETRIEVAL TECHNIQUES L

3
OBJECTIVES:
 To understand the basics of Information Retrieval.
 To understand machine learning techniques for text classification and clustering.
 To understand various search engine system operations.
 To learn different techniques of recommender system.
UNIT I INTRODUCTION 9
Information Retrieval – Early Developments – The IR Problem – The User‘s Task – Information versus Data Retrie
The IR System – The Software Architecture of the IR System – The Retrieval and Ranking Processes - T
Web – The e-Publishing Era – How the web changed Search – Practical Issues on the Web – How Peop
Search – Search Interfaces Today – Visualization in Search Interfaces.
UNIT II MODELING AND RETRIEVAL EVALUATION 9
Basic IR Models - Boolean Model - TF-IDF (Term Frequency/Inverse Document Frequency) Weighting - Vec
Model – Probabilistic Model – Latent Semantic Indexing Model – Neural Network Model – Retrieval Evaluat
Retrieval Metrics – Precision and Recall – Reference Collection – User-based Evaluation – Relevance Feed
and Query Expansion – Explicit Relevance Feedback.
UNIT III TEXT CLASSIFICATION AND CLUSTERING 9
A Characterization of Text Classification – Unsupervised Algorithms: Clustering – Naïve Text Classification
Supervised Algorithms – Decision Tree – k-NN Classifier – SVM Classifier – Feature Selection or Dimensio
Reduction – Evaluation metrics – Accuracy and Error – Organizing the classes – Indexing and Searching –
Inverted Indexes – Sequential Searching – Multi-dimensional Indexing.
UNIT IV WEB RETRIEVAL AND WEB CRAWLING 9
The Web – Search Engine Architectures – Cluster based Architecture – Distributed Architectures – Search Engine
Ranking – Link based Ranking – Simple Ranking Functions – Learning to Rank – Evaluations -- Search Engine Ran
Search Engine User Interaction – Browsing – Applications of a Web Crawler – Taxonomy – Architecture and
Implementation – Scheduling Algorithms – Evaluation.
UNIT V RECOMMENDER SYSTEM 9
Recommender Systems Functions – Data and Knowledge Sources – Recommendation Techniques – B
of Content-based Recommender Systems – High Level Architecture – Advantages and Drawbacks of Con
based Filtering – Collaborative Filtering – Matrix
factorization models – Neighborhood models.

TOTAL: 45 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to:
 Use an open source search engine framework and explore its capabilities
 Apply appropriate method of classification or clustering.
 Design and implement innovative features in a search engine.
 Design and implement a recommender system.
TEXT BOOKS:
1. Ricardo Baeza-Yates and Berthier Ribeiro-Neto, ―Modern Information Retrieval: The Concepts and Technology
Search, Second Edition, ACM Press Books, 2011.
2. Ricci, F, Rokach, L. Shapira, B.Kantor, “Recommender Systems Handbook”, First Edition, 2011.
 REFERE
1. C. Manning, P. Raghavan, and H. Schütze, ―Introduction to Information Retrieval, Cam
University Press
2. Stefan Buettcher, Charles L. A. Clarke and Gordon V. Cormack, ―Information Re
Implementing and Evaluating Search Engines, The MIT Press
CS8078
GREEN COMPUTING L

3 0

OBJECTIVES:
 To learn the fundamentals of Green Computing.
 To analyze the Green computing Grid Framework.
 To understand the issues related with Green compliance.
 To study and develop various case studies.
UNIT I FUNDAMENTALS 9
Green IT Fundamentals: Business, IT, and the Environment – Green computing: carbon foot print, scoop on po
– Green IT Strategies: Drivers, Dimensions, and Goals – Environmentally Responsible Business: Policies,
Practices, and Metrics.
UNIT II GREEN ASSETS AND MODELING 9
Green Assets: Buildings, Data Centers, Networks, and Devices – Green Business Process Management:
Modeling, Optimization, and Collaboration – Green Enterprise Architecture – Environmental Intelligence – Gre
Supply Chains – Green Information Systems: Design and Development Models.
UNIT III GRID FRAMEWORK 9
Virtualization of IT systems – Role of electric utilities, Telecommuting, teleconferencing and teleporting – Material
recycling – Best ways for Green PC – Green Data center – Green Grid framework.
UNIT IV GREEN COMPLIANCE 9
Socio-cultural aspects of Green IT – Green Enterprise Transformation Roadmap – Green Compliance:
Protocols, Standards, and Audits – Emergent Carbon Issues: Technologies and Future.
UNIT V CASE STUDIES 9
The Environmentally Responsible Business Strategies (ERBS) – Case Study Scenarios for Trial Runs – Case
Studies – Applying Green IT Strategies and Applications to a Home, Hospital, Packaging Industry and Tele
Sector.

TOTAL : 45 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to:
 Acquire knowledge to adopt green computing practices to minimize negative impacts on the environment.
 Enhance the skill in energy saving practices in their use of hardware.
 Evaluate technology tools that can reduce paper waste and carbon footprint by the stakeholders.
 Understand the ways to minimize equipment disposal requirements .

TEXT BO
1. Bhuvan Unhelkar, “Green IT Strategies and Applications-Using Environmental Intelligence”, CRC Press, June
2. Woody Leonhard, Katherine Murray, “Green Home computing for dummies”, Augus
REFERE
1. Alin Gales, Michael Schaefer, Mike Ebbers, “Green Data Center: steps for the Journey”, Shroff/IBM rebook
2. John Lamb, “The Greening of IT”, Pearson Education
3. Jason Harris, “Green Computing and Green IT- Best Practices on regulations & industry”, Lulu.com
4. Carl speshocky, “Empowering Green Initiatives with IT”, John Wiley & Sons
5. Wu Chun Feng (editor), “Green computing: Large Scale energy efficiency”, CRC
CS8076 GPU ARCHITECTURE AND PROGRAMMING L
3
OBJECTIVES:
 To understand the basics of GPU architectures
 To write programs for massively parallel processors
 To understand the issues in mapping algorithms for GPUs
 To introduce different GPU programming models
UNIT I GPU ARCHITECTURE 12
Evolution of GPU architectures - Understanding Parallelism with GPU –Typical GPU Architecture - CUDA Hardware
Overview - Threads, Blocks, Grids, Warps, Scheduling - Memory Handling with CUDA: Shared Memory, Global Mem
Constant Memory and Texture Memory.
UNIT II CUDA PROGRAMMING 8
Using CUDA - Multi GPU - Multi GPU Solutions - Optimizing CUDA Applications: Problem Decomposition,
Memory Considerations, Transfers, Thread Usage, Resource Contentions.
UNIT III PROGRAMMING ISSUES 8
Common Problems: CUDA Error Handling, Parallel Programming Issues, Synchronization, Algorithmic Iss
Finding and Avoiding Errors.
UNIT IV OPENCL BASICS 8
OpenCL Standard – Kernels – Host Device Interaction – Execution Environment – Memory Model – Basic
OpenCL Examples.
UNIT V ALGORITHMS ON GPU 9
Parallel Patterns: Convolution, Prefix Sum, Sparse Matrix - Matrix Multiplication - Programming Heterogeneou
Cluster.

TOTAL: 45 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to
 Describe GPU Architecture
 Write programs using CUDA, identify issues and debug them

 Implement efficient algorithms in GPUs for common application kernels, such as matrix multiplication
 Write simple programs using OpenCL
 Identify efficient parallel programming patterns to solve problems
TEXT BOOKS:1. Shane Cook, CUDA Programming: ―A Developer's Guide to Parallel Computing with GPUs(Applications of GPU Comp

CS8084 NATURAL LANGUAGE PROCESSING L

3
OBJECTIVES:
 To learn the fundamentals of natural language processing
 To understand the use of CFG and PCFG in NLP
 To understand the role of semantics of sentences and pragmatics
 To apply the NLP techniques to IR applications
UNIT I INTRODUCTION 9
Origins and challenges of NLP – Language Modeling: Grammar-based LM, Statistical LM - Regular Expressions, Fin
State Automata – English Morphology, Transducers for lexicon and rules, Tokenization, Detecting and Correcting Sp
Errors, Minimum Edit Distance
UNIT II WORD LEVEL ANALYSIS 9
Unsmoothed N-grams, Evaluating N-grams, Smoothing, Interpolation and Backoff – Word Classes, Part-of-Spe
Tagging, Rule-based, Stochastic and Transformation-based tagging, Issues in PoS tagging – Hidden Markov a
Maximum Entropy models.
UNIT III SYNTACTIC ANALYSIS 9
Context-Free Grammars, Grammar rules for English, Treebanks, Normal Forms for grammar – Depende
Grammar – Syntactic Parsing, Ambiguity, Dynamic Programming parsing – Shallow parsing – Probabilistic CFG,
Probabilistic CYK, Probabilistic Lexicalized CFGs - Feature structures, Unification of feature structures.
UNIT IV SEMANTICS AND PRAGMATICS 10
Requirements for representation, First-Order Logic, Description Logics – Syntax-Driven Semantic analysis,
Semantic attachments – Word Senses, Relations between Senses, Thematic Roles, selectional restrictions
Word Sense Disambiguation, WSD using Supervised, Dictionary & Thesaurus, Bootstrapping methods – W
Similarity using Thesaurus and Distributional methods.
UNIT V DISCOURSE ANALYSIS AND LEXICAL RESOURCES 8
Discourse segmentation, Coherence – Reference Phenomena, Anaphora Resolution using Hobbs and Centering
Algorithm – Coreference Resolution – Resources: Porter Stemmer,
Lemmatizer, Penn Treebank, Brill's Tagger, WordNet, PropBank, FrameNet, Brown Corpus, British National Corpus
(BNC).

TOTAL :45 PERIODS

 OUTCO
Upon completion of the course, the students will be a
 To tag a given text with basic Language fe
 To design an innovative application using NLP comp
 To implement a rule based system to tackle morphology/syntax of a lan
 To design a tag set to be used for statistical processing for real-time appli
 To compare and contrast the use of different statistical approaches for different types of NLP applic
TEXT BO
1. Daniel Jurafsky, James H. Martin―Speech and Language Processing: An Introduction to Natural Lan
Processing, Computational Linguistics and Speech, Pearson Publication
2. Steven Bird, Ewan Klein and Edward Loper, ―Natural Language Processi
Pythonǁ, First Edition, O‘Reilly Media
REFERE
1. Breck Baldwin, ―Language Processing with Java and LingPipe Cookbook, Atlantic Publisher
2. Richard M Reese, ―Natural Language Processing with Javaǁ, O‘Reilly Media
3. Nitin Indurkhya and Fred J. Damerau, ―Handbook of Natural Language Processing, Second Edition, Chapm
Hall/CRC Press
4. Tanveer Siddiqui, U.S. Tiwary, “Natural Language Processing and Information Retrieval”, Oxford University

CS8001 PARALLEL ALGORITHMS L T

3 0
OBJECTIVES:
To understand different parallel architectures and models of computation. To introduce the various classes of par
algorithms.
To study parallel algorithms for basic problems.
UNIT I INTRODUCTION 9
Need for Parallel Processing - Data and Temporal Parallelism - Models of Computation - RAM and PRAM M
Shared Memory and Message Passing Models- Processor Organisations - PRAM Algorithm – Analysis o
PRAM Algorithms- Parallel Programming Languages.
UNIT II PRAM ALGORITHMS 9
Parallel Algorithms for Reduction – Prefix Sum – List Ranking –Preorder Tree Traversal – Searching -Sorting -
Merging Two Sorted Lists – Matrix Multiplication - Graph Coloring - Graph Searching.
UNIT III SIMD ALGORITHMS -I 9
2D Mesh SIMD Model - Parallel Algorithms for Reduction - Prefix Computation - Selection - Odd-Even Merge Sor
Matrix Multiplication

UNIT IV SIMD ALGORITHMS -II 9

Hypercube SIMD Model - Parallel Algorithms for Selection- Odd-Even Merge Sort- Bitonic Sort- Matrix Multipli
Shuffle Exchange SIMD Model - Parallel Algorithms for Reduction
-Bitonic Merge Sort - Matrix Multiplication - Minimum Cost Spanning Tree
UNIT V MIMD ALGORITHMS 9
UMA Multiprocessor Model -Parallel Summing on Multiprocessor- Matrix Multiplication on Multiprocessors a
Multicomputer - Parallel Quick Sort - Mapping Data to Processors.
TOTAL : 45 PERIODS
OUTCOMES:
Upon completion of this course, the students should be able to
 Develop parallel algorithms for standard problems and applications.
 Analyse efficiency of different parallel algorithms.

TEXT BOOKS:
1. Michael J. Quinn, "Parallel Computing : Theory & Practice", Tata McGraw Hill Edition, Second edition, 20
2. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, "Fundamentals of Computer Algorithms", Uni
press, Second edition , 2011.
3. V Rajaraman, C Siva Ram Murthy, " Parallel computers- Architecture and Programming ", PHI learning, 2

REFERENCES:
1. Ananth Grame, George Karpis, Vipin Kumar and Anshul Gupta, "Introduction to Parallel Computing", 2nd
Edition, Addison Wesley, 2003.
2. M Sasikumar, Dinesh Shikhare and P Ravi Prakash , " Introduction to Parallel Processing", PHI learning ,
3. S.G.Akl, "The Design and Analysis of Parallel Algorithms", PHI, 1989.
IT8077
SPEECH PROCESSING OBJECTIVES:
 To understand the fundamentals of the speech processing
 Explore the various speech models
 Gather knowledge about the phonetics and pronunciation processing
 Perform wavelet analysis of speech
 To understand the concepts of speech recognition

L
3
UNIT I INTRODUCTION 9
Introduction - knowledge in speech and language processing - ambiguity - models and algorithms
- language - thought - understanding - regular expression and automata - words & transducers – N grams

UNIT II SPEECH MODELLING 9

Word classes and part of speech tagging – hidden markov model – computing likelihood: the forward
algorithm – training hidden markov model – maximum entropy model – transformation- based tagging – evaluatio
error analysis – issues in part of speech tagging – noisy channel model for spelling

UNIT III SPEECH PRONUNCIATION AND SIGNAL PROCESSING 9

Phonetics - speech sounds and phonetic transcription - articulatory phonetics - phonological categories a
pronunciation variation - acoustic phonetics and signals - phonetic resources - articulatory and gestural
phonology
 UNIT IV SPEECH IDENTIFICATION
Speech synthesis - text normalization - phonetic analysis - prosodic analysis – diphone waveform synthesis - unit se
waveform synthesis - eva
UNIT V SPEECH RECOGNITION
Automatic speech recognition - architecture - applying hidden markov model - feature extraction: mfcc vec
computing acoustic likelihoods - search and decoding - embedded training - multipass decoding: n-best lis
lattices- a* (‘stack’) decoding - context-dependent acoustic models: triphones - discriminative training - speech reco
by h
TOTAL : 45 PE
OUTCO
On Successful completion of the course ,Students will be a
 Create new algorithms with speech proc
 Derive new speech
 Perform various language phonetic a
 Create a new speech identification
 Generate a new speech recognition
TEXT B
1. Daniel Jurafsky and James H. Martin, “ Speech and Language Processing: An Introduction to Natural Lan
Processing, Computational Linguistics and Speech Recognition”, Person education
REFERE
1. Kai-Fu Lee, “Automatic Speech Recognition”, The Springer International Series in Engineering and Co
Science
2. Himanshu Chaurasiya, “Soft Computing Implementation of Automatic Speech Recognition”, LAP Lambert Aca
Publishing
3. Claudio Becchetti, Klucio Prina Ricotti, “Speech Recognition: Theory and C++ implementation”,Wiley publi

4. Ikrami Eldirawy , Wesam Ashour, “Visual Speech Recognition”, Wiley publications

GE8073 FUNDAMENTALS OF NANOSCIENCE L
3
OBJECTIVES:
To learn about basis of nanomaterial science, preparation method, types and application
UNIT I INTRODUCTION 8
Nanoscale Science and Technology- Implications for Physics, Chemistry, Biology and Engineering-
Classifications of nanostructured materials- nano particles- quantum dots, nanowires- ultra-thinfilms-multilayered
materials. Length Scales involved and effect on properties: Mechanical, Electronic, Optical, Mag
and Thermal properties. Introduction to properties and motivation for study (qualitative only).
UNIT II GENERAL METHODS OF PREPARATION 9
Bottom-up Synthesis-Top-down Approach: Co-Precipitation, Ultrasonication, Mechanical Milling, Colloidal routes
Self-assembly, Vapour phase deposition, MOCVD, Sputtering, Evaporation, Molecular Beam Epitaxy, Atomic La
Epitaxy, MOMBE.

UNIT III NANOMATERIALS 12

Nanoforms of Carbon - Buckminster fullerene- graphene and carbon nanotube, Single wall carbon Nanotubes (SWC
and Multi wall carbon nanotubes (MWCNT)- methods of synthesis(arc- growth, laser ablation, CVD routes, Pla
CVD), structure-property Relationships applications- Nanometal oxides-ZnO, TiO2,MgO, ZrO2, NiO, nanoalumina,
AgTiO2, Ferrites, Nanoclays- functionalization and applications-Quantum wires, Quantum dots-preparation, pro
and applications.
UNIT IV CHARACTERIZATION TECHNIQUES 9
X-ray diffraction technique, Scanning Electron Microscopy - environmental techniques, Transmission Elec
Microscopy including high-resolution imaging, Surface Analysis techniques- AFM, SPM, STM, SNOM, ESCA, SIMS-
Nanoindentation.
UNIT V APPLICATIONS 7
NanoInfoTech: Information storage- nanocomputer, molecular switch, super chip, nanocrystal, Nanobiotechlogy
nanoprobes in medical diagnostics and biotechnology, Nano medicines, Targetted drug delivery, Bioimagin
Micro Electro Mechanical Systems (MEMS), Nano Electro Mechanical Systems (NEMS)- Nanosensors, nano
crystalline silver for bacterial inhibition, Nanoparticles for sunbarrier products - In Photostat, printing, solar cell,
battery.

TOTAL: 45 PERIODS
OUTCOMES:
 Will familiarize about the science of nanomaterials
 Will demonstrate the preparation of nanomaterials
 Will develop knowledge in characteristic nanomaterial
TEXT BOOKS :
1. A.S. Edelstein and R.C. Cammearata, eds., “Nanomaterials: Synthesis, Properties and Applications”, Institute of
Physics Publishing, Bristol and Philadelphia, 1996.
2. N John Dinardo, “Nanoscale Charecterisation of surfaces & Interfaces”, 2nd edition, Weinheim Cambridge, Wile
VCH, 2000.
REFERENCES:
1. G Timp, “Nanotechnology”, AIP press/Springer, 1999.
2. Akhlesh Lakhtakia,“The Hand Book of Nano Technology, Nanometer Structure, Theory, Modeling and Simula
Prentice-Hall of India (P) Ltd, New Delhi, 2007.
r in industries associated
ave the ability and attitude to

g fundamentals and an

ex engineering problems
ces, and engineering

ms and design system

tion for the public health

d research methods
mation to provide valid

nd modern engineering and

ding of the limitations.
to assess societal,
to the professional

solutions in societal and

ment.
norms of the engineering

or leader in diverse teams,

engineering community and

n documentation, make
 or leader in diverse teams,

engineering community and

n documentation, make

he engineering and
m, to manage projects and in

o engage in independent

of Computer Science and

ntific and business

nd solutions to existing/novel
 Graduates will have
e ability and attitude to
dapt to emerging
chnological changes.

2
 1

of 3 1

or 3 1

eas and 1 3
the following table

12
√

√
√

√
12

√
 √

√

√

11 12

√ √

√ √

√
 √

2017

4
4

3
3

4
 2

25

4
4

24

P C

0 4
0 4

0 3
0 3

0 3

4 2

4 2
4 2

2 1

14 24

P C

0 4

0 3
0 3

0 3

0 3
0 3

4 2

4 2

2 1

10 24

P C

0 4

0 3
0 3

0 3
0 3

0 3

4 2

4 2

4 2
12 25

P C

0 3
0 3
0 3
2 4
0 3
0 3

4 2

4 2

2 1
2 1

14 25

P C

0 3

0 3

0 3
0 3
0 3
0 3

4 2

4 2
8 22

P C
 0 3

0 3

20 10

20 16

TS: 185

P C

0 4
0 4
0 3

0 3

P C

0 4

0 3
0 3
4 2

0 4

0 3

0 4
0 4

0 4

P C

0 3
4 4

4 2

0 3

4 2

0 4

0 3

4 2

P C

0 3
4 2
0 3
0 3

4 2
4 2

0 3
0 3

0 3

0 3
0 3
4 2

4 2

0 3
0 3

0 3
0 3
 4 2

4 2

4 2
0 3
0 3
0 3
2 4
0 3
4 2

4 2

0 3

0 3
4 2

4 2

P C

0 3

0 3
0 3
0 3
0 3

0 3
0 3

P C

0 3
0 3

0 3
0 3

0 3
0 3

0 3

P C

0 3

0 3

0 3
0 3

0 3

0 3

0 3
0 3

P C

0 3
0 3
0 3
0 3
0 3
0 3
0 3

P C

0 3

0 3
0 3
 0 3
0 3
0 3
0 3

P C

2 1

2 1

2 1
2 1
20 10

Percentage

7.60%
16.8%
12.5%
44.5%
8.15%
3.3%
7.65%

L T P C
4 0 0 4
 nology students.
ctures and comprehend

12
Writing- completing
ersations. Speaking-
Questions- asking and
suffixes- articles.- count/

12
e choice questions and /or
s from newspapers including
agraph writing- topic
d vocabulary and
personal kind—greeting –
evelopment- guessing

12
cture- use of reference
er texts and filling up the
routine actions and
vs indirect questions-

12
magazines Writing- letter
ng- listening to dialogues
ut oneself- speaking about
continuous and past

12
eloping an outline-
versations- Speaking –
al verbs- present/ past

TOTAL: 60 PERIODS
ends and express opinions

and Technologists. Orient

,2011.
lleges.

Book& Workbook)

English. Cambridge

: 2013.

L T P C
4 0 0 4

ons of traditional calculus.

delling the engineering
ly deals with topics such
ding of science,

12
les - Maxima and Minima of
12
ge of variables – Jacobians
Maxima and minima of

12
ion by parts, Trigonometric
ntegration of irrational

12
a enclosed by plane curves

12
of parameters –
fferential equations with
lowing skills:

Calculus.
coordinates, in addition to

ns and integration by parts.

r integrals.

on, 2014.
ew Delhi, 2015. [For Units I

tions, New Delhi, 3 rd Edition,

L T P C
3 0 0 3

o various streams of

9
d tensile strength –
xperiment - bending of
bending: theory and

9
plane progressive waves –
derivation – resonant cavity,
n – Fiber optics: principle,
dex, mode) – losses
 9
allic strips - thermal
tivity - Forbe’s and Lee’s
nd parallel) – thermal

9
perimental verification –
cance – Schrödinger’s wave
rigid box – tunnelling

9
crystal systems, Bravais

uctures - crystal
mperfections in plastic

TOTAL :45 PERIODS

cations,
vices and their applications

perties of materials and

and its applications in

ent crystal growth

 TEXT BOOKS:
xford University Press, 2015.
hanpat Rai Publishers, 2012.
engage Learning India, 2012.
REFERENCES:
ples of Physics”. Wiley, 2015.
”. Cengage Learning, 2010.
hysics’. W.H.Freeman, 2007.
L T P C
3 0 0 3

d water treatment

gle and two component

fuel cells.
9
by EDTA – numerical
ment (phosphate, colloidal,
zeolite process –

9
from solutions –
m – contact theory –
n on pollution abatement.
ytic promoters - acid base
.
9
ct of alloying elements-
definition of terms with
cooling curves - two

9
mate) - carbonization -
ure of synthetic petrol
pressed natural gas (CNG) -
on - calorific value - higher

ition temperature - explosive

 on - calorific value - higher

ition temperature - explosive

9
n and fusion - nuclear chain
y conversion - solar
primary battery (dry cell)

er treatment techniques will

plications for further learning.
TEXT BOOKS:
mpany LTD, New Delhi, 2015
ny (P) LTD, New Delhi, 2015
PVT, LTD, New Delhi, 2013.
REFERENCES:
PVT, LTD, New Delhi, 2014.
India PVT, LTD, Delhi, 2015.
University Press, Delhi, 2015.
MMING LTPC
3 003
 9
ation (pseudo code, flow
lgorithms (iteration,
uess an integer number in a

9
nd list; variables,
es and functions, function
ange the values of two

9
ained conditional (if-elif-
eters, local and global

grams: square root, gcd,

9
list parameters; Tuples:
anced list processing - list

9
ents, errors and exceptions,
pdated for Python 3, Shroff/O’Reilly Publishers, 2016 (http://greenteapress.com/wp/think- python/)2. Guido van Rossum and Fred L. Drake Jr, “An Intr

sign of Engineering

1
– BIS conventions and
+12
of ellipse, parabola and
e and circle – Drawing of

n of Three Dimensional
s
+12
nts. Projection of straight
ue lengths and true
faces) inclined to both the

5+12
hen the axis is inclined to

ne of the principal planes

l surfaces of simple and

+12
ds and truncated solids -
ns - Perspective projection
ts.

2009.
(P) Limited, 2008.

ompany Limited, New Delhi,

y Edition, Prentice Hall of

Press,

”, Pearson, 2 nd Edition, 2009.

ureau of Indian Standards:
nd lay out of drawing sheets.
s Documentation – Lettering.
Lines for technical drawings.
oning of Technical Drawings.
awings – Projection Methods.
s on Engineering Graphics:
ring all units of the syllabus.
0 each making a total of 100.
s will be permitted to use
fit solution within A3 size.
te sessions on the same day
LABORATORY LT PC
0 04 2
60 PERIODS

L T P C
0 0 4 2
 in optics, thermal physics,

y parameters through

by viscometery.

ine / thiocyanate method).

nalysis of water quality

 L T P C
4 0 0 4

engineering and technology

group discussions.
ks in their areas of

12
on-gap exercises-
ournals- newsapapers-
ists-recommendations-
rb agreement - compound

12
eaking – describing a
text- paragraphing-
n formal letters/emails and

12
eaking – introduction to
e in speed reading;
equence words-

12
cs of presentations-
ation – cover letter –Résumé
bulary Development-
als.
 12
nd understanding technical
y Development- verbal

of specialisation successfully.
ormal and informal contexts.
and winning job applications.
TEXT BOOKS:
gineering and Technology.
Blackswan, Hyderabad: 2016
bridge University Press: New
Delhi, 2016.
REFERENCES:
nciples and Practice.Oxford
rsity Press: New Delhi,2014.
Blackswan: Hyderabad,2015
iversity Press, Oxford: 2014.
niversity Press, Oxford: 2007
mmunication For Colleges.
engage Learning, USA: 2007
or supplementary reading.
L T P C
4 0 0 4
plex Analysis and Laplace
the field of engineering.
hods of complex analysis
ranches of engineering

12
ties of Eigenvalues and
quadratic form to canonical

12
nal and Solenoidal vector
integral - Green’s, Gauss

12
polar coordinates -

12
rent’s series – Singularities
ntegrals – Use of circular

12
nd unit impulse function –
nd final value theorems –
o solution of linear second
ng of the following topics

efinite matrices and similar

heorems and their

heorems and application to

43 rd Edition, 2014.
10 th Edition, New Delhi,

wall Media (An imprint of

a Publications, New Delhi ,

dia Pvt., Ltd, New Delhi,

Ltd, 4 th Edition, New Delhi,

ill Education Pvt. Ltd, 6th

T P C
0 0 3

tron
d Nano-electronic devices.
 9
ctivity, expression -
ensional box – degenerate
Energy bands in solids –

9
tors – Carrier concentration
pe & P-type
mi level with temperature
ity and diffusion – Hall effect

9
y - Magnetic material
ism – ferrimagnetism –
mperature – Domain Theory-
principle in computer data

9
on emission and scattering
e – solar cell - LED –

9
– Quantum structures –

on transistor – Quantum dot

ctance – Carbon nanotubes:
ces,

cs,

7.

2.

CRC Press, 2014.

P C ENGINEERING
 9
tive, capacitive and
orton theorem, maximum
active and apparent power-

9
ation, application Speed
pes and construction,

9
our, Mercury vapour,
nd working principle.
d for earthing, fuses and

9
Op amps- Amplifiers,
tage regulator IC using LM

9
moving coil and moving
TD, Strain gauge, LVDT,
 TEXT BOOKS:
Engineering, Mc Graw Hill,
2016,Third Edition.
c Engineering, Oxford, 2016.
REFERENCES:
ngineering, Cambridge, 2016
ronics. Chand & Co, 2008.
Engineering, Pearson, 2015
yǁ, Fourth Edition, Elsevier,
2010.
a McGraw-Hill Edition, 2016.
gy”, New Age international
pvt.ltd.,2003.
ERING L T P C
3 0 0 3
 to environmental problems.

envision the surrounding

waste management.
14
pt of an ecosystem –
ow in the ecosystem –
pes, characteristic
esert ecosystem (d) aquatic
y definition: genetic,
ty: consumptive use,
d local levels – India as
poaching of wildlife,
rsity: In-situ and ex-situ
ecosystems – pond, river,

8
il pollution (d) Marine
nt: causes, effects and
– pollution case studies –
d site – Urban / Rural /
 10
ning, dams and their effects
nd water, floods, drought,
tion, environmental effects
ems, changes caused by
ogging, salinity, case
urces, use of alternate
nduced landslides, soil
– Equitable use of
ets – river / forest /

7
gy – water conservation,
eople; its problems and
ssues and possible
cidents and holocaust,
nt production act – Air
act – Wildlife protection
egislation- central and state

6
e – environment and
re – role of information
an important aspect which
pleting the course.

06.
n, Pearson Education, 2004.

07.
D, Hydrabad, 2015.
05.
India

LT P C
3 0 0 3
 9
s – Storage classes -
Expressions - Input/Output
oping statements – Pre-

9
ogram: Computing Mean,
dition, Scaling, Determinant
r and binary search
9
nctions (string functions,
lculator using built-in
arithmetic – Arrays and
Pass by value, Pass by
e using pass by reference
9
m using structures and

9
s file - Example Program:
Program: Transaction

on, Pearson Education,

1
on, Pearson Education,

rst Edition, Oxford University

Press, 2009.
orling Kindersley (India) Pvt.
ducation in South Asia, 2011.
h C",McGraw-Hill Education,
1996.
RY L T P C
0 0 4 2

g practices in Civil,
educers,

ing components.
Production of hexagonal

13

circuit.

16
measurement of AC signal

elding equipments to join

 couplings, unions, elbows,

5 Nos.
ing shield, chipping hammer,
5 Sets.
ylinders, blow pipe and other
2 Nos.
2 Nos.
2 Sets.
2 Sets.
2 Nos
nditioner One each.
ELECTRICAL
wiring 15 Sets
10 Sets
ator, emergency lamp 1 each
1 No.
2 Nos
r 2 Nos
 ELECTRONICS
10 Nos.
circuits 50 Nos.
10 Nos.
10 Nos.
io, low-voltage power supply
LTPC
0 042

on year is a leap. For

division and square of a

lowing conditions.

he average height.
y Mass Index of the

haracters.
ser defined functions.

nd functions.
a telephone directory using

alance using sequential

onstructs, arrays and strings.

ion, pointers, and structures.
ndom access file processing.
L T P C
4 0 0 4
d application of ideas to

are widely used in

12
ers – Rules of inference -

12
– The pigeonhole principle
ations – Generating

12
Matrix representation of

12
phism’s – Normal
d Fields.

12
algebraic systems – Sub

TOTAL: 60 PERIODS

set which relates to input

ngs and fields.

McGraw Hill Pub. Co. Ltd.,

ns to Computer Science",

Edition, Pearson Education

raw Hill Pub. Co. Ltd., New

 L T P C
4 0 0 4

12
ates
and Standard Forms -
R Implementations.

12
tor - Decimal Adder -
troduction to HDL – HDL

2
ed Sequential Circuits -
els of Sequential Circuits.
2
Flow Tables – Race-free

12
Array – Programmable Array
g HDL, VHDL, and

ion, 2017.
GAGE Learning, 2013

PC30 0 3

9
tion ––singly linked lists-
All operations (Insertion,

9
x to
Queue – applications of
 9
ry search tree ADT –

9
-first traversal – Topological

9
t - Shell sort – Radix sort.
dible Hashing.

uctures to problem solutions.

he various sorting algorithms.
TEXT BOOKS:
n, Pearson Education,1997.
xford University Press, 2011
REFERENCES:
Algorithms", Second Edition,
Mcgraw Hill, 2002.
s”, Pearson Education,1983.
d edition, Pearson Education.
”, Second Edition, University
Press, 2008
G LTPC
3 003
 10
e - Polymorphism- OOP in
pilation. Fundamental
s specifiers - static
JavaDoc comments.
9
the
g an interface,

9
ating own exceptions, Stack
ms – Reading and Writing

8
eads, synchronizing
ing – Generic classes –

9
and images - Basics of
rchy - Introduction to Swing
Boxes – Radio Buttons –
ts inheritance and interfaces
exceptions and I/O streams
hreads and generics classes
Java programs using swings
TEXT BOOKS:
McGraw Hill Education, 2011.
Edition, Prentice Hall, 2013.
REFERENCES:
”, 3 rd Edition, Pearson, 2015.
ok”, Dreamtech press, 2011.
Edition, Pearson Education,
2000.
LTPC
3 003

ns, case studies,

along with socio-economic

9
Angle modulation – PM and
 9
, and ADPCM And ADM,

9
M – Comparison, ISI – Pulse

9
Huffman Coding, LZ Coding
odes, Syndrome

9
SS – Synchronisation and

present contemporary world

l communication techniques.
e communication techniques.
rce and Error control coding.
TEXT BOOKS:
ion Systems” 3/e, TMH 2007
munications” John Wiley 2005
REFERENCES:
Oxford University Press, 2007
Communications” TMH 2006
e Pearson Education 2007.
LTPC
0 042
 ion and Traversal algorithms
10. Applications of Graphs
rching and sorting algorithms
any two collision techniques
TOTAL: 60 PERIODS

OUTCOMES:
he students will be able to:
ear data structure operations
s for solving a given problem
perations for a given problem
or data storage and retrieval
ORATORY LTPC
0 042
on handling and file

wing members: Consumer

ection (i.e domestic or

Yen to INR and vice versa),

es, seconds and vice versa)

d, Mobile_no as members.
rom employee class. Add
as HRA, 12% of BP as PF,
alary.
ssary exception handling in
 ng

and an empty method

ch one of the classes
prints the area of the given

ther the file exists, whether

First thread generates a

are of the number and

using a generic function.

ptions.

es, packages and interfaces.

handling and multithreading .
amming and event handling.
Y L T P C
0 0 4 2
L: 60 PERIODS

T P C
0 2 1
aking of academic studies

ge in specific academic

rsonal information - express

asics taking lecture notes -
nted utterances.

ation starters: small talk -

ation and ideas from

mal talk - greet - respond to

- listen for and follow the

up discussion - summarizing
sations - persuade.

ons in academic and

esentations - negotiate
ons both formal and informal
TEXT BOOKS:
iversity Press, Oxford: 2011.
niversity Press, Oxford: 2010
REFERENCES:
sionals. Pearson: New Delhi,
2010.
iversity Press: Oxford, 2014.
iversity Press: Oxford, 2013.
iversity Press: Oxford, 2006.
niversity Press: Oxford, 2014
Y L T P C
4 0 0 4

such as random signals,

variables and to introduce

n.

op probabilistic models
 12
e and continuous random
niform, Exponential and

12
ear regression –
ally distributed random

12
ameter Markov chain –

12
– Little’s formula - Queues

12
kson networks.
ge of standard distributions

n engineering applications.

listic manner

ory", Wiley Student 4 th

an Reprint, 2007.

nd Random Processes",

Delhi, 2016.
ience Applications", 2 nd

y India Pvt. Ltd., Bangalore,

L T P C
3 0 0 3
thmetic unit.

Computer – Operations,
sing.

oating Point Operations

Pipelining – Pipelined

d Vector Architectures -
ors - Introduction to
ng Multiprocessors.

g cache performance –
ucture – Bus operation –
dware/Software

ation and Embedded

Eighth Edition, Pearson

McGraw Hill, 2012.

proachǁ, Morgan Kaufmann /
ublishers, Fifth Edition, 2012.
LTPC
3 003
diagrams.

which will help in physical DB

echniques and recovery

10
– Introduction to relational
nced SQL features –

8
– Functional
ency Preservation –
ndencies and Fifth Normal

9
– Need for Concurrency –
nts – Isolation Levels – SQL

9
ered Indices – B+ tree Index
– Algorithms for SELECT

9
based Databases: Object
Databases: XML
trieval Models, Queries in IR
 TEXT BOOKS:
oncepts”, Sixth Edition, Tata
McGraw Hill, 2011.
Edition, Pearson Education,
2011.
REFERENCES:
Edition, Pearson Education,
2006.
l College Publications, 2015.
ms”, Tata McGraw Hill, 2011.
LTPC30 0 3
 9
ypes – Fundamentals of
sis Framework – Empirical

9
ms - Exhaustive Search -

Sort - Multiplication of

9
ial Coefficient – Floyd’s
Memory functions.
/1 Knapsack problem,

9
Graphs, Stable marriage

9
ueen problem - Hamiltonian
- Assignment problem –
d Problems – Travelling

: 45 PERIODS
ng problems. Analyze the time and space complexity of algorithms. Critically analyze the different algorithm design techniques for a given proble
 7
chy, Cache Memory, Direct
objectives and functions,
re and Operations- System

11
cess Communication; CPU
ime scheduling; Threads-
-section problem,
Critical regions, Monitors;
, Deadlock prevention,

9
ntation, Segmentation with

, OS Examples.

9
ng and Management, swap
ructure, Directory
on- File System Structure,
Performance, Recovery; I/O
mance.

9
emory Management, Input-
droid - Architecture and

OTAL : 45 PERIODS
s”, 9 th Edition, John Wiley

Tata McGraw Hill Edition,

on, 2004.

, 2005.
edia, 2011.

L T P C
3 0 0 3

ng.

9
Process Models –
 9
ents, Software Requirements
tion and analysis,
Analysis, Petri Nets- Data

9
ign - Architectural styles,
analysis, Interface Design

9
basis path testing-control
ting – Validation Testing

PR model-Reengineering

ision COCOMO I & II

sk Management-Risk

OTAL :45 PERIODS

naging a software project. Compare different process models. Concepts of requirements engineering and Analysis Modeling. Apply systemat

ABORATORY LTPC
0 042

abase management systems.

of databases will be required.
and retrieving Tables and

s, Functions and Procedures

TORY LTPC
0 042
d, exit, wait, close, stat,

AL: 60 PERIODS

L T P C
0 0 2 1
eading comprehension-
lan before writing-
Write a descriptive

Writing- State reasons and

Write an opinion paragraph

ading techniques-Writing-
tive-analytical.

ion- project writing-writing

entify

ERIODS
d and evaluate texts critically.
arious professional contexts.
TEXT BOOKS:
niversity Press: Oxford, 2011
niversity Press: Oxford, 2011
REFERENCES:
niversity Press: Oxford, 2006
d Edition. Orient Black swan:
Hyderabad, 2012
skills. Cambridge University
Press: Cambridge, 2004
ited States of America, 2000
ng Well and Knowing Why.
al Publishing: Australia, 2004
L T P C
4 0 0 4
 ve related problems.

basis for further reading and

12
ets - Lagrange's theorem.
m.
12
ls over finite fields.
12
bers – GCD – Euclidean

12
isibility tests - Modular

12
nd Sigma functions.

AL: 60 PERIODS
 solve related problems.
e in modern mathematics and applied

pts, and by proving simple theorems about

provide a firm basis for further reading

cs", Pearson Education, 5 th Edition, New

er Publications, New Delhi, 2002.

Edition, 2006.
ory of Numbers”, John Wiley and Sons ,

ge Publications, Cambridge, 2004.

L T P C
3 0 0 3

9
OSI Model – Physical Layer:
works – Packet Switching.

9
ls – HDLC – PPP - Media Access
1, Bluetooth – Connecting Devices.
9

Forwarding of IP Packets - Network

Multicasting Basics – IPV6 Addressing –
 9
er Datagram Protocol – Transmission

students should be able to:

ctions in computer networks.
he performance of a network.
ws from one node to another.
nd design routing algorithms.
ous functions in the network.
s application layer protocols.
TEXT BOOK:
ng, Fifth Edition TMH, 2013.
REFERENCES
h Edition, Morgan Kaufmann
Publishers Inc., 2012.
n, Pearson Education, 2013.
Edition, Prentice Hall, 2014.
ource Approach, McGraw Hill
Publisher, 2011.
ng the Internet, Sixth Edition,
Pearson Education, 2013.
OLLERS LTPC
3 003
 9
t and assembler directives
ks - Procedures – Macros –

9
– I/O programming –
s – Coprocessor, Closely

9
ion interface – D/A and
Programming and
nterface and Alarm

9
tion set - Addressing modes

9
& Keyboard Interfacing -
orm generation -
 TEXT BOOKS:
88 Family - Architecture,
India, 2007. (UNIT I- III)
crocontroller and Embedded
cation, 2011. (UNIT IV-V)
REFERENCES:
ng and Hardware”,TMH,2012
dition, Tata McGrawHill,2012
LTPC
3 003

9
mata – Deterministic Finite

9
egular – Closure Properties

9
hdown
CFG, Deterministic
 9
ing Machines – Programming
Techniques for TM.
9
ecidable Problems about TM –
Problem, The Class P and NP.
TOTAL :45PERIODS

OUTCOMES:
the students will be able to:
lar expression for any pattern.
ee grammar for any construct.
g machines for any language.
utions using Turing machines.
a problem is decidable or not.
TEXT BOOK:
nguages and Computations”,
on, Pearson Education, 2003.
REFERENCES:
n”, Second Edition, PHI, 2003.
on”, Third Edition, TMH, 2003.
n”, Thomson Brokecole, 1997.
ESIGN LTPC
3 003
 9
tudy – the Next Gen POS

9
ption classes – Associations
gation and Composition -

9
oration diagram – When to
agrams - Activity diagram –

- Component and

9
g – High Cohesion –

al – Strategy – observer –

9
ation on Testing – Develop
 TOTAL: 45 PERIODS
OUTCOMES:
the students will be able to:
are design with UML diagrams
plications using OO concepts.
sed on software requirements
d design using design patterns
methodologies for OO software
TEXT BOOKS:
lysis and Design and Iterative
on, Pearson Education, 2005.
Hill International Edition - 1999
REFERENCES:
Elements of Reusable Object-
ware”, Addison-Wesley, 1995.
Third edition, Addison Wesley,
2003.
LABORATORY LT PC
0 0 4 2
 OUTCOMES:
student should be able to:
int and Arithmetic operations
different I/Os with processor
forms using Microprocessors
Execute Programs in 8051
ween simulator and Emulator
BATCH OF 30 STUDENTS:
HARDWARE:
nos Microcontroller - 30 nos
SOFTWARE:
SM - 30 nos 8086 Assembler
8051 Cross Assembler
BORATORY L T PC
0 0 4 2
sign to code and implement

gram from that.

ng
 60 PERIODS
hind applying specific design
patterns
of the software with the SRS.
RDWARE REQUIREMENTS
Standard PC
FTWARE REQUIREMENTS
1. Windows 7 or higher
supports UML 1.4 and higher
ium, JUnit or Apache JMeter
L T P C
0 0 4 2
 ping and traceroute PDUs

ng NS.

OTAL: 60 PERIODS

L T P C
3 0 0 3
 9
rnet protocols – World wide
vers – HTML5 – Tables –
Audio – Video controls -
ackgrounds – Border Images

9
ts,- Regular Expressions-
cript- JSON introduction –

9
ons- Session Handling-
BASE CONNECTIVITY:
JSP Standard Tag Library

9
ons- Form Validation-
- Document Type Definition-
nsformation, News Feed

9
Services: Introduction-
vices (WSDL)-Consuming
 TOTAL 45 PERIODS
OUTCOMES:
students should be able to:
and Cascading Style Sheets.
lying different event handling
mechanisms.
ams using Servlets and JSP.
epresent data in XML format.
p interactive web applications
TEXT BOOK:
m”, Prentice Hall, 5th Edition,
2011.
REFERENCES:
”, QUE, 2nd Edition,1999.
on, Wiley Publications, 2009.
e”, Pearson Education, 2011.
Prentice Hall of India, 2011.
xford University Press, 2011.
L T P C
3 0 0 3

9
ents– Typical Intelligent
 9
ch Algorithms and
Problems – Constraint
eta Pruning - Stochastic

9
kward Chaining –
s – Events - Mental
lt Information
9
– Argumentation among

9
atural Language Processing
ng – Moving

Third Edition, 2009.

esley Educational

and Bartlett Publishers,

9.
andard”, Fifth Edition,

nal Agents”, Cambridge

 L T P C
3 0 0 3

Mobile Communication
CDMA

tablishment – Frequency
over - Security

ODV , Hybrid routing –

NET – Security.

– WML

Mobile Operating Systems

tructure – Pros & Cons –

TOTAL 45 PERIODS
OUTCOMES:
students should be able to:
telecommunication systems
n Ad hoc network

Pvt.Ltd, New Delhi – 2012

ms",Thomson Asia Pvt Ltd,

bile Computing”, Springer,

ond Edition,TataMcGraw Hill

s://developer.apple.com/7. Windows Phone DevCenter : http://developer.windowsphone.com8. BlackBerry Developer : http://developer.blackberry.

GN L T P C
3 0 2 4
 9
put Buffering – Specification of Tokens –
a – Minimizing DFA.
12
a grammar – Top Down Parsing -
Shift Reduce Parser-LR Parser-LR
Error Handling and Recovery in Syntax

8
s, Intermediate Languages: Syntax
ressions, Type Checking.
8
the Stack, Heap Management - Issues

8
f Basic Blocks- Global Data Flow Analysis

nstants, comments, operators etc.).

duction and Algebraic transformation)

as input and the 8086 assembly language

30 PERIODS
45 PERIODS
75 PERIODS
parsers for a given grammar.
on and run-time environment.
nd a simple code generator.
r using LEX and YACC tools.
TEXT BOOK:
hniques and Toolsǁ, Second
n, Pearson Education, 2009.
REFERENCES
ependence based Approach,
Kaufmann Publishers, 2002.
entationǁ, Morgan Kaufmann
e, India, Indian Reprint 2003.
Compilerǁ, Morgan Kaufmann
hers Elsevier Science, 2004.
aw Hill Education Publishers,
2010.
e-Hall Software Series, 1993.
LT PC
3 00 3
d systems.

in Distributed Systems.

9
n to parallel systems –
mmunication –Synchronous
computations: A distributed
e – Cuts –Past and future
em of logical clocks –Scalar

9
onous execution with
Group communication –
uction –System model and

9
m – Ricart-Agrawala
detection in distributed

el, the AND model and the

9
sues in failure recovery –
algorithm – Algorithm for
em definition – Overview of
res.
9
hord – Content
ages – Memory consistency
state for distributed systems.
rithms in distributed systems
nisms in distributed systems.
ted shared memory systems
TEXT BOOKS:
ms, and systems. Cambridge
University Press, 2011.
ts and Design”, Fifth Edition,
Pearson Education, 2012.
REFERENCES:
Prentice Hall of India, 2007.
ms. McGraw-Hill, Inc., 1994.
adigms”, Pearson Education,
2007.
s”, Pearson Education, 2004.
man Publishers, USA, 2003.
TORY L T P C
0 0 4 2
 JavaScript.

line examination for

has been stored in a

pages using servlets (or

d be stored in web.xml.

ages. Create a database

loaded from the database.
. Write a Program, which
XML document

consumer product.

TOTAL: 60PERIODS
OUTCOMES:
he students will be able to:
HTML/XML and style sheets.

lying different event handling

mechanisms.
s using server side scripting.
to develop web applications.
sing AJAX and web services.
SOFTWARE REQUIRED:
ache Server, WAMP/XAMPP
RATORY L T P C
0 0 4 2
ks for Android and windows

obile applications.
SMS, Multi- threading and GPS.
wn mobile app for simple needs.
REFERENCES:
Lab, Michael Gregg, Wiley India
R A BATCH OF 30 STUDENTS
Mobile Application Development
and debuggers - 30 Nos.
N L T P C
0 0 2 1

as a professional with values—

e topic –
minute presentations

dynamics
skills

e/skype interview -one to one

etworking professionally-
plan-making career changes
 REFERENCES:
gage Learning: New Delhi, 2015
nt Blackswan: Hyderabad, 2015
ntBalckSwan: Hyderabad, 2016.
d University Press: Oxford, 2014
MJP Publishers: Chennai, 2010.
T LT PC
3 0 03

ons and principles of

9
anagers - managerial roles and
proaches – Types of
or enterprises - Organization

9
– setting objectives – policies
ision making steps and

9
zation structure – types –
 HR Planning, Recruitment, selection,
gement
9
motivational techniques – job satisfaction
– process of communication – barrier in

9
hniques – use of computers and IT in

standing of managerial functions like

e on international aspect of management

td., 10 th Edition, 2009.

Education, 6th Edition, 2004.

nagement” Pearson Education, 7th

1998.

L T P C
3 0 0 3

n mechanisms in order to secure computer

 9
Security at Multiple levels, Security
ms – OSI security architecture –
ques, steganography- Foundations of
stem – cryptanalysis.

9
es - Modular arithmetic-Euclid‟s algorithm-
TRIC KEY CIPHERS: SDES – Block
sis - Block cipher design principles – Block

rd - RC4 –

9
Factorization – Euler’s
ntiation and logarithm -
ement – Diffie Hellman
hy.
9
hash function and MAC –
ics, Passwords,

9
M SECURITY: Intruders –
 TOTAL 45 PERIODS
OUTCOMES:
student should be able to:
re, threats and vulnerabilities
etric cryptographic algorithms
ns of public key cryptography
mulate different applications.
d System security standards
TEXT BOOK:
ctice, PHI 3rd Edition, 2006.
REFERENCES:
Security, Wiley India Pvt.Ltd
urity, Tata McGraw Hill 2007.
Communication in a PUBLIC
ce Hall, ISBN 0-13-046019-2
LT PC
3 0 0 3

9
–
y in Cloud – On-demand
 10
blish- Subscribe Model –
– Virtualization Structures
Support and Disaster

8
Public, Private and Hybrid
orage-as-a-Service –

10
ods – Global Exchange of
vice Security – Security

8
ent for Google App Engine
ervices and Applications –
oud computing.

service and delivery models.

for implementation and use

From Parallel Processing

tion, Management and

”, Tata Mcgraw Hill, 2013.

ata Mcgraw Hill, 2009.
the Cloud: Transactional

Y LTPC
0 042
OBJECTIVES:
lop web applications in cloud
ng a cloud based application
programming using Hadoop
OS on top of windows7 or 8.
nd execute Simple Programs
pplications using python/java.
launch the web applications.
t is not present in CloudSim.
e to another virtual machine.
e Openstack Demo Version)
e applications like wordcount.
TOTAL : 60 PERIODS
 OUTCOMES:
he students will be able to:
al Box, VMware workstation.
ation in a PaaS environment.
o implement new schedulers.
n be used as a private cloud.
ets in a parallel environment.
L T P C
0 0 4 2

Attack and Penetration Tools

ulnerability Assessment Tool
11. Defeating Malware
ing Trojans ii) Rootkit Hunter
TOTAL: 60 PERIODS
 OUTCOMES:
he students will be able to:
niques to solve the problems.
ic key encryption algorithms.
or authentication algorithms.
ng Digital signature standard.
stem using open source tools
REFERENCES:
b, Michael Gregg, Wiley India
OFTWARE: C / C++ / Java or
esktops - 30 Nos. (or) Server
porting 30 terminals or more.
L T P C
0 0 20 10

and literature review till

nd to face reviews and viva

der the guidance of a faculty

ction of the supervisor. The
mmittee may be constituted
ester. The project work
rnal

TOTAL: 300 PERIODS

OUTCOME:
up any challenging practical
mulating proper methodology.
ING L T P C
3 0 0 3
L PROCESSING (OLAP)

abase Architectures for

se Schemas for Decision
, OLAP and OLTP.
9
ues – Issues –
ocessing – Cleaning,
arity and dissimilarity

9
aluation Method – Pattern
ng, Classification using

9
by Back Propagation –
es to improve Classification

sity Based Methods - Grid

with constraints, Outlier

9
ase - Introduction to
Elsevier, 2012.

McGraw – Hill Edition, 35 th

Eastern Economy Edition,

TPC300 3
 9
Testing axioms – Basic
t Organization – Origins of
Examples-

9
lue Analysis – Equivalence
– user documentation
e Box Approach to Test

aphs
ng approaches- Evaluating

9
he Test Harness –
n Tests – Integration Test
– Performance testing –
ng OO systems – Usability
documentation – Website

9
– testing services – Test
t management – test
st specialist – Building a

9
gn and architecture for
d measurements – project,
 TEXT BOOKS:
actices”, Pearson Education,
2006.
cation, 2007. AU Library.com
REFERENCES:
er International Edition, 2003.
s”, Pearson Education, 1995.
d Reinhold, New York, 1990.
chniques”, Dorling Kindersley
d., Pearson Education, 2008.
LTPC300 3
 OBJECTIVES:
gramming of ARM processor.
platform design and analysis.
edge in interfacing concepts
em and to develop programs
ARM PROCESSORS 9
ample: Model train controller-
ervisor mode, exceptions
ce- CPU power consumption.
9
ms – consumer electronics
grams- Models of programs-
s – Software performance
optimization of program size-
ogram validation and testing.
9
uators- Arduino code - library
truction of basic applications
9
atchdog Timer - Embedded
nd Development Languages.
9
Adding Structure to the code-
elay- Timeout mechanisms-
s-Testing a hardware timeout
TOTAL : 45 PERIODS
ming of ARM processor. Explain the concepts of embedded systems Understand the Concepts of peripherals and interfacing of sensors. Cap
 ware development practices

APIs.
s.

9
odel
– Agile Team
entations – Agile Drivers,

9
are Development - Extreme

9
nal Knowledge Evolution
KM in Software

rd Maturity Model (SMM).

9
Agile – Managing Unstable
ments Management in
Generation – Concurrency in

9
and Production Metrics in
lobal Software
 TOTAL: 45 PERIODS
OUTCOMES:
he students will be able to:
e requirements for a software
system
them, how to execute them.
tware development success.
boration and software quality.
task for development teams.
ed up to the enterprise level.
TEXT BOOKS:
ering: Applying the Theory of
Results”, Prentice Hall, 2003.
Computer Science”, Springer,
2009.
REFERENCES:
uide”, Addison-Wesley, 2004.
d Management”, Butterworth-
Heinemann, 2007.
NS L T P C
3 0 0 3

9
Graph - Isomorphism -

9
on- Labeled Tree -
Fundamental Circuit
9
Combinatorial Dual -

9
- Path Matrix- Properties
c Partitioning - Matching -

9
al Circuits- Cut Vertices-

er Science", Prentice-Hall of

ication,2008.

shing Company, 1991.

L T P C
3 0 0 3
g filter theory and analog-to-

9
ntation, Operation and
Convolution: Linear and

9
of LTI Discrete Time

9
alog low pass filter–Analog
sign of digital IIR filters

9
ausal and Non-causal FIR
w, Hanning window) –

9
essing of Audio and Radar
 o get discrete time signal

given analog specifications.

ms & Applications”, Fourth

Education.
ndian Reprint, Pearson,

earson Education / Prentice

S L T P C
3 0 0 3

9
yrights, Geographical
WIPO –TRIPS, Nature of
ions – Important examples

10
ical Indications, Trade

10
nt Act of India, Patent

9
nd Digital Content
nd IP Laws – Case Studies.

7
w Delhi,

nts and Trade Secrets”,

conomy”, McGraw Hill

perty, Edward Elgar

L T P C
3 0 0 3
9
lidating
of Big Data Applications -
al Overview of High-
ming Model

9
Cases - Overview of the
and Cautions .-
m - Decision Tree
heorem - Naïve Bayes
 9
thm - Evaluation of
- Recommendation
ge Based Recommendation-

9
Sampling Data in a
ments – Counting oneness in
Studies - Real Time
nalytics
9
lue Stores- Document
ase – Analyzing big data

es of data

University Press, 2012.

Tools, Techniques, NoSQL,

, Visualizing and Presenting

ts Applications", Wiley

on", Cambridge University

" CRC Press, 2015.

hesis
blishers, 2010.
 LTPC
3 003

machine learning

9
nd Candidate Eliminations –
h.
9
ack Propagation Algorithms
– Models of Evaluation and

9
gth Principle – Bayes
k – EM Algorithm –
ound Model.
9
sis Functions – Case Based

9
rder Rules – Sets of First
– Perfect Domain
ask – Q-Learning –
 proaches
rfitting
ems

ms

mited, 2013 .

ine Learning)”, The MIT

T P C
0 0 3

mation architecture, motion, sound,

ces for a wide range of audiences and end

plementation of multi- media

ctice.

9
es; Properties of light - Standard
odel - YIQ colour model - CMY colour
– points and lines, line drawing algorithms,
l addressing and object geometry, filled

9
homogeneous coordinates, composite
e reference frame; window-to-viewport
s – point, line, and polygon clipping

9
gon surfaces- Polygon tables- Plane
Blobby objects; Spline representations –
AND VIEWING: Three dimensional
osite transformations; Three dimensional
surface detection methods.
G 9
ure − Evolving technologies for
tandards − Multimedia databases.
a I/O technologies − Digital voice and
hnologies.
9
le messaging − Hypermedia message
ge standards − Integrated document
 surface detection methods.
G 9
ure − Evolving technologies for
tandards − Multimedia databases.
a I/O technologies − Digital voice and
hnologies.
9
le messaging − Hypermedia message
ge standards − Integrated document
HICS Blender Fundamentals – Drawing

PERIODS

007 [ UNIT I – III ]

T IV,V ]

actice”, 2 nd Edition, Pearson

blishers,2006.

ung, and AK Peters, “Fundamentals of Computer Graphics”, CRC Press, 2010.6. William M. Newman and Robert F.Sproull, “Principles of Interactive
 L T P C
3 0 0 3

LC).

eople management.

9
zation of Software Projects
io Management – Cost-
epwise Project Planning.

9
pment – Agile methods –
processes – Basics of
nts - COCOMO II - a

9
duling – Network Planning
ritical path (CRM) method –
– Monte Carlo simulation

9
nitoring – Earned Value
uration Management –

9
tion – The Oldham –
ncerns – Working in teams –
the process models.
mation techniques.

sms using project

Edition, Tata McGraw Hill,

ation (India), Fourteenth

LTPC
3 0 03
 OBJECTIVES:
Objects and IoT Architectures
various IOT-related protocols
g Arduino and Raspberry Pi.
nd cloud in the context of IoT
cture for popular applications
9
T World Forum (IoTWF) and
Edge and Cloud in IoT –
d Connecting Smart Objects
9
IEEE 802.15.4, 802.15.4g,
ons, Constrained Nodes and
ower and Lossy Networks
n Layer Protocols: CoAP and
MQTT
9
T system building blocks -
Pi with Python Programming.
9
rning – No SQL Databases
Network Analytics – Xively
anagement with NETCONF-
YANG
9
e Ethernet Model (CPwE) –
Layered architecture, Smart
ure and Smart Traffic Control
TOTAL : 45 PERIODS

, “IoT
gs, Cisco Press, 2017
ities Press, 20152. Olivier Hersent, David Boswarthick, Omar Elloumi , “The Internet of Things – Key applications and Protocols”, Wiley, 2012 (for Unit

E LTPC
3 003

tance

9
sing XML using DOM, SAX

9
ributed architectures –--

8
vice discovery – UDDI –

8
s - WS-Security - Examples
11
sign – Standards and
on development

TEXTBOOKS:
n”, Pearson Education, 2005
hitect's Guide”, Prentice Hall,
2004
REFERENCES:
vices Architecture”, Elsevier,
2003.
s”, Pearson Education, 2002.
n”, Pearson Education, 2002
L T P C
3 0 0 3
 9
duct and service quality -
arriers to TQM - Customer
ion.
9
mployee involvement -
nce appraisal - Continuous
election, Supplier Rating.
9
oncepts, Methodology,
mark, Bench marking

9
y loss function - TPM -

9
pecific Standards—AS
n—Internal Audits—
ries Standards—Concepts

nt to manufacturing and
 TEXT BOOK:
Urdhwareshe and Rashmi
Edition, Indian Reprint, Sixth
Impression, 2013.
REFERENCES:
ality", 8 th Edition, First Indian
on, Cengage Learning, 2012.
e Hall (India) Pvt. Ltd., 2006.
Hall (India) Pvt. Ltd., 2006.
4. ISO9001-2015 standards
RAMMING LTPC
3 003

9
- Symmetric and
rallel program design.
9
nization primitives
een threads (condition

9
ructs - Library functions –
ns.
9
nd Collective communication

9
d comparison.
cessors.

TEXT BOOKS:
an-Kauffman/Elsevier, 2011.
laris”, Pearson, 2011 (unit 2)
REFERENCES:
MP”, Tata McGraw Hill,2003.
s and Strategies in Multicore
ng, Morgan Kaufmann, 2015.
chitecture, CRC Press, 2015.
LTPC30 03
 design technologies for individuals and persons with disabilities. To be aware of mobile HCI. To learn the guidelines for user interface.UN

s.
 TEXT BOOKS:
Edition, Pearson Education,
2004 (UNIT I, II & III)
Media Inc., 2009 (UNIT – IV)
ion, O’Reilly, 2009. (UNIT-V)
ING L T P C

3 0 0 3

nd .NET 4.5.

f data using XML.

d Types- Classes and

stener - Strings and

Errors and Exceptions -

anipulating XML- SAX and

orking - PNRP - Building

Communication
e - Windows Workflow

e XAML - Bubbling and

Edition Data Stores –

vices
 OUTCOMES:
he students will be able to:
uage in the .NET Framework.
ions using .NET Framework.
g .NET compact Framework.
TEXT BOOKS:
gan Skinner . ―Professional
2 and .NET 4.5ǁ, Wiley, 2012
xford University Press, 2014.
REFERENCES
ramming C# 4.0ǁ, O‘Reilly,
Fourth Edition, 2010.
k, Apress publication, 2012.
pment Handbookǁ, Microsoft
Press, 2011.
WORKS LTPC
3 003
r networks.
he corresponding solutions.

d hoc networks –
-Channel MAC Protocols –
ctive and Hybrid Routing

9
etworks – Issues and
oS Model
9
ireless sensor networks –
e-Based protocols – IEEE

Sensor Networks –

9
Anti-tamper techniques –
otocols – Broadcast
S
d 2 Protocols”, Pearson

etworks”, John Wiley & Sons,

Inc., 2005.
REFERENCES
orks”, Auerbach Publications,
2008.
Theory and Applications (2 nd
d Scientific Publishing, 2011.
tworks Theory and Practice”,
John Wiley and Sons, 2010
, 1227 th edition, Cambridge
university Press,2008.
ES LTPC
3 003

9
ystem Architectures –
Query Parallelism – Inter and
stributed Data Storage –
cessing – Case Studies
9
– Encapsulation of

DL –
s in SQL/Oracle – Case

9
ons- Design Principles for
Databases: Logic of Query
entation of Rules and
lationships- Spatial Data

9
nt - Location Dependent
it Protocols- Multimedia

9
ML in Databases-XML and
cal Data Management-
-Cloud Data Models-

tabase performance in

n , Pearson, 2011.
esign, Implementation and

Sixth Edition, McGraw Hill,

ghth Edition, Pearson

anian, Roberto Zicari,

 T P C
0 0 3

ed on the type of the new

s and mechanical

quirements for new

ive at the optimum system

alidate and sustain up to

conomical Trends -
Methodologies and
view of Product

traceability Matrix and

Modeling - System

9
generation Techniques –
- Detailed Design -
ems - High Level
e Schematic, Component
Rapid Manufacturing -

rocesses and stages -

ce Management –

9
s Academia –The IPD
uring/Purchase and
Product Development
agement.
rocesses and stages -

ce Management –

9
s Academia –The IPD
uring/Purchase and
Product Development
agement.

text
e a project from start to finish
TEXTBOOKS:
NASSCOM as per the MoU.
Graw Hill, Fifth Edition, 2011.
w Hill, Eleventh Edition, 2005.
REFERENCES:
siness”, Author House, 2013.
ann [Elsevier], Oxford, 2004.
– Concepts”, Second Edition,
Prentice Hall, 2003.
ign", McGraw Hill Education,
Seventh Edition, 2013
LT P C
3 0 0 3

9
ural, Moral and Legal
darity Rights.
9
rsal Declaration of Human

9
abled persons, including
an Rights Commission –
y, Allahabad, 2014.

LTPC
3 003

9
ers – Earthquake,
ic, political, environmental,
cation, disability - Global
Dos and Don’ts during

9
mmunity based DRR,
ati Raj
onal Processess and
MA) – Early Warning System

9
ch as dams, embankments,
ontext of India - Relevance

9
on, Shelter, Health,
ess, Disaster Management
nd Information Technology
ter – Disaster Damage

LD WORKS

and Infrastructure: Case

ods: Fluvial and Pluvial
Based Inputs for Disaster
ter – Disaster Damage

LD WORKS

and Infrastructure: Case

ods: Fluvial and Pluvial
Based Inputs for Disaster

er damage assessment and

ISBN- 13: 978-9380386423

n Pvt. Ltd., 2012. ISBN-10:

, NIDM, New Delhi, 2011

ublishers, New Delhi, 2010.

L T P C
3 0 0 3

main.

9
– Image Sensing and
or image fundamentals -
T.
 9
ering– Smoothing and
m– Smoothing and
omorphic filtering, Color

9
Order Statistics – Adaptive
Inverse Filtering – Wiener

9
ation – Region growing –
on by morphological

9
, JPEG standard, MPEG.
rs – Topological feature,

L 45 PERIODS
 OUTCOMES:
students should be able to:
uch as digitization, sampling,
ntization, and 2D-transforms.
harpening and enhancement.
epts and filtering techniques.
on methods for color models.
TEXT BOOKS:
Pearson, Third Edition, 2010.
Processing’, Pearson, 2002.
REFERENCES:
Processing’, Pearson, 2006.
ng using MATLAB’, Pearson
Education, Inc., 2011.
g’, Prentice Hall Professional
Technical Reference, 1990.
John Wiley, New York, 2002
Vikas Publishing House, 2nd
edition, 1999
LT P C
3 0 0 3
 9
Web - Emergence of the

alysis: Electronic
cations of Social Network

n - Ontology languages for

elling and aggregating
ntation of social individuals -
social network data -

s in social networks -

ing

ed online social networks - Multi-

9
management - Inference and Distribution
Privacy in online social networks - Trust in
alysis - Trust transitivity analysis -
ack spectrum and countermeasures.
9
n - Visualizing online social networks,

- Community welfare - Collaboration

 07.
Edition, Springer, 2010.

– Techniques and applications”, First

Technologies and Applications for

ve and Social Information Retrieval

09.
Web”, Springer, 2009.

L T P C
3 0 0 3

9
n, NSTISSC Security Model, Components
cess, The SDLC, The Security SDLC
 An Overview of
olicies, Integrity policies

- Systems: Access

7799, NIST Models,

y

Devices, Physical

ues in information security

pects of risk management.
formation Security System
on of Security Techniques.
TEXT BOOK:
as Publishing House, New
Delhi, 2003
REFERENCES
1-3 CRCPress LLC, 2004.
”, Tata McGraw- Hill, 2003
ence”, Pearson/PHI, 2002.
RKS L T P C

3 0 0 3
hitecture – Why SDN –

al Concepts
9
ata Center Network – VLANs – EVPN –

9
ent Languages and Tools, Composition
tworks: Concepts, Implementation and

9
Floodlight Controller – Bandwidth
 prehensive

eilly Media, 2013.

acket Publishing, 2013.

ces, Inc.,

ples and Design, CRC Press, 2014.

L T P C
3 0 0 3

9
th Computer Crime. Introduction to
response methodology - Forensic
and IR team. - Forensics
Acquisition.

9
OS Systems.
 9
n – Network Forensics –
Mobile Devices Forensics
9
s - Enumeration - System
Malware Threats - Sniffing
9
Web Applications – SQL
Hacking Mobile Platforms.
OTAL 45 PERIODS
OUTCOMES:
udent should be able to:
ics of computer forensics
tools to a given scenario
nd validate forensics data
en network infrastructure
es to test system security
TEXT BOOKS:
“Computer Forensics and
rning, India Edition, 2016.
Wiley India Edition, 2015.
REFERENCES
Cengage Learning, 2005
ition, Prentice Hall, 2013.
Macmillan India Ltd, 2006
mp; Francis Group–2008.
L T P C
3 0 0 3
uzzy systems.

Algorithm and
and Pitts Neuron Model-

uantization -Hamming

ctor Machines - Spike

9
Relations -Membership
Approximate Reasoning -

9
- Inheritance Operators -
of Genetic Algorithm.
9
ht Determination - LR-Type
rence by Fuzzy BP - Fuzzy
- Fuzzy Logic Controller
 students should be able to
ques for various applications.
niques for complex problems.
TEXT BOOKS:
xford University Press, 2015.
Pvt. Ltd., 2nd Edition, 2011.
etic Algorithm, Synthesis and
PHI Learning Pvt. Ltd., 2017.
REFERENCES:
uting”, Prentice-Hall of India,
2002.
Applications”, Springer, 2005.
cations”, Prentice Hall, 1996.
plications, and Programming
ues”, Addison Wesley, 2003.
NG LT P C
3003

to instill Moral and Social

10
or others – Living peacefully

d meditation for
 9
– Moral Autonomy –
oles - Theories about right

9
– A Balanced Outlook on

9
Respect for Authority –
– Professional Rights –

8
nt – Engineers as Managers
es related to engineering and realize the responsibilities and rights in the society.TEXT BOOKS:1. Mike W. Martin and Roland Schinzinger, “Ethic

ES LT PC
3 0 03
 9
n versus Data Retrieval -
nking Processes - The
e Web – How People

9
ency) Weighting - Vector
– Retrieval Evaluation –
n – Relevance Feedback

9
Text Classification –
election or Dimensionality
ng and Searching –

9
es – Search Engine
-- Search Engine Ranking –
– Architecture and

9
ation Techniques – Basics
Drawbacks of Content-

epts and Technology behind

011.
 REFERENCES:
mation Retrieval, Cambridge
University Press, 2008.
ck, ―Information Retrieval:
gines, The MIT Press, 2010.
L T P C

3 0 0 3

ot print, scoop on power

e Business: Policies,

ocess Management:
ental Intelligence – Green

teleporting – Materials

reen Compliance:
.

Trial Runs – Case

ging Industry and Telecom
n the environment.

eholders.

TEXT BOOKS:
nce”, CRC Press, June 2014.
for dummies”, August 2012.
REFERENCES:
y”, Shroff/IBM rebook, 2011.
T”, Pearson Education, 2009.
s & industry”, Lulu.com, 2008
T”, John Wiley & Sons, 2010.
nergy efficiency”, CRC Press
G LTPC
3 003
 12
ure - CUDA Hardware
d Memory, Global Memory,

8
lem Decomposition,

8
zation, Algorithmic Issues,

8
emory Model – Basic

9
amming Heterogeneous

multiplication
Applications of GPU Computing), First Edition, Morgan Kaufmann, 2012.2. David R. Kaeli, Perhaad Mistry, Dana Schaa, Dong Ping Zhang, “Heterogene

NG LTPC
3 0 03
gular Expressions, Finite-
ting and Correcting Spelling

Classes, Part-of-Speech
ng – Hidden Markov and

r grammar – Dependency
Probabilistic CFG,
tructures.

Semantic analysis,
lectional restrictions –
apping methods – Word

bbs and Centering

ritish National Corpus

 OUTCOMES:
he students will be able to:
with basic Language features
ation using NLP components
phology/syntax of a language
sing for real-time applications
nt types of NLP applications.
TEXT BOOKS:
duction to Natural Language
h, Pearson Publication, 2014.
al Language Processing with
Edition, O‘Reilly Media, 2009.
REFERENCES:
ook, Atlantic Publisher, 2015.
Javaǁ, O‘Reilly Media, 2015.
econd Edition, Chapman and
Hall/CRC Press, 2010.
val”, Oxford University Press,
2008.
L T P C
3 0 0 3
various classes of parallel

9
RAM and PRAM Model –
gorithm – Analysis of

9
Searching -Sorting -

9
Odd-Even Merge Sorting -

9
ic Sort- Matrix Multiplication

9
on Multiprocessors and

on, Second edition, 2017.

puter Algorithms", University

ming ", PHI learning, 2016.

allel Computing", 2nd

ssing", PHI learning , 2013.

 L T P C
3 0 0 3
9
rithms
ers – N grams

9
ihood: the forward
ed tagging – evaluation and

9
ological categories and
atory and gestural
 9
orm synthesis - unit selection
veform synthesis - evaluation
9
e extraction: mfcc vectors -
ss decoding: n-best lists and
training - speech recognition
by humans
OTAL : 45 PERIODS
OUTCOMES:
se ,Students will be able to
hms with speech processing
Derive new speech models
s language phonetic analysis
speech identification system
w speech recognition system
TEXT BOOK:
duction to Natural Language
on”, Person education,2013.
REFERENCES
n Engineering and Computer
Science, 1999.
on”, LAP Lambert Academic
Publishing, 2010.
mentation”,Wiley publications
2008.
on”, Wiley publications , 2011
CE LT PC
3 0 03
 8
and Engineering-
nfilms-multilayered
nic, Optical, Magnetic
only).
9
Milling, Colloidal routes,
am Epitaxy, Atomic Layer

12
bon Nanotubes (SWCNT)
ation, CVD routes, Plasma
2, NiO, nanoalumina, CaO,
dots-preparation, properties

9
es, Transmission Electron
SNOM, ESCA, SIMS-

7
ystal, Nanobiotechlogy:
ug delivery, Bioimaging -
Nanosensors, nano
t, printing, solar cell,
plications”, Institute of

heim Cambridge, Wiley-

, Modeling and Simulations”.