Professional Documents
Culture Documents
Code
Subject
Total
Contact
Hours
Credits
Evaluation Scheme
MSE-I MSE-II TA ESE Total
ESE
Hrs
SEMESTER III
1
15
15
10
60
100
15
15
10
60
100
CT206
40
60
100
10
60
100
40
60
100
10
60
100
40
60
100
40
60
100
14 2 14
30
23
Total
15
15
15
15
SEMESTER IV
1
15
15
10
60
100
15
15
10
60
100
40
60
100
15
15
10
60
100
15
15
10
60
100
40
60
100
10
60
100
40
60
100
18 2
26
23
Chairperson
Date of Release
Version
15
15
May 2012
Applicable for
1.02
AY 2012-13 onwards
Code
Subject
Total
Contact
Hours
Credits
Evaluation Scheme
MSE-I MSE-II TA ESE Total
ESE
Hrs
SEMESTER V
1
15
15
10
60
100
15
15
10
60
100
15
15
10
60
100
40
60
100
10
60
100
40
60
100
10
60
100
40
60
100
CT328 Seminar I
100
17 2
27
23
Total
15
15
15
15
100
SEMESTER VI
1
15
15
10
60
100
15
15
10
60
100
40
60
100
10
60
100
40
60
100
Professional Elective 1
10
60
100
40
60
100
Free Elective 1
10
60
100
40
60
100
10
100
18 2 10
30
25
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
ME315
ME316
ME317
ME318
EE320
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
Total
Chairperson
Date of Release
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
Code
Subject
Total
Contact
Hours
Credits
Evaluation Scheme
MSE-I MSE-II TA ESE Total
ESE
Hrs
SEMESTER VII
1
15
15
10
60
100
40
60
100
15
15
10
60
100
Professional Elective 2
15
15
10
60
100
Professional Elective 3
15
15
10
60
100
Free Elective 2
15
15
10
60
100
100
CT440 Seminar 2
100
40
60
100
19 1 10
30
29
15
15
10
60
100
15
15
10
60
100
15
15
10
60
100
15
15
10
60
100
15
15
10
60
100
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
100
100
SEMESTER VIII
1
15
15
10
60
100
15
15
10
60
100
15
15
10
60
100
40
60
100
Professional Elective 4
Professional Elective 5
10
60
100
40
60
100
15
15
40
60
100
40
60
100
0 0 0
16 0 10
0
26
2
29
100
10
60
100
40
60
100
10
60
100
40
60
100
10
60
100
40
60
100
10
60
100
40
60
100
10
60
100
40
60
100
10
60
100
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
Code
Subject
Version
Total
Contact
Hours
Evaluation Scheme
Credits
MSE-I MSE-II TA ESE Total
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.
Date of Release
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
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
Evaluation Scheme
L=0
T=0
P=4
Continuous Evaluation
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
LIST OF EXPERIMENTS:
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
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
Evaluation Scheme
L=0
T=0
P=2
Continuous Evaluation
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
LIST OF EXPERIMENTS:
1.
2.
3.
Verification of truth table for MUX / DeMUX using 74153 & 74138 ICs
4.
5.
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.
11.
12.
Mini Project
Chairperson
Date of Release
Version
May 2012
1.02
Applicable for AY
2012-13 Onwards
CT210/CT510
Evaluation Scheme
L=0
T=0
P=4
Continuous Evaluation
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
LIST OF EXPERIMENTS:
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
L=0
T=0
P=4
Continuous Evaluation
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
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
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.
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
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
Chairperson
Date of Release
Version
May 2012
1.02
Applicable for AY
2012-13 Onwards
CT 222/CT506
Evaluation
Scheme
L=0
T=0
P=2
Continuous Evaluation
ESE
Total
40
60
100
Objectives
Credits=1
ESE
Duration
Outcomes
LIST OF EXPERIMENTS:
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
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
Continuous Evaluation
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
LIST OF EXPERIMENTS:
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:
[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
Continuous Evaluation
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
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.
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
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.
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
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT303/CT608
Evaluation
Scheme
Continuous Evaluation
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.
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.
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT341/CT716
Evaluation
Scheme
L=0
T=0
P=2
Continuous Evaluation
ESE
Total
40
60
100
Credits=1
ESE
Duration
Objectives
Outcomes
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
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
Continuous Evaluation
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.
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
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
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
L=0
T=0
P=4
Credits=2
ESE
Duration
Continuous Evaluation
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.
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
Chairperson
Date of Release
Version
May 2012
1.01
Yacc,
J.P. Bennett,
Applicable for AY
2012-13 Onwards
CT319/CT704
Evaluation
Scheme
L=0
T=0
P=2
Continuous Evaluation
ESE
Total
40
60
100
Credits=1
ESE
Duration
Objectives
Outcomes
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
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT321/CT718
Evaluation
Scheme
L=0
T=0
P=2
Continuous Evaluation
ESE
Total
40
60
100
Credits=1
ESE
Duration
Objectives
Outcomes
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
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
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT323/CT720
Evaluation
Scheme
L=0
T=0
P=2
Continuous Evaluation
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.
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
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
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT325/CT722
Mobile Communication
Evaluation
Scheme
Continuous Evaluation
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.
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.
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
Continuous Evaluation
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
performance queries and implement error handling.
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.
Chairperson
Date of Release
Version
May 2012
1.01
Applicable for AY
2012-13 Onwards
CT350/CT725
Evaluation
Scheme
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.
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
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.
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.
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
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
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
Continuous Evaluation
40
L=0
T=0
P=2
Credits=1
ESE
Total
ESE Duration
60
100
Practical List:
Sr.No.
PracticalName
To study and draw Use Case diagram for the given case study.
10
2.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VII
CT403
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
UNIT II
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
UNIT VI
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
Professional Elective 2
CT405
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
UNIT II
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
UNIT V
UNIT VI
Thumb Instruction Set and Programming Timers, Serial communication, Interfacing with
analog and digital circuits.
Description
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
15
L=4
10
T=0
P=0
Credits=4
ESE
Total
ESE Duration
60
100
3Hrs
OBJECTIVES
OUTCOMES
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
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
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
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
CT407
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
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
UNIT IV
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
UNIT II
UNIT III
UNIT IV
UNIT V
UNIT VI
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
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
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
UNIT IV
UNIT V
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
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
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VII
CT411
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
UNIT II
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.
UNIT II
UNIT III
UNIT IV
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
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
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
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
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
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
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
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.
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
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
UNIT V
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
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
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
Image Segmentation: Point Detection, Line Detection, Edge Detection, Gradient Operator,
Edge Linking and Boundary Detection, Thresholding, Region-oriented Segmentation.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
CT419
Evaluation Scheme
L=0
T=0
P=2
Credits=1
ESE
Total
ESE Duration
60
100
Practical List:
Sr.No.
PracticalName
10
1
2
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.
Probability-
UNIT II
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
UNIT VI
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
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
CT421
Evaluation Scheme
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
.
Extract
features using ICA.
.Extract features using DFT.
3
4
9
10
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VIII
CT422
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
UNIT II
UNIT III
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
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.
5
6
7
8
9
10
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.
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
UNIT III
UNIT IV
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
L=0
T=0
P=2
Credits=1
ESE
Total
ESE Duration
60
100
Practical List:
Sr. No.
PracticalName
5
6
Solve the given business queries from the multidimensional model (Phase II).
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
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
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
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
CT433
Evaluation Scheme
Practical List:
Sr.No.
L=0
T=0
P=2
Credits=1
ESE
Total
ESE Duration
60
100
40
PracticalName
7
8
9
10
To study contract management and contract document.
Beyond Syllabus Practical List:
1.
2.
Chairperson
Date of Release
Version
May 2013
1.00
Applicable for AY
2013-14 Onwards
SEMESTER: VIII
CT434
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
UNIT II
UNIT III
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
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
L=0
T=0
P=2
Credits=1
ESE
Total
ESE Duration
60
100
Practical List:
Sr. No.
PracticalName
Introduction to Matlab.
5
6
10
2.
Chairperson
Date of Release
Version
PAGECT-33
May2013
1.00
Applicable for AY
2013-14 Onwards