Updated Scheme and Syllabus 2016-17 Version16Feb2016

Scheme and Syllabus of
B.E. (Computer Science and Engineering)

rd th
3 TO 8 Semester 2016-2017
University Institute of Engineering and
Technology,
Panjab University, Chandigarh

DEPARTMENT: COMPUTER SCIENCE AND ENGINEERING
VISION:
To be recognized as an international leader in Computer Science and Engineering education and research to
benefit society globally.
MISSION:
To move forward as frontiers of human knowledge to enrich the citizen, the nation, and the world.
To excel in research and innovation that discovers new knowledge and enables new technologies and systems.
To develop technocrats, entrepreneurs, and business leaders of future who will strive to improve the quality of
human life.
To create world class computing infrastructure for the enhancement of technical knowledge in field of Computer
Science and Engineering.
PROGRAMME: B.E. CSE (UG PROGRAMME)
PROGRAMME EDUCATIONAL OBJECTIVES:
I. Graduates will work as software professional in industry of repute.

II. Graduates will pursue higher studies and research in engineering and management disciplines.
III. Graduates will work as entrepreneurs by establishing startups to take up projects for societal and environmental
cause.
PROGRAMME OUTCOMES:
A. Ability to effectively apply knowledge of computing, applied sciences and mathematics to computer science &
engineering problems.
B. Identify, formulate, research literature, and analyze complex computer science & engineering problems reaching
substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences.
C. Design solutions for computer science & 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.
D. Conduct investigations of complex problems using research-based knowledge and research methods including design
of experiments, analysis and interpretation of data, and synthesis of the information to provide valid conclusions.
E. Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools including prediction
and modeling to different computer science & Engineering activities with an understanding of the limitations.
F. 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.
G. Understand the impact of the professional engineering solutions in societal and environmental contexts and
demonstrate the knowledge of and need for the sustainable development.
H. Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice.
I. Ability to function effectively as a member of a team assembled to undertake a common goal in multidisciplinary
settings.
J. Ability to communicate effectively to both technical and non-technical audiences.
K. Demonstrate knowledge and understanding of the engineering and management principles and apply these to ones
own work, as a member and leader in a team, to manage projects and in multidisciplinary environments.
L. Recognition of the need for and the ability to engage in life-long learning. The ability to successfully pursue
professional development.
1
EXAMINATION NOTE:
The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks. First question, covering the
whole syllabus and having questions of conceptual nature, will be compulsory. Rest of the paper will be divided into two parts
having three questions each and the candidate is required to attempt at least two questions from each part.
2.0 Credit System :

2.1 All B.E / integrated B.E-M.B.A programmes are organised around semester-based credit system of study. The credit
system is based on continuous evaluation of a students performance/progress and includes flexibility to allow a student to
progress at an optimum pace suited to his/her ability or convenience, subject to fulfilling minimum requirements for
continuation.
2.2 Performance/progress of a student is measured by the number of credits that he/she has earned (completed satisfactorily).
Based on the course credits and grades obtained by the student, grade point average is calculated, subject to his qualification of
minimum grade in each subject.
2.3Course Credit Assignment:

Each course has a certain number of credits assigned to it depending on the associated number of lecture, tutorials and
laboratory contact hours in a week. A few courses are without credit and are referred to as non-credit (NC) courses.
Lectures and Tutorials: One lecture hour or one tutorial hour per week per semester is assigned one credit.
Practical / Laboratory Work: One laboratory hour per week per semester is assigned half credit.
The credits are rounded off to the nearest whole number.
For each lecture or tutorial the self study component is 1 hour/week
2.4 Earning Credits :

At the end of every course, a letter grade is awarded in each course for which a student had registered. On obtaining a pass
grade (at least D grade), the student accumulates the course credits as earned credits. Performance of a student is measured
by the number of credits that he/she has earned and by the weighted grade point average. Grades obtained in audit courses are
not counted towards the calculation of grade point average. However, a pass grade (D grade) is essential for earning credits
from an audit course.
3.0 Grading System :

3.1 The grades and their respective description , along with grade points are listed in the table given below in Table-1
Table-1
Grade Grade Point Description

A+ 10 Outstanding
A 9 Excellent
B+ 8 Very Good
B 7 Good
C+ 6 Average
C 5 Below average
D 4 Marginal
F 0 Very Poor
I - Incomplete
NP - Audit Pass
NF - Audit Fail
W - Withdrawal
X - Unsatisfactory
S - Satisfactory
Completion
2
4.0 Evaluation System:
4.1 Continuous Assessment :
There shall be continuous evaluation of the student during the semester. For evaluation purpose, total marks assigned to each
subject shall be distributed as :
Two Mid semester Examination (Minor-1 and Minor-2) with 30 % of total marks assigned to the subject. Best Marks of one
of these two will be considered for award of sessional.
Assignments/Class projects/ short class tests/MCQ based quizzes/projects/presentations/group discussions/ Attendance with 20
% of total marks assigned to the subject.
One End Semester Examination (Major Examination) with 50 % of total marks assigned to the subject. It is compulsory to
appear in End Semester Examination and secure at least 20% marks of total End semester exam marks.
If a candidate secures less than 20% marks of total End semester exam marks, he/she will be awarded F grade.
4.2 Method for the Award of Grades:
For the award of grades in a course, all component wise evaluation shall be done in terms of marks. The components include:
Midterm-1 and Midterm-2 examinations, Assignments/projects/class presentations/Attendance, and End semester
examination as per regulation 4.1. After converting the marks obtained in percentage , the grades will be assigned as per the
guidelines given below :
Table-2
Sr. No. Marks Grade Grade Point

1. 90 A+ 10
2. 80 & < 90 A 9
3. 70 & < 80 B+ 8
4. 60 & < 70 B 7
5. 50 & < 60 C+ 6
6. 45 & < 50 C 5
7. 40 & < 45 D 4
8. <40 F 0
5.0 Evaluation of Performance :
5.1 The performance of a student shall be evaluated in terms of two indices, viz. Semester Grade Point Average (SGPA)
and Cumulative Grade Point Average (CGPA).
SGPA is the grade point average for the semester, and CGPA is the cumulative grade point average for all the completed
semesters at any point in time.
The earned credits (E.C) are defined as the sum of course credits for course in which A+ to D grade has been obtained. For
U.G students (B.E), credits from courses in which NP or S grade has been obtained are also added.
Points earned in a semester =
The SGPA is
calculated on the basis of grades obtained in all courses, except audit courses and courses in which S/Z grade is awarded,
3
registered for the particular semester.
The CGPA is calculated as given below :
4
Scheme of Examination of B.E. in Computer Science & Engineering
Second Year - Third Semester
Scheme of Teaching University Internal

Sr. Paper
Subject Title External Sessional Total
No. Code L T P Hrs Credits
Marks Marks
1. CS 301 Data Structures 3 1 0 4 4 50 50 100
Data Structures
2. CS 351 0 0 3 3 2 - 50 50
(Practical)
3. CS 302 Database Systems 3 1 0 4 4 50 50 100
Database Systems
4. CS 352 0 0 3 3 2 - 50 50
(Practical)
5. CS 303 Discrete Structures 3 1 0 4 4 50 50 100
6. CS 304 Microprocessors 3 1 0 4 4 50 50 100
Microprocessors
7. CS 354 0 0 3 3 2 - 50 50
(Practical)
8. AS 201 Economics 3 0 0 3 3 50 50 100
Vocational Training
9. CS 355 - - - - 2 - 50 50
(After 2nd Sem)
Total 15 04 09 28 27 250 450 700
Second Year -Fourth Semester

Sr. Paper
Marks Marks
Analysis and Design
1. CS 401 3 1 0 4 4 50 50 100
of Algorithms
Analysis and Design
2. CS 451 of Algorithms 0 0 3 3 2 - 50 50
(Practical)
3. CS 402 Web Technologies 3 1 0 4 4 50 50 100
Web Technologies
4. CS 452 0 0 3 3 2 - 50 50
(Practical)
5. CS 403 Operating Systems 3 1 0 4 4 50 50 100
Operating Systems
6. CS 453 0 0 3 3 2 - 50 50
(Practical)
7. CS 404 Software Engineering 3 1 0 4 4 50 50 100
Software Engineering
8. CS 454 0 0 3 3 2 - 50 50
(Practical)
Computer
9. CS 405 Architecture and 3 1 0 4 4 50 50 100
Organization
Total 15 05 12 32 28 250 450 700
5
Third Year - Fifth Semester

Sr. Paper
Marks Marks
Data Communication
1. CS 501 3 1 0 4 4 50 50 100
and Networks
Technical
2. CS 551 Communication and 0 0 3 3 2 - 50 50
Soft Skills (Practical)
3. CS 502 Computer Graphics 3 1 0 4 4 50 50 100
Computer Graphics
4. CS 552 0 0 3 3 2 - 50 50
(Practical)
5. CS 503 Artificial Intelligence 3 1 0 4 4 50 50 100
Artificial Intelligence
6. CS 553 0 0 3 3 2 - 50 50
(Practical)
Principle of
7. CS 504 Programming 3 1 0 4 4 50 50 100
Languages
Theory of
8. CS 505 3 1 0 4 4 50 50 100
Computation
Industrial Training
9. CS 556 - - - - 2 - 50 50
(After 4th Sem)
Principles of
10. CS 506 3 - - 3 - - - -
Designing (optional)
Total 18 05 09 32 28 250 450 700
6
Third Year - Sixth Semester

Sr. Paper
Marks Marks
Computer Networks
1. CS 601 3 1 0 4 4 50 50 100
and Security
Computer Networks
2. CS 651 and Security 0 0 3 3 2 - 50 50
(Practical)
Linear Algebra and
3. CS 602 3 1 0 4 4 50 50 100
Probability Theory
Modeling and
4. CS 603 3 1 0 4 4 50 50 100
Simulation
Modeling and
5. CS 653 0 0 3 3 2 - 50 50
Simulation (Practical)
6. CS 604 Compiler Design 3 1 0 4 4 50 50 100
Compiler Design
7. CS 654 0 0 3 3 2 - 50 50
(Practical)
8. Elective-I 3 1 0 4 4 50 50 100
9. Elective-I (Practical) 0 0 3 3 2 - 50 50
Total 15 05 12 32 28 250 450 700
7
Elective-I

Sr. Paper
Marks Marks
Software Testing and
1. CS 605A 3 1 0 4 4 50 50 100
Quality Assurance
CS 655A Software Testing and
2. Quality Assurance 0 0 3 3 2 - 50 50
(Practical)
3. CS 605B Soft Computing 3 1 0 4 4 50 50 100
Soft Computing
4. CS 655B 0 0 3 3 2 - 50 50
(Practical)
Data Mining and
5. CS 605C 3 1 0 4 4 50 50 100
Analysis
Data Mining and
6. CS 655C 0 0 3 3 2 - 50 50
Analysis (Practical)
Mobile Application
7. CS 605D 3 1 0 4 4 50 50 100
Development
Mobile Application
8. CS 655D Development 0 0 3 3 2 - 50 50
(Practical)
Data Acquisition and
9. CS 605E 3 1 0 4 4 50 50 100
Interfacing
Data Acquisition and
10. CS 655E 0 0 3 3 2 - 50 50
Interfacing (Practical)
Multimedia
11. CS 605F 3 1 0 4 4 50 50 100
Computing
Multimedia
12. CS 655F Computing 0 0 3 3 2 - 50 50
(Practical)
8
Fourth Year - Seventh Semester
Sr. Paper Subject Title Scheme of Teaching University Internal Total

No Code External Sessional
Marks Marks
L T P Hrs Credit
1. CSE711 Compiler Design 3 1 0 4 4 50 50 100
2. CSE761 Compiler Design 0 0 3 3 2 - 50 50

(Practical)
3. CSE712 Multimedia System Design 3 1 0 4 4 50 50 100

4. CSE713 Software Testing & Quality 3 1 0 4 4 50 50 100
Assurance
5. CSE763 Software Testing & Quality 0 0 3 3 2 - 50 50

Assurance (Practical)
6. Elective -I 3 1 0 4 4 50 50 100
7. CSE767 Project I 0 0 6 6 3 - 100 100
8. CSE768 Seminar 0 0 2 2 1 - 50 50
9. CSE769 Industrial Training (After - 2 - 100 100

th
6 Semester)
Total 12 4 14 30 26 200 550 750
Elective -I
CSE 714 Information Security
CSE 715 Business Intelligence
CSE 716 Mobile Computing
9
Fourth Year - Eighth Semester
Sr. Paper Subject Title Scheme of Teaching University Internal Total

No Code Sessional
L T P Hr Credit External Marks
Marks
1. CSE811 Advanced Database 3 1 0 4 4 50 50 100
Systems
Digital
2. CSE812 Image 3 1 0 4 4 50 50 100
Processing
Digital
3. CSE862 Image 0 0 3 3 2 - 50 50
Option Processing (Practical)
1 100
4. Elective II 3 1 0 4 4 50 50
5. Elective II 0 0 3 3 2 - 50 50
(Practical)
6. Elective III 3 0 0 3 3 50 50 100

7. CSE858 Project II 0 0 6 6 3 - 100 100
Totall 12 3 12 27 22 200 400 600
Option 1. CSE860 Industrial Training - - - - 22 200 400 600

2
Tot
al - - - - 22 200 400 600
Elective II (Theory) Elective II (Practical) Elective III (Theory)
CSE
CSE 813 Network CSE 863 Network 816 Soft Computing
Programming Programming
(Practical)
CSE
CSE814 Visual Programming CSE864 Visual Programming 817 Embedded Systems
(Practical)
CSE
CSE815 Java Technologies CSE865 Java Technologies 818 Building Enterprise
(Practical) Applications
10
Second Year - Third Semester
Branch: Computer Science and Engineering
Title DATA STRUCTURES Credits 04

Code CS 301 Semester: - 3rd LTP 310
Max. Marks External: - 50 Internal: - 50 Elective N
Pre- Programming Fundamentals (CS 101/201), Object Contact 45
requisites Oriented Programming (CS 202) Hours
Time 3 Hours
Objectives 1. To develop proficiency in the specification, representation, and implementation of
data types and data structures.
2. To understand the basic concepts of the fundamentals of different types of data
structures.
3. To demonstrate the ways of implementation of different types of data structures.
4. To learn the techniques to solve problems like sorting, searching, insertion and
deletion of data etc. related to data structures.
Note for The Semester question paper of a subject will be of 50 marks having 7 questions of equal
Examiner marks. First question, covering the whole syllabus and having questions of conceptual
nature, will be compulsory. Rest of the paper will be divided into two parts having three
questions each and the candidate is required to attempt at least two questions from each
part.
SECTION-A Hrs
Complexity Analysis: Time and Space complexity of algorithms, asymptotic analysis, big 4
O and other notations, importance of efficient algorithms, program performance
measurement, data structures and algorithms.
Linear Lists: Abstract data type, sequential and linked representations, comparison of 8
insertion, deletion and search operations for sequential and linked lists, list and chain
classes, doubly linked lists, circular linked lists, applications of lists in bin sort, radix sort,
sparse tables.
Stacks and Queues: Abstract data types, sequential and linked implementations, 4
representative applications such as parenthesis matching, towers of Hanoi.
Sorting: Bubble sort, selection sort, insertion sort, Shell sort,Quick sort, Heap sort, Merge 7
sort; Radix sort, Analysis of the sorting methods, Selecting the top k elements.
SECTION-B
Trees: Binary trees and their properties, terminology, sequential and linked 7
implementations, tree traversal methods and algorithms, Heap data structure and its
applications as priority queues, heap implementation, insertion and deletion operations,
Heapsort.
Search & Multi-way Trees: Binary search trees, search efficiency, insertion and deletion 7
operations, importance of balancing, AVL trees, B-trees, B+ trees
Graphs: Definition, terminology, directed and undirected graphs, properties, connectivity 5
in graphs, applications, implementation adjacency matrix and linked adjacency chains,
graph traversal breadth first and depth first, spanning trees.
Hashing: hashing as a search structure, hash table, collision avoidance, linear open 3
addressing, chaining.
11
Suggested 1. Y. Langsam, M. J. Augenstein, A. M. Tanenbaum: Data Structures
Books using C and C++, 2nd Edition, Pearson Education
2. R. Kruse, C. L. Tondo, B. Leung, S. Mogalla: Data Structures &
Program Design n C. 2nd Edition, Pearson Education
References:
1. E. Horowitz, S. Sahni, D. Mehta :Fundamentals of Data Structures
in C++, 2ndEdition, Universities Press
2. Donald E. Knuth::Art of Computer Programming, Volume 1:
Fundamental algorithms, 3rd Edition, Addison-Wesley
3. Art of Computer Programming, Volume 3: Sorting and Searching,
2nd Edition, Addison-Wesley
Course Assessment will consists of following components
Assessment 1. Two Minors (30% Weightage )
Methods 2. Quiz (7.5%)
3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
Course On completion of this course, a student must be able to
Outcomes 1. Understand common data structures (such as arrays, linked lists, stacks, queues,
priority queues, trees, heaps, hash tables, associative containers).
2. Understand the algorithms that build and manipulate different types of data
structures including sorting, searching, and hashing algorithms.
3. Decide, apply and implement the appropriate data type and data structure for a
given problem.
4. Make appropriate data structure and algorithm design decisions with respect to
program size, execution speed, and storage efficiency.
Mapping of
Course CO PO
Outcomes A B C D E F G H I J K L
with POs 1 X X
2 X X
3 X
4 X
12
Title DATA STRUCTURES (PRACTICAL) Credits 02

Max. 50 Elective N
Marks
Time 3 Hours
Note Practical should be covered based on the following directions:
List
1. Implementation of array operations: Traversal, Insertion & Deletion at and from a
given location
2. Stacks: Implementation of Push, Pop; Conversion of Infix expression to Postfix,
Evaluation of Postfix expressions.
3. Queues: Circular Queue: Adding & deleting elements.
4. Linked list: inserting, deleting, implementation of stacks & queues using linked
lists; Polynomial addition.
5. Trees: Implementation of Binary & Binary Search Trees, Recursive and Non-
recursive traversal of Trees.
6. Implementation of Graphs
7. Implementation of sorting and searching algorithms
8. Hash tables implementation: searching, inserting and deleting
13
Title DATABASE SYSTEMS Credits 04

th
Code CS 302 Semester: - 4 LTP 310
Max. External: - 50 Internal: - 50 Elective N
Marks
Pre- Introduction to Computer Science and Engineering(CS102), Contact 45
requisites Programming Fundamentals(CS101/201) Hours
Time 3 Hours
Objectives The main objective of this course is to provide students with the background to design,
implement, and use database management systems. This course offers a good
understanding of database systems concepts and prepares the student to be in a position
to use and design databases for different applications. Behind the development and
design of this course is to know.
How to design, manipulate and manage databases.
The course participants are exposed to the various forms, types and models of
database systems to enable them make viable choices.
Supportive and complementary concepts of managing data and documents are
thoroughly examined to give a wholesome view of data/information
management.
The ultimate aim is to encourage the usage of database management systems for
effective data management.
Note for The Semester question paper of a subject will be of 50 marks having 7 questions of
Examiner equal marks. First question, covering the whole syllabus and having questions of
conceptual nature, will be compulsory. Rest of the paper will be divided into two parts
having three questions each and the candidate is required to attempt at least two
questions from each part.
SECTION-A Hrs
Introduction to Database Systems: 6
File Systems Versus a DBMS, Advantages of a DBMS, Components of DBMS,
Describing and Storing Data in a DBMS, Database System Architecture, Data
abstraction, Data independence, Schemas.
Physical Data Organization: 3

Fixed length and Variable Length Records, File Organizations and Indexing, Index Data
Structures, Hashing, B-trees, Clustered Index, Sparse Index, Dense Index.
Data Models: 4
Relational Model, Network Model, Hierarchical Model, ER Model: Entities, Attributes
and Entity Sets, Relationships and Relationship Sets, Constraints, Weak Entities, Class
Hierarchies, Aggregation, Conceptual Database Design with the ER Model, Comparison
of Models.
The Relational Model: 4
Introduction to the Relational Model, ER to Relational Model Conversion, Integrity
Constraints over Relations, Enforcing Integrity Constraints, Relational Algebra,
Relational Calculus, Querying Relational Data.
Relational Query Languages:
SQL: Basic SQL Query, Creating Table and Views, SQL as DML, DDL and DCL, SQL 6
Algebraic Operations, Nested Queries, Aggregate Operations, Cursors, Dynamic SQL,
Integrity Constraints in SQL, Triggers and Active Database, Relational Completeness,
Basic Query Optimization Strategies, Algebraic Manipulation and Equivalences.
14
SECTION-B
Database Design: 6
Functional Dependencies, Reasoning about Functional Dependencies, Normal Forms,
Schema Refinement, First, Second and Third Normal Forms, BCNF, Multi-valued
Dependency, Join Dependency, Fourth and Fifth Normal Forms, Domain Key Normal
Forms, Decompositions
Transaction Management: 6
ACID Properties, Serializability, Concurrency Control, Concurrency problems: Dirty
read, Lost update, Incorrect summary, Lock Management, Locking Protocols: Two
phase, Time stamp, Validation based, Multiversion and Granularity based, Deadlocks
Handling.
Backup and Recovery: 6
Types of Database Failures, Types of Database Recovery, Recovery Techniques:
Deferred Update, Immediate Update, Shadow Paging, Checkpoints, Buffer Management.
Database Protection: 4
Threats, Access Control Mechanisms, Discretionary Access Control, Grant and Revoke,
Mandatory Access Control, Bell LaPadula Model, Role Based Security, Firewalls,
Encryption and Digital Signatures.
Suggested
Books
S. Authors Title Publisher Editio Year
No n
.
1. Ramez Elmasri, Fundamentals of Pearson Fifth 2007
Shamkant Database Systems Education Edition
Navathe
References:
1. C.J. Date An Introduction to Pearson Eighth
Database Systems Education Edition
2. Alexis Leon, Database
Mathews Leon Management
Systems
3. S. K. Singh Database Systems Pearson
Concepts, Design Education
and Applications
4. Raghu Database Tata
Ramakrishnan, Management McGraw-
Johannes Systems Hill
Gehrke
5. Abraham System Concepts Tata
Silberschatz, McGraw-
Henry F. Korth, Hill
S. Sudarshan
4. Attendance (5%)
5. Final Exam (50%)
15
Outcomes
1. Design ER and Relational models for real world problems with normalized
data.
2. Construct simple and moderately advanced database queries using Structured
Query Language (SQL) and Procedural SQL (PL/SQL).
3. Understand the concept of transactions along with achieving concurrency
control through serializability and locking protocols.
4. Design and implement various Security and integrity controls.
Mapping of
Course CO PO
with POs 1 X X
2 X X
3 X X
4 X X X
16
Title DATABASE SYSTEM (PRACTICAL) Credits 02

Code CS 352 Semester: - 4th LTP 003
Max. 50 Elective N
Marks
Time 3 Hours
List
1. Introduction to SQL and installation of SQL Server / Oracle.
2. Data Types, Creating Tables, Retrieval of Rows using Select Statement,
Conditional Retrieval of Rows, Alter and Drop Statements.
3. Working with Null Values, Matching a Pattern from a Table, Ordering the Result
of a Query, Aggregate Functions, Grouping the Result of a Query, Update and
Delete Statements.
4. Set Operators, Nested Queries, Joins, Sequences.
5. Views, Indexes, Database Security and Privileges: Grant and Revoke Commands,
Commit and Rollback Commands.
6. PL/SQL Architecture, Assignments and Expressions, Writing PL/SQL Code,
Referencing Non-SQL parameters.
7. Stored Procedures and Exception Handling.
8. Triggers and Cursor Management in PL/SQL.
17
Title DISCRETE STRUCTURES Credits 4

Max. Marks External: 50 Internal: 50 Elective N
Pre-requisites Contact 45
Hours
Time 3 Hours
Objectives 1. To get familiar and understand the fundamental notions in discrete
mathematics.
2. To introduce the knowledge of core mathematical foundation of
computer science.
3. Be exposed to concepts and properties of algebraic structures such
as semi groups, monoids and groups.
4. Be aware of the counting principles.
5. To introduce the basic properties of graphs and trees and model simple
applications.
Note for The Semester question paper of a subject will be of 50 marks having 7 questions
Examiner of equal marks. First question, covering the whole syllabus and having questions
of conceptual nature, will be compulsory. Rest of the paper will be divided into
two parts having three questions each and the candidate is required to attempt at
least two questions from each part.
SECTION-A Hrs
Set theory: 9
Definition of sets and proof by induction; Peano postulates; Relations; representation
of relations by graphs; properties of relations; equivalence relations and partitions;
Partial orderings; Posets; Linear and well-ordered sets.
Functions: 5
Mappings; injection and surjections; composition of functions; inverse functions;
special functions; pigeonhole principle.
Mathematical reasoning: 9
Propositions; negation disjunction and conjunction; implication and equivalence; truth
tables; predicates; quantifiers; natural deduction; rules of Inference; methods of proofs
used in program proving
SECTION-B
Combinatorics: 6
Elementary combinatorics; counting techniques; recurrence relation; generating
functions.
Graph Theory: 10
Introduction, Graphs Multigraph, Isomorphic Graph, Homeomorphic Graphs, Paths
and Circuits, Shortest Paths In weighted Graphs, Eulerian and Hamiltonian Paths and
Circuits, Konigsberg Bridge, Complete , Regular, Bipartite Graphs, Planar Graphs,
Graph Coloring, Graph Traversal Techniques. Trees, Binary Search Trees, Complete
& Extended Binary Trees.
Groups: 6
Definition and elementary properties of groups, semigroups, monoids, rings, fields and
lattices.
18
Suggested
Books S. Authors Title Publisher Edition Year Other
No. Detail
s
1. C.L.Liu, Elements of Tata Third 2012
DP Discrete McGraw Edition
Mohapatra Mathematics Hill
2. K.H.Rosen, Discrete Tata Seventh 2012
Mathematics McGraw Edition
and Hill
applications
3. Lipschutz Discrete McGraw Latest 2012
Mathematics, Hill, Edition
McGraw
Hill,
4. B. Kolman, Discrete PHI latest 2004
R. C. Busby Mathematica Edition
and S. C. l Structures ,
Ross
4. Attendance (10%)
5. Final Exam (50%)

Outcomes 1. Get familiar and understand the fundamental notions in discrete
mathematics.
2. Acquire the knowledge of core mathematical foundation of computer
science.
3. Aware of the counting principles, basic properties of graph, trees and
model simple applications.
4. Exposed to concepts and properties of algebraic structures such as semi
groups, monoids and groups.
Mapping of
Course CO PO
Outcomes
with POs A B C D E F G H I J K L
1. X X X X
2. X X X X X
3. X X X X
4. X X X X
19
Title MICROPROCESSORS Credits 04

Marks
requisites Programming Fundamentals(CS101/201) Hours
Time 3 Hours
Objectives Provide students with the opportunity to gain experience in microprocessor-based system
design, assembly language programming, and I/O interfacing to microprocessors. This
course is intended as a first level course for microcomputer and embedded system design.
Designer of an embedded system must have a thorough understanding of hardware,
software and system integration. In view of this, various aspects of hardware design, such
as interfacing of memory and different types of I/O devices, will be covered in details. As
it is customary to write software in machine or assembly language for embedded system
applications, laboratory assignments will be on assembly language programming of 8085.
1. This course contains fundamental principles of 8085 microprocessor, its hardware
interfacing and programming.
2. After completion of this course the student must be able to use 8085
microprocessor and its peripherals in small applications.
part.
SECTION-A Hrs
Microprocessor Architecture and Microcomputer Systems: 4
Microprocessor Architecture Memory, Input and Output Devices, the 8085 MPU, Example
of an 808S-Based Microcomputer, Memory Interfacing, The SDK-85 Memory System.
Interfacing I/O Devices: 4
Basic Interfacing Concepts, Interfacing Output Displays, Interfacing Input Devices,
Memory Mapped I/O, Testing and Troubleshooting, I/O Interfacing Circuits.
Programming the 8085: 7
Introduction to 8085 Assembly Language Programming, The 8085 Programming Model,
Instruction Classification, Instruction format. Data Transfer (Copy) Operations, Arithmetic
Operations, Logic Operations Branch Operations, Writing Assembly Language Programs.
8
Programming Techniques with Additional Instructions:
Programming Techniques Looping, Counting and Indexing, Additional Data Transfer -'arid
16-Bit Arithmetic Instructions, Arithmetic Operations Related to Memory, Logic
Operations.
SECTION-B
Counters and Time Delays: 4
Counters and Time Delays, Hexadecimal Counter, Modulo: Ten Counter, Generating Pulse
Waveforms, Debugging Counter and Time-Delay Programs.
Stack and Subroutines: 4
Stack, Subroutine, Conditional Call and Return Instructions.
Interrupts: 4
The 8085 Interrupt 8085 Vectored interrupts.
Interfacing Data Converters: 4
20
Digital- to- Analog (01 A) Converters, Analog- to- Digital (A/D) Converters.
General -Purpose Programmable Peripheral Devices:
The 82S5A Programmable Peripheral Interface, Illustration: Interfacing Keyboard and
Seven- Segment Display, Illustration: Bi- directional-Data Transfer between Two 6
Microcomputers, The 8254 Programmable Interval Timer, The 8259 A Programmable
Interrupt Controllers, and Direct Memory. Access (DMA) and the 8257 DMA Controller,
serial communication, Programmable communications interface 8251.
Suggested
Books
S. Authors Title Publishe Editio Year
No r n
.
1. Ramesh S. Microprocessor Pearson third
Gaonkar Programming edition
and
Architecture,
Applications
with the 8085
References:
1. Charles Microprocessor Tata
M.Gilmor Principles and McGraw
e Applications, Hill.
2. Douglas Microprocessors Tata second
V. Hall and Interfacing McGraw edition
programming Hill.
and Hardware
4. Attendance (5%)
5. Final Exam (50%)
Outcomes 1. Identify the basic element and functions of microprocessor, describing the
architecture of microprocessor and its peripheral devices, memory interfacing.
2. Demonstrate the fundamental understanding on the operation between the
microprocessor and its interfacing devices, testing and troubleshooting, circuit
diagrams along with description.
3. Apply the programming techniques in developing the assembly language program
for microprocessor application, types of instructions and its uses, 8-bit as well as
16-bit programming, looping, counter delay executions, issues related to
debugging.
4. Understand the concepts of stack and subroutines, its need in microprocessors,
various types of interrupts, interrupt handling, instructions related to interrupts and
related programming, interfacing data convertors and brief introduction to various
general purpose programmable peripheral devices and its interfacing with 8085
microprocessor.
21
Mapping of
Course CO PO
with POs 1 X
2 X X
3 X
4 X X X
22
Title MICROPROCESSORS (PRACTICAL) Credits 0

Max. 50 Elective N
Marks
Time 3 Hours
List
1. Familiarization of 8085 kit.
2. Applications of data movement instructions to develop relevant programs.
3. Verification of arithmetic and logic operations using above kits.(At least 5
programs)
4. Application of assembly language using 8085 instructions set to develop various
5. Programs.
6. Development of interfacing circuits of various control applications based on 8085.
23
Title ECONOMICS Credits 03

rd
Code AS 201 Semester: - 3 LTP 300
Marks
Pre- Contact 45
requisites Hours
Time 3 Hours
Objectives 1. To make students understand how society manages its scarce resources for
achieving maximum satisfaction.
2. To make students learn about economic aspects related to a consumer, firm, market
and economy.
part.
SECTION-A Hrs
Introduction to Economics 5
Nature of Economics, Economic Thoughts, Economic Activities, Relationship of
Economics with other Social Sciences and Engineering
Theory of Consumer Behaviour 10
Demand: Types, Law of Demand, Determinants of Demand and Change in Demand
Elasticity of Demand: Nature, Degrees, Types, Measurement and Factors Affecting
Elasticity of Demand and its Application
Laws of Consumption: Concept and Applicability of Law of Diminishing Marginal Utility
and Law of Equi-Marginal Utility
9
Theory of Production and Cost
Cost: Types of Costs, Production: Law of Variable Proportion, Returns to Factor and
Returns to Scale, Economies and Diseconomies of Scale
SECTION-B
8
Theory of Market
Nature and Relevance of Perfect Competition, Monopoly and Monopolistic Competition
Basic Concepts of Macroeconomics 8

National Income: Concept and Measurement, Determination of Equilibrium of Income
Inflation: Concept, Causes and Effect of Inflation, Measures to Control Inflation
Economics of Software:- Why should software be valued? Principles of valuation. Cost 5
versus value. Market value of software companies. Examples of estimation of the value of
software.
Sales expectations and discounting. Alternate business models. Risks when outsourcing and
offshoring development.
Suggested
Books 1. Ahuja H. L., Modern Economics, S. Chand & Co. Ltd
2. Gupta M. L. & Gupta S. P., Economics For Engineers, ESS PEE
24
Publications
3. Gio Wiederhold: Valuing Intellectual Capital, Multinationals and
Taxhavens; Springer Verlag, August 2013.
4. Ahuja H. L., Business Economics, S. Chand & Co. Ltd
5. Jhingan M.L., Macroeconomic Theory, Konark Publisher Pvt. Ltd.
6. Stiglitz J. & Walsh Carl E., Principles of Microeconomics, W.W.
Norton & Company
7. Stiglitz J. & Walsh Carl E., Principles of Macroeconomics, W.W.
Norton & Company
8. Mankiw N Gregory, Principles of Economics, Cengage Learning
9. Kreps A., Course in Microeconomics Theory, Prentice Hall
10. Samuelson Paul A. & Nordhaus William D., Economics, Tata
McGraw Hill
11. Gravelle H. & Reiss R., Microeconomics, Pearson Education
12. Ahuja H. L., Macro Economics: Theory and Practice, S. Chand &
Co. Ltd.
Assessmen 1. Two Minors (30% Weightage )
t Methods 2. Quiz (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
Outcomes 1. Apply engineering knowledge to maximize profit, satisfaction and welfare.
2. Identify the forces that affect the economy.
3. Apply concepts of economy to software development.
Mapping
of Course CO PO
with POs 1 X X
2 X X X X X
3 X X X X
25
Second Year -Fourth Semester
Title ANALYSIS AND DESIGN OF ALGORITHMS Credits 04

Marks
requisites Data Structures (CS301) Hours
Time 3 Hours
Objectives To understand the different algorithms design techniques and to understand the
algorithm analysis approach.
SECTION-A Hrs
Introduction:- Revisiting space/time complexity and asymptotic notations; Recurrences: 08
writing recurrences, solving recurrences: iterative substitution, recursion-tree method,
Masters theorem, substitution method.
Divide and Conquer:- General method, Analysis of divide and conquer based solutions 07
to: Binary Search, Merge sort, Quick sort, Selection sort; finding maximum and
minimum using divide and conquer, Strassens matrix multiplication.
Greedy Algorithms:- Elements of Greedy strategy, Activity Selection Problem, 08

Knapsack problem, Single source Shortest paths problem, Minimum Spanning tree
problem and analysis of these problems.
SECTION-B
Dynamic Programming:- Elements of dynamic programming, Assembly-line 12
scheduling problem, Matrix-chain multiplication, Multistage Graph, All Pairs Shortest
paths, Longest common subsequence, 0/1 Knapsack.
Backtracking: - General method, N-Queen's problem, Graph coloring problem, Sum of 06
subsets Problem
NP-Completeness:- Polynomial Time, polynomial-time verification, NP-completeness 04
and reducibility, NP-complete problems
Suggested
Books
S. Authors Title Publisher Edition Year
No
.
1. Thomas H. Introduction to -
Cormen, Algorithms
Charles E.
Leiserson,
Ronald L.
Rivest
26
References:
1. Ellis Fundamentals of Galgotia
Horowitz, Computer
Sartaj Algorithms
Sahni
2. Aho A.V., The Design and Pearson
Hopcroft Analysis of Edu
J.E., Computer cation
Ullman Algorithms
J.D.
3. Goodman Introduction to McGraw-
S.E. & the Design and Hill
Hedetniemi Analysis of
Algorithms

Outcomes
1. Understand different measures for time and space complexities.
2. Understand the different algorithm design approaches including Divide and
Conquer, Greedy, Dynamic Programming, Backtracking and Branch and
Bound.
3. Understand P and NP class of problems.
Mapping of
Course CO PO
with POs 1 X
2 X
3 X
27
Title ANALYSIS AND DESIGN OF ALGORITHMS Credits 02

(PRACTICAL)
Max. 50 Elective N
Marks
Time 3 Hours
List 1. Divide & Conquer
2. Greedy Method
3. Dynamic Programming
4. Backtracking
28
Title WEB TECHNOLOGIES Credits 4

Max. External: 50 Internal: 50 Elective N
Marks
requisites Programming Fundamentals(CS101/201 Hours
Time 3 Hours
Objectives Aim of this course is to familiarize the students with current technologies used in Web
development and maintenance
1. To introduce the concepts of Internet ,WWW and underlying technologies
2. To enable the student to use of HTML, DHTML, CSS for Static Webpage
creation.
3. To introduce the concept of JavaScript for Client Side programming.
4. To introduce the concept of byte code and Java Programming to develop
architecture (Platform) neutral application.
5. To study the concept of XML for data interchange across different platforms
6. To introduce the concept of PHP for various web servers
7. To demonstrate the concept of integrating AJAX and PHP with MySQL.
SECTION-A Hrs
INTERNET AND WORLD WIDE WEB:
Introduction, Internet addressing, ISP, types of Internet connections, introduction to
WWW, web browsers, web servers, URL, HTTP, DNS, web applications, tools for web
site creation. 4
HTML: Introduction to HTML, lists, adding graphics to HTML page, creating tables,
linking documents, frames, DHTML and cascading style sheets. 7
Java Script: Introduction, programming constructs: variables, operators and
expressions, conditional checking, functions and dialog boxes, JavaScript DOM,
creating forms, objects like Window, Navigator, History, Location, introduction to
cookies, 11
SECTION-B
XML: Why XML, XML syntax rules, XML elements, XML attributes, XML DTD
displaying XML with CSS. 6
PHP: Introduction, syntax, variables, statements, operators, decision making, loops,
arrays, strings, forms, get and post methods, functions, cookies, sessions. 11
PHP and MySQL: Introduction to MySQL, connecting to MySQL database, creation,
insertion, deletion and retrieval of MySQL data using PHP, PHP and XML, XML
parsers, XML DOM. 6
Suggested
Books S. Authors Title Publisher Edition Year
No
.
1 Deitel,Deitel,Nieto XML How to Pearson
, and Sandhu Program, Education.
2 Herbert Scheldt Java 2: The Complete TMH Fifth
29
Reference Edition
3 Ivan Bayross : Web Enabled BPB
Commercial, Development
Application
4 Schafer HTML,CSS, Wiley

Textbooks. JavaScript,Perl, India
Python and PHP

4. Attendance (5%)
5. Final Exam (50%)

Outcomes 1. Understand the core principle on which Internet and WWW operates and ability
to create static web pages using HTML, CSS and DHTML.
2. Create dynamic and interactive web contents using the concept of JavaScript,
Session and Cookies in Software development.
3. Understand the basic principle of Object Oriented Technology and ability to
create powerful but robust standalone application using Java.
4. Understand the concept of add on technologies like AJAX, XML and ability to
develop Web Pages using PHP and AJAX and MySQL for server side scripting
Mapping
of Course CO PO
Outcomes
1 X X X X X X
2 X X X X X
3 X
4 X X X X
30
Title WEB TECHNOLOGIES (Practical) Credits 02

Max. 50 Elective N
Marks
Time 3 Hours
List 1. Creation of Web pages using: HTML, DHTML
2. Creation of Web pages using JavaScript
3. Implementing basic concepts of Java
4. Creation of Web pages using AJAX
5. Database and AJAX
6. XML
7. PHP
31
Title OPERATING SYSTEM Credits 04

Max. External: - 50 Internal: - -50 Elective N
Marks
Pre- Introduction to Computer Science and Engineering Contact 45
requisites (CS102), Programming Fundamentals (CS101/201), Data Hours
Structures (CS301).
Time 3 Hours
Objectives 1. To introduce design and implementation issues of various Operating

Systems: batch, multiprogrammed, time sharing, real time, distributed,
parallel Operating System structural Components, layered structure,
functions
2. To understand concept of processes, CPU Scheduling Algorithms: FCFS,
SJF, RR and Priority, Inter Process Communication, Process
Synchronization, Critical Sections, Semaphores and Monitors.
3. To introduce Deadlocks Detection , Recovery, Avoidance and Prevention
4. To familiarize with Memory Management using contiguous memory
allocation, paging, segmentation, segmentation with paging.
5. To introduce Virtual Memory, demand paging and page replacement
algorithms (FIFO, Optimal, LRU), Thrashing.
6. To understand File Systems, directory structure, allocation methods
(contiguous, linked, indexed), free-space management (bit vector, linked
list, grouping) and Protection mechanisms.
7. To discuss Disk Structure, Disk Scheduling (FCFS, SSTF, SCAN, C-
SCAN, and LOOK), Disk Management (Disk Formatting, Boot Blocks, and
Bad Blocks), Swap Space Management (Swap Space use, Swap Space
Location, Swap Space Management).
8. To explore case Studies: Brief introduction of MS-DOS, Windows, UNIX
and LINUX.
conceptual nature, will be compulsory. Rest of the paper will be divided into two
parts having three questions each and the candidate is required to attempt at least
two questions from each part.
SECTION-A Hrs
Introduction: What is an O.S., O.S. Functions; Different types of O.S.: batch,
multiprogrammed, time sharing, real time, distributed, parallel; General structure of
operating system, O/S services, system calls. 5
Process Management: Introduction to processes - Concept of processes, process 10

scheduling, operations on processes; Interprocess Communication, Critical Sections,
Mutual Exclusion with Busy Waiting, Sleep and Wakeup, Semaphores, Message
passing; CPU scheduling- scheduling criteria, pre-emptive & non-pre-emptive
scheduling, Scheduling Algorithms: FCFS, SJF, RR and priority, Threads.
Deadlocks: Introduction to deadlocks, Conditions for deadlock, Resource allocation 6
graphs, Deadlock Detection and Recovery, Deadlock Avoidance, Deadlock Prevention
SECTION-B
Memory Management: background, logical vs. physical address space, memory
32
management without swapping; swapping; contiguous memory allocation, paging, 6
segmentation, segmentation with paging; Virtual Memory, demand paging,
performance, page replacement, page replacement algorithms (FIFO, Optimal ,LRU);
Thrashing.
File Systems: Files - file concept, file structure, file types, access methods, File 6
attributes, file operations; directory structure, allocation methods (contiguous, linked,
indexed), free-space management (bit vector, linked list, grouping), Protection
mechanisms.
Secondary Storage : Disk Structure, Disk Scheduling ( FCFS, SSTF, SCAN, C- 6
SCAN, LOOK), Disk Management (Disk Formatting, Boot Blocks, Bad Blocks),
Swap Space Management (Swap Space use, Swap Space Location, Swap Space
Management)
Case Studies: Brief introduction of MS-DOS, Windows, UNIX and LINUX. 6
Suggested
No. Details
1 Silberschat Operating Addison
z and System Wesley
Galvin Concepts Inc.
2 Tanenbaum Operating Pearson
A.S System Design Education.
&
Implementation
3 Bhatt and An introduction Prentice
Chandra to Operating Hall of
Systems India
Concepts and Publication
Practice,
4. Attendance (5%)
5. Final Exam (50%)
On completion of this course, a student must be able to
Course 1. Design and implement solutions for CPU scheduling, process
Outcomes synchronization and deadlock related problems.
2. Understand the concepts of memory management, Secondary storage
management and File system management along with providing solutions
for real world problems.
3. Explore features and functionality of MS-DOS, Windows, Unix and Linux.
Mapping of
Course CO PO
with POs 1 X X X
2 X X
3 X X X
33
Title OPERATING SYSTEM (PRACTICAL ) Credits 02

Max. 50 Elective N
Marks
Time 3 Hours
List
1. Learning Basic Features and Operating Environment of UNIX and LINUX.
2. Introduction to Shell and Shell Commands.
3. Shell programming: creating a script, making a script executable, shell syntax
(variables, conditions, control structures, functions, commands).
4. Process: starting new process, replacing a process image, duplicating a process
image, waiting for a process.
5. Programming with semaphores.
34
Title SOFTWARE ENGINEERING Credits 4

Code CS 404 Semester: -4th LTP 310
requisites (CS102), Programming Fundamentals (CS101/201) Hours
Time 3 Hours
Objectives This course aims to give students a theoretical foundation in software engineering.
Students will learn about the principles and methods of software engineering, including
current and emerging software engineering practices and support tools.
1. To understand the concept and need of Software Engineering principles, SDLC,
process models and tools.
2. To understand project management as an umbrella activity for software
development including schedule and cost estimations.
3. To study the concept of software requirements and their changing nature
4. To understand various software architectures and design principle in software
Engineering.
5. Understanding good coding practices, including documentation, contracts,
regression tests and daily builds.
6. To understand various quality assurance and testing techniques, including unit
testing, functional testing and automated testing.
7. To study various CASE tools and understand the methodologies working behind
these tools.
8. To understand model based software development using UML.
SECTION-A Hrs
Introduction: 4
Introduction to Software Engineering, System Engineering Vs Software Engineering,
Software Evolution, Software Characteristics, Cost of Software Production, Software
Components, Crisis Problem and Causes, Challenges in Software Engineering.
Software Process Models: 8
SDLC, Waterfall Model, Incremental Model, Prototyping Model, Evolutionary Model,
Spiral Model, Rapid Application Development Model, Rational Unified process
Model, Agile Methods, Xtreme programming, SEI Capability Maturity Model
Software Requirements Analysis and Specification Concepts: 4
Requirement Engineering, Requirement Elicitation Techniques, Requirements
Documentation, Characteristics and Organization of SRS,
Software Analysis and Design: 8
Design Principles, Design issues and Approaches, Abstraction, modularity, Coupling,
Cohesion, Structured Analysis and Design, DFD, Object oriented Design, Data Design,
Architectural design, Interface Design, Component Level Design, Object Oriented
Design Concepts, Structured vs. Object Oriented Analysis.
SECTION-B
35
Project Management Concepts: 6
Management Activities, Project Planning, Project Scheduling, Size Estimation LOC,
FP; Cost Estimation Models COCOMO, COCOMO-II.
Coding & Testing: 5
Coding, Coding Standards, Coding Conventions, Programming Style, Verification and
Validation, Testing Process, Design of Test Cases, Software Testing Strategies, Unit
Testing, Integration Testing, Top Down and Bottom Up Integration Testing, Alpha &
Beta Testing, System Testing and Debugging.
Technical Metrics for Software: 4
Software Measurements: What and Why, A Framework for Technical Software
Metrics, Metrics for the Analysis Model, Metrics for Design Model, Metrics for
Source Code, Metrics for Testing, Metrics for Software Quality, Metrics for
Maintenance.
CASE (Computer Aided Software Engineering) and Introduction to UML: 6
CASE and its Scope, Building blocks of CASE, CASE Tools, CASE Environment,
UML Concepts, Use Case Diagrams, Sequence Diagrams, Collaboration Diagrams,
Class Diagrams, State Transition Diagrams, Component and Deployment Diagrams.
Suggested
Books S. Authors Title Publisher Editio Year
No. n
1 Ian Software Engineering Pearson Sevent
Sommervill Education. h
e Edition
References
1 R.S. Software Engineering: A McGraw Sixth
Pressman Practitioner's Approach Hill. Edition
2 Pfleeger, Software Engineering: Pearson Second
J.M. Atlee Theory and Practice, , Education Edition
3 Douglas Software Engineering for Pearson Fourth

Bell Students. Education Edition
4 Pankaj An Integrated Approach to Narosa Second

Jalote Software Engineering, Edition
5 K.K.Aggar Software Engineering New Age Second
wal, Internatio Edition
Yogesh nal.
Singh
Assessment will consists of following components
Course 1. Two Minors (30% Weightage )
Assessment 2. Quiz (7.5%)
Methods 3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)
Outcomes 1. Demonstrate an understanding of various process models and be able to select
appropriate process model for a particular project.
2. Use software cost estimation and scheduling techniques for small programs.
3. Understand SRS and create architecture design for software systems using CASE
tools.
4. Devise test plan, test case and test suit using Black Box and White Box Testing.
36
Mapping
of Course CO PO
Outcomes
1 X X
2 X X X
3 X X
4 X X
37
Title SOFTWARE ENGINEERING (PRACTICAL) Credits 02

Max. 50 Elective N
Marks
Time 3 Hours
List
1. Study the features of MS-Project.
2. Use MS-Project/OpenProj/similar tool to draft project plan for a particular project
case study.
3. Use MS-Project/OpenProj/similar tool to generate various reports like Gantt chart,
Network diagram, Resource usage sheet.
4. Use MS-Project/OpenProj/similar tool to track the progress of a project.
5. Study the concepts of UML modeling.
6. Use Rational Rose/StarUML/similar tool to generate use case diagrams.
7. Use Rational Rose/StarUML/similar too to generate sequence diagrams.
8. Use Rational Rose/StarUML/similar too to generate class diagrams.
9. Use Rational Rose/StarUML/similar too to generate collaboration diagrams.
10. Study the features of a particular CASE tool for requirements specification,
analysis, design and cost estimation.
11. Apply each of the above tools to a particular case study.
38
Title Computer Architecture & Organization Credits 04

Max. External: - -50 Internal: 50 Elective N
Marks
requisites (CS102) Microprocessors CS 304 Hours
Time 3
Hours
Objectives This course offers a good understanding of the various functional units of a
computer system and prepares the student to be in a position to design a basic
computer system.
SECTION-A Hrs
Module 1: Basic organization of computers, Block level description of the functional 6
units as related to the execution of a program; Fetch, decode and execute cycle.
Module 2: Machine instructions, Instruction set architectures, Assembly language 6

programming, addressing modes, instruction cycles, registers and storage, addressing
modes; discussions about RISC versus CISC architectures; Inside a CPU:
Module 3: Information representation, Floating point representation (IEEE 754), 10
computer arithmetic and their implementation; Fixed-Point Arithmetic: Addition,
Subtraction, Multiplication and Division, Arithmetic Logic Units control and data path,
data path components, design of ALU and data path, controller design; Hardwired and
Micro programmed Control .
SECTION-B
Module 4: Memory Technology, static and dynamic memory, Random Access and 8
Serial Access Memories, Cache memory and Memory Hierarchy, Address Mapping,
Cache updation schemes, Virtual memory and memory management unit.
Module 5: I/O subsystems: Input-Output devices such as Disk, CD-ROM, Printer etc.; 8
Interfacing with IO devices, keyboard and display interfaces; Basic concepts Bus
Control, Read Write operations, Programmed IO, Concept of handshaking, Polled and
Interrupt-driven I/O, DMA data transfer.
Module 6: Pipeline Processing, Instruction and Arithmetic Pipeline, Pipeline hazards 7

and their resolution, Parallel Processing.
39
Suggested S. Authors Title Publisher Edition Other
Books N Details
o.
1 V. Carl Computer Tata
Hamacher, Organization McGraw-
Safwat G. Hill series
Zaky and (2002)
Zvonko G.
Vranesic
2 David Computer Elsevier

Patterson and Organization (2008)
John and Design
Hennessey,
3. M. Morris Computer Pearson Third
Mano System Edition
Architecture
4 J.P. Hays Computer Tata
Architecture McGraw- Third
and Hill Edition
Organization
5 William Computer Pearson Seventh
Stallings Organization Edition
and
Architecture
4. Attendance (5%)
5. Final Exam (50%)
Outcomes 1. Understand basic organization and functional units of Computer and
principles and implementation of computer arithmetic.
2. Understand and Design the different functional units and control unit of
CPU
3. Understand the concepts of memory and I/O organization
4. Understand pipelining and parallel processing concepts.
5. Evaluate and design of a basic computer system
Mapping
of Course CO PO
with POs
1 X X
2 X X X X
3 X X
4 X X
5 X X X X X
40
Third Year - Fifth Semester
Title DATA COMMUNICATION AND NETWORKS Credits 04

Max. Marks External: - 50 Internal: - -50 Elective N
Pre- Contact 45
requisites Hours
Time 3 Hours
Objectives 1. To introduce the concepts and terminology of Data Transmission.

2. To understand concept of Data Encoding and Data Communication
Interface.
3. To familiarize with Multiplexing, Switching Techniques, LAN
Technologies.
4. To study and explore different Protocol Architectures, Error detection and
correction techniques, MAC layer protocols, Channel access methods,
Address resolution protocol and Ethernet technologies.
SECTION-A Hrs
Data Transmission/The Physical Layer: Concepts and Terminology, Analog and
Digital Data Transmission, Transmission Impairments, Guided Transmission Media,
Wireless Transmission, Communication Satellites, The Public Switched Telephone 5
Network, The Mobile Telephone System, Cable Television
Data Encoding: Digital Data: Digital and Analog Signals, Analog Data: Digital and 3
Analog Signals, Spread Spectrum
Data Communication Interface: Asynchronous and Synchronous Transmission, Line
Configurations, Interfacing 3
Multiplexing: Frequency-Division Multiplexing, Synchronous Time-Division 2
Multiplexing, Statistical Time-Division Multiplexing
Circuit Packet and Switching: Switched Networks, Circuit-Switching Networks, 4
Switching Concepts, Routing in Circuit-Switched Networks, Control Signaling,
Packet-Switching Principles, Routing, Congestion Control, X.25 282
Frame Relay: Frame Relay Protocol Architecture, Frame Relay Call Control, User 3
Data Transfer, Network Function, Congestion Control
LAN Technology and Systems: LAN Architecture, BusITree LANs, Ring LANs, Star 6
LANs, Wireless LANs, Ethernet and Fast Ethernet (CSMA/CD), Token Ring and
FDDI, 100VG-AnyLAN, ATM LANs, Fibre Channel, Wireless LANs, Bridge
Operation, Routing with Bridges
SECTION-B
Protocols and Architecture: Protocols, OSI, TCP/IP Protocol Suite 3
Examples of networks: Arpanet, and Internet. Examples of Data Communication 6
Services: X.25 Networks, Frame relay, Broad band ISDN and ATM. Physical Layer:
Transmission media- Narrow band ISDN: Services-Architecture- Interface, Broad
band ISDN and ATM- Virtual Circuits versus Circuit Switching Transmission in
ATM networks. FDDI
41
Link Layer and Local Area Networks Data link layer: Service provided by data 10
link layer-Error detection and correction Techniques-Elementary data link layer
protocols -Sliding Window protocols - Data link layer in HDLC, Internet and ATM .
Multiple Access protocols: Channel partitioning protocols: TDM-FDM-Code Division
Multiple Access(CDMA) .Random Access protocols : ALOHA, CSMA and
CSMA/CD . Local area Network: LAN addresses- Address Resolution Protocol-
Reverse Address Resolution Protocol. Ethernet: Ethernet Technologies-IEEE
standards- Hubs-Bridges and Switches
Suggested
No. Details
1 Andrew S. Computer Pearson 4th 2003
Tanenbaum Networks Education
2 James F. Computer Pearson 2002
Kurose and Networking Education
Keith W.
Ross
3 William Data and Pearson 7th 2004
Stalling Computer Education
Communication
4 Miller Data and Thomson 2001
Network Learning
Communication
5 Douglas E Computer Pearson 2nd 2001
Comer Networks and Education
Internets
4. Attendance (5%)
5. Final Exam (50%)
On completion of this course, a student must be able to
Course 1. Describe contemporary terminology, progress, issues and trends in the area
Outcomes of data communication and networks.
2. Understand and evaluate the different data communication techniques and
LAN architectures.
3. Describe services and protocols of Data Link layer and familiarize with
channel access methods.
4. Analyse the different error detection and congestion control mechanisms
for LAN.
Mapping of
Course CO PO
with POs 1 X X
2 X X
3 X X X
4 X X X
42
Title TECHNICAL WRITING AND COMMUNICATION Credits 02

SKILLS (PRACTICAL )
Max. 50 Elective N
Marks
Time 3 Hours
List
1. Remedial Grammar: Errors of accidence and syntax with reference to
parts of speech; Agreement of subject and verb; Tense and Concord; Conditional
clauses; Use of connectives in complex and compound sentences; Question tags and
short responses.
2. Vocabulary and Usage: Word Formations (by adding suffixes and
prefixes); Technical Word Formation; Synonyms, Antonyms, Homophones, and
Homonyms; One Word Substitution; Misappropriations; Indianisms; Redundant
Words; Phrasal Verb Idioms
3. Technical Writing:
A. Scientific Attitude and Impersonal Style; Plain Statements, Definitions;
Description and Explanations (of objects, instruments, Processes, Scientific
Principles, etc.) Summarizing and abstracting; Expressing ideas within a restricted
word limit; Paragraph Writing (Paragraph division, introduction and the
conclusion, Variety in sentences and paragraphs) Interpretation and use of charts,
graphs and tables in technical writing. Punctuation
B. Reading at various speeds (slow, fast, very fast); reading different kinds of texts
for different purpose (e.g. for relaxation, for information, for discussion at a later
stage, etc.); reading between the lines. Comprehension of Unseen Passages
43
Title COMPUTER GRAPHICS Credits 04

Pre- Contact 45
requisites Hours
Time 3 Hours
Objectives The course provides a comprehensive introduction to computer graphics leading to the
ability to understand the terminology, progress, issues and trends in the area. The detailed
coverage of graphics based algorithms enables the students to draw various geometric
objects as well as to perform 2-D & 3-D transformations on them. This course further
discusses the techniques for designing animation sequences and to achieve realism in
rendering such as hidden surface elimination, shading.
part.
SECTION-A Hrs
Graphics Hardware: 4
Application areas of Computer Graphics, Overview of graphics systems, Video-display
devices, Raster scan systems, Random scan systems, Graphics Input and Output devices.
Output Primitives: 9
Points and Lines, Line Drawing Algorithms: DDA Algorithm, Bresenhams Line
Algorithm, Circle Generating Algorithm: Mid point circle algorithm, Ellipse Generating
Algorithms: mid point ellipse algorithm, Pixel Addressing and Object Geometry, Boundary
Fill Algorithms, Flood Fill Algorithms, Character Generation, Line, Area-Fill and Character
Attributes.
Two Dimensional Geometric Transformations and Viewing: 9
Basic Transformations: Translation, Rotation and Scaling, Matrix Representations,
Composite Transformations, Viewing Pipeline, Window to Viewport Coordinate
Transformation, Clipping Operations: Line, Polygon, Curve and Text Clipping.
SECTION-B
Three Dimensional Concepts, Transformations and Viewing: 6
Three Dimensional Display Methods, Three Dimensional Transformations; Three
Dimensional Viewing Pipeline; Viewing Coordinates; Specifying the View Plane,
Projections: Parallel Projections, Perspective Projections.
Splines and Curves: 5
Curved Lines and Surfaces, Spline Representations, Cubic Splines, Bezier Curves and their
properties, B-Spline Curves.
Visible Surface Detection Methods: 7
Classification of Visible Surface Detection Methods, Back Face Detection, Depth Buffer,
A-Buffer, Scan Line and Depth-Sorting Methods, Wireframe Methods, Concepts of
Computer Animation, Design of Animation Sequences.
Illumination Models and Shading: 5
Light sources, Basic Illumination models, Shading models: Flat and Smooth Shading
44
Suggested 1. Donald Hearn, M.P. Baker : Computer Graphics C Version, Second
Books Edition, Pearson Education.
References:
1. J. D. Foley, A. van Dam, S.K. Feiner, J.F. Hughes: Computer Graphics:
principles and practice, Second Edition, Pearson Education.
2. Z. Xiang, R.A. Plastock: Computer Graphics, Second Edition, Schaums
Outlines, Tata McGraw-Hill.
3. N. Krishnamurthy: Introduction to Computer Graphics, Tata McGraw-
Hill.
4. David F. Rogers, James Alan Adams : Mathematical Elements for
Computer Graphics,Tata McGraw-Hill.
5. S. Harrington: Computer Graphics: A Programming Approach, Tata
McGraw-Hill.

4. Attendance (5%)
5. Final Exam (50%)

Outcomes 1. Understand contemporary terminology, progress, issues and trends in the area of
computer graphics.
2. Design algorithms for drawing various graphical entities like lines, circles, ellipses,
etc.
3. Transform graphical objects in 2D and 3D space.
4. Draw realistic objects and animation sequences by using splines, curves, surfaces,
and by applying lighting, shading and hidden surface elimination algorithms.
Mapping of
Course CO PO
with POs 1 X X X X
2 X X X
3 X X X
4 X X X
45
Title COMPUTER GRAPHICS (Practical) Credits 02

Max. 50 Elective N
Marks
Time 3 Hours
List 1. Introduction to Borland Graphics Interface (BGI) and graphics libraries such as
OPENGL, Cairo.
2. Implement DDA, Bresenham and midpoint line drawing algorithms.
3. Implement midpoint circle drawing algorithm.
4. Implement ellipse drawing algorithm.
5. Performing transformations in 2D space.
6. Performing 3D transformations.
46
Title ARTIFICIAL INTELLIGENCE Credits 4

Pre- Discrete Structures (CS 303), Analysis and Design of Contact 45
requisites Algorithms (CS 401) Hours
Time 3 Hours
Objectives 1. To introduce the AI techniques to solve problems and search strategies to find
optimal solution paths from start to goal state.
2. To introduces different knowledge representation methods in AI Programs.
3. To introduce different design techniques for Game Playing Programs.
4. To introduce the AI Agents their design, planning and learning techniques.
5. To introduce the natural language processing and expert systems.
SECTION-A Hrs
Introduction: 4
Artificial Intelligence and its applications, Artificial Intelligence Techniques, criteria of
success
Problem solving techniques: 9
State space search, control strategies, heuristic search, problem characteristics, production
system characteristics., Generate and test, Hill climbing, best first search, A* search, AO*
search, Constraint satisfaction problem, Agenda Driven Search, Mean-end analysis, Min-
Max Search, Alpha-Beta Pruning, Iterative Deepening
Knowledge representation: 8
Mapping between facts and representations, Approaches to knowledge representation,
procedural vs declarative knowledge, Forward vs. Backward reasoning, Matching, conflict
resolution, Weak and Strong filler structures, semantic nets, frame, conceptual dependency,
scripts.
SECTION-B
Non Monotonic and Statistical Reasoning 8
Non monotonic Logic, Default Logic, Circumscription, Bayes Theorem, Bayesian Network,
Dempster Shafer Theory, Fuzzy sets, Fuzzy Logic, Defuzzification.
Planning and Learning Agents: 9
Intelligent Agents, Nature and structure of Agents, Learning Agents, Introduction to different
Forms of Learning,
The Planning problem, planning with state space search, partial order planning, planning
graphs, planning with propositional logic, Analysis of planning approaches, Hierarchical
planning, conditional planning, Continuous and Multi Agent planning.
Introduction to Learning and Expert system: 7
Expert systems, Expert system examples, Expert System Architectures, Rule base Expert
systems, Non Monotonic Expert Systems, Decision tree base Expert Systems.
47
Suggested
Books S. No. Authors Title Publisher Editio Year Other
n Details
1. Stuart J. AI: A Pearson Latest 2012
Russel, Peter Modern Education Edition
Norvig Approach
2. Elaine Rich, Artificial McGraw Third 2010
Knight Intelligence Hill Edition
3. Saroj Artificial Cengage First 2011
Kaushik Intelligence Learning, Edition
,
4. Partick Artificial Addison Latest 2012
Henry Intelligence Wesley Edition
Winston ,
5. George Artificial Pearson Latest 2010
Luger Intelligence Education Edition
6. DAN, W. Introductio PHI latest 2011
Patterson n to AI and Edition
Expert
Systems, ,
7. A.J. Nillson Principles Narosa latest 2010
of AI, publications Edition
,
4. Attendance (5%)
5. Final Exam (50%)
Outcomes 1. Understand fundamental AI concepts and and identify a range of symbolic and
non-symbolic AI techniques.
2. Demonstrate an understanding of various searching algorithms such as
adversarial search and game-playing commonly used in artificial intelligence
software.
3. Use different knowledge representation techniques used in AI Applications.
4. Demonstrate an understanding of agent-based AI architectures and an
understanding of Planning and logic-based agents.
Mapping of
Course CO PO
with POs
1. X X X
2. X X X X
3. X X X X
4. X X X X
48
Title ARTIFICIAL INTELLIGENCE (Practical) Credits 02

Max. 50 Elective N
Marks
Time 3
Hours
List 1. Program Related to Problem Solving techniques of AI
Breadth First Search
Depth First Search
Heuristic Search
Best Search
Min-Max Search with alpha-beta pruning
Tic-Tac-Toe problem
N-Queens and N-Knight problem
Unification Algorithm
2. Introduction To AI Languages such as LISP, PROLOG
3. Representing Knowledge using RuleML
4. Using semantic Web
5. Knowledge of using Neural Networks, Fuzzy logic, genetic algorithms
6. Other new AI Techniques
49
Title PRINCIPLES OF PROGRAMMING LANGUAGES Credits 04

Max. External: - 50 Internal: 50 Elective N
Marks
Pre- Programming Fundamentals(CS101/201) Contact Hours 45
requisites
Time 3
Hour
s
Objectives This course should provide the students with a fairly good concept of fundamental concepts
and design issues of programming languages and become familiar with major programming
paradigms. Understand similarities and differences between models and know when to use
them and also learn programming techniques appropriate for each model.
Examiner marks. First question, covering the whole syllabus and having questions of conceptual nature,
will be compulsory. Rest of the paper will be divided into two parts having three questions
each and the candidate is required to attempt at least two questions from each part.
SECTION-A Hrs
Introduction: 5
Study of principles and major concepts in various programming paradigms like imperative,
functional, object-oriented and logic programming. Introduction to various phases of compilers,
Formal translation models: BNF Grammars.
Imperative Programming: 7
Location, reference and expressions, assignment and control, data types, blocks, procedures and
modules.
Object Oriented Programming:
Classes and objects, abstraction and encapsulation, inheritance, Polymorphism, virtual functions
and classes, abstract classes.
Logic Programming: 8
Unification, SLD-resolution, Backtracking, Cuts.
Concepts Of Concurrent Programming: Processes, synchronization primitives.
SECTION-B
Functional Programming: 10
Functions as first class objects, higher order functions, polymorphic data types, type checking
and type inference
Storage Management: 10
Static storage management, Heap storage management.
Illustration of the above concepts using representative languages: C++, Java, and Prolog etc. 5
Suggested
Books S. Authors Title Publisher Editio Year Other
No n Details
.
1. Prattt & Programming Pearson 5th
Zelkowrtz, Languages: Education
Design &
Implementatio
n
2 Friedman, Essentials of MIT Press Latest
Wand, and Programming 2001, ISBN
50
Haynes Languages, 0262062178,
978026206217
6
3 Bruce J. Principles of Oxford Latest
MacLenna Programming University
n Languages: Press US, 1999,
Design, ISBN
Evaluation, and 0195113063,
Implementatio 978019511306
n 8
Other Recommended Text/Material
1. Programming in Standard ML 97: A Tutorial Introduction by Stephen
Gilmore, Laboratory for Foundations of Computer Science, The
University of Edinburgh , September 1997 (Revised: July 1998, April
2000, Jan 2003) Available at : http://www.dcs.ed.ac.uk/home/stg
Assessmen 2. Quiz (7.5%)
t Methods 3. Assignment (7.5%)
4. Attendance (5%)
5. Final Exam (50%)

Outcomes 1. Understand and demonstrate different language concepts and how various operations
and principles are implemented by different programming languages.
2. Analyze, design, implement and test various language paradigms and understanding
importance of each for various applications
3. Analyzing semantic issues related with different Programming languages.
4. Improve skills in programming techniques for development of new applications.
Mapping
of Course CO PO
with POs 1 X X X
2 X X X
3 X X X
4 X X X
51
Title THEORY OF COMPUTATION Credits 4

Max. External:-50 Internal: -50 Elective N
Marks
Pre- Contact 45
requisites Hours
Time 3 Hours
Objective This course will provide the in-depth knowledge of various computing models like Finite
s State Machine, Pushdown Automata and Turing machine..
questions each and the candidate is required to attempt at least two questions from each part.
SECTION-A Hrs
Finite Automata: 7
Introduction: Basic mathematical notation and techniques, Finite Automata (FA),
Deterministic Finite Automata (DFA), Non-deterministic Finite Automata (NFA),
Finite Automata with Epsilon transitions.
Regular Expression and Languages: 7
Regular Expression, Finite Automata and Regular Expressions, Regular and Non-
regular languages, Closure properties of regular languages, Equivalence of Finite
Automaton and regular expressions, Minimization of Automata, Pumping lemma
for regular sets
Grammars and Languages: 7
Introduction, types of grammar, Context-free grammar, derivation and languages,
ambiguity, Simplification of context-free grammars: Elimination of useless
symbols, unit productions and Null productions, Normal Forms: Greibach normal
form (GNF) and Chomsky normal form (CNF)
SECTION-B
Pushdown Automaton: 8
Pushdown Automaton: definition, moves, instantaneous descriptions,
Deterministic Pushdown automaton, Equivalence of Pushdown automaton and
Context free languages (CFL), Pumping lemma for CFL.
Turing Machines: 8
Definitions of Turing Machines, models, computable languages and functions,
Techniques for Turing machine construction, Multi-head and Multi-tape Turing
machines, The halting problem.
Undecidability: 8
Unsolvable problems and computational functions, Recursive and recursively
enumerable languages, Tractable and Intractable problems, P and NP
completeness, Polynomial time reductions.
Suggested
No n Details
.
1 J. E. Introduction to Pearson 2nd 2008
Hopcroft, Automata Education
R. Theory,
Motwani, J. languages and
D. Ullman computations
52
2 J. C. Martin Introduction to Tata 2007
languages and McGraw
theory of Hill
computation Publishing
Company
3 K L P Theory of Prentice 3rd 2004
Mishra, N Computer Hall of
Chandrasek Science- India
aran Automata,
Languages and
Computation
Outcomes 1. Express computer science problems as mathematical statements and formulate proofs
2. Understand key topics of theory of computation
3. Design finite state machine, Pushdown Automaton and Turing machine
4. Explain the Decidability or Undecidability of various problems.
Mapping
of Course CO PO
with POs 1 X X
2 X X X
3 X X X X X
4 X X X X X
53
Title Principle of Designing Credits 4
Max. Elective Optional Course
Marks
Pre- Contact 45
requisites Hours
Time 3 Hours
Objectives 1. Conceptualisation and development of innovative, commercially important and socially
sound decisions related to engineering products, processes and systems.
2. To train students to translate academic developments in electronics, computational,
materials and energy engineering to real life applications of interest to industry for
accelerated start of career.
part.
SECTION-A Hrs
Introduction to designing 7
Fundamentals of engineering designs and applications; social, economic, sustainability,
environmental and aesthetic rationales in design engineering, design decisions related to
competitiveness of products, processes, services and systems. Impact of product design on
business and market, product portfolio development through continuity in designing.
Managing technologies and innovations 7

Technology road mapping, market and trend analyses for design decisions, managing
technology and innovations, protecting designs by intellectual property rights, IPR gap
analysis, creative thinking, technology sharing and transfer, founding start up companies,
raising seed funding, challenges of conceiving, creating and growing a new venture.
Design process 7
Principles, tools and strategies for conceptualising the need and presenting designs -
product specifications, digital tools, analog drawings, design modeling: mathematical
modeling, simulation using computers, and creation of 2D and 3D scale models.
Engineering fundamentals related to mechanical, electrical, electronic and computational
concepts in designing; environmental, sustainability, life cycle analysis, upstream
manufacturing economics and downstream assembly, distribution, recyclability, robustness,
maintenance and safety aspects in design development; functional prototypes, iterations,
validation of product concept, product development .
SECTION-B
Materials in Engineering Designs 8
Mechanical and structural properties of materials, application related needs, stress analysis
and fracture, heat transfer, conductivity, transparency, surface properties etc.
Nanomaterials, transparent ceramics, polymers, biocompatible materials, composites for
biomechanical applications. Case studies through examples and minor projects on
designing materials for dental restorative applications, energy harvesting technologies and
transparent ceramics.
54
Computational Designs 6
Theory and applications of computational design and manufacturing methods, use of tools
like, computer aided design, computer aided engineering, computer aided manufacturing,
Digital image capture and reconstruction, additive and subtractive manufacturing using
CAD CAM, milling and 3D approaches. Examples by case studies and minor projects for
designing prosthetics and orthosis.
Challenges of Energy in Engineering Designs 4

Energy source, quality, costing, storage, utilisation, conservation and sustainability in
engineering designs. Examples by case studies and minor projects on small energy capture,
storage and management technologies.
Smart Systems in Engineering Designs 6

Smart system technologies, real time sensing and communication, embedded intelligence,
designing for internet of things, data acquisition and hardware interfacing and robotics.
Case studies and minor projects related to devices for visually and hearing challenged
individuals, traffic sensing and information analysis.
Suggested
Books 1. Michael Luchs, Scott Swan, Abbie Griffin, 2015. Design Thinking. 405 pages, John
Wiley & Sons, Inc (ISBN 978-1-118-97180-2)
2. Geoffrey Boothroyd, Peter Dewhurst and Winston A Knight, 2011. Product Design for
Manufacture and Assembly. CRC Press.
3. Nigel Cross, 2008. Engineering Design Methods: Strategies for Product Design. Wiley &
Sons (ISBN 978-0-470-51926-4)
4. Richard G Budynas and J Keith Nisbett, 2010. Mechanical Engineering Design. . Mc

Graw Hill (ISBN 978-0-07-352928-8).

Outcomes 1. Develop and design engineering products that are commercially and socially
viable.
2. Develop real-time applications using engineering design.
Mapping
of Course
Outcomes CO PO
1 X X X X
2 X X X X
55
Third Year - Sixth Semester
Title COMPUTER NETWORKS AND SECURITY Credits 04

Marks
Pre- Contact 45
requisites Hours
Time 3 Hours
Objectives 1. To introduce the data communication components, data flow and network
categories and reference models.
2. To introduce the concepts of analog and digital signals, multiplexing,
transmission media and switching techniques
3. To introduce different techniques for error detection and correction, media
access and flow control protocols.
4. To introduce concepts of logical addressing, routing algorithms and
congestion control algorithms.
5. To introduce the techniques for buffering, crash recovery, network security
and application protocols.
SECTION-A Hrs
Introduction:
Data Communication: Components, Data Flow; Network Categories: LAN, MAN,
WAN (Wireless / Wired); Network Software: Concept of layers, protocols, interfaces and 7
services; Reference Model: OSI, TCP/IP and their comparison. Review of functionality of
Physical and Data Link layer.
Network Layer:
Logical Addressing: IPv4 and IPv6; Packet Formats & their comparison: IPv4 and IPv6;
Routing algorithms: Distance vector, Link State Routing, Hierarchical Routing, Broadcast 10
& Multicast Routing.
Congestion Control: Principles of Congestion Control, Congestion prevention policies,
Leaky bucket & Token bucket algorithms.
Transport Layer:
Addressing, flow control & buffering, multiplexing & de-multiplexing, crash recovery;
Example transport protocols: TCP, SCTP and UDP. 6
SECTIONB
Application Layer: 8
WWW and HTTP; File transfer Protocol: FTP Commands and Replies; Domain Name
System; SMTP, SNMP; Electronic Mail
Web Security: 7
Security in Computer Networks: Principles of Cryptography-Symmetric key-Public key-
authentication protocols; Digital Signatures, Firewalls; Security in different Layers:
Email and IP Security: 7
Secure E-mail- SSL, IP security, PGP, S/MIME, IP Security Overview and Architecture,
Key Management, SSl, TLS, SET
56
Suggested
No. Details
1 Andrew S. Computer Pearson 5th 2012 ISBN:
Tanenbau Networks Education Edition 978813178
m 7571
2 Behrouz A Data Tata 5th 2013 ISBN:

Forouzan Communications Mcgraw Edition 978125906
and Networking Hill 4753
3 William Data and Pearson 8th 2007 ISBN:
Stallings Computer Education Edition 978813171
Communications 5369
4 Douglas e. Computer Pearson 4th 2008 ISBN:
Comer Networks and Education Edition 978817758
Internets with 9276
Internet
Applications
5 James F. Computer Pearson 6th 2012 ISBN-10:
Kurose and Networking: A Education Edition 013285620
Keith W. top down 4
Ross approach
6 William Network Security Pearson 2000

Stallings Essentials Education
4. Attendance (5%)
5. Final Exam (50%)

Outcomes 1. Understand the fundamental concepts of computer networking and
enumerate the functions of Physical layer and Data Link layer.
2. Understand Network layer and Transport Layer functions and protocols.
3. Familiarize with different Application layer functions and protocols.
4. Demonstrate the knowledge of different protocols and security techniques.
Mapping of
Course CO PO
with POs 1 X X
2 X X
3 X X
4 X X X
57
Title COMPUTER NETWORKS AND SECURITY Credits 02

(Practical)
Max. 50 Elective N
Marks
Time 3 Hours
List 1. To familiarize with the various basic tools (crimping, krone etc.) used in establishing a
LAN.
2. To study various topologies for establishing computer networks.
3. To familiarize with switch , hub, connecters, cables (cabling standards) used in
networks
4. To familiarize with routers & bridges
5. To use some basic commands like ping, trace-root, ipconfig for trouble shooting
network related problems.
6. To use various utilities for logging in to remote computer and to transfer files from / to
remote computer.
7. To develop a program to compute the Hamming Distance between any two code
words.
8. To develop a program to compute checksum for an m bit frame using a generator
polynomial.
9. To develop a program for implementing/simulating the sliding window protocol.
10. To develop a program for implementing/simulating a routing algorithm.
11. To study various IEEE standards (802.3, 802.11, 802.16)
12. Implementation of Firewall in a Network.
58
Title Linear Algebra and Probability Theory Credits 4

Pre- Contact 45
requisites Hours
Time 3 Hours
Objectives 1. To introduce the concept of Linear equations and vector spaces.
2. To introduces the use of Eigen vectors and Linear transformations.
3. To introduce random variables and probability theory.
4. To introduce the use of 2-d random variables.
SECTION-A Hrs
Systems of Linear equations: 5
Introduction, Linear equations, solutions, Linear equations in two unknowns, Systems of
linear equations, equivalent systems, Elementary operations, Systems in Triangular and
echelon form, Reduction Algorithm, Matrices, Row equivalence and elementary row
operations, Systems of Linear equations and matrices, Homogeneous systems of Linear
equations. (Scope as in Chapter 1, Sections 1.1-1.10 of Reference 1).
Vector Spaces: 5
Introduction, Vector spaces, examples of vector spaces, subspaces, Linear combinations,
Linear spans, Linear dependence and Independence, Basis and Dimension, Linear equations
and vector spaces. (Scope as in Chapter 5, Sections 5.1-5.8 of Reference 1).
Eigenvalues and Eigenvectors, Diagonalization: 4
Introduction, Polynomials in matrices, Characteristic polynomial, Cayley-Hamilton theorem,
Eigen-values and Eigen-vectors, computing Eigen-values and Eigen-vectors, Diagonalizing
matrices. (Scope as in Chapter 8, Sections 8.1-8.5 of Reference 1).
Linear Transformations: 5
Introduction, Mappings, Linear mappings, Kernel and image of a linear mapping, Rank-
Nullity theorem (without proof), singular and non-singular linear mappings, isomorphisms.
(Scope as in Chapter 9, Sections 9.1-9.5 of Reference 1).
Matrices and Linear transformations: 5
Introduction, Matrix representation of a linear operator, Change of basis and Linear
operators. (Scope as in Chapter 10, Sections 10.1-10.3 of Reference 1).
SECTION-B
Probability 7
Sample Space and Events, the Axioms of probability, some elementary theorems,
Conditional probability, Bayes Theorem, Random Variables-Discrete and Continuous,
Independent random variables, Expectation, Variance and Covariance, Means and variances
of linear combinations of random variables, Chebyshevs inequality
Probability Distributions 7
Joint Probability distributions, Marginal and Conditional distributions, Binomial, Poisson,
Uniform and Normal distributions, Normal and Poisson approximations to Binomial,
Moments, Moment generating function.
Two Dimensional Random Variables 7
59
Joint distributions Marginal and conditional distributions Covariance Correlation and
Regression function of a random variable-Transformation of random variables -
Central limit theorem.
Suggested
Books S. No. Authors Title Publishe Editio Year Other
r n Details
1. Seymour Shaums McGraw- Second 1991
Lipschutz Outline of Hill Edition
, Theory and
Problems of
Linear
Algebra
2. Vivek Linear Narosa 2002
Sahai, Algebra Publishing
Vikas House
Bist
3. J. S. Introductio McGraw 4th 2007
Milton n to Hill edition
and J.C. Probability
Arnold and
Statistics
4. R.A. Probability Pearson 7th 2007
Johnson and Education edition
and C.B. Statistics
Gupta for
Engineers
5. S. C. Fundament Sultan
Gupta als of Chand and
and V.K. Mathematic Sons
Kapoor al Statistics
4. Attendance (5%)
5. Final Exam (50%)
Course Students will be able to
Outcomes 1. Understand the use of linear algebra and linear transformations.
2. Design solutions using matrices and eigen vectors
3. Apply probability theory in different engineering problems.
4. Understand the use of random variables in different applications.
Mapping of
Course CO PO
Outcomes
1. X X
2. X X X
3. X X X
4. X X X
60
Title MODELING AND SIMULATION Credits 04

Pre- Data Structures (CS 301) and Discrete Structures (CS Contact Hours 45
requisites 303)
Time 3 Hours
Objectives 1. To introduce the simulation techniques to solve real time problems where
experimentation on the actual system is very risky.
2. To introduce different discrete event and continuous simulation methods.
3. To introduce different techniques for generating random numbers and random
variates following various distributions.
4. To introduce different queuing techniques for single server and multi server systems.
5. To introduce the different simulation languages like MATLAB and GPSS.
SECTION-A Hrs
Introduction:
What is modeling and simulation, application areas, definition and types of system, model and 5
simulation, introduction to discrete-event and continuous simulation.
Simulation Methods:
Discrete-event Simulation, Time advance Mechanisms, Components and organization of 10
Discrete-event simulation, Flowchart of next-event time advance approach, Continuous
Simulation, Monte Carlo Simulation.
Queuing Models:
Single server queuing system, introduction to arrival and departure time, flowcharts for arrival 10
and departure routine. Event graphs of queuing model. Determining the events and variables,
Event graphs for inventory model.
SECTION-B
Random Numbers:
Introduction to Random Numbers, Importance of Random Numbers in Simulation, Mid-Square 5
random number generator, Residue method, Arithmetic Congruential generator, Testing
Numbers for Randomness, Chi-Square Test.
Distribution Functions:
Stochastic activities, Discrete probability functions, Cumulative distribution function,
Continuous probability functions. Generation of random numbers following binomial 10
distribution, Poisson distribution, continuous distribution, normal distribution, exponential
distribution, uniform distribution.
Simulation Languages: 5
Basic Introduction to Special Simulation Languages:-GPSS/ MATLAB/ Network Simulators.
Suggested
Books S. Authors Title Publisher Edition Year Other Details
No.
1 Averill M. Simulation Tata Mcgraw 4th 2007 ISBN: 978007
Law Modeling Hill Edition 0667334
and Analysis
2 Geoffery System Prentice-Hall of 2nd 2001 ISBN: 81-203-
61
Gordon Simulation India Edition 0140-4
3 D.S. Hira System S. Chand 1st 2001 ISBN: 81-219-
Simulation Publication Edition 2059-0
4 Stephen J. MATLAB Thomson 3rd 2005 ISBN-981-
Chapman Programmin Learning Edition 254-893-9
g for
Engineers
5 Jerry Discrete- Prentice-Hall of 5th 2009 ISBN-10:
Banks, John Event India Edition 0136062121
S. Carson, System
Barry L. Simulation
Nelson and
David M.
Nicol
6 Rudra Getting Oxford 8th 2009 ISBN-
Pratap Started with University Edition 0199731241
MATLAB: Press.
A Quick
Introduction
for Scientists
and
Engineers
4. Attendance (5%)
5. Final Exam (50%)
Outcomes 1. Understand the continuous and discrete event simulation techniques and apply them
suitably to real time problems where experimentation on actual system is risky.
2. Analysing different procedures to generate random numbers and apply them for
implementation of different simulation systems.
3. Understand different simulation languages like MATLAB and GPSS and apply them to
simulate different systems.
Mapping of
Course CO PO
with POs 1 X X
2 X
3 X X
62
Title MODELING AND SIMULATION (Practical ) Credits 02

Max. 50 Elective N
Marks
Time 3 Hours
List 1. Programming in MATLAB: Introduction, Branching statements, loops, functions,
additional data types, plots, arrays, inputs/outputs etc.
2. Introduction regarding usage of any Network Simulator.
3. Practical Implementation of Queuing Models using C/C++.
63
Title COMPILER DESIGN Credits 4

Max. Marks External:-50 Internal: -50 Elective N
Pre- Theory of Computation (CS 505) Contact 45
requisites Hours
Time 3 Hours
Objectives This course will provide the in-depth knowledge of different concepts involved while
designing a compiler.
part.
SECTION-A Hrs
Introduction: 5
Compilers and Translators; The phases of the compiler Lexical Analysis, Syntax
Analysis, Intermediate Code Generation, Optimization, Code generation,
Bookkeeping, Error handling.
Lexical Analysis: 5
The role of the lexical analyzer, Tokens, Patterns, Lexemes, Input buffering,
Specifications of a token, Recognition of a tokens, design of a lexical analyzer
generator.
Syntax Analysis: 12
The role of a parser, Context free grammars, Writing a grammar, Top down
Parsing: Recursive decent parser, Predictive parser, Bottom up Parsing: Handles,
Viable prefixes, Operator precedence parsing, LR parsers: SLR, LALR, CLR.
Parser generator (YACC).Error Recovery techniques for different parsers
SECTION-B Hrs
Syntax directed translation: 4
Syntax directed definitions, Synthesized and inherited attributes, Construction of
syntax trees.
Run time environments: 6
Source language issues (Activation trees, Control stack, scope of declaration,
Binding of names), Storage organization (Subdivision of run-time memory,
Activation records), Storage allocation strategies, Symbol tables: storage, data
structures used
Intermediate code generation: 3
Intermediate languages, Graphical representation, Three-address code,
Implementation of three address statements (Quadruples, Triples, Indirect triples)
Code optimization and code generation: 10
Introduction, Basic blocks & flow graphs, DAG, principle sources of optimization:
loop optimization, eliminating induction variable, eliminating common sub-
expression, loop unrolling, loop jamming etc. Peephole optimization, Issues in the
design of code generator, a simple code generator, Register allocation &
assignment.
64
Suggested S. Authors Title Publisher Editio Year Other
Books No n Details
.
1 A. V. Aho, Compilers: Pearson 2nd 2014
J D. Principles, Educations
Ullman, M. techniques and
S. Lam, R. tools
Sethi
2 K C Compiler Cengage 1st
Louden Construction: Learning
Principle and
Practice
3 Holub Compiler Design PHI Latest
in C Edition
4. Attendance (5%)
5. Final Exam (50%)
Outcomes 1. Understand the functioning of different phases of a compiler.
2. Understand the implementation details and concepts behind each phase of the
compiler by stressing more on the syntax analysis and further on different parsing
techniques.
3. Understand need of intermediate code generation, code optimization and actual
machine code generation techniques.
Mapping of
Course CO PO
with POs 1 X X X X X X
2 X X X X X X
3 X X X X X
65
Title COMPILER DESIGN (PRACTICAL) Credits 02

Max. 50 Elective N
Marks
Time 3 Hours
List 1. Implementation of lexical analyzer for a hypothetical language.
2. Implementation of LL parser.
3. Implementation of SLR parser.
4. Implementation of CLR parser.
5. Implementation of LALR parser.
66
Title SOFTWARE TESTING AND QUALITY ASSURANCE Credits 4

Code CS 605A Semester: -6th LTP 310
Max. External: 50 Internal: 50 Elective Y
Marks
Pre- Programming Fundamentals (CS101/201) Contact 45
requisites Hours
Time 3 Hours
Objectives This course offers a good understanding of the concepts, methods and techniques of
software testing and quality assurance and prepares students to be in a position to develop
error free and quality software.
1. To study the concept of quality control and quality assurance.
2. To study risk management and technique to manage changing requirement of
software.
3. To study change control management process to tackle changing requirement of
system
4. To study various software testing strategies for testing different type of system
under test.
5. To enable the student to extend their testing concept to real scenarios and
specialized systems.
6. To study the concepts of quality metrics and reporting formats.
part.
SECTION-A Hrs
Introduction: 7
Overview of Software Engineering, Software Process, Characteristics of a Software Process,
Process Models, Project Management Process and its Phases, Software Measurements,
Metrics, Scheduling, Estimation.
Software Quality Assurance Concepts and Standards : 8
Quality Concepts, Quality Control, Quality Assurance, SQA Activities, Software Reviews,
Formal Technical Reviews, Review Guidelines, Software Reliability, Software Safety, Quality
Assurance Standards, ISO 9000, ISO 9001:2000, ISO 9126 Quality Factors, CMM, TQM, Six
Sigma, SPICE, Software Quality Assurance Metrics.
Risk Management and Change Management: 7
Software Risks, Risk Identification, Risk Projection, Risk Refinement, The RMMM Plan,
Software Configuration Management, Baselines, Software Configuration Items, SCM Process:
Version Control, Change Control, Configuration Audit, Configuration Management for Web
Engineering.
SECTION-B
Software Testing: 7
Testing, Verification and Validation, Test Strategies for Conventional and Object Oriented
Software, Unit Testing, Integration Testing, Validation Testing, Alpha and Beta Testing,
System Testing, Recovery Testing, Security Testing, Stress Testing, Performance Testing,
Metrics for Source Code, Metrics for Testing, Debugging Process, Debugging Strategies.
67
Testing Techniques: Software Testing Fundamentals, Black Box and White Box Testing,
Basis Path Testing, Flow Graph Notation, Independent Program Paths, Graph Matrices, 8
Control Structure Testing, Condition Testing, Data Flow Testing, Loop Testing, Graph Based
Testing Methods, Equivalence Partitioning, Boundary Value Analysis, Object Oriented Testing
Methods: Applicability of Conventional Test Case Design Methods, Fault-Based Testing,
Scenario-Based Testing, Random Testing and Partition Testing for Classes, Interclass Test
Case Design.
Testing Process and Specialized Systems Testing: 8
Test Plan Development, Requirement Phase, Design Phase and Program Phase Testing,
Testing Client/Server Systems, Testing Web based Systems, Testing Off-the-Shelf Software,
Testing in Multiplatform Environment, Testing for Real Time Systems, Testing Security
Suggested
No.
1 Ian Software Engineering Pearson Seventh
Somerville Education. Edition
2 Pressman Software Engineering: TataMcGraw Sixth
A Practitioner's - Hill. Edition,
Approach
3 William E. Effective Methods for John Wiley Second
Perry Software Testing Edition
References
1. Pfleeger Software Engineering: Pearson Second
Theory and Practice Education Edition
2 K..Aggarw Software Engineering New.Age Second
al, Yogesh International Edition
Singh.
3 Pankaj An Integrated Narosa Second
Jalote Approach to Software Edition
Engineering
4 .Nina S Software Quality Narosa Second
Godbole Assurance
:Narosa. Principles and
Practice,
5 Boris Software Testing Second
Beizer Techniques Edition
4. Attendance (5%)
5. Final Exam (50%)
Outcomes 1. Understand the concept of Software Testing and Quality Assurance to develop cost
effective software system.
2. Understand the essence of risk management and control management and ability to
develop RMMM plan to mitigate risk and manage the artifacts of software system..
3. Ability to tests the system at various levels and dimensions to control error
generation and propagation which ultimately makes debugging successful and cost
effective.
4. Ability to extend the testing concept to real scenarios and specialized systems like
multiplatform, Real Time system, Client-Server system.
68
Mapping of
Course CO PO
Outcomes
1 X X X X
2 X X
3 X X X X X
4 X X X
69
Title SOFTWARE TESTING AND QUALITY Credits 02

ASSURANCE (Practical)
Code 655A Semester: - 6th LTP 003
Max. 50 Elective Y
Marks
Time 3 Hours
List 1. Study of different quality assurance and software testing tools.
2. Use of black box testing techniques to test programs.
3. Use of white box testing techniques to test programs.
4. Use of Object Oriented Testing Techniques to test programs.
5. Use of a software testing tool.
6. Use of a quality assurance tool.
7. Testing a web based system.
8. Design and Implementation of a quality assurance / software testing tool.
70
Title SOFT COMPUTING Credits 04

Code 605B Semester: - 6th LTP 310
Max. Marks External: - 50 Internal: 50 Elective Y
Pre- Artificial Intelligence (CS 503) Contact Hours 45
requisites
Time 3
Hour
s
Objectives To understand the basic soft computing techniques available and to apply these concepts
as applicable to different problems in real life.
SECTION-A Hrs
Intelligent Agents: 9
Agents Behavior and Environments, Structure of Agents, Planning Problem, Planning with state
Space Search, Partial order Planning, GRAPHPLAN, Planning in logic, Planning in non-
deterministic domains, hierarchical task planning, Multi agent planning, execution.
Probabilistic Reasoning Fuzzy Logic: 12
Knowledge representation under uncertainty, Bayesian theorem, Bayesian Networks, Dempster
Shafer theory, Representing vagueness, Fuzzy sets, operation on fuzzy sets, reasoning with
fuzzy logic, Fuzzy Automata, Fuzzy Control methods, Fuzzy decision making, inference in
temporal models, Hidden Markov Models, Kalman Filters
SECTION-B
Neural Networks: 16
Basic concepts, Single layer perception, Multilayer Perception, Supervised and Unsupervised
learning - Backpropagation networks - Kohnen's self organizing networks - Hopfield network.
Introduction to Artificial Neural Systems - Perceptron - Representation - Linear separability -
Learning Training algorithm -Adaptive networks based Fuzzy interface systems -
Classification and Regression Trees - Data clustering algorithms - Rule based structure
identification - Neuro-Fuzzy controls - Simulated annealing
Genetic Algorithms: 8
Evolutionary computation. Survival of the Fittest - Fitness Computations - Cross over
Mutation, Reproduction - Rank method - Rank space method.
Suggested
No n Details
.
1. Stuart AI: A Modern Pearson Latest
J.Russel, Approach Publication
Norvig s
2. Michael Artificial Addison 2nd 2005
Negnevitsky Intelligence: A Wesley
Guide to
Intelligent
Systems
3. James Neural Addison 1992
71
Freeman A. Networks - Wesley
and David Algorithms,
Skapura M Applications
&
Programming
Techniques
4. Yegnanaraya Artificial Prentice 1999
na B Neural Hall of
Networks India
Private Ltd
5. Goldberg, Genetic Addison latest
David E algorithms in Wesley
search,
optimization
and machine
learning

4. Attendance (5%)
5. Final Exam (50%)
Outcomes 1. Illustrate different soft computing techniques and their relation to artificial
intelligence
2. Describe, argue for and critique Soft Computing discipline. Students will be able
to use at least two of the Soft Computing techniques
3. Apply fuzzy logic and reasoning to handle uncertainty and solve engineering
problems
4. Apply genetic algorithms to combinatorial optimization problems
5. Apply neural networks to pattern classification and regression problems
6. Analyze and study the problem in question conceptually and mathematically and
solve the problem using any of soft computing techniques
Mapping of
Course CO PO
with POs 1 X
2 X X X
3 X X X X
4 X X X
5 X X X
6 X X
72
Title SOFT COMPUTING (Practical) Credits 02

Code 655B Semester: - 6th LTP 003
Max. 50 Elective Y
Marks
Time 3 Hours
List 1. Write a Matlab program to calculate union, intersection, complement of two fuzzy
sets.
2. Write a Matlab program to implement the Demorgans Law.
3. Write a Matlab program to plot Triangular, Trapezoidal and Bell-shaped
membership functions.
4. Use Matlabs Fuzzy Logic Toolbox to model the tip given after a dinner for two,
where the food can be not good, satisfying, good and delightful, and the service can
be poor, average, or good.
5. Consider the water tank with following rules
1. IF (level is okay) THEN (valve is no_change)
2. IF (level is low) THEN (valve is open_fast)
3. IF (level is high) THEN (valve is close_fast)
Using Mamdani method and maxmin method for fuzzification and method of
centroid for defuzzification method construct a FIS. Before editing that rules,
membership functions must be defined with membership function editor.
6. Write a Matlab Program to generate logical AND, NOT, XOR functions using
McCulloch-Pitts neural net.
7. Write a Matlab program for Perceptron net for an AND function with bipolar
inputs and targets.
8. Write a Matlab program to store vector[-1 -1 -1 -1] and [-1 -1 1 1] in an auto-
associative net.Find weight matrix.Test the net with [1 1 1 1] as input.
9. Write a program in Matlab to implement Roulette wheel and ranking selection
method.
10. Write a program in Matlab to maximize a function f(x,y)=xsin(4 x) + ysin(20 x)
subject to -3.0 x 12.1 and 4.1 y 5.8
73
Title DATA MINING AND ANALYSIS Credits 4

Code 605C Semester: - 6th LTP 310
Max. Marks External: 50 Internal: 50 Elective Y
Pre- Database Systems (CS 302), Artificial Intelligence (CS Contact 45
requisites 503) Hours
Time 3 Hours
Objectives To learn various data mining techniques and different ways to analyze different data
sets.
SECTION-A Hrs
Introduction: Introduction to RDBMS, Data Warehouse, Transactional Databases, Data 6
Mining Functionalities, Interestingness of pattern, classification of data mining system, major
issues
Data Warehouse and OLAP: Difference from traditional databases, Multidimensional data 6
model, Schema for Multi dimensional model, measures, concept hierarchies, OLAP
operations, starnet query model, Data Warehouse architecture, ROLAP, MOLAP, HOLAP,
Data Warehouse Implementation, Data Cube, Metadata Repositories, OLAM
Data Processing: Data Cleaning, Data Integration and Transformation, Data Reduction, 2
Discretization and concept hierarchy generation
Data Mining Architecture: Data Mining primitives, Task relevant data, interestingness 6
measures, presentation and visualization of patterns, Data Mining Architecture, Concept
Description, Data Generalization and Summarization, Attributed oriented induction,
Analytical characterization, Mining class comparisons
SECTION-B
Association Rules: Association rules mining, Mining Association rules from single level, 6
multilevel transaction databases, multi dimensional relational databases and data warehouses,
Correlational analysis, Constraint based association mining
Classification and Clustering: Classification and prediction, Decision tree induction, 6
Bayesian classification, k-nearest neighbor classification, Cluster analysis, Types of data in
clustering, categorization of clustering methods
Introduction of Mining Complex Data: Complex data objects, Mining spatial databases, 7
Multimedia databases, Time Series and sequence databases, Text databases and World Wide
Web
74
Suggested
Books S. No. Author Title Publishe Editio Year Other
s r n Details
1. J.Han Data Morgan Latest Harcourt
and M. Mining: Kaufman Edition India pvt.
Kamber Concepts publisher Ltd
and s
Techniques
2. Dunham Data Pearson Latest
Mining Educatio Edition
Introductor n
y and
Advance
Topics

4. Attendance (5%)
5. Final Exam (50%)
Course Students will be able to
Outcomes 1. Understand different ways to manage the large data set using data warehousing
techniques.
2. Analyze various multi dimensional techniques to represent data for effective
retrieval.
3. Identify different data analysis techniques like frequent pattern analysis,
classification and clustering
4. Demonstrate the use of various data mining techniques on different datasets.
Mapping of
Course CO PO
Outcomes
1. X X X
2. X X
3. X X X
4. X X X
75
Title DATA MINING AND ANALYSIS (Practical) Credits 02

Code CS 655C Semester: - 6th LTP 003
Max. 50 Elective Y
Marks
Time 3 Hours
List Students are required to perform practicals in Oracle/MS SQL Server and STATISTICA
Data Miner.
1. Building a Database Design using ER Modeling and Normalization Techniques
2. Implementation of functions, Procedures, Triggers and Cursors
3. Load Data from heterogeneous sources including text files into a predefined
warehouse schema.
4. Design a data mart for a bank to store the credit history of customers in a bank .Use
this credit profiling to process future loan applications.
5. Feature Selection and Variable Filtering (for very large data sets)
6. Association Mining in large data sets
7. Interactive Drill-Down, Roll up, Slice and Dice operations
8. Generalized EM & k-Means Cluster Analysis
9. Generalized Additive Models (GAM)
10. General Classification and Regression Trees (G Trees)
11. General CHAID (Chi-square Automatic Interaction Detection) Models
12. Interactive Classification and Regression Trees
13. Goodness of Fit Computations
76
Title MOBILE APPLICATION DEVELOPMENT Credits 04

Code CS 605D Semester: - 6th LTP 310
Max. External: - 50 Internal: 50 Elective Y
Marks
Pre- Programming Fundamentals (CS 101) Contact Hours 45
requisites
Time 3
Hour
s
Objectives To learn the basics of mobile application development using Android and their testing
and deployment in different user environments.
part.
SECTION-A Hrs
Unit I: Introduction to Java and Android 9
Basic programming introduction to Java, Java Foundation Classes, Developing applications in
Java, Overview of Android platform
Unit II: Getting started with Mobility 6
Mobility landscape, Mobile platforms, Mobile apps development, , setting up the mobile app
development environment along with an emulator, a case study on Mobile app development
Unit III: Building blocks of mobile apps 6
App user interface designing mobile UI resources (Layout, UI elements, Drawable, Menu),
Activity- states and life cycle, interaction amongst activities.
SECTION-B
Unit III: Sprucing up mobile apps 16
App functionality beyond user interface - Threads, Async task, Services states and life cycle,
Notifications, Broadcast receivers, Telephony and SMS APIs
Native data handling on-device file I/O, shared preferences, mobile databases such as SQLite,
and enterprise data access (via Internet/Intranet)
Graphics and animation custom views, canvas, animation APIs, multimedia audio/video
playback and record, location awareness, and native hardware access (sensors such as
accelerometer and gyroscope)
Unit IV: Testing mobile apps 5
Debugging mobile apps, White box testing, Black box testing, and test automation of mobile
apps, JUnit for Android, Robotium, MonkeyTalk
Unit V: Deployment of apps 3
Versioning, signing and packaging mobile apps, distributing apps on mobile market place
Suggested
No n Details
.
1. Barry Burd Android I
Application
Development
All in one for
Dummies
2. Rick Android O'Reilly I 2010
77
Rogers, John Application
Lombardo , Me Development
ike Blake
3. Reto Meier Professional Wrox I 2010
Android 2
Application
Development
4. Teach Yourself SAMS I

Android
Application
Development
In 24 Hours

4. Attendance (5%)
5. Final Exam (50%)
Outcomes 1. Understand basic requirements to develop mobile applications.
2. Design and develop different mobile applications using Android platform
3. Test their application in different conditions.
4. Deploy the mobile applications in different environments.
Mapping
of Course CO PO
with POs 1 X X X X
2 X X X X
3 X X X X X
4 X X X X X
78
Title MOBILE APPLICATION DEVELOPMENT Credits 02

(Practical)
Code CS 655D Semester: - 6th LTP 003
Max. 50 Elective Y
Marks
Time 3 Hours
List Students should implement (and learn to use the tools to accomplish this task) the
following during Practical hours: (illustrative only)
1. Understand the app idea and design user interface/wireframes of mobile app
2. Set up the mobile app development environment
3. Develop and debug mobile app components User interface, services,
notifications, broadcast receivers, data components
4. Using emulator to deploy and run mobile apps
5. Testing mobile app - unit testing, black box testing and test automation
79
Title DATA ACQUISITION AND INTERFACING Credits 04

Code CS 605E Semester: - 6th LTP 310
Max. Marks External: - 50 Internal: 50 Elective Y
Pre- Contact Hours 45
requisites
Time 3
Hour
s
Objectives This course will introduce various data acquisition systems and techniques and their
application using different hardware interfacing mechanisms.
SECTION-A Hrs
Signal conditioning and data acquisition: Analog-to-digital and digital-to-analog converters; 9
sampling rate, multiplexing, resolution, range, and code width; grounding, isolation and noise;
single-ended and differential measurements; attenuation, amplification, and filtering; excitation
and linearization; impedance mismatch and loading; digital signal conditioning; signal
transmission (voltage vs. current loop); and hardware architecture of a modern multi-function
data acquisition card. Various DAS Configurations, Single Channel DAS, Multi-Channel DAS,
IC Based DAS, Data Acquisition, Data Acquisition in PLC
Fundamentals of programming logic: Labview: Virtual instruments; indicators and controls; 12

front panel and block diagram; data types and data flow programming; case and sequence
structures; arrays, loops, and clusters;
graphs and charts; sub VIs; and file I/O.
SECTION-B
Instrument control: Components of an instrument control system (GPIB and RS-232); 6
detecting and configuring instruments; and instrument drivers.
Instrumentation system design: Design specifications; functional block representation; 6
design, debugging, and testing; interpretation and presentation of data; user interface;
temperature control system design; motor speed control system design; and instrumentation
project incorporating multiple sensors, signal interfacing electronics, data-acquisition hardware,
instrument control
Buses Industry standard architecture (ISA), peripheral component Interconnect (PCI) 4
Instrumentation Buses: Serial (RS232C, USB) and Parallel (GPIB) Accelerated Graphics port
(AGP) plug-and-play devices SCSI concepts USB architecture.
Project Work: Using Labview: Generation of signal (different function generators) on PC 8
and acquiring the signal from sensor at PC again with different sampling rate and quantization
level. Representations of different characteristics of acquired signals and their analysis and
reporting.
Suggested
No n Details
.
Norvig s
80
Negnevitsky Intelligence: A Wesley
Guide to
Intelligent
Systems
&
Programming
Techniques
na B Neural Hall of
Networks India
Private Ltd
search,
optimization
and machine
learning

4. Attendance (5%)
5. Final Exam (50%)
Outcomes 1. Understand the principles of operation and limitations of the data acquisition
system (single and Multiple channels).
2. Use Labview for analysing and generating reports of various acquired signals.
3. Use different interface mechanism of devices for communication
Mapping of
Course CO PO
with POs 1 X
2 X X X
3 X X X X
81
Title DATA ACQUISITION AND INTERFACING Credits 02

(Practical)
Code CS 655E Semester: - 6th LTP 003
Max. 50 Elective Y
Marks
Time 3 Hours
List 1. Embedded Programming.
2. RF Experiments.
3. Experiments in interfacing with UbiSense.
4. Experiments in interfacing with Ubi-DAQ.
5. WSN Applications.
82
Title MULTIMEDIA COMPUTING Credits 4

Code CS 605F Semester: -6th LTP 310
Max. External: -50 Internal: - 50 Elective Y
Marks
Pre- Contact Hours 45
requisite
s
Time 3 Hours
Objectiv To provide an in-depth understanding of Multimedia system design Enabling technologies
es and standards.
Examine marks. First question, covering the whole syllabus and having questions of conceptual
r nature, will be compulsory. Rest of the paper will be divided into two parts having three
SECTION-A Hrs
Introduction: 4
Multimedia and its types, Introduction to Hypermedia, Hyper Text, Multimedia
Systems and their Characteristics, Challenges, Desirable Features, Components and
Applications, Trends in Multimedia
Multimedia Technology: 6
Multimedia Systems Technology , Multimedia Hardware devices, Multimedia software
development tools, Multimedia Authoring Tools, Multimedia Standards for Document
Architecture, SGML, ODA, Multimedia Standards for Document interchange, MHEG,
Multimedia Software for different media.
Storage Media : 4
Magnetic and Optical Media, RAID and its levels, Compact Disc and its standards,
DVD and its standards, Multimedia Servers
Audio: 8
Basics of Digital Audio, Application of Digital Audio, Digitization of Sound, Sample
Rates and Bit Size, Nyquist's Sampling Theorem Typical Audio Formats Delivering
Audio over a Network , Introduction to MIDI (Musical Instrument Digital Interface),
Components of a MIDI System Hardware Aspects of MIDI ,MIDI Messages. Audio
Compression, Simple Audio Compression Methods, Psychoacoustics ,MPEG Audio
Compression
SECTION-B
Basics of Compression : 6
Classifying Compression Algorithms, Lossless Compression Algorithms, Entropy
Encoding, Run-length Encoding, Pattern Substitution, Basics of Information theory,
Huffman Coding, Adaptive Huffman Coding, Arithmetic Coding, Lempel-Ziv-Welch
(LZW) Algorithm, Source Coding Techniques: Transform Coding, Frequency Domain
Methods, Differential Encoding.
Image and Graphics Compression : 6
Color in Images, Types of Color Models, Graphic/Image File Formats: TIFF, RIFF,
BMP, PNG, PDF, Graphic/Image Data, and JPEG Compression, GIF Compression.
Video Compression: 6
Basics of Video, Video Signals, Analog Video, Digital Video, TV standards, H. 261
Compression, Intra Frame Coding, Inter-frame (P-frame) Coding, MPEG
Compression, MPEG Video, The MPEG Video Bit stream, Decoding MPEG Video in
Software.
83
Multimedia Communication: 5
Building Communication network, Application Subsystem, Transport Subsystem,
QOS, Resource Management, and Distributed Multimedia Systems.
Suggested
Books S. Authors Title Publisher Edition Yea Other
No r Details
.
1 Ralf Steinmetz and Multimedia Pearson
Klara Nahrstedt Computing Education
Communications s
and Applications
2 Parag Havaldar, Multimedia Cengage
Gerard Medioni Systems Learning
publicatio
n
3 Prabhat K. Multimedia PHI Latest
Andleigh, Kran System Design Edition
Thakkar
4 Fred Halsall Multimedia Pearson
Communications Education
4. Attendance (5%)
5. Final Exam (50%)
Outcomes 1. Demonstrate Knowledge of Multimedia Tools and Standards
2. Understand Compression standards
3. Understand current technologies in multimedia
4. Familiarize with issues in multimedia communication systems
Mapping of CO PO
Course A B C D E F G H I J K L
Outcomes 1 X X X
with POs 2 X X X
3 X X
4 X X
84
Title MULTIMEDIA COMPUTING (Practical) Credits 02

Code CS 655F Semester: - 6th LTP 003
Max. 50 Elective Y
Marks
Time 3 Hours
List 1. Introduction to Windows Movie Maker.
2. Create a movie file using windows movie maker.
3. Introduction to Adobe Photoshop.
4. Study of Image Editing using Adobe Photoshop.
5. Introduction to Macromedia Flash.
6. Creating animated e-card using macromedia Flash.
7. Study of Corel Draw.
8. Working and designing in Corel Draw.
9. Study of Audio-Video mixing software like Audacity.
85
Fourth Year - Seventh Semester
Title COMPILER DESIGN Credits 4

Code CSE711 Semester: -7th LTP 310
Max. External:-50 Internal: -50 Elective N
Marks
Pre- Programming Fundamentals (CS101/201), Contact 45
requisites microprocessor (EC317), operating system Hours
(CSE511)
Time 3 Hours
Objectives This course will provide the in-depth knowledge of different concepts involved while
designing a compiler.
SECTION-A Hrs
Introduction: 5
Compilers and Translators; The phases of the compiler Lexical Analysis, Syntax
Analysis, Intermediate Code Generation, Optimization, Code generation,
Bookkeeping, Error handling.
Lexical Analysis: 5
The role of the lexical analyzer, Tokens, Patterns, Lexemes, Input buffering,
Specifications of a token, Recognition of a tokens, Finite automata: Regular
expressions, NFA, DFA, Design of a lexical analyzer generator.
Syntax Analysis: 12
The role of a parser, Context free grammars, Writing a grammar, Top down
Parsing: Recursive Descent parsing, Predictive parsing, Bottom up Parsing:
Handles, Viable prefixes, Operator precedence parsing, LR parsers: SLR, LALR,
CLR. Parser generator (YACC).Error Recovery techniques for different parsers
SECTION-B Hrs
Syntax directed translation: 4
Syntax directed definitions, Synthesized and inherited attributes, Construction of
syntax trees.
Run time environments: 6
Source language issues (Activation trees, Control stack, scope of declaration,
Binding of names), Storage organization (Subdivision of run-time memory,
Activation records), Storage allocation strategies, Symbol tables: storage, data
structures used
Intermediate code generation: 3
Intermediate languages, Graphical representation, Three-address code,
Implementation of three address statements (Quadruples, Triples, Indirect triples)
Code optimization and code generation: 10
Introduction, Basic blocks & flow graphs, DAG, principle sources of optimization:
loop optimization, eliminating induction variable, eliminating common sub-
expression, loop unrolling, loop jamming etc. Peephole optimization, Issues in the
design of code generator, a simple code generator, Register allocation &
assignment.
86
Suggested S. Authors Title Publisher Editio Year Other
Books No n Details
.
1 Aho, Principles of Nar
Ullman Compiler osa
Design Publication
2 Dhamdhere Compiler Macmillan,

Construction- India 198
Principles a
nd Practice
3 Holub Compiler PHI Latest
Design in C Edition
Outcomes 1. To understand the functioning of different phases of a compiler.
2. To understand the implementation details and concepts behind each phase of the
compiler by stressing more on the syntax analysis and further on different parsing
techniques.
3. To understand need of intermediate code generation, code optimization and actual
machine code generation techniques.
Mapping
of Course CO PO
with POs 1 X X X X X X
2 X X X X X X
3 X X X X X
87
Title COMPILER DESIGN (PRACTICAL) Credits 02

Code CSE761 Semester: - 7th LTP 003
Max. 50 Elective N
Marks
Time 3 Hours
List 1. Implementation of lexical analyzer for a hypothetical language.
2. Implementation of LL parser.
3. Implementation of SLR parser.
4. Implementation of CLR parser.
5. Implementation of LALR parser.
88
Title Multimedia System Design Credits 4

Max. External: -50 Internal: - 50 Elective N
Marks
Pre- Peripheral Device Interface (CSE313), Computer Contact 45
requisites Graphics (CSE613) Hours
Time 3 Hours
Objectives To provide an in-depth understanding of Multimedia system design Enabling
technologies and standards.
part.
SECTION-A Hrs
Introduction: 4
Multimedia and its types, Introduction to Hypermedia, Hyper Text, Multimedia Systems
and their Characteristics, Challenges, Desirable Features, Components and
Applications, Trends in Multimedia
Multimedia Technology: 6
Multimedia Systems Technology , Multimedia Hardware devices, Multimedia software
development tools, Multimedia Authoring Tools, Multimedia Standards for Document
Architecture, SGML, ODA, Multimedia Standards for Document interchange, MHEG,
Multimedia Software for different media.
Storage Media : 4
Magnetic and Optical Media, RAID and its levels, Compact Disc and its standards,
DVD and its standards, Multimedia Servers
Audio: 8
Basics of Digital Audio, Application of Digital Audio, Digitization of Sound, Sample
Rates and Bit Size, Nyquist's Sampling Theorem Typical Audio Formats Delivering
Audio over a Network , Introduction to MIDI (Musical Instrument Digital Interface),
Components of a MIDI System Hardware Aspects of MIDI ,MIDI Messages. Audio
Compression, Simple Audio Compression Methods, Psychoacoustics ,MPEG Audio
Compression
SECTION-B
Basics of Compression : 6
Classifying Compression Algorithms, Lossless Compression Algorithms, Entropy
Encoding, Run-length Encoding, Pattern Substitution, Basics of Information theory,
Huffman Coding, Adaptive Huffman Coding, Arithmetic Coding, Lempel-Ziv-Welch
(LZW) Algorithm, Source Coding Techniques: Transform Coding, Frequency Domain
Methods, Differential Encoding.
Image and Graphics Compression : 6
Color in Images, Types of Color Models, Graphic/Image File Formats: TIFF, RIFF,
BMP, PNG, PDF, Graphic/Image Data, and JPEG Compression, GIF Compression.
Video Compression: 6
Basics of Video, Video Signals, Analog Video, Digital Video, TV standards, H. 261
Compression, Intra Frame Coding, Inter-frame (P-frame) Coding, MPEG Compression,
MPEG Video, The MPEG Video Bit stream, Decoding MPEG Video in Software.
Multimedia Communication: 5
89
Building Communication network, Application Subsystem, Transport Subsystem, QOS,
Resource Management, and Distributed Multimedia Systems.
Suggested
No n Details
.
1 Ralf Steinmetz and Multimedia Pearson
Klara Nahrstedt Computing Education
Communications s
and Applications
2 Parag Havaldar, Multimedia Cengage
Gerard Medioni Systems Learning
publicatio
n
3 Prabhat K. Multimedia PHI Latest
Andleigh, Kiran System Design Edition
Thakkar
4 Fred Halsall Multimedia Pearson
Communications Education
4. Attendance (5%)
5. Final Exam (50%)
Outcomes 1. Demonstrate Knowledge of Multimedia Tools and Standards
2. Understand Compression standards
3. Understand current technologies in multimedia
4. Familiarize with issues in multimedia communication systems
Mapping of CO PO
Outcomes 1 X X X
with POs 2 X X X
3 X X
4 X X
90
Title SOFTWARE TESTING AND QUALITY ASSURANCE Credits 4

Max. External: 50 Internal: 50 Elective N
Marks
Pre- Programming Fundamentals (CS101/201) Contact 45
requisites Hours
Time 3 Hours
Objectives This course offers a good understanding of the concepts, methods and techniques of
software testing and quality assurance and prepares students to be in a position to develop
error free and quality software.
1. To study the concept of quality control and quality assurance.
2. To study risk management and technique to manage changing requirement of
software.
3. To study change control management process to tackle changing requirement of
system
4. To study various software testing strategies for testing different type of system
under test.
5. To enable the student to extend their testing concept to real scenarios and
specialized systems.
6. To study the concepts of quality metrics and reporting formats.
part.
SECTION-A Hrs
Introduction: 7
Overview of Software Engineering, Software Process, Characteristics of a Software Process,
Process Models, Project Management Process and its Phases, Software Measurements,
Metrics, Scheduling, Estimation.
Software Quality Assurance Concepts and Standards : 8
Quality Concepts, Quality Control, Quality Assurance, SQA Activities, Software Reviews,
Formal Technical Reviews, Review Guidelines, Software Reliability, Software Safety, Quality
Assurance Standards, ISO 9000, ISO 9001:2000, ISO 9126 Quality Factors, CMM, TQM, Six
Sigma, SPICE, Software Quality Assurance Metrics.
Risk Management and Change Management: 7
Software Risks, Risk Identification, Risk Projection, Risk Refinement, The RMMM Plan,
Software Configuration Management, Baselines, Software Configuration Items, SCM Process:
Version Control, Change Control, Configuration Audit, Configuration Management for Web
Engineering.
SECTION-B
Software Testing: 7
Testing, Verification and Validation, Test Strategies for Conventional and Object Oriented
Software, Unit Testing, Integration Testing, Validation Testing, Alpha and Beta Testing,
System Testing, Recovery Testing, Security Testing, Stress Testing, Performance Testing,
Metrics for Source Code, Metrics for Testing, Debugging Process, Debugging Strategies.
91
Testing Techniques: Software Testing Fundamentals, Black Box and White Box Testing,
Basis Path Testing, Flow Graph Notation, Independent Program Paths, Graph Matrices, 8
Control Structure Testing, Condition Testing, Data Flow Testing, Loop Testing, Graph Based
Testing Methods, Equivalence Partitioning, Boundary Value Analysis, Object Oriented Testing
Methods: Applicability of Conventional Test Case Design Methods, Fault-Based Testing,
Scenario-Based Testing, Random Testing and Partition Testing for Classes, Interclass Test
Case Design.
Testing Process and Specialized Systems Testing: 8
Test Plan Development, Requirement Phase, Design Phase and Program Phase Testing,
Testing Client/Server Systems, Testing Web based Systems, Testing Off-the-Shelf Software,
Testing in Multi Platform Environment, Testing for Real Time Systems, Testing Security
Suggested
No
.
1 Ian Software Engineering Pearson Seventh
Somerville Education. Edition
2 Pressman Software Engineering: A TataMcGr Sixth
Practitioner's Approach aw- Hill. Edition,
3 William E. Effective Methods for John Wiley Second

Perry Software Testing Edition
References
1. Pfleeger Software Engineering: Pearson Second
Theory and Practice Education Edition
2 K..Aggarwal Software Engineering New.Age Second
,Yogesh Internation Edition
Singh. al
3 Pankaj Jalote An Integrated Approach Narosa Second
to Software Engineering Edition
4 Nina S Software Quality Narosa Second
Godbole Assurance Principles
:Narosa. and Practice
5 Boris Beizer Software Testing Second
Techniques Edition
4. Attendance (5%)
5. Final Exam (50%)
Outcomes 1. Understand the concept of Software Testing and Quality Assurance to develop cost
effective software system.
2. Understand the essence of risk management and control management and ability to
develop RMMM plan to mitigate risk and manage the artifacts of software system..
3. Ability to tests the system at various levels and dimensions to control error
generation and propagation which ultimately makes debugging successful and cost
effective.
4. Ability to extend the testing concept to real scenarios and specialized systems like
multi platform, Real Time system, Client-Server system.
92
Mapping of
Course CO PO
Outcomes
1 X X X X
2 X X
3 X X X X X
4 X X X
93
Title SOFTWARE TESTING AND QUALITY Credits 02

ASSURANCE (Practical)
Max. 50 Elective N
Marks
Time 3 Hours
List 1. Study of different quality assurance and software testing tools.
2. Use of black box testing techniques to test programs.
3. Use of white box testing techniques to test programs.
4. Use of Object Oriented Testing Techniques to test programs.
5. Use of a software testing tool.
6. Use of a quality assurance tool.
7. Testing a web based system.
8. Design and Implementation of a quality assurance / software testing tool.
94
Title INFORMATION SECURITY Credits 04

Max. External: - 100 Internal: - 50 Elective Y
Marks
Pre- Computer Network (CSE513) Contact 45
requisites Hours
Time 3 Hours
Objectives The subject Information Security aims at providing essential concepts and methods for
providing and evaluating security in information processing systems (operating systems and
applications, networks, protocols, and so on). In addition to its technical content, the course
touches on the importance of following:
1. Develop a security mindset: learn how to critically analyze situations of computer
and network usage from a security perspective, identifying the salient issues,
viewpoints, and trade-offs.
2. Basic Encryption and Decryption Algorithms, security threats, challenges in
Information Security
3. Security management which describes access control, secure group management and
authorization management.
4. Various Key management protocols
5. Security in Networks and Web
6. Firewalls
SECTION-A Hrs
Basic Encryption and Decryption: 6
Attackers and Types of threats, challenges for information security, Encryption Techniques,
Classical Cryptographic
Algorithms: Monoalphabetic Substitutions such as the Caesar Cipher, Cryptanalysis of
Monoalphabetic ciphers, Polyalphabetic Ciphers such as Vigenere, Vernam Cipher.
Stream, Block, Symmetric Key and Asymmetric Key Ciphers: 7
Rotor based system and shift register based systems. Block cipher: principles, modes of
operations. The Data encryption Standard (DES), Analyzing and Strengthening of DES,
Introduction to Advance Encryption Standard (AES), Concept and Characteristics of Public
Key Encryption system, Rivets Shamir-Adlman (RSA) Encryption, Digital Signature
Algorithms and authentication protocols, The Digital Signature Standard (DSA).
Number theory and basic Algebra: Modular Arithmetic, Euclidean algorithm, Random 5
number generation
Key Management Protocols: Solving Key Distribution Problem, Diffie-Hellman 6
Algorithm, Key Exchange with Public Key Cryptography.
SECTION-B
Message Authentication and Hash Functions 5
Authentication Requirements, Authentication Functions, Message Authentication codes,
Hash Functions, Hash Algorithms (MD-5 and SHA-1), Key Management Algorithms.
Network Security: Kerberos, IP security: Architecture, Authentication Header, 5
Encapsulating Security Payload, Digital Signatures and Digital Signature Standards.
Web Security: Web security consideration, secure socket Layer protocol, Transport Layer 6
Security Secure Electronic Transaction Protocol.
95
Firewalls: Firewall Design principles, Characteristics, Types of Firewall, trusted systems, 5
Virtual Private Networks.
Suggested
Books S. Authors Title Publisher Edition/ISB Year
No. N
1. William Stallings Network Pearson
Security Education.38
Essentials,
Applications
and Standards
References:
1 William Stallings Cryptography Pearson
and Network Education.
Security
Principles and
practice
2 . Bishop, Matt Introduction to Pearson (2005)
Computer Education,
Security. Inc./ ISBN: 0-
Addison- 321-24744-2.
Wesley
3 Michael. E. Whitman Principles of
and Herbert J. Information
Mattord Security
4. Atul Kahate Cryptography 2nd Edition
& Network
Security,
TMH,
4. Attendance (5%)
5. Final Exam (50%)
Outcomes 1. Understand data encryption and decryption techniques (such as caesar Cipher,
Monoalphabetic ciphers, Polyalphabetic Ciphers such as Vigenere, Vernam Cipher
etc.)
2. Apply these techniques on given data by using various softwares like:- RSA
Cryptosystem, Proxy Crypt, Packet Tracer, WireShark etc.
3. Understand methods which authenticates and secure the messages.
4. Contribute towards network security and web security.
Mapping
of Course CO
Outcomes PO
1 X X X X X X X
2 X X X X X X
3 X X X
4 X
96
Title BUSINESS INTELLIGENCE Credits 04

Max. Marks External: - 100 Internal: - 50 Elective Y
Pre- Database Management System (CSE412) Contact 45
requisites Hours
Time 3 Hours
Objectives 1. To introduce the concepts of Business process their requirements, key performance
indicators and their evaluation in a typical Business houses.
2. To introduces the concept of data warehouses and use of multi dimensional
databases and Online Analytical processing.
3. To introduce the basic data mining concepts like Association Rule Analysis,
classification, clustering and their use in different application domains.
part.
SECTION-A Hrs
Introduction to Business Intelligence: 8
Introduction to OLTP and OLAP, 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) 8
Concepts of data integration need and advantages of using data integration, introduction to
common data integration approaches, introduction to ETL, Introduction to data quality, data
profiling concepts and applications.
Introduction to Multi-Dimensional Data Modeling, 8
Introduction to data and dimension modeling, multidimensional data model, ER Modeling
vs. multi dimensional modeling, concepts of dimensions, facts, cubes, attribute, hierarchies,
star and snowflake schema, introduction to business metrics and KPIs, creating cubes using
SSAS
SECTION-B
Basics of Enterprise Reporting 6
Introduction to enterprise reporting, concepts of dashboards, balanced scorecards, and
overall architecture
Data Mining Functionalities: 15
Association rules mining, Mining Association rules from single level, multilevel transaction
databases, Classification and prediction, Decision tree induction, Bayesian classification, k-
nearest neighbor classification, Cluster analysis, Types of data in clustering, categorization
of clustering methods
Suggested
No. n Details
1. R N Prasad, Fundamental Wiley First 2011
Seema s of Business India Edition
Acharya Analytics
2. .Han and M. Data Mining: Morgan Latest 2010
Kamber Concepts and Kaufman Edition
Techniques publishers,
97
Harcourt
India pvt.
Ltd
3. David Loshin Business Knowledg Latest 2011
Intelligence: e Edition
The Savvy Enterprise.
Manager's
Guide.
4. Larissa Business Addison Latest 2012
Terpeluk Intelligence Wesley Edition
Moss, Shaku roadmap
Atre
5. Cindi Howson Successful Tata Latest 2012
Business McGraw Edition
Intelligence: Hill
Secrets to
making
Killer BI
Applications
6. Mike Biere Business Addison Latest 2010
intelligence Wesley Edition
for the
enterprise
4. Attendance (5%)
5. Final Exam (50%)

Outcomes 1. Understand fundamental Business processes, their requirements, evaluation using
key performance indicators,
2. Demonstrate an understanding of BI framework and its implementation using open
source tools.
3. Demonstrate an understanding of various concepts related to data warehousing and
OLAP.
4. Use different data mining representation techniques used in different domains.
Mapping of
Course CO PO
Outcomes
1. X
2. X X
3. X X
4. X X
98
Title MOBILE COMPUTING Credits 04

Max. External: - 100 Internal: - 50 Elective Y
Marks
Pre- Computer Networks (CSE513) Contact 45
requisites Hours
Time 3 Hours
Objectives To impart knowledge of mobile and wireless computing systems and techniques.
SECTION-A Hrs
Mobility: 6
Issues, challenges, and benefits; Review of mobile and cellular communication technology;
Review of distributed/network operating systems, ubiquitous computing.
Global System for Mobile Communication (GSM) System Overview: 4
GSM Architecture, Mobility Management, Network Signaling, GPRS
Mobile IP Networks: 4
Physical mobility, challenges, limits and connectivity, mobile IP and cellular IP in mobile
computing.
Mobile Transport Layer: 6
Transport layer issues in wireless, Indirect TCP, Snoop TCP, Mobile TCP
SECTION-B
Wireless LANs: 5
Introduction to IEEE 802.11, Bluetooth technologies and standards.
Mobile Adhoc Networks: 7
Hidden and exposed terminal problems; Routing protocols: DSDV, DSR, AODV.
Mobile Devices and OS: 7
Various types of Devices, Operating System: PalmOS, WindowsCE, Windows Mobile.
Application Development: 6
WWW programming model, Development Environment for MobileDevices
Suggested
Books S. Authors Title Publisher Edition/ISB Year
No. N
1. Jochen Schiller Mobile Pearson
Communication Education.
,
2. U. Hansman and L. Principles of Springer 2nd Ed
Merck. Mobile
Computing
References:
1 A. S. Tanenbaum Computer Pearson 4th Ed
Networks Education
2 D. Milojicic, F. Mobility Addison
Douglis. Processes, Wesley
Computers and
99
Agents,
3 Raj Kamal Mobile Oxford
Computing University
Press

4. Attendance (5%)
5. Final Exam (50%)

Outcomes 1. Familiarize with mobile computing and networks.
2. Possess working knowledge of GSM architecture.
3. Learn about mobility issues on TCP/IP.
4. Understand wireless mobile ad-hoc networks.
5. Learn about operating system for mobile devices and applications.
Mapping
of Course CO PO
Outcomes
1. X X X X
2. X X X X X
3. X X
4. X X X X
5 X X X
100
Fourth Year - Eighth Semester
Title ADVANCED DATABASE SYSTEMS Credits 04

Max. External:- 50 Internal: - -50 Elective N
Marks
Pre- Database Management System (CSE412) Contact 45
requisites Hours
Time 3 Hours
Objectives 1. To review various Database concepts, Data models and their architectures.
2. To introduce Advanced Strategies for implementation of Transaction processing,
concurrency control and Recovery management.
3. To learn how to optimize query processing.
4. To familiarize with concepts of Distributed databases and their implementation
concepts.
5. To elaborate Significance of Data warehouses and their setup strategies.
6. To understand role of Data mining, OLAP, OLTP in databases and their
implementation strategies.
7. To familiarize with Object oriented databases and their significance.
8. To expose to various databases like oracle, Sql server, DB2, MySql etc through
case studies.
SECTION-A Hrs
Introduction to Database Systems:
Database System Concepts and Architecture, Data Models, Data Independence, SQL: DDL,
DML, DCL, Normalization: 1NF, 2NF, 3NF, BCNF, 4NF, 5NF. 6
Query Processing and Optimization:
Query Processing, Syntax Analyzer, Query Decomposition, Query Optimization, Heuristic
Query Optimization, Cost Estimation, Cost Functions for Select, Join, Query Evaluation Plans. 6
Transaction Processing and Concurrency Control:
Transaction Processing Concepts, Concurrency Control Techniques: Two-phase Locking,
Timestamp Ordering, Multiversion, Validation, Multiple Granularity Locking. 5
Object Oriented and Object Relational Databases:
Object Oriented Concepts, Object Oriented Data Model, Object Definition Language, Object 5
Query Language, Object Relational Systems, SQL3, ORDBMS Design.
SECTION-B
Distributed Databases: 6
Distributed Database Concepts, Advantages and Disadvantages, Types of Distributed Database
Systems, Data Fragmentation, Replication and Allocation Techniques for Distributed Database
Design, Five Level Schema Architecture, Query Processing, Concurrency Control and
Recovery in Distributed Databases.
Backup and Recovery: 5
Types of Database Failures, Types of Database Recovery, Recovery Techniques: Deferred
Update, Immediate Update, Shadow Paging, Checkpoints, Buffer Management.
Introduction to Data Warehousing and Data Mining: 5
101
Introduction to OLAP, OLTP, Data Warehouse, Data Marts, Data Mining, Data Mining
Process.
Commercial Databases: 7
Commercial Database Products, Familiarity with IBM DB2 Universal Database, Oracle,
Microsoft SQL Server, MySql, their features.
Suggested
Books S. Authors Title Publisher Editio Yea Other
No. n r Details
1 Ramez Elmasri, Fundamentals Pearson Fifth 200
Shamkant of Database Educatio Editio 7
Navathe Systems n n
2 Raghu Database Tata
Ramakrishnan, Management McGraw-
Johannes Gehrke Systems, Hill
3 C.J. Date An Pearson Eighth
Introduction Educatio Editio
to Database n n
Systems
4 Alexis Leon, Database Leon
Mathews Leon Management Press
Systems
5 Abraham Database Tata
Silberschatz, System McGraw-
Henry F. Korth, Concepts Hill
S. Sudarshan
6 S. K. Singh Database Pearson
Systems Educatio
Concepts, n
Design and
Applications
4. Attendance (5%)
5. Final Exam (50%)
Outcomes 1. Recall various Database concepts with discovery of advanced strategies for
Transaction processing, Concurrency control, Recovery management and Query
Processing.
2. Understand Object Oriented and Distributed databases.
3. Learn significance of Data warehousing, Data mining, OLAP and OLTP.
4. Examine various Case studies: Oracle, Sql server, DB2, MySql etc.
Mapping of
Course CO PO
with POs 1 X X
2 X X
3 X X X X
4 X X X
102
Title Digital Image Processing Credits 4

Max. Marks External: -50 Internal: - 50 Elective N
Pre- Computer Graphics (CSE613) Contact Hours 45
requisites
Time 3 Hours
Objectives To introduce the various image processing techniques and their applications in different
domains. To get students acquainted with computer vision.
SECTION-A Hrs
Introduction to Image Processing: 6
Digital Image representation, Sampling & Quantization, Steps in image Processing,
Image acquisition, color image representation
Image Transformation & Filtering: 12
Intensity transform functions, histogram processing, Spatial filtering, fourier transforms
and its properties, frequency domain filters, , color models, Pseudo coloring, color
transforms, Basics of Wavelet Transforms.
Image Restoration: 7
Image degradation and restoration process, Noise Models, Noise Filters, degradation
function, Inverse Filtering, Homomorphism Filtering .
SECTION-B
Image Compression: 8
Coding redundancy, Interpixel redundancy, Psychovisual redundancy, Huffman Coding,
Arithmetic coding, Lossy compression techniques, JPEG Compression.
Image Segmentation & Representation: 12
Point, Line and Edge Detection, Thresholding, Edge and Boundary linking, Hough
transforms, region Based Segmentation, Boundary representation,Boundary Descriptors,
Regional Descriptors.
Suggested
Books S. Authors Title Publishe Editio Year Other
No r n Details
.
1 Gonzalez Digital Image Addison 1992
and Processing Wesley
Woods
2 Boyle and Computer Blackwel 2nd 1995

Thomas Vision, l Science Edition
3 Pakhira Digital Image PHI

Malay K Processing
and Pattern
Recogination
103
4. Attendance (5%)
5. Final Exam (50%)

Outcomes 1. Understand the basic terms related to imaging, types of images, image
conversions, matrix calculations, steps involved in image processing, its need in
real time applications, state of art, color models and color image processing,
various domains.
2. Understand and develop various image enhancement filters both in spatial and
frequency domain, restoration process after discussing degradation functions,
role of image enhancement and restoration in any image processing application.
The implementation of same is also required to be done practically.
3. Discuss the role and need of image compression and its techniques,
morphological operations, role and need of segmentation, types of segmentation,
edge segmentation, various segmentation algorithms like region growing, region
splitting and merging, watershed etc., calculations and practice of numerical
related to segmentation.
4. Discuss various boundary and regional descriptor methods, equation related to
boundary detection, various types of image features and methods defined for
object recognition.
Mapping of CO PO
Outcomes 1 X X
with POs 2 X X X X X
3 X X X X X X
4 X X X X X
104
Title DIGITAL IMAGE PROCESSING (Practical) Credits 02

Max. 50 Elective N
Marks
Time 3 Hours
List 1. Reading and displaying images in different formats using different color models.
2. Converting color images into monochrome images, Image color enhancements
using pseudo coloring techniques.
3. Images enhancements using grey level transformations and spatial and frequency
domain filters
4. Image Noise removal and inverse filtering of images
5. Point, Line, Edge and Boundary Detections in images
6. Histogram Matching and specification on images
7. Boundary Linking, Representation and Description techniques on images
8. Thresholding & Magnification of Images
9. Image Morphological Operations
10. Object Recognition Techniques
105
Title NETWORK PROGRAMMING Credits 4

Code CSE8 Semester: 8 LTP 310
13
Max. Exter Internal: 50 Elective Y
Marks nal:
50
Pre- Computer Networks (CSE513) Contact Hours 45
requisites
Time 3 Hours
Objectives To familiarize students with advanced concepts of networks, network programming in
UNIX environment.
SECTION-A Hrs
OSI model, client server model, TCP/IP protocols, Introduction to Unix; 6
Process, groups, job control and non-job control shells, reliable and unreliable
signals, shell Programming.
Inter process communication in Unix, pipes, half duplex and full duplex pipes, 10
FIFOs, properties of pipes and FIFOs, POSIX message queues, system V
message queues, semaphores, shared memory, mmap function and its use,
RPC, authentication, timeout and retransmission, call semantics, XDR. .
Communication Protocol Introduction, TCP, IP, XNS, SNA, NetBIOS, OSI 5
protocols, comparisons
SECTION-B
Introduction to Berkeley sockets, socket addressing, TCP and UDP socket 10
functions, sockets and Unix signals, socket implementation, client and server
examples for TCP and UDP and their behaviour under abnormal conditions.
Socket options, IPv4, IPv6, TCP, I/O multiplexing, Unix I/O models, select 5
and poll functions
System V Transport Layer, interface Introduction Transport End Point 5
address, TLI
Overview of Ping Routines, FTP, Remote Login 4
Suggested
No. Details
1 W. R., Unix Pearson Vol. I,
Stevens, Networ Education 3rd
B. Fenner k Ed.
and A. Progra
M., mming
Rudoff
W. R., Unix Pearson Vol. II,

2 Stevens Networ Education 2
k nd
Progra Ed.,
106
mming,
3 W. R., Advanc Pearson
Stevens ed Education
Progra
mming
in Unix
Environ
ment,
Course Outcomes On completion of this course, a student must be able to

1. Demonstrate the working of TCP/IP and its role in networks.
2. Learn about inter-process communication in unix environment.
3. Study about socket programming.
4. Learn about programming for Unix operating system
CO PO
A B C D E F G H I J K L
1 X X X
2 X X X
3 X X X X
4 X X X
107
Title NETWORK PROGRAMMING (Practical) Credits 02

Max. 50 Elective Y
Marks
Time 3 Hours
List Students will learn to implement programs in UNIX.
1. To study and implement various network commands like telnet, ftp, etc.
2. To study various system calls.
3. Programs related to inter-process communication
4. Programs related to message queues
5. Programs related to pipes
6. Programs related to file handling
7. Programs related to process control
8. Programs using Socket Programming
108
Title VISUAL PROGRAMMING Credits 4

Pre- Object Oriented Programming (CSE414) Contact 45
requisites Hours
Time 3 Hours
Objectives 1. To introduce Visual C# and its programming model
2. To enable them write applications using Visual C#
3. To make them understand and use various controls to create GUI
4. To enable them handle exceptions and write multithreaded programs
5. To make them understand and use file and data access techniques
Note for The Semester question paper of a subject will be of 50 marks having 7 questions
Examiner of equal marks. First question, covering the whole syllabus and having questions
of conceptual nature, will be compulsory. Rest of the paper will be divided into
two parts having three questions each and the candidate is required to attempt at
least two questions from each part.
SECTION-A Hrs
Introduction 8
Introduction to Programming: Variables, Functions, Visual Programming, and Object
Oriented Concepts: Abstraction, Inheritance, Polymorphism, Classes, Collections,
Debugging.
Graphical User Interface Concepts - I 5
Windows Forms, Control Properties and Layout, Using Common Dialogs, Event
Handling: Mouse and Keyboard, Labels, Textboxes, Buttons, Group Boxes, Panels,
CheckBoxes and RadioButtons, Picture Boxes, ToolTips.
3. Graphical User Interface Concepts II Menus, Controls: 4
MonthCalendar,DateTimePicker,Link Label,ListBox,CheckedListBox, ComboBox,
TreeView, ListView,Datagrid, Gridview, TabControl, Multiple Document Interface
(MDI) Windows.
Multithreading and Exception Handling 5
Thread States, Life cycle of a Thread, Thread Priorities and Scheduling, Creating and
Executing Threads, Thread Synchronization and Class Monitor, Exception Handling.
SECTION-B
Graphics and Multimedia 5
Drawing Classes and the Coordinate System, Graphics Contexts and Graphics Objects,
Color and Font Control, Drawing Lines, Rectangles, Ovals, Arcs, Loading, Displaying
and Scaling Images, Animating a Series of Images.
File Processing and Streams 5
Data Hierarchy, Files and Streams, Classes File and Directory, Reading and Writing
Sequential Access Files, Serialization.
Data Access 8
Data Access Techniques, XML, LINQ, SQL, ADO.NET Object Model, LINQ to SQL,
ADO.NET and LINQ, LINQ to XML.
Additional Techniques 5
XML Documentation, Networking, Security, Web Services, Introduction to GDI+.
Suggested
Books S. Authors Title Publish Editio Year Other
No. er n Details
1 Deitel Visual Deitel Secon 2005
C# d
109
2005 Editio
How to n
Progra
m
Karli Beginni Wrox 2008
2 Watson, ng
Christian Micros
Nagel, oft
Jacob Visual
Hammer, C#
et al.
3 Christian Professi Wrox 2008
Nagel, onal C#
Bill
Evjen, Jay
Glynn,
Morgan
Skinner,
Karli
Watson
4. Attendance (5%)
5. Final Exam (50%)

Outcomes 1. Understand the fundamentals of visual programming
2. Apply the concept of multithreading, exception handling, file handling and
data access while developing applications
3. Develop applications involving use of graphics controls, multithreading,
exception handling and file handling.
4. Examine visual applications involving use of graphics controls,
multithreading, exception handling and file handling.
Mapping of
Course CO PO
with POs 1 X X
2 X X X
3 X X
4 X X
110
Title VISUAL PROGRAMMING (Practical) Credits 02

Max. 50 Elective Y
Marks
Time 3 Hours
List 1. Writing basic C# programs demonstrating the concepts of functions, arrays,
classes, inheritance, polymorphism etc.
2. Writing graphical programs demonstrating the concepts of event handling, Labels,
Textboxes, Buttons, Group Boxes, Panels, CheckBoxes and RadioButtons, Picture
Boxes, ToolTips.
3. Writing MDI Applications and demonstration of controls like: MonthCalendar,
DateTimePicker, Link Label, ListBox, CheckedListBox, ComboBox, TreeView,
ListView, TabControl.
4. Writing programs demonstrating the concepts of Multithreading and Exception
Handling.
5. Writing programs demonstrating Graphics and Multimedia concepts.
6. Writing programs for reading and writing text files.
7. Writing programs demonstrating Database Access, Networking and Security.
8. Writing Web Services.
111
Title JAVA TECHNOLOGIES Credits 4

Max. External: 50 Internal: 50 Elective Y
Marks
Pre- Object Oriented Programming (CSE414) Contact 45
requisites Hours
Time 3 Hours
Objectives 1. To introduce Java and its programming model
2. To make them write desktop applications and applets in Java
3. To enable them handle exceptions in Java and write multithreaded programs
4. To give an overview of J2EE and JDBC
5. To make them understand and write JSP, Servlets and Java Beans.
SECTION-A Hrs
Java Methods, Classes and Inheritance 8
Introduction; classes; methods; constructors; overloading methods; arrays; recursion;
passing arrays and objects to methods; Inheritance; method overriding; abstract classes;
using final; packages; interfaces.
I/O, Applets and Graphics: 8
I/O basics; stream classes; byte and character streams; reading and writing files; Applet
fundamentals; Applet class; Applet initialization and termination; event handling;
keyboard and mouse events; AWT class; Layout managers; panels; canvases; Frame
windows; drawing lines, rectangles, ellipses.
Exceptional Handling and Multithreaded Programming: 8
Exception handling fundamentals; exception types; uncaught exceptions; try and catch;
creating exception classes; throwing exceptions; Java thread model; thread priorities;
creating a thread; inter-thread communication; thread synchronization; suspending,
resuming and stopping threads.
SECTION-B
Overview of J2EE and working with JDBC: 7
What is J2EE, component based architecture of J2EE: Web, Business and Application
component, commonly used classes and interfaces of java.sql package, connecting java
application to a database, prepared statements.
Servlets and JSP: 7
Java Servlets, compilation, deployment, and testing a servlet, session management,
request dispatching, Java Server Pages, deploying and testing a JSP, using java beans in
JSP.
Enterprise Java Beans(EJB): 7
Architecture of EJB, creating a stateless-session EJB, statefull-session bean, Life Cycle
of session beans, Entity beans, life cycle of entity beans.
Suggested
Books S. Authors Title Publishe Edition Year Other Details
No. r
1 Deitel Java: How Pearson 6th
to Educati Edition
Program on
112
2 Herbert The McGra
Schildt Complete w-Hill
Reference
Java2
3 James J2EE: The
Edward complete
Keogh, Reference
Jim
Keogh
4. Attendance (5%)
5. Final Exam (50%)
Outcomes 1. Understand the fundamentals of object-oriented programming and the
technologies of Java Enterprise Edition Software.
2. Study and Develop coding conventions of importing packages and use of
interfaces. Demonstrate the runtime exception, multi-threaded event-driven
programming.
3. Apply the use of applet programming. Show competence in the use of the pure
object oriented Java language in the development of small to medium-sized
applications.
4. Examine the enterprise components including Enterprise JavaBeans (EJB)
technology, servlets, and Java Server Pages (JSP) technology, JDBC.
Mapping of
Course CO PO
with POs 1 X X X
2 X X X
3 X X X X
4 X X
113
Title JAVA TECHNOLOGIES (PRACTICAL) Credits 02

Max. 50 Elective Y
Marks
Time 3 Hours
List 1. Implementation of classes, inheritance, overloading.
2. Implantation of packages and interfaces
3. Implantation of threads.
4. Implementation of Applets, mouse events, and keyboard events.
5. Connecting to Database using JDBC.
6. Deployment of Servlets, JSP and EJB.
114
Title SOFT COMPUTING Credits 04

Marks
Pre- Artificial Intelligence (CSE614) Contact Hours 45
requisites
Time 3
Hour
s
Objectives To understand the basic soft computing techniques available and to apply these concepts
as applicable to different problems in real life.
SECTION-A Hrs
Intelligent Agents: 9
Agents Behavior and Environments, Structure of Agents, Planning Problem, Planning with state
Space Search, Partial order Planning, GRAPHPLAN, Planning in logic, Planning in non-
deterministic domains, hierarchical task planning, Multi agent planning, execution.
Probabilistic Reasoning Fuzzy Logic: 12
Knowledge representation under uncertainty, Bayesian theorem, Bayesian Networks, Dempster
Shafer theory, Representing vagueness, Fuzzy sets, operation on fuzzy sets, reasoning with
fuzzy logic, Fuzzy Automata, Fuzzy Control methods, Fuzzy decision making, inference in
temporal models, Hidden Markov Models, Kalman Filters
SECTION-B
Neural Networks: 16
Basic concepts, Single layer perception, Multilayer Perception, Supervised and Unsupervised
learning - Backpropagation networks - Kohnen's self organizing networks - Hopfield network.
Introduction to Artificial Neural Systems - Perceptron - Representation - Linear separability -
Learning Training algorithm -Adaptive networks based Fuzzy interface systems -
Classification and Regression Trees - Data clustering algorithms - Rule based structure
identification - Neuro-Fuzzy controls - Simulated annealing
Genetic Algorithms: 8
Evolutionary computation. Survival of the Fittest - Fitness Computations - Cross over
Mutation, Reproduction - Rank method - Rank space method.
Suggested
No n r Detail
. s
Norvig s
Negnevitsky Intelligence: Wesley
A Guide to
Intelligent
Systems
115
&
Programming
Techniques
na B Neural Hall of
Networks India
Private Ltd
search,
optimization
and machine
learning

4. Attendance (5%)
5. Final Exam (50%)
Outcomes 1. Illustrate different soft computing techniques and their relation to artificial
intelligence
2. Describe, argue for and critique Soft Computing discipline. Students will be able
to use at least two of the Soft Computing techniques
3. Apply fuzzy logic and reasoning to handle uncertainty and solve engineering
problems
4. Apply genetic algorithms to combinatorial optimization problems
5. Apply neural networks to pattern classification and regression problems
6. Analyze and study the problem in question conceptually and mathematically and
solve the problem using any of soft computing techniques
Mapping of
Course CO PO
with POs 1 X
2 X X X
3 X X X X
4 X X X
5 X X X
6 X X
116
Title EMBEDDED SYSTEMS Credits 03

Marks
Pre- Microprocessors (EC317) Contact Hours 45
requisites
Time 3
Hour
s
Objectives To get the basic knowledge of all the peripheral device controllers and to work on PIC
Microcontroller
part.
SECTION-A Hrs
Introduction Review of Embedded Hardware 10
Memory Microprocessors Buses Direct Memory Access Interrupts Built ins on the
Microprocessor, Conventions used on Schematic, Microprocessor Architecture Interrupt
Basic Shared Data Problems Interrupt Latency.
PIC Micro controller & Interfacing 15
Introduction, CPU Architecture, Register file structure, Instruction Set, Programs, Timers and
Interrupts Interrupt Service Routine features of Interrupts Interrupt vector & Priority,
Timing Generation & Measurements, Compare mode, Capture mode, Event counter, PWM,
Frequency Measurement Interfacing Methods, I/O Interface, SPI, LCD interfacing, Seven
segment interfacing, I2 C Bus, DAC, Serial EEPROM, ADC, UART
SECTION-B
Software Development & Tools: 8
Software architectures, Round Robin, Round-Robin with Interrupts, Function
Queue Scheduling architecture, Introduction to assembler Compiler n Cross compilers and
Integrated Development Environment IDE, Linker/ Locators, Simulators, Getting Embedded
software into target System Debugging Strategies
Introduction to Real Time Operating Systems: 5
Task And Task States, Tasks and Data, Semaphores and shared data
Operating System Services: 7
Message queues, Mailboxes and Pipes, Timer Function, Events, Memory Management,
Interrupt Routines in an RTOS Environment, Basic Design Using RTOS.
Suggested
No n r Detail
. s
1. David E. An Embedded Pearson
Simon Software Education,
Primer, Latest
Edition
2. John B. PIC Pearson

Peatman Microcontroll Education,
er Latest
117
Edition
3. D. D. Gajski, S Prenti
F. Vahid, S. pecification ce
Narayan, J. and Design of Hall.
Gong Embedded
Systems
4. Steve Heath Embedded
systems
design,
Newnes,
1997.
5. F. Balarin, Hardware Academic

Chiodo Software Co- Publishers,
design May 1997
of Embedded
Systems, et
al., Kluwer

Outcomes 1. Learn about embedded hardware.
2. Learn and understand the features, architecture, memory organization,
instructions, addressing Modes of PIC Microcontroller
3. Understand the architectures and development of embedded systems and
implement it for target system.
4. Learn about real-time operating systems and their services.
.
Mapping
of Course CO PO
with POs 1 X X
2 X X
3 X X
4 X X X
118
Title Building Enterprise Applications Credits 3

Pre- Database Systems (CSE412) Contact Hours 45
requisites
Time 3 Hours
Objectives 1. To introduce the concepts of Enterprise applications and different issues related to
their implementation
2. To introduces the architecture of different Enterprise applications and different
design modeling techniques for construction.
3. To introduce the different testing techniques for Enterprise application and
methodologies used to roll out these applications.
part.
SECTION-A Hrs
Introduction to Enterprise application 8
Introduction to enterprise applications and their types, software engineering
methodologies, life cycle of raising an enterprise application, introduction to skills
required to build an enterprise application, key determinants of successful enterprise
applications, and measuring the success of enterprise applications.
Incepting enterprise application and business process modelling 7
Inception of enterprise applications, enterprise analysis, business modelling, requirements
elicitation, use case modelling, prototyping, non functional requirements, requirements
validation, planning and estimation.
Enterprise Architecture and designing enterprise application 8
Concept of architecture, views and viewpoints, enterprise architecture, logical
architecture, technical architecture - design, different technical layers, best practices, data
architecture and design relational, XML, and other structured data representations,
Infrastructure architecture and design elements - Networking, Internetworking, and
Communication Protocols, IT Hardware and Software, Middleware, Policies for
Infrastructure Management, Deployment Strategy, Documentation of application
architecture and design.
SECTION-B
Constructing enterprise application 12
Construction readiness of enterprise applications - defining a construction plan, defining
a package structure, setting up a configuration management plan, setting up a
development environment, introduction to the concept of Software Construction Maps,
construction of technical solutions layers, methodologies of code review, static code
analysis, build and testing, dynamic code analysis code profiling and code coverage.
Testing and rolling out enterprise application 10
Types and methods of testing an enterprise application, testing levels and approaches,
testing environments, integration testing, performance testing, penetration testing,
usability testing, globalization testing and interface testing, user acceptance testing,
rolling out an enterprise application.
119
Suggested
No Detail
. s
1. Anubhav Pradhan, Raising Wiley First 2012
Satheesha B. Nanjappa, Enterprise India Edition
Senthil K. Nallasamy, Applications
Veerakumar
Esakimuthu
2. Brett McLaughlin Building Java O Reily Latest 2010
Enterprise Media Edition
Applications,
3. Soren Lauesen Software Addison Latest 2012
Requirements Wesley Edition
: Styles &
Techniques.
4. Brian Berenbach, Software McGraw- Latest 2009
Daniel J. Paulish, Systems Hill/Osbor Edition
Juergen Requirements ne Media,
Kazmeier, Arnold Engineering:
Rudorfer In Practice
5. Dean Leffingwell, Don Managing Pearson First 2003
Widrig Software Edition
Requirements
: A Use Case
Approach,
6. Vasudev Verma Software Pearson First 2009
Architecture: Edition
A Case Based
Approach
7. Srinivasan Desikan, SOFTWARE Pearson First 2006
Gopalaswamy Ramesh TESTING Edition
Principles and
Practices,

4. Attendance (5%)
5. Final Exam (50%)

Outcomes 1. Understand fundamental of Enterprise applications and key determinants to
measure the success.
2. Demonstrate an understanding of different modelling techniques used to design
Enterprise applications.
3. Construct applications by understanding the design..
4. Test and roll out the enterprise applications in real environment.
Mapping of
120
Course CO PO
Outcomes
1. *
2. X X
3. X X
4. X X
121

Updated Scheme and Syllabus 2016-17 Version16Feb2016

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Updated Scheme and Syllabus 2016-17 Version16Feb2016

Uploaded by

Copyright:

Available Formats

Scheme and Syllabus of

B.E. (Computer Science and Engineering)

University Institute of Engineering and

Panjab University, Chandigarh

PROGRAMME: B.E. CSE (UG PROGRAMME)

PROGRAMME EDUCATIONAL OBJECTIVES:

I. Graduates will work as software professional in industry of repute.

2.0 Credit System :

2.3Course Credit Assignment:

2.4 Earning Credits :

3.0 Grading System :

Grade Grade Point Description

4.1 Continuous Assessment :

4.2 Method for the Award of Grades:

Sr. No. Marks Grade Grade Point

5.0 Evaluation of Performance :

Points earned in a semester =

The CGPA is calculated as given below :

Second Year - Third Semester

Scheme of Teaching University Internal

Second Year -Fourth Semester

Scheme of Teaching University Internal

Third Year - Fifth Semester

Scheme of Teaching University Internal

Third Year - Sixth Semester

Scheme of Teaching University Internal

Scheme of Teaching University Internal

Fourth Year - Seventh Semester

Sr. Paper Subject Title Scheme of Teaching University Internal Total

1. CSE711 Compiler Design 3 1 0 4 4 50 50 100

2. CSE761 Compiler Design 0 0 3 3 2 - 50 50

3. CSE712 Multimedia System Design 3 1 0 4 4 50 50 100

5. CSE763 Software Testing & Quality 0 0 3 3 2 - 50 50

7. CSE767 Project I 0 0 6 6 3 - 100 100

9. CSE769 Industrial Training (After - 2 - 100 100

CSE 714 Information Security

CSE 715 Business Intelligence

CSE 716 Mobile Computing

Sr. Paper Subject Title Scheme of Teaching University Internal Total

6. Elective III 3 0 0 3 3 50 50 100

Option 1. CSE860 Industrial Training - - - - 22 200 400 600

Elective II (Theory) Elective II (Practical) Elective III (Theory)

Branch: Computer Science and Engineering

Title DATA STRUCTURES Credits 04

Title DATA STRUCTURES (PRACTICAL) Credits 02

Title DATABASE SYSTEMS Credits 04

Physical Data Organization: 3

Course On completion of this course, a student must be able to

Title DATABASE SYSTEM (PRACTICAL) Credits 02

Title DISCRETE STRUCTURES Credits 4

Course On completion of this course, a student must be able to

Title MICROPROCESSORS Credits 04

Title MICROPROCESSORS (PRACTICAL) Credits 0

Title ECONOMICS Credits 03

Basic Concepts of Macroeconomics 8

Branch: Computer Science and Engineering

Title ANALYSIS AND DESIGN OF ALGORITHMS Credits 04

Greedy Algorithms:- Elements of Greedy strategy, Activity Selection Problem, 08

Course On completion of this course, a student must be able to

Title ANALYSIS AND DESIGN OF ALGORITHMS Credits 02

Title WEB TECHNOLOGIES Credits 4

4 Schafer HTML,CSS, Wiley

Course Assessment will consists of following components