Syllabus of V & VI Semester B.E. / Computer Science & Engg.

B. E. SYLLABUS

COMPUTER SCIENCE & ENGINEERING

V & VI SEMESTER

With

Scheme of Teaching
& Examination

1
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

DEPARTMENT: COMPUTER SCIENCE & ENGINEERING

Sl.
Faculty Name Qualification Designation
No.

1. Dr. Niranjan.N. Chiplunkar Ph.D Principal

Dr. K R Udaya Kumar

2. Ph.D Professor & Head
Reddy

Dr. Udaya Kumar K

3. Ph.D Professor
Shenoy

4. Dr. Deviprasad M Ph.D Professor

5. Dr. D.K. Sreekantha Ph.D Professor

6. Dr. Jyothi Shetty Ph.D Professor

Mrs. Sharada Udaya

7. M.Tech., (Ph.D) Assoc. Prof.
Shenoy

8. Dr. Venugopala P.S. Ph.D Assoc. Prof.

9. Mr. Roshan Fernandes M.Tech., (Ph.D) Assoc. Prof.

10. Mr. Radhakrishna D M.Tech., (Ph.D) Assoc. Prof.

11. Dr. Sarika Hegde Ph.D Assoc. Prof.

12. Mr. Raju K M.Tech., (Ph.D) Assoc. Prof.

13. Mr. Sudeepa K.B M.E., (Ph.D) Assoc. Prof.

14. Dr. Sanju V Ph.D Assoc. Prof.

15. Dr. Aravinda C V Ph.D Asst. Prof Gd III

16. Mr. Pradeep Kanchan M.Tech., (Ph.D) Asst. Prof Gd III

17. Mr. Ravi B M.Tech., (Ph.D) Asst. Prof Gd III

18. Mr. Vijaya Murari T M.Tech., (Ph.D) Asst. Prof Gd III

19. Mrs. Pallavi KN M.Tech., ( Ph.D) Asst. Prof Gd II

20. Mr. Ranjan Kumar HS M.Tech., (Ph.D) Asst. Prof Gd II

21. Mrs. Anisha P Rodrigues M.Tech., (Ph.D) Asst. Prof Gd II

22. Mr. Raghunandan KR M.Tech., (Ph.D) Asst. Prof Gd II

2
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

23. Mr. Ramesha Shettigar M.Tech Asst. Prof Gd II

24. Mrs. Minu P. Abraham M.Tech., (Ph.D) Asst. Prof Gd II

25. Mr. Sampath Kini M.Tech. Asst. Prof Gd II

26. Mr. Mahesh Kini. M M.Tech. Asst. Prof Gd II

27. Mrs. Asmita Poojary M.Tech., (Ph.D) Asst. Prof Gd II

28. Mrs. Shruthi M M.Tech., (Ph.D) Asst. Prof Gd II

Mrs. Keerthana B.
29. M.Tech., (Ph.D) Asst. Prof Gd II
Chigateri

30. Mr. Sannidhan M.S M.Tech., (Ph.D) Asst. Prof Gd II

Mr. Sandeep Kumar

31. M.Tech., (Ph.D) Asst. Prof Gd II
Hegde

32. Mrs. Shwetha G K M.Tech. Asst. Prof Gd II

33. Ms. Savitha M.Tech., (Ph.D) Asst. Prof Gd II

34. Mr. Pawan Hegde M.Tech Asst. Prof Gd I

35. Mrs. Shabari Shedthi. B M.Tech., (Ph.D) Asst. Prof Gd I

36. Mr. Sunilkumar Aithal M.Tech Asst. Prof Gd I

37. Mr. Krishna Prasad Rao M.Tech. Asst. Prof Gd I

38. Mr. Shashank Shetty M.Tech., (Ph.D) Asst. Prof Gd I

Mrs. Divya Jennifer

39. M.Tech Asst. Prof Gd I
D’Souza

40. Mr. Puneeth R.P M.Tech Asst. Prof Gd I

41. Mrs. Shilpa Karegoudar M.Tech Asst. Prof Gd I

42. Mrs. Rajalaxmi Hegde M.Tech., (Ph.D) Asst. Prof Gd I

43. Ms. Ankitha A Nayak M.Tech., (Ph.D) Asst. Prof Gd I

44. Mrs. Swathi Pai M M.Tech Asst. Prof Gd I

45. Ms. Rajashree M.Tech Asst. Prof Gd I

46. Mr. Krishnaraj M.Tech Asst. Prof Gd I

3
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

VISION:
To be a center of excellence in Computer science & Engineering education and research,
empower the lives of individuals to fulfill their academic excellence, professional passions,
and partnership for community development.

MISSION :
 To impart both theoretical and practical knowledge through the state-of-the-art
concepts and technologies in Computer Science and Engineering.
 To inculcate values of professional ethics, leadership qualities and lifelong
learning.
 To prepare professionals for employment in industry, research, higher education,
and entrepreneurship to benefit the society.

Program Educational Objectives (PEOs):

1. Graduates will be capable of practicing principles of Computer Science &
Engineering, Mathematics and Engineering sciences to solve problems that are
appropriate to the discipline
2. Graduates will be able to contribute to their profession and society.
3. Graduates will be employed in computing profession or engaged in learning to
pursue higher education.
Program Outcomes (POs):
Engineering Graduates will be able to:
1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering
fundamentals, and an engineering specialization to the solution of complex engineering
problems.
2. Problem analysis: Identify, formulate, review research literature, and analyze complex
engineering problems 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 system components or processes that meet the specified needs with
appropriate consideration for the public health and safety, and the cultural, societal, and
environmental considerations.
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.

4
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and
modern engineering and 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 and 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 engineering practice.
9. Individual and team work: Function effectively as an 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 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 and in multidisciplinary environments.
12. Life-long learning: Recognize the need for, and have the preparation and ability to
engage in independent and life-long learning in the broadest context of technological
change.
Program Specific Outcomes
1. Apply the knowledge of engineering science and mathematics in solving
problems that are appropriate to the discipline.
2. Apply the knowledge of computing both hardware and software aspects to the
solution of real-world engineering problems in the discipline.
3. Design & develop algorithms, programs, and projects using various software and
modern tools appropriate to software industry or Research & Development
activities in the discipline.

5
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHEME OF TEACHING AND EXAMINATION
V SEMESTER B.E. 34 Hours / Week

Sl. No. Sub. Code Subject L+T+P+S Total Hours Credits

C.I.E S.E.E
1 16CS501 Advanced Java Programming 3+0+3+0 6 50+50 50+50 5
Relational Database Management
2 16CS502 4+0+3+0 7 50+50 50+50 6
Systems
Formal Languages and Automata
3 16CS503 4+0+0+0 4 50 50 4
Theory
4 16CS504 Python Programming 0+0+3+0 3 50 50 2
5 16CS505 Operating Systems 4+0+3+0 7 50+50 50+50 6

6 16CSEAB Elective – I 3+0+0+0 3 50 50 3

7 16CSXYZ Global Elective 3+0+0+0 3 50 50 --

8 16IL001 Employability Skill Development 0+1+0+0 1 50 0 0

TOTAL 34 550 500 26

6
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

SCHEME OF TEACHING AND EXAMINATION

VI SEMESTER B.E. 34 Hours / Week

Total
Sl. No. Sub. Code Subject L+T+P+S Credits
hours C.I.E S.E.E

1 16CS601 Software Testing 3+0+2+0 5 50+50 50+50 4

2 16CS602 Computer Networks 4+0+2+0 6 50+50 50+50 5

3 16CS603 Compiler Design 4+0+3+0 7 50+50 50+50 6

4 16CS604 Business Intelligence 3+0+0+1 3 50 50 3

5 16CSEAB Elective – II 3+0+0+0 3 50 50 3

6 16CSEAB Elective – III 3+0+0+0 3 50 50 3

7 16CSXYZ Global Elective 3+0+0+0 3 50 50 --

Immersive Group
8 16CS605 0+3+0+0 3 -- -- --
Workshop
Employability Skill
9 16IL002 0+1+0+0 1 50 0 0
Development

TOTAL 34 550 500 24

7
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

ADVANCED JAVA PROGRAMMING

Sub Code : 16CS501 Credits : 03
L+T+P+S : 3+0+3+0 Total Hours : 39

Course Objectives:
This course will enable students to:
1. Develop networking Java applications.
2. Apply the database concept for a Java database applications
3. Design server side web applications using Java Servlets.
4. Develop server side web applications using Java Server Pages.

UNIT – I
REVISIT TO OOP CONCEPTS:
Class, Object and Inheritance in Java. String buffer and string builders, Java beans,
Introspection, Bean APIs, EJB concepts, Collection interfaces and Collection classes.

FILE HANDLING:
Serial Access Files, File Methods, Redirection, Command Line Parameters, Random Access
Files. 13 Hours
UNIT – II
JAVA DATABASE CONNECTIVITY (JDBC):
The Vendor Variation Problem, SQL and Versions of JDBC, Creating an ODBC Data Source,
Simple Database Access, Modifying the Database Contents, Transactions, Meta Data,
Scrollable Result Sets in JDBC 2.0, Modifying Databases via Java Methods.

NETWORK PROGRAMMING WITH JAVA :

Basic Concepts, Protocols and Terminology, Clients, Servers and Peers, Ports and Sockets,
The Internet and IP Addresses, Internet Services, URLs and DNS, TCP, UDP. The Inet
Address Class, Using Sockets (TCP and UDP). 13 Hours

UNIT – III
JAVA SERVLETS :
Benefits, A simple Java Servlet, Anatomy of a Java Servlet, Reading data from a client,
Reading HTTP Request Headers, Sending data to a client, Working with Cookies, Tracking
Sessions. JAVA SERVER PAGES (JSP) : JSP Tags, Form handling in JSP, User Sessions,
Cookies, Session objects. 13 Hours

8
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Course Outcomes:
Upon completion of this course, students will be able to:
1. Identify and apply the concepts of Java programming, Beans and collection
frameworks
2. Apply JDBC/ODBC connectivity and network programming in Java.
3. Design network programming using Java
4. Deign a web page based on servlets.
5. Apply JSP tages for designing web pages.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Design / development of solutions
3. Conduct investigation of complex problems
4. Modern tool usage
5. The engineer and society
6. Environment and sustainability
7. Ethics
8. Communication
9. Life-long Learning

TEXT BOOKS:
1. Herbert Schildt, “The Complete Reference Java by Seventh Edition”, Tata McGraw-
Hill, 2007,
2. Jan Graba, “An Introduction to Network Programming with Java”, Springer
Publications, 2007
3. Jim Keogh, “The Complete Reference J2EE”, Tata McGraw-Hill, 2002.

REFERENCE BOOKS:
1. H. M. Deitel ,”Java – How to Program? ”, Prentice Hall, 2004.

E-Books / Online Resources:

1. http://www.mindview.net/Books/TIJ
2. http://docs.oracle.com/javase/specs/jls/se8/html/index.html
3. http://greenteapress.com/thinkapjava/html/index.html

MOOC:
1. Duke University, Andrew D. Hilton: “Java Programming: Principles of Software
Design” (Coursera).
2. http://nptel.ac.in/courses/106106147/.

9
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

ADVANCED JAVA PROGRAMMING – LABORATORY

Sub Code : 16CS501 Credits : 02
Hrs / Week : 03

1. Programs related to the concepts discussed in theory are to be implemented in

lab.
2. Students need to complete a mini project using the Java programming concepts.

*************

RELATIONAL DATABASE MANAGEMENT SYSTEMS

Sub Code: 16CS502 Credits : 04
L+T+P+S: 4+0+3+0 Total Hours : 50

Course Objectives:
This Course will enable students to:
1. Explain the concept of databases, and make use of Entity-Relationship Modeling
for creating simple databases from the real world scenarios.
2. Write structured query language (SQL) statements.
3. Normalize a database using Normalization Rules.
4. Describe database design concepts and algorithms.
5. Discuss the issues associated with Transaction Processing and describe NoSQL
database concepts for managing big data.

UNIT – I
INTRODUCTION TO DATABASE SYSTEMS:
Introduction, Characteristics of the Database approach, Actors on the scene, Advantages
of using the DBMS approach, Data models, Schemes and Instances, Three Schema
Architecture and Data Independence.
ENTITY-RELATIONSHIP MODEL:
Using High-Level Conceptual Data Models for Database Design; An Example Database
Application; Entity Types, Entity Sets, Attributes and Keys; Relationship types, Relationship
Sets, Roles and Structural Constraints; Weak Entity Types; Refining the, ER Design for the
COMPANY Database; ER Diagrams, Naming Conventions and Design Issues. 10 Hours

UNIT – II
RELATIONAL MODEL AND RELATIONAL ALGEBRA:
Relational Model Concepts; Relational Model Constraints and Relational Database

10
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Schemas; Update Operations and Dealing with Constraint Violations; Unary Relational
Operations: SELECT and PROJECT; Relational Algebra Operations from Set Theory; Binary
Relational Operations: JOIN and DIVISION; Additional Relational Operations; Examples of
Queries in Relational Algebra; Relational Database Design Using ER- to-Relational
Mapping. 10 Hours

UNIT – III
SQL-THE RELATIONAL DATABASE STANDARD:
SQL Data Definition and Data Types, Specifying Basic Constraints in SQL, Schema Change
Statements in SQL; Basic Queries in SQL; More Complex SQL Queries; Insert, Delete and
Update Statements in SQL; Additional Features of SQL; Views (Virtual Tables) in SQL;
Database Programming: Issues and Techniques; Embedded SQL. 10 Hours

UNIT – IV
DATABASE DESIGN:
Informal Design Guidelines for Relation Schemas; Functional Dependencies; Normal
Forms Based on Primary Keys; General Definitions of Second and Third Normal Forms;
Boyce-Codd Normal Form; Properties of Relational Decompositions; Algorithms for
Relational Database Schema Design; Multi valued Dependencies and Fourth Normal Form;
Join Dependencies and Fifth Normal Form. 10 Hours

UNIT – V
TRANSACTION MANAGEMENT AND NOSQL DATA MANAGEMENT:
The ACID Properties; Transactions and Schedules; Concurrent Execution of Transactions;
Lock- Based Concurrency Control; Performance of Locking; Transaction Support in SQL
NOSQL DATA MANAGEMENT:
Introduction to NoSQL(T4); Aggregate data models – Aggregates – Key-value and
document data models ;Consistency-Relaxing consistency --CAP theorem; Introduction to
MongoDB(T5), Data types in MongoDB, MongoDB query language (CRUD operations)
10 Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Identify and apply the concept of databases, database management systems, ER
modeling for designing simple databases.
2. Summarize the concepts related to relational model and solve database queries
using relational algebra.
3. Write database queries using Structured Query Language (SQL).
4. Design and develop databases from the real world by applying the concepts of
Normalization and design algorithms.
5. Outline the issues associated with Transaction Processing and apply the concept
of NoSQL databases for managing big data.

11
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Design / development of solutions
3. Conduct investigation of complex problems
4. Modern tool usage
5. The engineer and society
6. Environment and sustainability
7. Ethics
8. Individual and team work
9. Communication
10. Project management and finance
11. Life-long Learning

TEXT BOOKS:
1. Elmasri and Navathe, ”Fundamentals of Database Systems“, Fourth Edition,
Pearson Education, 2003
2. P. J. Sadalage and M. Fowler, "NoSQL Distilled: A Brief Guide to the Emerging
World of Polyglot Persistence", Pearson Education, Inc. 2012.
3. Seema Acharya, Subhashini Chellappan, “Big Data and Analytics”, First Edition,
Wiley, 2015.
4. Raghu Ramakrishnan and Johannes Gehrke, “Database Management Systems”,
Third Edition, McGraw-Hill, 2003.
5. Silberschatz, Korth and Sudharshan: “Data base System Concepts”, Sixth Edition,
Mc-GrawHill, 2010.

REFERENCE BOOKS:
1. C.J. Date, A. Kannan, S. Swamynatham: “An Introduction to Database Systems”,
Eight Edition, Pearson Education, 2006.

E-Books / Online Resources:

1. http://agce.sets.edu.in/cse/ebook/DBMS%20BY%20RAGHU%20RAMAKRISHNAN.
pdf
2. http://iips.icci.edu.iq/images/exam/databases-ramaz.pdf

MOOC:
1. http://nptel.ac.in/courses/106106093/
2. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-830-
database-systems-fall-2010/lecture-notes/

12
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

RELATIONAL DATABASE MANAGEMENT SYSTEMS

LABORATORY
Sub Code : 16CS502 Credits : 02
Hrs / week: 03

1. Design and implementation of SQL queries involving various constructs of SQL

as discussed in the Unit-III of the syllabus.
2. Execution of NoSql Queries as discussed in Unit – V of the syllabus.
3. Implementation of a mini project that involves a user interface design,
database design and design of SQL queries to suit the need of the designed
application.

**************

FORMAL LANGUAGES AND AUTOMATA THEORY

Sub Code : 16CS503 Credits : 04
L+T+P+S : 4+0+0+0 Total Hours : 50

Course Objectives:
This Course will enable students to:
1. Outline the theory behind the basic design of machines, the relation between
formal languages and programming languages, and their applications.
2. Make use of regular expressions, find the equivalence between finite automata
and regular languages, and identify non-regular languages.
3. Make use of context-free grammars and how to simplify the grammars.
4. Get the idea of designing pushdown automata, find the equivalence between
context-free languages and pushdown automata, and identify non-context-free
languages.
5. Tell how Turing machines solve any computational process carried by present-day
computers, their design, and get the feeling of undecidability concept.

UNIT - I
INTRODUCTION TO THE THEORY OF COMPUTATION:
Mathematical preliminaries and notation, Three basic concepts Some applications.
FINITE AUTOMATA:
Deterministic Finite accepter-Deterministic accepter and transition graphs. Languages and
DFA’s, Regular languages. Nondeterministic finite accepter: Definition, Examples.
Equivalence of Deterministic and Nondeterministic Finite Accepter. Reduction of the
number of states in finite automata. 10 Hours
13
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

UNIT – II
REGULAR LANGUAGES AND REGULAR GRAMMARS:
Regular expressions, Languages associated with regular expressions, Regular expressions
denote regular languages, Regular expressions for regular languages, Regular grammars-
Right and Left linear grammars. Right and Left Linear grammar examples.
PROPERTIES OF REGULAR LANGUAGES:
Closure properties of regular languages-Closure under simple set operations, closure
under other operations. Identifying non-regular languages-Using the pumping lemma.
10 Hours
UNIT – III
CONTEXT-FREE LANGUAGES:
Context free grammars – examples, Leftmost and Rightmost derivations. Derivation Trees,
Parsing and ambiguity-Ambiguity in grammars and languages.
SIMPLIFICATION OF CFG AND NORMAL FORMS:
Methods for transforming grammars-Substitution rule. Removing useless, lambda, unit
productions. Normal forms-Chomsky normal form. 10 Hours

UNIT – IV
PROPERTIES OF CONTEXT-FREE LANGUAGES:
Pumping lemma for Context-Free languages and its applications.
PUSHDOWN AUTOMATA
Nondeterministic pushdown automata-Definition, Language accepted by a PDA. PDA for
Context Free languages, Context free grammars for pushdown automata, Deterministic
pushdown automata. 10 Hours

UNIT – V
TURING MACHINES:
The standard Turing machine-Definition, examples, Turing machine as language accepter.
Turing machine as Transducers. Universal Turing machine. Other models of Turing
machines: Multi-tape Turing machines, Nondeterministic Turing machines.
A HIERARCHY OF FORMAL LANGUAGES AND AUTOMATA:
Recursive and recursively enumerable languages, The Chomsky hierarchy.
LIMITS OF ALGORITHMIC COMPUTATION:
Some problems that cannot be solved by Turing machines, Post correspondence problem.
10 Hours
Course Outcomes:
Upon completion of this course, students will be able to:
1. Design a finite automaton and identify the concept of finite automata with
applications.
2. Apply regular expressions, illustrate equivalence between finite automata and
regular languages, and prove the properties of regular languages and non-
regular languages.

14
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

3. Design and apply context-free grammars and simplify the grammars.

4. Design a pushdown automaton, illustrate equivalence between context-free
languages and pushdown automata, and prove the properties of context-free
languages and non-context-free languages.
5. Design Turing machines, explain the concept of undecidability, and describe the
Chomsky hierarchy.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Design / development of solutions
4. Conduct investigation of complex problems
5. The engineer and society
6. Ethics
7. Life-long Learning

TEXT BOOK:
1. Peter Linz, “An Introduction to formal languages and Automata”, Fourth Edition,
Narosa Publishing House, 2011.

REFERENCE BOOKS:
1. J.P. Hopcroft, Rajeev Motwani, and J.D. Ullman, “Introduction to Automata Theory,
Languages and Computation”, Third Edition, Pearson Education 2012.
2. John Martin, “Introduction to languages and theory of computation”, Tata
McGraw Hill, 2003.

E-Books / Online Resources:

1. https://www.eecs.wsu.edu/~ananth/CptS317/Lectures/index.htm
2. http://infocat.ucpel.tche.br/disc/lfa/docs/IAT.pdf

MOOC:
1. http://nptel.ac.in/courses/106106049/
2. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-
045j-automata-computability-and-complexity-spring-2011/lecture-notes/

**************

15
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

PYTHON PROGRAMMING

Sub Code : 16CS504 Credits : 02

L+T+P+S : 0+0+3+0 Total Hours : 26

Course Objectives:
This Course will enable students to
1. Explain the elementary programming constructs and file operations and use it in
Python programming.
2. Describe the concepts like strings, conversion of strings to numbers, lists, tuples,
dictionaries and use these in python programming.
3. Illustrate the functions, recursive functions and object oriented programming
concepts in Python.
4. Construct a Graphical User Interface (GUI) and write a multi-threaded and a
Client/Server program in Python.
5. Perform the database connection and Common Gateway Interface (CGI)
programming in Python.
UNIT – I
INTRODUCTION TO PYTHON:
The concept of data types; immutable variables; Conditions, Boolean logic, logical
operators; ranges; control statements: if-else, loops (for, while); short circuit evaluation;
text files; manipulating files and directories, os and sys modules; text files: reading/writing
text and numbers from/to a file; creating and reading a formatted file (csv or tab-
separated).
STRING MANIPULATIONS:
Subscript operator, indexing, slicing a string; strings and number system: converting
strings to numbers and vice versa. Lists, tuples, and dictionaries; basic list operators,
replacing, inserting, removing an element; searching and sorting lists; dictionary literals,
adding and removing keys, accessing and replacing values; traversing dictionaries.
DESIGN WITH FUNCTIONS:
Arguments and return values; formal vs. actual arguments. 13 Hours

UNIT – II
DESIGN WITH FUNCTIONS:
Named arguments, Recursive functions.
CLASSES AND OOP:
Classes, objects, attributes and methods; persistent storage of objects inheritance,
polymorphism, operator overloading (_eq_,_str_, etc); abstract classes; exception handling,
try block.
Graphical user interfaces; event-driven programming paradigm; creating simple GUI;
buttons, labels, entry fields, dialogs; widget attributes - sizes, fonts, colors layouts.

16
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Python database application programmer's interface (DB- API), connection and cursor
objects, Creating simple web clients, introduction to CGI, CGI module, building CGI
applications. 13 Hours

Course Outcomes
Upon completion of this course, students will be able to:
1. Explain the basic program constructs and file operations in Python and express it.
2. Design the Python programs using the concepts like strings, conversion of strings
to numbers, lists, tuples and dictionaries.
3. Implement the functions and object oriented programming concepts in python.
4. Create a Graphical User Interface, multiple threads and Client/Server programs in
python.
5. Implement a database connection and CGI programs in python.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Problem Analysis
2. Design / development of solutions
3. Conduct investigation of complex problems
4. Modern tool usage
5. The engineer and society
6. Environment and sustainability
7. Ethics
8. Project management and finance

TEXTBOOKS:
1. Kenneth A. Lambert, “The Fundamentals of Python: First Programs”, Cengage
Learning, 2011.
2. Magnus Lie Hetland, Beginning, “Python From Novice to Professional”, Second
Edition,2009.
3. Mark Summerfield, “Programming in Python 3 - A Complete Introduction to the
Python Language”, Second Edition,2009.
4. Y. Daniel Liang, “Introduction to Programming Using Python”, Pearson, ISBN:978-
0-13-274718-9, 2013.

REFERENCE BOOKS:
1. Chun, J Wesley, “Core Python Programming”, 2nd Edition, Pearson, 2007 Reprint
2010.
2. David Beazley and Brian K. Jones, Shroff ,”Python Cookbook”, Third Edition,
Publishers & Distributors Pvt. Ltd., ISBN : 978-93-5110-140-6,2013.
3. Mark Lutz ,”Learning Python” Fifth Edition,2013
4. Mark Lutz ,”Programming Python (English)”, Fourth Edition,2011.
5. David Sale,“Testing Python”, Wiley India (P) Ltd., ISBN : 978-81-265-5277-1,2014

17
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

E-Books / Online Resources:

1. http://www.davekuhlman.org/python_book_01.pdf
2. http://slav0nic.org.ua/static/books/python/OReilly%20%20Core%20Python%20Pr
ogramming.pdf

MOOC:
1. http://nptel.ac.in/courses/106105166/26
2. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-
0001-introduction-to-computer-science-and-programming-in-python-fall-
2016/lecture-slides-code/

**************

OPERATING SYSTEMS
Sub Code : 16CS505 Credits : 04
L+T+P+S : 4+0+3+0 Total Hours : 50

Course Objectives:
This Course will enable students to:
1. Explain the concepts, principles and services of operating system.
2. Identify fundamental operating system abstractions such as Process, Threads,
Files, Semaphores, IPC abstractions and demonstrate them.
3. Assess the benefits of concurrency and synchronization and apply them to write
concurrent programs.
4. Analyze basic resource management technologies in job and process scheduling.
Use and compare different memory management techniques.
5. Study Linux Operating System in terms of process scheduling, Memory
management, File system and I/O.

UNIT – I
INTRODUCTION TO OPERATING SYSTEMS, SYSTEM STRUCTURES:
Operating System structure; Operating System operations(functions), Operating System
Services; User - Operating System interface; System calls; Types of system calls; System
programs; Operating System design and implementation; Operating System structure;
Virtual machines; Operating System generation; System boot. 10 Hours

PROCESS MANAGEMENT:
Process concept; Process scheduling; Operations on processes; Inter-process
communication.
MULTI-THREADED PROGRAMMING:

18
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Overview; Multithreading models; Thread Libraries; threading issues. Process - thread

comparison.
UNIT – II
PROCESS SCHEDULING:
Basic concepts; Scheduling criteria; Scheduling algorithms; Multiple-Processor scheduling;
thread scheduling.
PROCESS SYNCHRONIZATION:
Synchronization: The Critical section problem; Peterson’s solution; Synchronization
hardware; Semaphores; Classical problems of synchronization; Monitors.
DEADLOCKS:
Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks;
Deadlock prevention; Deadlock avoidance; Deadlock detection and recovery from
deadlock 10 Hours
UNIT – III
MEMORY MANAGEMENT:
Memory Management Strategies: Background; Swapping; Contiguous memory allocation;
Paging; Structure of page table; Segmentation. Virtual Memory Management:
Background; Demand paging; Copy-on-write; Page replacement; Allocation of frames;
Thrashing. 10 Hours

UNIT – IV
FILE SYSTEM, IMPLEMENTATION OF FILE SYSTEM
File System: File concept; Access methods; Directory structure; File system mounting; File
sharing; Protection. Implementing File System: File system structure; File system
implementation; Directory implementation; Allocation methods; Free space management.
10 Hours

UNIT – V
SECONDARY STORAGE STRUCTURES:
Mass storage structures; Disk structure; Disk attachment; Disk scheduling; Disk
management; Swap space management.
The Linux & Windows Operating System : history; Design principles; Kernel modules;
Process management; Scheduling; Memory management; File systems, Input and output;
Inter-process communication - Comparison.
Tutorials: Students may be asked to go through the LINUX kernel code to understand the
OS design. Students may be asked to implement a few algorithms related to operating
system. 10 Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Explain basics of Operating Systems and OS Service.
2. Illustrate fundamentals of operating system concepts like process, threads, files,
semaphores and IPC.

19
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

3. Explain the benefits of concurrency and synchronization and apply them to write
concurrent programs.
4. Assess basic resource management technologies in job and process scheduling,
Illustrate the deadlocks and management of deadlocks.
5. Explain the concepts of virtual and secondary memory management and various
file system implementations.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Design / development of solutions
4. Conduct investigation of complex problems
5. Modern tool usage
6. The engineer and society
7. Environment and sustainability
8. Ethics
9. Life-long Learning

TEXT BOOK:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, “Operating System Principles”,
Seventh Edition, Wiley-India, 2006.

REFERENCE BOOKS:
1. D.M Dhamdhere: Operating systems - A concept based Approach, 2nd Edition, Tata
McGraw- Hill, 2002.
2. P.C.P. Bhatt: Operating Systems, 2nd Edition, PHI, 2006.
3. Harvey M Deital: Operating systems, 3rd Edition, Addison Wesley, 1990.

E-Books / Online Resources:

1. http://www.uobabylon.edu.iq/download/M.S%202013-
2014/Operating_System_Concepts,_8th_Edition%5BA4%5D.pdf
2. http://iips.icci.edu.iq/images/exam/Abraham-Silberschatz-Operating-System-
Concepts---9th2012.12.pdf

MOOC:
1. https://freevideolectures.com/university/iit-bombay/
2. https://www.cse.iitb.ac.in/~mythili/os/

**************

20
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

OPERATING SYSTEMS LAB

Sub Code: 16CS505 Credits: 02
Hrs / week: 03

PART-A: UNIX Shell Script

1. Write a shell program to find and display largest and smallest of three numbers.
2. Write a shell program to check the number n is divisible by m or not. Where m
and n are supplied as command line argument or read from key board
interactively.
3. Write a shell program to check the year is the leap year or not. Display
appropriate message.
4. Write a shell program that takes two file names, checks the permissions for these
files are identical and if they are identical, output the common permissions;
otherwise output each file name followed by its permission.
5. Write a shell program to display the length of the name and also display first
three characters and last three characters in the name in two different lines if the
name contains at least 6 characters.
6. Write a shell program to implement simple calculator operations.
7. Write a shell script that accepts filename as arguments. For every filename, it
should first check whether it exists in the current directory and then convert its
name to uppercase, but only if a file with new name doesn’t exist.
8. Write shell script to determine the length of the string, extract a substring and
locate a position of a character in a string.
9. Write a PERL program that prompts user to input the string and a number, and
prints the string that many times, with each string on separate line.
10. PERL program to find the sum of digits of an unsigned number passed through
argument.
PART-B: OS CONCEPTS
1. Write the program to demonstrate creation of a Child Process using system call
fork() and display its process id.
2. Write the program to create five Child Processes using system call fork() and
display their ids.
3. Write the program to demonstrate the system calls wait( ) and exit( ).
4. Write a program to implement FCFS Scheduling algorithm to determine average
wait time and average turnaround time.
5. Write a program to implement SJF Scheduling algorithm to determine average
wait time and average turnaround time.
6. Write a program to implement Round robin Scheduling algorithm to determine
average wait time and average turnaround time.

21
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

7. Write a program to demonstrate FIFO Page replacement algorithm to determine

number of page faults.
8. Write a program to demonstrate LRU Page replacement algorithm to determine
number of page faults.
9. Write a program to demonstrate Optimal Page replacement algorithm to
determine number of page faults.
10. Write a program to demonstrate Bankers Deadlock avoidance algorithm.

**************

EMPLOYABILITY SKILL DEVELOPMENT

Sub Code : 16IL001 Credits :0
L+T+P+S : 0+1+0+0 Total Hours : 12

UNIT-I
Quantitative- Numbers(Odd, even, H.C.F& L.C.M, Square roots& cube roots, Average,
Percentage)
Analytical/ logical- Numerical logic (next number in series, odd man out)
Verbal- Vocabulary (root words, prefix, suffix)

UNIT-II
Quantitative-Ratios& Proportions, Partnership
Analytical/ logical- Coded language
Verbal- Vocabulary (synonyms)
UNIT-III
Quantitative- Time & work
Analytical/ logical- Syllogism
Verbal- Vocabulary (antonyms)
UNIT-IV
Quantitative- Pipes& Cistern
Analytical/ logical- Direction (N-E-W-S)
Verbal- One word substitution
UNIT-V
Quantitative- Speed
Analytical/ Logical- Seating arrangement
Verbal- Idiom/phrases
UNIT-VI
Quantitative- Problems on trains
Analytical /logical- Blood relations
Verbal- Sentence completion

22
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

UNIT-VII
Quantitative- Problems on boats& streams
Analytical/ logical- Blood relations
Verbal- Active & Passive voice
UNIT-VIII
Quantitative- Allegation &Mixtures
Analytical/ logical- Statement & Conclusion
Verbal- Direct & indirect speech

REFERENCE BOOKS:
1. Aggarwal R.S “Modern Approach to Logical Reasoning” S. Chanda Publication,
2008.
2. Aggarwal R.S “Quantitative Aptitude” S. Chand Publication, 2014.
3. Aggarwal R.S “Modern Approach to verbal and non verbal reasoning”, S. Chanda
Publication, 2013.
4. Arun Sharma “Verbal ability and reading comprehension CAT”,TMH
Publications,2014.
5. Ethnus Consultancy Pvt. Ltd “APTIMTRA: Your friend for cracking aptitude test”,
MGH Publications , 2014.
6. Aggarwal R.S “Advanced objective general knowledge” S, Chanda Publication,
2014.

EXAMINATION PATTERN:
This course is a mandatory learning course without credits. Continuous internal examination
(CIE) consists of 2 internal exams (20 marks each) and tasks (10 marks). There is no semester
end examination (SEE). The student will be awarded PP or NP grade as per autonomous
regulations.

****************

23
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

SOFTWARE TESTING
Sub Code : 16CS601 Credits : 03
L+T+P+S : 3+0+2+0 Total Hours : 39

Course Objectives:
This Course will enable students to:
1. Explain the concept of testing and the testing life cycle.
2. Use the testing frameworks, process and test management to generate the test
plans.
3. Generate the test plans for a business.
4. Illustrate the use of automation in testing.
5. Perform defect management and data management.
UNIT – I
INTRODUCTION TO TESTING – WHY AND WHAT:
Why is testing necessary? What is testing? Role of Tester, Testing and Quality, Overview of
STLC
SOFTWARE TESTING LIFE CYCLE - V MODEL:
SDLC vs STLC, different stages in STLC, document templates generated in different phases
of STLC, different levels of testing, different types of testing: Functional Testing, API
Testing, Usability Testing, Exploratory Testing, Ad-hoc Testing. Static Testing:
Static techniques, reviews, walkthroughs
BASICS OF TEST DESIGN TECHNIQUES:
Various test categories, test design techniques for different categories of tests. Designing
test cases using MS-Excel. 13 Hours
UNIT – II
TEST MANAGEMENT:
Documenting test plan and test case, effort estimation, configuration management,
project progress management. Use of Testopia for test case documentation and test
management.
DEFECT MANAGEMENT:
Test Execution, logging defects, defect lifecycle, fixing / closing defects. Use of Bugzilla for
logging and tracing defects.
TEST DATA MANAGEMENT:
Test Data Management –Overview, Why Test Data Management, Test Data Types, Need
for Test Data Setup, Test Data Setup Stages, Test data management Challenges. Creating
sample test data using MS-Excel. 13 Hours

UNIT – III
BASICS OF AUTOMATION TESTING :
Introduction to automation testing, why automation, what to automate, tools available for
automation testing.

24
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

BASICS OF AUTOMATION TESTING USING SELENIUM:

Introduction to Selenium, using Selenium IDE for automation testing, using Selenium Web
driver for automation testing, understanding TestNG framework with Selenium Web
driver for automation testing, Introduction to Maven automation tool. 13 Hours

Course Outcomes:
Upon Completion of this course students will be able to:
1. Explain the complete software testing life cycle and demonstrate understanding of
various terms and technologies used in testing domain.
2. Demonstrate the usage of testing framework, process and test management,
generating test plan and designing test cases and test management process.
3. Identify and write the test plan for a given a business scenario, design test cases,
document test cases using an open source test management tool.
4. Demonstrate understanding of defect management life cycle and ability to use an
open source tool for defect management.
5. Demonstrate understanding of test data management and automation testing.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Design / development of solutions
3. Conduct investigation of complex problems
4. Modern tool usage
5. The engineer and society
6. Ethics
7. Life-long Learning

TEXT BOOKS:
1. Rex Black , “Managing the Testing Process”,2nd edition, John Wiley & Sons, 2001
2. Dorothy Graham, Erik van Veenendaal, Isabel Evans, Rex Black,” Foundations of
software testing”, Cengage Learning EMEA, 2008.
3. Elfriede Dustin, “Implementing Automated Software Testing: How to Save Time and
Lower Costs While Raising Quality”, Addison-Wesley Professional,2009

REFERENCE BOOKS:
1. Paul C. Jorgensen,” Software Testing, A Craftsman’s Approach”, Third Edition,
Auerbach Publications, 2008
2. Mauro Pezze, Michal Young,” Software Testing and Analysis –Process”, Principles
and Techniques, Wiley India, 2009.

E-Books / Online Resources:

1. https://www.softwaretestinghelp.com/selenium-tutorial-1/
2. http://softwaretestingfundamentals.com/software-testing-methods/

25
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

3. https://www.tutorialspoint.com/software_testing/software_testing_tutorial.pdf
4. http://docs.seleniumhq.org/docs/
5. http://www.seleniumhq.org/download/

MOOC:
1. http://nptel.ac.in/courses/106105150/
2. https://freevideolectures.com/course/3625/testing-with-selenium

********************

SOFTWARE TESTING LAB

Sub Code : 16CS601 Credits : 01

Hrs / week: 02

PART A

Using Selenium IDE automate the following

1. Open a flipkart , Locate element using name. For the same write a test suite
containing minimum 3 test cases using IDE record and Play back .
2. Open a airasia.com search flight process to automate and locate web element using
id. For the same write a test suite containing minimum 3 test cases using IDE record
and Play back
3. Open google.co.in and search for some item and locate element by Name and Id.
For the same write a test suite containing minimum 3 test cases using IDE record
and Play back .
4. Open facebook.com and record login and logout and locate element using Xpath.
For the same write a test suite containing minimum 3 test cases using IDE record
and Play back .
5. Open snapdeal. comand search for any web element using name.For the same write
a test suite containing minimum 3 test cases using IDE record and Play back .
6. Open Mercury Tours homepage and locate web element using Xpath. For the same
write a test suite containing minimum 3 test cases using IDE record and Play back .

26
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

PART B

Using Selenium webdriver automate the following

1. Automate the following scenario using selenium web driver script.
 fetch Mercury Tours' homepage
 verify its title
 print out the result of the comparison
 close it before ending the entire program.

2. Automate the following scenario using selenium web driver script.

• Launch the browser and open “Gmail.com”.
• Verify the title of the page and print the verification result.
• Enter the username and Password.
• Click on the Sign in button.
• Close the web browser.

3. Automate the following scenario using selenium web driver script.

• Launch the Firefox browser
• Open website, “www.Store.DemoQA.com”
• Print a Message to display that the website is opened successfully
• Wait for 5 Seconds
• Close the Browser

********************

COMPUTER NETWORKS
Sub Code : 16CS602 Credits : 04
L+T+P+S : 4+0+2+0 Total Hours : 50

Course Objectives:
This Course will enable students to:
1. Outline the principles of computer networks and its application
2. Illustrate the concept of types of network
3. Identify the issues in network layer and solution for it
4. Analyze the process of congestion control algorithms
5. Illustrate IP Packets and fragmentation process.

UNIT – I
INTRODUCTION TO COMPUTER NETWORKS:
Uses of computer networks : Business Applications, Home Application, Mobile Users,
Social Issues; Network hardware: Local Area Networks, Metropolitan Area Networks,

27
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Wide Area Networks, Wireless Networks, Home Networks, Internet works; LAN Protocols :
LAN Structure , The Medium Access Control Sub layer, The Logical Link Control Sub layer;
Ethernet and IEEE 802.3 LAN Standard : Ethernet Protocol, Frame structure, Physical
Layers, Fast Ethernet ,Gigabit Ethernet, Gigabit Ethernet; Token Ring and IEEE 802.5 LAN
Standard: Token-Ring Protocol, Frame structure; FDDI; 10 Hours

UNIT – II
NETWORK LAYER (PART-I):
Network layer design issues: Store and Forward packet Switching, Services Provided to
the Transport Layer, Implementation of Connectionless Service, Implementation of
Connection-Oriented Service, Comparison of Virtual Circuit and Datagram Subnets;
Routing algorithms: The Optimality Principal , Shortest Path Routing, Flooding. Distance
Vector Routing, Link state Routing, Hierarchical Routing, Broadcast Routing, Multicast
Routing , Routing for Mobile Hosts, Routing in Ad hoc Networks.
10 Hours
UNIT – III
NETWORK LAYER (PART – II) :
Congestion Control Algorithms: General Principles of Congestion Control, Congestion
Prevention Policies, Congestion Control in Virtual-Circuit Subnets, Congestion Control in
Datagram Subnets, Load Shedding, Jitter Control; Quality Of Service: Requirements,
Techniques for Achieving Good Quality of Service, Integrated Services, Differentiated
Services; 10 Hours

UNIT – IV
NETWORK LAYER (PART –III):
Internetworking: How networks differ, How Networks Can Be Connected, Concatenated
Virtual Circuits, Connectionless Internetworking, Tunneling, Internetwork Routing,
Fragmentation; The Network Layer in the Internet : The IP Protocol, IP Addresses,
Internet Control Protocols, The Interior Gateway Routing Protocol : OSPF, The Exterior
Gateway Routing Protocol : BGP, Internet Multicasting, Mobile IP, IPV6; 10 Hours

UNIT – V
THE TRANSPORT LAYER :
The Transport Service: Services Provided to the Upper Layers, Transport Service Primitives,
Elements of Transport Protocols: Addressing, Connection Establishment, Connection
Release, Flow Control and Buffering, Multiplexing, Crash Recovery; The Internet
Transport Protocols(UDP):Introduction to UDP, The Internet Transport Protocols(TCP):
Introduction to TCP, The TCP Service Model, The TCP Protocol, The TCP Segment Header,
TCP Connection Establishment, TCP Connection Release, Modeling TCP Connection
Management, TCP Transmission Policy, TCP Congestion Control. The Application Layer:
DNS- Domain Name System, The WWW, Static Web documents, Dynamic Web
documents. 10 Hours

28
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Course Outcomes:
Upon Completion of this Course students will be able to:
1. Express the basic concept of computer network .
2. Design the network layer and the related issues .
3. Explain the congestion control, and prevention methods .
4. Explain different type of networks and protocols.
5. Describe the transport layer protocols .

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Design / development of solutions
3. Conduct investigation of complex problems
4. Modern tool usage
5. The engineer and society
6. Environment and sustainability
7. Ethics
8. Communication
9. Life-long Learning

TEXT BOOKS:
1. Andrew S. Tanenbaum , Computer Networks, Fourth edition, PHI / Pearson
Publication, 2002 .
2. Alberto Leon – Garcia and Indra Widjaja , Communication Networks –
Fundamental Concepts and Key architectures, Tata McGraw-Hill Second Edition,
2003 (Chapter 6)

REFERENCE BOOKS:
1. Behrouz A. Forouzan , “Data Communications and Networking”, Tata McGraw-
Hill Third Edition.2004,
2. William Stalling , “Data and Computer Communication”, Fifth Edition, Prentice
Hall India,1997.
3. James F. Kurose and Keith W. Ross , “Computer Networking- A Top-Down
Approach Featuring the Internet”, Second Edition, Pearson,2003.
4. Larry L. Peterson and Bruce S. Davie, “Computer Networks”, Third Edition, Elsevier
–Morgan Kaufmann Publishers,2014.

E-Books / Online Resources:

1. https://www.tutorialspoint.com/data_communication_computer_network/index.html

MOOC:
1.http://nptel.ac.in/courses/106105082/
2.https://freevideolectures.com/course/2276/computer-networks

29
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

COMPUTER NETWORKS LABORATORY

Sub Code : 16CS602 Credits : 01
Hrs / week: 02

PART A

1. Write a program for simple RSA algorithm to encrypt and decrypt the data.
2. Write a program for error detecting code using CRC-CCITT (16-bits).
3. Write a program for Hamming Code generation for error detection and
correction.
4. Write a program for frame sorting technique used in buffers.
5. Using TCP/IP sockets, write a client-server program to make client sending the file
name and the server to send back the contents of the requested file if present.
6. Write a program for distance vector algorithm to find suitable path for
transmission.
7. Write a program for congestion control using Leaky bucket algorithm.

PART B

1. Simulate a three nodes point-to-point network with duplex links between them.
Set the queue size vary the bandwidth and find the number of packets dropped.
2. Simulate a four node point-to-point network, and connect the links as follows:
n0-n2, n1-n2 and n2-n3. Apply TCP agent between n0-n3 and UDP n1-n3. Apply
relevant applications over TCP and UDP agents changing the parameter and
determine the number of packets by TCP/UDP.
3. Simulate the different types of Internet traffic such as FTP a TELNET over a
network and analyze the throughput.
4. Simulate the transmission of ping messaged over a network topology consisting
of 6 nodes and find the number of packets dropped due to congestion
5. Simulate an Ethernet LAN using N-nodes(6-10), change error rate and data rate
and compare the throughput.
6. Simulate an Ethernet LAN using N nodes and set multiple traffic nodes and
determine collision across different nodes.
7. Simulate an Ethernet LAN using N nodes and set multiple traffic nodes and plot
congestion window for different source/destination

********************

30
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

COMPILER DESIGN
Sub Code : 16CS603 Credits : 04
L+T+P+S : 4+0+3+0 Total Hours : 50

Course Objectives:
This Course will enable students to:
1. Outline lexical analysis, use of regular expressions, transition diagrams and
scanner-generator tools.
2. Get the idea of major parsing techniques top-down (recursive-descent, LL) and
Bottom up parsers
3. Discuss LR parsers using items sets and parsing tables.
4. Make use of the principal ideas in syntax-directed definitions and syntax-directed
translations, different code optimization techniques and code generation.
5. Describe how to construct of basic blocks, generation of code from expressions
and basic blocks, and register-allocation techniques.

UNIT – I
OVERVIEW OF THE TRANSLATION PROCESS:
A Simple Compiler, Difference between interpreter, assembler and compiler, The Phases
of a Compiler.
LEXICAL ANALYSIS:
Lexical Analysis- The Role of Lexical Analyzer, Input Buffering, Specifications of Tokens,
Recognition of Tokens, A Language for Specifying Lexical Analyzer, LEX programming.
10 Hours
UNIT – II
SYNTAXANALYSIS:
Context-freeGrammars, ambiguity, associativity, precedence, Unambigous grammars. The
Role of the Parser, Top-down Parsing, Bottom-up Parsing, LR Parsers –Simple LR (SLR).
10 Hours

UNIT – III
SYNTAX ANALYSIS:
Canonical LR (CLR), Look Ahead LR (LALR) Parsers, YACC programming.
SYNTAX-DIRECTED DEFINITIONS
Constructions of Syntax Trees, Bottom-up Evaluation of S-attributed definitions. 10 Hours

UNIT – IV
SYNTAX-DIRECTED DEFINITIONS
L-attributed definitions.
INTERMEDIATE CODE GENERATION:
Intermediate Languages, Declarations, Assignments, Boolean Expressions.

31
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

CODE GENERATION
Issues in the design of Code Generator, The Target Machine, Run-time Storage
Management. 10 Hours
UNIT – V
CODE GENERATION
Basic blocks and Flow graphs, Next-use information, A Simple Code Generator, Register
Allocation and Assignment, The DAG representation of Basic Blocks
CODE OPTIMIZATION:
Introduction, The Principle of Optimization, Optimization of Basic Blocks, Loops in flow
graphs. 10 Hours

Course Outcomes:
Upon Completion of this course the student will be able to:
1. Outline different translators, learn applications of regular expression, write
lexical analyzer using transition diagrams, understand the role of lexical analyzer
in the first phase of compiler and understand other translators
2. Describe the role of syntax analyzer in a compiler, learn different top down and
bottom up parsers and implement them and write YACC programs and
implement LR parsers using YACC.
3. Construct LR parsing tables and learn applications of Context free grammars.
4. Make use of use of Syntax-Directed Translation in parsing and code generation,
write Syntax-Directed Translation / Definition, for a given problem and generate
intermediate code expressions, different language constructs.
5. Explain the use of Basic blocks and Flow graphs in code generation, the use of
Syntax tree and DAG in code generation, working of simple code generator and
write simple code generator for a subset of C language.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem analysis
3. Design / development of solutions
4. Conduct investigation of complex problems
5. Modern tool usage
6. The engineer and society
7. Environment and sustainability
8. Ethics
9. Individual and team work
10. Communication
11. Project management and finance
12. Life-long Learning

32
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

TEXT BOOKS:

1. Alfred W Aho, Monica S. Lam, Ravi Sethi, Jeffrey D Ullman, “Compilers- Principles,
Techniques and Tools”, Addison-Wesley, 2006.

REFERENCE BOOKS:

1. Andrew W Apple, “Modern Compiler Implementation in C”, Cambridge University

Press, 1997.
2. Kenneth C Louden, “Compiler Construction Principles & Practice”, Thomson
Education, 1997.
3. John R. Levine, Tony Mason, Doug Brown, “LEX and YACC”, O’Reilly
Publication,1999.

E-Books / Online Resources:

1. https://www.tutorialspoint.com/compiler_design/index.htm
2. http://hjemmesider.diku.dk/~torbenm/Basics/basics_lulu2.pdf
3. http://cnp3book.info.ucl.ac.be/2nd/cnp3bis.pdf

MOOC:
1. http://www.nptelvideos.in/2012/11/compiler-design.html
2. http://www.nptelvideos.in/2012/11/computer-networks.html

*******************

COMPILER DESIGN LABORATORY

Sub Code : 16CS603 Credits : 02
Hrs / week: 03

1. Implementation of lexical analyzer programs (Lex programs).

2. Implementation of programs related to compilers (YACC programs)
3. Design and implementation of a mini project related to the area of compiler
design. (Ex: Assemblers, lexical analyzer, any phase of compiler etc.)

*******************

33
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

BUSINESS INTELLIGENCE
Sub Code : 16CS604 Credits : 03
L+T+P+S : 3+0+0+1 Total Hours: 39

Course Objectives:
This Course will enable students to:
1. Identify various sources of data and identify the methods to process them.
2. Explain the ETL process and carryout the ETL process for a given data set.
3. Design a suitable schema for a given problem.
4. Illustrate the concepts of data mining.
5. Demonstrate the Classification and clustering methods.

UNIT – I
INTRODUCTION TO BUSINESS INTELLIGENCE:
Types of digital data; Introduction to OLTP, OLAP and Data Mining; BI Definitions &
Concepts; Business Applications of BI; BI Framework, Role of Data Warehousing in BI, BI
Infrastructure Components – BI Process, BI Technology, BI Roles & Responsibilities
Basics of Data Integration (Extraction Transformation Loading); Concepts of data
integration;
Need and advantages of using data integration; Introduction to common data integration
approaches; 13 Hours
UNIT – II
Introduction to data quality, data profiling concepts and applications, Introduction to SSIS
Architecture, Introduction to ETL using SSIS; Data Warehouse and OLAP Technology –
Definition, A Multidimensional Data Model, Concepts of dimensions, facts, cubes,
attribute, hierarchies, star and snowflake schema; Data Warehouse Architecture.
Introduction to data and dimension modeling, multidimensional data model, ER Modeling
vs. multi dimensional modeling; Introduction to business metrics and KPIs; Introduction to
enterprise reporting; Concepts of dashboards, balanced scorecards; Applications of Data
mining and Case studies of BI 13 Hours

UNIT – III
Data Mining—On What Kind of Data? Data Mining Functionalities—What Kinds of
Patterns Can Be Mined? Mining Association rules: Basic concepts, frequent item set
mining methods. Definitions of classification, prediction and clustering;
Classification and Prediction - Issues Regarding Classification and Prediction, Classification
by Decision Tree Induction, Prediction, Cluster Analysis - Types of Data in Cluster Analysis,
Hierarchical Methods. 13 Hours

Course Outcomes:
Upon Completion of this course the students will be able to:
1. Distinguish the data based on the type and design the methods to handle them.

34
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

2. Design the ETL process for handling the data from a given source.
3. Design a star / snowflake schema for a given problem.
4. Illustrate the data mining concepts with suitable examples.
5. Apply classification and prediction concepts to various applications.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Design / development of solutions
3. Modern tool usage
4. The engineer and society
5. Environment and sustainability
6. Ethics

TEXT BOOKS:
1. R N Prasad and Seema Acharya, “Fundamentals of Business Analytics”, Wiley-
India,2011
2. Jiawei Han and Micheline Kamber, “Data Mining: Concepts and Techniques”,
3. Morgan Kaufmann Publishers, (ISBN: 1-55860-489-8), 2000.
4. David Loshin, “Business Intelligence -The Savvy Manager's Guide”, Morgan
Kaufmann Publishers,2003.

REFERENCE BOOKS:
1. Carlo Vercellis “Business Intelligence-Datamining and Optimization for Decision
Making”,Wiley,2009
2. Uddagiri Chandrasekhar S.K. Shinde,”Data Mining and Business Intelligence”,
Dreamtech Press,2015.

E-Books / Online Resources:

1. https://cdn.ttgtmedia.com/searchDataManagement/downloads/Data_Warehouse
_Design.pdf
2. http://download.101com.com/tdwi/ww24/WhatWorks24DigitalEdition.pdf

MOOC:
1. http://nptel.ac.in/courses/110104086/13
2. https://freevideolectures.com/course/3635/microsoft-business-intelligence

*******************

35
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

EMPLOYABILITY SKILL DEVELOPMENT

Sub Code : 16IL002 Credits :0
L+T+P+S : 0+1+0+0 Total Hours : 12

UNIT- I
Quantitative- Permutations& Combinations
Analytical/ logical- Cause& Effect statements
Verbal- Sentence corrections(Pronoun errors& misplaced modifiers)
UNIT-II
Quantitative- Area, volume& surface areas
Analytical/ logical- Scenario based questions
Verbal- Sentence correction (Parallel construction& Parallel Comparison)
UNIT-III
Quantitative- Profit & loss
Analytical / logical- Figure series & mathematical puzzles
Verbal- Sentence correction (Tense usage)
UNIT-IV
Quantitative- Simple and compound interest
Analytical/ logical- Statement & assumption
Verbal- Sentence correction (Subject-verb agreement)
UNIT-V
Quantitative- Logarithms
Analytical/ logical- Reasoning analogies
Verbal- Verbal analogies
UNIT-VI
Quantitative- Stocks& Shares
Data interpretation-Tables, bar charts
Verbal- Reading comprehension (simple passage)
UNIT-VII
Quantitative- Discounts (True discounts, bankers)

REFERENCE BOOKS:
1. Aggarwal R.S “Modern Approach to Logical Reasoning” S. Chanda Publication,
2008.
2. Aggarwal R.S “Quantitative Aptitude” S. Chand Publication, 2014.
3. Aggarwal R.S “Modern Approach to verbal and non verbal reasons”, S. Chanda
Publication, 2013.
4. Arun Sharma “Verbal ability and reading comprehension CAT”,TMH
Publications,2014.
5. Ethnus Consultancy Pvt. Ltd “APTIMTRA: Your friend for cracking aptitude test”,
MGH Publications, 2014.
6. Aggarwal R.S “Advanced objective general knowledge” S, Chanda Publication,
2014.

36
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

EXAMINATION PATTERN:
This course is a mandatory learning course without credit. Continuous internal examination
(CIE) consists of 2 internal exams (20 marks each) and tasks (10 marks). There is no semester
end examination (SEE). The student will be awarded PP or NP grade as per autonomous
regulations.

Group – 1 Group – 2
Architecture, Embedded Systems & General
Subject Subject Name Subject Subject Name
Code Code
16CSE11 Multicore Architecture & 16CSE21 Internet of Things
Programming
16CSE12 Embedded Systems 16CSE22 Advanced Compilation
Techniques
16CSE13 Operation Research 16CSE23 Advanced Algorithms

16CSE14 CAD for VLSI & VHDL

Software Engineering & Development
Subject Subject Name Subject Subject Name
Code Code
11
16CSE31 Unix Programming 16CSE41 Web Programming

16CSE32 Program Verification 16CSE42 Mobile Application

Development
1
16CSE33 Cloud Computing 16CSE43 Advanced Unix Programming

16CSE44 Software Architecture

Systems, Networks & Security
Subject Subject Name Subject Subject Name
Code Code
16CSE51 System Simulation & Modelling 16CSE61 Distributed Systems
22 2
16CSE52 Signals & Systems 16CSE62 Digital Signal Processing

16CSE53 Ad hoc Wireless Networks 16CSE63 Advanced Computer

Networks
33 3
16CSE54 Cryptography & Network 16CSE64 Cyber Security
Security

37
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Intelligent Systems & Analytics

Subject Subject Name Subject Subject Name
Code Code
16CSE71 Artificial Intelligence 16CSE81 Big Data Analytics

4 44
16CSE72 Pattern Recognition 16CSE82 Image Processing

16CSE73 Social & Web Analytics 16CSE83 Natural Language Processing

16CSE74 Neural Networks & Deep Learning 16CSE84 Soft Computing

Professional Core Electives for 2016-20 Batch

NOTE: Unix Programming course is the prerequisite for Advanced Unix Programming,
similarly Signals & Systemscourse is the prerequisite forDigital Signal Processing,
Image Processing is the prerequisite for Pattern Recognition, and Cryptography &
Network Security is the prerequisite for Cyber Security & Forensics.

***************

MULTICORE ARCHITECTURE AND PROGRAMMING

Sub Code : 16CSE11 Credits : 03
L+T+P+S : 3+0+0+0 Total Hours : 3

Course Objectives:
This course will enable students to:
1. Outline the principles of multi-core design and performance measurement
2. Illustrate the concept of parallelization and develop parallel programs
3. Identify the hurdles of parallelization and determine ways to handle these issues
4. Analyze the process of code optimization
5. Recognize the need and usage of multi-threading tools

38
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

UNIT – I
INTRODUCTION TO MULTI-CORE ARCHITECTURE:
Introduction, Moore’s law, Amdhal’s law, Gustafson’s law, Motivation for Multi-core
processors, Types and levels of parallelism, Flynn’s classification of multi-processors,
Introduction to parallelization and vectorization: Data dependencies, SIMD technology,
Hardware Multithreading vs. Software multi threading, Hyper threading, SMT, Case Study
of multi-core processors: Intel, AMD, IBM/Sony.
CONCEPTS AND DESIGN OF PARALLEL AND THREAD PROGRAMMING:
Definition of thread and process, Parallel programming models, Parallel Programming
constructs: Synchronization, Deadlock, Critical sections. 13 Hours

UNIT – II
THREAD PROGRAMMING: Threading APIs- Win 32, POSIX threads.
PARALLEL PROGRAMMING:
MPI Model: Collective communication, Data decomposition, Communicators and
topologies, point-to-point communication, MPI Library, OpenMP: Directives and clauses,
environment variables, Programs using OpenMP and MPI. Introduction to intel TBB,
Thread-Safeness, Cache related issues
MULTITHREADED PROGRAM DEBUGGING:
Benchmarks and other performance analysis tools, vTune Performance Analyzer, Thread
Checker. 13 Hours

UNIT – III
MULTITHREADED PROGRAM DEBUGGING: Thread Profiler, hotspots, performance
issues in algorithms, branch misprediction, cache organization, cache loads, efficiency,
hardware and software prefetch.
COMPILER OPTIMIZATIONS AND PARALLEL ALGORITHMS:
Compilers for High performance Computing, compiler optimization, code and loop
optimization, scalar and vector processing, temporal and spatial locality-matrix
multiplication example. OS support to multi-core architectures. Parallel algorithms study
and analysis - The Sieve of Eratosthenes, Floyd’s algorithm, Matrix-Vector multiplication,
Monte Carlo methods, Matrix Multiplication, Parallel Quicksort Algorithm. 13 Hours

Course Outcomes
Upon completion of this course, students will be able to:
1. Identify the concept of multi-core architecture and motivation behind it.
2. Design parallel program using the multithreading concept.
3. Develop parallel programs using parallel programming frameworks.
4. Describe the concept of multithreaded program debugging.
5. Analyze the compiler optimizations and parallel algorithms.

39
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Design / development of solutions
4. Modern tool usage
5. The engineer and society
6. Environment and sustainability
7. Ethics

TEXT BOOKS:
1. Shameem Akhter and Jason Roberts ,”Multicore programming- Increasing
performance through software multithreading”, Intel press, 2013
2. Richard Gerber, Aart J.C.Bik, Kevin B.Smith, Xinmin Tian,”The software optimization
cookbook”,High performance Recipes for IA-32 Platforms,Intel press, 2005.

REFERENCE BOOKS:
1. Steven S.Muchnick, Morgan Kaufman,“Advanced Compiler Design
Implementation”,Publishing 2000.

E-Books / Online Resources:

1. www. tutorials on introduction to parallel computing
2. http://www.cs.cmu.edu/afs/cs/user/fp/www/courses/15213-s07/lectures/27-
multicore.pdf
3. www.openmp.org for OpenMP

MOOC:
1. http://nptel.ac.in/courses/106104025/2
2. https://www.mooc-list.com/tags/parallel-programming

************************

40
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

EMBEDDED SYSTEMS
Sub Code : 16CSE12 Credits : 03
L+T+P+S : 3+0+0+0 Total Hours : 39

Prerequisite subjects:
1. Computer Organization and Architecture (CS404)
2. Microprocessors and Peripherals (CS503) – Intel 8086 to Pentium
3. Operating Systems (CS505)

Course Objectives:
This course will enable students to:
1. Explain the concepts and principles of Embedded system design.
2. Identify basic building blocks of an embedded system .
3. Assess the benefits of Intel Atom based embedded system in terms of power
consumption,
4. Analyze features of various RTOS.
5. Use Intel Atom boards in typical design of systems.
6. Compare various shared data handling techniques

UNIT - I
Embedded system definition, characteristics, design metrics; Processor, IC and design
technologies; Embedded system examples, Digital Camera building blocks, Combinational
and sequential building blocks. Use of DSP Processors, SoCs and Microcontrollers in
embedded systems. Overview of 8051 microcontroller.
Timers, ADCs, Keypad controllers, LCD controllers, stepper motor and DC motor control,
Custom Single Purpose processor design examples: GCD Generator, 4 bit multiplier,
Communication bridge. Memory – Composing memory, memory hierarchy and Cache
memory, interfacing-Serial, Parallel and Wireless Protocols. 14 Hours

UNIT – II
Introduction to Real – Time Operating Systems, features, Examples of RTOS, typical RTOS
functions. Interrupt handling and latency, Shared data problems, Tasks and Task States,
Task scheduling, Inter-task communication and synchronization, Semaphores, Message
Queues, Mailboxes and Pipes, Reentrant functions, Typical software architectures,
Embedded Software development and testing tools, JTAG debugger, typical system boot
flow diagram 13 Hours
UNIT-III
Intel ATOM Processor Architecture, Platform architecture and Micro architecture details,
Overview of Assembly language programming of ATOM Processor, Low power issues of
ATOM processor, ATOM processor series.Intel ATOM Processor kit details, I/O options
available, Keyboard and Mouse interface, GPS , GSM and RFID interface – Hands On,
Overview of Device drivers. 12 Hours
41
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Course Outcomes:
Upon completion of this course, students will be able to:
1. Identify basic building blocks of embedded systems.
2. Explain General purpose processor and the purpose of peripherals.
3. Illustrate the uses of RTOS.
4. Explain different features of real time operating systems.
5. Design an embedded system using Intel Atom boards.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Design / development of solutions
4. The engineer and society
5. Environment and sustainability

TEXT BOOKS :
1. Frank Vahid and Tony Givargis, “Embedded Systems Design – A unified
Hardware/Software Introduction”, John Wiley, 2002 (Chapter 1, 2, 4).
2. David E.Simon, “An Embedded Software Primer”, Pearson Education Asia, First
Indian Reprint 2000. (Chapter 6,7, 8, 9).
3. Kenneth Ayala, “8051 Microcontroller Architecture, Programming and
Applications”, West publishing, 1991 (Selected chapters on Architecture of 8051).

REFERENCE BOOKS:
1. Lori Matassa and Max Domeika, “ Break away with Intel Atom Processors: A guide
to Architecture Migration”, Intel Press, 2010 (Chapter 3, selected topics of Chapter
4 & 5).
2. Peter Barry, Patrik Crowley, “Modern Embedded Computing”, Morgn Kaufmann
publishers, ISBN : 978-0-12-391490-3 2012.

E-Books / Online Resources:

1. https://www.intel.com/content/www/us/en/products/processors/atom.html
2. https://en.wikipedia.org/wiki/Embedded_system

MOOC:
1. NPTEL videos on Embedded Systems.
2. Lab Manual of “ Embedded system lab with ATOM Kit & Interfaces”.

************************

42
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

OPERATIONS RESEARCH
Sub Code :16CSE13 Credits : 03
L+T+P+S : 3+0+0+0 Total Hours : 39
Course Objectives:
This course will enable students to:
1. Describe the scope and limitations of OR methods and outline the role of OR
techniques in supporting the decisions.
2. Explain the concept of Linear Programming Model (LPM) and and formulate
Linear Programming problems.
3. Describe the various methods like Simplex Method, Revised simplex Method, Big
M Method, Two Phase Method, Dual Simplex Method and duality theory and use
it on Linear Programming Problems.
4. Describe the formulation of Transportation problems, different methods in
Transportation problems and use those methods on the respective real-world
problems.
5. Describe the formulation of Assignment problems, different methods in
Assignment problems, CPM and PERT (project management techniques) and use
it on the respective real-world problems.

UNIT – I
INTRODUCTION
Introduction to OR, nature and meaning, applications, modeling in OR, phases of OR
study
LINEARPROGRAMMING
Introduction to Linear Programming through an example, graphical method ,formulation
of LP model from practical problems, assumptions and properties of linear programming,
simplex method
Revised simplex method, Big M method, 2 phase method, Duality theory, Primal and dual
relationship, Dual simplex method 14 Hours

UNIT – II
TRANSPORTATIONPROBLEMS:
Special types of main programming, transportation problems, methods to find initial
feasible solution and modification to obtain optimal solution) Degeneracy in
transportation problems, unbalanced transportation problems 13 Hours

UNIT – III
ASSIGNMENTPROBLEM

43
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Mathematical formulation of an assignment problem, unbalanced assignment problem ,

TSP, Hungarian method
CPM ,PERT
Representation of a project by a network, activities and events, starting times ,finishing
times, floats, slacks, CPM, Idea of crashing probabilistic times and PERT analysis 12 Hours
Course Outcomes:
Upon completion of this course, students will be able to:
2. Discuss the basics of OR, modelling and application of OR.
3. Define linear programming model. Formulate linear programming model and
apply linear programming model using different techniques.
4. Formulate the problem and solve the problem by using different techniques.
5. Describe mathematical formulation of an Assignment Problem and solve various
scenarios by using different methods.
6. Identify the project management techniques.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Design / development of solutions
4. The engineer and society
5. Ethics
6. Project management and finance

TEXT BOOKS:
1. S D Sharma, Himanshu Sharma,“Operations Research- Theory, Methods and
Applications”, 15th edition,2010.
2. Hamdy A Taha ,”Operations Research – An introduction”, PHI, Seventh Edition,
2002.

REFERENCE BOOKS:
1. Kantiswaroop Manmohan Gupta,P.K and ManMohan”,Operation research”, Sultan
Chand and Sons,New Delhi,2007.
2. Gillelt B G, “Introduction to operation research, a computer oriented algorithmic
approach”, McGraw Hill, 1976.

E-Books / Online Resources:

1. Fundamentals of Operations Research IIT Madras Course , Prof. G. Srinivasan

2. https://onlinecourses.nptel.ac.in/noc17_mg10/preview
3. http://nptel.ac.in/courses/112106134/#
44
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

4. http://nptel.ac.in/courses/110106062/#
5. http://nptel.ac.in/courses/112106131/#
MOOC:
1. https://onlinecourses.nptel.ac.in/noc17mg10/preview
2. https://www.coursera.org/courses/operationsresearch

****************

CAD FOR VLSI AND VHDL

Sub Code:16CSE14 Credits : 03
L+T+P+S: 3+0+0+0 Total Hours : 39
Course Objectives:
This course will enable students to:
1. Explain the VLSI and the fabrication process.
2. Carryout synthesis process
3. Give the algorithmic approach for the fabrication
4. Explain the logical synthesis process.

UNIT-I
OVERVIEW OF VLSI DESIGN:
Overview of VLSI Design: Digital Systems and VLSI: Why Design Integrated Circuits,
Integrated Circuit manufacturing, CMOS Technology, Integrated Circuit Design
Techniques, Fabrication Process, Transistors, Wires and Vias, Design Rules, Layout Design
and Tools, Static Complementary gates, Wires and delay, switch logic, layout design
methods, Combinational Logic Testing, Sequential Machines: Introduction, latches and flip
flops, FPGAs, PLAs.

HIGH LEVEL SYNTHESIS:

Synthesis, Y-chart Partitioning in High level Synthesis, Introduction, Partitioning, Basic
Partitioning Methods: Random Selection, Clustering Growth, Hierarchical Clustering
The Min-Cut Partitioning , Scheduling in High level Synthesis, Introduction , Basic
Scheduling Algorithms, Time-Constrained Scheduling, Integer Linear Programming
Method, Force-Directed Heuristic Method, Resource-Constrained Scheduling, DFG
Restructuring 14 Hours

UNIT-II
Data Path Allocation in High level Synthesis, Introduction, Allocation Tasks, Unit
Selection, Functional- Unit Binding, Storage Binding, Interconnection Binding,
Interdependence and Ordering, Allocation Methods, Greedy Constructive Approaches,
Decomposition Approaches, Clique Partitioning,, Left-Edge Algorithm, Weighted
Bipartite-Matching Algorithm. 12 Hours

45
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

UNIT-III
Logic Synthesis: Algebraic and Boolean Division Shannon’s expansion theorem, Binary
Decision Diagrams (BDD), ROBDD, ITE graphs, Combinational Optimization, PLAs, Two
level optimization PLA Folding, Multilevel logic circuits and Optimization, Physical
Synthesis: Floor Planning Placement and Routing, Compaction. VHDL, language
constructs, entity and architecture, behavioral description, structural description,
examples, Sequential Statements , Testbenches. 13 Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Explain the concepts and terms related to VLSI design.
2. Select the synthesis process and process of VLSI circuit.
3. Apply the algorithm for the VLSI design.
4. Illustrate the logic synthesis process.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Design / development of solutions
4. Modern tool usage
5. The engineer and society
6. Ethics
7. Project management and finance

TEXT BOOKS:
1. Niranjan N.Chiplunkar and Manjunath Kothari ,”VLSI CAD “, PHI Learning Pvt. Ltd.
NewDelhi, 2011.
2. Wayne Wolf ,”Modern VLSI Design “, Prentice Hall , Second Edition,1998.
3. Douglas Perry ,”VHDL Programming”, Third edition, McGraw-Hill, 2002.
4. Daniel Gajski, Nikhil Dutt, Allen C-HWunand Steve Y-L Lin ,”High level synthesis
Introduction to chip and system design” , Kluwer Academic, Norwell,1992.
REFERENCE BOOKS:
1. Gary Hatchel and Fabio somenzi, “Logic synthesis and Verification Algorithms”
,Kluwer Academic, Norwell,2001.
2. Naveed Sherwani,”Algorithms for VLSI Physical Design Automation”, Third Edition,
Springer International, 1998.
E-Books / Online Resources:
1. http://www.facweb.iitkgp.ernet.in/~isg/CAD/index.html

46
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

2. http://www.serc.iisc.ernet.in/~viren/Courses/2008/E0285.html

MOOC:
1. https://www.coursera.org/learn/vlsi-cad-logic
2. http://nptel.ac.in/courses/112102101/

************************

INTERNET OF THINGS
Sub Code: 16CSE21 Credits : 03
L+T+P+S: 3+0+0+0 Total Hours: 39

Course Objectives:
This course will enable students to:
1. Learn the IoT Definitions, Design aspects
2. Identify the IOT hardware and software requirements
3. Describe IoT logical and physical design concepts
4. Implement Arduino based IOT Projects
5. Implement Raspberry Pibased IOT Projects

UNIT – I
INTRODUCTION:
Introduction to IoT: Definition and characteristics, Physical design, Logical design,
Enablingtechnologies, Levels and deployment templates, Examples: Domain specific IoTs
IOT DESIGN AND SYSTEM ENGINEERING
Discuss IOT Requirements, Hardware & Software; Study of IOTSensors, Tagging and
Tracking, Embedded Products; IOT Design, (U) SIM Card Technology, IOT Connectivity and
Management, IOT Security & IOT Communication. 13 Hours

UNIT – II
DESIGN CONCEPTS:
IoT Logical Design: Data types, Data structures, Control flow,Functions,
Modules,Packages,File Handling,Date and time operation,Classes,Python packages of IoT,
IoT Physical Design, Basic building blocks,Raspberry Pi, Linux on Raspberry Pi, Interfaces,
Programming on Raspberry Pi with Python
ARDUINO BASED IOT PROJECT IMPLEMENTATION:
Arduino for Project development, Internet enabled Arduino powered garage door opener,
Irrigation control system, Light controller Message, controller and cloud Services
14 Hours
UNIT – III
RASPBERRY PIBASED IOT PROJECT IMPLEMENTATION:

47
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Raspberry Pi for Project Development: Raspberry Pi platform,GPIO, Establishment and

setting, of Raspberry Pi software, LAMP project, Home temperature, monitoring system,
Webcam andRaspberry Pi camera project, Introduction to Beaglebone black 12 Hours
Course Outcomes:
Upon completion of this course, students will be able to:
1. Explainthe IoT Definitions, Design aspects
2. Specify the IOT hardware and software requirements
3. Design IoT logical and physical architecture
4. Implement Arduino based IOT Projects
5. Implement Raspberry Pibased IOT Projects

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Design / development of solutions
4. Conduct investigation of complex problem
5. Modern tool usage
6. The engineer and society
7. Environment and sustainability
8. Ethics
9. Individual and team work
10. Communication
11. Project management and finance

TEXT BOOKS:
1. Arshdeep Bahga, Vijay Madisetti, “Internet of Things: A Hands-On Approach,Vijay
Madisetti”, 2014.
2. Donald Norris, “The Internet of Things: Do-It-Yourself at Home Projects for
Arduino,Raspberry Pi and BeagleBone Black”, 1st Edition, McGraw Hill, 2015.

REFERENCE BOOKS:
1. Syed ZaeemHosain, “The Definitive Guide to the Internet of Things for Business”,
Second Edition, CTO, Aeris,2016.
2. Dr .Ovidiu Vermesan, SINTEF Norway, Dr. Peter Friess ,”Internet of Things From
Research Innovation to Market Development “ , EU Belgium, River Publishers,
Aalborg,2013.
E-Books / Online Resources:
1. https://www.tutorialspoint.com/internet_of_things/internet_of_things_tutorial.pdf
2. www2.datainnovation.org/2013-internet-of-things.pdf
MOOC:
1. https://onlinecourses.nptel.ac.in/noc17_cs22/preview

48
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

2. https://www.coursera.org/learn/iot
3. https://www.class-central.com/mooc/6748/coursera-introduction-to-architecting-
smart-iot-devices.
************************

ADVANCED COMPILATION TECHNIQUES

Sub Code :16CSE22 Credits : 03
L+T+P+S : 3+0+0+0 Total Hours : 39

Course Objectives:
This course will enable students to:
1. Outline issues in compiler design and optimization
2. Bring out the issues in code generation.
3. Perform data flow analysis, Partial-redundancy elimination, Region-based
analysis; Symbolic analysis.
4. Perform Basic-block scheduling; Global code scheduling; Software pipelining.
5. Describe instruction level parallelism and optimizing for parallelism.

UNIT – I
Introduction and Review: Language processors; The structure of a Compiler; The
evolution of programming languages; The science of building a compiler; Applications of
Compiler technology; Programming language basics.
Topics in Code Generation: Issues in the design of Code Generator; Peephole
optimization; Register allocation and assignment; Instruction selection by tree rewriting;
13 Hours
UNIT – II
Topics in Code Generation: Optimal code generation for expressions; Dynamic
programming code generation.
Machine-Independent Optimizations: The principle sources of optimization;
Introduction to data flow analysis; Foundations of data flow analysis; Constant
propagation; Partial-redundancy elimination; Loops in flow graphs; Region-based analysis;
Symbolic analysis. 13 Hours
UNIT – III
Instruction-Level Parallelism: Process architectures; Code-scheduling constraints; Basic-
block scheduling; Global code scheduling; Software pipelining.
Optimizing for Parallelism and Locality: Basic concepts; An example of matrix
multiplication; Iteration spaces; Affine array indexes; Data reuse; Array data – dependence
analysis; Finding synchronization-free parallelism; Synchronization between parallel loops;
Pipelining; Locality optimizations. 13 Hours

49
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Course Outcomes:
Upon completion of this course, students will be able to:
1. Describe thebasic issues in Compiler design and Code generation.
2. Apply thecode generation techniques.
3. Perform flow analysis, Partial-redundancy elimination, Region-based analysis;
Symbolic analysis.
4. Construct Basic-block scheduling; Global code scheduling
5. Exploit Parallelism for Optimization.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Design / development of solutions
4. Conduct investigation of complex problem
5. The engineer and society
6. Ethics
7. Individual and team work
8. Project management and finance

TEXT BOOKS:
1. Alfred V Aho, Monica S. Lam, Ravi Sethi, Jeffrey D Ullman: “Compilers - Principles,
Techniques andTools”, 2nd Edition, Pearson, 2007.

REFERENCE BOOKS:
1. Charles N. Fischer, Richard J. leBlanc, Jr,”Crafting a Compiler with C”, Pearson,
1991.
2. Andrew W Apple,” Modern Compiler Implementation in C”, Cambridge University
Press, 1997.
3. Kenneth C Louden,” Compiler Construction Principles & Practice”, Cengage
Learning, 1997.

E-Books / Online Resources:

1. http://www.cs.tau.ac.il/~msagiv/courses/acd/introscribe.doc
2. http://infolab.stanford.edu/~ullman/dragon/w06/w06.html

MOOC:
1. http://nptel.ac.in/courses/106108113/
2. https://www.mooc-list.com/course/compilers-coursera

************************

50
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

ADVANCED ALGORITHMS
Sub Code : 16CSE23 Credits : 03
L+T+P+S: 3+0+0+0 Total Hours : 39

Course Objectives:
This course will enable students to:
1. To learn the graph search algorithms.
2. To study about pattern matching and string processing algorithms.
3. To understand the network flow and basic complexity classes of randomized
algorithms.

UNIT-I
Review of Analysis Techniques: Growth of Functions: Asymptotic notations; Standard
notations and common functions; Recurrences and Solution of Recurrence equations- The
substitution method, The recurrence – tree method, The master method; Amortized
Analysis: Aggregate, Accounting and Potential Methods. Graph Algorithms: Bellman -
Ford Algorithm; Single source shortest paths in a DAG. 13Hours

UNIT-II
Johnson’s Algorithm for sparse graphs, String-Matching Algorithms: Naïve string
Matching; Rabin - Karp algorithm; String matching with finite automata; Knuth-Morris-
Pratt algorithm; Boyer – Moore algorithms. 14Hours

UNIT III
Flow networks and Ford-Fulkerson method; Maximum bipartite matching;
Probabilistic and Randomized Algorithms: Probabilistic algorithms; Randomizing
deterministic algorithms, Monte Carlo and Las Vegas algorithms; Probabilistic numeric
algorithms. 12Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Analyze the problem and solve the recurrences.
2. Design and implement the graph search algorithms.
3. Design and implement the optimized pattern matching and string processing
algorithms.
4. Implement and apply the network flow problems.
5. Describe the probabilistic and randomized algorithms.

51
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Design / development of solutions
4. Conduct investigation of complex problem
5. The engineer and society
6. Environment and sustainability

TEXT BOOKS:
1. T Cormen, C Leiserson, R Rivest, and Stein, “Introduction to Algorithms”, 3rd
edition, PHI, 2007.
2. Kenneth A. Berman, Jerome L. Paul,” Algorithms”, Cengage Learning, 2002.

REFERENCE BOOKS:
1. Ellis Horowitz, Sartaj Sahini, ”Fundamentals of Computer Algorithms”, Second
Edition,Galgotia Publications,2008.
2. S.G. Akl, “Design and Analysis of Parallel Algorithms”, Prentice Hall,1989.

E-Books / Online Resources:

1. https://www.cs.duke.edu/courses/fall08/cps230/Book.pdf
2. http://people.csail.mit.edu/moitra/854.html

MOOC:
1. https://www.coursera.org/learn/advanced-algorithms-and-complexity
2. https://onlinecourses.nptel.ac.in/noc17_cs20/preview

************************

UNIX PROGRAMMING
Sub Code : 16CSE31 Credits : 03
L+T+P+S: 3 +0+0+0 Total Hours : 39

Course Objectives:
This Course will enable students to
1. Explain the unix operating system features and architecture.
2. Get to the Unix shell and Unix file system and Issue Unix commands.
3. Redirect the output of Unix commands
4. Manage, list, create, move, delete, and display files and directories

52
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

5. Ability to develop shell, awk or perl script.

UNIT – I
BACKGROUND AND SOME BASIC COMMANDS
Brief History, Salient features of a UNIX System, POSIX and the single UNIX specification,
The UNIX architecture. Locating Commands, Internal and External Commands, Flexibility
of Command usage, man: Browsing and Manual Pages On-line, Understanding the man
documentation.
cal: The Calendar, date: Displaying and System date, echo: Displaying a Message, printf:
An Alternative to echo, bc: The Calculator, script: Recording a session, passwd: Changing
your password, who: who are the users?, uname: Knowing your machine’s characteristics,
tty: Knowing your terminal, stty: Displaying and setting Terminal characteristics.
THE FILESYSTEM AND SOME FILE HANDLING COMMANDS
The File, What’s in a (File) name ?, The Parent-Child Relationship, The HOME Variable: The
Home Directory, pwd: Checking your current directory, cd: Changing the current
directory, mkdir: Making directories, rmdir: Removing directories, Absolute Pathnames,
Relative Pathnames, ls: Listing Directory contents, The UNIX file system.
Cat: Displaying and creating Files, cp: Copying a File, rm: Deleting files, mv: Renaming
files, more: Paging output, The lp Subsystem: Printing a file, file: Knowing the file types,
wc: Counting lines, words and characters, od: Displaying data in octal, cmp: Comparing
two Files, comm.: What is common?, diff: Converting one file to other.
THE VI EDITOR
Vi Basics, Input mode- Entering and replacing text, Saving text and Quoting- The ex
mode, Navigation, Editing Text, Undoing last editing instructions (u and U), Repeating the
last command(.), Searching for a pattern(/ and ?), Substitution- Search and Replace(:s),
Customizing vi.
THE SHELL
The shell’s interpretive cycle, Pattern matching- The wild-cards, Escaping and Quoting,
Redirection: The three standard file, /dev/null and /dev/tty: Two special files, pipes, tee:
Creating a Tee, Command Substitution, Shell variables.
FILE ATTRIBUTES
ls –l: listing file attributes, The –d option: Listing Directory attributes, Listing inode
number, listing hidden files, time associated with a file, listing timestamps, File ownership,
File permissions, chmod: Changing file permissions, Directory permissions, Changing file
ownership. File systems and inodes, Hard links, Symbolic Links and ln, The Directory,
umask: Default File and Directory Permissions, Modification and Access Times, find:
Locating Files. 13Hours

UNIT-II
THE PROCESS
Process basics, ps: Process status, System Processes (-e or -a), Mechanism of process
creation, Internal and External commands, Running jobs in background, nice: Job
execution with lower priority, Killing process with signals, Job control, fg and bg

53
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

commands at and batch: Execute later, cron: Running jobs periodically, time: Timing
Processes,
SIMPLE FILTERS
The sample database, pr: Paginating files, head: Displaying the beginning of a file, tail:
Displaying the end of the file, cut: slitting a file vertically, paste: Pasting files, sort:
Ordering file, uniq: Locate repeated and unrepeated lines, tr: translating characters An
example: Displaying a Word-count List.
FILTERS USING REGULAR EXPRESSIONS – grep AND sed
Searching for a pattern, Basic regular expressions (BRE) – An Introduction, Extended
regular expressions (ERE) and egrep. The stream editor, Line addressing, Using multiple
instructions (-E and -F), Context addressing, Writing selected lines to the file (w), Text
editing, Substitution. 12 Hours

UNIT-III
SHELL PROGRAMMING
Shell scripts, read: Making scripts interactive, Using command line arguments, exit and
Exit status of Command, The logical operators && and || - Conditional Execution, The if
conditional, Using test and [] to evaluate expressions, The case conditional, expr:
Computation and string handling, $0: Calling a script by different names, while: Looping,
for: looping with a list, set and shift: Manipulating the positional parameters, The here
document(<<), trap: Interrupting a program, Debugging shell script with –x
Shells and subshells, export: Exporting shell variables, Running a script in the current shell:
The. Command, let computation, Arrays, String handling, Conditional parameter
substitution, Merging streams, Shell functions, eval: Evaluating twice, The exec statement.,
awk – AN ADVANCED FILTER
Simple awk Filtering, Splitting a Line into Fields, printf: Formatting output, Variables and
Expressions, The Comparison operators, Number Processing, Variables, The –f option:
storing awk programs in a file, The BEGIN and END sections, Built in variables, Arrays,
Functions, Control flow,- the if statement, Looping with for, Looping with while.
Perl-THE MASTER MANIPULATOR
Perl preliminaries, The chop function: Removing the last character, Variables and
operators, The string handling functions, Specifying filenames in command line, $_: The
default variable, Current line number($.) and the Range operator(..), Lists and arrays,
foreach: Looping through a list, split: Splitting into a list or array, join: Joining a list,
dec2bin.pl:converting a Decimal Number to binary, grep: Searching an array for a pattern,
Associative arrays, Regular expressions and substitution, file handling, File tests,
Subroutines. 14 Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Getting familiar with the Unix environment, Executing various commands in Unix
and analyze the concept of Shell, Filesystem in Unix.

54
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

2. Understand the Process basics and file attributes. To know about the permission
related to the files and change the permission according the requirement.
3. Demonstrate the need of the filters in Unix.
4. Develop user space applications either by writing the commands in the shell
script file or writing c programs.
5. Ability to program in AWK language, Identify and analyze various Perl programs
and administrator privileges.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Modern tool usage
4. The engineer and society
5. Individual and team work
6. Project management and finance

TEXT BOOKS:
1. Sumitaba Das ,”UNIX-Concepts and Applications”, Fourth Edition, Tata McGraw
Hill, 2006.(Chapters 1.1,1.2,2,3,4,5,6,7,8,9,11,12,13,14,19,21).
2. Behrouz A. Forouzan and Richard F. Gilberg ,”UNIX and Shell
Programming”,Thomson 2005. (Chapters Appendix H,9 ).

REFERENCE BOOKS:
1. M.G. Venkateshmurthy ,”Unix and Shell Programming”, Pearson Education, 2005.

E-Books / Online Resources:

1. http://www.freebookcentre.net/UnixCategory/Free-Unix-Books-Download.html
2. https://lecturenotes.in/subject/535/unix-shell-programming-usp

MOOC:
1. http://nptel.ac.in/courses/106108101/20
2. https://www.coursera.org/learn/unix

************************

55
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

PROGRAM VERIFICATION
Sub Code : 16CSE32 Credits : 03
L+T+P+S: 3+0+0+0 Total Hours : 39

Course Objectives:
This course will enable students to:
1. Apply the mathematical and logical concepts for programming.
2. Explain various Programming paradigms.
3. Indentify the specifications of a sequential program.
4. Write simple program using Dafny.
5. Perform program verification using Dafny.

UNIT I
BACKGROUND AND INTRODUCTION:
Sequential, concurrent, and reactive systems, Programming languages and paradigms,
Type systems of programming languages, Assigning meaning to programs, operational
semantics denotational semantics, Partial and total correctness, Hoare triples, Logic for
Program Design : Propositional Calculus, Predicate Calculus.
MATHEMATICAL AND LOGICAL FOUNDATIONS:
Mathematics for Specification: Sets, Relations, Functions and Sequences. Pre conditions,
Post conditions Loop invariants. 14 Hours

UNIT II
SPECIFICATION OF PROGRAMS:
Variant functions, the state model of programs, Partial and total correctness, Weakest
precondition, Guarded commands, Why functional programming matters, Algebraic data
types, Higher order functions.
PROGRAM VERIFICATION USING DAFNY PART-I
Methods and functions, pre and post conditions, Assertions, loop invariants, termination,
quantifiers, framing, Binary search—an example. 14 Hours

UNIT III
PROGRAM VERIFICATION USING DAFNY PART-II:
Predicates, sets, sequences, collections, Lemmas, modules: Declaring a new module,
Import and export new module, opening modules. 11Hours
Course Outcomes:
Upon completion of this course, students will be able to:
1. Identify various paradigms related to programming.
2. Build logical and mathematical specifications for program
3. Testing for specifications of the program.
4. Design and write simple Dafny programs and learn basic syntax.

56
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

5. Apply advanced Dafny tool for program verification.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Modern tool usage
4. The engineer and society
5. Ethics
6. Communication

TEXT BOOKS:
1. Geoff Dromey, “Program Derivation”,International Computer Science Series.
Addison-Wesley. 1989.
2. Michael Huth and Mark Ryan ,”Logic in Computer Science - Modeling and
Reasoning about Systems”, Cambridge University Press. 2004.

REFERENCE BOOKS:
1. Jacques Loeckx, Kurt Sieber,”The Foundation of Program Verification”, Second
Edition,Wiley,India,2013.

E-Books / Online Resources:

1. http://research.microsoft.com/en-us/projects/dafny/Microsoft Research.
2. https://www.springer.com/in/book/9780792319658

MOOC:
1. http://nptel.ac.in/courses/106102013/

************************

CLOUD COMPUTING
Sub Code : 16CSE33 Credits : 03
L+T+P+S : 3+0+0+0 Total Hours : 39

Course Objectives:
This Course will enable students to:
1. Outline the fundamental ideas behind Cloud computing, and the evolution of the
paradigm, its applicability; benefits as well as current and future challenges.
2. Get the basic idea and principles in Datacenter design and Management and find
the importance of Virtualization in Cloud.
57
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

3. Get the idea of different Cloud deployment models and Cloud Delivery Models
and their security issues.
4. Tell how Cloud Computing solves different problems in the present by considering
different Cloud Vendors and their Cloud Design architecture.

UNIT – I
Eras of computing, Parallel vs. Distributed Computing, Elements of Parallel Computing-
(What is parallel computing , hardware architecture for Parallel processing, approaches to
parallel programming, levels of parallelism, Laws of caution). Elements of Distributed
Computing- (General concepts and definitions, components of a distributed system,
Architectural styles for distributed computing, models for inter-process communication,
Technologies for distributed computing-Remote procedure call, Service oriented
computing).
Classic data center, its elements, challenges and benefits. Data center management Steps
in transitioning to cloud- consolidation, automation, IT as a service.
Cloud computing Architecture: - Introduction, Cloud reference models- (Architecture,
Infrastructure/Hardware as a service, Platform as a service, Software as a service), Types of
cloud – (Public Clouds, Private Clouds, Hybrid Clouds, Community Clouds), Economics of
cloud, Open challenges. 14 Hours

UNIT – II
Virtualization: – Introduction, characteristics of virtualized environments, taxonomy of
virtualization technique- (execution of virtualization, other types of virtualization-
Compute, Storage, Network, Desktop, Application). Virtualization and cloud computing,
Pros and Cons of virtualization, Technology examples- XEN, VMware, Microsoft Hyper-V.

Security Concerns, Risk Issues:- Cloud Computing- Security Concerns. A Closer

Examination: Virtualization, A Closer Examination: Provisioning.
Securing the Cloud: Key Strategies and Best Practices: - Overall Strategy: Effectively
Managing Risk-Risk Management: Stages and Activities. Overview of Security Controls,
Cloud Security Controls Must Meet Your Needs, NIST Definitions for Security Controls,
Unclassified Models, Classified Model The Cloud Security Alliance Approach. The Limits of
Security Controls - Security Exposure Will Vary over Time, Exploits Don’t Play Fair. Best
Practices: Best Practices for Cloud Computing- First Principals, Best Practices across the
Cloud Community .Other Best Practices for Cloud Computing- Cloud Service Consumers,
Cloud Service Providers. Security Monitoring. 14 Hours

UNIT –III
The Purpose of Security Monitoring, Transforming an Event Stream, The Need for C.I.A. in
Security Monitoring, the Opportunity for MaaS.
Case studies: Public cloud- AWS, Windows Azure, Google App Engine. Private Cloud-
Open stack, Eucalyptus. 11 Hours

Course Outcomes:
58
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Upon completion of this course, students will be able to:

1. Define the concept of cloud computing business need and various
networking methods.
2. Express the infrastructure management for cloud environment.
3. Practice the Virtualization at all levels using technology XEN, Vmware,
Microsoft Hyper-v.
4. Explain the security concepts in cloud computing and securing the cloud.
5. Practice the case studies of public cloud such as AWS, Google App Engine
and private cloud such as Open Stack.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Modern tool usage
4. The engineer and society
5. Individual and team work
6. Communication
7. Project management and finance

TEXT BOOKS:
1. Buyya, Rajkumar, Christian Vecchiola and Thamarai Selvi, "Mastering Cloud
Computing Fundamentals and Applications Programming", McGraw Hill, 2013.
2. G, Somasundarm and Alok Srivatsa, "Information Storage and Managemnt.", EMC
Education Services, Wiley Publishing Inc., 2009.
3. Sitaram, Dinakar and Geetha Manjunath,"Moving to the Cloud - Developing Apps
in the World of Cloud Computing " ,Elsevier, 2012.
4. Sosinsky, Barrie,"Cloud Computing Bible.", Wiley India Pvt. Ltd , 2013.
5. Winkler, Vic(J.R), "Securing the Cloud - Cloud Computer Security Techniques and
Tactics.",Elsevier Inc, 2012.

REFERENCE BOOKS:
1. Hurwitz, Judith, "Cloud computing for dummies." ,Wiley India Pvt Ltd, 2011.
2. Rittinghouse, John,"Cloud computing – implementation, management and
security",CRC Press, First edition, 2009.
3. Velte, Toby, Anthony Velte and Robert Elsenpete. "Cloud Computing, A Practical
Approach.",Tata McGraw-Hill Authors, 2010.

E-Books / Online Resources:

1. www.motc.gov.qa/sites/default/files/cloud_computing_ebook.pdf
2. http://eddiejackson.net/web_documents/The_Definitive_Guide_to_Cloud_Computi
ng.pdf
59
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

MOOC:
1. http://nptel.ac.in/courses/106106129/28
2. https://www.coursera.org/learn/cloud-computing

************************

WEB PROGRAMMING

Sub Code : 16CSE41 Credits : 03

L+T+P+S : 3+0+0+0 Total Hours : 39

Course Objectives:
This Course will enable students to:
1. Design static web pages using HTML5 and Cascading Style Sheets (CSS).
2. Develop client side validations using JavaScript.
3. Develop the server side script using PHP and introduce AJAX concepts.
4. Design modern web applications using Bootstrap.
5. Develop AngularJS script at the client side.

UNIT I
HTML5:
Overview of HTML5, New features in HTML5, Removed elements from HTML, HTML5
Semantic elements, HTML5 input types, HTML5 new form elements and attributes, HTML5
Video and Audio.
CASCADING STYLE SHEETS (CSS): Introduction, Levels of style sheets, style specification
formats, selector forms, Property Value forms, Font properties, List properties, Color,
Alignment of Text, The Box model, Background images, The <span> and <div> tags,
Conflict resolution.
THE BASICS OF JAVASCRIPT:
Overview, Object orientation and JavaScript, General syntactic characteristics, Primitives,
Operations, and Expressions, Screen output and keyboard input, control statements,
Object creation and modification, Arrays, Functions, Constructors, Patterns matching
using Regular Expressions, Errors in Scripts. 13 Hours

UNIT II
JAVASCRIPT AND XHTML DOCUMENTS:
The JavaScript Execution Environment, The Document object model, Element access in
JavaScript, Events and Event handling, Handling events from Body elements, Handling
events from Button elements, Handling events from Text Box and Password elements, The
DOM 2 Event Model, The navigator Object.
INTRODUCTION TO PHP:
Origins and uses of PHP, Overview of PHP, General syntactic characteristics, Primitives,
Operations and Expressions, Output, Control statements, Arrays, Functions, Pattern
60
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Matching, Form handling, Files, Cookies, Session tracking, Database access with PHP and
MySQL.
INTRODUCTION TO AJAX:
Overview of Ajax, The basics of Ajax, Example programs using GET and POST method.
13 Hours
UNIT III
BOOTSTRAP:
What is Bootstrap? Why use Bootstrap? Where to get Bootstrap? Bootstrap CDN, First
Web Page with Bootstrap, Bootstrap Grid system, Contextual Colors and Backgrounds,
Bootstrap Tables, Bootstrap Images, Bootstrap Jumbotron and Page Header,
Bootstrap Wells, Bootstrap Alerts, Bootstrap Buttons, Bootstrap Badges and Labels,
Bootstrap Progress Bars, Bootstrap List Groups, List Group With Badges, Tabs, Tabs With
Dropdown Menu, Pills, Bootstrap Navigation Bar, Bootstrap Forms, Bootstrap Form Inputs,
Bootstrap Media Objects, Bootstrap Carousel Plugin.
AngularJS:
Introduction, AngularJS Expressions, Numbers, Strings, Objects, Arrays, AngularJS
Expressions vs. JavaScript Expressions, AngularJS Modules, AngularJS Directives, Data
Binding, Repeating HTML Elements, Create New Directives, AngularJS Controllers,
Controller Methods, AngularJS ng-model Directive, AngularJS Scope, AngularJS Filters,
AngularJS Services, AngularJS AJAX - $http, JSON, AngularJS Tables. 13 Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Design static web pages using HTML5 and Cascading Style Sheets (CSS).
2. Develop client side validations using JavaScript.
3. Develop the server side script using PHP and introduce AJAX concepts.
4. Design modern web applications using Bootstrap.
5. Develop interactive AngularJS script at the client side.
Graduate Attributes (GA)
This course will map the following GA as per NBA:
1. Design / development of solutions
2. Modern tool usage
3. The engineer and society
4. Ethics
5. Individual and team work
6. Communication
7. Project management and finance

TEXT BOOKS:
1. Robert W. Sebesta, “Programming the World Wide Web”, Fourth Edition, Pearson,
2014.

61
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

2. Jake Spurlock, “Bootstrap-Responsive Web Development”, O’Reilly publications,

2013.
3. Ari Lerner, Ng-book, “The complete book on Angular JS”, 2013.

REFERENCE BOOKS:
1. M. Deitel, P.J. Deitel, A. B. Goldberg,”Internet & World Wide Web How to
Program”, Third Edition, Pearson education, 2004.
2. Chris Bates,”Web Programming Building Internet Applications”, Third Edition,
Wiley India, 2006.

E-Books / Online Resources:

1. https://www.cs.uct.ac.za/mit_notes/web_programming.html
2. http://www.multitech.ac.ug/uploads/IntroductiontoWebProgramming.pdf

MOOC:
1. http://nptel.ac.in/courses/106106156/2
2. https://www.coursera.org/learn/web-development

************************

MOBILE APPLICATION DEVELOPMENT

Sub Code : 16CSE42 Credits : 03
L+T+P+S: 3+0+0+0 Total Hours : 39

Course Objectives:
This course will enable students to:
1. Describe the architecture and overview of android.
2. Develop a mobile application on android platform using UI components and
Android Components.
3. Explain data handling in Android Develop a mobile application on android
platform using SQLite
4. Describe Android web service.
5. Develop application to demonstrate google map and navigation.

UNIT – I
INTRODUCTION AND OVERVIEW:
Mobility landscape, Mobile platforms, Mobile apps development, Overview of Android
Platform, setting up the mobile app development environment along with an emulator in
Android Studio, Hello World Example.
USER INTERFACE DESIGNING:

62
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

App user interface designing – mobile UI Layout (Layout, View) UI

Control(TextView,EditText,Button,ImageButton,ToggleButton,RadioGroup,RadioButton,Ch
eckBox, ProgressBar, Spinner, DayPicker, TimePicker), Draw-able, Menu (Option, Context,
Popup). 13 Hours
UNIT – II
ANDROID APPLICATION COMPONENT:
Activity –states and life cycle, interaction amongst activities. Services – state and lifecycle.
Notifications, Broadcast Receivers, Content Provider, Fragments. Intents: Implicit and
Explicit Intent
APP FUNCTIONALITY BEYOND USER INTERFACE:
Threads, Async task, Notification, Location Based Service, Telephony and SMS APIs, Text
to Speech, Camera 13 Hours
UNIT – III
DATA HANDLING:
Shared preferences, mobile databases such as SQLite, and enterprise data access, Android
multimedia: Multimedia-audio/video playback and record. Sensors: Location awareness
and native hardware access (sensors such as accelerometer and gyroscope). Android Web
Service and web applications, Android Google Maps, Android Bluetooth, Navigation.
13 Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Android Platform, Android Studio Environment
2. Android UI Components, Android Application Components
3. Develop Application using SQLite
4. Develop Application For Sensor, Android Bluetooth.
5. Develop Application For Android google map.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Problem Analysis
2. Design / development of solutions
3. Conduct investigation of complex problem
4. Modern tool usage
5. Engineering Knowledge
6. Problem Analysis
7. Design / development of solutions

TEXT BOOKS:
1. Anubhav Paradhan, Anil V Deshpande, “Mobile apps Development”,First Edition,
Wiley, 2014.

63
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

2. Barry Burd , “Android Application Development All in one for Dummies”, Second
Edition Wiley, 2015.
3. SAMS,”Teach Yourself Android Application Development in 24 Hours”,First
Edition,Sams Publishing,2010.

REFERENCE BOOKS:
1. Wei-Meng Lee,”Beginning Android Application Development”,Wrox Publication,2011.
2. Reto Meier,”Professional Android 4 Application Development”, Wrox Publication,2012.

E-Books / Online Resources:

1. https://www.tutorialspoint.com/android/index.htm
2. https://www.javatpoint.com/android-tutorial
3. https://developer.android.com/guide/

MOOC
1. http://nptel.ac.in/courses/106101163/56
2. http://nptel.ac.in/courses/106106156/

************************

ADVANCED UNIX PROGRAMMING

Sub Code : 16CSE43 Credits : 03
L+T+P+S : 3+0+0+0 Total Hours : 39

Course Objectives:
This course will enable students to:
1. List the file APIs and Write and execute file handling programs.
2. Explain the concept of processes and its environment.
3. Implement programs to handle processes in Linux platform.
4. Apply inter process communication concept for data exchange between programs.
5. Demonstrate the concepts of signals and timers.

UNIT – I
The POSIX standards. File types. General File APIs, File handling programs,
Makefileintroduction, creation and execution of make file.The Process: Introduction,
Mechanism for creating process. The UNIX Kernel support for process. The environment
of a unix process: Introduction, main function, Process Termination, Command line
arguments, Environment List, Memory layout Of a C program, Memory allocation,
Environment variables, functions. 14 Hours
UNIT – II

64
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Setjmp and longjmp functions, getrlimit, setrlimit Process Control: Introduction, Process
Identifiers, fork, vfork, exit, wait, waitpid, Wait3, wait4 functions, Race conditions, exec
functions, Interpreter files, System Function.Signals: The Unix Kernel Support for signals,
Signal, Signal mask, Sigaction,The SIGCHLD Signal and waitpid functions,The sigsetjmp
and siglongjmp Functions, Kill, Alarm, Interval Timers, POSIX .1b Timers. 13 Hours

UNIT – III
Daemon processes: Introduction, Daemon Characteristics, Coding Rules. Interprocess
communications: Overview of IPC Methods, Pipes, popen, Pclose functions, FIFOs,
Message Queues, Semaphores, Shared Memory. SOCKETS: Introduction, functions,
Client/Server Message Handling Example. 12 Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Define and discuss the POSIX standard and different types of files.
2. Explain and apply various APIs for file handling.
3. Illustrate the representation of a process and its environment and apply various
process APIs for handing the processes
4. Explain the concept of signal and its handling methods. Use the signal handling
APIs in programs.
5. Describe and implement the concepts of demon process and inter process
communication.
Graduate Attributes (GA)
This course will map the following GA as per NBA:
1. Problem Analysis
2. Design / development of solutions
3. Conduct investigation of complex problem

TEXT BOOKS:
1. Terrence Chan,“UNIX System Programming Using C++”, Prentice Hall India,1999.
2. W.Richard Stevens,” Advanced Programming in the UNIX Environment”, Addison –
Wesley/PHI,2013.
3. Sumitaba Das, “UNIX-Concepts and Applications”, Fourth Edition, Tata McGraw
Hill, 2006. (Chapter 9).

REFERENCE BOOKS:
1. Maurice.J.Bach,”The Design of the Unix Operating System”, Pearson Education
/Prentice Hall of India,First Edition,1986.
2. Uresh Vahalia,” UNIX Internals, Pearson Education”, ASIA, 2001.
3. R. Stones, N. Matthew, “Beginning Linux Programming”, Wrox publication, Fourth
Edition,2007.

E-Books / Online Resources:

65
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

1. http://www.codeman.net/wp-content/uploads/2014/04/APUE-3rd.pdf
2. richard.esplins.org/static/downloads/linux_book.pdf
MOOC
1. http://nptel.ac.in/courses/106101163/56
2. http://nptel.ac.in/courses/106106156/

************************

SOFTWARE ARCHITECTURE
Sub Code : 16CSE44 Credits : 03
L+T+P+S: 3+0+0+0 Total Hours : 39

Course Objectives:
This course will enable students to:
1. Outlines how the architecture is influenced by organizational requirements and
2. development strategies.
3. Develop architecture using different architecture styles.
4. Make use of different case studies to analyze the architecture.
5. Choose different architectural pattern and design patterns to design the
architecture that
6. yields system that has new organizational capabilities and requirements.
7. Document the software architecture.
UNIT-I
INTRODUCTION: The Architecture Business Cycle: Where do architectures come from?
Software processes and the architecture business cycle; What makes a “good”
architecture? What software architecture is and what it is not; Other points of view;
Architectural patterns, reference models and reference architectures; Importance of
software architecture; Architectural structures and views.
QUALITY: Functionality and architecture; Architecture and quality attributes; System
quality attributes; Quality attribute scenarios in practice; Other system quality attributes;
Business qualities; Architecture qualities. Achieving Quality: Introducing tactics; Availability
tactics; Modifiability tactics; Performance tactics; Security tactics; Testability tactics;
Usability tactics. 13 Hours

UNIT II
ARCHITECTURAL STYLES AND CASE STUDIES: Architectural styles; Pipes and filters;
Data abstraction and object-oriented organization; Event-based, implicit invocation;
Layered systems; Repositories; Interpreters; Process control; Other familiar architectures;
Heterogeneous
architectures. Case Study: Mobile robotics.

66
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

ARCHITECTURAL PATTERNS :Introduction, Distributed Systems: Broker; Interactive

Systems: MVC, Presentation-Abstraction-Control. Adaptable Systems: Microkernel.
13 Hours

UNIT-III
SOME DESIGN PATTERNS: Structural decomposition: Whole – Part; Organization of
work: Master – Slave; Access Control: Proxy.
DESIGNING AND DOCUMENTING SOFTWARE ARCHITECTURE: Architecture in the life
cycle; designing the architecture; Forming the team structure; Creating a skeletal system.
Uses of architectural documentation; Views; choosing the relevant views; Documenting a
view; Documentation across views. 13 Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Identify the requirements which influence the architecture and development
strategy.
2. Recognize architecture styles to design the architecture.
3. Analyze the architecture using different case studies and quality attributes.
4. Apply different architecture patterns and design patterns to develop architecture
that yields the system that has new organizational capabilities and requirements.
5. Make use of different views to document the architecture.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Design / development of solutions
4. Conduct investigation of complex problem
5. Modern tool usage
6. The engineer and society
7. Environment and sustainability
8. Ethics
9. Individual and team work

TEXT BOOKS:
1. Len Bass, Paul Clements, Rick Kazman,“Software Architecture in
Practice”,SecondEdition, Pearson Education, 2003.
2. Frank Buschmann, Regine Meunier, Hans Rohnert,Peter Sommerlad, Michael Stal,
“Pattern-Oriented Software Architecture”, A System of Patterns -Volume 1 , John
Wiley and Sons, 2006.
3. Mary Shaw and David Garlan, “Software Architecture-Perspectives on an
Emerging Discipline”, Prentice-Hall of India, 2007.
67
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

REFERENCE BOOKS:
1. E. Gamma, R. Helm, R. Johnson, J. Vlissides, “Design Patterns- Elements of
Reusable Object-Oriented Software “, Addison- Wesley, 1995.

E-Books / Online Resources:

1. http://www.hillside.net/patterns/
2. https://www.cs.cmu.edu/afs/cs/project/vit/ftp/pdf/intro_softarch.pdf
3. https://www.ics.uci.edu/~yuzok/software-architecture.html

MOOC:
1. http://www.nptel.ac.in/syllabus/106104027/
2. https://www.coursera.org/learn/software-architecture

************************

SYSTEM SIMULATION & MODELLING

Sub Code : 16CSE51 Credits : 03
L+T+P+S : 3+0+0+0 Total Hours : 39

Course Objectives:
This Course will enable students to:
1. Brief the appropriateness of the Simulation, its application, types of simulation
model steps in simulation study and general principles in simulation.
2. Illustrate the use of Random-Number Generation and Random-Variate Generation
techniques.
3. Highlight the issues connected with input modeling.
4. Identify various Verification And Validation Of Simulation Models
5. Discuss some of issues associated with Simulation Of Computer Systems

UNIT – I
INTRODUCTION TO SIMULATION:
When Simulation is the Appropriate Tool; When Simulation Is Not Appropriate;
Advantages and Disadvantages of Simulation; Areas of Application; Systems and System
Environment; Components of a System; Discrete and Continuous Systems; Model of a
System; Types of Models; Discrete-Event System Simulation; Steps in a Simulation Study.
General Principles: Concepts in Discrete-Event Simulation: The Event-Scheduling / Time-
Advance Algorithm, World Views, Manual simulation Using Event Scheduling.
13 Hours

UNIT – II
RANDOM-NUMBER GENERATION:
Properties of Random Numbers; Generation of Pseudo-Random Numbers; Techniques for
Generating Random Numbers; Tests for Random Numbers. Random-Variate Generation:
68
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Inverse Transform technique: Exponential Distribution, Uniform Distribution, Discrete

Distributions; Acceptance-Rejection Technique: Poisson Distribution. Input Modeling:
Data Collection; Identifying the distribution with Data; Parameter Estimation; Goodness of
Fit Tests; Selecting Input Models without Data; Multivariate and Time-Series Input Models.
13 Hours

UNIT – III
VERIFICATION AND VALIDATION OF SIMULATION MODELS:
Model Building, Verification and Validation; Verification of Simulation Models; Calibration
and Validation of Models. Simulation of Computer Systems: Introduction; Simulation
Tools; Model Input; High-Level Computer-System Simulation; CPU Simulation; Memory
Simulation. 13Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Find and summarize the suitability of the Simulation, its application, types of
simulation model steps in simulation study and general principles in simulation.
2. Apply the Random-Number Generation and Random-Variate Generation
techniques in practice.
3. Tell the issues connected with input modeling
4. Make use of various Verification And Validation Of Simulation Models
5. Outline some of issues associated with Simulation Of Computer Systems

Graduate Attributes (GA)

1. Engineering Knowledge
2. Problem Analysis
3. Design / development of solutions

TEXT BOOKS:
1. Jerry Banks, John S. Carson, Barry L. Nelson, David M. Nicol, “Discrete-Event System
Simulation”,Third Edition, Prentice-Hall India,2000

REFERENCE BOOKS:
1. Averill M. Law, W. David Kelton, “Simulation Modeling and Analysis” ,Third
Edition, McGrawHill,2000.
2. Geoffrey Gordon, “System Simulation”, Second Edition, Prentice-Hall India,1978.

E-Books / Online Resources:

1. https://ptolemy.berkeley.edu/books/Systems/PtolemyII_DigitalV1_02.pdf
2. https://epdf.tips/system-modelling-and-simulation.html

MOOC:
1. https://www.coursera.org/learn/modeling-simulation-natural-processes
69
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

2. http://www.nptelvideos.com/lecture.php?id=10907

************************

SIGNALS AND SYSTEMS

Sub Code : 16CSE52 Credits : 03
L+T+P+S: 3+0+0+0 Total Hours : 39

Course Objectives:
This course will enable the student to:
1. Explain the concept of signals.
2. Formulate the signal in the form of equations.
3. Represent the signal in Fourier form and apply this.
4. Perform Z transform on the signals.

UNIT – I
INTRODUCTION:
Definitions of a signal and a system, classification of signals, basic operations on signals,
elementary signals, systems viewed as interconnections of operations, properties of
systems. Time-domain representations for LTI Systems: Convolution, impulse response
representation, properties of impulse response representation, differential and difference
equation representations, block diagram representations. 13Hours

UNIT – II
FOURIER REPRESENTATION FOR SIGNALS :
Introduction, Fourier representations for four signal classes, orthogonality of complex
sinusoidal signals, DTFS representations, continuous-tine-Fourier-series representations,
DTFT and FT representations, properties of Fourier representations. Application of Fourier
representations : Frequency response of LTI systems, solution of differential and
difference equations using system function, Fourier transform representations for periodic
signals, sampling of continuous time signals and signal reconstruction. 13Hours

UNIT – III
Z-TRANSFORMS
Introduction, Z-transform, properties of ROC, properties of Z-transforms, inversion of Z-
transforms, transforms analysis of LTI systems, transfer function, stability and causality,
unilateral Z-transforms and its application to solve difference equations 13Hours

70
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Course Outcomes:
Upon completion of this course, students will be able to:
1. Classify different types of signals and systems.
2. Find the output of a LTI system.
3. Formulate the basic operations on signals.
4. Demonstrate system using differential/difference equation
5. Analyze signals & LTI systems in frequency & Z domain.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Design / development of solutions
4. Ethics

TEXT BOOK:
1. Simon Haykin and Barry Van Veen, “Signals and Systems”, John Wiley and Sons,
2001, Reprint 2002(Chapters : 1.1 to 1.8, 2.2 to 2.5, 3.1 to 3.6, 4.2 to 4.3, 4.7, 7.1 to
7.6, 7.8).

REFERENCE BOOKS:
1. Alan V. Oppenheim, Alan S. Willsky and S. Hamid Nawab, “Signals and Systems”,
Pearson Education Asia,Second edition, 1997, Indian reprint 2002.
2. Dr. D.ganesh Rao and Satish Tunga, “Signals and Systems-A Simplified Approach”,
Sanguine Technical Publishers, 2003-04.

E-Books / Online Resources:

1. http://jpkc.gnnu.cn/jpkc/Signal/ziliaoxiazai/OppenheimSignalsAndSystems.pdf
2. https://web.itu.edu.tr/hulyayalcin/Signal_Processing_Books/Signals_and_Systems.
pdf

MOOC:
1. https://ocw.mit.edu/resources/signals-and-systems-spring-2011/video-lectures/
2. https://www.coursera.org/courses/signalsandsystems

************************

71
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

ADHOC WIRELESS NETWORKS

Sub Code : 16CSE53 Credits : 03

L+T+P+S: 3+0+0+0 Total Hours: 39

Course Objectives:
This course will enable students to:
1. Distinguish the characteristics of ad hoc wireless networks with other wireless
networks.
2. Identify Ad-Hoc wireless networks, issues, classification of MAC Protocols.
3. Describe and distinguish different types of ad hoc Routing Protocols, TCP over Ad
hoc Protocol and a brief introduction to security issues in ad hoc wireless
networks.
UNIT – I
Review of Wireless Networks: IEEE Wireless Standard, Basic 802.11 MAC layer
mechanisms, CSMA/CA mechanisms and other MAC layer functionalities.
Ad hoc Networks: Introduction, Issues in Ad Hoc wireless networks, Ad hoc wireless
internet.
MAC Protocols for Ad hoc wireless Networks: Introduction, Issues in designing a MAC
Protocol for Ad hoc wireless Networks, Design goals of a MAC protocol for Ad hoc
wireless Networks.
Classification of MAC Protocols: Contention based protocols: MACAW, FAMA busy tone
protocols, receiver initiated protocol: MARCH. Contention based protocols with
reservation mechanisms: DPRMA, HRMA, FPRP. Contention-based MAC protocols with
scheduling mechanism: DPS&MA.
Routing protocols for Ad hoc wireless Networks: Introduction, Issues in designing a
routing Protocol for Ad hoc wireless Networks, Classification of routing Protocols.
14 Hours

UNIT – II
Table drive routing protocol: DSDV, WRP, CGSR. On-demand routing protocol: DSR,
AODV, LAR, FORP.
Hybrid routing protocol: CEDAR, ZRP. Hierarchical routing protocols: FSR. Metrics used
by power aware routing protocols.
Transport layer protocols for Ad hoc wireless Networks: Introduction, Issues in
designing a transport layer Protocol for Ad hoc wireless Networks, Design goals of a
transport layer protocol for Ad hoc wireless Networks, Classification of transport layer
solutions, TCP over Ad hoc wireless Networks: TCP-F, TCP with ELFN, TCP-BuS, ATCP, Split
TCP. Other transport layer protocols for Ad hoc wireless Networks: ACTP, ATP. 14 Hours

UNIT –III

72
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Security in wireless Ad hoc wireless Networks: Network Security requirements, Issues

& Challenges in security provisioning, Network security attacks, Key Management, Secure
routing in Ad hoc wireless Networks: SAR, SEAD, Security-Aware AODV.
Quality of service in Ad hoc wireless Networks: Introduction, Issues & challenges in
providing QoS in Ad hoc wireless Networks, Classification of QoS solutions, MAC layer
solutions, network layer solutions. 11 Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Define the MAC layer functionalities of wireless networks.
2. Define the working of major MAC layer protocols for ad hoc wireless networks
3. Classify and distinguish Network layer protocols for ad hoc wireless networks.
4. Identify the issues with TCP/IP Transport layer protocols with wireless networks
and examine few solutions provided by ad hoc transport layer protocols.
5. Identify security and QoS issues and challenges with ad hoc wireless networks.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Design / development of solutions
3. Conduct investigations of complex problems
4. Communication

TEXTBOOKS:
1. Siva Ram Murthy and B S Manoj, “Ad Hoc Wireless Networks: Architectures and
Protocols”, Second Edition, C. Pearson Education, 2005.

REFERENCE BOOKS:
1. Prasant Mohapatra and Srikanth Krishnamurthy, “Ad Hoc Networks: Technologies
and Protocols”, Springer Science, 2005.
2. Subir Kumar Sarkar, T G Basavaraju and C Puttamadappa, “Ad Hoc Mobile
Wireless Networks: Principles, Protocols, and Applications”, Auerbach
Publications, 2007.
3. SudipMisra, Isaac Woungang, Subhas Chandra Misra, “Guide to Wireless Ad Hoc
Networks”, Springer-Verlag, 2009.
4. Mohammad Ilyas , “The Handbook of Ad Hoc Wireless Networks”, Editor, CRC
Press, 2003.
5. C. K. Toh ,”Ad hoc Mobile Wireless Networks: Protocols & Systems”, Prentice-Hall
PTR, 2002.

73
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

E-Books / Online Resources:

1. https://www.springer.com/in/book/9781848003279
2. https://www.springer.com/in/book/9783319744384
3. https://www.sciencedirect.com/journal/ad-hoc-networks

MOOC:
1. https://swayam.gov.in/course/4408-wireless-adhoc-and-sensor-networks
2. http://nptel.ac.in/courses/106105160/
3. https://onlinecourses.nptel.ac.in/noc17_cs07/

************************

CRYPTOGRAPHY AND NETWORK SECURITY

Sub Code : 16CSE54 Credits : 03
L+T+P+S : 3+0+0+0 Total Hours : 39

Course Objectives:
This Course will enable students to:
1. Outline the basic principles of Network security and its applications .
2. Classify various block ciphers and design various cryptographic algorithms .
3. Use the theorems needed for cryptographic operations and compare & contrast
different types of cryptography.
4. State the concepts & uses of Digital signature and web security.
5. Demonstrate the need and summarize the concept of Secure Electronic
Transactions & Intrusion detection system.

UNIT – I
Overview: Services, Mechanisms and Attacks. A Model of Network Security. Conventional
Encryption Techniques: Symmetric Cipher Model, Substitution Techniques, Transposition
Techniques, Steganography. Block Cipher and the Data Encryption Standard: Simplified
DES. Block Cipher Principles. The Data Encryption Standard, The Strength of DES,
Differential and Linear Cryptanalysis, Block Cipher Design Principles, Block Cipher Modes
of Operations. Triple DES, Blowfish, Random Number Generation. 14 Hours

UNIT – II
Number Theory: Prime Numbers, Fermat’s and Euler’s Theorems, Public-Key
Cryptography and RSA: Principles of Public-Key Cryptosystems, The RSA Algorithm, Key
Management, Diffie- Hellman Key Exchange. Elliptic Curve Cryptography. Digital
signature, DSS.Network Security: Electronic Security Pretty good privacy, IP Security

74
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

overview, IP Security architecture, Authentication Header, Encapsulating security payload,

Combining Security Associations. 14 Hours
UNIT –III
Web Security: Web Security Requirements, Secure Sockets Layer and Transport Layer
Security, Secure Electronic Transaction. Intruders, Viruses, and Worms: Viruses and
Related Threats, Firewalls: Firewall Design Principles, Trusted Systems. 11 Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Explain basic network security model and its applications.
2. Classify various block ciphers and its usages.
3. Illustrate the concept public key cryptography & apply digital signatures in email
processing.
4. Describe different techniques used in key exchange protocols.
5. Explain usages of email-security, IP security and web security.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Design / development of solutions
4. Conduct investigations of complex problems

TEXT BOOKS:
1. William Stallings, “Cryptography and Network Security”, Third Edition, Pearson
Education, 2003.

REFERENCE BOOKS:
1. Charlie Kaufman, Radia Perlman, Mike Speciner, “Network Security: Private
communication in a Public World”, Second Edition, Pearsdon Education Asia,
2002.
2. Atul Kahate, “Cryptography and Network Security”, Tata McGrawHill, 2003.

E-Books / Online Resources:

1. https://wanguolin.github.io/assets/cryptography_and_network_security.pdf
2. https://www.wileyindia.com/cryptography-and-security.html

MOOC:
1. http://nptel.ac.in/courses/106105031/
2. https://www.mooc-list.com/tags/cybersecurity

************************

75
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

DISTRIBUTED SYSTEMS
Sub Code : 16CSE61 Credits : 03
L+T+P+S : 3+0+0+0 Total Hours : 39

Course Objectives:
This Course will enable students to:
1. Identify the issues involved in designing distributed systems.
2. Describe various synchronization methods of distributed methods.
3. Analyze process migration approach and distributed deadlock management.
4. Describe features distributed shared memory and file system.
5. List and describe load balancing mechanisms in distributed systems.

UNIT – I
Introduction to distributed systems: Fundamentals:- What is Distributed Computing
Systems?, Distributed Computing System Models, What is DOS?, Issues in designing a
DOS.
Remote Procedure Calls: The RPC model, Transparency of RPC, Implementing RPC
mechanism, Stub generation, RPC messages, Marshaling Arguments and results. Server
management, Parameter passing semantics, call semantics, communication protocols
RPC’s. Complicated RPCs , Client –server binding, Exception handling, Security.
Synchronization in distributed Systems: Clock synchronization – logical clocks – physical
clocks – clock synchronization algorithms, Mutual exclusion – A centralized algorithm – A
distributed algorithm – a token ring algorithm, Comparison of the three algorithms,
Election algorithms – the Bully algorithm – ring algorithm. 13Hours

UNIT – II
Synchronization in distributed Systems: Dead locks in distributed systems – distributed
deadlock avoidance algorithms – distributed deadlock prevention algorithms, distributed
deadlock detection algorithms: Centralized approach, Hierarchical approach and Fully
distributed approach.
Process Migration: Desirable Features of a Good Migration Mechanism, Process Migration
Mechanisms, Threads: Introduction, Motivation for using Threads, Models for Organizing
Threads, Issues in Designing Threads Package, Implementing Thread Package. 12Hours

UNIT – III
Distributed Shared Memory: General structure, Design and implementation issues of
DSM, Granularity, Structure of shared memory space, Consistency Models, Replacement
Strategy, Thrashing .Distributed File Systems: Desirable features of a good distributed file
system, file models, file accessing models, file sharing semantics, file Replication. Resource
Management: Desirable features, task management approach, load balancing approach,
load sharing approach. Naming: Introduction, Desirable Features of Good Naming

76
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

System, System-Oriented Names, Object-Location Mechanism, Human Oriented Names,

Name Cache. 14Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Identify the issues involved in designing distributed systems.
2. Demonstrate various synchronization methods of distributed methods.
3. Compare various process migration approaches and distributed deadlock
management approaches.
4. Apply features distributed shared memory and file system.
5. Evaluate load balancing mechanisms in distributed systems.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Conduct investigations of complex problems
3. Communication

TEXT BOOKS:
1. Pradeep K Sinha ,”Distributed Operating Systems, Concepts & Design”, PHI,2009.

REFERENCE BOOKS:
1. Lampson (Ed), Distributed Systems, Singer – Verlay NY 1981.
2. Mukesh Singhal, Niranjan G,”Advanced Concepts in Operating Systems”, Tata
McGraw-Hill Education, 2001.

E-Books / Online Resources:

1. http://www.gecg.in/papers/ds5thedn.pdf
2. http://cs-www.cs.yale.edu/homes/aspnes/classes/465/notes.pdf

MOOC:
1. nptel.ac.in/courses/117102060/
2. https://www.coursera.org/learn/distributedsystem.

************************

77
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

DIGITAL SIGNAL PROCESSING

Sub Code : 16CSE62 Credits : 03

L+T+P+S: 3+0+0+0 Total Hours: 39

Course Objectives:
This course will enable students to:
1. Understand the behavior of discrete time systems in time& frequency domain.
2. Understand & Analyze the FFT algorithms.
3. Implement discrete time systems
4. Explain the features of TMS320c25 and TMS32067 processors.

UNIT – I
THE DISCRETE FOURIER TRANSFORM: ITS PROPERTIES AND APPLICATIONS:
Frequency Domain Sampling: The Discrete Fourier Transform: Frequency Domain
Sampling and Reconstruction of Discrete-Time Signals, The Discrete Fourier Transform
(DFT), The DFT as a Linear Transformation, Relationship of the DFT to other Transforms.
Properties of the DFT: Periodicity, Linearity and Symmetry Properties, Multiplication of
Two DFT’s and Circular Convolution, Additional DFT Properties. Linear Filtering Methods
Based on the DFT: Use of the DFT in Linear Filtering, Filtering of Long Data Sequences.
Frequency Analysis of Signals using the DFT. Efficient Computation of the DFT: FFT
Algorithms : Direct Computation of the DFT, Divide-and-Conquer Approach to
Computation of the DFT, Radix-2 FFT Algorithms, Radix-4 FFT Algorithms, Split-Radix FFT
Algorithms, Implementation of FFT Algorithms. Applications of FFT Algorithms: Efficient
computation of the DFT of Two Real Sequences, Efficient computation of the DFT of a 2N-
Point Real Sequence, Use of the FFT Algorithm in Linear filtering and Correlation.
13Hours

UNIT –II
Efficient Computation of the DFT: A Linear filtering approach to Computation of the DFT:
The Goertzel Algorithm, The Chirp-Z Transform Algorithm. Quantization Effects in the
Computation of the DFT: Quantization Errors in the Direct Computation of the DFT,
Quantization Errors in FFT Algorithms. Implementation of Discrete-Time Systems :
Structures for the Realization of Discrete-Time Systems. Structures for FIR Systems: Direct-
Form Structures, Cascade-Form Structures, Frequency-Sampling Structures, Lattice
Structure. Structures for IIR Systems: Direct-Form Structures, Signal Flow Graphs and
Transposed. Structures, Cascade-Form Structures, Parallel-Form Structures, Lattice and
Lattice-Ladder Structures for IIR Systems. State-Space System Analysis and Structures:
State-Space Descriptions of Systems Characterized by Difference Equations, Solution of
the State Space Equations, Relationships between Input-Output and State-Space
Descriptions, State-Space Analysis in the Z-Domain, Additional State Space Structures.
13Hours
78
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

UNIT – III
Representation of Numbers: Fixed-Point Representation of Numbers, Binary Floating-
Point Representation of Numbers, Errors Resulting from Rounding and Truncation.
Quantization of Filter Coefficients: Analysis of Sensitivity to Quantization of Filter
Coefficients, Quantization of Coefficients in FIR Filters. Round-Off Effects in Digital Filters:
Limit-Cycle Oscillations in Recursive Systems, Scaling to Prevent Overflow, Statistical
Characterization of Quantization effects in Fixed-Point Realizations of Digital Filters,
Digital Signal Processors :Architecture, features and instructions of Fixed and Floating
point Processors. (TMS320c25 and TMS32067). 13Hours

Course Outcomes:
After studying this subject, the student should be able to:
1. Analyze the behavior of discrete-time systems in time & frequency domain.
2. Analyze and implement FFT algorithms.
3. Relate theoretical concepts to practical applications.
4. Summarize the working of TMS320c25 and TMS32067 processors.
Graduate Attributes (GA)
This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Design / development of solutions
3. Conduct investigations of complex problems
TEXT BOOKS :
1. John G. Proakis and Dimitris G. Manolakis , “Digital Signal Processing”, PHI, Third
Edition 2003.
2. McLellan, Schafer and Yoder , “Signal Processing”,Pearson, 2003.
3. Rulph Chassaing , “Digital signal Processing with C and TMS 320c30”, John
Wiley,First Edition,1992.
REFERENCE BOOKS:
1.Paulo S. R. Diniz, Eduardo A. B. da Silva And Sergio L. Netto , “Digital Signal
Processing System Analysis and Design”, Cambridge University Press, 2002.
2. Sanjit K. Mitra , “Digital Signal Processing:A Computer Based Approach” , Tata
Mcgraw-Hill Edition 2001.
3. Steven W. Smith , “The Scientist and Engineers Guide to Digital Signal Processing
“,Second Edition , California Technical Publishing 1999.
4. Texas Instruments DSP Processors (320 family) data hand book,1988.
5. Jeff Bier, Amit Shoham and Edward A Lec, S.Chand ,”DSP Processor Fundamentals
Phil Lapsley”, Delhi – 2000.
E-Books / Online Resources:
1. https://lecturenotes.in/subject/44/digital-signal-processing-dsp

MOOC:

79
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

1. http://nptel.ac.in/courses/117102060/

************************

ADVANCED COMPUTER NETWORKS

Sub Code : 16CSE63 Credits : 03

L+T+P+S : 3+0+0+0 Total Hours: 39

Course Objectives:
This Course will enable students to:
1. Get the idea of the Application – Layer protocols.
2. Get the idea of the link layer communication, error detection and correction
techniques.
3. Get the idea of various types of multimedia services and its flaws.
4. Get the idea of the risks of transferring data between parties.
5. Identify difficulties in managing networks and different protocols operations

UNIT – I
Application Layer: Principles of Application Layer Protocols, The Web and HTTP, File
Transfer: FTP, Electronic Mail in the Internet, DNS--The Internet's Directory Service, Review
of Socket Programming with TCP & UDP, Building a Simple Web Server, Content
Distribution.
Wireless and Mobile Networks : Data Link Layer: Introduction and Services, Error-
Detection and -Correction Techniques, LAN Addresses and ARP, Ethernet, Hubs, Bridges,
and Switches, Wireless Links, PPP: The Point-to-Point Protocol, Asynchronous Transfer
Mode (ATM), Frame Relay, Broadband Wireless, Blue tooth. 14 Hours

UNIT – II
Multimedia Networking: Multimedia Networking Applications, Streaming Stored Audio
and Video, Making the Best of the Best-Effort Service: An Internet Phone Example,
Protocols for Real-Time Interactive Applications, Beyond Best-Effort, Scheduling and
Policing Mechanisms, Integrated Services, RSVP, Differentiated Services
Security in Computer Networks : What Is Network Security? Principles of Cryptography,
Authentication, Integrity, Key Distribution and Certification, Access Control: Firewalls,
Attacks and Countermeasures, Security in Many Layers: Case Studies. 14 Hours

UNIT – III
Network Management: Infrastructure of Network Management: The Internet standard
management Framework: SMI, MIB, SNMP protocol operations and transport mappings,
security and administration, ASN.1 syntax. 11 Hours

80
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Course Outcomes:
Upon completion of this course, students will be able to:
1. Identify and express how application-layer protocols are different from network-
layer applications. Describe the different protocols.
2. Identify the difference between Link-layer design and network-layer design.
Describe the framing, different links, error detection and error correction code
and link layer protocols
3. Express, Analyze and Evaluate the possibility and limitations of multimedia data.
Real problems in multimedia processing and adopt the best methods.
4. Identify the security risks on the data during transmission.
5. Identify and express different protocols used for managing the network and
difficulties involved in network management.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Design / development of solutions
4. Communication

TEXT BOOKS:
1. James F. Kurose and Keith W. Ross, “Computer Networking- A Top-Down
Approach Featuring the Internet”, Third Edition, Pearson Education,2005
(Chapters 1, 2, 6,7,8).

REFERENCE BOOKS:
1. Andrew S. Tanenbaum, “Computer Networks”, Fourth edition, PHI / Pearson
Publication, 2002.

E-Books / Online Resources:

1. http://intronetworks.cs.luc.edu/current/ComputerNetworks.pdf

MOOC:
1. http://nptel.ac.in/downloads/106105080/
2. http://www.nptelvideos.in/2012/11/computer-networks.html

************************

81
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

CYBER SECURITY
Sub Code : 16CSE64 Credits : 03
L+T+P+S: 3+0+0+0 Total Hours : 39

Course Objectives:
This course will enable students to:
1. Outline the Fundamentals of Cyber security and its attacks. How attacks can
be prevented using firewalls.
2. Explain different approaches for Intrusion and detection Comparison
between different authentications.
3. Fundamentals of phishing, ID theft and India facing main cyber security
challenges.
4. Need and basic Knowledge on cyber forensics.
5. Learn how to analyze give Defense against cyber crimes.

UNIT – I
Cyber security Overview:
Introduction, Security from Global Perspective, Trends in the Types of Attacks and
Malware, The types of Malware, Vulnerability Naming Schemes and security configuration
schemes, The attackers motivation and tactics ,Zero-Day Vulnerability, Attacks on the
power grids and Utility networks ,Network and Infrastructure Overview.
FireWalls :Firewalls, Stateless Packet Filtering, Statefull or session Filtering, Application
level Gateways, Circuit level Gateways, A Comparison of Four types of gateways.
Intrusion Detection / Prevention System :
Overview, The approaches used for IDS/ IPS, Network Based IDS/IPS, Host Based IDS/IPS,
The detection of Polymorphic and metamorphic worms, Distributed Intrusion Detection
system and standard. 14 Hours

UNIT – II
Hash and Authentication:
Authentication overview, Hash Functions, The Hash Message Authentication Code,
Password Based Authentication, Password Based Encryption Standard, Password Based
Security Protocols, One time password and tokens(only two factor authentication ),Open
Identification and Open Authorization.Phishing and Identity theft:Introduction, Phishing ,
Identity theft (ID)
Cyber Crime and CyberSecurity:

82
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Introduction, why do we need cyber laws: Indian context, The Indian IT Act, Challenges to
Indian Law and cyber crime scenarios in India, Consequences of not addressing the
weakness in information technology Act. Digital Signatures and Indian Act. Cyber Crime
and Punishment 14 Hours
UNIT –III
Understanding Computer Forensics:
Introduction, Digital forensics science, The need of computer forensics, Cyber forensics
and digital evidence, Digital forensics life cycle, Network Forensics, Computer forensics
and steganography, Relevence of OSI 7layer model to Computer Forensics ,Forensics and
social networking sites: The security and privacy threats. Challenges in computer forensics,
Special tools and techniques. 11 Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Understand different types of attacks for networks and role of firewall to prevent
it.
2. Explain automated and manual intrusion detection /Prevention for network and
host.
3. Differentiate between different types of authentication.
4. Need of cyber security in developing countries like India.
5. How to give defence for cybercrime and main challenges of computer forensics.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Environment and sustainability
3. Ethics
4. Life-long learning

TEXT BOOKS:
1. Chwan-Hwa (John), Wu(Author), J. David Irwin, “Introduction to Computer
Networks and Cyber security”,publication:CRC press, Taylor and Francis
group,2013 ( for UNIT 1 & II)
2. Nina godbole ,SunitBelapure , “Cyber Security “, Publication : John Wiley, 2012.

REFERENCE BOOKS:
1. Mayank Bhushan, “Fundamentals of Cyber Security”,BPB Publications; First
Edition, 2017.
2. Raef Meeuwisse, “Cybersecurity for Beginners”, Cyber Simplicity Ltd; Second
Revised Edition, March 2017

83
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

3. Britz, ”Computer Forensics and Cyber Crime: An Introduction”, Second Edition,

Pearson Education India,2011
4. Nishesh Sharma, ”Cyber Forensics in India: A Legal Perspective”, Universal Law
Publishing - an imprint of LexisNexis; First Edition, 2017

E-Books / Online Resources:

1. https://www.springer.com/in/book/9783319125732
2. https://www.zdnet.com/article/free-pdf-download-a-winning-strategy-for-
cybersecurity/

MOOC:
1. https://www.coursera.org/specializations/intro-cyber-security
2. https://www.coursera.org/learn/cyber-threats-attack-vectors
3. https://www.coursera.org/learn/intro-cyber-attacks
4. https://www.coursera.org/specializations/intro-cyber-security
5. https://swayam.gov.in/courses/4952-cyber-law
6. https://www.coursera.org/learn/intro-cyber-security-business

************************

ARTIFICIAL INTELLIGENCE
Sub code : 16CSE71 Credits : 03
L+T+P+S: 3+0+0+0 Total Hours: 39

Course Objectives:
This course will enable students to:
1. To understand the basic concepts of Artificial Intelligence with illustrations of
current state of the art research and applications, recognize the characteristics of
AI that makes it useful to real-world problems.
2. Understand the various approaches to AI problem (search inference, decision
making under uncertainty, game theory,etc.)
3. To describe the strengths and limitations of various state-space search
algorithms, and choose the appropriate algorithm.
UNIT -I
Introduction to Artificial Intelligence, Categories of AI, Act like Human, Think like
Human, Think Rationally, Act Rationally. Turing Test approach Applications of AI-
Knowledge base and inference engine, Case study, Introduction to AI Languages.
13 Hours

UNIT - II

84
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

AI Approaches- Introduction, Problem Solving, Problem specification, State space

search with examples, Searching Techniques, Types of Searching, Uniformed/Blind
Search Strategies- Breadth First Search, Depth First Search, Depth Limit Search,
Iterative Deepening Depth First Search, Informed Searches – Greedy Breadth first
search, A* Algorithm, Hill Climbing, Game Solving- Min Max Algorithm, Alpha Beta
Pruning. 13 Hours

UNIT - III
Knowledge Representation, Learning and Expert System - Introduction, Characteristics of
Expert System, Need of an Expert system , Architecture of Expert System, Steps to
developing expert system. Various Methods of Knowledge Representation and learning
Predicate logic ,Supervised Learning, Un-Supervised Learning, Reinforcement Learning
Introduction to NLP, Genetic Algorithm. 13 Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Exhibit strong familiarity with a number of important AI techniques, including in
particular search, knowledge representation, planning and constraint
management
2. Interpret the modern view of AI as the study of agents that receive percepts from
the environment and perform actions.
3. Build awareness of AI facing major challenges and the complexity of typical
problems within the field.
4. Assess critically the techniques presented and apply them to real world problems.
5. Develop self-learning and research skills to tackle a topic of interest on his/her
own or as part of a team.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Design / development of solutions
4. Environment and sustainability

TEXT BOOKS:
1. Peter and Norvig , “Artificial Intelligence: A Modern Approach” ,Pearson, 2016.

REFERENCE BOOKS:
1. Elaine Rich, Kevin Knight and Nair ,”Artificial Intelligence”,ISBN-978-0-07- 008770-
5, TMH,Third Edition,2012.
2. Bratko ,”Prolog Programming for Artificial Intelligence“, TMH,Third Editon,2002.

85
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

3. SarojKausik,”Artificial Intelligence”, ISBN:- 978-81-315-1099-5, Cengage

Learning,First Edition,2011.
4. Padhy ,”Artificial Intelligence and Intelligent Systems”, Oxforfd University
Press.2005.

E-Books / Online Resources:

1. http://artint.info/html/ArtInt.html
2. http://ai.stanford.edu/~nilsson/QAI/qai.pdf

MOOC:
1. Artificial Intelligence -http://www.nptelvideos.in/2012/11/artificial-
intelligence.html
2. http://nptel.ac.in/courses/106105077/
3. https://www.edx.org/course/artificial-intelligence-ai-columbiax-csmm-101x-4
4. https://www.udemy.com/artificial-intelligence

************************

PATTERN RECOGNITION
Sub Code : 16CSE72 Credits : 03
L+T+P+S : 3+0+0+0 Total Credits : 39

Course Objectives:
This course will enable students to:
1. Explain the concepts Machine Perception, Pattern Recognition, Design cycle,
learning and Bayesian Decision Theory2
2. Explain the concepts Machine Perception, Pattern Recognition, Design cycle,
learning and Bayesian Decision Theory
3. Perform likelihood estimation, parameter estimation and complex analysis,
Demonstrate nearest neighbour rule, metrics and nearest-neighbour classification
and fuzzy classification
4. Explain the linear discriminant functions, Perceptron criterion function and
squared-error procedures
5. Apply the principles of Learning, clustering, component analysis and
multidimensional scaling.
UNIT – I
Introduction: Machine Perception, Pattern Recognition systems, Design cycle, learning
and adaptation (1.1, 1.3, 1.4, 1.5 of Ref.1) Bayesian Decision Theory: Introduction, Bayesian
Decision theory – continuous features, classifiers, discriminant functions, and decision
surfaces, normal density and discriminant functions, Bayes decision theory – discrete
features (2.1, 2.2, 2.4, 2.5, 2.6, 2.9 of Ref. 1). Maximum likelihood and Bayesian parameter
86
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

estimation: Introduction, maximum likelihood estimation, Bayesian Estimation, Bayesian

parameter estimation, problem of dimensionality, sufficient and exponential family,
complex analysis & discriminants, (3.1 to 3.8 of Ref.1). 13Hours

UNIT – II
Nonparametric Techniques: Introduction, Density Estimation, Parzen Windows, kn-
nearest neighbour estimation, nearest neighbour rule, metrics and nearest-neighbour
classification, fuzzy classification, reduced coulomb energy, approximations by series
expansions (4.1 – 4.9 of Ref.1) Linear discriminant functions: Introduction, linear
discriminant functions, generalized linear discriminant functions, minimizing the
Perceptron criterion function, relaxation procedures, non separable behaviours, minimum
squared-error procedures, Ho-Kashyap procedures (5.1 to 5.9 of Ref.1 ). 13Hours

UNIT – III
Unsupervised learning and clustering: Mixture densities and identifiability, maximum-
likelihood estimates, application to normal mixtures, unsupervised Bayesian learning, data
decryption and clustering, criterion functions and clustering, hierarchical clustering, on-
line clustering. Component analysis, low-dimensional representations and
multidimensional scaling (10.1 to 10.14 except 10.8, 10.12 of Ref. 1) Syntactic pattern
Recognition: Overview, qualifying structure in pattern description and recognition,
grammar based approach, elements of formal grammar (Chap. 3 of Ref. 2) 13Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Recall the basics of pattern recognition systems and Bayesian Decision Theory.
2. Determine the maximum likelihood and Bayesian parameter estimation.
3. Express the nonparametric techniques such as density estimation and nearest
neighbour estimation.
4. Examine linear discriminant functions, minimizing the perception criterion
function and minimum squared-error procedures
5. Describe the various unsupervised learning and clustering methods.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Design / development of solutions

TEXT BOOKS :
1. Richard O. Duda, Peter E. Hart and David G Stork,” Pattern Classification”, John
Wiley & Sons, Inc.2nd Ed. 2001.

87
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

2. Robert Schalkoff, “Pattern Recognition: Statistical, Structural and Neural

Approaches”, John Wiley & Sons, Inc.1992.

REFRENCE BOOKS
1. Christopher M. Bishop, "Pattern recognition and machine learning (information
science and statistics).", Springer -Verlag New York Inc,2006.
2. Anzai, Yuichiro,”Pattern recognition and machine learning”, Elsevier, 2012.

E-Books / Online Resources:

1. http://www.37steps.com/data/pdf/PRIntro_medium.pdf
MOOC:
1. https://www.mooc-list.com/tags/pattern-recognition
2. http://nptel.ac.in/courses/117105101/

************************
SOCIAL AND WEB ANALYTICS
Sub Code : 16CSE73 Crédits :03
Hrs/week : 3+0+0+0 Total Hours :39

Course Objectives:
This course will enable students to:
1. Understand social media, web and social media analytics, and their potential
impact.
2. Determine how to Leverage social media for better services and Understand
usability metrics, web and social media metrics
3. Use various data sources and collect data relating to the metrics and key
performance indicators
4. Identify key performance indicators for a given goal, identify data relating to the
metrics and key performance indicators
5. Use ready-made web analytics tools (Google Analytics) and be able to understand
a statistical programming language (R), also use its graphical development
environment (Deduce) for data exploration and analysis.

UNIT – I
Introduction to web and social analytics: Overview of web & social media (Web sites,
web apps, mobile apps and social media), Impact of social media on business, Social
media environment, , How to leverage social media for better services, Usability, user
experience, customer experience, customer sentiments, web marketing, conversion rates,
ROI, brand reputation, competitive advantages.
Need of using analytics, Web analytics technical requirements., current analytics
platforms, Open Source vs licensed platform, choosing right specifications & optimal
solution, Web analytics and a Web analytics 2.0 framework (clickstream, multiple
88
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

outcomes Relevant Data And its Collection using statistical Programming language
R.:Data (Structured data, unstructured data, metadata, Big Data and Linked Data),
Participating with people centric approach, Data analysis basics (types of data, metrics
and data, descriptive statistics, comparing, Basic overview of R:R-Data Types, R-Decision
Making, R-Loops, R-functions, R-Strings, Arrays, R-Lists, R-Data Frame, R-CSV Files, R-Pie
Charts, R-Bar charts, R-Barplots. Basic Text Mining in R and word cloud. 13 Hours

UNIT – II
Kpi/Metrics: Understand the discipline of social analytics, Aligning social objectives with
business goals, Identify common social business objectives, developing KPIs; Standard vs
Critical metrics. PULSE metrics (Page views, Uptime, Latency, Seven-day active users) on
business and technical Issues, HEART metrics (Happiness, Engagement, Adoption,
Retention, and Task success) on user behavior issues; Bounce rate, exit rate, conversion
rate, engagement, strategically aligned KPIs, Measuring Macro & micro conversions, On-
site web analytics, off-site web analytics, the goal-signal-metric process. Case study on
Ready-made tools for Web and social media analytics (Key Google Analytics metrics,
dashboard, social reports, Tableau Public and KNIME
Mining Twitter: Exploring Trending Topics, Discovering What People Are Talking
About, and More: Why Is Twitter All the Rage?, Exploring Twitter’s API, Fundamental
Twitter Terminology, Creating a Twitter API Connection, Exploring Trending Topics,
Searching for Tweets, Analyzing the 140 Character, Extracting Tweet Entities, Analyzing
Tweets and Tweet Entities with Frequency Analysis, Computing the Lexical Diversity of
Tweets, Examining Patterns in Retweets, Visualizing Frequency Data with Histograms.
13 Hours
UNIT –III
Mining Facebook: Analyzing Fan Pages, Examining Friendships, and More: Overview,
Exploring Facebook’s Social Graph API, Understanding the Social Graph API,
Understanding the Open Graph Protocol, Analyzing Social Graph Connections, Analyzing
Facebook Pages, Examining Friendships.
Data Mining in Social Media :Introduction, Data Mining in a Nutshell, Social Media,
Motivations for Data Mining in Social Media, Data Mining Methods for Social Media, Data
Representation, Data Mining - A Process, Social Networking Sites: Illustrative Examples,
The Blogosphere: Illustrative Examples, Related Efforts, Ethnography and Netnography,
Event Maps
Text Mining in Social Networks
Introduction, Keyword Search, Query Semantics and Answer Ranking, Keyword search
over XML and relational data, Keyword search over graph data, Classification Algorithms,
Clustering Algorithms, Transfer Learning in Heterogeneous Networks 13 Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Use Social Media Analytics and Web analytics,
2. Explain how to leverage social media for better services.
89
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

3. Develop KPIs and to build scorecards & dashboards to track KPIs.

4. Understand text mining and data mining in social networks.
5. Use ready-made web analytics tools (Google Analytics) and be able to
understand a statistical programming language (R), also use its graphical
development environment (Deduce) for data exploration and analysis

Graduate Attributes (GA)

This course will map the following GA as per NBA:
12. Engineering Knowledge
13. Design / development of solutions
14. Conduct investigation of complex problems
15. Modern tool usage
16. Environment and sustainability
17. Ethics
18. Individual and team work
19. Communication
20. Project management and finance

TEXT BOOKS:
1. Matthew A. Russell,” Mining of Social web, O′Reilly”, Second Edition ,ISBN-13:
978-1449367619, 2013,
2. Charu C Agarwal, “Social Network Data Analytics”, Springer; October 2014.

REFERENCE BOOKS:
1. Hand, Mannila, and Smyth,”Principles of Data Mining”, Cambridge, MA: MIT Press,
ISBN: 026208290X, 2001.
2. Avinash Kaushik, “Web Analytics 2.0: The Art of Online Accountability and Science
of Customer Centricity”, John Wiley &Sons; Pap/Cdr Edition, 2009.
3. Tom Tullis, Bill Albert, “Measuring the User Experience: Collecting, Analyzing, and
Presenting Usability Metrics”, First Edition ,Morgan Kaufmann ,2008.
4. Jim Sterne, Social Media Metrics: “How to Measure and Optimize Your Marketing
Investment”, John Wiley & Sons ,2010.
5. Brian Clifton, “Advanced Web Metrics with Google Analytics”, Third Edition, John
Wiley & Sons ,2012.

E-Books / Online Resources:

1. http://www.webpages.uidaho.edu/~stevel/504/Mining-the-Social-Web-2nd-
Edition.pdf
2. http://dbmanagement.info/Books/MIX/Computer_Science_Mit_Press_Principles_O
f_Data_Mining_Big_Data.pdf

90
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

MOOC:
1. Stanford: http://library.stanford.edu/projects/r
2. http://nptel.ac.in/courses/106106146/21#watch
3. https://www.coursera.org/learn/social-media-data-analytics

************************

NEURAL NETWORKS AND DEEP LEARNING

Sub Code : 16CSE74 Credits : 03

L+T+P+S: 3+0+0+0 Total Hours : 39

Course Objectives:
This course will enable students to:
1. Explain the importance and basics of deep learning
2. Outline the structure of neural network and the process of training in neural
networks
3. Describe the structure and working of convolution neural networks.

UNIT I
Introduction: What is Deep Learning? What are Neural Networks? Neural networks
basics: cost functions, hypotheses and tasks; training data; maximum likelihood-based
cost, cross entropy, MSE cost; feed-forward networks; MLP, sigmoid units; neuroscience
inspiration;
13 Hours
UNIT II
Neural Networks Training: Learning in neural network: output vs hidden layers; linear vs
nonlinear networks;Backpropagation: learning via gradient descent; recursive chain rule
(backpropagation); if time: bias-variance tradeoff, regularization; output units: linear,
softmax; hidden units: tanh, RELU; Deep learning strategies: GPU training, regularization,
RLUs, dropout. 13 Hours
UNIT III
Convolution Neural Networks: Invariance, stability, Variability models (deformation
model, stochastic model), Scattering networks, Group Formalism, Properties of CNN
representations: invertibility, stability, invariance, Covariance/invariance: capsules and
related models, Connections with other models: dictionary learning, LISTA, localization,
regression, Embeddings (DrLim), inverse problems, Extensions to non-Euclidean domains.
Deep Neural Networks for Sequences: Recurrent Neural Networks: RNN for language
modelling and other tasks 13 Hours

91
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Course Outcomes:
1. Upon completion of this course, students will be able to:
2. Demonstrate the importance and basic of deep learning
3. Explore and develop neural network models
4. Apply Convolution neural networks and recurrent neural networks for real world
problems.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Design / development of solutions
3. Conduct investigation of complex problems
4. The engineer and society
5. Environment and sustainability
6. Ethics
7. Life-long Learning

TEXTBOOK:
1. Ian Goodfellow, Yoshua Bengio, Aaron Courville , “Deep Learning”,Cambridge:
MIT press, 2016.

REFERENCE BOOKS:
1. Duda, R.O., Hart, P.E., and Stork, D.G.,”Pattern Classification”, Wiley-Interscience.
Second Edition. 2001.
2. Theodoridis, S. and Koutroumbas, K.,”Pattern Recognition”,Fourth Edition,
Academic Press, 2008.
3. Russell, S. and Norvig, N, Artificial Intelligence: “A Modern Approach”, Prentice
Hall Series in ArtificialIntelligence. 2003.
4. Bishop, C. M.,”Neural Networks for Pattern Recognition”, Oxford University Press.
1995.
5. Hastie, T., Tibshirani, R. and Friedman, J,”The Elements of Statistical Learning”,
Springer. 2001.

E-Books / Online Resources:

1. http://cs224d.stanford.edu/syllabus.html
2. https://www.cs.colorado.edu/~mozer/Teaching/syllabi/DeepLearningFall2017/

MOOC:
1. https://www.class-central.com/course/kadenze-creative-applications-of-deep-
learning-with-tensorflow-6679

92
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

2. https://www.class-central.com/course/practical-deep-learning-for-coders-part-1-
7887

************************

BIG DATA ANALYTICS

Sub Code :16CSE81 Credits : 03
L+T+P+S :3+0+0+0 Total Hours: 39

Course Objectives:
This course will enable students to:
1. Comprehend in depth the fundamental issues behind Big Data problem
2. Understand Big Data technologies, different databases and Hadoop foundations
3. Discuss the philosophy of Hadoop MapReduce
4. Learn Pig and Hive Scripts using Hadoop environment
5. Relate different Analytics associated with Big Data problem

UNIT – I
Introduction to big data: Data, Characteristics of data and Types of digital data:
Unstructured, Semi-structured and Structured, Sources of data, Working with
unstructured data, Evolution and Definition of big data, Characteristics and Need of big
data, Challenges of big data, Data environment versus big data environment;Big data
technologies and Databases: Introduction to NoSQL, Uses, Features and Types, Need,
Advantages, Disadvantages and Application of NoSQL, Overview of NewSQL, Comparing
SQL, NoSQL and NewSQL, Introduction to MongoDB and its needs, Characteristics of
MongoDB, Introduction of apache cassandra and its needs, Characteristics of cassandra
Hadoop foundation for analytics: History, Needs, Features, Key advantage and Versions of
Hadoop, Essential of Hadoop ecosystems, RDBMS versus Hadoop, Key aspects and
Components of Hadoop, Hadoop architectures. 14 Hours

UNIT - II
Hadoop MapReduce and YARN framework: Introduction to MapReduce, Processing
data with Hadoop using MapReduce, Introduction to YARN, Components, Need and
Challenges of YARN, Dissecting YARN, MapReduce application, Data serialization and
Working with common serialization formats, Big data serialization formats;Big data with
Hive and Pig: Overview of hive and its architecture, Hive data types and File format, Hive
query language (HQL), Introduction to Pig, pig latin overview, Data types in Pig and
Running Pig . 14 Hours

UNIT –III
Big data analytics: Overview of business intelligence, Data science and Analytics,
Meaning and Characteristics of big data analytics, Need of big data analytics,

93
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Classification of analytics, Challenges to big data analytics, Importance of big data

analytics, Basic terminologies in big data environment. 11 Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Identify the issues and challenges related to Big Data.
2. Choose and apply Big Data technologies and tools in solving real life Big Data
problem.
3. Design MapReduce architecture for Big Data problem.
4. Write scripts using Pig and Hive to implement Big Data problem
5. Derive different Analytics from the Big Data problem
Graduate Attributes (GA)
This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Design / development of solutions
3. Conduct investigation of complex problems
4. Modern tool usage
5. Environment and sustainability
6. Ethics
7. Individual and team work
8. Communication
9. Project management and finance

TEXT BOOKS:
1. Seema Acharya, Subhashini Chellappan ,“Big Data and Analytics”, Wiley,2017.
2. Alex Holmes,“Big Data Black Book”, Dreamtech,2015.

REFERENCE BOOKS:
1. Minelli, Chambers, Dhiray,“Big Data Big Analytics”, Wiley,2013.
2. Bart Baesens , “Analytics in a Big Data World”, Wiley,2014.
3. Boris Lublinsky, Kevin T. Smith , “Hadoop Solutions”, Wrox, First Edition,2013
4. Chuck Lam, “Hadoop in Action”, Dreamtech,2011.

E-Books / Online Resources:

1. ftp://public.dhe.ibm.com/software/pdf/at/SWP10/Big_Data_Analytics.pdf
2. https://www.wileyindia.com/big-data-analytics-2ed.html

MOOC:
1. https://www.coursera.org/specializations/big-data
2. nptel.ac.in/courses/106104135/48

************************

94
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

IMAGE PROCESSING
Sub Code :16CSE82 Credits : 03
L+T+P+S: 3+0+0+0 Total Hours : 39

Course Learning Objectives:

This Course will enable students to:
1. Outline the theory behind the basics of digital image processing, the relation
between the components of image processing system.
2. Make use of Electromagnetic Spectrum, find the equivalence between pixels.
3. Make use of Homomorphic Filtering and how to simplify Detection of
Discontinuities.
4. Get the idea of Models Elements of Information; find the equivalence between
Dilation and Erosion, Opening and Closing, and identify the Hit-or-Miss
Transformation.
5. Tell how Components of an Image Processing System works, their design, and get
the feeling of Histogram Processing.

UNIT – I
Introduction: What Is Digital Image Processing? Examples of Fields that Use Digital Image
Processing, Fundamental Steps in Digital Image Processing , Components of an Image
Processing System. Digital Image Fundamentals - Elements of Visual Perception,
Brightness Adaptation and Discrimination, Light and the Electromagnetic Spectrum,
Image Sensing and Acquisition, Image Sampling and Quantization, Some Basic
Relationships between Pixels.
Image Enhancement in the Spatial Domain - Background, Some Basic Gray Level
Transformations, Histogram Processing. Enhancement Using Arithmetic/Logic Operations,
Basics of Spatial Filtering, Smoothing Spatial Filters, Sharpening Spatial Filters, Image
Enhancement in the Frequency Domain- Background, Introduction to the Fourier
Transform and the Frequency Domain, Smoothing Frequency-Domain Filters. 14 Hours

UNIT – II
Sharpening Frequency Domain Filters, Homomorphic Filtering, Image Segmentation-
Detection of Discontinuities, Edge Linking and Boundary Detection, Thresholding, Region-
Based Segmentation, Segmentation by Morphological Watersheds, the Use of Motion in
Segmentation.
Image Compression - Fundamentals Image Compression, Models Elements of
Information, Theory Error-Free Compression, Lossy Compression, Image Compression
Standards.
Morphological Image Processing - Preliminaries, Dilation and Erosion, Opening and
Closing, the Hit-or-Miss Transformation Some Basic, Morphological Algorithms. 14 Hours

95
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

UNIT- III
Color Image Processing - Color Fundamentals, Color Models, Pseudo color Image
Processing, Basics of Full-Color Image Processing, Color Transformations, Smoothing and
Sharpening, Color Segmentation, Noise in Color Images, Color Image Compression.
Introduction to wavelet based processing. 11 Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Identify the concept of Digital Image Processing, and design steps in Digital
Image Processing.
2. Apply Image Sampling and Quantization, illustrate an equivalence between Light
and the Electromagnetic Spectrum, prove Some Basic Relationships between
Pixels.
3. Design and apply Smoothing Spatial Filters, Sharpening Spatial Filters.
4. Design a Smoothing Frequency-Domain Filters, illustrate an equivalence between
Transform and the Frequency Domain, Smoothing Frequency-Domain Filters,
prove the properties Region-Based Segmentation.
5. Construct Image Compression Standards and explain the concept of
Morphological Image Processing.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Conduct investigations of complex problems
4. Modern tool usage
5. Life-long learning

TEXT BOOKS:
1. Rafel C Gonzalez and Richard E Woods, “Digital Image Processing”, Pearson
Education, Second Edition, 2003.

REFERENCE BOOKS:
1. Anil K Jain, “Fundamentals of Digital Image Processing”, Prentice-Hall of IndiaPvt.
Ltd., 1997.
2. Milan Sonka, Vaclav Hlavac and Roger Boyle, “Image Processing, Analysis and
Machine Vision”, Thomoson Learning, Brooks/Cole, Second Edition. 2001.
3. B.Chanda, D Dutta Majumder, “Digital Image Processing and Analysis”,Prentice-
Hall, India, 2002.
4. StevenW.Smith,“The Scientist and Engineers Guide to Digital Signal Processing
“,California Technical Publishing ,Second Edition , 1999.

96
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

E-Books / Online Resources:

1. iitlab.bit.edu.cn/HandbookofImageandVideoProcessing.pdf
2. http://www.cs.ukzn.ac.za/~sviriri/Books/Image-Processing/book4.pdf

MOOC:
1. https://www.coursera.org/learn/image-processing
2. nptel.ac.in/courses/117105079

************************

NATURAL LANGUAGE PROCESSING

Sub Code :16CSE83 Credits :03
L+T+P+S : 3+0+0+0 Total Hours : 39

Course Objectives:
This course will enable students to:
1. Explain the importance of NLP and breaking of words.
2. Outline the syntax, semantics and pragmatics in speech language.
3. Describe the models for different applications of NLP.

UNIT I
Introduction: what is Natural Language Processing, Motivation, Words - Regular
Expressions and Automata, Words and Transducers, N - grams - Part – of - Speech
Tagging, Hidden Markov Models, Maximum Entropy Model, Syntactic Parsing. 13 Hours

UNIT II
Syntax: Statistical Parsing, Features and Unification-Language and Complexity, Language
Modelling.
Semantics and Pragmatics: Semantics and Pragmatics: The Representation of Meaning,
Computational Semantics. Lexical Semantics: Computational Lexical Semantics,
Computational Discourse 13 Hours

UNIT III
Applications: Applications, Information Extraction, Question Answering and
Summarization, Dialog and Conversational Agents, Machine Translation. 13 Hours

Course Outcomes:
Upon completion of this course, students will be able to:
1. Explain the understanding of core tasks in NLP.
2. Demonstrate the syntax, semantics and pragmatics in speech language.

97
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

3. Implement and experiment the models for different applications of NLP.

4. Demonstrate understanding of state-of-the-art algorithms and techniques for
text-based processing of natural language.
5. Demonstrate understanding of human languages and be familiar with the most
mainstream descriptive and theoretical frameworks for handling their properties.

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Design / development of solutions
3. Conduct investigation of complex problems
4. The engineer and society
5. Environment and sustainability
6. Ethics
7. Individual and team work
8. Communication
9. Life-long Learning

TEXT BOOKS:
1. Allen, James,“Natural Language Understanding”, Second Edition,
Benjamin/Cumming, 1995.
2. Jurafsky, D. and J. H. Martin,”Speech and language processing: An Introduction to
Natural Language Processing, Computational Linguistics, and Speech
Recognition”, Second Edition, Prentice Hall, 2008.
3. Steven Bird, S., Klein, E., Loper, E, “Natural Language Processing with Python-
Analyzing Text with the Natural Language Toolkit”, O'Reilly Media, 2010.
REFERENCE BOOKS:
1. Grant S Ingersoll, Thomas S. Morton, and Andrew L. Farris,”Taming text: how to
find, organize, and manipulate it” Manning Publications Co., 2013.
2. Feldman Ronen, and James Sanger,”The text mining handbook: advanced
approaches in analyzing unstructured data”,Cambridge university press, 2007.
3. Christopher D Manning, and Hinrich Schütze,” Foundations of statistical natural
language processing”,MIT press, 1999.

E-Books / Online Resources:

1. http://www.allitebooks.in/mastering-natural-language-processing-python/
2. https://github.com/hayderimran7/free-tech-ebooks-from-
packtpub/tree/master/Natural%20Language%20Processing%20with%20Java%20a
nd%20LingPipe%20Cookbook
MOOC:
1. https://www.experfy.com/training/courses/natural-language-processing-for-retail
2. https://www.class-central.com/course/coursera-natural-language-processing-
9603
98
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

************************

SOFT COMPUTING
Sub Code : 16CSE84 Credits :03
L+T+P+S : 3+0+0+0 Total Hours: 39

Course Objectives:
This course will enable students to:
1. Differentiate hard and soft computing, Define SC constitutes, List Applications,
Outline Intelligent systems architecture
2. Reproduce conceptual GA algorithm, Illustrate Mutation and Cross over operations,
Define learning strategies, List ML applications, Describe the architecture of learning
agent
3. Explain the structure and function of Biological Neuron, discuss MFF networks,
represent back propagation
4. Demonstrate fuzzy operations, membership function, compare fuzzy models, derive
fuzzy rules, outline Fuzzy inference systems
5. Analyse decision making strategies, list expert system features, tools, explain experts
system architecture
UNIT – I
INTRODUCTION TO SOFT COMPUTING:
Evolution of Computing, Soft and Hard Computing, Soft Computing characteristics,
Constituents and Applications, AI Definitions and Intelligent systems architecture.

GENETIC ALGORITHMS:
Introduction to Genetic Algorithms (GA) – Conceptual GA algorithm, Reproduction
operators Mutation and cross over, Applications of GA, Learning Definitions, strategies,
Machine Learning Approach, applications and Architecture of learning agent 14 Hours
UNIT –II
NEURAL NETWORKS :
Introduction to Neural Networks, Applications, Structure and function of Biological
Neuron, ANN introduction, Perceptron, Multi-layer feed forward Networks with Back
propagation

FUZZY LOGIC:
Fuzzy Sets, Operations on Fuzzy Sets, Membership Functions, Fuzzy Rules, Models, Fuzzy
Reasoning and Fuzzy Inference Systems. 14 Hours
UNIT - III
DECISION MAKING AND EXPERT SYSTEMS:
Single person, multi person, Multi criteria and Multi stage decision making, Expert system
features, architecture and applications 11 Hours

99
 Syllabus of V & VI Semester B.E. / Computer Science & Engg.

Course Outcomes:
Upon completion of this course, students will be able to:
1. Explain the constitutes and applications Soft Computing
2. Perform reproduce operations like mutations and cross over
3. Demonstrate the concepts of neural networks.
4. Explain the fuzzy member ship functions and models
5. Apply decision making strategies to real world examples

Graduate Attributes (GA)

This course will map the following GA as per NBA:
1. Engineering Knowledge
2. Problem Analysis
3. Design / development of solutions
4. Conduct investigations of complex problems

TEXT BOOKS
1. Jyh-Shing Roger Jang, Chuen-Tsai Sun, EijiMizutani, “Neuro-Fuzzy and Soft
Computing”, Prentice-Hall of India, 2003.
2. George J. Klir and Bo Yuan, “Fuzzy Sets and Fuzzy Logic-Theory and Applications”,
Prentice Hall, 1995.
3. James A. Freeman and David M. Skapura, “Neural Networks Algorithms,
Applications, and Programming Techniques”, Pearson Edition., 2003.
4. Simon Haylion “Neural Networks”, Prentice-Hall of India, 2003.

REFERENCE BOOKS:
1. Mitchell Melanie, “An Introduction to Genetic Algorithm”, Prentice Hall, 1998.
2. David E. Goldberg, “Genetic Algorithms in Search, Optimization and Machine
Learning”, Addison Wesley, 1997.
3. S. N. Sivanandam, S. Sumathi and S. N. Deepa, “Introduction to Fuzzy Logic using
MATLAB”, Springer, 2007.
4. S.N.Sivanandam · S.N. Deepa, “ Introduction to Genetic Algorithms”, Springer,
2007.
5. Jacek M. Zurada, “Introduction to Artificial Neural Systems”, PWS Publishers, 1992.

E-Books / Online Resources:

1. https://www.wileyindia.com/principles-of-soft-computing-2nd-ed.html
2. http://dl.offdownload.ir/ali/Neuro-FuzzyAndSoftComputing.pdf
MOOC:
1. https://onlinecourses.nptel.ac.in/noc18_cs13/course
2. www.soft-computing.de/link.html
3. nptel.ac.in/courses/106105173/

************************

100