CT Ycce

YESHWANTRAO CHAVAN COLLEGE OF ENGINEERING
B.E. (Computer Technology)

SCHEME OF EXAMINATION
S. No.
Code
Subject
Total
Contact
Hours
Credits
Evaluation Scheme
MSE-I MSE-II TA ESE Total
ESE
Hrs
SEMESTER III
1
GE201 Engineering Mathematics-III
15
15
10
60
100
CT205 Programming Language Concepts and Constructs
15
15
10
60
100
CT206
Programming Language Concepts and Constructs

Laboratory
40
60
100
CT203 Data Structure
10
60
100
CT204 Data Structure Laboratory
40
60
100
EE218 Logic Design
10
60
100
EE217 Logic Design Laboratory
40
60
100
CT210 Web Technology Laboratory
40
60
100
14 2 14
30
23
Total
15
15
15
15
SEMESTER IV
1
GE206 Discrete Mathematics & Graph Theory
15
15
10
60
100
CT221 Object Oriented Programming
15
15
10
60
100
CT222 Object Oriented Programming Laboratory
40
60
100
CT207 Computer Architecture & Organization
15
15
10
60
100
ET213 Micro processor
15
15
10
60
100
ET214 Micro processor Laboratory
40
60
100
CT208 System Programming
10
60
100
CT209 System Programming Laboratory
40
60
100
18 2
26
23
Chairperson
Date of Release
Dean (Acad. Matt.)
Version
15
15
May 2012
Applicable for
1.02
AY 2012-13 onwards

S. No.
Code
Subject
Total
Contact
Hours
Credits
Evaluation Scheme
ESE
Hrs
SEMESTER V
1
GE303 Managerial Economics & HR Management
15
15
10
60
100
CT301 Theoretical Foundation of Computer Science
15
15
10
60
100
CT302 Operating Systems
15
15
10
60
100
CT303 Operating Systems Laboratory
40
60
100
CT340 Computer Networks
10
60
100
CT341 Computer Networks Laboratory
40
60
100
CT330 Numerical Computing
10
60
100
CT331 Numerical Computing Laboratory
40
60
100
CT328 Seminar I
100
17 2
27
23
Total
15
15
15
15
100
SEMESTER VI
1
CT314 Design & Analysis of Algorithm
15
15
10
60
100
CT316 Database Management Systems
15
15
10
60
100
CT317 Database Management Systems Laboratory
40
60
100
CT318 Language Processors
10
60
100
CT319 Language Processors Laboratory
40
60
100
Professional Elective 1
10
60
100
Professional Elective 1 Laboratory
40
60
100
Free Elective 1
10
60
100
Free Elective 1 Laboratory
40
60
100
10
CT329 Software Lab (Mini Project)
100
18 2 10
30
25
CT320 PE1: Computer Graphics
CT321 PE1: Computer Graphics Laboratory
CT322 PE1: Realtime Systems
CT323 PE1: Realtime Systems Laboratory
CT324 PE1: Mobile Communication
CT325 PE1: Mobile Communication Laboratory
EL316
EL317
EL320
EL321
CV325
CV326
CV327
CV328
ET3331
ET332
ET3331
4
0
4
0
4
0
4
0
4
0
4
0
0
0
0
0
0
0
0
0
0
0
0
2
0
2
0
2
0
2
0
2
0
4
2
4
2
4
2
4
4
1
4
1
4
1
4
1
4
1
4
ET334 FE 1 : Principals of Communication Engineering Lab
ME315
ME316
ME317
ME318
EE320
FE 1 : Operations Research Techniques

FE 1 : Operations Research Techniques Lab.
FE 1 : Automobile Engineering
FE 1 : Automobile Engineering Lab.
FE 1: Data Acquisition & Signal Conditioning
FE 1: Data Acquisition & Signal Conditioning
EE321
Laboratory
EE322 FE 1: Microprocessor & Microcontroller
4
0
4
0
4
0
0
0
0
0
0
2
0
2
0
4
2
4
2
4
4
1
4
1
4
EE323 FE 1: Microprocessor & Microcontroller Laboratory
Total
FE1:Renewable Energy Generation Systems

FE1:Renewable Energy Generation Systems
FE1:Applications of Electrical Machines
FE1:Applications of Electrical Machines Lab.
FE I : Environmental Management
FE I : Environmental Management
FE I : Building Services Engineering
FE I : Building Services Engineering
FE 1 : Microcontroller & Embedded Systems
FE 1 : Microcontroller & Embedded Systems Lab
FE 1 : Principals of Communication Engineering
Chairperson
Date of Release
Dean (Acad. Matt.)
Version
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
100
10
60
100
40
60
100
10
60
100
40
60
100
10
60
100
40
60
100
10
40
10
40
10
40
10
40
10
40
10
60
60
60
60
60
60
60
60
60
60
60
100
100
100
100
100
100
100
100
100
100
100
40
60
100
10
40
10
40
10
60
60
60
60
60
100
100
100
100
100
40
60
100
10
60
100
40
60
100
3
3
3
May 2012
Applicable for
1.02
AY 2012-13 onwards

S. No.
Code
Subject
Total
Contact
Hours
Credits
Evaluation Scheme
ESE
Hrs
SEMESTER VII
1
CT401 Software Engineering
CT402 Software Engineering Laboratory
CT450 Object Oriented Modeling
15
15
10
60
100
40
60
100
15
15
10
60
100
15
15
10
60
100
15
15
10
60
100
Free Elective 2
15
15
10
60
100
CT413 STR ( TRAINING)
100
CT440 Seminar 2
100
CT414 Project Phase 1 (Analysis & Design)

Total
40
60
100
19 1 10
30
29
CT405 PE2: Embedded Systems
15
15
10
60
100
CT406 PE2: Neural Network & Fuzzy Logic
15
15
10
60
100
CT407 PE2: Ad-hoc Wireless Networks
15
15
10
60
100
CT408 PE3:Cloud Computing
15
15
10
60
100
CT409 PE3:Operations Research
15
15
10
60
100
CT410 PE3: Artificial Intellegience
15
15
10
60
100
EL412
EL413
CV418
CV419
ET411
ET412
ME429
ME430
EE411
4
4
4
4
4
4
4
4
4
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
4
4
4
4
4
4
4
4
4
4
4
4
4
4
4
4
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
15
10
10
10
10
10
10
10
10
10
60
60
60
60
60
60
60
60
60
100
100
100
100
100
100
100
100
100
15
15
10
60
100
FE 2 : Electrical Energy Audit and Safety

FE 2: Utilisation of Electrical Energy
FE 2 : Elements of Earthquake Engineering
FE 2 : Air Pollution & Solid Waste Management
FE2 : Soft Computing
FE2 : Industrial Instrumentation
FE 2 : Total Quality Management
FE 2 : Reliability Engineering
FE 2 :Fuzzy Logic & Neural Network
FE 2 :Basic of Analog and Digital Communication
EE429
Systems
100
100
SEMESTER VIII
1
GE408 Cyber laws
15
15
10
60
100
CT415 Network Security
15
15
10
60
100
15
15
10
60
100
40
60
100
10
60
100
40
60
100
15
15
CT425 Comprehensive viva
40
60
100
CT426 Project Phase 2 ( Implementation )
40
60
100
CT427 Extra/Co-curricular / Competitive Examination

Total
0 0 0
16 0 10
0
26
2
29
100
CT418 PE4: Digital Image Processing
10
60
100
CT419 PE4: Digital Image Processing Laboratory
40
60
100
CT420 PE4: Pattern Recognition
10
60
100
CT421 PE4: Pattern Recognition Laboratory
40
60
100
CT422 PE4: Mobile Operating Systems
10
60
100
CT423 PE4: Mobile Operating Systems Laboratory
40
60
100
CT 430 PE 5: Business Intelligence and its Applications

PE 5: Business Intelligence and its Applications
CT431
Laboratory
CT432 PE5: Software Project Management
10
60
100
40
60
100
10
60
100
CT433 PE5: Software Project Management Lab.
40
60
100
CT434 PE5: Speech Processing
10
60
100
CT435 PE5: Speech Processing Lab.
40
60
100
Chairperson
Date of Release
15
15
15
15
15
15
May 2013
15
15
15
15
15
15
Applicable for
3
3
3
3
3

S. No.
Code
Dean (Acad. Matt.)
Subject
Version
Total
Contact
Hours
Evaluation Scheme
Credits
1.03
ESE
Hrs
AY2013-14 Onwards
GE-201/GE-501
Engineering Mathematics-III
Evaluation
Scheme
L=3
T=1
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3 Hrs
Objectives
To understand the mathematical techniques of
Laplace transform, Z- transform, optimization, finite
differences ,matrices, partial differential equations
which they require to use in their further studies of
all engineering branches
Outcomes
students should be able to apply mathematical
techniques of Laplace transform, Z- transform,
optimization, finite differences ,matrices, partial
differential equations to solve engineering problems.
Mapped Program Outcomes: a, b, j, k

UNIT-I:
[09 Hrs]
Matrices: Inverse of matrix by adjoint method and its use in solving simultaneous equations, rank of a matrix
(by partitioning method) consistency of system of equation, Inverse of matrix by partitioning method Linear
dependence, Linear and orthogonal transformations. Characteristics equations, eigen values and eigen
vectors. Reduction to diagonal form, Cayley Hamilton Theorem (without proof) statement and verification,
Sylvesters theorem, Association of matrices with linear differential equation of second order with constant
coefficient.
UNIT II:
[07 Hrs]
Laplace Transforms: Laplace transforms and their simple properties, simple applications for Laplace
transform to solve ordinary differential equations including simultaneous equations, solution of onedimensional partial differential equations by transforms method.
UNIT - III:
[08 Hrs]
Fourier Series and Z-transforms
Fourier Series Periodic Function and their Fourier series expansion, Fourier Series for even and odd
function, Change of interval, half range expansions.
Z-Transform: Definition and properties, inversion by partial fraction decomposition, relation with Laplace
transforms, Applications of Z-transform to solve difference equations with constant co-efficient.
UNIT -IV:
[07 Hrs]
Partial Differential Equations PDE of first order first degree i.e. Lagranges form, linear homogeneous
equations of higher order with constant coefficient. Method of separations of variables, applications to onedimensional heat and diffusion equation. Vibration of string, Two-dimensional Heat Equation (only steady
state), transmission of lines.
UNIT- V :
[08 Hrs]
Finite differences: Difference table; Operators E and , Central differences, Factorials notation Numerical
differentiation and integration, Difference equations with constant coefficients.
UNIT- VI :
[06 Hrs]
Optimization Techniques
Introduction to optimization techniques, Single variable optimization, Linear programming simplex method,
Simple applications of linear programming.
Text Books:
th
1. Higher Engineering Mathematics :-By B.S. Grewal,40 edition,oct.2007, Khanna Publication, Delhi.
th
2. Advanced Engineering Mathematics - by H.K. Dass, 8 revised edition, 2007.S.Chand and Company
Limited ,Delhi.
3. Optimization Techniques By C.Mohan and Kasum Deep -Year-2009. First Edition, New Age
International Publication
Reference Books :
th
1. Mathematics for Engineers :-By Chandrika Prasad,12 revised edition, Prasad Mudranalaya, Allahabad.
th
2. Advanced Mathematics for Engineers : Chandrika Prasad. 12 revised edition, Prasad Mudranalaya,
Allahabad.
rd
3.Advanced Engineering Mathematics:-By Merle C.Potter, J.L.Goldberg, Edward F.Aboufadel,3 edition,
Oxford University Press, 2005.
Chairperson
Date of Release
Dean (Acad. Matters)
Version
May 2012
1.02
Applicable for AY
2012-13 Onwards
CT205/CT601
Evaluation
Scheme
Programming Languages
Concepts And Constructs
MSE-I
MSE-II
15
15
L=4
T=0
P=0
Credits=4
TA
ESE
Total
ESE Duration
10
60
100
3 Hrs
Objectives
Outcomes
To study different programming language constructs, to
make comparative study of various languages, to study Students should be able to select appropriate language
and construct to solve the programming problems.
implementation of various language constructs.
Mapped Program Outcomes: b, c, d, e, i, k, l, m.
UNIT I
[08 Hrs]
Basic elements of program namely: data, operations and sequence. Definition of Programming language.
Implementation of high-level languages: Compilers and Software Interpreters. Why to study different
programming languages. Attributes of a good programming language. Language evaluation criteria namely:
readability, writability, reliability and cost. Operating and programming environments, their influence on
language. Language paradigms.
UNIT II
[07 Hrs]
Concept of binding, identifiers binding, binding time, binding identifiers to names, binding of attributes,
importance of binding time. Concept of r-value and l-value . Static and dynamic allocation, stack based
allocation, heap based allocation concept of garbage and dangling reference.
UNIT III
[08 Hrs]
Concept of Data type, elementary data type, structured data type, specification and
implementation of data type. Type checking, type conversion. Implementation of elementary data types :
integer, real, character, Boolean and pointer. Implementation of structured data types: Vectors & arrays,
records and files.
UNIT IV
[07 Hrs]
Concept of abstract data type, encapsulation. Mechanisms to create new abstract data types, type definition,
type equivalence, type definitions with parameters.
UNIT V
[08 Hrs]
Sequence control structures used in expressions and their implementation. Sequence control
structures used between statements or group of statements and their implementation.
Subprograms : subprogram definition and activation, their implementation, recursive and non recursive
subprogram calls, parameter passing, generic subprograms
UNIT VI
[07 Hrs]
Data control, referring environment, dynamic and static scope, static chain implementation and display
implementation.
Text Books
1. T. W. Pratt, Marvin V. Zelkowitz, "Programming Languages Design and Implementation ", Fourth
edition, Prentice-Hall of India.
2. Robert W Sebesta Concepts of Programming Languages. Sixth Edition, Pearson Education.
Reference Books:
1. Ravi Sethi, Programming Languages Concepts and Constructs, Second Edition, Addison-Wesley
Publication Company.
2. Allen B. Tucker and Robert E. Noonan, Programming Languages Principles and Paradigms, Second
Edition, Tata McGraw-Hill.
3. Ghezzi C, Milano P., Jazayeri M., "Programming Languages Concepts", Third Edition, John Wiley and
Sons Pvt. Ltd (WSE), ISBN 0195113063.
4. Michael L. Scott, Programming Language Pragmatics, ELSEVIER Publication, ISBN: 81-8147-370-1.
5. Dories Appleby and Julius J. Vandekopple, Programming Languages Paradigms and Practices,
Second Edition Tata McGraw-Hill.
6. Sta S., "Foundations of Programming Languages", Thomson Brookes/Cole, ISBN 981 -243-141-1.
7. P. S. Groover, Programming Languages, S. Chand Publication.
Chairperson
Date of Release
Version
May 2012
1.02
Applicable for AY
2012-13 Onwards
CT206/CT602
Programming Languages Concepts

And Constructs Laboratory
Evaluation
Scheme
L=0
T=0
P=4
Credits=2
ESE
Duration
Continuous Evaluation
ESE
Total
40
60
100
Objectives
Outcomes
To understand the concepts of various programming
language constructs, to write the program in different Students should be able to write efficient programs
programming Languages, to develop program that is using different programming languages
both correct and efficient in execution
Mapped Program Outcomes: b, c, d, e, i, k, l
LIST OF EXPERIMENTS:
BASIC Language
1) Introduction to BASIC Language.
2) To perform various Arithmetic operations .
3) To implement various control structures .
4) To implements the concept of functions.
PASCAL Language
5) Introduction to PASCAL Language.
6) To implement conditional control structures .
7) To implement the concept of loop control structures.
8) To implement concept of functions.
FORTRAN Language
9) Introduction to FORTRAN Language.
10) To implement the various control structures.
11) To implement the concept of subprograms.
12) To implement parameter passing methods .
C Language
13) To implement the concept of various storage classes.
14) To implement the concept of unconditional and conditional transfer controls.
15) To implement the concept of Bitwise operator.
16) To implement the concept of File handling.
C++ Language
17) Introduction to Object oriented programming language( C++).
18) To implement the concept of inheritance
19) To implement the concept of polymorphism.
20) To implement the concept of templates.
Beyond Syllabus
1) To implement the concept of Exception Handling.
2) To implement the concept of Streams in C++
Chairperson
Date of Release
Version
May 2012
1.02
Applicable for AY
2012-13 Onwards
CT203/CT501
Evaluation
Scheme
Data Structure
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3 Hrs
Objectives
Outcomes
To provide the student with an advanced treatment of
computer programming.
To give emphasis on design and implementation of
abstract data structures.
Students should be able to write efficient programs
Compare the efficiency of various sorting algorithms in using different data structures.
terms of both time and space.
Implement the user defined data structures in a high
level language (C / C++).
Mapped Program Outcomes: a, b, c, e, i, k, l
UNIT I:
Basics of Algorithms, Sub algorithm: Procedure and Functions. Analysis of Algorithms:
Time and Space complexity, Asymptotic Notations. Divide and Conquer Strategy,
[3 Hrs]
UNIT II:
[7 Hrs]
Arrays: Operations, types, sparse matrices. Sorting: Quick Sort, Merge Sort, Insertion,
Selection and Bubble Sort, Heap sort. Searching: Linear Search, Binary search, Hashing and Collision
handling mechanism. External Sorting.
UNIT III :
[6 Hrs]
Stacks: Fundamentals, Operations: Push, Pop, Applications of Stacks: Evaluation of expressions, Recursion,
Stack Machines, and Multiple Stacks.
Queues: Fundamentals, Operations: Add, Delete, Types of Queues: Priority Queues, Circular Queue,
Dqueue.
UNIT IV:
[10 Hrs]
Linked list: Fundamentals, Types: Singly, Doubly, Circular, Linked Stacks and Queues, Examples on linked
list, Circular linked list, doubly linked list and Applications of Linked List: Operations on Polynomials.
UNIT V:
[10 Hrs]
Trees: Basic terminology, Binary Tree Traversals, threaded storage representation, binary search tree,
applications of tree, preliminary treatment of AVL Trees, B-Trees, B+ Trees,
UNIT VI:
[9 Hrs]
Graphs: Basic terminology, Graph representation: Matrix, list, Multilist, Graph Traversals: Breadth first search,
Depth first search, Minimum Cost Spanning trees, shortest path algorithm,Topological Sort
Text Books:
nd
1. An Introduction to data Structures with applications by Trembley and Sonernson 2 edition, TMH
publication
nd
2. Fundamentals of data structure by Horowitz and Sahani 2 edition, Galotia Publication
nd
3. Data structure a Pseudocode approach with C by Gilberg Forouzan 2 edition, course Technology
Publisher.
Reference Books:
nd
1. Data Structure and Program Design in C by Kruse, Leung and Tondo 2 edition PHI publication.
nd
2. Data structure and Algorithm in Java by Lafore 2 edition SAMS publication.
3. Data structure Using C by Reema Thareja Oxford Higher Education
4. Data structure Through : A Practical Approach by G.S. Baluja, DhanpatRai & Co Ltd.
Note: Data Structure to be implemented in C/C++
Chairperson
Date of Release
Version
May 2012
1.02
Applicable for AY
2012-13 Onwards
CT204/CT502
Data Structure Laboratory
Evaluation Scheme
L=0
T=0
P=4
ESE
Total
40
60
100
Credits=2
ESE
Duration
Objectives
Outcomes
Choose suitable data structure for implementation of Students should be able to compare efficiency of
given problem,. Compare different data structures, programs using different data structures. Analyze real
Distinguish among different sorting techniques, time applications of stacks, queues, trees and graphs
Compare searching methods, Understand need of
dynamic memory allocation, Analyze real time
applications of stacks, queues, trees and graphs
Mapped Program Outcomes: a, b, c, e, i, k, l
Review Practicals:
Creating Employee database
Displaying database and
Searching database
Practical list
Practical No
Program for Quick Sort
1.
A
Program for Heap Sort
B
Program for Merge Sort using arrays
C
D
Program for Binary Search
Program for performing following operations on Stack Using Array: Push, Pop and Display
2.
A
Program for Conversion of Infix to Postfix using stack.
B
Menu Driven program for performing following operations on Queue using Array :-Insertion,
3.
A
Deletion, Traverse
Menu Driven program for performing following operations on Circular Queue using Array :B
Insertion, Deletion, Traverse
Menu driven program for performing following operations on Singly Link List
4.
A
i) Insertion of a node at all positions.
ii) Display of link list
iii) Deletion of any node
B
iv) Display of link list
v) Reversing of singly link list
C
vi) Display of Link list
Menu driven program for performing following operations on Doubly Link List
5.
A
i) Insertion of a node at specified position.
ii) Display of link list
iii) Deletion of any node.
Program for addition of two Polynomials Using Link List.
6.
A
7.
B
8.
9.
10.
A
A
B
Write a program to perform following operations on Binary Tree.

i) Creation
ii) Display using Breadth First Search
iii) Counting no. of nodes,
iv) No. of leaf nodes and
iv) Finding height of Binary Tree.
v) Finding Mirror of a Binary Tree
Program for finding following traversals of Binary Search Tree using recursion
i. In-order
ii. Pre-order
iii. Post-order
Program for Implementation of Depth First Search on Graphs
Program for finding minimum spanning tree using Kruskals algorithm
Program for finding minimum spanning tree using Prims algorithm
Beyond Syllabus:
11. Implementation of 8 Queens problem.
12. Implementation of Travelling Salesman Problem.
Chairperson
Date of Release
Version
May 2012
1.02
Applicable for AY
2012-13 Onwards
EE218/EE510
Logic Design
Evaluation
Scheme
L=3
T=1
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3 Hrs
Objectives
Outcomes
To study different number systems, basic logic gate, to
build simple logic circuits, to understand Boolean
algebra, to design simple combinational logics-maps, Students sh ould be able to design logic circuits using
sequential logic circuits, to understand finite state appropriate components , able to optimize simple logic
machines, to designs, Adders, Shifters, Comparators; using Karnaugh maps
Counters, Multiplier, to study ALU.
Mapped Program Outcomes: a, b, c, d, e, h, i.
UNIT I:
[07 Hrs]
Error detection and correction, Representation of negative numbers, BCD arithmetic, Floating-point
representation, Introduction to Logic families & their characteristics such as Fan-In, Fan-out, Propagation
delay, Power dissipation, Noise Margin, Timing issues.
UNIT II :
[08 Hrs]
Switching algebra & simplification of Boolean expressions, SOP, POS, Canonical forms, DeMorgans
Theorem. Implementations of Boolean expressions using logic gates, Functions & implementation using
Multiplexer, Demultiplexer, Encoder, Decoder & MSI circuits
UNIT III :
[06 Hrs]
Minimization methods such as Karnaugh map, Quine Mcclauskey methods. Incompletely specified functions,
Combinational circuit analysis, Static & Dynamic Hazards
UNIT IV:
[09 Hrs]
Design of Arithmetic circuits: Half & Full adders, Half & Full Subtractions, Multibit parallel adders Carry
Propagate adder & Carry Look ahead adder, Comparators, Multi bit Application designs, Formation of
switching functions from word statements, ALU & Combinational circuits design using MSI and LSI chips.
UNIT V :
[05 Hrs]
Need for sequential circuits, Binary cell, Latches and flip-flops. RS-FF, D-FF, JK-FF, Master-Slave JK-FF & TFFs, Excitation & Truth Table, Flip-flop conversions, Shift registers. Timing & Clocking: Rise time, fall time,
Clock skew, Edge & Level triggers.
UNIT VI :
[10 Hrs]
Introduction to Synchronous and Asynchronous sequential Circuits, Counters, Ring counters, Classification of
synchronous machines, Analysis of Synchronous Sequential circuits, Design of synchronous sequential
machines (Moore & Mealy). State diagram, State reduction and minimization. Minimizing next-state and
output decoders, Design of single and multi-mode counters, Sequence detectors.
Text Books :
1) Digital Circuits & Microprocessors, Hebert Taub, Mc Graw Hill ,1988
nd
2) Switching Theory & Finite Automata, Zvi Kohavi, Mc Graw Hill, 2 edition,2004
Reference Books:
rd
1) Fundamentals of Logic Design, C.H.Roth ,Public Work & Services,3 edition 2007
2) Engg Approach to Digital Design, Fletcher, Prentice Hall of India 1993.
th
3) Digital Design, M. Morris Mano, Third Edition, Prentice Hall of India,4 edition
2008
Chairperson
Date of Release
Version
May 2012
1.02
Applicable for AY
2012-13 Onwards
EE217/EE511
Logic Design Laboratory
Evaluation Scheme
L=0
T=0
P=2
ESE
Total
40
60
100
Credits = 1
ESE Duration
Objectives
Outcomes
Students
should
be
able
to perform various operations
To learn the basic methods for the design of digital
on logic circuits
circuits and provide the fundamental concepts used
in the design of digital systems.
Mapped Program Outcomes: a, b, c, d, e, h, i
1.
To verify truth table of

a. all logic gates using ICs
b. Basic logic gates using universal gates
2.
Verification of Boolean expression using DeMorgans Theorem on Bread board
3.
Verification of truth table for MUX / DeMUX using 74153 & 74138 ICs
4.
Design& Verification of Half & Full Adder Circuit
5.
Design& Verification of Half & Full Subtractor Circuit
6.
To Implement RS Flip-Flop & Clocked D Flip-Flop using NAND Gate & Verify the Truth table
7.
To Implement JK Flip-Flop & T Flip-Flop using ICs on bread board & Verify its truth table
8.
To Design Two bit Binary Counter & verify its truth table
9.
To Verify truth table of 1-bit & 2-bit comparator using logic gates & IC7485
10.
To Design Asynchronous counter using Flip-Flop
11.
To Design Left & Right Shift 3-bit register
12.
Mini Project
Chairperson
Date of Release
Version
May 2012
1.02
Applicable for AY
2012-13 Onwards
CT210/CT510
Web Technology Laboratory
Evaluation Scheme
L=0
T=0
P=4
ESE
Total
40
60
100
Credits=2
ESE Duration
Objectives
Outcomes
The course delivers an overview for developing Web-based Student should be able to design interactive
web sites as per the requirements of
applications. This course focuses on techniques for building applications.
server-side programs for dynamically generated Web sites,
Web-enabled enterprise computing, and other applications
that require WWW access to server-based resources.
Mapped Program Outcomes: a,b,c,d,e,f,g,h,i,j,k,l,m
UNIT I : INTRODUCTION
Basic tools of internet access, email, ftp, news, www, introduction to internet programming, Electronic Mail,
File Transfer protocol, domain Name, client server application
UNIT II : WEB PAGE DESIGNING
Standard use for www documents on internet, HTTP, MIME, SGML, DTD, MTNL, URL, URL, Static and
Dynamic Web sites ,Creation of web pages: HTML tags, special characters, images, tables, forms, the
hyperlinks, Frames , style sheets
UNIT III : SCRIPTING: JAVA SCRIPT
Introduction to Javascript, Basic Syntax, Control Structures, Writing Functions, The Document Object Model,
Events Handling.
UNIT IV : XML
XML basics, understanding markup languages, structures and syntax, valid vs. well formed XML, DTD
(document type Definitions) classes.
Scripting XML, XML processor, parent child relationship, XML as a data, data type in XML, XML namespaces,
UNIT V : ASP.NET Fundamentals
HTTP and HTML, ASP.NET Controls, Data Validation Controls, Working with Images, CSS.
UNIT VI : WEBSITE DESIGN USING ASP.NET
Designing sample application in ASP.net, GET & POST Requests in forms
Unit I: INTRODUCTION
1. Introduction to Internet (overview of Internet, email, www, broad band, FTP)
2. File transfer using FTP using open source tool - Filezilla
Unit II: WEB PAGE DESIGNING
1. Study practical on standard use for WWW documents on internet, HTTP, URL, static and dynamic Web
sites.
2. Study and implement basic html tags.
3. Create an HTML page to display basic information about all the institutions under MGI in tabular format.
Each institution name should be a hyperlink linking to home page of the individual institution.
4. Create an Admission Form for college by using FORMS in HTML.
5. Create a sample page displaying use of frames.
Unit III: SCRIPTING - JAVASCRIPT:
1. Study practical on Introduction to JavaScript, basic syntax, Document Object Model.
2. Program to demonstrate the use of conditional statements.
3. Program to demonstrate the use of while and for loops.
4. Program to demonstrate use of functions.
5. Demonstrate validation of form controls using simple functions written in JavaScript.
Chairperson
Date of Release
Version
May 2012
1.02
Applicable for AY
2012-13 Onwards
CT210/CT510
Evaluation Scheme
Web Technology Laboratory
L=0
T=0
P=4
ESE
Total
40
60
100
Credits=2
ESE Duration
Objectives
Outcomes
Student
should
be
able to design interactive
The course delivers an overview for developing Web-based
web sites as per the requirements of
applications. This course focuses on techniques for building applications.
server-side programs for dynamically generated Web sites,
Web-enabled enterprise computing, and other applications
that require WWW access to server-based resources.
Mapped Program Outcomes: a,b,c,d,e,f,g,h,i,j,k,l,m
Unit IV: XML

1. To study XML basics, understanding markup languages, structures and syntax, valid vs. well formed
XML.
2. To write a program to demonstrate use of External and Internal DTD.
Unit V: ASP.NET FUNDAMENTALS

1. Introduction to ASP.net
2. To create a web form to demonstrate use of ASP.net web controls Textbox Control, HyperLink
Control and CheckBox Control.
3. To create a web form to demonstrate use of ASP.net web controls Radio Button Control, Image
Control and Link Button Control.
4. Create a web form which will accept two numbers as input and perform an operation depending on
value selected from dropdown list control.
5. To demonstrate use of validation controls including required field validator, range validator, compare
validator, regular expression validator and summary validator.
Unit VI: WEBSITE DESIGN USING ASP.NET
1. Create a web application which allows users to enter First name, Middle name and Last name. Display
First name, middle name and last name as well as full name into another page. Retrieve the value
from Previous page using POST method only.
2. Create a web application which allows users to enter First name, Middle name and Last name. Display
First name, middle name and last name as well as full name into another page. Pass the value across
the web page using Query string only.
Reference books
nd
1. Web Technologies: Achyut S. Godbole & Atul Kahate, 2 edition Tata McGraw Hill Publication.
2. Internet and World Wide Web How to program by Dietel and Nieto PHI/Pearson Education Asia
3. ASP.NET 3.5 Unleashed, By Stephan Walther
4. Sams Teach Yourself JavaScript in 24 Hours, By Michael Moncur
Chairperson
Date of Release
Version
May 2012
1.02
Applicable for AY
2012-13 Onwards
GE206/GE506
Evaluation
Scheme
Discrete Mathematics & Graph Theory
L=3
T=1
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3 Hrs
Objectives
To fulfill the need of the discipline of computer technology by
adding many different areas of mathematics like mathematical
logic and set theory, relations and functions, group theory,
rings , graph theory, which are used in cryptographic
algorithms and dynamic graphing.
Outcomes
Students should be able to apply
mathematical logic and set theory, relations
and functions, group theory, rings , graph
theory, which are used in cryptographic
algorithm for solving engineering problems.
Mapped Program Outcomes: a,b,c,e,i,k,l

UNIT I:
[08 Hrs]
Mathematical, Logic & Set Theory: Statement & Notation, Negation, Conjunction, Disjunction, Tautologies,
Truth Tables, Basic Concepts of Set Theory, Inclusion & equality of set, The Power Set, Ordered Pairs & ntuples, Operations on Sets , relation and functions, Partial order, Equivalence relations, Peano axioms and
induction. Propositions, Predicate logic, formal mathematical systems, Algebra, Homomorphism,
Automorphism.
UNIT II:
[07 Hrs]
Relations & Functions: Relation & Ordering, Properties of Binary in a set Relation Matrix & Graphs - a relation,
Partition & Covering of a set, Equivalence relation, Partial ordering, Partially Ordered sets, Function (Definition
& Introduction), Composition of functions, Inverse Functions, Characteristics function of a set.
UNIT III:
[07 Hrs]
Group Theory: Groups (Definitions & Examples) Subgroups & Homomorphism, Cosets & Lagranges theorem,
Normal subgroups, Codes & Group Codes. Semi groups & Monoids (definitions & examples). Homomorphism
of semigropups & monoids, SubSemi groups & monoids.
UNIT IV:
[08 Hrs]
Rings (Definitions & Examples): Integral domains ring homomorphisms, ideas of ring polynomial,Fields,
Lattice.
Fuzzy Sets and Fuzzy Logic :Fuzzy sets and systems, crisp sets, overview of fuzzy logic and classical logic,
fuzzy compliment, fuzzy union, fuzzy intersection and combinations of these fuzzy sets operations crisp and
fuzzy relations.
UNIT V:
[08 Hrs]
Graph Theory: Basic concepts of graph theory, Basic definitions, Paths & circuits Reach ability &
connectedness, Matrix Representation of graphs, Tree & their representation & operations, Rooted trees,
Path lengths in rooted trees, Multi graphs & weighted graphs, shortest paths in weighted graphs,
Hypergraphs, transitive closure, Spanning trees.
UNIT VI:
[07 Hrs]
Random variable and probability distribution :Random variable: discrete and continuous; probability density
function; Probability distribution function for discrete, and continuous random variable Joint distributions.
Mathematical Expectation : Definition of mathematical expectation, functions of random variables, other
measures of central tendency and dispersion, Skewness and Kurtosis.
Text Books:
rd
1. Discrete Mathematics Structure with application to Computer Science by J. P. Tremblay & R. Manohar ,23
re-print,2005,Tata McGraw-Hills Publication Company Limited, New Delhi.
nd
2.Probability and Statistics M R Spiegel, John Schiller, R. Alu Shrinivasan, 2 edition, Tata McGraw-Hills
Publication Company Limited, New Delhi.
th
3 .Advanced Engineering Mathematics - by H.K. Dass, 8 revised
edition, 2007.S.Chand and Company Limited ,Delhi.
Reference Books:
nd
1.Discrete Mathematics by Lipschutz Schaumss Outline series,2 edition,Tata McGraw-Hills Publication
Company Limited, New Delhi.
2 Discrete Mathematical structures :-By
edition,2001,Prentice Hall of India, New Delhi.
Bernard
Kolman
Chairperson
Date of Release
Version
,Robert
C.Busby,Sharon
May 2012
1.02
Ross,3
Applicable for AY
2012-13 Onwards
rd
CT 221/CT505
Object Oriented Programming
L=3
T=1
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3 Hrs
Evaluation Scheme
Objectives
Outcomes
Comprehend principles of object- oriented programming that Students should be able to write efficient
includes concepts of class, objects, and features of OOP, programs using different object oriented
Comprehend the features of OOP at the class and object level programming language concepts
that includes abstraction, encapsulation, information hiding
and the use of reusable components to solve the problems,
Comprehend and analyze problems and programming issues
such as dynamic memory management, indirect object
references, and recursion, to understand file handling and
streams, Comprehend concepts of object oriented
development, software lifecycle, requirements, design,
notation and tools to view a system as a collection of entities
that interact together to accomplish certain objectives.
Mapped Program Outcomes: a,b,c,d,e,i,k,l,m
UNIT 1:
[07 Hrs]
Introduction to object oriented programming paradigm, procedure oriented programming Vs OOP, features of
OOP, benefits of OOP, defining class in C++, instantiating a class in C++.
UNIT II:
[08 Hrs]
Functions in C++, function overloading, friendly functions, Passing & returning Objects, pointers to members,
constructors and destructors, copy constructor, operator overloading.
UNIT III:
[08 Hrs]
Inheritance, types of inheritance, virtual base classes, abstract classes, virtual function, late binding
UNIT IV:
[08 Hrs]
C++ streams, C++ stream classes, file handling in C++, class templates, function templates
UNIT V:
[07 Hrs]
Basics of exception handling, exception handling mechanism, introduction to the standard template library.
UNIT VI:
[07 Hrs]
Object Oriented System Development, procedure oriented paradigms, procedure oriented development tools,
object oriented paradigm, object oriented notations and graphs, steps in object oriented analysis, steps in
object oriented design, prototyping paradigm.
Text Books:
th
1. Thinking in Java by Bruce Eckel Prentice Hall Publication. 4 Edition.

Reference books :
1. Object oriented programming in C++, Robert Lafore, Galgotia Publication
2. Mastering C++ Ravishanker ,Venugopal, TMH Publication
Chairperson
Date of Release
Version
May 2012
1.02
Applicable for AY
2012-13 Onwards
CT 222/CT506
Object Oriented Programming

Laboratory
Evaluation
Scheme
L=0
T=0
P=2
ESE
Total
40
60
100
Objectives
Credits=1
ESE
Duration
Outcomes
Read and modify substantial well-written C++

programs, to create classes and small programs in
C++ that are correct, robust reused and modified by
others, to make use of various object-oriented
features, including inheritance, multiple inheritance
and genericity, to enhance the above qualities.
Students should be able to write efficient programs

using different
object oriented programming
language concepts and enhance the qualities of
OOP.
Mapped Program Outcomes: a,b,c,d,e,i,k,l,m
1. Implement the concept of Class and its data members and member functions.
2. Implement the Class with arrays of Objects.
3. Implement the concept of function overloading.
4. Implement the concept of passing object as a function argument.
5. Implement the concept of friend function.
6. Implement the concept of constructor and its type.
7. Implement the concept of dynamic constructor.
8. Implement the concept of object pointers.
9. Implement the concept of unary operator overloading.
10. Implement the concept of binary operator overloading.
11. Implement the concept of single inheritance.
12. Implement the concept of multilevel Inheritance.
13. Implement the concept of each access specifiers (Private, Public and Protected) .
14. Implement the concept of run time polymorphism.
15. Implement the concept of Files.
16. Implement the concept of command line arguments.
17. Implement the concept of function templates.
18. Implement the concept of Class templates.
19. Implement the concept of exception.
20. Implement the concept of multiple catch statement.
Chairperson
Date of Release
Version
May 2012
1.02
Applicable for AY
2012-13 Onwards
CT207/CT603
Evaluation
Scheme
Computer Architecture & Organization
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3 Hrs
Objectives
Outcomes
To understand evolution of Von-Neumann architectures and Students should be able to select
various advance mechanisms to computer design to improve appropriate
architecture
and
various
performance and speed of computer.
mechanisms to improve performance of
systems.
Mapped Program Outcomes: a,c,e,h,i,k
Unit I:
[06 HRS]
Basic Structure of Computer Hardware and Software: Functional Units, Basic Operational Concepts,
Introduction to pipelining, Bus Structures, Software , addressing methods and machine program sequencing :
Memory Locations , addressing and encoding of information, Main memory operation , Instructions and
Instruction sequencing, addressing modes, Assembly language, Stacks, Subroutine.
UNIT II:
[06 HRS]
Instruction Sets: Instruction Format, limitations of Short word- length machines, High level language
considerations, (Motorola 68000) processor Architecture. Processing UNIT: Some fundamental concepts,
Execution of a complete instruction, Single, two, three bus organization, Sequencing of control Signals.
UNIT III:
[07 HRS]
Processor Design, hard wired control, Microprogrammed Control: Microinstructions, Grouping of control
signals, Microprogram sequencing, Micro Instructions with next Address field, perfecting microinstruction,
Emulation, Bit Slices, Introduction to Microprogramming.
UNIT IV:
[10 HRS]
Arithmetic: Number Representation , Addition of Positive numbers, Logic Design for fast adders, Addition and
Subtraction , Arithmetic and Branching conditions, Multiplications of positive numbers, Signed- Operand
multiplication, fast Multiplication, Booths Algorithm, Integer Division, Floating point numbers and operations .
UNIT V:
[10 HRS]
The main Memory: some basic concepts, Memory Hierarchy, semiconductor RAM memories, Memory system
consideration, semiconductor ROM memories, Multiple module memories and interleaving, Cache Memory,
Mapping techniques, Virtual memories, memory management requirements.
UNIT VI:
[06 HRS]
Computer Peripherals: I/O Devices, DMA, Interrupt handling, Online storage, File services, working of USB.
Text Books:
th
1. Computer Organization by V.Carl Hamacher, Zvonko Vranesic, Safwat Zaky , 5 Edition- McGrawHill
Publication.
Reference:
th
1. Computer Organization and Architecture by Willaiam Staliing 6 edition Pearson Education
rd
2. Computer Architecture & Organization By J.P. Hayes 3 edition McGrawHill Publication.
Chairperson
Date of Release
Version
May 2012
1.02
Applicable for AY
2012-13 Onwards
ET213/ET501
Microprocessor
Evaluation
Scheme
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3 Hrs
Objectives
Outcomes
To study the architecture of 16 bit processors and its Students should be able to understand architecture of
assembly language programming, to introduce the 8086 and do assembly language programming.
features and technology of microprocessor systems,
to interface various peripheral devices with 16-bit
processor 8086
Mapped Program Outcomes: a,b,c,d,e,i,k
COURSE OBJECTIVES:
1. To study the architecture of 16 bit processors and its assembly language programming
2. To introduce the features and technology of microprocessor systems
3. To interface various peripheral devices with 16-bit processor 8086
UNIT I:
[06 Hrs]
Introduction to 16 bit microprocessor family, architecture of 8086 & 8088 signal description segmentation,
memory organization, pipelining, fetch read & write cycle, minimum mode system, comparison& 8086with
8088
Unit II:
[09 Hrs]
Addressing modes of instruction, assembler directives, instruction set of 8086/8088, assembly language
programming of 8086/8088
UNIT III:
[08 Hrs]
Maximum mode of 8086, read and write machine cycle, 8288 bus controller, 8284 clock generator,
coprocessor 8087 , interfacing 8087 with 8086 instruction set &programming of 8087
UNIT IV:
[07 Hrs]
Interfacing memory with 8086&8088, interfacing buffers & latches, interfacing 8255 keys, LEDs, 7-segment
display, ADC, DAC , stepper motor.
UNIT V:
[08 Hrs]
Interrupt structure of 8086, interfacing 8259, interfacing 8253/8254, interfacing 8251, interfacing 8279,
interfacing keyboard and displays, Block diagram of DMA controller 8237, Detail study of DMA operation in
various modes.
UNIT VI:
[07 Hrs]
Introduction to the architecture of 80286, 80386, 80486 microprocessor, Detail study of architecture of 80386
Text book:
1) 8086/88 Family Architecture, Interfacing & Programming by D.V. Hall. TMH.
2) Advanced Microprocessor & Peripherals by Ray, Bhurchandi. McGraw Hill.
3) 16 bit Microprocessors by Triebel & A. Singh.
Chairperson
Date of Release
Version
May 2012
1.02
Applicable for AY
2012-13 Onwards
ET214/ET502
Evaluation Scheme
Microprocessor Laboratory
L=0
T=0
P=2
ESE
Total
40
60
100
Credits=1
ESE
Duration
Objectives
Outcomes
To know architecture and pins of 8086 Students should be able to write assembly language
microprocessor, to provide programming skills, to programs using different addressing modes and
make use of microprocessor in parallel and serial interface various peripheral devices to 8086.
communication and interfacing with different
peripherals
Mapped Program Outcomes: a,b,c,d,e,i,k
OBJECTIVES:
1. To know about the architecture and pins of 8086 microprocessor.
2. To provide programming skills to students
3. To make use of microprocessor in parallel and serial communication and interfacing with different
peripherals
1. Addition, subtraction , multiplication & division of 16 bit number.
nd
2. To find 2 largest number form the data block of 10 data bytes.
3. To write an assembly language program to compare to arrays of 10 bytes by using string instruction.
4. Write a program to solve automatic equation using Shift and Add method.
5. To write an assembly language program to add 10 BCD numbers.
6. To write an assembly language program to find a data byte in a string .
7. To write an assembly language program to find count of positive and negative numbers in a given array.
8. To interface IC 8253 with 8086 at an address 5000H. Write a program to generate a square wave of
50ms. ON time.
9. To interface DAC 0808 with 8086 at an address 4000H and write a program to generate a sawtooth wave
of amp.5V at the output.
10. To interface 8279 with 8086 at an address 4444H and interface keyboard and displays with 8086.
Chairperson
Date of Release
Version
May 2012
1.02
Applicable for AY
2012-13 Onwards
CT208/CT604
Evaluation
Scheme
System Programming
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3 Hrs
Objectives
Outcomes
To understand the procedures for the design of Students should be able to design some basic system
software system, to compare different processor softwares, compare various processor architectures.
architectures, to understand the concept of device
driver
Mapped Program Outcomes: b,c,d,e,,i,j,k,l,m
COURSE OBJECTIVES:
1. Understand the procedure for the design of software system.

2. Compare different processor architectures
3. Understand the concept of device driver
UNIT I:
[08 Hrs]
Intel64 and IA-32 Processors: Basic architecture, notational conventions, brief history of Intel 64 and IA-32
Architecture, Intel NetBurst Microarchitecture, specific advances. Basic execution environment: Modes of
operation, overview of the basic execution environment, memory organization, basic program execution
registers, instruction pointer, operand-size and address-size attributes, operand addressing.
UNIT II:
[08 Hrs]
Data Types: Fundamental data types, numeric data types, pointer data types, bit field data type, string data
types, packed SIMD data types, overview of floating-point exceptions, Instruction Set Summary: generalpurpose instructions, system instructions, 64-bit mode instructions, virtual-machine extensions.
UNIT III:
[07 Hrs]
Machine language and assembly language, Assemblers general Design Procedure, Design of Assembler.
UNIT IV:
[08 Hrs]
Macro language and the macro processor ,Macro instructions ,features of macro facility, Implementation of a
restricted facility of two pass algorithm, a single pass algorithm, Implementation of macro calls within macros
,Implementation within assembler.
UNIT V:
Absolute Loader, Design of Relocatable Loader,Static Linking, Dynamic Linking, DLL.
Introduction to device Drivers : Accessing drivers, interface with kernel, Study of mouse drivers.
[07 Hrs]
UNIT VI:
Study of Object file formats, ELF, PE and COFF for WINDOWS.
[07 Hrs]
Text Books:
1. System Programming by John J. Donovan, TATA McGRAW-HILL Edition.
2. System Programming by Leland Beck, Pearson Ed.
Reference Books:
1. Intel64 and IA-32 Architectures Software Developers Manual Volume1: Basic Architecture.
2. The Intel Micropocessors 8086 / 8088, 80186 / 80188, 80286,80386,80486, Pentium and Pentium PRO
th
Processor by Barry B. Brey, 4 Edition, Prentice- Hall.
3. Unix device drives by George Pajani, Pearson Education.
4. Device Drives for Windows by Norton, Add Wesley.
5. Assembly & Assemblers by Gorshine, Prentice Hall.
Chairperson
Date of Release
Version
May 2012
1.02
Applicable for AY
2012-13 Onwards
System Programming
Laboratory
CT209/CT605
Evaluation Scheme
L=0
T=0
P=2
ESE
Total
40
60
100
Objectives
Credits=1
ESE Duration
Outcomes
To learn how to design symbol table, Literal table, Students should be able to design symbol table,
design Machine-Op table, Pseudo-Op table, to learn literal table, Implement pass I,II assemblers, Macro
how to Implement pass I, pass II of assembler, to name and definition table.
learn how to Implement the routine for error reporting,
how to design Macro Name Table and Macro
Definition Table.
Mapped Program Outcomes: b,c,d,e,,i,j,k,l,m
Objectives :
1. To learn how to design symbol table, Literal table
2. To learn how to design Machine-Op table, Pseudo-Op table.
3. To learn how to Implement pass I of assembler.
4. To learn how to Implement pass II of assembler.
5. To learn how to Implement the routine for error reporting.
6. To learn how to design Macro Name Table and Macro Definition Table.
Practical List
1. Implementation of Symbol Table(ST) for pass I of assembler.
2. Implementation of Literal Table(LT) for pass I of assembler.
3. To Design the Machine-Op Table(MOT) for assembler processing.
4. To Design the Pseudo-Op Table(POT) for assembler processing.
5. Implementation of pass I of assembler.
6. Implementation of pass II of assembler.
7. To Implement the routine for error reporting.
8. Implementation of Macro Name Table(MNT) for macro processing.
9. Implementation of Macro Definition Table(MDT) for macro processing.
Chairperson
Date of Release
Version
May 2012
1.02
Applicable for AY
2012-13 Onwards
Management Economics and HR

Management
GE303/GE609
Evaluation
Scheme
L=3
T=0
P=0
Credits=3
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3 Hrs
Objectives
To understand the financial & economical aspects of
various activities carried out by business & industrial
organization, to implement & practice.
Outcomes
Students should be able to select and practice
appropriate financial & economical aspects.
Mapped Program Outcomes: d,e,f,g,h,i,j

UNIT-I:
Definition, nature & scope of management, Functions of Management-Planning, Decision making, Organizing,
Directing, Controlling, Communicating etc.
UNIT-II:
Meaning and Definition of Industrial Economics Macro & Micro Economics, Demand utility & indifference
curves, Approaches to analysis of demand, Elasticity of demand, its measures, Methods of demand
forecasting, factors of Production, Law of returns and cost
UNIT-III:
Inflation, Deflation, Function of RBI, monetary policy-making, objectives and features. Fiscal policy of
government, Sources of public revenue, principles of taxation, direct and indirect taxes, Money Banking and
Trade: Functions of money, supply & demand for money, money price level, black money, meaning,
magnitude & consequences.
UNIT-IV:
Functions of Commercial banks, banking system in India, shortcomings and improvements.., Theory of
international trade, balance of trade and payment, Foreign exchange control, devaluation, New economic
policy: Liberalization, extending privatization, globalization. EGovernance, e-Business, e-Marketing and ePayments.
UNIT-V:
Introduction: Concept and evolution of personnel management and HRM, Difference between PM and HRM.
Functions of HRM, Concept of HRD. HR Planning, Concept, Objective, Importance, and Process.
Recruitment: Meaning, process, and sources: selection process, test, and types of test, interview, and types of
interview. Training and Development: Difference between training, Education and development. Need for
training, objectives of training, identifying training needs, training methods
UNIT-VI:
Job Design: Meaning, concept, Job Analysis, Job description, Job specification, Job rotation, job
enlargement, job enrichment, job evaluation. Promotion: objectives, types, promotion by seniority vs. merit.
Transfer: meaning purpose; Demotion, dismissal, suspension, suspension, discharge. Concept of motivation,
theories of motivation Performance Appraisal: Meaning, purpose, merit rating vs. performance evaluation
methods of performance appraisal, MBO-MBR (Management by Results) potential appraisal.
TEXT BOOKS:
1. Industrial Management , I.K. Chopde, A.M. Sheikh,
2. Managerial Economics, by D N Dwivedi, Vikas Publishing House Pvt Limited, 2009
3. Human Resource Management and Personnel Management , Subba Rao, Himalaya Publications
4. Personnel Management , C.B. Mamoria, Himalaya Publications
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
Theoretical Foundation of Computer

Science
CT301/CT606
Evaluation
Scheme
L=3
T=1
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3 Hrs
Objectives
To study theoretical foundations and find their
applications in the area of compiler construction,
complexity analysis, verifying the correctness of
circuits, and protocols.
Outcomes
Students should be able to apply
theoretical
foundations in various applications for verifications
and analysis.
Mapped Program Outcomes: a,c,d,e,i,

UNIT I:
[8 hrs]
Alphabet, Symbols, Sets, Strings, Language, Operations, Relations, Design of Finite State Machines,
Acceptance of strings and languages, Non Deterministic Finite Automation , Deterministic Finite Automation
Equivalence between NFA and DFA ,NFA with -transition, Minimization of FA.
UNIT II:
[7 hrs]
Regular sets, Regular expressions, Manipulation of regular expressions, Equivalence between RE and FA.
Pumping Lemma, closure properties of regular sets ( Proofs not required), Regular grammars, Right linear
and left linear regular grammars, inter-conversion between LLG & RLG, Equivalence between regular
grammar and F.A., Inter-conversion between RE and RG.
UNIT III:
[6 hrs]
Context free grammar, Derivation trees (Syntax tree and Parse tree), Ambiguous Grammar, Context Free
Language (CFL), Normal Form of grammar: Chomsky Normal form, Greibach normal form, CYK algorithm.
UNIT IV:
[6hrs]
Push down automata, definition, and model, acceptance of CFL by empty Stack and by final state,
equivalence CFL and PDA, Inter-conversion, Closure of properties of CFL, DPDA & NDPDA.
UNIT V:
[8 Hrs]
Turing machine, Definition, Model of TM, Design of Turing Machine, Computable functions, Recursive
enumerable language, Recursive Language, Properties of Recursive enumerable language, Churchs
hypothesis, Chomsky hierarchy of language, Linear bounded automata and context sensitive language,
Universal Turing Machine
UNIT VI:
[5 hrs]
Un-decidability Problems related to Recursive enumerable language and Turing Machine, post
correspondence problem. Recursive function Theory Basis functions and operations on them. Bounded
minimization preemptive recursive function unbounded minimization and recursive function.
TEXT BOOKS:
1. Introduction to Automata Theory, Languages, and computation , Hopcroft J.E., Rajeev Motwani, Jeffrey D.
Ullman, 3rd Edition, Pearson Education.
rd
2. Introduction to languages and the Theory of Computation , John C.Martin, 3 Edition, Mc Graw Hill
REFERENCE BOOK:
nd
1. Introduction to the Theory of Computation , Michael Sipser, 2 Edition, Kindle edition, GALE CENGAGE
Learning
2. Theory of Computation ,Dr. O.G. Kakde, Laxmi Publication.
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT302/CT607
Evaluation
Scheme
Operating Systems
MSE-I
15
MSE-II
15
TA
10
L=4
ESE
60
T=0
P=0
Total
100
Credits=4
ESE Duration
3 Hrs
Objectives
Outcomes
To understand OS Concepts with emphasis on foundations &

design principles, Batch processing, Multiprogramming &
Timesharing, to understand structures & functions of
operating systems, to learn different components of OS like
Process Management, Concurrency mechanisms, Memory
Management, Virtual Memory, File System and Secondary
Storage Management, Deadlock handling, Security &
protection,
Students should be able to solve process

management,
deadlock,
concurrency,
resource problems by applying appropriate
mechanism.
Mapped Program Outcomes: a,b,c,e,k,l,m

UNIT I:
[7Hrs]
Introduction, evolution of OS, concept of distributed OS, basic hardware support necessary for modern
operating system, services provided by OS, system calls.
UNIT II:
[8Hrs]
Process management-introduction, process control block, process states, process context switch, and
threads: user level and kernel level, CPU scheduling, goals of scheduling, CPU scheduling in batch OS,
Interactive OS and real time OS, algorithm evaluation.
UNIT III:
[7Hrs]
Inter-process communication: process cooperation and synchronization, race condition, critical region, mutual
exclusion and implementation, semaphores, conditional critical regions and monitors, classical inter-process
communication problems, message passing.
UNIT IV:
[8Hrs]
Deadlocks: necessary conditions, deadlock avoidance, deadlock prevention, recovery from deadlock.
Protection and security: Goal of protection, Mechanism and policies, Domain of protection, access list
Capability list access matrix and its implementation, dynamic protection structures, revocation.
UNIT V:
[8Hrs]
Memory management techniques-contiguous and non-contiguous, paging and segmentation, translation look
aside buffer (TLB) and overheads, virtual memory and demand paging, page faults and instruction restart,
problems of large address spaces, page replacement algorithms and working sets.
UNIT VI:
[7Hrs]
File systems-introduction, disk space management and space allocation strategies, directory structures, disk
caching, file system consistency and log structured file system, disk arm scheduling strategies: FCFS, SSTF,
SCAN, CSACN, LOOK, CLOOK, Selecting a disk scheduling algorithm, sector queuing, I/O management, File
Organization: Sequential, Index, Index Sequential, Directory Structure.
TEXT BOOKS:
th
1. Operating system concepts, A. Silberchatz and P.Galvin, 5 Edition, Addison Wesley Longman, Inc.
REFERENCE BOOKS:
nd
1. Modern operating systems, A.S. Tanenbaum, 2 edition, Prentice Hall of India publication.
nd
2. Operating System, Crowley, 2 Edition. Tata McGraw Hill publication.
th
3. Operating System, William Stalling, 5 Edition, Pearson Education publication.
4. Shell Programming, Rebecca Thomas , Prentice Hall,
nd
5. The UNIX operating system, Maurice Bach, 2 Edition, Prentice Hall publication.
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT303/CT608
Operating Systems Laboratory
Evaluation
Scheme
40
Objectives
To understand the concepts of operating system,
Compare different CPU scheduling algorithm,
Distinguish between different page replacement
algorithm, Choose safe state to avoid deadlock
L=0
T=0
P=2
Credits=1
ESE
Total
ESE
Duration
60
100
Outcomes
Students should be able to solve CPU scheduling,
Page replacement and deadlock related problems
by writing programs.
Mapped Program Outcomes: b,c,e,,k,l,m

LIST OF PRACTICAL
1. Study of operating system
2. To implement FCFS CPU scheduling algorithm
3. To implement Round Robin CPU Scheduling Algorithm
4. To implement SJF CPU Scheduling Algorithm
5. To implement Priority based CPU Scheduling Algorithm
6. To implement non -preemptive priority based CPU Scheduling Algorithm
7. To implement Deadlock Avoidance using Bankers algorithm
8. To implement page replacement algorithm using FIFO
9. To implement page replacement algorithm using LRU(Least Recently Used)
10. To implement Optimal Page Replacement algorithm
BEYOND SYLLABUS
1. To study Linux operating system
2. Practical based on Shell programming
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT340/CT715
Evaluation
Scheme
Computer Networks
MSE-I
15
MSE-II
15
L=4
TA
10
Objectives
This course introduces fundamental concepts and
principles of computer communication networks
from the primary perspective of the ISO OSI Internet
framework. This course provides detailed concepts
of layers, Transmissions medias, IEEE LAN
standards and routing and congestion control
algorithms.
It
also
introduces
traditional
cryptography.
ESE
60
T=0
Total
100
P=0
Credits=4
ESE Duration
3 Hrs
Outcomes
Students should be able to select appropriate
topology, transmission media, IEEE LAN Standard,
routing algo..
Students should be able to solve security problems
by applying cryptographic techniques.
Mapped Program Outcomes: c,d,e,f,h,i,k,l,m

UNIT I :
[8Hrs]
Introduction: The uses of computer networks, LANs, MANs, WANs. wireless networks, protocol hierarchies,
design issues for layers, interfaces and services, connection oriented and connectionless services, service
primitives relationship of services to protocols. The OSI reference model, TCP/IP reference model,
Comparison of OSI & TCP/IP reference models, Critique of OSI model & protocols, critique of TCP/IP
reference model.
UNIT II:
[6Hrs]
The Physical Layer: The theoretical basis of data communication-Fourier Analysis, Bandwidth-limited signals.
The maximum data rate of a channel. Transmission Media-Guided and unguided, Telephone System,
Modems, RS-232C & RS-449. Introduction to wireless communication and basic concepts of Mobile
communication.
UNIT III:
[8Hrs]
The Data Link Layer: Data link layer design issues- Framing, Error Control, Flow Control, Link Management,
Error detection and Correction-Error-Correcting Codes, error-detecting codes, Elementary data link protocolsAn Unrestricted simplex Protocol, A simplex stop and wait protocol, A simplex protocol for a noisy channel,
Sliding window protocols- A one bit sliding window protocol, Go Back N protocol, Selective Repeat Protocol.
The Medium Access Sub-layer: Static and Dynamic Channel allocation in LANs and MANs, Access
Protocols-ALOHA, Persistent and Non Persistent CSMA, CSMA/CD, Collision free protocols, Binary
countdown, Limited-connection protocol. The adaptive tree walk protocol. IEEE standard 802 for LANs-IEEE
standard 802.3 and Ethernet, IEEE standard 802.4, 802.5, comparison.
UNIT IV
[8Hrs]
The Network Layer: Network Layer design issues-services provided to the transport layer, Routing and
Routing Algorithms-Flooding, Flow-Based, Distance Vector, Link State, Hierarchical. Congestion Control
algorithms- Pre-allocation of buffers, Packet discarding, Choke packets, Load shedding, Jitter control.
Internetworking, Examples- The network layer in the Internet.
UNIT V:
[8Hrs]
The Transport Layer: Transport layer design issues-services provided to the session layer, Quality of service,
transport service primitives, Elements of transport protocols-Addressing, Establishing and Releasing a
connection, Flow control and Buffering, Multiplexing, Crash Recovery. Transmission Control Protocol (TCP).
UNIT VI:
[8Hrs]
The Application Layer: Traditional Cryptography, Substitution cipher, Transposition cipher, Secret key and
Public key Algorithms, Digital Signature, DNS-Domain Name System, Electronic mail, MIME, SMTP, Mail
Gateway, World Wide Web, FTP, TFTP.
TEXT BOOKS:
nd
rd
th
1. Computer Networks, A.S. Tanenbaum, 2 , 3 and 4 Edition, Pearson Education Publication.
REFERENCE BOOKS:
th
1. Data Communications and Networking, Behrouz Forouzan 4 Edition, Textbook Solutions.
th
2. Data and Computer Communication, William Stallings,, 4th ,5 Edition, Prentice Hall.
3. Cryptography and Network Security, William Satlling, 4th Edition, Prentice Hall publication.
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT341/CT716
Computer Networks Laboratory
Evaluation
Scheme
L=0
T=0
P=2
ESE
Total
40
60
100
Credits=1
ESE
Duration
Objectives
Outcomes
To understand the concept of OSI Reference model,

to understand the concept of routing, Error detection
and error correction, to Learn the Network Security
Concept and Implementation of Encryption and
Decryption Cipher.
Students should be able to implement error

correction/detection techniques., Encrypt
and
decrypt given plaintext into cyphertexts using
appropriate mechanisms.
Mapped Program Outcomes: b,c,d,e,f,h,i,,k,l,m

LIST OF PRACTICAL
1. Study and Comparison of OSI and TCP/IP reference model.
2. To study 802.3 LAN standard and Campus wide networking of YCCE.
3. To perform Encryption and Decryption using Playfair Cipher or Hill Cipher.
4. To perform Encryption and Decryption using Columnar transposition Cipher.
5. To implement Hamming Code.
6. Program for the simulation of Stop and Wait Protocol.
7. To implement RSA algorithm.
8. To implement Dijkstras Routing algorithm.
9. Diagnosis of computer networks using FLUK.
Verification of duplicate IP address.
Verification of duplicate host names.
Percentage of Broadcast by every terminal.
PRACTICAL BEYOND SYLLABUS:
1. Use of Network tools for Traffic Monitoring.
2. Simulation of Distance Vector routing algorithm using OMNET.
3. Simulation of Congestion control algorithm using NS3.
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT330/CT615
Evaluation
Scheme
Numerical Computing
L=3
T=1
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3 Hrs
Objectives
Outcomes
To develop in the engineering students the ability to

analyze any engineering problem in simple
mathematical manner and to apply to its solution, to
understand basic mathematical principles.
Students should be able to apply various numerical

techniques to solve engineering problems.
Mapped Program Outcomes: a,b,c,e,g,i,k,l,m

UNIT I:
[6Hrs]
Introduction to numerical computing: Characteristics of Numerical computing, Approximations and errors in
numerical computations, types of errors, analysis, error estimation, numerical instabilities in computation,
convergence (convergence of iterative method),
UNIT II:
[8Hrs]
Roots of Non-linear equations: Methods of solutions, Iterative methods, Horners rule, Bisection method,
Regula Falsi method, Iteration method, Newton Raphson method, Secant method, Muller method, multipoint
iteration method.
UNIT III:
[8Hrs]
Solutions to System of Linear Algebraic Equations: Existence of Solution, Solution By Elimination, Cramers
rule, Basic Gauss Elimination Method, Gauss Elimination With Pivoting, Gauss Jordan Method,
Tringularization Methods, Choleskeys Method, Gauss Siedel method of iteration. Round Off Errors And
Refinement, Ill Conditioned System, Matrix Inversion Method.
UNIT IV:
[8Hrs]
Interpolation and Approximation: Linear interpolation and high order interpolation using Lagrange and Newton
Interpolation methods, finite difference operators and interpolation polynomials are using finite differences,
Least squares approximation, Rational Approximation, Hermite interpolation. Approximations- least square
approximation technique, linear regression.
Numerical Differentiation and Integration: Numerical differentiation and errors in numerical differentiation,
Newton-Cotes formulae, trapezoidal rule, Simpsons rule, Double integrals by Trapezoidal and Simpson rule,
methods of undetermined coefficients for numerical integration, Guess Legendre, Gauss-Hermite formula,
Romberg Integration.
UNIT V :
[8Hrs]
Numerical Solution of Ordinary Differential Equation:
Solution By Taylors Series, Picards Method Of Successive Approximation, Eulers Method, Error Estimates
nd
th
For The Euler Method, Runge-Kutta Method for 2 and 4 order, Predictor-Corrector Methods, Initial and
boundary value problems.
UNIT VI:
[7Hrs]
Matrix Eigen Equations: Concept of Eigen-System, Polynomial Method, The Fadeev- Leverrier Method,
Graffis root squaring Method for Roots of Polynomial, Power Method for Eigen Values and Eigen-vector, QRIterative Method.
Numerical Optimisation.: Golden section search, Brents method, minimisation using derivatives, introduction
to linear programming.
TEXT BOOKS:
1. Sastry, S. S. Introductory Methods of Numerical Analysis, 3rd Edition. Prentice- Hall of India, New
Delhi (2002).
REFERENCE BOOKS:
1. Numerical Methods , E. Balagurusamy, Tata McGraw hill.
2. Schaums Outlines: Numerical Analysis, 2nd Editiond. Tata McGraw Hill Publishing Co. Limited.
3. Numerical Computational Methods P.B. Patil, U.P. Verma, Narosa Publishing, New Dellhi, 2006.
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT331/CT616
Numerical Computing
Evaluation
Scheme
L=0
T=0
P=2
ESE
Total
40
60
100
Objectives
To apply the numerical methods to real life scenario.
Credits=1
ESE
Duration
Outcomes
Students should be able to apply theoretical
numerical methods to solve real life problems.
Mapped Program Outcomes: b,c,e,g,i,k,l,m

COURSE OBJECTIVES
1. To apply the theoretical numerical methods to real life scenario.
LIST OF PRACTICAL
3
1. Write A Program To Find The Root Of The Equation X - 2x - 5 = 0 By Using Bisection Method.
3
2. Write A Program To Find The Root Of The Equation X - 2x - 5=0 By Using False Position Method.
2
3. Write A Program To Find The Root Of The Equation X -3x + 2=0 By Using Newton Raphson Method
2
4. Write A Program To Find The Root Of The Equation X -3x + 2=0 By Using Muller Method.
5. Write A Program To Solve The System Of Equation By Using Gauss Elimination Method.
6. Write A Program To Solve The System Of Equation By Using Triangular Factorization Method.
7. Write A Program To Find The Square Root By Using The Second Order Lagrange Interpolation
Polynomial Equation.
8. Write A Program To Fit A Line Y=A + Bx To Given Set Of Data Point By Least Squares Method
9. Write A Program For Integrating A Given Function By Using Simpson 1/3rd Rule
10. Write A Program To Estimate The Solution In The First Order Differential Equation Y=F(X,Y) At Given
Point By Using Euler's Method
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT314/CT609
Evaluation
Scheme
VI SEMESTER
Design & Analysis Of Algorithms
MSE-I
15
MSE-II
15
TA
10
ESE
60
Objectives
L=3
T=1
Total
100
P=0
Credits=4
ESE Duration
3 Hrs
Outcomes
To introduce basic algorithmic techniques, time

requirements of an algorithm and mathematical
techniques used in analysis of algorithms, learn
analysis of algorithms for a wide variety of
foundational problems occurring in computer
science applications with discussions on complexity
and NP-completeness.
Mapped Program Outcomes: b,c,d,e,i,k,l,m
Students should be able to design some algorithms

and analyze their performance with respect to
selected evaluation parameters
UNIT I:
[7Hrs]
2
Mathematical foundations, summation of arithmetic and geometric series, n, n , bound summations using
integration, recurrence relations, and solutions of recurrence relations using technique of characteristic
equation and generating functions.
UNIT II:
[8Hrs]
Asymptotic notations of analysis of algorithms, analyzing control structures, worst case and average case
analysis, amortized analysis, sorting algorithms such as selection sort, insertion sort, bubble sort, heap sort,
External Sorting, lower bound proof, elementary and advanced data structures with operations on them and
their time complexity.
UNIT III:
[8Hrs]
Divide and conquer basic strategy, binary search, quick sort, merge sort, Fast Fourier Transform etc. Greedy
method basic strategy, application to job sequencing with deadlines problem, minimum cost spanning trees,
single source shortest path etc.
UNIT IV:
[7Hrs]
Dynamic Programming basic strategy, multistage graphs, all pair shortest path, single source shortest paths,
optimal binary search trees, traveling salesman problem.
UNIT V:
[8Hrs]
Basic Traversal and Search Techniques, breadth first search, connected components, Backtracking basic
strategy, 8 Queens problem, graph colouring, Hamiltonian cycles etc.
UNIT VI:
[7Hrs]
NP-hard and NP-complete problems, basic concepts, non deterministic algorithms, NP-hard and NPcomplete, Cooks Theorem, decision and optimization problems, polynomial reduction.
TEXT BOOKS:
1. Computer Algorithms, Horowitz, Sahani, Rajsekharan, Galgotia Publications Pvt. Ltd.
nd
2. Introduction to Algorithms, Thomas H. Cormen , 3 Edition, Prentice Hall of India.
3. Fundamentals of Algorithms, Brassard and Bratley, Prentice Hall.
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT316/CT701
Evaluation
Scheme
Data Base Management System
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3 Hrs
Objectives
Outcomes
To understand fundamental database concepts and Students should be able to design relational
the different database systems, methodologies to database for given situation, write appropriate
conceptualize
systems,
advanced
database queries for accessing database.
concepts, Identify the key issues in developing
database systems and applications, develop
applications involving advanced database systems
using commercial RDBMS such as Oracle.
Mapped Program Outcomes: b,c,d,e,h,j,k,l,m
COURSE OBJECTIVES
UNIT I:
[7 Hrs]
Introduction to Database Management System: General File System and Database system concepts and
Architecture, Relational Model, Abstraction & Different Levels of Data Abstraction, Data Independence:
Logical & Physical Independence.
Entity-Relationship Model: Entities and Entity Sets, Relationships and Relationship Sets, Attributes,
Mapping Constraints, Keys, Entity Relationship Diagram, Reducing E-R Diagrams to Tables, Generalization,
Aggregation, Design of an E-R Database Scheme.
UNIT II:
[8 Hrs]
Relational Data Model: Structure of Relational Databases, the Relational Algebra, SQL.
Relational Constraints: Domain Constraints, Referential Integrity, Assertions and Triggers, View.
Programmatic ways for implementing constraints and triggers.
UNIT III:
[8 Hrs]
Relational Database Design: Pitfalls in Relational Database Design, Functional Dependencies,
Normalization using Functional Dependencies, Alternative Approaches to Database design.
Storage structures: cluster, index organized table, partitions, various table storage parameters and block
storage parameters, concept of index, B-trees, hash index, function index, bitmap index.
UNIT IV:
[7 Hrs]
Transaction Management: ACID Properties, Implementation of ACID Properties, Database processes to
support ACID Properties, Schedules, and Testing of Serializability.
Concurrency Control: Lock-based Protocols, Timestamp Based Protocols, Validation Techniques, Multiple
Granularity, Multiversion Timestamp Protocol, Transaction isolation levels, Read consistency.
UNIT V:
[8 Hrs]
Crash Recovery: Failure Classification, Log Based Recovery, Buffer Management, Checkpoints, Shadow
Paging, and Failure with Loss of non-volatile Storage, Stable Storage Implementation.
Query optimization: Query optimization and performance tuning Various techniques for query optimization,
strong and weak equivalence, cost based optimization.
UNIT VI:
[7 Hrs]
Introduction to Object oriented database: The evolution of object oriented concepts. Object-oriented
concepts, characteristics of an object-oriented data model, object schemas, Advantages and disadvantages,
Applications.
TEXT BOOKS:
1. Fundamentals of Database Systems , Elmasri, Navathe & Gupta, Pearson Education.
2. Database System Concepts Korth, Silberschatz: McGraw-Hill publication.
REFERENCE BOOKS
1. Database System Concepts by Henry Korth and Others
2. Database Systems by Connolly, 3rd edition, Pearson Education.
3. Database Systems by S. K. Singh, Pearson Education.
4. Principles of Database Systems Ullman, Golgotia Publications 1998.
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT317/CT702
Evaluation
Scheme
Data Base Management System

Laboratory
L=0
T=0
P=4
Credits=2
ESE
Duration
ESE
Total
40
60
100
Objectives
To understand and implement the fundamental
database
concepts,
methodologies
and
conceptualize and design database system.
Outcomes
Students should be able to implement database
concepts. Methodologies and design database
system.
Mapped Program Outcomes: b,c,d,e,h,j,k,l,m

PRACTICAL LIST:
1. To perform and analyze DDL and DML commands.
2. To implement constraints on data base tables in Oracle.
3. To execute queries based on Group By, Having, Order By clause.
4. To execute queries using Aggregate functions and Built in functions.
5. To implement various joins in Oracle.
6. To write and execute the Sub queries.
7. To study and create Views.
8. To create and implement Triggers.
9. To create basic programs in PL/SQL.
10. To create and modify Users and Privileges/ To execute TCL commands.
BEYOND SYLLABUS:
1. Practical based on Stored Procedures
2. To implement ACID properties
Locking
Isolation Level
How to recover a deleted file (Backup & Recovery)
Instance feature and media feature
Multiplexing of Files
Flash back database
Recovery in archive log mode
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT318/CT703
Evaluation
Scheme
Language Processors
L=3
T=1
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3 Hrs
Objectives
Outcomes
This course emphasizes on the implementation of a

compiler through the development of its various
phases such as the scanner, parser, and code
generator. This course covers the various aspects
of designing a language translator in depth.
Students should be able to design compiler and

design language translator.
Mapped Program Outcomes: b,c,e,I,k,l,m

UNIT I
[7Hrs.]
Introduction to Compilation Process, Compilers & Translators, Phase structure of Compiler, Design of Lexical
Analysis.
UNIT II
[8Hrs.]
Specifying Syntactic Structure of Programming Language using Context Free Grammars, The role of Parser,
Top-down Parsing, Bottom Up Parsing, Predictive Parsers, Recursive Decent Parser.
UNIT III
[9Hrs.]
Construction of efficient LR Parsers (SLR, CLR & LALR), Canonical Collection of set of items and construction
of Parsing table, Implementation of LR Parsing table.
UNIT IV
[9Hrs.]
Syntax Directed Translation: Intermediate Code, Postfix notation, Parse tree and Syntax Trees, Three
address codes, quadruples, triples, Translation of Arithmetic Expression, Boolean expressions, Control
Statements. Array references, Procedure Calls, Declarations, Case Statements, Use of Compiler writing tools
(Lex/ Flex, Yacc / Biason).
UNIT V
[5Hrs]
Symbol Tables: Contents, Representing scope information. Error detection and Recovery: Error handling,
Lexical-phase, Syntactic phase and semantic phase.
UNIT VI
[9Hrs.]
Introduction to Code Optimization, The principle sources of optimization, Loop optimization, The DAG
representation, Introductory Data Flow analysis, Introduction to Code Generation: Object programs, Problems
in Code Generation, Register allocation and assignment, Code generation from DAG, Peephole optimization.
TEXT BOOKS:
nd
1. Compilers Principles, Techniques & Tools by Alfred V. Aho, Jeffrey D. Ullman & Ravi Sethi, 2 Edition
,Pearson Education
2. Principles of Compiler Design by Alfred V. Aho, Jeffrey D. Ullman, Addison Wesley Publication
REFERENCE BOOKS:
1. Compiler Design, Dr. O.G. Kakde, Laxmi Publication.
2. Introduction to Compiling Techniques : First Course Using ANSI C, Lex and
McGraw-Hill Publication
3. Building Your Own Compiler with C++ , Jim Holmes, Prentice Hall
Chairperson
Date of Release
Version
May 2012
1.01
Yacc,
J.P. Bennett,
Applicable for AY
2012-13 Onwards
CT319/CT704
Language Processor Laboratory
Evaluation
Scheme
L=0
T=0
P=2
ESE
Total
40
60
100
Credits=1
ESE
Duration
Objectives
Outcomes
Implementation of following practical will lead student

to understand compilation phases of compiler,
element of each phase, compiler, Construct the
language by using notation/rules, Know the practical
implementation of tools like FLEX &YACC.
Students should be able to implement phases of

compiler and use practical implementation tools.
Mapped Program Outcomes: b,c,e,I,k,l,m

.
PRACTICAL LIST:
1. Study of FLEX.
2. Write a Flex program to recognize
- Word
- Digit
- Identifier
- Constant
3. Write a Flex program to check whether the entered sentence is simple sentence or a compound sentence.
4. Write a Flex program to count the number of
a. characters, words , spaces and lines in a given input text file.
b. Printf and scanf keywords present in a given input program fragment.
5. Write a Flex program to check whether the entered string of parenthisis is balanced or not in a given input
text file.
6. Write a Fex program to recognize a valid arithmetic expression and to recognize the identifier and operators
present and print them seperately.
7. Write a Fex program to Count the number of IF conditions in a program using the Lexical Analyzer.
8. Study of YACC and Write a YACC Program to disply message Have a good Day.
9. Write a YACC Program to recognize strings aaab, abbb, ab and a using the grammar
n n
(a b , n>= 0).
10. Write a YACC program to recognize a valid arithmetic expression that uses operators +,-,*, /
11. Write a YACC program to evaluate an arithmetic expression involving operators + ,-,*,/.
BEYOND SYLLABUS PRACTICAL:
1. Study of Bison.
2. Study of all current compilers.
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT320/CT 717
Computer Graphics
Evaluation Scheme
MSE-I
15
MSE-II
15
L=4
TA
10
ESE
60
T=0
Total
100
P=0
Credits =4
ESE Duration
3 Hrs
Objectives
Outcomes
To provide an introduction to the theory and practice

of computer graphics, understanding 3D graphics,
visual communication, and presentation, Interactive
handling of Images and Text, Understand computer
animation and design animation program.
Students should be able to use 3D graphics, should

handle interactive images & text. Develop animated
programs for various applications.
Mapped Program Outcomes: a,b,c,d,e,g,i,j,k,l,m

UNIT 1:
[8Hrs]
Basic Concept Introduction, Point Pixel Plotting. Line Generation Algorithms, polygon filling algorithms, 2D
Transformations, Clipping, Window, View Port Mapping, Graphical User Interfaces and Interactive input
methods, picture construction techniques
UNIT 2:
[6Hrs]
3D Graphics 3D Transformation, 3D Viewing, Visible Surface Detection, Back Face Detection, Depth Buffer
Method, Scan Line Method, Virtual Reality Environment.
UNIT 3:
[7Hrs]
Visual Communication Creative Process, Digital Imaging Technology, Still Image, Digital Imaging, Using
Images in Multimedia, Images on Web, Color Models.
UNIT 4:
[8Hrs]
Presentation General Design Issues, Architectural Issues, Information Characteristics for Presentation,
Presentation function, Presentation Design Knowledge, Effective Human Computer Interaction.
UNIT 5:
[8Hrs]
Interactive Illustrated 3D with Images and Text: Generating Illustrated Documents, Consistency of
Rendered Images and their Textual Labels, Architecture, Zoom Techniques for Illustration Purpose,
Interactive handling of Images and Text, Figure Captions for Anatomical Illustrations.
UNIT 6:
[8Hrs]
Computer animation Design of animation sequence, general computer animation functions, raster
animation, computer animation languages, key frame systems, motion specifications.
TEXT BOOKS:
1. Donald Hearn and M. Pauline Baker, Computer Graphics in C Version, Second Edition, Pearson
Education.
REFERENCES BOOKS:
1. Multimedia: Computing, Communication and applications, Raf Steinmetz and Klara Nahrstedt, 2nd
Edition, Pearson Education.
2. Multimedia Graphics, John Villamil Casanova and Leony Fernandez-Elias, Prentice Hall India.
3. Computer Visualization-Graphics Abstraction and Interactivity, Thomas Strothotte, Springer Verlag, Berlin
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT321/CT718
Computer Graphics Laboratory
Evaluation
Scheme
L=0
T=0
P=2
ESE
Total
40
60
100
Credits=1
ESE
Duration
Objectives
Outcomes
To design and implement low level object-oriented

code to encapsulate event-driven graphical objects,
to perform homogeneous transformations,
Parameterize curves for controlling object trajectories
and improving rendering, design new viewing
models, Perform clipping of polygons, shading,
Texture map and. Animate scenes with multiple
interacting objects.
Students should be able to design and implement

low level object oriented code, design models,
create animated scenes.
Mapped Program Outcomes: b,c,d,e,g,i,j,k,l,m
LIST OF PRACTICAL
1. Creation of polygon and filling it using any polygon filling algorithm.
2. Creation of two dimensional objects and applying simple transformations like Translation, Scaling, Rotation
and applying Composite transformations.
3. Creation of simple three dimensional objects like cube, cone and cylinder and applying simple
transformations like Translation, Scaling, Rotation and applying Composite transformations.
4. Finding out visible surfaces and removal of hidden surfaces in simple objects using object space.
5. Remove hidden surfaces in simple objects using image space algorithms.
6. Image enhancement, Image transformation from color to gray scale and vice versa
7. Image enhancement, Image transformation from gray scale to color.
8. Image manipulation and Image optimization for web - Usage of editing tools, layers, filters, special effects
and color modes.
9. Creation of simple Gif animated images with textual illustrations.
10. Creation of moving ball or any object.
BEYOND SYLLABUS:
1. Study practical on motion sensing.
2. Clipping a line using any line clipping algorithm.
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT322/CT 719
Real Time Systems
Evaluation Scheme
MSE-I
15
MSE-II
15
L=4
TA
10
ESE
60
T=0
P=0
Total
100
Credits =4
ESE Duration
3 Hrs
Objectives
Outcomes
To learn the concepts of Real Time Systems, to study

the different design issues of Real Time Systems, to
study the techniques for scheduling, resource access
control and validation, to provide experience in the
implementation of typical algorithms used in real time
systems.
Students should be able to apply techniques for

scheduling, implement algo. In real time
environment.
Mapped Program Outcomes: d,c,d,e,k,l,m

UNIT I
[6 Hrs.]
Introduction to real time systems: Digital control, high-level controls, signals processing, real time
applications. Hard and soft real time system : Jobs & processors, release times, deadlines, timing,
constraint, Hard & Soft timing constraint, Hard real time systems , soft real time systems. Modeling of real time
systems.
UNIT II
[10 Hrs.]
Approach to real time scheduling : Clock-driven approach, weighted round-robin approach, priority-driven
approach, dynamic versus static systems, effective release times and deadlines, optimality of EDF & LST
algorithms, non optimality of the EDF & LST, challenges in validating timing constraints in priority-driven
systems, off line versus on-line scheduling. Clock driven scheduling : notation & assumptions, static timerdriven scheduler, general structure of cyclic schedules, cyclic executives, improving the average response
time of a periodic jobs, scheduling sporadic jobs, practical consideration and generalizations, algorithms for
constructing static schedules, pros-cons of clock-driven scheduling.
UNIT III
[08 Hrs.]
Priority-driven scheduling: Static assumptions, fixed-priority versus dynamics priority algorithms, maximum
schedulable utilization, optimality of the RM & DM algorithms, a schedulability test for fixed priority tasks with
short response times & with arbitrary response times, sufficient schedulability conditions for the RM & DM
algorithms.
UNIT IV
[08 Hrs.]
Scheduling aperiodic & sporadic jobs in priority-driven systems: assumptions & approaches, deferrable
servers, sporadic servers, constant utilization, total bandwidth and weighted fair-queuing servers, slack
stealing in dead-line driven systems, slack stealing in fixed-priority systems, scheduling of sporadic jobs.
UNIT V
[06 Hrs.]
Resources and resource access control : assumption on resources and their usage, effects of resource
contention & resource access control, non preemptive critical sections, basic priority-inheritance protocol,
basic priority-ceiling protocol, stack-based priority ceiling protocol, use of priority-ceiling protocol in dynamicpriority systems, preemption-ceiling protocol, controlling accesses to multiple-UNIT resources, controlling
concurrent accesses to data object.
UNIT VI
[06 Hrs.]
Real-time Communication: model of real time communication, priority-based service discipline for switched
networks, weighted round-robin service discipline, medium-access control protocols of broadcast network and
resource reservation protocols, real-time protocol, and communication in multicomputer systems.
TEXT BOOKS:
1. Real-Time Systems Jane W. S. Liu, 2000, Pearson Education
2. Real Time Systems, C.M.Krishna & Kang G. Shin, McGraw Hill Publication.
3. Real-Time Systems: Theory and Practice, Rajib Mall, 2007, Pearson Education.
REFERENCE BOOK:
1. Real-Time Computer Control An Introduction, Stuart Bennett, 2nd edition, Pearson Education
2. Real time systems, Albert M.K.Cheng , J. Willey and sons, vol 8, Editors Dan Ionescu, Aurel Cornell,
world scientific
3. Real time systems , Kopetz,Hermann, 2nd edition.
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT323/CT720
Real Time Systems Laboratory
Evaluation
Scheme
L=0
T=0
P=2
ESE
Total
40
60
100
Objectives
To learn the concepts of RTS, to study the different
design issues of Real Time Systems, to study the
techniques for scheduling, resource access control
and validation, to implement typical algorithms used
in real time systems.
Credits=1
ESE
Duration
Outcomes
Students should be able to implement typical
algorithms used in real time systems.
Mapped Program Outcomes: d,c,d,e,k,l,m
LIST OF PRACTICAL
1. To study different types of Real Time Operating System
2. To study Commands of LINUX Operating System for real time application.
3. Write a program to create processes in LINUX environment.
4. Write a program to implement round robin scheduling in LINUX environment.
5. Write a program to implement Priority-driven scheduling.
6. Write a program to create massages Queue for Inter Process communication.
7. Write a program to implement multithreading in LINUX environment.
8. To Study basic priority-inheritance protocol, basic priority-ceiling protocol.
9. To Study System calls for process creation, suspension and Termination.
10. To study shared memory in Inter-process Communications.
11. Write a program to design a cube using open GL.
12. Write a program to design a sphere using open GL.
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT324/CT721
Evaluation
Scheme
Mobile Communication
MSE-I
15
MSE-II
15
L=4
TA
10
ESE
60
T=0
Total
100
P=0
Credits=4
ESE Duration
3 Hrs
Objectives
Outcomes
To provide an in depth understanding of wireless

access, mobility in cellular, to study wireless
networks using standards like GSM, CDMA, GPRS
and IEEE 802.11 etc., to understand the quantitative
techniques to evaluate the different, protocols,
network architecture.
Students should be able to select appropriate

standards for the given situation. evaluate different
protocols using quantitative techniques.
Mapped Program Outcomes: b,c,d,e,g,h,i,k,l,m
UNIT I:
[7Hrs]
Introduction to wireless communication, introduction to cellular system, wireless transmission: frequencies for
radio transmission, signal prorogation. Introduction to medium access control: TDMA, CDMA GSM: System
architecture protocols, localization and calling, handover, Modulation Techniques.
UNIT II:
[8Hrs]
Wireless LAN: IEEE 802.11, Bluetooth, Zigbee etc. Satellite Systems: GEO, LEO, MEO<routing, localization
and handover Mobile network Layer: Mobile IP, dynamic host, configuration protocol, adhoc networks, IPv6.
Mobile transport layer: traditional TCP, indirect TCP & mobile TCP,
UNIT III:
[7Hrs]
2G-Global System for mobile communication (GSM) Introduction, GSM Architecture, Database and Data
Elements, GSM Interfaces, GSM Protocol Architecture, GSM Versions.
UNIT IV:
[7Hrs]
2G: IS95 cellular system (CDMA):
Introduction, Motivation for CDMA to use in Mobile Communication ,IS95 cellular System(CDMA),forward
Channel, Reverse Channel Parameters of CDMA, Wireless Local Loop Radio System.
UNIT V:
[8Hrs]
2.5 G: General Packet Radio service (GPRS) Introduction, Advantages of GPRS, GPRS Application, GPRS
Architecture, GPRS Interfaces Logical Channels in GPRS, Protocol Architecture, Internetworking with IP
Networks, GPRS terminals
UNIT VI:
[8Hrs]
3G: Universal Mobile Telecommunication System (UMTS) Introduction, UMTS Services, UMTS Architecture,
UMTS Core Network, 4G introduction, Architecture of wireless Application protocol (WAP), Issues of Mobile
Application.
TEXT BOOKS:
1. Mobile communication, Jochen Schiller(Addison Wesley pub)
2. Mobile Communication Systems , Krzysztof Wesolowski(Wiley Publication)
3. Wireless Communication principles & Practice , T.S.Rappaport(PHI pub)
REFERENCE BOOKS:
1. Mobile communications Design Fundamentals , William C.Y.Lee (john
2. Wireless Sensor Network, Zhoo & Guibas
Chairperson
Date of Release
Version
Wiley & Sons pub)
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT325/CT722
Mobile Communication
Evaluation
Scheme
40
Objectives
To develop the WML application, to install Java
development toolkit, to develop the Android
application.
L=0
T=0
P=2
Credits=1
ESE
Total
ESE
Duration
60
100
Outcomes
Students should be able to do the installation of tool
kits and develop Anroid based applications.
Mapped Program Outcomes: b,c,d,e,g,h,i,k,l,m
LIST OF PRACTICAL
1. Installation of JDK1.6 and SDK1.3.
2. Study of JDK (Eclipse) Tool kit and software development kit.
3. Study of WML: Wireless Markup Language and its examples.
4. Develop an application in Android to store contacts in mobile handheld device.
5. Develop an application in Android to read an user input text.
6. Develop a Standup Timer in an Android that acts as a simple, stand-up meeting stop watch.
7. Study of Wireless Application protocol (WAP)
8. To study Pervasive Computing.
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT326/CT711
Evaluation
Scheme
SQL / PLSQL
MSE-I
15
MSE-II
15
L=4
TA
10
Objectives
To understand and execute different SQL queries
and PL / SQL programs, to make use of procedural
language constructs of PL/SQL, write better
performance queries and implement error handling.
ESE
60
T=0
Total
100
P=0
Credits=3
ESE Duration
3 Hrs
Outcomes
Students should be able to execute PL/SQL
programs and implement error handling.
Mapped Program Outcomes: b,c,d,e,,i,k,

UNIT I: Working with Data Model
Database Design
Database Models
The Entity Relationship Model
Entity Relationship Diagrams
The Sample Database
ER Diagram for Sample Database
Creating the Sample Data
Viewing Sample Data
Data Types of the Sample Data.
Introduction to The Object Navigator The Data Model.
The Layout Model. The Parameter Form Saving the report Execution & Runtime Output.
Defining the Data Model Queries Groups, Columns & Parameters
The Layout Model Default Layouts Tabular, Master/Detail, Form Letter, Form, Mailing Label
Layout Model Objects: Frames, Fields, Repeating Frames
Specifying a Runtime Parameter Form Formulas & Summaries Changing Fonts & Modifying Field
Properties
Format Masks Fonts & Colours Changing Column Labels
Page Layout Adjusting Page size Page Headers & Footers. Adding Report Titles. Adding Report
Dates & Page Numbering
Report Headers & Footers
UNIT II: Oracle9i SQL: SQL*Plus Basics Simple Queries Sub queries and Groups.
Data Definition Language
Categories of SQL Statements
Oracle Data types
The CREATE Statement
The DROP Command
The ALTER Command
Integrity Constraints
UNIT III:
Data Manipulation Language
DML Statements
The SELECT Statement
The INSERT Statement
The DELETE Statement
The UPDATE Statement
More SQL*Plus Commands
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT326/CT711
SQL / PLSQL
MSE-I
MSE-II
TA
Evaluation
Scheme
15
15
10
Unit IV
SQL vs. PL/SQL
A Few Simple Examples
Saving Procedures
A More Complete Picture
Comments
Variable Substitution
Simple Exception Handling
Advantages of PL/SQL
Assignments
Declarations and Data Types
Declarations
Standard Data Types
Initialization
Variable Names
Specialized Data Types - %TYPE
Specialized Data Types - %ROWTYPE
Building Your Own Data Types - Records
L=4
ESE
60
T=0
Total
100
P=0
Credits=3
ESE Duration
3 Hrs
Unit V
A Quick look at Loops
Language Components
Introduction
Assignments
Decision Making Statements
Simple Loops
Loops - for
Loops - indefinite
Loops - while
Simple Loops
Nested Loops
Boolean Variables
PL/SQL Relational Operators
PL/SQL Logical Operators
The CASE Construct
ORACLE Forms: Introduction to Forms
What is Report and what is it used for? Invoking the Forms Designer. Creating a basic form.
The Object Navigator Creating a Base Table Block. Adding a Detail Block. Saving and Generating
the Form
The Runtime Interface Querying the Database Normal & Enter Query Mode Manipulating the
Database
Inserting, Updating, Deleting. Transaction Control
Unit VI
Cursors
Introduction
Cursor Manipulation
Using the Cursor
For Loops Cursors
Cursor Attributes
Cursor Parameters
Nested Cursors
Cursor Exceptions
ORACLE Reports: Introduction to Reports
What is Reports and what is it used for? Invoking the Reports Designer.
Overview of the Designer interface. Using the Report Design Wizards Creating a Basic Report.
Text Books:
Oracle 10g By P.S. Deshpande
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT327/CT712
SQL/PLSQL Laboratory
Evaluation
Scheme
40
Objectives
To understand and execute different SQL queries and
PL / SQL programs, to make use of procedural
language constructs of PL/SQL, write better
L=0
T=0
P=2
Credits=1
ESE
Total
ESE
Duration
60
100
Outcomes
Students should be able to execute PL/SQL
programs and implement error handling.
Mapped Program Outcomes: b,c,d,e,,i,k,

COURSE OBJECTIVES
1. The students will be able to understand and execute different SQL queries and PL / SQL programs.
2. This would enable them to make use of procedural language constructs of PL/SQL, write better
LIST OF PRACTICAL
1. Design conceptual model of the database

2. Design physical model of database
3. Extracting data from the database
4. Perform complex queries on the database using Joins
5. Introduction to the PL / SQL programming.
6. Write a program to implement control structures.
7. Write a program to implement loop structures.
8. Write a program to interact with the database using Select Into clause
9. Write a program to interact with the database using Cursors.
10. Write a program to implement cursor attributes.
11. Write a program to implement cursors variables.
Beyond Syllabus
1. Write a stored procedure.
2. Write a program to implement Varry and nested table structure
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT350/CT725
Evaluation
Scheme
LINUX OPERATING SYSTEM

MSE-I
15
MSE-II
15
TA
10
Objectives
To understand the concepts of Linux and its
potential. The students will also get hand on
experience of Linux after undergoing this course.
L=3
ESE
60
T=1
Total
100
P=0
Credits=4
ESE Duration
3 Hrs
Outcomes
Students should be able to use LINUX environment
to implement some concepts.
Mapped Program Outcomes: b,c,e,,k,
UNIT I:
Introduction: History of Linux and Unix, Linux Overview, Linux releases, open linux
UNIT II:
Linux Commands and Filters : Mkdir, CD, rmdir, pwd, ls, who, whoami, cat, more, fail, head, concept of, mv,
chmod, grep,wc, comm., split, sort, diff, kill, write, wall, merge, mail, news
UNIT III:
Shell: The command line special characters and file arguments, standard input/output and redirection, pipes,
redirecting and piping with standard errors, shell scripts, jobs.
UNIT IV:
Linux file Structure: Linux files, file structure, listing displaying and printing files, managing directories, file and
directory operations.
UNIT V:
Vi Editor: Vi editing commands advanced Vi editing commands, line editing commands, options in Vi.
UNIT VI:
System Administration: System management, managing users, installing and managing devices, floppy disk
management, file system administration, backups.
Text Books
1. Linux The Complete Reference by Richard Peterson, Tata McGraw Hill, New Delhi
2. Linux Install and Configuration Black Book by Die Annleblanc and Issac Yates, IDG
Books India Private Ltd., Delhi
3. Unleashed Linux by Tech Media Publishers.
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT351/CT726
Evaluation
Scheme
LINUX OPERATING SYSTEM Laboratory

MSE-I
MSE-II
COURSE OBJECTIVE
Objectives
To get hand on experience of Linux.
TA
40
ESE
60
L=0
T=0
Total
100
P=2
Credits=1
ESE Duration
Outcomes
Students should be able to use LINUX environment
to implement some concepts.
Mapped Program Outcomes: b,c,e,,k,
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
SEMESTERVII
CT401
SOFTWARE ENGINEERING
Evaluation
Scheme
L=4
T=0
P=0
Credits = 4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3 Hrs
OBJECTIVES
1. To introduce basic software engineering
methods /models/ practices and their
appropriate application.
2. To understand concepts , principles , and
strategies applicable to the analysis of
software requirements and design activity.
3. To understand various testing strategies and
types of testing.
4. To understand configuration management ,
version control and change control process.
5. To understand project management ,
planning, scheduling , risk management ,
project and process metrics.
6. To get an overview of open source Software
Engineering tool viz. Subversion and
understand some concepts such as Reengineering.
OUTCOMES
1. Choose appropriate Software Process Model for
given Project depending on requirements and
resources at hand.
2. Perform requirements analysis and create
design for a given case study.
3. Choose appropriate testing strategy and apply
testing principles for testing a given application.
4. To understand basics of software configuration
management , version control and change
control.
5. To calculate effort and cost estimate for given
requirements and assess risks.
6. To perform basic operations on Sub-version.
PO, PSO MAPPING:a,b,c,d,e,f,g,h,I,j,k,l,m

SYLLABUS
UNIT I
Introduction to Software Engineering. A Generic View of process, Process models: Water fall
Mode l, RAD Model, Prototyping Model, Component Development Model, Requirement Engineering:
Requirement Engineering Task Initialization Eliciting Requirement, Developing Use Case,
Analysis Model, Negotiation, Validation
UNIT II
Building the Analysis mode: Requirement Analysis, Analysis Modeling Approaches, Data
Modeling Concept, Object Oriented Analysis, Types of Modeling, Design Engineering: Design
Concept, Design Model.
UNIT III
Testing Strategies : Strategic Approach, Strategic issues, Strategies for conventional

Software, Strategies for Object Oriented Software, Validation Testing, Testing Tactics: WhiteBox Testing, Basis Path testing: Flow Graph Notation, Independent Program Paths, Control
Structure Testing, Black Box Testing, Introduction to object oriented testing.
UNIT IV
Configuration Management: Base lines, Software Configuration items, The SCM Process,
Identification of Objects in the Software Configuration ,Version Control, Change Control,
Configuration Audit, Status Reporting, SCM Standards.
UNIT V
Project Management, Metrics for Process and Projects, Project Estimation , Risk
Management: Reactive vs. Proactive Risk Strategies , Software Risks, Risk Identification,
Risk Projection.
UNIT VI
Advanced Topic sin Software Engineering : Reengineering Computer Aide software

engineering, Open source SE tools introduction, Example-Subversion : Overview, Typical
subversion usage and workflow.
TEXT BOOKS:
1. Software Engineering A Practitioners Approach (Sixth Edition) by Roger S. Pressman Mc Graw
Hill.
2. Object Oriented Software Engineering by Leth bridge , Pearson Edu.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
CT402
Evaluation Scheme
SOFTWARE ENGINEERING
LABORATORY
40
L=0
T=0
P=2
Credits=1
ESE
Total
ESE Duration
60
100
Practical List:
Sr.No.
PracticalName
Introduction to Software Engineering fundamentals.
Introduction to RATIONAL ROSE Interface.
Overview and Case study of UML.
To study and draw Use Case diagram for the given case study.
To create use case documents for the given case study.
To study and create Software Requirement Specification document.
To study and draw UML Class diagram.
To study and draw UML Activity diagram.
To create SRS for Mini Project including appropriate UML diagrams.
10
To study basic operations on a Subversion Repository under Windows.
Beyond Syllabus Practical List:

1.
To study Manual /Automated testing.
2.
To study Microsoft Project Plan.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VII
CT403
OBJECT ORIENTED MODELING
Evaluation
Scheme
L=4
T=0
P=0
Credits = 4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3Hrs
OBJECTIVES
OUTCOMES
1. To distinguish between procedure oriented and

Object Oriented Methodology.
2. To understand the features of Object Oriented
Programming.
3. To Understand the basic building blocks of
C++ language.
4. To Understand the Utility and difference of
various Data Structure.
5. To Understand the need of Exception.
6. Exception Handling Mechanisms of OOP
Methodology using C++.
7. To study the concept of Templates .
8. To Understand the OOP methodology and
relate to it day to day applications.
9. To relate various practical examples with the
OOP Methodology.
1. Compare different types of Programming

Languages
2. Describe Real World object, Structure and
Class.
3. Implement the Programming Examples.
4. Implement the Concept of abstract class,
Concept of Interface.
5. Define and classify Data Structure.
6. Implement the Mechanisms and Concept of
Exception , Types of Exception
7. Define stream, the Concept of File, Opening and
Closing of File
PO, PSO MAPPING:a,c,e,g,i,j,k,l,m

SYLLABUS
UNIT I
UNIT II
Introduction : object orientation, Object Oriented development, modeling as a design

technique, Class modeling:- the three models, object, classes, links and associations,
navigation of class models, aggregation, abstract classes, metadata, packages.
State Modeling: events & states, transitions and conditions, state diagrams behavior,
concurrency advanced state modeling concepts, nested state diagrams, concurrency,
relation of class & state models. Interaction modeling : Use case. Sequence and activity
models, relationships among the models.
UNIT III
System Analysis :
Development life cycle and development style, system conception, domain analys is
application analysis
UNIT IV
System Design : Overview, estimating performance, making are use plan, breaking into sub
systems, identifying concurrency, allocation of sub systems, management of data storage,
handling global resources, choosing software control strategy, handling boundary
conditions, setting trade off priorities, common architectur all styles.
UNIT V
Class Design, implementation modeling, object oriented languages.
UNIT VI
Databases : implementing structures basic and advanced, implementing functionality,

object oriented databases. Object oriented programming style, reusability, extensibility,
robustness.
TEXT BOOKS:
1. Object oriented modeling and design with UML by James Rumbaugh, Michal Blaha , Pearson
Prentice Hall Second Edition.
REFERENCE BOOKS:
nd
Practical Object Oriented Design with UML by Mark Priestley TMH 2 Edition.
The Unified Modeling Language user guide by Booch , Rumbaugh, Jacobson Addison Wesley
nd
2 Edition.
1.
2.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
CT405
PE2: EMBEDDED SYSTEM
Evaluation
Scheme
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3Hrs
OBJECTIVES
OUTCOMES
1. To make the students aware of the Embedded

Systems surrounding them.
2. Students should know about the types of
processors & architectures used, design &
codesign concepts usedin ES.
3. To learn the concept of Real Time Operating
System, Mobile Operating System. The working of
micro controller to be used in ES.
1. Using the Basics of ES, decide the components of

a particular ES.
2. Design & implement the hardware & software and
integrate them to develop the final device.
3. Choose appropriate processors and Real Time
operating system for ES design.
4. Use assembly or high level languages for S/W
development & decide which development &
debugging tool will be suitable for ES
development.
5. Choose proper microcontroller / microprocessor for
a particular ES design .
6. Develop the program for core functionality &
communication of ES with other devices.
PO, PSO MAPPING : - a,c,d,e,h,i,k,l,m

SYLLABUS
UNIT I
Embedded Systems concepts and definition , Embedded System design : Requirement

analysis, Hardware and Software Design, co-design, I/O interface co-design for
distributed embedded system, Applications of Embedded system.
UNIT II
Embedded Computing platform Software Development tools and debugging technologies

Host and Target machines, Cross Assemble
& Cross Compiler, Linker/Loader for
embedded software, study and use of simulator, EPROM emulator, In Circuit Emulator,
concept of tool chain.
UNIT III
Concept of Real Time Operating System, Real Time IO, R/T Multitasking &
multithreading processes, RTOS Task Scheduling models Inter-task Communication,
memory management.
UNIT IV
Overview of Embedded Operating Systems, Real Time operating System, Handheld

operating system, Some Representative Embedded Systems.
UNIT V
ARM Architecture Block Diagram, Pin

Description, I/O Ports, Interrupts.
UNIT VI
Thumb Instruction Set and Programming Timers, Serial communication, Interfacing with
analog and digital circuits.
Description
Memory Organization, Register
TEXT BOOKS:
1.An Embedded software primer by David E. Simon, Pearson Edu. Asia.
2.Embedded System by Raj Kamal.
3.ARM System on Chip Architecture by Steve Furber, Pearson Edu. Asia.
REFERENCE BOOKS:
1. Realtime system : design principles for distributed embedded application by H. Kopetz .
2. Embedded system design by Krishna & Shinn .
3. Embedded Real -Time Systems : Concepts , Design & Programming by Dr. K. V. K. K. Prasad.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VII
CT406
Evaluation
Scheme
PE2: NEURAL NETWORKS &

FUZZY LOGIC
MSE-I
MSE-II
TA
15
15
L=4
10
T=0
P=0
Credits=4
ESE
Total
ESE Duration
60
100
3Hrs
OBJECTIVES
OUTCOMES
1. This course provides introduction various

aspect so fneuralnet works, with
emphasison element of design no ftrainable
systems. The course introduces students to
the fundamental theory, mathematics and
modeling tools necessary to analyze and
simulate natural and engineered systems.
1. Apply training and classification using the discrete

perceptron and single layer continues perceptron
networks for linearly separable classification .
2. Summarize Operations on fuzzy sets by solving the
problem.
3. Compute fuzzy numbers.
4. Construct arithmetic operations on intervals and
arithmetic operations on fuzzy numbers.
5. Apply lattice fuzzy numbers and Fuzzy equations to
solve fuzzy controller problem.
PO, PSO MAPPING :- a,b,c,e,h,i,j,l

SYLLABUS
UNIT I
Fundamentals concepts and model so fartificial neural systems: Biological neurons and
their artificial models, models of artificial neural networks, learning and adaptation, neural
network learning rules, overview of neural networks, Simple Programming exercisein C.
UNIT II
Single-layer perceptron classifiers: Discriminant functions, linear machine and minimum

distance classification, training and classification sing the discrete perceptron : algorithm
and example, single layer continuous perceptron
networks forlinearly separable
classification.
UNIT III
Multi layer feedback networks: linearly non-separable pattern classification, delta learning
rule. Feed forward recall and error back-propagation training, learning factors, Hopfield
networks, Applications of Neural Networks.
UNIT IV
From classical (CRISP) sets to fuzzy sets: introduction crispsets: an overview, fuzzy sets:
basic types, fuzzy sets: basic concepts, characteristics and significant of the paradigms hift.
Fuzzy set sversuscrisp
sets, representation of fuzzy sets, alpha cuts,cardinality,
Operations on fuzzy sets : types of operations, fuzzy complements, fuzzy intersection : tnorms, fuzzy unions:
t-Conorms, Distinction between Probability, Fuzzy and Random
System.
UNIT V
Linguistics variables, linguistic edges, Fuzzy relations, Binary Operation on as ingle set,
projection and cylindrical extension, Extension principles for fuzzy sets, Fuzzy Arithmetic:
fuzzy numbers, arithmetic operations on fuzzy numbers, Fuzzy Equations.
UNIT VI
Defuzzification methods, design fuzzy rule base, Fuzzy Inference Systems: Mamdani Vs
Sugeno, Steps indesign of a fuzzy controller, applications of fuzzy logic, Use of MATLAB
for Design and Arguments
TEXT BOOKS:
1. Introduction to Artificial Neural System by J. M. Zurada, Jaico Publishing House, India.
2. Fuzzy logic & Neural Network b y T. J. Ross, TMH.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VII
CT407
PE2: ADHOC WIRELESS NETWORK
Evaluation
Scheme
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3Hrs
OBJECTIVES
OUTCOMES
1. Understand the design issues and application

areas of Ad hoc network.
2. Understand the
design goals of MAC
protocols, classification of MAC protocols.
3. Introduce design issues and various types of
routing protocols.
4. Understand design issues, operation and
classification of multicast routing protocol.
5. Understand issues and challenges in the
design of transport protocol and security
aspect of communication in ad hoc network.
6. Introduce Quality of Service and energy
management techniques in Ad-hoc network.
1. Identify the need of Ad hoc network. Compare

infrastructure base and infrastructure less wireless
network
2. Identify the design issues involved in the design of
MAC protocol and classify the different MAC protocols.
3. Compare proactive and reactive routing protocols,
Classify routing protocols.
4. Compare tree based and mesh based multicast routing
protocols, identify advantage and drawback involved in
each protocol.
5. Identify the various types of attack in ad hoc network
and classify various types of transport layer protocol.
6. Classify QoS approaches and Identify the need of
energy management in ad hoc network.
PO, PSO MAPPING :- a,c,d,f,h,k,l

SYLLABUS
UNIT I
Ad hoc Wireless Networks: Introduction, Issues in Ad hoc wireless Networks, Ad hoc Wireless
Internet.
UNIT II
MAC Protocols for Ad hoc Wireless Networks: Introduction, issues in designing MAC protocol,
Design goals of MAC protocols, classification, Contention based protocols: MACAW. Floor
acquisition multiple access Protocols. Contention based protocols with reservation mechanism:
Distributed Packet reservation multiple access protocol, Collision avoidance Time allocation
protocol. Contention based MAC protocols with scheduling mechanism: Distributed priority
scheduling and medium access in ad hoc networks.
UNIT III
Routing Protocols for Ad hoc Wireless Networks: Introduction, Issues in designing routing
protocol, classification, table driven routing protocols: DSDV, cluster head gateway switch
routing protocol. On demand routing protocols: DSR, AODV. Hybrid routing protocols: core
extraction distributed routing protocol, Zone routing protocol. Routing protocols with efficient
flooding mechanisms, hierarchical routing protocols, Power aware routing protocols.
UNITIV
Multicast routing in ad hoc wireless networks: Introduction, Issues in designing multicast

routing protocol, operation of multicast routing protocols, An architecture reference model,
classification, Tree based multicast routing protocol: Bandwidth efficient multicast routing
protocol, Multicast routing protocol based on zone routing, Multicast core extraction distributed
Ad hoc routing, MAODV. Mesh based multicast routing protocols: on demand multicast routing
protocol, Dynamic core based multicast routing protocol. Energy efficient Multicasting: Energy
efficient reliable broadcast and multicast protocols, A distributed power aware multicast routing
protocol. Multicasting with Quality of Service guarantees, Application dependent multicast
routing.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
CT407
PE2: ADHOC WIRELESS NETWORK
Evaluation
Scheme
UNIT V
UNIT VI
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3Hrs
Transport layer and security protocols: Introduction, Issues in designing transport layer
protocol, design goals of transport layer protocol, Classification of transport layer solutions,
TCP over ad hoc wireless networks, Other transport layer protocols for ad hoc wireless
network, security in ad hoc wireless network, network security requirements, Issues and
challenges in security provisioning, Network security attacks, Key management, Secure routing
in AD hoc Wireless networks: Requirements of secure routing protocol, security aware ad hoc
routing protocol.
Quality of service and energy management in Ad hoc Wireless networks: Introduction, Issues
and challenges in providing Quality of service, classification of Quality of service solutions.
Introduction to energy management, Need for energy management, classification, Battery
management schemes, transmission power management schemes, system power
management schemes.
TEXT BOOKS:
1. Ad Hoc Wireless Networks Architecture and protocols by C. Siva Ram Murthy, B. S. Manoj. Pearson
Publication.
REFERENCE BOOKS:
1. Ad hoc Networking by Charles E. Perkins Addison ,Wesley.
2. The hand book of ad hoc wireless networks by Mohammad Ilyas, CRC press.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VII
CT408
CLOUD COMPUTING
Evaluation
Scheme
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3Hrs
OBJECTIVES
OUTCOMES
1. Main objective is to create, promote and exploit

an open-source Cloud API and platform
targeted for designing and developing multiCloud-oriented applications.
1. Explain software and hardware support for

enterprise and cloud computing.
2. Perform data modeling for enterprise and cloud
knowledge bases.
3. Design enterprise and cloud software applications.
4. Implement and run distributed and cloud
applications.
5. Ensure security and privacy in enterprise and
cloud applications.
PO, PSO MAPPING :- a,b,c,d,e,f,g,h,i,k,l,m

SYLLABUS
UNIT I
Introduction to Cloud Computing: Defining Cloud Computing; Cloud Types and different
models-The NIST model, The Cloud Cube Model, Deployment models, Service models;
Examining the Characteristics of Cloud Computing; Benefits of cloud computing;
Disadvantages of cloud computing; Assessing the Role of Open Standards.
UNIT II
Cloud Architecture, Services and Applications: Exploring the Cloud Computing Stack,
Connecting to the Cloud, Infrastructure as a Service, Platform as a Service, Saas Vs. Paas,
Using PaaS Application Frame works, Software as a Service, Identity as a Service,
Compliance as a Service .
UNIT III
Abstraction and Virtualization: Introduction to Virtualization Technologies, Load Balancing

and Virtualization, Understanding Hyper visors, Understanding Machine Imaging, Porting
Applications, Virtual Machines Provisioning and Manageability Virtual Machine Migration
Services, Virtual Machine Provisioning and Migration in Action, Provisioning in the Cloud
Context.
UNIT IV
Exploring Cloud Infrastructures: Managing the Cloud-Administrating the Clouds,

Management responsibilities, Lifecycle management Cloud Management Products,
Emerging Cloud Management Standards, Understanding Service Oriented ArchitectureIntroducing Service Oriented Architecture.
UNIT V
Managing & Securing the Cloud: Administrating the Clouds, Cloud Management Products,
Emerging Cloud Management Standards, Securing the Cloud, Securing Data, The security
boundary, Security service boundary, Security mapping, Brokered cloud storage access,
Establishing Identity and Presence.
TEXT BOOKS:
1. Cloud Computing Bible, by Sosinsky B. Wiley India.
2. Cloud Computing: Web Based Applications that Change the Way You Work and Collaborate Online
by Miller Michael, Pearson Education India .
REFERENCE BOOKS:
1. Cloud Computing: Principles and Paradigm by Buyya R. Broberg, J. Goscinski, A. John Wiley &
Sons.
2. Cloud Computing A practical Approach by T. Velte , A. Elsenpeter, R. Tata McGraw Hill.
3. Cloud Computing and SOA Convergence in Enterprise by Linthicium D. Pearson Education India.
4. Enterprise Cloud Computing by Shroff G, Cambridge University Press
5. Private Cloud Computing by Smooth S. Tan, N. Morgan Kauffman.
6. Cloud Computing: Web Based Applications that Change the Way You Work and Collaborate Online
by Miller Michael, Pearson Education India .
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VII
CT409
PE3: OPERATIONSRESEARCH
Evaluation
Scheme
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3Hrs
OBJECTIVES
OUTCOMES
1. To provide knowledge about basic deterministic

methods of operations research (linear
programming,
network
flows,
integer
programming and nonlinear programming) and
their applications to resource allocation
problems
in
business
and
industrial
organizations.
2. To develop a n a b i l i t y to analyze any
engineering problem in a simple and logical
manner and to apply appropriate basic
principles to its solution.
1. Describe at an intuitive level the process of

operations research: a real-time cycle of problem
understanding,
formulation,
solution
and
implementation .
2. Identify and develop operational research models
from the description of the real system.
3. Formulate simple reasoning, learning and
optimization problems, in terms of the
representations and methods presented .
4. Manipulate the basic mathematical structures
underlying these methods, such as system state,
search trees, plan spaces, model theory,
constraint systems, linear programs and integer
programs.
5. Demonstrate the hand execution of basic
reasoning and optimization algorithms on simple
problems .
6. Use the mathematical tools that are needed to
solve optimization problems.
7. Use mathematical software to solve the proposed
models.
PO, PSO MAPPING :- a,b,c,d,e,h,i,k,l,m

SYLLABUS
UNIT I
Definitions, characteristics and limitations of O. R. phases of O. R. modelinging O. R.

tools and techniques of O.R. .
UNIT II
Linear programming , formulation, solution of L.P.P., graphical method, simplex method.
UNIT III
Duality in L.P.P. and Integer Programming.
UNIT IV
Allocation models Assignment models multiple optima, prohibited assignment,

transport model.
UNIT V
Prohibited and preferred routes, and degeneracy ,Sequencing & Scheduling.
UNIT VI
Karush-Kuhn-Tucker (KKT) Conditions for Constrained Optimization , exposure to tools

e.g. Mathematica.
TEXT BOOKS:
1. Optimization technique by Radrin pearson ,Ed. Publication.
2. Problems in Operation Research by P.K.Gupta & Man Mohan ,Khanna Pub.
3. Mathematical Model sin Operation Research by J. K. Sharma, Mac millan Pub.
REFERENCE BOOKS:
1. Introduction to Operation research by Hiller & Liberman (Holden Day Inc. San Francisco).
2. Operation Research by Kantiswaroop & Gupta, S.Chand Pub.
3. Principles of Operation Research by Wagner ,PHI Pub.
4. Operation Research by Dr. B. S. Goel & S. K. Mittal , Pragati Prakashan.
5. Optimization Technique by S. S. Rao.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VII
CT410
PE3: ARTIFICIAL INTELLIGENCE
Evaluation
Scheme
1.
2.
3.
4.
5.
6.
7.
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3Hrs
OBJECTIVES
The study of Artificial Intelligence course will
equip the students with the sound
understanding of AI concepts, perspectives to
apply the AI themes to the challenging
research are asrelated to AI.
To introduce the fundamental concepts in
Artificial Intelligence, applications of AI,
techniques in AI.
To concentrate on the basic algorithms for
searching the goal, concepts of representation
and control .
Provide the ability to assess the applicability,
strengths, and weaknesses of the basic
knowledge representation, various approaches.
To compare various Knowledge Representation
methods and to understand Prolog
fundamentals for Knowledge Representation.
To understand the reasoning process is carried
out in Machines.
To understand how human thinking be
emulated by a machine and Provide the ability
to assess the applicability, strengths, and
weaknesses of various learning methods.
OUTCOMES
1. Apply fundamentals of Artificial Intelligence for

given problem statements.
2. Use basic algorithms for searching the goal,
represent various knowledge structures in various
applications of AI and related fields.
3. Assess the applicability, strengths , and
weaknesses of the basic knowledge
representation, problem solving, and learning
methods in solving particular engineering
problems.
4. Compare various knowledge representation
approaches, solve problems based on knowledge
representation methods.
5. Assess Monotonic and Non-monotonic reasoning
methods.
6. Assess various learning methods, compare them.
PO, PSO MAPPING :- a,c,e,h,i,k,l

SYLLABUS
UNIT I
Introduction to AI : Definition of AI, early work in AI, the importance of AI,AI and related
fields, distributed AI, task domain of AI, Problems, problem spaces and searches: defining
the problem on a state space search, Introduction to intelligent agents, generic architecture
of intelligent agents.
UNIT II
Production systems and control strategies: depth first and breadth first search, back
tracking, problem characteristics , issues in the design of search programs.
Heuristic search techniques: generate and test, hill climbing, best-first s e arc h,
problem reduction, constraint satisfaction, means-ends analysis.
UNIT III
Knowledge representation: issues, representation and mapping approaches, procedural

Vsdeclarative knowledge, introduction to proposition logic, knowledge representation using
predicate logic, unification and resolution algorithms.
UNIT IV
Representation of knowledge using rules, logic programming, forward backward reasoning,

matching,
control knowledge. Knowledge representation using semanticnets, Prolog:
Representation of Predicates, rules, and facts, recursion unification.
UNIT V
Introduction to non-monotonic reasoning, logics for non-montonic reasoning Statistical

reasoning: probability and Bays theorem, certainty factors and rule based system.
UNIT VI
Learning: general learning model, overview of different forms of learning, learning decision
trees, Artificial Neural Networks (Introduction).
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
CT410
Evaluation
Scheme
PE3: ARTIFICIAL INTELLIGENCE
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3Hrs
TEXT BOOKS:
1. Artificial Intelligence by E. Richand K. Knight and Nair .
REFERENCE BOOKS:
1. Introduction to Artificial Intelligence and Expert System by D. W. Patterson , PHI.
2. Principles of Artificial Intelligence by N. J. Nilsson, Narosa.
th
3. Artificial Intelligence by George F. Lugar, 4 Edition , Pearson Education.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VII
CT411
Evaluation Scheme
FE 2: MULTIMEDIA AND ANIMATION
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3Hrs
OBJECTIVES
OUTCOMES
1. To learn basics of multimedia, applications of

multimedia, requirements to make good multimedia.
2. To study Multimedia hardware, Macintosh and
windows production platforms, multimedia authoring
tools.
3. Multimedia building blocks.
4. The basics of animation, techniques of animation.
5. Animation in Flash.
6. To study 3D Animation, Types of 3D Animation
Applications & Software of 3D Animation.
1. To understand the Basics of multimedia.

2. To understand multimedia hardware and multimedia
authoring tools.
3. To develop skills in design,
illustration,
image
manipulation, graphic designing, video editing, visual
effects and game designing.
4. To apply the fundamental broad-based skills in
traditional Animation techniques and emphasize to
apply in practice.
5. To develop the skills in Flash Animation and apply it on
some script.
6. To develop the 3D Animation skills.
PO, PSO MAPPING :- a,b,c,d,e,g,h,i,j,k,l

SYLLABUS
UNIT I
Multimedia definitions, CD-ROM and the multimedia highway. Applications of multimedia,

introduction to making multimedia, the stages of project, requirements to make good multimedia,
multimedia skills and training, the multimedia tech.
UNIT II
Multimedia hardware, Macintosh and windows production platforms, hardware peripherals,

connections, memory and storage devices, input devices output hardware, communication devices,
media software, basic tools, making instant multimedia authoring tools.
UNIT III
Multimedia building blocks text- using text in multimedia, computers and text, font editing and
design tools, Sound-the power of sound , multimedia system sound, Digital audio, preparing digital
audio files, Audio file format, images- Making still Images, Color, Image file format, video- Broadcast
video standard, Analog video, Digital video, optimizing video files for CDROM .
UNIT IV
What is meant by Animation, Why we need Animation, History of Animation, Uses of Animation.
Types of Animation, Principles of Animation, Some Techniques of Animation, and Animation on the
WEB, Special Effects, and Creating Animation.
UNIT V
Creating Animation in Flash: Introduction to Flash Animation Introduction to Flash Working with
the Timeline and Frame-based Animation - Working with the Timeline and Tween-based Animation
Understanding Layers Action script.
UNIT VI
3D Animation & its Concepts, Types of 3D Animation, Skeleton & Kinetic, 3D Animation
Texturing & Lighting of 3D Animation, 3D Camera Tracking, Applications & Software of 3D
Animation.
TEXT BOOKS:
rd
1. Multimedia Making Work by Tay Vaughan (TMH), 3 Ed.
2. Principles of Multimedia by Ranjan Parekh, 2007, TMH.
3. Multimedia Technologies by Ashok Banerji, Ananda Mohan Ghosh, McGraw Hill Publication.
REFERENCE BOOKS:
1. Multimedia systems design by K. Andleigh, K. Thakkrar, Phi Pub.
2. Multimedia: Computing, Communications & Applications by Raif Stein Metz and Kiara Nahrstedt.
3. Advanced Multimedia Programming by Steve Rimmer, McGraw Hill Pub.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VII
FE 2: CURRENT TRENDS AND
L=4
TECHNOLOGIES
CT412
Evaluation
Scheme
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3Hrs
OBJECTIVES
1. The objective of this course is to make the
students aware of the basic fundamentals of
communication.
2. Growth of technologies in Internet, ETechnologies & E-Learning.
3. Students should know about the Green
Computing and its implementation .
OUTCOMES
1. Using the Basics of Internet for deployment of
various servers and recourses.
2. Designing and implementation of E-technologies
3. Design E-Learning Resources.
4. Choose appropriate processors and Real Time
System for Green Computing.
5. Develop the Social Networking for next
generation.
PO,PSO MAPPING :- a,b,c,d,e,f,g,h,i,j,k,l,m

SYLLABUS
UNIT I
UNIT II
Fundamentals of Communications: Types of communication- Wired, wireless, mobile, Modes

of transmission: Simplex, Half Duplex, Full Duplex, Multiplexing techniques, History and
evolution of wireless and mobile systems, Transition and characteristics of 1G, 2G, 3G, 4G,
Spectrum, regulations, and frequency allocation.
Fundamental of INTERNET: History, Internet working, Connections, Internet services, The
World Wide Web, Tools for the WWW, Web servers, Web browsers, Web page makers and
editors, Plug-ins and delivery vehicles.
UNIT III
E-Technologies : Electronic Commerce: Framework, Media Convergence of Applications,

Consumer, Applications, Organization Applications, Electronic Payment Systems: Digital
Token, Smart Cards, Credit Cards, Risks in Electronic, Payment System, Designing
Electronic Payment Systems, Electronic Data Interchange (EDI): Concepts, Applications,
(Legal, Security and Privacy) issues, EDI and Electronic Commerce, Standardization and
EDI, EDI Software, Implementation, EDI Envelope for Message Transport, Internet-Based
EDI.
UNIT IV
E-Learning: Definition, Introduction, Types of e-Learning: Learner-led e-Learning , Facilitated

e-Learning , Instructor-led e-Learning , Embedded e-Learning, Tele monitoring And eCoaching E-Learning Models: WBT, CBT, LMS, LCMS , Virtual School Systems, E-Learning
Tools And Technologies: e-mail, Online Discussion, Chat and Instant Messaging, Voting,
Whiteboard, Application Sharing, Conferencing, Online Meeting Tools ,Case study.
UNIT V
Green Computing: Introduction, Why....Green Computing? Approaches to Green ComputingVirtualization, Power Management, Power supply, Storage, Video Card, Display, IT
Equipment, Recycling, Remote Conferencing & Telecommuting Strategies, Product longevity,
Resource allocation, Terminal servers, Operating system support, How to Implement?
Industrial implementations of Green Computing- Blackle, Fit-PC, Zonbu computer, Sunray
thin client.
UNIT VI
Social Networking: Definition, Overview of Social Networking Sites, Types of Social

Networking Sites: General purpose, Niche. Advantages of Social Networking Sites,
Drawbacks of Social Networking Sites, Features and Need of Social Networking, Security
Issues with Social Networking Sites, Case Studies.
TEXT BOOKS:
1. Impact of E-Business Technologies on Public and Private Organizations by OzlemBak, Nola Stair.
2. Mobile Computing by Tomasz Imielinski , Henry F. Korth .
3. Broadband telecommunications technology by Byeong Gi Lee, Minho Kang, Jonghee Lee.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
CT412
Evaluation
Scheme
FE 2: CURRENT TRENDS AND

TECHNOLOGIES
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3Hrs
REFERENCE BOOKS:
1. Introduction to broadband communication systems by Cajetan M. Akujuobi, Matthew, N. O. Sadiku.
2. E-Learning Tools and Technologies William Hortan, Katherine Hortan,Wiley Pub
3. Internet (Use of Search Engines Google & Yahoo etc).
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VIII Syllabus

GE408
CYBER LAWS
Evaluation
Scheme
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3 Hrs
OBJECTIVES
OUTCOMES
1. This course will give an overview of the legal

prospective of network security and in the process
shall provide a detailed study of the law of ecommerce
e-governance,
e-documentation
electronic and digital signature, hacking etc. The
student shall be acquiring knowledge of the
national and international regime of cyber issues
and technology law along with issues of
intellectual property law. Finally an understanding
of the regulation and punishment related to cyber
contravention shall be developed through a study
of the relevant penal provisions.
PO, PSO MAPPING :- a,d,f,h,i,j
SYLLABUS
UNIT I
Evolution of the Law relating to information Technology Legal environment in Information

Age-Technology and law-The international regime, The National regime and initiatives in
internet legislation-Issues of jurisdiction in cyber space International Convention on cyber
space 2001 OECD model treaty and E-commerce, WIPO copyright treaty (WCT) 1996,WIPO
performance and phonograms treaty (WPPT) 1996.
UNIT II
The basics of IT Act - Objectives, Scope and application of the Act of 2000, Application of the IP
Code as a measure of penal statute to regulate cyber activities and cyber contracts.
Basic foundations in the Information Technology Act for the protection of E commerce, E
Contracts and E documents, Digital signatures and identity-Access requirements, contract
formation related nomenclature as defined in Section 2 of the IT Act.
Basic Contract Law Formation of contracts, performance and discharge of contractual
obligations under the Indian Contract Act, 1872.
UNIT III
Legal aspect of Digital signature and Electronic signature:

Authentication of electronic record by electronic signature (5.3 and 3A),Legal recognition of econtracts and e-documents of the governments-ss.4, 5, 6 ,7A and 10A, Securing e-records and
e-signatures, Duties of subscriber ss.40-42 ss. 14 and 15, Certification of e-signature
(s.35,36,37,38,39), Regulation of certifying authorities through licensing application for license
,renewal of license, procedure for grant or rejection of license, suspension or revolution of
license.
UNIT IV
Adjudication of cyber crime and contraventions under the I.T Act, 2000:
Power to adjudicate-5.46, Factors considered by adjudicating offers s.47, Composition of cyber
appellate tributes S.49, Power of superintendence S.52A, Appeal to CAT-S.57, Procedure and
power of Cat S.58, S.59, S.60, S.62, S.63, S.64
UNIT V
Treatment of cyber crimes under the IT Act 2000

Offence and penalties prescribed in I.T Act 2000, Controllers powers with respect to offences
And their regulation. Law relating to Cyber crime Under Indian Penal Code (IPC) 1860
Making false electronic record (S.464 IPC) Punishment for forgery (S.465 IPC); forgery of public
record etc. (S.466 IPC) and Forgery for purpose of cheating (S.468) Forged document or
electronic record (S.470); Using as genuine a forged document or electronic record (S.471);
Counterfeiting device or mark used for authenticating documents or electronic record or
possessing counterfeit marked material, Falsifying accounts. (S.474 and S.477A).
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
GE408
CYBER LAWS
Evaluation
Scheme
UNIT VI
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3 Hrs
Implication of cyber law on intellectual property related issues and commercial transaction:
Copyright Act-definition of computer and computer program (S.2ffb), Subsistence of copyright
in computer programs, Copyright and Internet, Copyright in digital medium, Copyright in
computer databases
Trade mark Act Search engine and meta tagsDomain Names: digital marks in the online medium, Resolving domain name disputes, Cyber
Squatting /TYPO squatting Domain name in Indian lawCyber issues related Case study on Landmark and well known cases like 1. Satyam infoway Ltd. Vs Sifynet solution Pvt. Ltd (2004) 6SCC145
2. Cadilla health care Ltd Vs. Cedilla pharmaceuticals Ltd AIR 2001 SC 1952(sc)
3. The Napsters story
4. NEC corporation Vs Inter corporation
5. Any other important and current case
TEXT BOOKS:
1. Vakul Sharna, Information Technology Law and Practice, Universal Law Publishing Company, New
Delhi, Third ed. 2012.
2. S. V. JogaRao, Law of Cyber Crime and Information Technology Law, Wadhwa and Company,
Nagpur, 2007.
3. S. V. JogaRao, Computer Contract and Capital IT Law (in 2 vol.),2005 Prolific Law Publication, New
Delhi.
4. Kamlesh N and Murali, D. Tiwari (Ed), I.T and Indian Legal System, Macmillan India Ltd., New Delhi.
5. The information Technology Act (21 of 2000) Bare Act.
6. Cyber Laws, Justice Yatinder Singh, Universal Publishers.
REFERENCE BOOKS
National Legislations:
1. The Information Technology Act, 2000 .
2. The Indian Penal Code, 1860 .
3. The Indian Evidence Act, 1872 .
4. The Indian Contract Act, 1872 .
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VIII
CT415
Evaluation
Scheme
NETWORKSECURITY
MSE-I
MSE-II
15
15
OBJECTIVES
TA
10
L=4
ESE
60
1. Understanding of basic issues, concepts ,

principles and mechanisms in n/w security,
mathematics of cryptography, determine
appropniate
mechanisms
for
protecting
networks.
T=0
P=0
Credits=4
Total
100
ESE Duration
3Hrs
OUTCOMES
1. To indentify n/w security threats and determine
efforts to counter them.
2. To apply basic Principles, Theorems, Algorithms to
solve the problem.
3. To use diffiesent encryption Algorithms.
4. To apply approtunate function and protocols for
masseage authentication.
5. To desing solution for securied n/w application.
6. To analyze given system with respect to security.
PO, PSO MAPPING :- a,c,d,e,f,h,i,k,l,m

SYLLABUS
UNIT I
Introduction- Security trends, OSI Security Architecture. Security attacks, Security Services,
Security Mechanisms, model for network security, Classical encryption techniques- Symmetric
cipher model, substitution, transposition techniques, Rotor machines, Steganography.
UNIT II
Mathematics of Cryptography-Mathematics of Symmetric Key and Asymmetric Key

Cryptography-Groups, Fields-GF fields, Random Number generation, Introduction to Number
theory- Prime and Relatively prime numbers, Modular arithmetic, Fermats and Eulers
theorems ,Testing of Primality, Euclids algorithm. The Chinese Remainder Theorem, Discrete
logarithms.
UNIT III
Simplified DES, differential and linear cryptanalysis, block cipher design principles, 3-DES,
AES, IDEA, Blowfish,
RC4, CAST, Public key encryptionPrinciple of public key
cryptosystems, RSA algorithm, key management, Diffie- Hellman key exchange ,Elliptic
Curve Cryptography.
UNIT IV
Message authentication and Hash functions- Authentication requirements, Authentication

Functions, Codes, Hash functions, Security of Hash functions and MACs ,Message Digest
Algorithm, SHA- 1, RIPEMD-160 , HMAC, Digital Signatures, Authentication Protocols,
Digital Signature Standard (DSS).
UNIT V
Authentication applications-Kerberos, X.509, PKI, E-mail Security-PGP, S/MIME, IP Security

architecture, Authentication header, Encapsulating security pay load, Security Associations ,
Key management- IKE, Oakley, ISAKMP.
UNIT VI
Security at transport Layer-Secure Sockets Layer (SSL) and Transport Layer Security (TLS),
Secure Electronic Transaction (SET), System Security- Intruders, Intrusion Detection, Viruses
and related threats, Virus Countermeasures, Firewall- characteristics, types, trusted systems.
TEXT BOOKS:
1. Cryptography and Network Security Principles and Practices , 4/e, by William Stallings (Pearson Edu
Asia).
2. Cryptography and Network Security, 2/e by Behrouz A. Forouzan, The McGraw-Hill Pub.
3. Networks Security Essentials, Applications and Standards,4/e by William Stalling (Pearson Edu).
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VIII
CT418
Evaluation
Scheme
PE4: DIGITAL IMAGE PROCESSING
L=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3Hrs
OBJECTIVES
1.
T=0
P=0
Credits=4
OUTCOMES
To provide understanding of basics of

Digital
Image
Processing,
discuss
fundamental concepts of neighborhood pixel,
Spatial Domain Image Processing, provide in
sight of histogram processing, study the
frequency Domain Image Processing, provide
the details of segmentation and provide the
regional and descriptors concept.
1. Apply Image Enhancement techniques in Spatial

Domain.
2. Know and Apply Histogram Equalization,
Histogram Processing, Local Enhancement, Image
Subtraction, Image Averaging on images.
3. Perform Fourier Transform on images.
4. Understand and apply Homographic Filtering.
5. Apply different segmentation techniques on
images.
PO, PSO MAPPING :- a,b,c,d,e,i,k,l

SYLLABUS
UNIT I
Introduction: Fundamental Steps in Image Processing, Elements of DIP systems, Elements

of Visual Perception, Fundamentals of Image processing, A Simple Image Model, Sampling
and Quantization, Some Basic Relationships. between Pixels, Image Geometry in 2D.
UNIT II
Image Enhancement in the Spatial Domain: Introduction to Spatial and Frequency methods,
Basic Gray Level Transformations, Histogram Equalization, Histogram Processing, Local
Enhancement, Image Subtraction, Image Averaging, Basics of Spatial Filtering, Smoothing
Spatial Filters, Sharpening Spatial Filters.
UNIT III
Transforms: Introduction to the Fourier Transform, Discrete Fourier Transformation, Fast

Fourier Transformation, Fourier Properties, 2DFT, inverse Fourier transform, Discrete
Cosine Transform, Typical Applications
UNIT IV Image Enhancement in the frequency Domain:

Filtering in the Frequency Domain,
Correspondence between Filtering in the Spatial and Frequency Domain, Smoothing
Frequency-Domain Filters, Sharpening Frequency-Domain Filters, Homomorphic Filtering,
Implementation.
UNIT V
Image Segmentation: Point Detection, Line Detection, Edge Detection, Gradient Operator,
Edge Linking and Boundary Detection, Thresholding, Region-oriented Segmentation.
UNIT VI Image Representation: Chain Codes, Polygonal Approximations, Signatures, Boundary

Segments, Skeleton of a Region. Description: Boundary Descriptors, Shape Numbers,
Fourier
Descriptors,
Regional Descriptors, Simple Descriptors, Topological Descriptors.
Introduction to color image processing: RGB and HSI color models, introduction to image
file formats: TIFF, JPEG, BMP, etc.
TEXT BOOKS:
rd
1. Digital Image Processing by Rafael C. Gonzalez and Richard, E. Woods, 3 edition,
Prentice Hall.
2. Digital Image Processing by Jayaraman, S. Esakkirajan, T. Veerakumar, publication Tata
McGrawHill.
REFERENCE BOOKS:
1. Fundamentals of Digital Image Processing by A.K.Jain, Prentice Hall.
2. Image Processing Principles & Applications by Tinku Acharya & Ajoy K. Ray, Willey Inter-Science.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
CT419
Evaluation Scheme
PE4: DIGITAL IMAGE PROCESSING

LABORATORY
40
L=0
T=0
P=2
Credits=1
ESE
Total
ESE Duration
60
100
Practical List:
Sr.No.
PracticalName
Study Practical on basic gray level transformation.
Write a program to create a contrast of image.
Create a histogram of given image.
Resize a given Image.
Write a program to create negative of an image.
Create a Binary Image.
Write a program to smooth an image.
Write a program to Sharpe an image.
Segment a given image.
10
Create a skeleton of region.

1
2
Apply wavelet transform to decompose an image.

Apply gabor filter to enhance an image.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VIII
CT420
PE4: PATTERNRECOGNITION
Evaluation
Scheme
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3Hrs
OBJECTIVES
1. The study of Pattern Recognition to equip the
students with the brief knowledge of Statistica.
2. Decision
Theory,
Image
processing,
clustering, different error at esinpattern
recognition, decision making techniques and
application of pattern recognition in different
fields.
1.
2.
3.
4.
5.
OUTCOMES
Apply Pattern Recognition t e c h n i q u e f o r
recognition.
Know and Apply knowledge of Statistical Decision
Theory.
Perform Image processing concepts on images.
Understand and apply clustering concepts on
raw
Apply decision making techniques.
PO, PSO MAPPING :- a,b,d,e

SYLLABUS
UNIT I
Introduction: Statistical Decision Theory, Image Processing and Analysis,

probabilities of events, random variables, joint distribution & densities.
Probability-
UNIT II
Moments of random variables, estimation of parameters from samples, minimum risk

estimators.
UNIT III
Non parametric decision Making - Histograms, kernel and window estimators, nearest
neighbor classification techniques, adaptive decision boundaries, adaptive discriminate
functions, minimum squared error, estimation functions, choosing a decision making
technique.
UNIT IV
Linear
Classifier
Introduction, Linear Discriminant Functions and Decision
Hyperplanes, The Perceptron Algorithm, Least Squares Methods , Mean Square
Estimation Revisited, Support Vector Machines.
UNIT V
Feature Generation Introduction ,Basis Vectors and Images, The Karhunen-Loeve

Transform ,The Singular Value Decomposition , Independent Component Analysis,The
Discrete Fourier Transform,The Haar Transform.
UNIT VI
Clustering-Introduction, hierarchical clustering, partition clustering.
TEXT BOOKS:
1. Pattern recognition & Image Processing by Ealr Gose, Richard Johnson daugh & Steve Jost.
(PHIPub.).
2. Richard O. Duda, Peter E. Hart and David G. Stork, Pattern Classification 2nd Edition, John Wiley.
REFERENCE BOOKS:
rd
1. Pattern recognition by Sergios Theodoridis, Konstantinos Koutroumbas 3 Ed.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
CT421
Evaluation Scheme
PE4: PATTERN RECOGNITION

LABORATORY
40
L=0
T=0
P=2
Credits=1
ESE
Total
ESE Duration
60
100
Practical List:
Sr.No.
1
2
PracticalName
Enhance an image using Average Filter.
.
Detect
the edges using Sobel operator.
.
Plot
a histogram of a given image.
.Classify an objects based on adadptive desion boundary technique.
.Classify an objects based on nearest neighbor classification techniques.
6
7
.Implement The Perceptron Algorithm.

.WAP to implement SVM.
.
Extract
features using ICA.
.Extract features using DFT.
3
4
9
10
.Extract features using Haar Transform.

.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VIII
CT422
PE4: MOBILE OPERATING SYSTEM
Evaluation
Scheme
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3Hrs
OBJECTIVES
1. To understand basic concepts about Mobile
Operating System.
2. To understand features and development
framework of Android platform.
3. To get an overview of various Android
development tools, debugging techniques and
performance optimization considerations.
4. To understand Android application development
lifecycle and building process.
5. To understand User Interface elements for
Android application and create UI designs.
6. To
understand
data
storage,
network
connection and data parsing for Android
applications.
PO, PSO MAPPING :- a,b,c,d,e,f,i,j,k,l
OUTCOMES
1. To understand fundamentals of Mobile Operating
System.
2. Create sample Android application and deploy on
Android mobile.
3. Create Android Application using Android
Application development tools, debug application
and incorporate performance and memory
optimization considerations.
4. To generate and study APK file content and
manifest.
5. To design Android application User Interface,
views, layouts and styles.
6. To create Android application with SQLite
database connectivity and network connection.
SYLLABUS
UNIT I
Introduction to Mobile OS, Characteristics, comparison with desktop OS, examples,

various mobile
application
development platforms
(Android, iOS, Windows etc)
comparative study in terms of features, technology and tools.
UNIT II
Introduction to Android Computing Platform, History, Myths, features, Development

framework. (basic deployment of application on android mobile, Application signing and
distribution, Available market stores and update management, SQL Connectivity).
UNIT III
Hardware requirements, Monitoring and Controlling of Hardware, Types of Android

applications, Android development tools, application development and debugging, Using
tools like Lint, Findbug, MAT, DDMS. Performance and memory optimization
considerations.
UNIT IV
Building blocks of Android applications, Application life cycle, Priority, Process state, Activity
and its states, Intent, Actions, Android manifest, Broadcast receivers, permissions,
Services, APK file content and building process.
UNIT V
User interface, Views, Layouts, Menus,Adapters, Dialogs, styles, theme, 9-patch images
To design User Interface.
UNIT VI
Persistence data storage using files, SQLite database and shared preferences, Content
resolver and observers, Network connection over http and https, Data parsing using XML
and JSON.
TEXT BOOKS:
1. Professional Android Application Development by Reto Meier, Wiley Publishing Inc.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
CT423
Evaluation Scheme
PE4: MOBILE OPERATING

SYSTEMS LABORATORY
40
L=0
T=0
P=2
Credits=1
ESE
Total
ESE Duration
60
100
Practical List:
Sr.No.
PracticalName
Create an application having login functionality. This should provide the facility of entering login name,
password and Remember Me functionality. On successful login user should be taken to Home screen
displaying the custom welcome message. On failed attempt user should be shown error dialog.
Create an application showing the list of fix number of contacts including name, photo, email and
number. User should be able to call, SMS, email to any contact directly from the list.
Create an application to play audio/video file using native player. User should able to play/pause/stop
at all time. User should get toast notification for each activity and confirmation dialog before exit/stop.
Create an application that supports entering two numbers and functionality to

add/subtract/multiply/divide and display the result in next screen.
5
6
7
8
9
10
Create an application that provides the functionality of stop watch.

Create an application having one screen that change its color based on the selection of option
menu.
Create an application which shows an image and spinner having list of options (at least 4). On
selecting the item images should perform the selected animation.
Create an application that shows the list of employees with some basic information like first name, last
name, designation. On selecting the list item application shows more details for particular employee
and provide the option to edit the information. On Edit screen provide support for edit few (at least 4)
filed.
Create an application that provides the option to enter the student information and save into database.
App should provide the functionality to view the list of students.
Create an application that reads contacts from the native address book and supports edit/add new
contact information.

1
Create an application which has the date/time picker dialog. Take user selection as input and provide
the options to see selected date/time in different formats.
Create a demo application listing different type of notification mechanism available in android. On
selecting create notification of specific type.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VIII
PE5: BUSINESS INTELLIGENCE AND
ITS APPLICATIONS
CT430
Evaluation
Scheme
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3Hrs
OBJECTIVES
1 The proposed elective course exposes
students to Business Intelligence domain. The
objectives of this course include introduction to
BI terminologies and framework, basics of data
integration
(Extraction
Transformation
Loading), introduction to multi-dimensional data
modeling, basics of enterprise reporting and
application of the concepts using open
source/Microsoft tools.
OUTCOMES
1 Extract and transform data from an operational
database to a data warehouse.
2 Map operational data to a data warehouse.
3 Design multidimensional data models.
4 Design reports using various reporting tools and
methods .
5 Use BI tools to identify trends.
6 Exploit business analytics and performance
measurement tools.
7 Design a BI solution for a business problem.
PO, PSO MAPPING :- a,b,c,d,e,f,g,i,j,k,l,m

SYLLABUS
UNIT I
Introduction to Business Intelligence: Introduction to digital data and its types structured,
semi-structured and unstructured, Introduction to OLTP and OLAP (MOLAP, ROLAP,
HOLAP), BI Definitions & Concepts, BI Framework, Data Warehousing concepts and its role
in BI, BI Infrastructure Components BI Process, BI Technology, BI Roles & Responsibilities,
Business Applications of BI, BI best practices.
UNIT II
Basics of Data Integration (Extraction Transformation Loading): Concepts of data integration,

needs and advantages of using data integration, introduction to common data integration
approaches, Meta data types and sources, Introduction to data quality, data profiling
concepts and applications, introduction to ETL using Pentaho data Integration (formerly
Kettle).
UNIT III
Introduction to Multi-Dimensional Data Modeling: 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 Microsoft Excel.
UNIT IV
Basics of Enterprise Reporting: A typical enterprise, Malcolm Baldrige - quality performance

framework, balanced scorecard, enterprise dashboard, balanced scorecard vs. enterprise
dashboard, enterprise reporting using MS Access / MS Excel, best practices in the design of
enterprise dashboards.
UNIT V
Tools used for OLAP Design and BI Models: Overview of tools and techniques that are in use
to design BI and OLAP model, common BI and OLAP models, popular OLAP cube formats,
design tools for BI and OLAP modeling, tools for OLAP cube building and data population.
UNIT VI
Case study: Overview and use of products from Pentaho and other open software .
TEXT BOOKS:
1. Business Intelligence by David Loshin.
2. Business intelligence for the enterprise by Mike Biere.
3. Business intelligence roadmap by Larissa Terpeluk Moss, Shaku Atre.
4. An introduction to Building the Data Warehouse, IBM.
5. Business Intelligence For Dummies, Swain Scheps.
6. Successful Business Intelligence: Secrets to making Killer BI Applications by Cindi Howson Information
dashboard design by Stephen Few.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
CT431
Evaluation Scheme
PE5: BUSINESS INTELLIGENCE

AND ITS APPLICATIONS
40
L=0
T=0
P=2
Credits=1
ESE
Total
ESE Duration
60
100
Practical List:
Sr. No.
PracticalName
Design a conceptual multidimensional model for the given data.
Implement the algorithm to extract the data from various sources.
Implement the algorithm to clean the data according to business requirement.
Transform the data into final ready to load form.
5
6
Implement the algorithm to load the data in the multidimensional format.

Solve the given business queries from the multidimensional model (Phase I).
Solve the given business queries from the multidimensional model (Phase II).
Design the report for output of Phase I.
Design the report for output of Phase II.

1.
Download and install any one free open source tool for reporting
2.
Take the reports from the system for the given data.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VIII
CT432
PE5:Software Project Management
Evaluation
Scheme
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3Hrs
OBJECTIVES
OUTCOMES
1 To learn basic concepts project, contract

and to get an overview of various activities
under project planning.
2 To understand techniques for cost benefit
analysis and risk evaluation.
3 To understand project scheduling and
various network planning models.
4 To understand Risk Management, Risk
Planning and control.
5 To understand various activities like
visualizing progress, earned value analysis
etc. under monitoring and controlling of a
project.
6 To understand the role of continuing training
and learning, to improve group working and
to select appropriate leadership styles.
1 To understand basic concepts about project, project

management and project planning.
2 To assess given requirements and perform cost benefit
analysis.
3 To create a project schedule using some network
planning model for given requirements.
4 To identify and create a risk management plan for given
requirements.
5 To perform earned value analysis for given
requirements and current completion state of project.
6 To form teams for any given exercise, work as a team
and understand leadership qualities.
PO, PSO MAPPING :- a,b,c,d,e,f,g,h,i,j,k,l,m

SYLLABUS
UNIT I
Introduction to Software Project Management:

Project Definition, Contract Management, Activities Covered By Software Project Management,
Overview of Project Planning, Stepwise Project Planning.
UNIT II
Project Evaluation
Strategic Assessment, Technical Assessment, Cost Benefit Analysis, Cash Flow Forecasting,
Cost Benefit Evaluation Techniques, Risk Evaluation.
UNIT III
Activity Planning
Objectives, Project Schedule, Sequencing and Scheduling Activities, Network Planning
Models, Forward Pass, Backward Pass, Activity Float, Shortening Project Duration, Activity on
Arrow Networks.
UNIT IV
Risk Management:
Risk Management, Nature Of Risk, Types Of Risk, Managing Risk, Hazard Identification,
Hazard Analysis, Risk Planning And Control.
UNIT V
Monitoring and Control

Creating Framework , Collecting The Data , Visualizing Progress, Cost Monitoring, Earned
Value, Prioritizing Monitoring, Getting Project Back To Target, Change Control, Managing
Contracts, Introduction, Types Of Contract, Stages In Contract Placement, Typical Terms of A
Contract, Contract Management, Acceptance.
UNIT VI Managing People and Organizing Teams:
Introduction, Understanding Behavior, Organizational Behaviour: A Background, Selecting The
Right Person For The Job, Instruction In The Best Methods , Motivation, The Oldman
Hackman Job Characteristics Model, Working In Groups Becoming A Team, Decision
Making, Leadership, Organizational Structures, Stress, Health And Safety.
TEXT BOOKS:
1. Bob Hughes, Mikecotterell, Software Project Management, Third Edition, Tata McGraw Hill.
REFERENCE BOOKS:
1. Ramesh, Gopalaswamy, Managing Global Projects, Tata McGraw Hill.
2. Royce, Software Project Management, Pearson Education.
3. Jalote, Software Project Manangement in Practive, Pearson Education.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
CT433
Evaluation Scheme
Practical List:
Sr.No.
PE5: SOFTWARE PROJECT

MANAGEMENT LAB.
L=0
T=0
P=2
Credits=1
ESE
Total
ESE Duration
60
100
40
PracticalName
Introduction to Software Project Management fundamentals.
To analyze requirements for a given case study .
To create a WBS for the given case study.
To perform risk management for the case study 1.
To perform risk management for the case study 2.
Overview of Planning tool.
7
8
9
To create Project Schedule for the case study -1.

To create Project Schedule for the case study -2.
To perform cost benefit analysis for case study.
10
To study contract management and contract document.
1.
To study and calculate Software Project Metrics.
2.
To study implementation of change control.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VIII
CT434
PE5: SPEECH PROCESSING
Evaluation
Scheme
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3Hrs
OBJECTIVES
1. To acquaint with fundamentals of Speech
signals, classification of signals, applications
of speech processing .
2. To understand Time domain methods for
performing
speech
processing
and
Mathematical foundations of signal processing
and pattern recognition.
3. To familiarize students with Frequency
domain methods for performing speech
processing.
4. To know methods of speech recognition,
various issues in speech recognition.
5. To become aware about Issues in speaker
recognition and speech synthesis of different
speakers.
6. To understand various techniques for Speech
Enhancement and compare them.
PO, PSO MAPPING :- a,b,c,e,h,k,l,
OUTCOMES
After the course is delivered the students would be able
to demonstrate the ability to :
1. Classify the speech signals.
2. Use time domain methods for performing speech
processing and Pattern recognition.
3. Use Frequency domain methods for performing
speech processing and compare it with time domain
methods.
4. Select suitable
speech recognition method
considering various issues.
5. Analyze issues in speaker recognition and speech
synthesis.
6. Differentiate
various
speech
enhancement
techniques.
SYLLABUS
UNIT I
Speech production and Perception:

Anatomy and physiology of speech production, Articulatory, Linguistic, acoustic and perceptual
descriptions. Classification of speech, sounds, nature of speech signal, models of speech
production, purpose of speech processing, Digital processing of speech signals, Significance,
short time analysis, Introduction to pitch detection.
UNIT II
Time Domain Methods for Speech Processing:

Time domain parameters of speech, methods for extracting the parameters, Zero crossings,
Auto correlation function, pitch estimation , Overlapping function theory of speech, Detection
of overlapping tones, Methods to calculate ACF, Software tools to calculate ACF.
UNIT III
Frequency domain methods for speech processing:

Short time Fourier analysis, filter bank analysis, spectrographic analysis, Format extraction,
pitch extraction, Analysis - synthesis systems, Pitch classification methods, DFT to calculate
pitch function, Modules of speech synthesis system, Mathematical formulation of speech
synthesis modules.
UNIT IV
Speech Recognition:
Issues in Speech recognition, Spectrum distance measures for speech recognition, auditory
measures for speech recognition, Dynamic programming based speech recognition algorithms,
HMM models for speech recognition, Neural network approach, SVM and its implementation,
Approximation functions for speech recognition.
UNIT V
Speaker Recognition:
Issues in speaker recognition and speech synthesis of different speakers, Text to speech
conversion, Letter to sound rules, Dictionaries, prosody, Intonation, Calculating acoustic
parameters, synthesized speech output performance and characteristics of text to speech,
application of text to speech technology products, Voice processing hardware and software
architectures, Confusion resolving in speech recognition, Confusion/ambiguity resolving in TTS
Design.
UNIT VI
Speech Enhancement:
Noise suppression with pattern matching, adaptive echo cancellation for speech signals,
Noise calculation using ACF.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
CT434
Evaluation
Scheme
PE5: SPEECH PROCESSING
L=4
T=0
P=0
Credits=4
MSE-I
MSE-II
TA
ESE
Total
ESE Duration
15
15
10
60
100
3Hrs
OBJECTIVES
OUTCOMES
TEXT BOOKS:
1. L.R. Rabiner and R. E. Schafer : Digital processing of speech signals, Prentice Hall,1978
REFERENCE BOOKS:
1. Furui S.Sondhi, M, Advances in Speech Signal Processing, Dekker.
2. Syrdal A. Benett, R. Greenspan, S ,Applied Speech Technology, CRC Press.
3. Test Schner W, Voice Processing, Artech House.
4. Claudio Becchetti and Lucio Prina Ricotti, Speech Recognition, Wiley.
5. Speech and Language Processing by Jurafsky, Dan and Martin, James, Second Edition, Prentice
Hall,2008
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
CT435
Evaluation Scheme
PE5: SPEECH PROCESSING LAB

40
L=0
T=0
P=2
Credits=1
ESE
Total
ESE Duration
60
100
Practical List:
Sr. No.
PracticalName
Introduction to Matlab.
Study of Matlab functions for Speech Processing.
Implementation of Basic functionalities for speech processing using Matlab. (Read

speech file, play/plot the file).
Write speech array into speech file, record using Matlab.
5
6
Perform Fourier analysis of a speech file using Matlab.

Implementation of Homomorphic methods using Matlab.
Implementation of linear predictive methods using Matlab.
Pitch determination and excitation identification using Matlab.
Implementation of Hidden Markov model for speech recognition using Matlab.
10
Implementation of Compression techniques for audio file using Matlab.

1.
Study of IBM tool for Speech Processing.
2.
Study of Text to Speech System.
Chairperson
Date of Release
Version
PAGECT-33
May2013
1.00
Applicable for AY
2013-14 Onwards

CT Ycce

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

CT Ycce

Uploaded by

Copyright:

Available Formats

YESHWANTRAO CHAVAN COLLEGE OF ENGINEERING

B.E. (Computer Technology)

GE201 Engineering Mathematics-III

CT205 Programming Language Concepts and Constructs

Programming Language Concepts and Constructs

CT203 Data Structure

CT204 Data Structure Laboratory

EE218 Logic Design

EE217 Logic Design Laboratory

CT210 Web Technology Laboratory

GE206 Discrete Mathematics & Graph Theory

CT221 Object Oriented Programming

CT222 Object Oriented Programming Laboratory

CT207 Computer Architecture & Organization

ET213 Micro processor

ET214 Micro processor Laboratory

CT208 System Programming

CT209 System Programming Laboratory

Dean (Acad. Matt.)

YESHWANTRAO CHAVAN COLLEGE OF ENGINEERING

GE303 Managerial Economics & HR Management

CT301 Theoretical Foundation of Computer Science

CT302 Operating Systems

CT303 Operating Systems Laboratory

CT340 Computer Networks

CT341 Computer Networks Laboratory

CT330 Numerical Computing

CT331 Numerical Computing Laboratory

CT314 Design & Analysis of Algorithm

CT316 Database Management Systems

CT317 Database Management Systems Laboratory

CT318 Language Processors

CT319 Language Processors Laboratory

Professional Elective 1 Laboratory

Free Elective 1 Laboratory

CT329 Software Lab (Mini Project)

CT320 PE1: Computer Graphics

CT321 PE1: Computer Graphics Laboratory

CT322 PE1: Realtime Systems

CT323 PE1: Realtime Systems Laboratory

CT324 PE1: Mobile Communication

CT325 PE1: Mobile Communication Laboratory

ET334 FE 1 : Principals of Communication Engineering Lab

FE 1 : Operations Research Techniques

EE323 FE 1: Microprocessor & Microcontroller Laboratory

FE1:Renewable Energy Generation Systems

Dean (Acad. Matt.)

YESHWANTRAO CHAVAN COLLEGE OF ENGINEERING

CT401 Software Engineering

CT402 Software Engineering Laboratory

CT450 Object Oriented Modeling

CT413 STR ( TRAINING)

CT414 Project Phase 1 (Analysis & Design)

CT405 PE2: Embedded Systems

CT406 PE2: Neural Network & Fuzzy Logic

CT407 PE2: Ad-hoc Wireless Networks

CT408 PE3:Cloud Computing

CT409 PE3:Operations Research

CT410 PE3: Artificial Intellegience

FE 2 : Electrical Energy Audit and Safety

GE408 Cyber laws

CT415 Network Security

Professional Elective 4 Laboratory