Sie sind auf Seite 1von 92

B.TECH.

COMPUTER SCIENCE & ENGINEERING


[Curriculum & Syllabi revision]


26.3.1
113
Proceedings of the 26th Academic Council held on 18.5.2012


II.UniversityElective(6Credits)
S.
No
Course
Code
CourseName L T P C
Prerequisites/
Exposure
1. University Elective - I 3 0 0 3
2. University Elective - II 3 0 0 3
6



I.UniversityCore(17Credits)
S.
No.
Course
Code
CourseName L T P C
H/S/
M/E
Prerequisites/
Exposure
1.
ENG001 Effective English (or)
3 0 0 3 H
ENG101 English for Engineers I
2. ENG102 English for Engineers II 3 0 0 3 H
ENG001 (or)
ENG101
3. CHY104 Environmental Studies 3 0 0 3 H
4. MGT301 Ethics and Values 3 0 0 3 M
5. Foreign Language 2 0 0 2 H
6. CSE101
Computer Programming and
Problem Solving
2 0 2 3 E
17
III.Science(38Credits)
S.
No
Course
Code
CourseName L T P C
H/M
/
S/E
Prerequisites/
Exposure
1. MAT101
Multivariable Calculus and
Differential Equations
3 1 0 4 S
2. MAT105
Differential and Difference
Equations
3 1 0 4 S MAT101
3. MAT207
Applied Probability,
Statistics and Reliability
3 1 0 4 S MAT101, MAT105
4. MAT202 Linear Algebra 3 1 0 4 S MAT101, MAT106
5. PHY101 Modern Physics 3 0 2 4 S
6. MAT106
Discrete Mathematical
Structures
3 1 0 4 S
7. CSE208 Theory of Computation 3 1 0 4 S MAT106
8. MAT206
Graph Theory and its
Applications
3 0 0 3 S MAT106
9. MAT203 Numerical Analysis 3 0 0 3 S MAT105
10. CHY101 Engineering Chemistry 2 1 2 4 S
38
114
Proceedings of the 26th Academic Council held on 18.5.2012
IV.ProgramCore(116Credits)
Sl.
No

Course
Code
CourseName L T P C
H/M/
S/E
Pre
requisites/
Exposure
1. EEE101
Basic Electrical and Electronics
Engineering
3 0 2 4 E
2. EEE103 Electronics 3 0 2 4 E EEE101
3. CSE219
Object Oriented Paradigm and
Programming
3 1 2 5 E CSE101
4. CSE109 Digital Logic 3 0 2 4 E CSE101
5. CSE220 Data Structures and Algorithms 3 1 2 5 E CSE101
6. CSE205
Computer Architecture and
Organization
3 1 0 4 E CSE109
7. CSE202 Algorithm Design and Analysis 3 1 0 4 E CSE220
8. CSE221 Microprocessor and Interfacing 3 0 2 4 E CSE205
9. CSE322 Embedded Systems 3 0 2 4 E CSE221
10. CSE222 Operating Systems 3 0 2 4 E CSE205
11. CSE323 Computer Networks 3 0 2 4 E CSE222
12.

CSE309

Programming Language Translators 3 1 0 4

E
CSE208+
CSE205
13. CSE418 Graphics and Multimedia 3 0 2 4 E MAT202
14. CSE324 Database Systems 3 0 2 4 E CSE220
15. CSE325 Software Engineering 3 0 2 4 E CSE324
16.

CSE326

Internet & Web Programming 3 0 2 4

E
CSE219 +
CSE323
17. CSE327 Image and Vision Computing 3 0 0 3 E MAT202
18. MEE437 Operations Research 3 0 0 3 M MAT207
19. CSE328 Software Project Management 3 0 0 3 M CSE325
20.

CSE419

Mobile Computing 3 0 0 3 E
CSE323+
CSE326
21. CSE329


Management Information Systems
3

0 0

3

E


22. CSE330 Agent Based Intelligent Systems 3 0 0 3 E CSE220
23. MEE101 Engineering Graphics 0 0 4 2 E
24. MEE102 Workshop Practice 0 0 2 1 E
25. Comprehensive Exam 0 0 0 2 E
26. In plant Training (Industrial Internship) 0 0 0 2 E
27. Project work 0 0 0 20 E
110
115
Proceedings of the 26th Academic Council held on 18.5.2012

V.ProgramElectives(9Credits)
Sl.
No.

Course
Code
CourseName L T P C
H/M/
S/E
Pre
requisite/
Exposure
1. CSE404 Bio-informatics 3 0 0 3 E CSE202
2.
CSE405
Parallel Algorithms 3 0 0 3 E
CSE205+
CSE202
3. CSE314

Advanced Computer Architecture 3 0 0 3 E
CSE205+
CSE309
4.
CSE406

Concurrent and Distributed
Systems
3 0 0 3 E

CSE222
5. CSE407 Software Practice and Testing 3 0 0 3 E CSE325
6. CSE408

Data Warehousing and Data
Mining
3 0 0 3 E

CSE324
7. CSE315 Scripting Languages 3 0 0 3 E CSE323
8. CSE403

Human Computer Interaction 3 0 0 3 E
CSE418+
CSE325
9. CSE316 Database Design 3 0 0 3 E CSE324
10. CSE409 Modeling and Simulation 3 0 0 3 E MAT207
11. CSE317 Data Communications 3 0 0 3 E CSE323
12. CSE415 Information Security 3 0 0 3 E CSE326
13. CSE319 Soft Computing 3 0 0 3 E MAT106
14. CSE416 Cloud Computing 3 0 0 3 E CSE325
15. CSE320 Multi-core Architecture 3 0 0 3 E CSE205
16. CSE420 Green Computing 3 0 0 3 E
17. CSE421 Information Retrieval 3 0 0 3 E CSE202
18. CSE424 Ad hoc Wireless Networks 3 0 0 3 E CSE323
19. CSE422 Medical Image Processing 3 0 0 3 E CSE327
20. CSE223 Principles of Programming 3 0 0 3 E CSE101
21. CSE331 Pattern Classification 3 0 0 3 E MAT202
22. CSE423 Gaming Engineering 3 0 0 3 E CSE326
23. ECE104
Discrete Time Systems and
Processing
3 0 0 3 E
116
Proceedings of the 26th Academic Council held on 18.5.2012
SemesterwiseSplitup

Seme
ster
S.
No
Code CourseTitle L T P C
UC/UE/
PC/PE
Pre
requisite
I


1

ENG001 Effective English or
3 0 0 3

ENG101

English for Engineers I

2

MA101

Multivariable Calculus and
Differential Equations
3 1 0 4

3 PHY101 Modern Physics 3 0 2 4
4 EEE101
Basic Electrical and
Electronics Engineering
3 0 2 4

5

CSE101

Computer Programming
and Problem Solving
2 0 2 3

6 MEE101 Engineering Graphics 0 0 4 2
7 MEE102 Workshop Practice 0 0 2 1
TotalCredits 21


Seme
ster
S.
No
Code CourseTitle L T P C
UC/UE/
PC/PE
Pre
requisite
II

1


ENG102


English for Engineers - II



3



0



0



3




ENG 001
(or)
ENG101

2

MAT105

Differential and Difference
Equations
3 1 0 4 MAT101

3 CHY 101 Engineering Chemistry 2 1 2 4
4

EEE 103

Electronics

3 0 2 4

EEE 101

5

MAT106

Discrete Mathematical
Structures
3 1 0 4

6 MAT202 Digital Logic 3 0 2 4 CSE 101
TotalCredits 23






117
Proceedings of the 26th Academic Council held on 18.5.2012



Seme
ster
S.
No
Code CourseTitle L T P C
UC/UE/
PC/PE
Prerequi
site
III

1 MAT203 Numerical Analysis 3 0 0 3 MAT105


2

CSE219

Object Oriented Paradigm
and Programming
3

1

2

5
CSE101
3 MGT301 Ethics and Values 3 0 0 3
4

CSE220

Data Structures and
Algorithms
3

1

2

5

CSE101+
MAT106
5

CSE205

Computer Architecture
and Organization
3

1

0

4

MAT202

6 CSE208 Theory of Computation 3 1 0 4 MAT106
TotalCredits 24




Seme
ster
S.
No
Code CourseTitle L T P C
UC/UE/
PC/PE
Prerequi
site
IV

1

MAT202

Linear Algebra

3

1

0

4


MAT101+
MAT106
2

MAT207

Applied Probability,
Statistics and Reliability
3 1 0 4

MAT101+
MAT105
3

CSE 221

Microprocessor and
Interfacing
3 0 2 4

CSE 205

4

CSE 222

Operating Systems

3

0

2

4

CSE 205

5

CSE 202

Algorithm Design and
Analysis
3

1

0

4

CSE 220
6 CHY 104 Environmental Studies 3 0 0 3
TotalCredits 23

118
Proceedings of the 26th Academic Council held on 18.5.2012


Seme
ster
S.
No
Code CourseTitle L T P C UC/UE/
PC/PE
Pre
requisite

1 University Elective I 3 0 0 3
2 CSE330 Agent Based Intelligent
Systems
3 0 0 3 CSE220
3 CSE327 Image and Vision
Computing
3 0 0 3 MAT202
4 CSE324 Database Systems 3 0 2 4 CSE220
5 MEE437 Operations Research 3 0 0 3 MAT207
6 CSE323 Computer Networks 3 0 2 4 CSE222
7 CSE309 Programming Language
Translators
3 1 0 4 CSE208+
CSE205
TotalCredits 2
4



Seme
ster
S.
No
Code CourseTitle L T P C UC/UE/
PC/PE
Pre
requisite

VI
1 MAT206 Graph Theory and its
Applications
3 0 0 3
2 CSE325 Software Engineering 3 0 2 4 CSE324
3 CSE329 Management
Information Systems
3 0 0 3
4 Program Elective I 3 0 0 3
5 University Elective II 3 0 0 3
6 Program Elective II 3 0 0 3
7 Internet and Web
Programming
3 0 2 4
TotalCredits 2
3








119
Proceedings of the 26th Academic Council held on 18.5.2012


Seme
ster
S.
No
Code CourseTitle L T P C UC/
UE
/PC
/PE
Pre
requisite

VII
1 Foreign Language 2 0 0 2
2 CSE322 Embedded Systems 3 0 2 4 CSE221
3 CSE419 Mobile Computing 3 0 0 3 CSE323+
CSE326
4 CSE328 Software Project
Management
3 0 0 3 CSE325
5 CSE418 Graphics and
Multimedia
3 0 2 4 MAT202
6 Program Elective III 3 0 0 3
7 Comprehensive Exam 0 0 0 2 Completed
91 Credits +
Registered
for 20
Credits
8 In-Plant Training 0 0 0 2
TotalCredits 22





Seme
ster
S.
No
Code CourseTitle L T P C UC/
UE
/PC
/PE
Pre
requisite
VIII 1 Project 0 0 0 20 Completed /
Registered
160 Credits
TotalCredits 20



120
Proceedings of the 26th Academic Council held on 18.5.2012
121
Proceedings of the 26th Academic Council held on 18.5.2012

CSE101COMPUTERPROGRAMMINGANDPROBLEMSOLVING

C
2 0 2 3

Version

Course
Prerequisites:


Nil
Objectives:
1. To provide an overview of computer algorithms and problem solving techniques
2. To introduce C Language that serves as a foundation for the study of different
programming languages.

ExpectedOutcome:
Students shall be able to
1. Apply the fundamental knowledge of computing algorithms appropriate to the
problems
2. Analyze and design problems using various problems solving techniques
3. Formulate and solve computing problems using C programming language.
4. Apply algorithmic principles and current techniques for computing and engineering
practice.

UnitI INTRODUCTIONTOCOMPUTERSANDALGORITHMS 6hours
Parts of a computer Overview of operating systems, compilers, interpreters and
programming languages. Algorithms for exchanging the values of two variables,
counting, summation of a set of numbers, factorial computation, sine function
computation, generation of the Fibonacci sequence, reversing the digits of an integer,
base conversion and character to number conversion.

UnitII BASICCONSTRUCTSINC 6hours
Lexical elements Operators - Data types I/O statements Format specifications
Control statements Decision making and Looping.

UnitIII ARRAYS 6hours
Arrays handling in C Declaration single dimensional arrays, two dimensional
arrays, multi-dimensional arrays, sorting and searching on single and two dimensional
arrays.
Character array string handling functions manipulation on strings.

UnitIV FUNCTIONS&POINTERS 8hours
Prototype Declaration - Arguments (formal and actual) Return type types of
functions, difference between built-in and user-defined functions, introduction to
pointers, passing parameters by value and reference, recursive functions, scope and life
time of variables storage classes.

UnitV STRUCTURESANDUNION 4hours
Declarations - nested structures array of structures passing structure to functions -
union- difference between structure and union.
122
Proceedings of the 26th Academic Council held on 18.5.2012

Text/ReferenceBooks
1. Yeshawant Kanetkar, Let Us C, Jones & Bartlett Publishers, 11
th
Edition, 2008.
2. R.G. Dromey, How to Solve it by Computer, Prentice Hall of India, 2001.
3. Ashok Kamthane, Programming in C, 2
nd
Edition, Pearson Education, 2001.
ModeofEvaluation Tests, Assignments, Seminars
Recommendedbythe
BoardofStudieson


DateofApprovalbythe
AcademicCouncil





















123
Proceedings of the 26th Academic Council held on 18.5.2012

CSE208THEORYOFCOMPUTATION

C
3 1 0 4
VersionNo.


CoursePrerequisites

Discrete Mathematical Structures
Objectives
1. To introduce Formal Languages, Automata Theory and Abstract models of
Computation and Computability, Computational complexities and NP
Completeness.
2. To gain knowledge in computational theory.
3. To realize the theoretical concepts and techniques involved in the software system
development

ExpectedOutcome
Students will be able to
1. Apply the theoretical concepts and techniques in designing the software systems.
2. Identify, analyze, design and formulate problems using computational theory.
3. Conduct experiments and interpret data using computational theory.
4. Apply the theoretical principles of computing for software construction.

UnitI AUTOMATA 9+3hours
Strings, Alphabet, Language, Operations, Finite State Machine, definitions, finite
automation model, acceptance of strings and languages, on deterministic finite
automation, deterministic finite automation, equivalence between NFA and DFA,
Conversion of NFA into DFA, minimization of FSM ,equivalence between two FSM's,
Moore and Melay machines.

UnitII REGULAREXPRESSIONS 9+3hours
Regular sets, regular expressions, identity rules, manipulation of regular expressions,
equivalence between RE and FA, inter conversion, Pumping lemma, Closure properties
of regular sets(proofs not required),regular grammars, right linear and left linear
grammars equivalence between regular linear grammar and FA, inter conversion
between RE and RG.

UnitIII CONTEXTFREEGRAMMARS 9+3hours
Context free Grammars, Derivation trees, Left Most Derivations, Right Most Derivations,
Ambiguity in Context-Free Grammars, Specifications of Context Free Grammars, Normal
Forms, Chomsky Normal Form (CNF), Greibach Normal Form (GNF), Push Down
Automata, NPDA, DPDA.

UnitIV TURINGMACHINE 9+3hours
Turing machine, definition, model, design of TM, Computable Functions, recursive
enumerable language, Churchs Hypothesis, Counter machine, types of TM's(Proofs not
required).



124
Proceedings of the 26th Academic Council held on 18.5.2012

UnitV CLASSESOFPROBLEMS 9+3Hours
Chomsky hierarchy of languages, linear bounded automata and context sensitive
language,
Grammar, decidability of problems, Universal Turing Machine, undecidability of posts
correspondence problem. Turing reducibility.


Text/ReferenceBooks
1. J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to automata theory,
languages, and computation, Addison- Wesley, 2006.
2. Kamala Kritivasan and B. Rama, Introduction to Formal Languages, Automata
Theory and Computation, Pearson Education, 1
st
edition, 2009.
3. Lewis H.P. & Papadimition C.H. Elements of Theory of Computation, Prentice Hall of
India, 4
th
edition. 2007.

ModeofEvaluation Tests, Assignments, Seminars.

Recommendedbythe
BoardofStudieson

DateofApprovalbythe
AcademicCouncil














125
Proceedings of the 26th Academic Council held on 18.5.2012


CSE219OBJECTORIENTEDPARADIGMANDPROGRAMMING L T P C
3 1 2 5
VersionNo.
Course
Prerequisites
Computer Programming and Problem Solving
Objectives
1. To understanding the principles of object oriented programming
2. To introduce the object oriented way of problem solving.
3. To gain familiarity with the syntax, class hierarchy, environment and simple
application construction for an object-oriented programming language.

ExpectedOutcome
At the end of the course, students should able to
1. Understand the principles of object oriented programming
2. Introduce the object oriented way of problem solving.
3. Apprehend the syntax and semantics of the C++ programming language.
4. Use the class and objects to create applications.
5. Design and Create new applications by interconnecting many classes and reusing the
code.
6. Synthesize generic class templates to be used with different types of data.

UnitI INTRODUCTIONTOFUNDAMENTALCONCEPTSOFOOP 9 + 3 hours
Survey of programming paradigms Object-Oriented Paradigm: Elements of Object
Oriented Programming Merits and demerits of object oriented methodology. benefits
of object oriented programming - structure of C++ program Static members, Working
with classes, Classes and Objects-Class specification- class objects- accessing class
members- defining member functions - Passing and returning objects Array of objects
- inline functions - accessing member functions within class.
UnitII OBJECTINITIALIZATIONANDCLEANUP 6 + 3 hours
Constructors - Parameterized constructors - Constructor overloading. Copy constructor,
Destructors, Default arguments - new, delete operators - this pointer, friend classes
and friend functions.
UnitIII OVERLOADINGANDGENERICPROGRAMMING 10 + 3 hours
Function overloading Operator overloading- Non-over loadable operators- unary
operator overloading- operator keyword- limitations of increment/decrement
operators- binary operator overloading- Generic programming with templates-Function
templates- class templates
UnitIV INHERITANCE 10 + 3 hours
Inheritance-Base class and derived class relationship-derived class declaration-Forms
of inheritance- inheritance and member accessibility- constructors in derived class,
abstract class, virtual functions, pure virtual function.
UnitV EXCEPTIONHANDLINGANDSTREAMS 10 + 3 hours
Files and Streams-Opening and Closing a file- file modes- file pointers and their
manipulation, sequential access to a file-random access to a file-Reading and Writing
files - Exception handling-exception handling model- exception handling constructs-
catching exceptions and handling exceptions.
126
Proceedings of the 26th Academic Council held on 18.5.2012

Text/ReferenceBooks
1. K. R. Venugopal, Rajkumar, T. Ravishankar, Mastering C++, 4
th
Edition, Tata McGraw
Hill, 2008
2. Budd T., An Introduction to Object-oriented Programming, Addison-Wesley 3
rd

edition, 2008.
3. Bjarne stroustrup, The C++ programming Language, Addison Wesley, 3
rd
edition,
2008.
4. Harvey M. Deitel and Paul J. Deitel, C++ How to Program, 7
th
edition, Prentice Hall,
2010.

ModeofEvaluation Tests, Assignments, Seminars.

Recommendedbythe
BoardofStudieson


DateofApprovalbythe
AcademicCouncil



Samplelistofexercises
1. Program illustrating function overloading feature.

2. Programs illustrating the overloading of various operators
Ex : Binary operators, Unary operators, New and delete operators etc.
3. Programs illustrating the use of following functions :
a) Friend functions b) Inline functions c) Static Member functions
d) Functions with default arguments.

4. Programs illustrating the use of destructor and the various types of constructors (no
arguments, constructor, constructor with arguments, copy constructor etc).

5. Programs illustrating the various forms of inheritance: Ex. Single, Multiple,
multilevel, hierarchical inheritance etc.

6. Write a program having student as on abstract class and create many derived classes
such as Engg. Science, Medical, etc. from students class. Create their objects and
process them.

7. Write a program illustrating the use of virtual functions.

8. Write a program which illustrates the use of virtual base class.

9. Write programs to illustrating file handling operations:
Ex. a) Copying a text files b) Displaying the contents of the file etc.

10. Write programs illustrating how exceptions are handled (ex: division-by-zero,
overflow and underflow in stack etc)

127
Proceedings of the 26th Academic Council held on 18.5.2012

CSE109 DIGITALLOGIC L T P C
3 0 2 4
VersionNo.

Course
Prerequisites

Computer Programming and Problem Solving

Objectives
1. To impart the knowledge of digital logic fundamentals involving flip-flops, registers
etc., to design simple computer based system.
2. To understand the principles of Boolean laws, Boolean algebra, Boolean logic, logic
gate, flip-flop, shift register, arithmetic and Logic unit for designing computer based
system
3. To understand the memory representation in ROM, RAM and CPU.

ExpectedOutcome
Students shall be able to
1. Apply fundamental knowledge of combinational, sequential circuits to design and
analyze the functions of various hardware components for solving engineering
problems.
2. Model / develop a computer based systems with the fundamentals of digital theory.

UnitI NUMBERSYSTEMANDBOOLEANALGEBRA 9hours
Number System Converting numbers from one base to another Complements
Binary Codes Integrated Circuits representation and manipulation of switching
circuits Boolean algebra Properties of Boolean algebra Boolean functions
Canonical and Standard forms Logic operations Logic gates Physical properties of
logic gates (technology, fan-in, fan-out, propagation delay) Karnaugh Map up to 6
variables Don't Care Condition Sum of Products and Products of sum simplification
Tabulation Method.

UnitII COMBINATIONALCIRCUITS 9hours
Adder Subtractor Code Converter Analyzing a Combinational Circuit Multilevel
NAND and NOR circuits Properties of XOR and equivalence function Binary Parallel
Adder Decimal Adder Magnitude Comparator Decoders Multiplexers ROM
PLA.

UnitIII SEQUENTIALCIRCUITS 9hours


Flip Flops Triggering of flipflops Analyzing a sequential circuit State reduction
Excitation tables Design of sequential circuits Counters Design with state equation
Registers Shift Registers Ripple and Synchronous Counters, Timing sequences
Johnson counters.

UnitIV ARITHMETICLOGICUNIT 9hours
Memory Unit Bus Organization Scratch Pad Memory ALU Design of ALU Status
Register Effects of Output carry Design of Shifter Processor Unit
Microprogramming Design of specific Arithmetic Circuits.


128
Proceedings of the 26th Academic Council held on 18.5.2012

UnitV COMPUTERDESIGN 9hours
Accumulator Design of Accumulator Computer Configuration Instructions and Data
formats Instruction sets Timing and control Execution of Instruction Design of
Computer H/W Control PLA control and Microprogram control.

Text/ReferenceBooks
1. M. Morris Mano Digital Logic and Computer Design, Pearson Education 5
th

Edition- 2007.
2. A.D. Friedman, Fundamentals of Logic Design and switching Theory, Computer
Science Press, 1986
3. A.P. Malvino and D.P. Leach Digital Principles and Applications Tata McGraw Hill
Special Edition 2009.
4. Thomas Floyd Fundamentals of Digital System Pearson Education.-3
rd
Edition
2003.

ModeofEvaluation : Tests, Assignments, Seminars.

Recommendedbythe
BoardofStudieson

DateofApprovalbythe
AcademicCouncil

ListofExperiments
Study of Logic Gates.
Logic gates using discrete Components.
Verification of truth table for AND, OR, NOT, NAND, NOR and XOR gates.
Realization of NAND and NOR gates
Implementation of Logic Circuits.
Verification of Boolean laws.
Verification of DeMorgans law
Adder and Subtractor
Implementation of Half-Adder and Full-Adder
Implementation of Half-Subtractor and Full-Subtractor
Combinational Circuit Design
Design of Decoder and Encoder
Design of Code Converter.
Design of multiplexers and de multiplexers.
Sequential Circuit Design
Implementation of Shift registers, Serial Transfer.
Ring Counter
4-bit Binary Counter
BCD Counter.
129
Proceedings of the 26th Academic Council held on 18.5.2012


CSE220DATASTRUCTURESANDALGORITHMS L T P C
3 1 2 5
VersionNo.
Course
Prerequisites
Computer Programming and Problem Solving and Discrete
Mathematical Structures.

Objectives
1. To understand various types of fundamental data structures (standard and user
defined).
2. To learn about algorithm analysis for the run time complexities and the space
requirements.
3. To acquire knowledge of data structures and algorithms for implementing
various computing system.

ExpectedOutcome
Students will be able to
1. Apply the fundamental knowledge of various data structures and algorithms to
analyze, design, formulate and implement algorithm for any real time problem.
2. Apply current techniques in data structures and algorithmic principles for
modeling and developing software systems

UnitI BASICALGORITHMICANALYSIS 6+3hours
Asymptotic notations: Big O, little o, omega, and theta notations, Running time
calculations, Identifying differences among best, average, and worst case behaviors;
Complexity analysis- Time and space tradeoffs in algorithms; Empirical measurements
of performance; Using recurrence relations to analyze recursive algorithms.

UnitII ALGORITHMICSTRATEGIES 8+3hours
Brute-force algorithms; Greedy algorithms Activity Selection Problem; Divide-and-
conquer Strassens Matrix Multiplication; Backtracking 8 queens problem; Branch-
and-bound Traveling Salesman Problem, Dynamic Programming . 0/1 Knapsack
Problem.

UnitIII FUNDAMENTALDATASTRUCTURESAND
COMPUTINGALGORITHMS
10+3hours
Stacks Queues Lists Doubly Linked Lists Circular Linked Lists - Simple numerical
algorithms - Sorting and Searching Algorithm: Sequential and binary search algorithms;
Quadratic sorting algorithms (bubble, selection, insertion); O (N log N) sorting
algorithms (Quick sort, heap sort), Merge Sort;

UnitIV HASHTABLESANDTREES 12+3hours
Hashing: Hash tables, including collision-avoidance strategies;
Non-Linear Data Structures: Binary trees; Binary Search Trees; General Tree;
Binary trees, Conversion of general tree to binary tree, Binary Search Tree: Traversals,
Implementation, Operations on Binary Search Tree, Expression Tree.


130
Proceedings of the 26th Academic Council held on 18.5.2012

UnitV GRAPHS 9+3hours
Introduction, Representations of graphs (adjacency list, adjacency matrix, Sparse
Matrix); Topological Sorting; Shortest-path algorithms (Single source shortest path;
Dijkstras and Floyds algorithms); Minimum spanning tree (Prims and Kruskals
algorithms).

Text/ReferenceBooks
1. Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , Clifford Stein,
Introduction to Algorithms, 3
rd
Edition, MIT Press, 2009
2. S. Sahni, Data structures, Algorithms, & applications in Java, McGraw-Hill,2005
3. J. P. Trembly et al, An introduction to data structures with applications,2007
4. D. E. Knuth, Art of computer programming, Volume 1: Fundamental algorithms,
Addison Wesley, 2011.

ModeofEvaluation Tests, Assignments, Seminars.

Recommendedbythe
BoardofStudieson


DateofApprovalby
theAcademicCouncil


SamplelistofExercises
Implementing Stacks and queues.
Implementation and processing in lists.
Sorting:
a. Insertion sort
b. Merge sort
c. Quick sort
d. Selection sort
e. Heap sort
f. Shell sort
Searching:
a. Linear search
b. Binary search
Binary Search Trees
Graphs:
a. BFS
b. DFS
c. Topological Sort

Spanning Trees
a. Prims Algorithm
b. Kruskals Algorithm

Shortest Path Algorithms
a. Dijkstras Algorithm
b. Floyds Algorithm
131
Proceedings of the 26th Academic Council held on 18.5.2012


CSE205COMPUTERARCHITECTUREANDORGANIZATION L T P C
3 1 0 4
VersionNo.

Course
Prerequisites

Digital Logic
Objectives
1. To Gain an understanding of computer data representation and manipulation
2. To understand the basic organization for data storage and access across various
media.
3. To provide knowledge of interfacing techniques and subsystem devices.

ExpectedOutcome
The students will be able to
1. Understand and apply number systems, instruction sets, addressing modes, and
data/instruction formats for designing and implementing computer based system.
2. Write program using assembly language programming for computing and
engineering practice.
3. Apply the digital principles in modeling and designing of computer based systems.

UnitI FUNDAMENTALSOFCOMPUTERARCHITECTURE 9+3hours
Organization of the von Neumann machine; Instruction formats; The fetch/execute
cycle, instruction decoding and execution; Registers and register files; Instruction types
and addressing modes; Subroutine call and return mechanisms; Programming in
assembly language; I/O techniques and interrupts; Other design issues.

UnitII COMPUTERARITHMETIC 9+3hours
Data Representation, Hardware and software implementation of arithmetic unit for
common arithmetic operations: addition, subtraction, multiplication, division( Fixed
point and floating point); Conversion between integer and real numbers;
Representation of non-numeric data (character codes, graphical data).

UnitIII MEMORYSYSTEMORGANIZATIONANDARCHITECTURE 9+3hours


Memory systems hierarchy; Coding, data compression, and data integrity; Electronic,
magnetic and optical technologies; Main memory organization, Types of Main
memories, and its characteristics and performance; Latency, cycle time, bandwidth, and
interleaving; Cache memories (address mapping, line size, replacement and write-back
policies); Virtual memory systems; Reliability of memory systems; error detecting and
error correcting systems.

UnitIV INTERFACINGANDCOMMUNICATION 9+3hours
I/O fundamentals: handshaking, buffering; I/O techniques: programmed I/O, interrupt-
driven I/O, DMA; Interrupt structures: vectored and prioritized, interrupt overhead,
interrupts and reentrant code; Buses: bus protocols, local and geographic arbitration.



132
Proceedings of the 26th Academic Council held on 18.5.2012

UnitV DEVICESUBSYSTEMS 9+3hours
External storage systems; organization and structure of disk drives and optical memory;
Basic I/O controllers such as a keyboard and a mouse; RAID architectures; I/O
Performance; Processor to network interfaces.

Text/ReferenceBooks
1. John L. Hennessy and David A. Patterson, Quantitative Approach Computer
Architecture, Morgan Kaufmann Publishers, 5
th
edition, 2011.
2. W. Stallings, Computer organization and architecture, Prentice-Hall, 8
th
edition, 2009
3. M. M. Mano, Computer System Architecture, Prentice-Hall, 3
rd
Edition, 1992
4. J. P. Hayes, Computer system architecture, McGraw Hill, 3
rd
Edition, 2002.

ModeofEvaluation: Tests, Assignments, Seminars.

Recommendedbythe
BoardofStudieson

DateofApprovalbythe
AcademicCouncil
133
Proceedings of the 26th Academic Council held on 18.5.2012


CSE202ALGORITHMDESIGNANDANALYSIS L T P C
3 1 0 4
VersionNo.
Course
Prerequisites
Data Structures and Algorithms
Objectives
1. To provide the knowledge about the methods of advanced algorithms
2. To understand the advanced algorithms such as cryptographic algorithms,
Geometric Algorithm and Parallel Algorithm
ExpectedOutcome
The students will be able to
1. Apply the algorithm design techniques to analyze, solve and evaluate computing
problems.
2. Apply algorithmic principles in modelling and designing software systems
UnitI NPCOMPLETENESS 9+3hours
THE COMPLEXITY CLASSES P AND NP: Definition of the classes P and NP; NP-
completeness (Cooks theorem); Standard NP-complete problems; Reduction
techniques.
UnitII ADVANCEDALGORITHMICANALYSIS 9+3hours
Amortized analysis; Dynamic programming Matrix Chain Multiplication;
combinatorial optimization, Elements of greedy strategies, activity, Huffman code.
UnitIII STRINGMATCHINGALGORITHMS 9+3hours
Nave string matching algorithms, KMP algorithm, Rabin-Karp algorithm, suffix trees,
Exact string matching algorithm using suffix trees.
UnitIV GEOMETRICALGORITHMS 9+3hours
Line segments: properties, intersections; convex hull finding algorithms.
UnitV APPROXIMATIONALGORITHMS 9+3hours
Limitations of approximation, basic techniques, Vertex-cover problem, traveling
salesman problem, set-cover problem
Text/ReferenceBooks
1. Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , Clifford Stein,
Introduction to Algorithms, 3
rd
Edition, MIT Press, 2009
2. Ellis Horowitz, S. Sahni and S. Rajasekaran, Computer Algorithms, S. P. Publications,
2
nd
edition, 2007

ModeofEvaluation: Tests, Assignments, Seminars.

Recommendedbythe
BoardofStudieson

DateofApprovalbythe
AcademicCouncil


134
Proceedings of the 26th Academic Council held on 18.5.2012


CSE322EMBEDDEDSYSTEMS L T P C
3 0 2 4
VersionNo.
Course
Prerequisites
: Microprocessor and Interfacing

Objectives
1. To provide an insight into the fundamentals of embedded system
2. To understand programs and tools for embedded system.
3. To gain knowledge about real time operating system
4. To elucidate knowledge of embedded system types and its interfacing
mechanisms

ExpectedOutcome
The students will be able to
1. Design and evaluate embedded based system.
2. Apply current techniques and tools of embedded system in modeling and
designing computer based system.

UnitI EMBEDDEDMICROCONTROLLERS 9hours
Introduction:Contrast between an embedded system and other computer systems; the
role of programming and its associated languages as applied to embedded systems; the
purpose and role of embedded systems in computer engineering. Microcontrollers:
Structure of a basic computer system: CPU, memory, I/O devices on a bus; CPU families
used in microcontrollers: 4-bit, 8-bit, 16-32-bit; Basic I/O devices: timers/counters,
GPIO, A/D, D/A; Polled I/O vs. interrupt-driven I/O; Interrupt structures: vectored and
prioritized interrupts; 805, AVR, PIC, ARM.

UnitII EMBEDDEDPROGRAMSANDTOOLS 9hours
The program translation process: compilation, assembly, linking; Representations of
programs: data flow and control flow; Fundamental concepts of assembly language and
linking: labels, address management; Compilation tasks: mapping variables to memory,
managing data structures, translating control structures, and translating expressions;
Functions that can cannot be controlled through the compiler; need for writing
assembly language. Tool support: Compilers and programming environments; Logic
analyzers; RTOS tools VX works; Power analysis; Open source tools.

UnitIII REALTIMEOPERATINGSYSTEMS 9hours


Realtime operating systems: Context switching mechanisms; Scheduling policies;
Rate-monotonic scheduling: theory and practice; Priority inversion; other scheduling
policies such as EDF; Message-passing vs. shared memory communication; Interprocess
communication styles such as mailbox and RPC; Lowpower computing: Sources of
energy consumption: toggling, leakage; Instruction-level strategies for power
management: function unit management; Memory system power consumption: caches,
off-chip memory; Power consumption with multiple processes; System-level power
management: deterministic, probabilistic methods.

135
Proceedings of the 26th Academic Council held on 18.5.2012

UnitIV NETWORKEDEMBEDDEDSYSTEMS 9hours
Introduction to networked embedded systems; Example networked embedded systems:
automobiles, factory automation systems; The OSI reference model; Types of network
fabrics; Network performance analysis; Basic principles of the Internet protocol;
Internet-enabled embedded systems; Controller Area Network; Embedded Ethernet
Controller; Inter Integrated Circuits(I
2
C)

UnitV INTERFACINGANDMIXEDSIGNALSYSTEMS 9hours
Digital-to-analog conversion; Analog-to-digital conversion; partitioning analog/digital
processing in interfaces; Digital processing and real-time considerations. ARM
Controllers;

Text/ReferenceBooks
1. Wayner Wolf, Computers as components Principles of embedded computing
system design, Morgan Kaufman Publishers, 2
nd
edition, 2008
2. Rajkamal, Embedded Systems-Application, Practice & Design, Tata McGraw Hill,
2003
3. Arnold S. Berger, Embedded Systems Design, CMP Books, 2001,

ModeofEvaluation Tests, Assignments, Seminars
RecommendedbytheBoardof
Studieson

DateofApprovalbytheAcademic
Council

SamplelistofExercises

Programming in 8051Handling Port
Waveform generation
ADC; DAC
Interrupt Programming
Stepper Motor Interfacing

Intel Atom based board:.
Accessing USB
Loaded OS
. Interfacing peripherals





136
Proceedings of the 26th Academic Council held on 18.5.2012

CSE222OPERATINGSYSTEMS

L T P C
3 0 2 4
VersionNo.
Course
Prerequisites:

Computer Architecture and Organization
Objectives
1. To provide a grand tour of the major operating system components.
2. To gain knowledge in process, memory and device management
3. To understand security issues related to OS.
ExpectedOutcome
The students will be able to
1. Understand and apply the concepts of CPU scheduling, synchronization and
deadlocks in real computing problems.
2. Analyze and investigate the local and global impacts of operating systems in
developing any computer based applications.
3. Suggest appropriate file system and disk organizations for a variety of computing
scenario.
4. Evaluate security mechanisms in operating computing systems

UnitI FUNDAMENTALS 9hours
Introduction, Computer-System Architecture, Operating-System Structure, Operating-
System Services and Operations, Distributed Systems, Special-Purpose Systems,
Computing Environments, User Operating System Interface, System Calls - Types,
System Programs, Operating System Design and Implementation, Operating System
Structure, Virtual Machines, Operating System Generation, System Boot.

UnitII PROCESSMANAGEMENT 9hours
Scheduling: Preemptive and non-preemptive scheduling; scheduling policies; processes
and threads; real-time issues; Concurrency: concurrent execution; states and state
diagrams; implementation structures; dispatching and context switching; interrupt
handling in a concurrent environment; Mutual exclusion: mutual exclusion problem;
deadlock detection and prevention; solution strategies; models and mechanisms
(semaphores, monitors, condition variables); synchronization; multiprocessor issues

UnitIII MEMORYMANAGEMENT 9hours


Review of physical memory and memory management hardware; overlays, swapping,
and partitions; paging and segmentation; page replacement policies; working set model
and thrashing; caching.

UnitIV SECONDARYSTORAGEMANAGEMENT 9hours
Device management: Characteristics of serial and parallel devices; abstracting device
differences; buffering strategies; direct memory access; recovery from failures. Disk
scheduling and management.
File systems: Fundamental concepts; content and structure of directories; file system
techniques; memory-mapped files; special-purpose file systems; naming, searching, and
access; backup strategies.


137
Proceedings of the 26th Academic Council held on 18.5.2012

UnitV SECURITYANDPROTECTION 9hours
Overview of system security; policy/mechanism separation; security methods and
devices; protection, access, and authentication; models of protection; memory
protection; encryption; recovery management. Cass Study: Linux, Windows and
Android.

Text/ReferenceBooks
1. Silberschatz, P.B. Galvin & G. Gagne, Operating system concepts, John Wiley, 8
th

edition, 2011.
2. W. Stallings, Operating systems, Prentice-Hall, 7
th
edition, 2011.

ModeofEvaluation : Tests, Assignments, Seminars

RecommendedbytheBoardof
Studieson

:
DateofApprovalbythe
AcademicCouncil :



Samplelistofexercises
1. Program to report the behavior of the OS to get the CPU type and model, kernel
version.
2. Program to get the amount of memory configured into the computer, amount of
memory currently available.
3. Implement the various process scheduling mechanisms such as FCFS, SJF, Priority,
round robin.
4. Implement the solution for reader writers problem.
5. Implement the solution for dining philosophers problem.
6. Implement Bankers algorithm.
7. Implement the first fit; best fit and worst fit file allocation strategy.
8. Write a program to create processes and threads.







138
Proceedings of the 26th Academic Council held on 18.5.2012

CSE323COMPUTERNETWORKS

L T P C
3 0 2 4
VersionNo.


Course
Prerequisites

: Operating Systems
Objectives
1. To study the foundational principles, architectures, and techniques employed in
computer networks.
2. To study the concepts of communication networks, protocols and their performance

ExpectedOutcome
Students shall be able to
1. Understand the working of Intranet, LAN, WAN, MAN setups, different topologies
(fundamental knowledge).
2. Analyze the local and global impact of networks and to gain familiarity with common
networking protocols and algorithms
3. Use the knowledge of network protocols and its performance in modeling computer
networks.

UnitI INTRODUCTIONTOCOMPUTERNETWORKS 9hours
Networking principles; switching - circuit switching, packet switching, frame relay, cell
switching, multiple access.

UnitII COMMUNICATIONSNETWORKPROTOCOLS 9hours
Network protocol (syntax, semantics, and timing); Protocol suites (OSI and TCP/IP);
Layered protocol software(stacks): Physical layer networking concepts; data link layer
concepts; network layer concepts; transport and application layer concepts; Network
Standards and standardization bodies.

UnitIII LOCALANDWIDEAREANETWORKS 9hours
LAN topologies (bus, ring, star), LAN technologies (Ethernet, token Ring, Gigabit
Ethernet), Error detection and correction, Carrier sense multiple access networks
(CSMA), Large networks and wide areas, Protocols (addressing, congestion control,
virtual circuits, quality of service). Internet - addressing, routing, end point control;
Internet protocols - IP, TCP, UDP, ICMP, HTTP, CIDR.

UnitIV ROUTINGANDCONGESTIONCONTROLALGORITHMS 9hours
Flooding; Minimal spanning trees; Bellman Ford, Dijkstra's, OSPF, BGP shortest path
algorithms; The leaky bucket, Floyd Warshall and Random Early Detection congestion
methods; Data security and integrity: Fundamentals of secure networks;
cryptography; Encryption and privacy: Public key, private key, symmetric key;
Authentication protocols; Packet filtering; Firewalls; Virtual private networks;
Transport layer security.




139
Proceedings of the 26th Academic Council held on 18.5.2012

UnitV NETWORKMANAGEMENTANDPERFORMANCEANALYSISOF
NETWORKS
9hours
Overview of the issues of network management; Domain names and name services;
Issues for Internet Service Providers (ISPs); Quality of service issues: performance,
failure recovery.

Text/ReferenceBooks
1. W. Stallings, Data & Computer Communications, Prentice-Hall, 9th edition, 2010.
2. S. Tanenbaum, Computer networks, Prentice-Hall, 5
th
edition, 2010.
3. Behrouz A Forouzan, Data Communications and Networking, Tata Mc-grawhill,
2007.
4. J.Walrand and P.Varaiya, High Performance Communication Networks, Harcourt
Asia (Morgan Kaufmann), 2000.
5. J.F.Kurose and K.W.Ross, Computer Networking: A Top-Down Approach
Featuring the Internet, Pearson Education, 3
rd
edition, 2004.
6. D. E. Comer and D.L. Stevens, Internetworking with TCP/IP, Vol.1, Prentice-Hall,
5
th
edition, 2005.

ModeofEvaluation : Tests, Assignments, Seminars.

RecommendedbytheBoardof
Studieson

:
DateofApprovalbythe
AcademicCouncil :













140
Proceedings of the 26th Academic Council held on 18.5.2012


Samplelistofexercises

1. Write a program to display the servers date and time details at the client end.
2. Write a program to display the clients address at the server end.
3. Write a program to implement an echo UDP server.
4. Write a program to develop a simple Chat TCP and UDP application.
5. Write a program to capture each packet and to examine its checksum field.

6. Network layer concepts; to be done with only computer
a. Configuration of IP addresses
b. Configuration of Subnet mask
c. Configuration of Gateway
d. Setting up LAN
e. Connecting two or more different LAN with different subnet mask
f. Making computer to work like router/gateway with the help of IP address

7. Protocol analyzer using ethereal
a. Capturing and analyzing Ethernet frames
b. HTTP GET/response interaction
c. Analysis of ICMP and Ping
d. Analysis of ICMP and Trace route
e. Capturing a bulk TCP transfer from your computer to a remote
server

8. Additional activities (Optional)
a. Compute checksum fields using CRC-12 and examine the same during the
frame transmission.
b. Implementation of sliding window protocol as part of DLC.
c. IPv4 and IPv6 protocol testing and implementation.
d. TCP and UDP protocol testing and implementation.
e. SNMP implementation
f. SMTP implementation
g. RSA public key and private key encryption and decryption
h. Data compression using Huffman codes.






141
Proceedings of the 26th Academic Council held on 18.5.2012

CSE309PROGRAMMINGLANGUAGETRANSLATORS

L T P C
3 1 0 4
VersionNo.


Course
Prerequisites:
Computer Architecture and Organization
Theory of Computation

Objectives
1. To provide foundation for study of high performance parallel compilers and
compiler design implementation.
2. To make students familiar with lexical analysis and parsing techniques.
3. To understand the principles of code optimization techniques.
4. To provide fundamental knowledge of various language translators.

ExpectedOutcome
Students shall be able to
1. demonstrate the functioning of a Compiler and to develop a firm and enlightened
grasp of concepts such as higher level programming, assemblers, automata theory,
and formal languages, languages specifications, data structure and algorithms
2. Analyse the local and global impact of translators.
3. Develop language specifications using context free grammars (CFG).
4. Apply the ideas, the techniques, and the knowledge acquired for the purpose of
developing software systems

UnitI INTRODUCTIONTOCOMPILATIONANDLEXICALANALYSIS 9+3hours
Introduction to programming language translators, structure of a compiler, applications
of compiler technology, programming language basics, Lexical Analysis phase: - Design
issues-patterns, lexemes, Tokens-attributes- specification of tokens, Regular
expressions and Finite state automata, Optimization of DFA-based pattern matchers.

UnitII SYNTAXANALYSIS 9+3hours


Role of parser- Formal definition of grammars, Parse Tree- Ambiguity- Elimination of
ambiguity- Top down parsing: Recursive-Descent parsing, Non- recursive predictive
parsing; LL(1) grammars, Bottom-Up parsing:- Shift-Reduce parsers, LR parsers:-
Construction of SLR parser tables and parsing , CLR parsing-LALR parsing- Syntax
errors-YACC.

UnitIII SEMANTICS&RUNTIMEENVIRONMENTS 9+3hours


Syntax-directed definitions (SDD) , Evaluation order for SDD, Applications of Syntax
directed translation (SDT), SDT Schemes, Implementation of L-attributed SDD. Run
time environments: Storage allocation, stack allocation of space, Access to non local
data on the stack, heap management, introduction to garbage collection,

UnitIV INTERMEDIATECODEGENERATION&OPTIMIZATION 9+3hours
Variants of syntax trees, three address code, types and declarations, translation of
expressions, type checking, control flow, back patching, switch statements, intermediate
code for procedures, Loop optimizations.


142
Proceedings of the 26th Academic Council held on 18.5.2012

UnitV CODEGENERATION&OTHERTRANSLATIONSISSUES 9+3hours
Principal sources of optimization, introduction to data flow analysis, loops in flow
graphs, region based analysis, issues in the design of a code generator, target language,
basic blocks and flow graphs, optimization of basic blocks, peep hole optimization,
register allocation and assignment, instruction selection by tree rewriting.

Text/ReferenceBooks
1. A. V. Aho, Monica S. Lam, Ravi Sethi and Jeffrey D. Ullman, Compilers: Principles,
techniques, & tools, Second Edition, Pearson Education, 2007.
2. K. D. Cooper and L. Torczon, Engineering a compiler, Morgan Kaufmann, 2
nd
edition,
2011.
3. Steven S.Muchnick Advanced Compiler design implementation Elsevier Science
India, 2003.

ModeofEvaluation : Tests, Assignments, Seminars
RecommendedbytheBoard
ofStudieson

:
DateofApprovalbythe
AcademicCouncil :
















143
Proceedings of the 26th Academic Council held on 18.5.2012

CSE418GRAPHICSANDMULTIMEDIA L T P C
3 0 2 4
VersionNo.


Course
Prerequisites:

Linear Algebra

Objectives
1. To introduce fundamental concepts of computer graphics and multimedia
2. To explore two dimensional and three dimensional transformations
3. To provide exposure to various interactive input methods
4. To pioneer the applications of computer graphics
ExpectedOutcome
Students will be able to
1. Analyze a problem scenario, identify, define and evaluate the appropriate HCI
requirements in any user interactive system.
2. Identify, formulate, analyze, design and interpret data in user interactive
applications.
3. Apply mathematical foundations, algorithmic principles, and computer graphics
theory in the modeling and design of HCI systems.

UnitI FUNDAMENTALS 9hours
Graphic systems: Introduction to Computer Graphics - Raster and vector graphics
systems; physical and logical input output devices - video display devices; simple color
models; Color quantization; structure and use of fonts; font generation - Line and circle
generation algorithms - sampling techniques and anti-aliasing. - Scan conversion of 2D
primitives.

UnitII 2D3DREPRESENTATIONANDMANIPULATION 9hours


2D Transformation: Translation, rotation, scaling, reflection and shearing Viewing
and Clipping - windowing homogeneous coordinates - affine transformations -
viewing transformation;

3DTransformation: translation, rotation, scaling, reflection, shearing Modeling and
modeling transformation 3D Viewing Projection Projection volumes.

UnitIII GEOMETRICMODELLINGANDRENDERING 9hours


Spline Representation Bezier curves and surfaces - Hidden surface removal methods:
Depth buffer method, A-Buffer method, Scan line method, Depth sorting method, BSP
Tree method, Area Subdivision method, Octree method, ray casting method.

UnitIV INTRODUCTIONTOMULTIMEDIA 9hours
Branch-overlapping Aspects of Multimedia, Content, Global Structure, Multimedia-
Media and Data Streams, Medium, Main Properties of a Multimedia System, Traditional
Data Stream Characteristics, Data Streams Characteristics for Continuous Media,
Information Units.



144
Proceedings of the 26th Academic Council held on 18.5.2012

UnitV AUDIO,VIDEOANDANIMATION 9hours
Sound Concepts - Music - Speech - Computer-based Animation - Data Compression
storage Space - Coding Requirements, Source, Entropy, and Hybrid Coding, Some Basic
Compression Techniques-JPEG, H.261, MPEG, DVI

Text/ReferenceBooks
1. Donald Hearn and Pauline Baker, Computer Graphics, Prentice Hall, New Delhi,
2012.
2. Ami Chopine, 3D Art Essentials: The fundamentals of 3D modeling and animation,
Elsevier, 2011.
3. Foley J.D., Van Dam A, "Fundamentals of Interactive Computer Graphics", Addison
Wesley, 1990
4. Amarendra N Sinha, Arun D Udai, Computer graphics, Tata McGraw-Hill, 2008.
5. Ralf Steinmetz and Klara Mahrstedt, "Multimedia computing, communications and
Applications", Pearson Education Asia, 1
st
reprint 2001.
6. K. Rao, "Multimedia Communication Systems: Techniques, Standards, and
Networks", Prentice Hall, 1
st
edition, 2002

ModeofEvaluation : Tests, Assignments, Seminars.

RecommendedbytheBoardof
Studieson :

DateofApprovalbythe
AcademicCouncil

:



Samplelistofexercises

1. Line Drawing algorithms Bresenham , DDA
2. Circle Drawing algorithms 8-Point Symmetry, Midpoint circle
3. Ellipse Drawing algorithms
4. Geometrical Transformation
5. Clipping algorithms
6. Compression algorithms


145
Proceedings of the 26th Academic Council held on 18.5.2012


CSE324DATABASESYSTEMS L T P C
3 0 2 4
VersionNo.

Course
Prerequisites:


Data Structures and Algorithms

Objectives
1. To train the fundamental concepts of database management system, database
modeling and design, SQL, PL/SQL, system implementation techniques.
2. To enable students to model ER diagram for any customized applications
3. To provide knowledge on distributed databases, concurrency techniques, federated
systems and active databases.

ExpectedOutcome
Students will be able to
1. Perform project planning, analysis, design, implementation and testing in group / as
an individual for any real time information system with all realistic constraints.
2. Solve issues of information systems using the learnt database principles.
3. Construct database application using current tools and techniques

UnitI DATABASESYSTEMS 9hours
History and motivation for database systems characteristics of database approach -
components of database systems; database architecture and data independence.

UnitII DATAMODELING 9hours


ER Model Relational Model Mapping ER model to a relational schema entity and
referential integrity - Database query languages: Overview of database languages;
Relational Algebra SQL

UnitIII RELATIONALDATABASEDESIGN 9hours


Guidelines for Relational Schema - functional dependency; normal forms; multi-valued
dependency; join dependency

UnitIV QUERYPROCESSINGANDTRANSACTIONPROCESSING 9hours
SQL queries into Relational Algebra heuristic query optimization Introduction to
Transaction Processing Transaction and System concepts - Desirable properties of
Transactions - Concurrency Control : concepts and Two-Phase Locking

UnitV PHYSICALDATABASEDESIGN 9hours
Storage and file structure: indexed files; hashed files; signature files; b+-trees; files with
dense index; files with variable length records.

Text/ReferenceBooks
1. R. Elmasri & S. B. Navathe, Fundamentals of Database Systems, Addison Wesley, 6
th

Edition, 2011

146
Proceedings of the 26th Academic Council held on 18.5.2012

2. A. Silberschatz, H. F. Korth & S. Sudershan, Database System Concepts, McGraw Hill,
6
th
Edition 2010
3. C. J. Date, An Introduction to Database Systems, Addison Wesley,8
th
edition, 2003
4. H. Garcia et al., Database System Implementation, Prentice Hall, 2000

ModeofEvaluation : Tests, Assignments, Seminars.

RecommendedbytheBoardof
Studieson :
DateofApprovalbythe
AcademicCouncil :

Samplelistofexercises
1. a) Create a table EMP with the following fields.
EName
Eno.
Salary
DeptNo
Address
Dname
b) Insert 5 records into EMP
c) ALTER EMP table i) varying size of Eno field
ii) adding a new field job
d) Delete the table EMP

2. Create a table EMP with the above mentioned fields.
i) Insert 5 records into EMP
ii) Update the salary of the Employees by 10% hike
iii) Delete the employees whose name is AAA

3. Create a table ORDER with the following fields and constraints.
ORDER
Column Name Constraint Name Constraint Type
Order-no pk-order-no PRIMARY KEY
Item-name itn UNIQUE
Qty ck-aty CHECK
(25<QTY<50)
rate-unit Nn-rate NOT NULL

4. Using Ex 3.
1. Drop unique constraint for item-name
2. Disable the constraint Nn-rate
3. Insert a record with NULL values for rate unit
4. Enable the constraint with NULL value existing on rate-unit

5. Create a table EMP mentioned above and test all the arithmetic functions and
character functions

147
Proceedings of the 26th Academic Council held on 18.5.2012

6. Add a field date-of-birth to EMP table and test all the date functions.

7. i) Modify EMP table adding a new field BONUS, update it using NVL
ii) Retrieve the employees whose name starts with S.
iii) Select all the employees who are working in IT department.

8. i) Using EMP table find the employee getting maximum salary
ii) Find the employee whose salary is minimum
iii) Find the sum of salaries of all the employees working in ACCOUNTS department.

9. Create a table DEPT with the following fields
DNo. Primary Key
DName
Modify EMP table adding a foreign key constraint on DeptNo.

i) Insert 6 records into Dept.
ii) Implement the following Join operations
a) Self Join
b) Equi Join
c) Non Equi Join
d) Outer Join
e) Natural Join

10. Using EMP and DEPT, implement all type of view techniques.
a) Row subset view
b) Column subset view
c) Row column subset view
d) Grouped view
e) Joined view
f) With check option

11. Using EMP and DEPT
a) Create a sequence to insert the empno in EMP table
b) Create a synonym for the above two tables

PARTB
1. Create a cursor to update the salary of employees in EMP table
2. a) Write a PL/SQL program to raise an Exception
i) When the bonus exceeds salary
b)Write a PL/SQL program to test the built-in Exceptions
3. Write a procedure to insert a record into ORDER table by validating qty limit of the
item and also check whether that item exists.
4. Write a function to find substring.
Create a trigger which checks whether employee with Emp_no is present in the
Employee table before inserting into EMP.

PARTC
Development of mini-projects with VB as front-end.
148
Proceedings of the 26th Academic Council held on 18.5.2012


CSE326INTERNET&WEBPROGRAMMING

L T P C
3 0 2 4
VersionNo.

Course
Prerequisites:



Object Oriented Paradigm and Programming, Computer Networks

Objectives
1. To understand the basic concepts of web programming and internet
2. To understand how the client-server model of Internet programming works.
3. To develop interactive, client-side, executable web applications.

ExpectedOutcome
The students will be able to
1. Understand, analyze and evaluate a system using Internet / web programming
concepts.
2. Identify and formulate and solve web related problems.
3. Use techniques, skills and apply algorithmic principles to design web based
applications

UnitI INTRODUCTION 9hours
Internet Overview- Networks - Web Protocols HTTP HTTPS- FTP- TCP/IP Web
Organization and Addressing - Web Browsers and Web Servers -Security and
Vulnerability-Web System Architecture URL - Domain Name.

UnitII BASICSOFWEBDEVELOPMENT 9hours


HTML Forms Frames Tables Web Page Design Cascading Style Sheet
(CSS)Basics - JavaScript Introduction Data Types- Operators and expressions- Control
Structures Functions Arrays Objects.

UnitIII DYNAMICWEBDEVELOPMENT 9hours


Server Side Scripting Languages Introduction to JSP, .NET, CGI, Python PHP
Language Basics - PHP Language Basics - Variables - Data Types - Constants
Conditional Statements - Arrays - Functions.

UnitIV DATABASECONNECTIVITY 9hours
Database connectivity, Introduction to Database- Database Management Systems
Oracle DB2-PostgreSQL-MySQL Introduction MySQL Queries - MySQL and PHP
Database Manipulation ( Connect, Insert, Select, Update and Delete Operations).

UnitV INTERNETTECHNOLOGIES 9hours
File Handling File Uploading Cookie and Session Email Basics - Email with
attachment Image Handling- Interactive Web Application using Ajax and PHP.


149
Proceedings of the 26th Academic Council held on 18.5.2012

Text/ReferenceBooks
1. Thomas A. Powell, The Complete Reference HTML & CSS 5
th
edition, 2010.
2. Steve Suehring, JavaScript Step by Step, PHI, 2
nd
edition, 2010.
3. Core PHP programming, Leon Atkinson and Zeev Suraski, Pearson Education, Delhi,
2004.
4. Michael K. Glass, Yann Le Scouarnec, Elizabeth Naramore, Gary Mailer, Jeremy Stolz,
Jason Gerner, Beginning PHP, Apache,MySQL WebDevelopment, Wrox Publications,
2004
5. Hugh E. Williams and David Lane, Web Database Applications with PHP, and MySQL,
2nd Edition, O'Reilly, 2004
6. Deitel Deitel Nieto, Internet & World Wide Web How To Program, 5
th
edition, 2012.

ModeofEvaluation : Tests, Assignments, Seminars.



RecommendedbytheBoardof
Studieson

:
DateofApprovalbytheAcademic
Council :


Samplelistofexercises

IHYPERTEXTMARKUPLANGUAGE(HTML)
Activity -1 : Introduction to HTML
Activity - 2 : Tags in HTML
Activity - 3 : Frames in HTML
Activity - 4 : Forms in HTML
Activity 5 : HTML 5 Introduction
II.CASCADINGSTYLESHEET(CSS)
Activity -6: Design a Web page with Styling Lists
Activity -7: Write a CSS code to create rounded corner in your web page and also
consider the browser
compatibility while designing it.
Activity -8: Write a CSS code to design a web page using horizontal drop down
menu.
Activity -9: Write a CSS code to design a web page with following style (Use
150
Proceedings of the 26th Academic Council held on 18.5.2012

HTML Grouping Tags <div> and
<span>).
Activity -10: Design the following Table using HTML and CSS code (Change the
row color while hover the mouse
cursor).

III.JAVASCRIPT
Activity-11 : JavaScript Basics
Activity-12: Cookie and Dialog Box
Activity-12: Function in JavaScript
Activity-13: Digital Clock using java Script
Activity- 14 : Form Validation and Event Handling

IV.PHP/MYSQLPRGRAMMING
Activity-15: PHP Basics
Activity-16: PHP & MYSQL
Activity-17: PHP & Regular Expressions
Activity-18: PHP & Web Applications
Activity-19: PHP Web Page Visitor Count
Activity-20: PHP File Processing
Activity-20: Email Application








151
Proceedings of the 26th Academic Council held on 18.5.2012


CSE325SOFTWAREENGINEERING

L T P C
3 0 2 4
VersionNo.


Course
Prerequisites:


Database Systems

Objectives
1. To introduce the fundamental concepts of process, product and project.
2. To make familiar with the principles of software engineering and case tools.
3. To develop appropriate knowledge of requirements specification and design
solutions for the given problem.
4. To introduce the different testing strategies, tools and techniques.

ExpectedOutcome
The Students will be able to
1. Apply the principles of knowledge of science and computing appropriate to software
development.
2. Analyze a problem and develop appropriate design solutions to a given problem.
3. Implement a computer based system to meet the desired needs of the customer
4. Apply CASE tools for developing quality products

UnitI FundamentalsofSoftwareEngineering 6hours
Software Engineering Fundamentals; Software processes: Software life-cycle and
process models; Agile Methodology, Prototyping; Process assessment models-System
Engineering. Introduction to Software Project Management.

UnitII RequirementsEngineering 12hours


Software requirements and specifications: Requirements elicitation techniques-
Challenge of requirement elicitation; Functional and nonfunctional requirements; User
requirements, System requirements, Requirements analysis modeling techniques-
System Models; Requirement validation and software requirement specification
document. - Basic concepts of formal specification techniques.

UnitIII SoftwareDesign 12hours


Fundamental design concepts and principles; Design characteristics; Modularity;
Architectural design - System structuring, Control models; Structured design; Object-
oriented analysis and design; Introduction to User interface design.

UnitIV SoftwareValidationandMaintenance 9hours
Testing fundamentals, Verification and Validation, Black-box and white-box testing
techniques; Test plan; test case generation; Inspections. Softwareevolution:Software
maintenance- Characteristics of maintainable software; Introduction to Reengineering,
Legacy systems and Software configuration management.



152
Proceedings of the 26th Academic Council held on 18.5.2012

UnitV SoftwareQualityandProcessImprovement 6hours
Software quality assurance; software Quality management; Process Improvement;
Overview of SEI-CMM, ISO 9000, CMMI, PCMM, TQM and Six Sigma;

Text/ReferenceBooks
1. Ian Sommerville, "Software Engineering", 9
th
Edition, Addison-Wesley, 2010
2. R. S. Pressman, Software Engineering, a practitioners approach, 7
th
edition, McGraw
Hill, 2010
3. Watts Humphrey, Managing the Software Process, 1989.

ModeofEvaluation : Tests, Assignments, Seminars.



RecommendedbytheBoardof
Studieson :

DateofApprovalbythe
AcademicCouncil :


Activitiestobecarriedout

The Students have to form a team size of 2. Each team is assigned with a system for
development.

The system development should follow all the software engineering principles.
Aim and Objective of the proposed System
Process Model-Milestone1
Feasibility Analysis
Requirements Elicitation
Software Requirements Specification Document-Milestone 2
Architectural Design
Detailed Design
Software Design Specification-Milestone 3
User Interface development-Milestone-4
Implementation of 2 or 3modules-Milestone-5
Test plan and test cases
Test Report-Milestone6
CASE Tools used Milestone 7
Project Report-Milestone 8

At the end of the semester, the above milestones has to be documented and a report has
to be submitted.



153
Proceedings of the 26th Academic Council held on 18.5.2012

CSE221MICROPROCESSORANDINTERFACING

L T P C
3 0 2 4
VersionNo.

Course
Prerequisites:

Computer Architecture and Organization

Objectives
1. To introduce fundamentals of 8086, 80286, 80386 and Pentium processors,
2. To understand different peripheral devices.
3. To acquire knowledge on assembly language programs and peripheral interfacing
techniques.
ExpectedOutcome
Students will be able to
1. Analyze the types of microprocessors; develop assembly level programs for
microprocessor based applications.
2. Apply modern engineering tools and techniques for solving issues of hardware
design in microcontroller based applications.

UnitI 8086ARCHITECTURE 9hours
Introduction to Microprocessor: Architecture, Minimum and Maximum mode
operations of 8086, Addressing modes, Instruction set, interrupts.

UnitII ASSEMBLYLANGUAGEPROGRAMMMINGOF8086 9hours
Assembler Directives, Simple Programs using Assembler, Macro-Procedures, ALP using
FOR Loop, WHILE, REPEAT and IF-THEN-ELSE Features- Interrupt Programming-
Interrupts-BIOS-DOS-System call-Device management-File management-Interfacing
with C.

UnitIII COPROCESSOR 9hours
Architecture of 8087-Interfacing with 8086-Data types-Instructions-Programming.

UnitIV PERIPHERALSANDINTERFACING 9hours
Peripherals & Interfacing With 8086: Serial & parallel I/O (8251A and 8255),
Programmable interval timer (8253), Programmable DMA controller (8257),
programmable interrupt controller (8259A), Keyboard and display controller (8279).

UnitV 80286AND80386,PROCESSOR 9hours
80286 Processor-Features of 80286, internal architecture of 80286, real addressing
mode, virtual addressing mode, privilege, protection, Features of 80386Dx, internal
architecture of 80386Dx, register organization of 80386Dx.

Text/ReferenceBooks
1. A.K. Ray and K.M. Bhurchandi Advanced Microprocessors and Peripherals, 2
nd

edition, Tata McGraw Hill, 2006.
2. K Uday Kumar, B S Umashankar, Advanced Micro processors & IBM-PC Assembly
Language Programming, Tata McGraw Hill, 2003

3. Barry B Bray, The Intel Micro processor 8086/8088, 80186,80286, 80386 and
154
Proceedings of the 26th Academic Council held on 18.5.2012

80486-Arcitecture, programming and interfacing, PHI, 5
th
Edition,2005
4. Douglas V. Hall,Microprocessors and Interfacing Programming and Hardware. Tata
McGraw Hill, 2007.
5. Mohamed Rafiquazzaman, Microprocessor and Microcomputer based system design,
Universal Book stall, New Delhi, second edition, 1995.
6. Peter Abel, IBM PC Assembly language & Programming, PHI, 5
th
Edition, 2001

ModeofEvaluation : Tests, Assignments, Seminars.
RecommendedbytheBoard
ofStudieson :
DateofApprovalbythe
AcademicCouncil ;

ListofExperiments
1. Study Experiments
i) Study of 8086 Architecture
ii) Study of 8255 PPI
iii) Study of 8253 PIT
iv) Study of 8279 PKI
v) Study of 8259 PIC
2. Write an ALP to find out factorial of a given hexadecimal number using 8086 MP
Data: OAH, OFH, 1OH
3. Write an ALP to perform 16 bit arithmetic operations (ADD, SUB, MUL, DIV)
4. Write an ALP to generate the sum of first N natural numbers using 8086 MP
5. Write an ALP to convert given hexadecimal number to binary using 8086 MP
Data: ABH, CDH, 101H
6. Write an ALP to convert given binary number to hexadecimal number using 8086
MP
Data: 101010102, 111111112, 11002, 11112
7. Write an ALP to order give set of hexadecimal numbers in ascending and descending
order
Data: 0AH, 0FH, 0DH, 10H,02H
8. Write an ALP to move block of data from locations 1200H-1205H to 2200H 2205H
9. Write an ALP to reverse the given string
Data: WELCOME
10. Write an ALP to generate the following series 1+1/x+1/x
3
+1/x
5
+ ..
11. Write an ALP to generate square wave using 8255 PPI
12. Write an ALP to generate rate generator using 8253 PIT
13. Write an ALP to interface keyboard with 8086 using 8279 PKI
14. Write an ALP to display the given message using 8279 PKI
Message: COMPUTER SCIENCES
15. Write an ALP to interface analog to digital converter.
155
Proceedings of the 26th Academic Council held on 18.5.2012


CSE327IMAGEANDVISIONCOMPUTING

L T P C
3 0 0 3
VersionNo.
Course
Prerequisites:

Linear Algebra

Objectives
1. To introduce the basic concepts of digital image processing and image transforms
2. To explore the image enhancement, Image segmentation and restoration techniques

ExpectedOutcome
The students will be able to
1. Understand and apply the fundamental image processing techniques in analyzing
and defining image processing applications with an understanding of ethical and
social issues.
2. Apply and Implement image processing principles using available tools and
techniques in the construction of imaging applications

UnitI DIGITALIMAGEFUNDAMENTALSANDTRANSFORMS 8hours
Elements of digital image processing systems, Image sampling and quantization, Pixel
relationships, Introduction to mathematical tools used in digital image processing.
1D DFT, 2D DFT, FFT, Hadamard

UnitII IMAGEENHANCEMENTANDRESTORATION 12hours
Intensity Transformation Functions Histogram processing - Fundamentals of Spatial
Filtering - Smoothing and Sharpening spatial filters- Filtering in Frequency Domain -
Smoothing Filters and Sharpening filters in frequency domain Selective Filtering
Homomorphic Filtering Degradation Models Restoration in the presence of noise
only spatial filtering - Periodic noise reduction by frequency domain filtering - Inverse
Filtering

UnitIII OTHERIMAGEPROCESSINGOPERATIONS 12hours
Color Image Processing: Color fundamentals Color models Color image smoothing
and sharpening
Morphological Image Processing: Preliminaries Dilation and Erosion Opening and
Closing Basic morphological algoritms
Image Segmentation: Detection of Discontinuties Edge linking and Boundary Detection
Global Thresholding Adaptive Thresholding Region based Segmentation

UnitIV IMAGECOMPRESSION 8hours
Compression Models - Runlength, Huffman coding, Shift codes, arithmetic coding, bit
plane coding, transform coding, JPEG Standard, wavelet transform, predictive
techniques, Block truncation coding schemes, Facet modeling.

UnitV INTRODUCTIONTOCOMPUTERVISION 5hours
Computer Vision: Radiometric Properties of Light Local Shading Geometrical Image
Features Geometry of Multiple views
156
Proceedings of the 26th Academic Council held on 18.5.2012

Text/ReferenceBooks
1. Rafel C. Gonzalez and Richard E. Woods, Digital Image Processing, Prentice Hall, 3
rd

edition, 2007
2. Anil K. Jain, Fundamentals of Digital Image Processing, Prentice Hall of India, 1997.
3. William K. Pratt, Digital Image Processing, John Wiley, 4
th
edition, 2007.
4. Forsyth and Ponce: Computer Vision: A Modern Approach, 2
nd
edition, 2011.

ModeofEvaluation : Tests, Assignments, Seminars

Recommendedbythe
BoardofStudieson


:
DateofApprovalbythe
AcademicCouncil

:










157
Proceedings of the 26th Academic Council held on 18.5.2012


CSE328SOFTWAREPROJECTMANAGMENT LTPC
3003
VersionNo.
Course
Prerequisites:


Software Engineering
Objectives
At the end of the course, the student should get familiarize with the characteristics of a
project, project management principles, risk in environment and the management
challenges for effective project management.

ExpectedOutcome
1. The student will be able to understand and use the project management principles
across all phases of a project.
2. The students will be able to demonstrate competency in the management of a
project plan, especially in monitor and controlling a project schedule and budget,
tracking project progress.
3. The students will work as team member and as individual without affecting the
quality of project.
4. The students will share best practices and tools related to project management

UnitI AnoverviewofITProjectManagement: 9hours
Introduction, the state of IT project management, context of project management, need
of project management, project goals, project life cycle and IT development

UnitII Softwareprojects 9hours


Software projects-various type of projects-problems with software projects-an
overview of project planning project evaluation-project analysis and technical
planning-software estimation.

UnitIII Activityplanning 9hours
Project Management activities, Project planning and scheduling.

UnitIV RiskManagement 9hours
Risk Management-Resource allocation-Monitoring and Control. Team management,
Team organization and decision-making, Roles and responsibilities in a software team,
Project tracking, Team problem resolution.
UnitV ProjectEvaluation 9hours
Project administrative closure, project evaluation, project audit, Project Control, Project
Metrics.

Text/ReferenceBooks
1. Jack T. Marchewka, Information Technology Project Management, 4
th
edition, Wiley
India, 2012.
2. Mike Cotterell, Bob Hughes - Software Project Management - McGraw Hill Higher
Education, 5
th
edition, 2009.
3. Darel Ince, H.Sharp and M.Woodman - Introduction to Software Project Management
and Quality Assurance - Tata McGraw Hill, 2002.
158
Proceedings of the 26th Academic Council held on 18.5.2012

4. Ramesh.Gopalaswamy - Managing Global Projects - Tata MCGraw Hill - 2005
5. Humphrey, Watts - Managing the software process - Addison Wesley 2007.
6. R. S. Pressman : Software Engineering - A Practitioners approach - McGraw Hill - 7
th

edition, 2009.

ModeofEvaluation : Tests, Assignments, Seminars.

RecommendedbytheBoardof
Studieson:

DateofApprovalbytheAcademic
Council:


159
Proceedings of the 26th Academic Council held on 18.5.2012


CSE419MOBILECOMPUTING L T P C
3 0 0 3
VersionNo.
Course
Prerequisites:

Computer Networks and Internet & Web Programming

Objectives:
1. To study the basics of Wireless voice and data communications technologies.
2. To build working knowledge on various telephone and satellite networks.
3. To build knowledge on various Mobile Computing algorithms.
4. To build skills in working with Wireless application Protocols to develop mobile
content applications.

ExpectedOutcome
1. Understand the working principles of mobile communication networks
2. Use the knowledge of mobile network protocols and its performance in modeling
mobile communication networks.

UnitI WIRELESSCOMMUNICATIONFUNDAMENTALS 9hours
Introduction Wireless transmission Frequencies for radio transmission Signals
Antennas Signal Propagation Multiplexing Modulations Spread spectrum MAC
SDMA FDMA TDMA CDMA Cellular Wireless Networks .

UnitII TELECOMMUNICATIONNETWORKS 9hours


Telecommunication systems GSM GPRS DECT UMTS IMT-2000 Satellite
Networks - Basics Parameters and Configurations Capacity Allocation FAMA and
DAMA Broadcast Systems DAB - DVB.

UnitIII WIRLESSLAN 9hours
Wireless LAN IEEE 802.11 - Architecture services MAC Physical layer IEEE
802.11a - 802.11b standards HIPERLAN Blue Tooth.

UnitIV MOBILENETWORKLAYER 9hours
Mobile IP Dynamic Host Configuration Protocol - Routing DSDV DSR Alternative
Metrics.

UnitV TRANSPORTANDAPPLICATIONLAYERS 9hours
Traditional TCP Classical TCP improvements WAP, WAP 2.0.

Text/ReferenceBooks
1. Jochen Schiller, Mobile Communications, PHI/Pearson Education, Second Edition,
2009.
2. William Stallings, Wireless Communications and Networks, PHI/Pearson Education,
2007.
3. Kaveh Pahlavan, Prasanth Krishnamoorthy, Principles of Wireless Networks,
PHI/Pearson Education, 2006.
4. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, Principles of
160
Proceedings of the 26th Academic Council held on 18.5.2012

Mobile Computing, Springer, New York, 2008.
5. Hazysztof Wesolowshi, Mobile Communication Systems, John Wiley and Sons Ltd,
2009.

ModeofEvaluation : Tests, Assignments, Seminars.

Recommendedbythe
BoardofStudieson



DateofApprovalby
theAcademicCouncil























161
Proceedings of the 26th Academic Council held on 18.5.2012

CSE329MANAGEMENTINFORMATIONSYSTEM L T P C
3 0 0 3
VersionNo.
Course
Prerequisites

Objectives
1. To know the fundamentals of Management Information Systems.
2. To learn the principles of Information Sytem Design.
3. To develop an efficient MIS system.
4. To manage and secure MIS system

ExpectedOutcome
Students will be able to
1. Apply the principles of MIS to analyze, formulate, design for implementation and
evaluation of any computer based information systems.
2. Involve in continuous learning to solve issues of Information process and system
using the advanced tools and techniques.

UnitI Organizations,ManagementandtheNetworkedEnterprise 9hours
Information Systems in Global Business today, Global E-Business: How Businesses use
information system. Information Systems, Organizations and Strategy Systems. Ethical
and Social issues in Information System, Analyzing Business Resource for an Enterprise
System.

UnitII InformationtechnologyInfrastructure 9hours
Information Technology infrastructure and Emerging Technology, Foundation of
Business Intelligence: Databases and Information Management, Telecommunication,
the Internet and Wireless Technology, Securing Information System, Creating a new
Interned Business

UnitIII KeySystemApplicationfortheDigitalAge 9hours
Achieving operation Excellence and Customer Intimacy: Enterprise application, E-
Commerce: Digital Markets, Digital Goods, Managing knowledge, Enhancing Decision
making, Designing an Enterprise Information Portals

UnitIV BuildingandManagingSystems 9hours


Building Systems, Project Management: Establishing the Business value of Systems and
Managing Change, Managing Global System, Redesigning Business Processes for
Healthlite Yogurt Company

UnitV AdvancedconceptsinInformationSystem 9hours
Enterprise Resource Planning: introduction, various modules like Human Resources,
Finance, Accounting, Production & Logistics. Supply Chain Management, CRM,
Procurement, Management System Object Oriented modeling case studies.

162
Proceedings of the 26th Academic Council held on 18.5.2012

Text/ReferenceBooks

1. Management information systems James A, O Brian, 7
th
Edition, TMH Publisher,
2007.
2. Mangement Information Systems: Managing the Digital Firms: Kenneth C. Laudon,
Jane P. Laudon, Pearson Education, TMH, 2008.
3. Introduction to Information Systems, James A. O'Brien, Northern Arizona University
George M. Marakas, University of Kansas, 2007.
4. Information System for Modern Management - Ross and Clagget - Prentice-Hall of
India Pvt. Ltd. 2004
5. Enterprise Resourse Planning, Alexis Leon, TMH, 2007.

ModeofEvaluation : Tests, Assignments, Seminars.

RecommendedbytheBoard
ofStudieson

DateofApprovalbythe
AcademicCouncil
















163
Proceedings of the 26th Academic Council held on 18.5.2012


CSE330AGENTBASEDINTELLIGENTSYSTEMS

L T P C
3 0 0 3
VersionNo.
Course
Prerequisites:


Data Structures and Algorithms
Objectives
1. To study the fundamental concepts, principles and techniques employed in agent
based systems.
2. To study the concepts of artificial intelligence, methods, algorithms and their
performance

ExpectedOutcome
Students shall be able to
1. Understand the about agents and need of intelligent systems
2. Analyze the impact of inference mechanisms through knowledge representation and
reasoning.
3. Use the learning algorithms to apply and resolve in real world problems.

UnitI INTRODUCTION 9hours
Definitions - History - Intelligent Agents - Structure-Environment - Basic Problem
Solving Agents- Formulating -Search Strategies - Intelligent search - Game playing as
search.

UnitII KNOWLEDGEBASEDAGENTS 9hours
Representation - Logic-First order logic - Reflex Agent - Building a knowledge Base -
General Ontology -Inference - Logical Recovery.

UnitIII PLANNINGAGENTS 9hours
Situational Calculus - Representation of Planning - Partial order Planning- Practical
Planners Conditional Planning - Replanning Agents.

UnitIV AGENTSANDUNCERTAINITY 9hours
Acting under uncertainty - Probability Bayes Rule and use - Belief Networks - Utility
Theory - Decision Network- Value of Information - Decision Theoretic Agent Design.

UnitV HIGHERLEVELAGENTS 9hours
Learning agents - General Model - Inductive Learning - Learning Decision Trees-
Reinforcement Learning -
Knowledge in Learning - Communicative agents -Types of Communicating agents -
Future of AI


164
Proceedings of the 26th Academic Council held on 18.5.2012

Text/ReferenceBooks
1. Stuart Russell and Peter Norvig Artificial Intelligence - A Modern Approach, Prentice
Hall, 3
rd
edition, 2011.
2. Patrick Henry Winston, Artificial Intelligence, 3rd Edition, AW, 1999.
3. Elaine Ric, Kevin Knight and Shiv Shankar B. Nair, Artificial Intelligence, 3
rd
edition,
Tata McGraw Hill, 2009.
4. George F. Luger, Artificial Intelligence-Structures and Strategies for Complex
Problem Solving, 6
th
edition, Pearson, 2008.

ModeofEvaluation : Tests, Assignments, Seminars.



RecommendedbytheBoardof
Studieson

DateofApprovalbythe
AcademicCouncil

















165
Proceedings of the 26th Academic Council held on 18.5.2012


CSE404BIOINFORMATICS

L T P C
3 0 0 3
VersionNo.

Course
Prerequisites:

Algorithm Design and Analysis

Objectives
To cover the basics of Bio informatics, Dynamic programming, Evolutionary trees & DNA
sequencing.
ExpectedOutcome
The students will be able to
1. Understand and explain the fundamentals of Bio-informatics,
2. Know Dynamic programming, searching algorithms, Evolutionary trees, DNA
mapping, DNA sequencing and Gene predictions
3. Implement evolutionary computing for the Bio-informatics domain

UnitI Introduction 9hours
Introduction, databases (GeneBank, Swiss-Prot, MEDLINE, PUBMED), human genome,
Pairwise alignments (local, global), DNA Search for sequences in databases, Dynamic
programming.

UnitII AlignmentandSequencing 9hours


Substitution matrices (PAM/BLOSUM), Sequence Alignment, Multiple Sequence
Alignment, Phylogenetic Tree, Neighbor-Joining algorithms, Sequence motifs, Sequence
profiles.

UnitIII Proteomics 9hours


Protein Sequence alignment, Protein secondary structure, Building PSSM, Algorithms for
SS predictions, Protein tertiary structure, Homology modeling and fold, recognition
methods, Protein domains and protein families, Protein function prediction, RNA
secondary structure, Energy based RNA folding prediction methods, MFOLD.

UnitIV MicroarrayDataAnalysisandGenomics 9hours
Microarray Data and gene expression analysis, Supervised and Unsupervised methods
for analyzing microarray data, Comparative genomics, Biological networks, Metabolic
pathways.

UnitV Bioinformaticstools 9hours
The Human Genome Browser, BLAST, CLUSTAL, CLUSTER 3.0, GenePredict, GeneMiner,
Java TreeView, NeuralWare Predict.

Text/ReferenceBooks
1. Gibas, C., Jambeck, P. Developing Bioinformatics Computer Skills. O'Reilly, 2001.
2. Lesk, A. M. Introduction to Bioinformatics. Oxford University Press, 2002.
3. Mount, D.W. Bioinformatics: Sequence and Genome Analysis. 2nd ed., Cold Spring
Harbor Laboratory Press, 2004.
166
Proceedings of the 26th Academic Council held on 18.5.2012

4. Brazma alvis , Causton helen., Quackenbush John, Microarray gene expression data
analysis: a beginner`s guide, Blackwell publication London, 2004.
ModeofEvaluation : Tests, Assignments, Seminars.

RecommendedbytheBoard
ofStudieson

DateofApprovalbythe
AcademicCouncil





















167
Proceedings of the 26th Academic Council held on 18.5.2012

CSE405PARALLELALGORITHMS L T P C
3 0 0 3
VersionNo.
Course
Prerequisites:

Computer Architecture and Organization and Algorithm
Design and Analysis
Objectives
1. To provide fundamentals in design, analysis, and implementation, of high
performance computational science and engineering applications.
2. To gain knowledge on parallel algorithms and their impact in engineering problem.
ExpectedOutcome
The students will be able to
1. Develop knowledge and skills concerning applications of high-performance
computing systems
2. Identify parallel computing requirements.
3. Use parallel programming concepts in developing real-world applications.
UnitI INTRODUCTION 9hours
Computational Science and Engineering Applications; characteristics and requirements,
Review of Computational Complexity, Performance: metrics and measurements,
Granularity and Partitioning, Locality: temporal/spatial/stream/kernel, Basic methods
for parallel programming
UnitII HIGHENDCOMPUTERSYSTEMS 9hours
Memory Hierarchies, Multi-core Processors: Homogeneous and Heterogeneous, Shared-
memory Symmetric Multiprocessors, Vector Computers, Distributed Memory
Computers, Supercomputers and Pataskala Systems, Application Accelerators /
Reconfigurable Computing.
UnitIII PARALLELALGORITHMS 9hours
Parallel models: ideal and real frameworks, Basic Techniques: Balanced Trees, Pointer
Jumping, Divide and Conquer, Partitioning, Regular Algorithms: Matrix operations and
Linear Algebra.
UnitIV RANDOMIZEDALGORITHMS 9hours
Randomization: Parallel Pseudo-Random Number Generators, Sorting, Monte Carlo
techniques
UnitV PARALLELPROGRAMMING 9hours
Revealing concurrency in applications, Task and Functional Parallelism, Task
Scheduling, Synchronization Methods, Parallel Primitives (collective operations), SPMD
Programming (threads, OpenMP, MPI), I/O and File Systems, Partitioning Global
Address Space (PGAS) languages (UPC, Titanium, Global Arrays)
Text/ReferenceBooks
1. Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar, Introduction to
Parallel Computing, 2nd edition, Addison-Welsey, 2003.
2. David A. Bader (Ed.), Petascale Computing: Algorithms and Applications, Chapman &
Hall/CRC Computational Science Series, 2008.
ModeofEvaluation Tests, Assignments, Seminars
RecommendedbytheBoardof
Studieson
DateofApprovalbythe
AcademicCouncil
168
Proceedings of the 26th Academic Council held on 18.5.2012

CSE314ADVANCEDCOMPUTERARCHITECTURE L T P C
3 0 0 3
VersionNo.
Course
Prerequisites:


Computer architecture, Programming Language Translators.

Objectives
1. To provide an overview of future computing architectures
2. To provide a foundation for more advanced studies of multi-core architecture.

ExpectedOutcome
The students will be able to
1. Understand the fundamentals of multi-core architectures.
2. Identify, formulate and solve engineering problems in multi-core environment.
3. Know and apply the multi-core architecture / programming towards computing and
engineering practice.

UnitI INTRODUCTION 9hours
Introduction to parallel computing, need for parallel computing, parallel architectural
classification schemes, Flynns , Fengs classification, performance of parallel processors,
distributed processing, processor and memory hierarchy, bus, cache & shared memory,
introduction to super scalar architectures, quantitative evaluation of performance gain
using memory, cache miss/hits.

UnitII MULTICOREARCHITECTURES 9hours


Introduction to multi-core architectures, issues involved into writing code for multi-
core architectures, development of programs for these architectures, program
optimizations techniques, building of some of these techniques in compilers, OpenMP
and other message passing libraries, threads, mutex etc.

UnitIII MULTITHREADEDARCHITECTURES 9hours


Parallel computers, Instruction level parallelism (ILP) vs. thread level parallelism (TLP),
Performance issues: Brief introduction to cache hierarchy and communication latency,
Shared memory multiprocessors, General architectures and the problem of cache
coherence, Synchronization primitives: Atomic primitives; locks: TTS, ticket, array;
barriers: central and tree; performance implications in shared memory programs; Chip
multiprocessors.

UnitIV COMPILEROPTIMIZATIONISSUES 9hours
Introduction to optimization, overview of parallelization; Shared memory
programming, introduction to OpenMP; Dataflow analysis, pointer analysis, alias
analysis; Data dependence analysis, solving data dependence equations (integer linear
programming problem); Loop optimizations; Memory hierarchy issues in code
optimization.



169
Proceedings of the 26th Academic Council held on 18.5.2012

UnitV OPERATINGSYSTEMISSUESANDAPPLICATIONS 9hours
Operating System issues for multiprocessing Need for pre-emptive OS; Scheduling
Techniques, Usual OS scheduling techniques, Threads, Distributed scheduler,
Multiprocessor scheduling, Gang scheduling; Communication between processes,
Message boxes, Shared memory; Sharing issues and Synchronization, Sharing memory
and other structures, Sharing I/O devices, Distributed Semaphores, monitors, spin-
locks, Implementation techniques on multi-cores; OpenMP, MPI and case studies Case
studies from Applications: Digital Signal Processing, Image processing, Speech
processing.

Text/ReferenceBooks
1. Hwang, Advanced Computer Architecture, Tata McGraw Hill, 2001, 18
th
Reprint,
2008.
2. Quin, Parallel Computing, Theory & Practices, McGraw Hill, 2
nd
Sub edition, 1993.
3. John L. Hennessy and David A. Patterson, Quantitative Approach Computer
Architecture, Morgan Kaufmann, 5
th
edition, 2011.
4. Shameem Akhter and Jason Roberts, Multi-Core Programming, Intel Press, 1
st

Edition 2006.

ModeofEvaluation : Tests, Assignments, Seminars.

RecommendedbytheBoardof
Studieson

DateofApprovalbythe
AcademicCouncil













170
Proceedings of the 26th Academic Council held on 18.5.2012

CSE406CONCURRENTANDDISTRIBUTEDSYSTEMS L T P C
3 0 0 3

VersionNo.

Course
Prerequisites:


Operating Systems

Objectives
1. To cover parallel & distributed computing architecture, networked clusters of
computers, utilization and management of the expensive remote resources.
2. To present the principles underlying the functioning of concurrent and distributed
systems.
3. To create an awareness of the technical challenges in concurrent and distributed
systems design and implementation.

ExpectedOutcome
The students will be able to
1. Acquire a sound knowledge and understand the construction of concurrent and
distributed systems.
2. Model, construct and analyze basic concurrent and distributed systems.
3. Adapt analytical approach to the construction of software.

UnitI INTRODUCTION 9hours
Introduction, Examples of distributed systems, Trends in distributed systems, Focus on
resource sharing, Challenges. System models- Physical models, Architectural models,
Fundamental models.

UnitII COMMUNICATION 9hours
Introduction, API for the Internet protocols, External data representation and
marshalling, Multicast communication, Network virtualization: Overlay networks.
Remote Invocation- Request-reply protocols, Remote procedure call, Remote method
invocation. Case study: Java RMI, MPI. Indirect communication- Group communication,
Publish-subscribe systems, Message queues, Shared memory approaches.

UnitIII CLOCKS&DISTRIBUTEDALGORITHMS 9hours


Time and Global States, Clocks, events and process states, Synchronizing physical clocks,
Logical time and logical clocks, Global states, Distributed debugging, Coordination and
Agreement- Distributed mutual exclusion, Elections, Coordination and agreement in
group communication, Consensus and related problems.

UnitIV MIDDLEWARES 9hours
Distributed objects, CORBA, From objects to components, Case study: Enterprise
JavaBeans. Web services - service descriptions and IDL for web services, directory
service for use with web services, XML security, Coordination of web services,
Applications of web services, Napster and its legacy, Peer-to-peer middleware, Routing
overlays.

171
Proceedings of the 26th Academic Council held on 18.5.2012


UnitV SYSTEMSERVICES 9hours
Distributed File Systems, File service architecture, Case study: Sun Network File System
and Andrew File System, Enhancements and further developments, Name Services-
Domain Name System, Directory services, Case study: The Global Name Service. Google -
Case study.

Text/ReferenceBooks
1. George Coulouris, Jean Dollimore and Tim Kindberg, Distributed Systems Concepts
and Design, Addison Wesley, 5
th
edition, 2011.
2. Pradeep K. Sinha et. al, Scheduling in Distributing Computing Systems: Analysis,
Design and Models, 1
st
edition, 2010.

ModeofEvaluation : Tests, Assignments, Seminars.

Recommendedbythe
BoardofStudieson

DateofApprovalbythe
AcademicCouncil
















172
Proceedings of the 26th Academic Council held on 18.5.2012


CSE407SOFTWAREPRACTICEANDTESTING

L T P C
3 0 0 3
VersionNo.
Course
Prerequisites:

Software Engineering

Objectives
1. To provide fundamental knowledge of software in terms of programming styles,
algorithms, data structures, performance and their notation.
2. To detail the software testing process and its maturity model
3. To provide in-depth of various software verification and validation testing methods

ExpectedOutcome
Students will be able to
1. Analyze a problem, identify and define the testing requirements appropriate to any
computer based/ software system.
2. Analyze the local and global impact of software testing in evaluating a software
system.
3. Use current techniques, skills, tools and the principles of software testing for
computing, engineering practice and in the construction of software system.

UnitI SOFTWAREPROGRAMMINGPRACTICEI 9hours
Programming Styles: names, expressions, statement, consistency and idioms, function
macros, constants, comments; Interface: CSV, prototype libraries, interface principles,
resource management, user interfaces. Debugging Styles: Debuggers, Good Clues, Easy
Bugs, No Clues, Hard Bugs, Last Resorts. Non-reproductable Bugs, Debugging tools.
Performance: Performance bottlenecks, timing and profiling speed, spacy efficiency,
estimation.

UnitII SOFTWAREPROGRAMMINGPRACTICEII 9hours


Portability: language, headers and libraries, program organization, isolation, data
exchange, byte order, portability and upgrade, internationalization. Notations:
Formatting data, regular expressions, programming tools, interpreters and compilers,
program generators, macros. Debugging: debuggers, clues and bugs, debugging tools.

UnitIII SOFTWARETESTINGPROCESS 9hours


The six essentials of software testing: The state of the art and the state of the
practice; the clean sheet approach to getting started. Establishing a practical
perspective; critical choices; what, when and how to test; critical disciplines:
frameworks for testing: Types of Testing: White Box Testing, Black Box Testing,
Integration Testing, System and Acceptance Testing, Performance Testing, Regression
Testing, Internationalization Testing, Ad hoc Testing.

UnitIV SOFTWARETESTINGPROCESS 9hours
The Seven-Step Software Testing Process: Organizing for Testing, Developing the Test
Plan, Verification Testing, Validation Testing, Analyzing and Reporting Test Results,
Acceptance and Operational Testing, Post-Implementation Analysis.
173
Proceedings of the 26th Academic Council held on 18.5.2012

UnitV MEASURINGANDMANAGINGTESTINGSTANDARDS 9hours
Organizational approaches to testing: organizing and reorganizing, structural design
elements, approaches to organizing the test function, selecting the right approach;
current practices, trends, challenges; GUIs: Usage testing, tester-to-developer ratios,
software measures and practices benchmark study; People and Organizational Issues in
Testing: Common People Issues, Organization Structures for Testing Teams, Test
Planning, Management, Execution and Reporting; Test Management and Automation:
Software Test Automation , Test Metrics and Measurement.

Text/ReferenceBooks
1. Brain W. Kernighan and Rob Pike : The Practice of Programming, Addison-Wesley,
2006.
2. Ed Kit: Software Testing in the Real World, Addison-Wesley, 2006.
3. William Perry : Effective Methods For Software Testing, Second Edition, John Wiley,
2006.
4. Beizer B: Software Testing Techniques, Second Edition, Van Nostrand Reinhold,
2001.
5. Srinivasan Desikan, Gopalaswamy Ramesh, Software Testing Principles and
Practices, Pearson Education 1
st
edition, 2007.

ModeofEvaluation : Tests, Assignments, Seminars
Recommendedbythe
BoardofStudieson


DateofApprovalbythe
AcademicCouncil













174
Proceedings of the 26th Academic Council held on 18.5.2012

CSE408DATAWAREHOUSINGANDDATAMINING L T P C
3 0 0 3
VersionNo.

Course
Prerequisites:


Database Systems
Objectives
1. Tointroduce concepts and techniques of data warehousing.
2. To edify the underlying concepts and architecture of data mining.
3. To make students understand association mining and cluster analysis.

ExpectedOutcome
The students will be able to
1. Understand the functionality of the various data warehousing components.
2. Analyse the strengths and limitations of various data mining and data warehousing
models.
3. Basic Design, implement and evaluate a system using mining principles.
4. Identify, formulate and solve engineering problems using association mining and
clustering.

UnitI INTRODUCTIONTODATAWAREHOUSING 6hours
Data preprocessing- Data cleaning Data integration Transformation-Data Reduction-
Data Warehouse Characteristics- A multidimensional Data Model OLAP Operations-
Types of OLAP server-Data Warehouse Architecture and Implementation.

UnitII DATAMININGCONCEPTS 9hours
Introduction to Data Mining Data Mining Functionalities Classification of Data
Mining systems, Data Mining Task primitives-Integration of data mining with database-
Major issues in Data mining.

UnitIII FREQUENTPATTERNMINING 9hours


Basic concepts market basket analysis - Efficient and Scalable Frequent Item set
Mining Methods-Various Kinds of Association Rules- Association Mining to Correlation
Analysis.

UnitIV CLASSIFICATIONANDPREDICTION 12hours
Classification - issues regarding classification and prediction -Decision Tree Induction-
Bayesian classification - Rule-Based Classification- Associative Classification
Prediction: linear non linear regression-Accuracy and Error Measures.

UnitV CLUSTERANALYSISANDOUTLIERANALYSIS 9hours
Types of Data in cluster analysis - Major clustering methods- The k-Means Method,
Outlier Analysis- Distance-Based Outlier Detection- Density-Based Local Outlier
Detection-Applications of Data mining.

Text/ReferenceBooks
1. Han J. & Kamber, M, Data Mining: Concepts and Techniques, Third Edition, Morgan
Kaufmann, 2011.
175
Proceedings of the 26th Academic Council held on 18.5.2012

2. Margaret H. Dunham, Data Mining: Introductory and Advanced Topics, Prentice
Hall 2006
3. David Hand, Heikki Mannila and Padhraic Smyth, Principles of Data Mining, The
MIT Press, 2001
4. Immon W. H., Building the Data Warehouse, Wiley Dream Tech, 4th edition, 2005.
5. Anahory S., Murray, D, Data Warehousing in the Real World, Addison Wesley, 1st
Edition, 1997.

ModeofEvaluation : Tests, Assignments, Seminars

RecommendedbytheBoardof
Studieson

DateofApprovalbythe
AcademicCouncil

















176
Proceedings of the 26th Academic Council held on 18.5.2012


CSE315SCRIPTINGLANGUAGES L T P C
3 0 0 3
VersionNo.

Course
Prerequisites:


Computer Networks

Objectives
1. To educate the fundamental and advanced concepts of scripting languages
2. To create interactive Internet applications using scripts

ExpectedOutcome
The students will be able to
1. Design, Code and Implement attractive GUI applications using Java Script, VB script.
2. Use the scripting theory in developing software system
3. Test and troubleshoot basic scripting language programs.
4. Use existing databases in web-based applications.
5. Set up web server software.

UnitI FUNDAMENTALSOFSCRIPTINGLANGUAGES 9hours
Web Basics - Multitier Application Architecture - World Wide Web Consortium (W3C) -
Introduction to HTML5 - Editing HTML5 - First HTML5 Example - W3C HTML5
Validation Service Headings - Linking - Images - alt Attribute - Void Elements - Using
Images as Hyperlinks - Special Characters and Horizontal Rules -Lists - Tables - Forms -
Internal Linking - meta Elements - Web Resources - HTML5 Form input Types -Text-
Level Semantics: mark Element and wbr Element.

UnitII JAVASCRIPT 6hours


Introduction - Obtaining User Input with prompt Dialogs - Dynamic Welcome Page -
Adding Integers - Memory Concepts - Arithmetic - Decision Making: Equality and
Relational Operators Java control Statements Functions Arrays.

UnitIII JAVAOBJECTSANDEVENTHANDLING 6hours


Introduction - Math Object - String Object - Methods of the String Object - Date Object -
Boolean and Number Objects - document Object - Using JSON to Represent Objects -
Document Object Model (DOM):Objects and Collections - Modeling a Document: DOM
Nodes and Trees - Traversing and Modifying a DOM Tree - Dynamic Styles - JavaScript
Event Handling.

UnitIV PHP 15hours
Introduction - Simple PHP Program - Converting between Data Types - Arithmetic
Operators - Initializing and Manipulating Arrays - String Comparisons - String
Processing with Regular Expressions - Searching for Expressions - Representing
Patterns - Super global Arrays -Using PHP to Process HTML5 Forms - Using Cookies.



177
Proceedings of the 26th Academic Council held on 18.5.2012

UnitV WEBSERVERSANDDATABASE 9hours
Introduction - HTTP Transactions- Accessing Web Servers - Apache, MySQL and PHP -
Running the Examples Using Apache HTTP Server - Microsoft IIS Express and
WebMatrix - Running the PHP Examples Using IIS Express. Database: SQL, MySQL, LINQ
and Java DB - Instructions for Setting Up a MySQL User Account - Creating Databases in
MySQL - Microsoft Language Integrate Query (LINQ) - LINQ to SQL - Querying a
Database with LINQ - Creating LINQ to SQL Classes - Data Bindings Between Controls
and the LINQ to SQL Classes - Java DB/Apache Derby.

Text/ReferenceBooks
1. P. J. Deitel and H.M. Deitel, Internet & World Wide Web How to Program - 5
th
edition,
2011.
2. John Pollac, JavaScript, McGraw Hill, 3
rd
edition, 2009.

ModeofEvaluation : Tests, Assignments, Seminars.

RecommendedbytheBoard
ofStudieson

DateofApprovalbythe
AcademicCouncil
















178
Proceedings of the 26th Academic Council held on 18.5.2012

CSE403HUMANCOMPUTERINTERACTION L T P C
3 0 0 3
VersionNo.

Course
Prerequisites:


Graphics and Multimedia, Software Engineering

Objectives
1. To introduce the fundamentals of user interface design
2. To provide concepts and guidelines of user interface

ExpectedOutcome
The students will be able to
1. Understand the Human Computer Interaction.
2. Identify the impact of HCI, formulate and solve user interface issues.
3. Design an effective user interface for software application using the tools and
techniques.

UnitI DEVELOPMENTPROCESS 9hours
Usability of interactive systems Usability measures Usability motivations
Guidelines Principles Theories. Managing design process Four pillars of design
Development methodologies Ethnographic Observations Participatory design
Social Impact Legal Issues.

UnitII THEINTERACTION 9hours
Models of Interaction Frameworks and HCI Ergonomics Interaction styles
Elements of WIMP interface Interactivity Paradigms for Interaction. Interaction
Design Introduction -The process of design -User focus - Navigation design Screen
design and layout - Iteration and prototyping.

UnitIII DESIGNRULES&EVALUATION 9hours


Principles to support usability Standards - Guidelines - Golden rules and heuristics -
HCI patterns. Expert Reviews Usability Testing and Laboratories Survey
Instruments Acceptance Tests - Evaluation during Active Use - Controlled
Psychologically Oriented Experiments.

UnitIV MODELSANDTHEORIES 9hours
Cognitive models Goal and task hierarchies - Linguistic models - The challenge of
display-based systems - Physical and device models - Cognitive architectures -
Organizational issues - Capturing requirements Communication and collaboration
models Face-to-face communication Conversation - Text-based communication -
Group working - Differences between task analysis and other techniques - Task
decomposition -Knowledge-based analysis Entity relationship-based techniques.

UnitV DESIGNISSUESANDAPPLICATIONAREAS 9hours
Quality of Service - Models of Response Time Impacts -Expectations and Attitudes - User
Productivity - Variability in Response Time -Frustrating Experiences - Balancing
Function and Fashion - Error Messages Non-anthropomorphic Design - Display Design
- Web Page Design -Window Design, Applications Involving Speech, Handwriting and
Gesture Recognition Computer Vision Virtual Reality Unconventional Human
Computer Interfaces.
179
Proceedings of the 26th Academic Council held on 18.5.2012

Text/ReferenceBooks
1. Ben Schneiderman, Designing the User Interface, 5
th
Edition, Reading, 2009.
2. Alan J Dix, Janet E Finlay, Greogory D Abowd, Russel Beale, Human Computer
Interaction, 3rd Edition, Pearson Higher Education, 2003.
3. Martin Helander, Thomas k. Landauer, Prasad V. Prabhu, Handbook of Human-
Computer Interaction, Elsevier, 2
nd
Edition, 1997

ModeofEvaluation : Tests, Assignments, Seminars

RecommendedbytheBoardof
Studieson

DateofApprovalbythe
AcademicCouncil








180
Proceedings of the 26th Academic Council held on 18.5.2012


CSE316DATABASEDESIGN L T P C
3 0 0 3
VersionNo.
Course
Prerequisites:


Database systems
Objectives
1. To cover Distributed Database Design Concepts.
2. To understand Query processing, Query decomposition, Transaction management
and Distributed DBMS reliability.

ExpectedOutcome
The students will be able to
1. Understand and design distributed databases,
2. Apply distributed concepts in database design to solve issues of larger information
system.
3. Implement distributed query processing, Query decomposition and Optimization
using the advanced database design principles.

UnitI DISTRIBUTEDDATABASEDESIGN 9hours
Introduction to DDBSs. Complicating Factors Problem Areas, DBMS Standardization
Architectural models for distributed DBMSs Distributed DBMS Architecture Global
Directory issues, Alternative Design Strategies Distribution Design issues
Fragmentation Allocation, Semantic Data Control: View Management Data Security
Semantic Integrity Control.

UnitII OVERVIEWOFQUERYPROCESSING 9hours


Query processing problem objectives of query processing Complexity of Relational
Algebra operations characterization of Query Processors Layers of Query processing.

UnitIII QUERYDECOMPOSITION 9hours
Localization of Distributed Data, Query Optimization Centralized Query Optimization
Join Ordering in fragment queries distributed query optimization algorithms.

UnitIV TRANSACTIONMANAGEMENT 9hours
Transactions Properties of Transactions Types of Transactions, Distributed
concurrency control- Serializability theory Taxonomy of concurrency control
mechanisms Locking based concurrency control algorithms Timestamp-based
concurrency control algorithms Optimistic concurrency control algorithms
optimistic concurrency control algorithms Deadlock management Relaxed
concurrency control.

UnitV DISTRIBUTEDDBMSRELIABILITY&CASESTUDIES 9hours
Reliability concepts and measures Failures and fault tolerance in distributed systems
local reliability protocols distributed reliability protocols dealing with site failures
Network partitioning Architectural considerations,The R* Project, Distributed Ingres,
Porel, Sirus-Delta Multibase, DDTs, Heterogeneous Sirius Delta.
181
Proceedings of the 26th Academic Council held on 18.5.2012

Text/ReferenceBooks
1. M. Tamer Ozsu, Patick Valduriesz, Principles of Distributed Database Systems, PHI,
3
rd
Edition 2011.
2. Stefanoceri, Giuseppe Pelagatti, Distributed Database Principles and Systems,
McGraw Hill Publications, 1987.
3. Ramez Elmasri, Shamkant B. Navathe, Fundamentals of Database Systems, 6
th

Edition, Addison-Wesley, 2010.

ModeofEvaluation: Tests, Assignments, Seminars.

Recommendedbythe
BoardofStudieson


DateofApprovalbythe
AcademicCouncil


182
Proceedings of the 26th Academic Council held on 18.5.2012


CSE409MODELINGANDSIMULATION L T P C
3 0 0 3
VersionNo.
Course
Prerequisites:


Applied Probability, Statistics and Reliability
Objectives
1. To introduce the salient features and models of simulation systems.
2. To provide exposure in input and output data analysis through various statistical
models.
3. To elucidate the fundamentals of data collection and statistical models in
simulation.

ExpectedOutcome
Students will be able to
1. Apply the simulation and modeling concepts in real time problems.
2. Design and conduct experiments as well as analyze and interpret data using
statistical models.
3. Apply modeling principles in the development of computer based system

UnitI INTRODUCTION 9hours
Introduction to Simulation-Advantages and disadvantages of simulation, areas of
application, Systems and system environment, Components of a system, Discrete and
continuous systems, Model of a system. Types of models, Discrete events system
simulation, Steps in a simulation study. Simulation Examples, Simulation of queuing
systems, Simulation of inventory systems, other examples of simulation, discrete event
simulation, general principles and computer simulation languages, Concepts in DES,
Simulation in Java, SSF and GPSS.

UnitII SIMULATIONMODELS 9hours


Statistical Models in Simulation- Review of terminology & concepts, Useful statistical
models, Discrete distributions, Continuous distributions, Process, Empirical
distributions. Queuing Models: Characteristics of queuing systems, queuing notation,
Transient & steady state behavior of queuing notation, Transient & steady state
behavior of queues, long run measures of performance of queuing systems, steady
state behavior of finite population models.

UnitIII INVENTORYSYSTEMS 9hours
Inventory Systems- Measures of effectiveness, Inventory policies, Deterministic
systems, and probabilistic systems, Simulation in inventory analysis. Random Number
Generation: Properties of random numbers, Generation of Pseudo random. Nos.,
techniques for generating random nos., tests for random nos. Random Variable
Generation: Inverse transforms technique, Direct Transformation for the normal
distribution, Convolution method, Acceptance-Rejection technique.



183
Proceedings of the 26th Academic Council held on 18.5.2012

UnitIV INPUTDATAANALYSIS 9hours
Input Data Analysis-Data collection, identifying the distribution, parameter estimation,
goodness-of-fit tests. Verification and validation of simulation models: Model building,
verification & validation, verification of simulation models, calibration & validation of
models.

UnitV OUTPUTANALYSIS&APPLICATIONS 9hours
Output Analysis For A Single Model- Stochastic nature of O/I data, types of simulations
with respect to O/P analysis, measures of performance and their estimation, O/p
analysis for terminating simulations, O/P analysis for steady-state simulations.
Simulation of Computer Systems and Traffic Modeling in Computer Networks.

Text/ReferenceBooks
1. Jerry Banks, John S. Carson, Discrete Event System Simulation, PHI, 5
th
Edition, 2009.
2. Larry H Leemis, Stephen K Park, Discrete-Event Simulation : A First Course, Prentice
Hall, 1
st
edition, 2006.

ModeofEvaluation : Tests, Assignments, Seminars
RecommendedbytheBoard
ofStudieson
DateofApprovalbythe
AcademicCouncil
184
Proceedings of the 26th Academic Council held on 18.5.2012


CSE317DATACOMMUNICATIONS L T P C
3 0 0 3
VersionNo.

Course
Prerequisites:



Computer Networks
Objectives
1. To lay foundations for data and digital communication.
2. To describe about various transmission types.
3. To understand error control coding techniques
ExpectedOutcome
The students will be able to
1. Analyze the fundamentals of data & digital communication sampling techniques.
2. Compare the transmission mechanisms
3. Apply various encoding schemes of data communication in communication systems

UnitI INTRODUCTION 9hours
Key elements of communication model, Data communication, The effectiveness of data
communication dependents, Components, Classification of communication networks,
The TCP/IP Protocol Architecture, OSI Layers, Protocols in OSI reference model

UnitII ANALOGANDDIGITALTRANSMISSION 9hours
Transmission terminology, Frequency, spectrum, and bandwidth, Frequency-domain
concepts, Spectrum, Analog and Digital Data Transmission, Transmission Impairments,
Attenuation Distortion, Delay Distortion, Noise, Thermal Noise, Intermediation Noise,
Crosstalk Noise, Impulse Noise , Channel Capacity

UnitIII TRANSMISSIONMEDIA 9hours
Guided media, Open Wire, Twisted Pair, Optical Fiber , Unguided transmission media;
Ground wave propagation, Line of sight propagation; Radio Frequencies , Microwave,
Satellites

UnitV SYNCHRONOUS/ASYNCHRONOUSTRANSMISSION 9hours
Parallel and Serial Transmission, Parallel transmission, Serial Transmission,
Synchronous transmission, Bit synchronization, Character synchronization,
Asynchronous transmission, Asynchronous Start-Stop Systems, Start bit and bit
synchronization; Line configuration: Topology, Point-to-point configuration, Multi point
link, Mode of transmission, Simplex, Half duplex, Full Duplex; Interfacing: Interface
Standards: EIA-232 Interface, Dial-Up operation using V.24/EIA-232;

UnitIV ENCODINGSCHEMES 9hours
Digital-to-Digital encoding scheme: Unipolar, Polar,Non-Return to- Zero (NRZ)
encoding, Non Return-to-Zero-Level (NRZ-L), Non Return-to-Zero Inverted (NRZ-I),
Return-to-Zero, Biphase: Manchester, Differential Manchester, Bipolar, Bipolar
Alternate Mark Inversion(BAMI), Bipolar 8-Zeroes Substitution (B8ZS), High Density
bipolar-3 zeros (HDB3); Analog to Digital Encoding scheme: PCM (Pulse Code
Modulation), Delta Modulation (DM), ; Digital -to- Analog Encoding scheme, Amplitude
Shift Keying (ASK), Frequency Shift Keying (FSK), Phase Shift Keying (PSK), Spread
Spectrum
185
Proceedings of the 26th Academic Council held on 18.5.2012

Text/ReferenceBooks
1. Behrouz A Forouzan, Data Communications and Networking, Tata McGraw Hill, 5
th

edition, 2012.
2. W. Stallings, Data & Computer Communications, Prentice-Hall, 9
th
edition, 2010.
3. Simon Haykins, Digital Communications, John Wiley, 2010.
4. John G. Proakis, Digital Communication, McGraw-Hill Inc., Third edition, Malaysia,
2000.
5. M. K. Simen, Digital Communication Techniques, Signal Design & Detection, Prentice
Hall of India, 2003.

ModeofEvaluation : Tests, Assignments, Seminars.

RecommendedbytheBoard
ofStudieson

DateofApprovalbythe
AcademicCouncil


















186
Proceedings of the 26th Academic Council held on 18.5.2012

CSE319SOFTCOMPUTING L T P C
3 0 0 3
VersionNo:

Course
Prerequisites:



Discrete Mathematical Structures
Objectives:
To introduce the concepts of neural networks and advanced neural networks
To understand the fundamentals of fuzzy sets and fuzzy logic
1. To establish basic knowledge about optimization techniques in soft computing

ExpectedOutcomes:
At the end of course student should be able to
2. Design soft computing techniques for various applications domains
Lead project teams in the design of soft computing related projects

UnitI NEURALNETWORKS 8hours
History, Mathematical model of neuron, ANN architectures, Learning rules, Learning
Paradigms. Perceptron network, Backpropagation network, Backpropagation learning
and its applications, Variants of BPA.

UnitII ADVANCEDNEURALNETWORKS 9hours
Associative Memory: Auto correlation, Hetero Correlation, Exponential BAM,
Applications. Adaptive Resonance Theory: Vector Quantization, ART1, ART2,
applications, Kohonens Self Organizing Map.

UnitIII FUZZYSETSANDRELATIONS 8hours
Uncertainty and Imprecision, Chance vs ambiguity, Fuzzy Sets, Fuzzy Relations,
Membership functions, Properties of Membership functions, Fuzzification and
Defuzzification.

UnitIV FUZZYLOGIC 10hours
Classical Logic and Fuzzy logic, Fuzzy Rule based systems, Fuzzy Decision making, Fuzzy
Classification, Fuzzy Pattern Recognition, Applications MATLAB and Soft Computing.

UnitV OPTIMIZATIONTECHNIQUES 10hours
Derivative based Optimization Descent Methods Genetic Algorithms Ant Colony
Optimization Particle Swarm Optimization, Case Study - fraud detection, health care
using Soft computing techniques.

Text/ReferenceBooks
1. T. J. Ross, Fuzzy Logic with Engineering Applications, John Wiley & Sons, 3
rd

Edition, 2010.
2. S.N Sivanandam, S N Deepa, Principles of Soft Computing, Wiley India, 2
nd
Edition,
2011.
3. S. Rajasekaran and G.A.V. Pai, Neural Networks, Fuzzy Logic and Genetic
Algorithms: Synthesis and Applications, PHI, 2009.

187
Proceedings of the 26th Academic Council held on 18.5.2012

4. Davis E.Goldberg, Genetic Algorithms: Search, Optimization and Machine Learning,
Pearson Education, Fourth impression 2009.
5. Zurada, J. M. Introduction to Artificial Neural Systems, Jaico Publishing House,
1997.

ModeofEvaluation : Tests, Assignments, Seminars

RecommendedbytheBoardof
Studieson

DateofApprovalbytheAcademic
Council




















188
Proceedings of the 26th Academic Council held on 18.5.2012


CSE420GREENCOMPUTING

L T P C
3 0 0 3
VersionNo.

Course
Prerequisite/
Exposure:


Objective
To help students to know a survey to gauge the impact of computing resources on
environment and to devise new framework to reduce or possibly to eliminate the
environmental issues caused by computing.

ExpectedOutcome
On completion of subject the students will be able to apply
1. The concept of Business impact of green computing and green computing
implementation
2. The concept of Grid Green computing, development organization in green computing
and Green Electronics Council
3. The concept of Green Grid Framework and Green Computing Strategic Initiative
4. Green Information Technology, Organization Performance through Green
Computing and Process Organization
5. The concept of Green Computing for Organization

UnitNo.I INTRODUCTION 9hours
The Role of Computer Consultants in Propagating Green Computing- The Business
Impact of Green Computing -Impact Information Technology:- Green Computing Making
Great Impact on Research-Adapting to Change in an Organization-Implementing Green
Computing that Impact Leadership in the Organization

UnitNo.II GREENCOMPUTINGENVIRONMENT 9hours
The Globus Toolkit to Efficiently Build a Grid-Green Computing: An Effective Project
Initiative-Understanding the Global Grid Forum- Green Computing Impact
Development-The Rise of the Global Village- Important Roles of a Development
Organization in Green Computing- Adopting a Green Data Center-Green Business- Green
Computers Initiatives- Green Computing : Impact Organization Overview- Green
Electronics Council

UnitNo.III GREENCOMPUTINGPLATFORMS 9hours
The Green Grid Framework- Green Computing Initiative Platforms- The Green Grid
Consortium- Green Computer Power - Organization Information Systems for Green
Computing- Green Computing for Environmental Impact Management- Tips for Green
Computing Strategic Initiative- Green Computing: Tips for Strategic Planning
Organization



189
Proceedings of the 26th Academic Council held on 18.5.2012

UnitNo.IV GREENCOMPUTINGANDITSPERFORMANCE 9hours
Green Computing Strategy Initiative - Green Information Technology - Knowledge
Management Organization in Green Computing- Improving Organization Performance
through Green Computing- Process Organization: Better Workflow Equals Better
Efficiency

UnitNo.V MANAGINGGREENCOMPUTINGINANORGANIZATION 9hours
Green Computing for Organization - Green Computing Organization Research -Green
Computing: Climate Change Impact Reduction Strategy- Energy and Resource
Management

Text/ReferenceBooks
1. Lawrence Webber, Michael Wallace Green Tech: How to Plan and Implement
Sustainable IT Solutions, 1
st
edition, AMACOM, 2009.
2. Jason Harris, Green Computing and Green IT Best Practices on Regulations and
Industry Initiatives, Virtualization, Power Management, Materials Recycling and
Telecommuting, 1
st
edition, Emereo Publisher, 2008.
3. Toby Velte, Anthony Velte, Robert Elsenpeter, Green IT: Reduce Your Information
System's Environmental Impact While Adding to the Bottom Line, 1
st
edition,
McGraw-Hill Osborne Media, 2008.

ModeofEvaluation : Tests, Assignments, Seminars
RecommendedbytheBoardof
Studieson

DateofApprovalbythe
AcademicCouncil











190
Proceedings of the 26th Academic Council held on 18.5.2012

CSE421INFORMATIONRETRIEVAL L T P C
3 0 0 3
VersionNo:


Course
Prerequisites:

Algorithm Design and Analysis

Objectives:
To cover the foundations of information retrieval, and the design, analysis and
implementation of IR systems.

ExpectedOutcomes:
The students should be able to design and implement the various IR techniques.

UnitI INTRODUCTION 9hours
Introduction:Definition, Objectives, Functional Overview, Relationship to DBMS, Digital
libraries and Data Warehouses; Information Retrieval System Capabilities: Search,
Browse, Miscellaneous.

UnitII CATALOGINGANDINDEXING 9hours
Cataloging and Indexing:Objectives, Indexing Process, Automatic Indexing, Information
Extraction; Data Structures: Introduction, Stemming Algorithms, Inverted file
structures, N-gram data structure, PAT data structure, Signature file structure,
Hypertext data structure.

UnitIII AUTOMATICINDEXING 9hours
Automatic Indexing: Classes of automatic indexing, Statistical indexing, Natural
language, Concept indexing, Hypertext linkages; Document and Term Clustering:
Introduction, Thesaurus generation, Item clustering, Hierarchy of clusters.

UnitIV SEARCHINGTECHNIQUES 9hours
User Search Techniques: Search statements and binding, Similarity measures and
ranking, Relevance feedback, Selective dissemination of information search, Weighted
searches of Boolean systems, Searching the Internet and hypertext; Information
Visualization: Introduction, Cognition and perception, Information visualization
technologies.

UnitV TEXTSEARCHING 9hours
Text Search Algorithms: Introduction, Software text search algorithms, Hardware text
search systems; Information System Evaluation:Introduction, Measures used in system
evaluation, Measurement example TREC results.

Text/ReferenceBooks
1. Kowalski, Gerald, Mark T Maybury: Information Retrieval Systems: Theory and
Implementation, Kluwer Academic Press, 1997.
2. Kowalski, Gerald, Mark T Maybury: Information Storage and Retrieval Systems:
Theory and Implementation, Kluwer Academic Publishers 2000.

191
Proceedings of the 26th Academic Council held on 18.5.2012

3. Frakes, W.B., Ricardo Baeza-Yates: Information Retrieval Data Structures and
Algorithms, Prentice Hall, Third edition 2010.
4. Yates, Modern Information Retrieval, Pearson Education, Fourth Impression 2009.
5. Robert Korfhage, Information Storage & Retieval, John Wiley & Sons, 1
st
edition
2007.

ModeofEvaluation : Tests, Assignments, Seminars
RecommendedbytheBoardofStudieson
DateofApprovalbytheAcademicCouncil






















192
Proceedings of the 26th Academic Council held on 18.5.2012

CSE424ADHOCWIRELESSNETWORKS

L T P C
3 0 0 3

VersionNo.

Course
Prerequisite/
Exposure:



Computer Networks

Objective
To develop advanced network building skills and to study performance issues in
advanced wireless and mobile networks.

ExpectedOutcome
The student will be able
1. To understand techniques used in mobile computing.
2. To select a suitable technique in a given situation, design and build a wireless LAN.

UnitNo.I: FUNDAMENTALS 9hours
Introduction Fundamentals of Wireless Communication Technology The
Electromagnetic Spectrum Radio Propagation Mechanisms Characteristics of the
Wireless Channel IEEE 802.11ab Standard Origin of Ad hoc Packet Radio Networks
Technical Challenges Ad hoc Wireless Networks Heterogeneity in Mobile Devices
Traffic Profiles Types of Ad hoc Mobile Communications Types of Mobile Host
Movements.

UnitNo.II: ADHOCROUTINGPROTOCOLS 9hours
Introduction Issues in Designing a Routing Protocol for Ad Hoc Wireless Networks
Classifications of Routing Protocols TableDriven Routing Protocols Destination
Sequenced Distance Vector (DSDV) WirelessRouting Protocol (WRP) Source
Initiated OnDemand Approaches Ad hoc OnDemand Distance Vector Routing
(AODV) Dynamic Source Routing (DSR) Temporally Ordered Routing Algorithm
(TORA) ZoneRouting Protocol (ZRP).

UnitNo.III: MULTICASTROUTINGINADHOCNETWORKS 9hours
Introduction Issues in Designing a Multicast Routing Protocol Operation of Multicast
Routing Protocols An Architecture Reference Model for Multicast Routing Protocols
Classifications of Multicast Routing Protocols TreeBased Multicast Routing
Protocols MeshBased Multicast Routing Protocols Multicasting with Quality of
Service Guarantees Application Dependent Multicast Routing.

UnitNo.IV: TRANSPORTLAYERSECURITYPROTOCOLS 9hours
Introduction Issues in Designing a Transport Layer Protocol for Ad hoc Wireless
Networks Design Goals of a Transport Layer Protocol for Ad hoc Wireless Networks
Classification of Transport Layer Solutions TCP over Ad hoc Wireless Networks
Security in Ad Hoc Wireless Networks Network Security Requirements Issues and
Challenges in Security Provisioning Network Security Attacks Key Management
Secure Routing in Ad hoc Wireless Networks.

193
Proceedings of the 26th Academic Council held on 18.5.2012

UnitNo.V: QUALITYOFSERVICE&ENERGYMANAGEMENT 9hours
Introduction Issues and Challenges in Providing QoS in Ad hoc Wireless Networks
Classifications of QoS Solutions Network Layer Solutions QoS Frameworks for Ad
hoc Wireless Networks Energy Management in Ad hoc Wireless Networks- Energy
Management: Introduction Need for Energy Management in Ad hoc Wireless
Networks Classification of Energy Management Schemes Battery Management
Schemes Transmission Power Management Schemes System Power Management
Schemes.

Text/ReferenceBooks
1. C. Siva Ram Murthy, B. S. Manoj, Ad Hoc Wireless Networks Architecture and
Protocols, 3
rd
edition, Pearson Education, 2011.
2. C.K.Toh, Ad Hoc Mobile Wireless Networks, Pearson Education, 2010
3. Karch Pahlavan, Prashant Krishnamoorthy, Principles of Wireless Network A
unified Approach, 4
th
edition, Pearson Education, 2010.
4. Ivan Stojmenovic Handbooks of Wireless Networks and Mobile Computing, John
Wiley & Sons, 2008.
5. Feng Zhao and Leonidas Guibas, Wireless Sensor Networks, Morgan Kaufman
Publishers, 2010.

ModeofEvaluation : Tests, Assignments, Seminars


Recommended by the Board of
Studieson
Date of Approval by the Academic
Council









194
Proceedings of the 26th Academic Council held on 18.5.2012


CSE416CLOUDCOMPUTING L T P C
3 0 0 3
VersionNo:

Course
Prerequisites:


Software Engineering

Objectives:
1. To acquire good working knowledge of the essentials of next generation software
business
2. To understand fundamentals of cloud computing

ExpectedOutcomes:
At the end of course student should be able to
1. Provide convenient, on-demand network access to a shared pool of configurable
computing
2. resources that can be rapidly provisioned and released with minimal management
effort or

UnitI NEWCOMPUTINGPARADIGMS&SERVICES 7hours
Edge computing, Grid computing, Utility computing, Distributed computing, Cloud
computing and its history and evolution

UnitII INTRODUCTIONTOCLOUDCOMPUTING 10hours
Cloud Computing Architectural Framework, Cloud Deployment Models, private, public
and hybrid , Challenges in adapting a cloud in the context of i) Security issues ii)
Bandwidth and iii) Integration issues, Virtualization in Cloud Computing, Parallelization
in Cloud Computing, Security for Cloud Computing, Cloud Economics

UnitIII CLOUDSERVICEMODELS 10hours
Software as a Service (SaaS), Infrastructure as a Service (IaaS), Platform as a Service
(PaaS), Seven Business Models for cloud, five-layer cloud service stack, compute and
storage cloud services case studies Jeff Bezos and Amazon

UnitIV VIRTUALIZATION&SECURTIY 11hours
Virtualization:Virtual machine technology, virtualization applications in enterprises,
Pitfalls of virtualization
Cloud computing security architecture: Architectural Considerations- General Issues,
Trusted Cloud computing, Secure Execution Environments and Communications, Micro-
architectures; Identity Management and Access control-Identity management, Access
control, Autonomic Security
Cloud computing security challenges: Virtualization security management- virtual
threats, VM Security Recommendations, VM-Specific Security techniques, Secure
Execution Environments and Communications in cloud.



195
Proceedings of the 26th Academic Council held on 18.5.2012

UnitV CLOUDCOMPUTINGPRACTICES 7hours
Cloud Computing Operating System, Creating Windows servers on the cloud, Creating
Linux servers on the cloud, Deploying applications on the cloud, Major cloud solutions,
Implementing real time application over cloud platform

Text/ReferenceBooks
1. Rajkumar Buyya, James Broberg, Andrzej M. Goscinski, Cloud Computing Principles
and Paradigms, Wiley, 2010
2. Michael Miller, Cloud Computing: Web-Based Applications That Change the Way You
Work and Collaborate Online, Que Publishing, 2009.
3. Ronald Krutz and Russell Dean Vines, Cloud Security: A Comprehensive Guide to
Secure Cloud Computing, Wiley Publishing, 2010.
4. Toby Velte, Anthony Velte, Robert Elsenpeter, Cloud Computing, A Practical
Approach, McGraw Hill, 2010.
5. Judith Hurwitz, Robin Bloor, Marcia Kaufman, Fern Helper, Cloud Computing For
Dummies, Wiley Publishing, 2010.
6. Nick Antonopoulos, Lee Gillam, Cloud Computing: Principles, Systems and
Applications, Springer, 2010.

ModeofEvaluation : Tests, Assignments, Seminars

RecommendedbytheBoardofStudies
on

DateofApprovalbytheAcademic
Council













196
Proceedings of the 26th Academic Council held on 18.5.2012

CSE422MEDICALIMAGEPROCESSING

L T P C
3 0 0 3
VersionNo.
Course
Prerequisites:


Image and Vision Computing
Objectives
1. To provide a grand tour of the major digital imaging concepts.
2. To gain knowledge in image processing and medical imaging
3. To understand analysis of medical imaging techineques.
ExpectedOutcome
The students will be able to
1. Understand and apply the concepts of digital image processing in real computing
problems.

Unit1 FUNDAMENTALSOFDIGITALIMAGEPROCESSING 9hours
Introduction: Digital Images; Image quality; LinearSystemTheory: signals; systems;
Image Operations: Multi-image operations; geometric operations; multiscale image
enhancement

Unit2 RADIOGRAPHY 9hours
X-rays; interaction of x-ray beam with tissue; X-ray detectors; X-ray detectors in CT;
Data acquisition in CT; image reconstruction; spiral CT

Unit3 MAGNETICRESONANCEIMAGING 9hours
Image acquisition and reconstruction; interaction with tissue; slice selection; basic
pulse sequences; 3D-imaging; fast imaging methods; functional imaging

Unit4 ULTRASONICIMAGINGANDNUCLEARIMAGING 9hours
Physics of acoustic waves propagation in tissues; generation and detection of
ultrasound; B-mode; M-mode; TM-mode processing; date acquisition. PET; SPECT.

Unit5 MEDICALIMAGEANALYSIS 9hours
Manual analysis; automated analysis; computational strategies for automated
analysis: pixel classification; fitting rigid models to photometry; fitting flexible models
to photometry; validation; imageintervention: evolutions in stereotactic
neurosurgery; inter-operative imaging

Text/ReferenceBooks
1. Paul Suetens, Fundamentals of Medical Imaging, Cambridge University, 2
nd
Edition,
2009.
2. Steve Webb, The physics of Medical Imaging, Institute of Physics, 2
nd
Edition, 2008.
3. Peggy Woodwards, MRI for Technologists, McGraw-Hill, 2
nd
Edition, 2000.

ModeofEvaluation: Tests, Assignments and Seminar

RecommendedbytheBoardof
Studieson

DateofApprovalbythe
AcademicCouncil
197
Proceedings of the 26th Academic Council held on 18.5.2012

CSE415INFORMATIONSECURITY L T P C
3 0 0 3
VersionNo:
Course
Prerequisites:

Internet and Web Programming

Objectives:
1. To introduce various threats and attacks in a network
2. To study cryptographic techniques during the design of information systems

ExpectedOutcomes:
At the end of course student should be able to
1. Understand various kinds of encryption and decryption mechanisms
2. Analyze and implement various cryptographic techniques

UnitI NETWORKSATTACKSANDTHREATS 9hours
Security Attacks (Interruption, Interception, Modification and Fabrication), Security
Services (Confidentiality, Authentication, Integrity, Non-repudiation, access Control and
Availability) and Mechanisms, A model for Internetwork security, Internet Standards
and RFCs, Buffer overflow & format string vulnerabilities, TCP session hijacking, ARP
attacks, route table modification, UDP hijacking, and man-in-the-middle attacks.

UnitII SYMMETRICCRYPTOGRAPHY 9hours
Conventional Encryption Principles, Conventional encryption algorithms, cipher block
modes of operation, location of encryption devices, key distribution Approaches of
Message Authentication, Secure Hash Functions and HMAC

UnitIII ASYMMETRICCRYPTOGRAPHYANDKEYMANAGEMENT 9hours
Public key cryptography principles, public key cryptography algorithms, digital
signatures, digital Certificates, Certificate Authority and key management Kerberos,
X.509 Directory Authentication Service E-Security certificates Generation and
assessment tools

UnitIV EMAILSECURITY 9hours
Email privacy: Pretty Good Privacy (PGP) and S/MIME. IP Security Overview, IP Security
Architecture, Authentication Header, Encapsulating Security Payload, Combining
Security Associations and Key Management Web Security Requirements, Secure Socket
Layer (SSL) and Transport Layer Security (TLS), Secure Electronic Transaction (SET).

UnitV BASICSOFDIGITALWATERMARKINGANDSTEGANOGRAPHY 9hours
Introduction: - Information Hiding, Steganography and Watermarking-Importance of
Digital watermarking- Importance of Steganography. Applications and Properties:
Applications of Watermarking - Applications of Steganography - Properties of
Watermarking Systems, Evaluating Watermarking Systems - Properties of
Steganographic and Steganalysis Systems - Evaluating and Testing Steganographic
Systems.

198
Proceedings of the 26th Academic Council held on 18.5.2012


Text/ReferenceBooks:
1. William Stallings, Network Security Essentials (Applications and Standards),
Pearson Education, 4
th
Edition, 2010
2. Dan Kaminsky, Rain Forest Puppy, Joe Grand, David Ahmad, Hal Flynn Ido
Dubrawsky, Steve W.Manzuik and RyanPermeh, Hack Proofing your network by
Ryan Russell, wiley Dreamtech, 2
nd
Edition, Syngress Publishers, 2002
3. Eric Maiwald, Fundamentals of Network Security, McGraw-Hill Osborne Media; 1
st

edition, 2003
4. Whitman, Thomson, Principles of Information Security, Course Technology, 4
th

edition, 2011
5. Stallings, Cryptography and Network Security, Principles and Practices, 5
th
edition,
2010
6. Robert Bragg, Mark Rhodes, Network Security: The complete reference, McGraw-Hill
Osborne Media; 1 edition, 2003
7. I. J. Cox et. al, Digital Watermarking and Steganography published by The Morgan
Kaufmann publisher, Second edition , 2008

ModeofEvaluation : Tests, Assignments and Seminar

RecommendedbytheBoardof
Studieson

DateofApprovalbytheAcademic
Council











199
Proceedings of the 26th Academic Council held on 18.5.2012


CSE223PRINCIPLESOFPROGRAMMING

L T P C
3 0 0 3
VersionNo.
Course
Prerequisites:


Student should have basic knowledge in any Programming language
Objectives:
To make the Students learn various types of programming practices and their
representations and to deliver quality programs with well defined programming
concepts.

ExpectedOutcome:
The students should be able to write efficient programs using various methodologies

UnitNo.I Introduction 7hours


Preliminaries: Reasons for studying Concepts of Programming Languages, Programming
Domains, Language Evaluation Criteria Influences on Language Design Language
Categories Language Design Trade- offs, Implementation Methods, Programming
Environments, Evolution of the Major Programming Languages.

UnitNo.II ImperativeProgramming 11hours
Describing Syntax and Semantics: Problem of Describing Syntax - Formal Methods for
Describing Syntax, Attribute Grammar, Dynamic Semantics Lexical and Syntax
Analysis: Lexical Analysis, Parsing Problem. Names, Binding, Type checking and scopes:
Names Variables Concept of Binding Strong Typing Type Compatibility Scope &
Life time. Data Types: Primitive Character String User Defined Array Associative
Arrays Record Union Set Pointers Abstract Data Types.

UnitNo.III AssignmentStatementsandControlStructures 7hours
Arithmetic Expressions Overload Operators Type Conversions Relational and
Boolean Expressions Short-Circuit Evaluation - Assignment Statements. Statement
Level Control structures: Selection Iterative Statements, Unconditional Branching
and Guarded Commands.

UnitNo.IV SubprogramsandExceptionHandling 11hours
Subprograms: Fundamentals Design Issues Local Referencing Parameter Parsing
Overloaded Subprograms Implementing Sub Programs. Exception Handling:
Introduction Exception Handling in Ada, C++, Java. Event Handling.

UnitNo.V ObjectOrientedandFunctionalProgramming 10hours
Object Oriented Programming Design Issues Support for Object Oriented
Programming in Small talk, C++. Object Model of Java Script, Implementation Object
Oriented Constructs. Functional Programming: Mathematical Functions, Fundamentals
of Functional Programming Languages, An Introduction to Scheme, LISP, COMMON LISP
and ML. Applications of Functional Languages.


200
Proceedings of the 26th Academic Council held on 18.5.2012

Text/ReferenceBooks
1. Robert W. Sebesta, Concepts of Programming Languages, 9
th
Edition, Addison
Wesley, 2010.
2. Ravi Sethi, Programming Languages: Concepts and Constructs, 2
nd
Edition, Pearson
Education, 2006.
3. Terrence W. Pratt and Marvin V. Zelkowitz, Programming Language Design and
Implementation, 4
th
Edition, Prentice Hall of India, 2010.
4. Allen B. Tucker and Robert Noonan, Programming Languages Principles and
Paradigms, TMH 2006.

ModeofEvaluation : Tests, Assignments and Seminar

RecommendedbytheBoardof
Studieson

DateofApprovalbytheAcademic
Council

















201
Proceedings of the 26th Academic Council held on 18.5.2012

CSE320MULTICOREARCHITECTURE L T P C
3 0 0 3
VersionNo:


Course
Prerequisites:


Computer Architecture and Organization
Objectives:
To differentiate between a single processor and multi-core processor
1. To understand fundamentals of parallel programming models
2. To parallelize serial programs and develop a parallel application
3. To use profiling and debugging tools for multi-core systems
ExpectedOutcomes:
At the end of course student should be able to:
Participate in the development of applications on multi-core systems

UnitI INTRODUCTIONTOMULTICOREARCHITECTURES 10hours
Overview of Single core processor Architecture and its limitations, Architectural
Innovations, Need for Multi-core Processor and its Limitations, Classification Multi-
cores, Multicore system software stack

UnitII PROGRAMMINGWITHTHREADS 9hours
Thread libraries, Thread creation , Scheduling, Memory management and memory,
locators Synchronization and atomic operations

UnitIII PROGRAMMINGWITHOPENMP 9hours
OpenMP parallelization, OpenMP loop and functional, parallelization, OpenMP
scheduling, Extensions in the context of multicore processors.

UnitIV CUDAPROGRAMMINGMODEL 10hours
Introduction to CUDA programming, CUDA Threads, CUDA Memory, Control Flow, CUDA
features and tools, CUDA examples.

UnitV TRANSACTIONALMEMORY 10hours
Programming with transactions, Optimizing transactions, Non-blocking data structures
and synchronization. Case Study I: Intel Montecito, Case Study II: IBM Power5, Case
Study III: IBM Cell, Case Study IV: Sun Niagara or Ultrasparc
Text/ReferenceBooks
1. Shameem Akhter and Jason Roberts, Multi-Core Programming, Intel Press,1
st
edition,
2006
2. Michael j Quin, Parallel Computing, Theory & Practices, McGraw Hill,2002
3. David B. Kirk , Wen-mei W. Hwu, Programming Massively Parallel Processors: A
Hands-on Approach, Morgan Kaufmann, 1
st
edition, 2010
4. The Free Lunch Is Over: A Fundamental Turn Toward Concurrency in Software.
Herb Sutter. Dr. Dobbs Journal, March 2005
5. David Culler , J. P. Singh , Anoop Gupta, Parallel Computer Architecture: A
Hardware/Software Approach, Morgan Kaufmann, 2001

ModeofEvaluation : Tests, Assignments and Seminar
RecommendedbytheBoardofStudieson
DateofApprovalbytheAcademicCouncil

202
Proceedings of the 26th Academic Council held on 18.5.2012

CSE331PATTERNCLASSIFICATION L T P C
3 0 0 3
VersionNo.
CoursePrerequisites: Linear Algebra

Objectives:
To enable the students to understand the fundamentals of pattern recognition
ExpectedOutcomes:
On completion of the course, the students will be able
1. To learn how to choose an appropriate feature set for pattern recognition
2. To analyze clustering and other pattern recognition problems
UnitI Introduction to Pattern Recognition and Bayesian
DecisionTheory
9hours
Introduction: Machine Perception Pattern Recognition Systems Design Cycle
Learning and Adaptation.
Bayesian Decision Theory: Discriminant Functions and Decision Surfaces Bayesian
Classification for Normal Distributions Estimation of Unknown Probability Density
Functions.
UnitII LinearClassifiers 9hours
Linear Discriminant Functions and Decision Hyperplanes Least Square Methods: Mean
square error estimation Stochastic approximation and LMS algorithm Sum of error
squares estimation. Support Vector Machines (SVM): Separable Classes and Inseparable
Classes Geometric View point of SVM Reduced Convex Hulls.
UnitIII NonlinearclassifiersandFeatureSelection 9hours
X-OR problem SVM for Non-linear case Decision Trees Combining Classifiers.
Pre-procesisng: Outlier removal Data normalization Missing Data, ROC Curve,
Feature Subset Selection Optimal Feature Generation.
UnitIV FeatureGenerationMechanisms 9hours
Linear Transforms: Basis Vectors and Images Karhunen-Loeve Transform Singular
Value Decomposition Principal Component Analysis Nonlinear Component Analysis -
Independent Component Analysis.
UnitV ClusteringAlgorithms 9hours
Clustering Concepts Proximity Measures Agglomerative Clustering - Hierarchical
Clustering Graph Theory Methods Fuzzy Clustering Algorithms k-means algorithm
k-medoids algorithm Vector Quantization.

Text/ReferenceBooks
1. Sergios Theodoridis and Konstantinos Koutroumbus, Pattern Recognition, Third
Edition, 2006. Elsevier (USA).
2. Duda and Hart, Pattern Classification, Second Edition, A Wiley-Interscience,
Publication, 2006.
ModeofEvaluation : Tests, Assignments and Seminar

Recommendedbythe
BoardofStudieson

DateofApprovalbythe
AcademicCouncil

203
Proceedings of the 26th Academic Council held on 18.5.2012

CSE423GAMINGENGINEERING L T P C
3 0 0 3
VersionNo.
Course
Prerequisites:

Internet and Web Programming

Objectives
1. To study basic concepts and techniques for developing computer games.
2. To study basic game programming techniques using XNA Game Studio.
3. To study from modeling to animation, and from scene setup to texture creation and
rendering, lighting, rigging, and ultimately, full animation using Blender (An open
source tool)
ExpectedOutcome
The students will be able to:
1. Develop games for Windows PC, mobiles and Xbox 360.
2. Implement 2D and 3D graphical techniques and structures to render complex scenes.
3. Understand the animation techniques to model characters and motions. Understanding
the concepts of artificial intelligence, path planning, collision detection etc.,
4. Implement game-related projects independently using XNA Game Studio.

UnitI GAMEDESIGNING 9hours
Introduction to Blender, Installation of Blender, Blender interface, Adding new objects,
moving things around, modeling, lighting and procedural texture, U-V mapping.

UnitII RIGGINGANDANIMATION 9hours
Rigging:Automatic Key Framing, Rigging with bones, Rigging a simple character, Walk
Cycles, Lip synching.
Animation: Compositing node editor, Lighting adjustments, Practical examples of
compositing, video sequence editor.

UnitIII GAMEDEVELOPMENT 9hours
Introduction to XNA, Installation, Creating first XNA application, Adding sprite to a
project, User Input and collision detection.

UnitIV GAMESCRIPTING 9hours
Adding Object oriented Design, Sound Effects and Audio and Basic Artificial Intelligence.

UnitV 3DGAMES 9hours
3D game development, 3D Models, 3D collision detection and shooting, Creating first
person Camera, HLSL Basics, Wrapping and Deploying 3D Games

Text/ReferenceBooks
1. Beginning Blender: Open Source 3D Modeling, Animation, and Game Design by
Lance Flavell, 2010 edition.
2. Learning XNA 4.0 by Aeron Reed, 2011 edition.

ModeofEvaluation : Tests, Assignments and Seminars
Recommendedbythe
BoardofStudieson
DateofApprovalbythe
AcademicCouncil
204
Proceedings of the 26th Academic Council held on 18.5.2012

Das könnte Ihnen auch gefallen