DEPARTMENT OF COMPUTER

SCIENCE & INFORMATION

TECHNOLOGY
HIMIGIRI ZEE UNIVERSITY, DEHRADUN

BACHELOR OF TECHNOLOGY IN
COMPUTER SCIENCE & ENGINEERING
COURSE STRUCTURE & SYLLABUS
(With effect from the academic year 2016)

1
 B.Tech – CSE
(course content semester wise - with Credit System)
Table 1: Credit Representation

Lectures Tutorials Practical Work Credits Total

(Hrs/wk/ (Hrs/wk/Sem.) (Hrs/wk/Sem.) (L: T: P) Credits
Sem.)
3 0 0 3:0:0 3
2 1 0 2:1:0 3
2 0 2 2:0:1 3
2 1 2 2:1:1 4

Course Load: Every student to register for a set of Courses in each Semester, with the total number of
their Credits being limited by considering the permissible weekly Contact Hours (typically: 30/Week);
For this, an average Course Load of 22 Credits/Semester (e.g., 6-7 Courses) generally acceptable; To
include also 3 Units of Non-Credit Mandatory Courses in some Semesters.

Semester 1st
Code Course title Credit L T P Int Ext Total
MATH-101 Mathematics – I 4 3 1 0 40 60 100
PHY-103 Engg. Physics 4 3 1 0 40 60 100
HUM-105 Basic Technical Communication – I 3 3 0 0 40 60 100
ME-107 Basic Mechanical Engineering 4 3 1 0 40 60 100
ECE-109 Fundamentals of Electronic Engineering 4 3 1 0 40 60 100
HUM-111 Environmental Studies 2 2 0 0 40 60 100
PHY-113 Lab-1 Physics 1 0 0 2 30 20 50
EE-115 Lab-2 Basic Electrical Engineering 1 0 0 2 30 20 50
CE-117 Lab-3 Engineering Drawing 1 0 0 2 30 20 50
ECE-119 Lab-4 Fundamentals of Electronic 1 0 0 2 30 20 50
Engineering
Total 25 17 4 8 360 480 800
Total hours = 29 hours/week (L+T+P)

Semester 2nd
Code Course title Credit L T P Int Ext Total
MATH102 Mathematics – II 4 3 1 0 40 60 100
CHE-104 Engg. Chemistry 4 3 1 0 40 60 100
HUM-106 Advanced Technical Communication – I 3 3 0 0 40 60 100
EE-108 Basic Electrical Engineering 4 3 1 0 40 60 100
CSE-110 Fundamentals Computer & Programming 4 3 1 0 40 60 100
ME-112 Lab-1 Basic Mechanical Engineering 1 0 0 2 30 20 50
CSE-114 Lab-2 Fundamentals Computer & 1 0 0 2 30 20 50
Programming
ME-116 Lab-3 Workshop Practice 1 0 0 2 30 20 50
CHY-118 Lab 4- Chemistry 1 0 0 2 30 20 50

2
Total 15 22 4 6 290 460 700
Total hours = 32hours/week (L+T+P)
Semester 3rd
Subject code Credit L T P Int Ext Total
Course title
Math-201 Discrete structures 4 3 1 0 40 60 100
CSE203 Computer based numerical & statistical 4 3 1 0 40 60 100
CSE205 Data structures 4 3 1 0 40 60 100
CSE207 Digital electronics & design aspect 4 3 1 0 40 60 100
CSE209 Principle of programming languages 2 2 0 0 40 60 100
CSE211 Engineering economics & costing 4 3 1 0 40 60 100
Practicals 1 0 0 2 30 20 50
CSE213 Data structure lab 1 0 0 2 30 20 50
CSE217 Digital electronics 1 0 0 2 30 20 50
CSE215 Programming lab 1 0 0 2 30 20 50
Total 25 17 5 6 330 420 750
Total hours = 28 hours/week (L+T+P)

Semester 4:
Subject Course title Credit L T P Int Ext Total
Code
CSE202 Computer Organization 2 2 0 0 40 60 100
CSE204 Unix & Shell Programming 4 3 1 0 40 60 100
CSE206 Theory Of Automata & Formal Language 4 3 1 0 40 60 100
CSE208 Database Management System 4 3 1 0 40 60 100
CSE210 Microprocessor 4 3 1 0 40 60 100
CSE212 Software Engineering 4 3 1 0 40 60 100
Practicals
CSE214 Unix & Shell Programming Lab 1 0 0 2 30 20 50
CSE216 Database Management System Lab 1 0 0 2 30 20 50
CSE218 Microprocessor Lab 1 0 0 2 30 20 50
Total 25 17 5 6 330 420 750
Total hours = 28 hours/week (L+T+P)

Semester 5:
Subject Course title Credit L T P Int Ext Total
Code
CSE301 Computer Graphics 4 3 1 0 40 60 100
CSE303 Operating Systems 4 3 1 0 40 60 100
CSE305 Design & Analysis of Algorithms 4 3 1 0 40 60 100
CSE307 Object Oriented Programming 4 3 1 0 40 60 100
MGMT Industrial Economics & Principles of 4 3 1 0 40 60 100
309 Management
Practicals
CSE311 Computer Graphics Lab 1 0 0 2 30 20 50
CSE313 Design & Analysis of Algorithms Lab 1 0 0 2 30 20 50
CSE315 Object oriented programming using Java/ C+ 1 0 0 2 30 20 50
+

3
 23 15 5 6 290 360 650
Total hours = 26 hours/week (L+T+P)

Semester 6:
Subject Course title Credit L T P Int Ext Total
Code
CSE302 Compiler Design 4 3 1 0 40 60 100
CSE304 Computer Networks 4 3 1 0 40 60 100
CSE306 Artificial Intelligence 4 3 1 0 40 60 100
CSE308 Graph Theory 4 3 1 0 40 60 100
CSE310 Organizational Behavior 4 3 1 0 40 60 100
Practicals
CSE312 Compiler Design Lab 1 0 0 2 30 20 50
CSE314 Computer Networks Lab 1 0 0 2 30 20 50
CSE316 Artificial Intelligence Lab 1 0 0 2 30 20 50
Total 23 15 5 6 290 360 650
Total hours = 26 hours/week (L+T+P)

Semester 7:
Subject Course title Credit L T P Int Ext Total
Code
CSE401 Introduction to Web Technology 4 3 1 0 40 60 100
CSE403 Advanced Computer Architecture 4 3 1 0 40 60 100
CSE405 Elective-I 4 3 1 0 40 60 100
CSE407 Elective-II 4 3 1 0 40 60 100
CSE409 Simulation and Modeling 4 3 1 0 40 60 100
Practicals
CSE411 Web technology Lab 1 0 0 2 30 20 50
CSE413 Advanced Computer Architecture Lab 1 0 0 2 30 20 50
CSE415 Seminar on Industrial Interaction 1 0 0 2 30 20 50
Total 23 15 5 6 290 360 650
Total hours = 26 hours/week (L+T+P)

Choose one Subject from each Elective

Code Elective I
CSE405 Digital Image Processing
CSE405 Network Programming & Administration
CSE405 Real Time System
CSE405 Wireless Networks
CSE405 OOSE
Code Elective II
CSE407 Cryptography & Network Security
CSE407 .Net Technologies & Visual Programming
CSE407 System Software and Administration
CSE407 Soft Computing
CSE407 Advanced DBMS

4
Semester 8:
Subject Code Course title Credit L T P Int Ext Total
CSE402 Distributed System 4 3 1 0 40 60 100
CSE404 Mobile Computing 4 3 1 0 40 60 100
CSE406 *Elective-III 4 3 1 0 40 60 100
CSE408 *Elective-IV 4 3 1 0 40 60 100
Practicals
CSE410 Colloquium 2 0 0 4 40 60 100
CSE412 Project Work 2 0 0 4 40 60 100
CSE414 Extra Curricular Activities 1 0 0 2 20 30 50
Total 21 12 4 10 260 390 650
Total hours = 26 hours/week (L+T+P)

Code Elective-III
CSE406 Embedded Systems
CSE406 Parallel Computing
CSE406 Multimedia Communication & System Design
CSE406 Pattern Recognition
CSE406 Natural Language Processing
CSE406 Decision Support System
Code Elective-IV
CSE408 Cloud computing
CSE408 Data Mining & Date Warehousing
CSE408 Computational Geometry
CSE408 Granular Computing
CSE408 Storage Networks
CSE408 Big Data Analytics

5
 Semester :III
Course Name: Discrete Structures Evaluation
Components
Course Code: MATH-201 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
To Solve differential calculus, Integral Calculus of certain types and interpret the solutions
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Set Theory: Definition of sets, countable and uncountable sets, Venn
Diagrams, proofs of some general identities on sets.
Relation: Definition, types of relation, composition of relations, Pictorial
representation of relation, equivalence relation, partial ordering relation. 10
Function: Definition, type of functions, one to one, into and onto function,
inverse function, composition of functions, recursively defined functions.
Theorem proving Techniques: mathematical induction (simple and
strong), pigeonhole principle, prove by contradiction.
UNIT II Algebraic Structures: Definition, Properties, types: Semi Groups,
Monoid, Groups, Abelian group, properties of groups, Subgroup, cyclic
groups, Cosets, factor group, Permutation groups, Normal subgroup, 10
Homomorphism and isomorphism of Groups, example and standard
results, Rings and Fields: definition and standard results.
UNIT III Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse 08
diagram of partially, ordered set, isomorphic ordered set, well ordered set,
properties of Lattices, bounded and complemented lattices.
UNIT IV Propositional Logic: Proposition, First order logic, Basic logical 12
operation, truth tables, tautologies, Contradictions, Algebra of Proposition,
logical implications, logical equivalence, predicates, Universal and
existential quantifiers.
UNIT V Combinatorics & Graphs: Recurrence Relation, Generating function., 08
Permutation &Combination, Probabilistic Permutation & Combination
Suggested
Readings
1.Text Book 1. Y N Singh, “Discrete Mathematical Structures”(1988), Wiley India

2.Reference 1. Liptschutz, Seymour, “ Discrete Mathematics”(1999)

Books

6
 Semester :III
Course Name: Computer Based Numerical & Statistical Evaluation
Techniques Components
Course Code: CSE203 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
To provide conceptual understanding of various numerical methods in the reference to numerical solution
of non linear equation, linear equation, interpolation ,differentiation and integration etc in field of
computer application.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction: Numbers and their accuracy, Computer Arithmetic,
Mathematical preliminaries, Errors and their Computation, General error
formula, Error in a series approximation.
Solution of Algebraic and Transcendental Equation: Bisection 10
Method, Iteration method, Method of false position, Newton-Raphson
method, Methods of finding complex roots, Muller’s method, Rate of
convergence of Iterative methods, Polynomial Equations.
UNIT II Interpolation: Finite Differences, Difference tables Polynomial
Interpolation: Newton’s forward and backward formula Central
Difference Formulae: Gauss forward and backward formula, Stirling’s, 10
Bessel’s, Everett’s formula. Interpolation with unequal intervals:
Langrange’s Interpolation, Newton Divided difference formula, Hermite’s
Interpolation
UNIT III Numerical Integration and Differentiation: Introduction, Numerical 10
differentiation
Numerical Integration: Trapezoidal rule, Simpson’s 1/3 and 3/8 rule,
Boole’s rule, Waddle’s rule.
UNIT IV Solution of differential Equations: Picard’s Method, Euler’s Method, 10
Taylor’s Method,
Runge-Kutta Methods, Predictor Corrector Methods, Automatic Error
Monitoring and Stability of solution.
UNIT V Statistical Computation: Frequency chart, Curve fitting by method of 08
least squares, fitting of straight lines, polynomials, exponential curves etc,
Data fitting with Cubic splines, Regression Analysis, Linear and Non
linear Regression, Multiple regression, Statistical Quality Control
methods.
Suggested
Readings 1. Yang, “Applied Numerical Methods using MATLAB”,(2000) Wiley
1.Text Book India
2.Reference 1. Pradip Niyogi, “Numerical Analysis and Algorithms”, TMH,(1999) 1st
Books Edition.

7
 Semester :III

Course Name: Data Structures Evaluation

Components
Course Code: CSE205 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
To understand stack, queue and linked list operation and analyze algorithms and algorithm correctness.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction: Basic Terminology, Elementary Data Organization,
Structure operations, Algorithm Complexity and Time-Space trade-off
Arrays: Array Definition, Representation and Analysis, Single and
Multidimensional 10
Arrays, address calculation, application of arrays, Character String in C,
Character string operation, Array as Parameters, Ordered List, Sparse
Matrices and Vectors.
Stacks: Array Representation and Implementation of stack, Operations on
Stacks: Push & Pop, Array Representation of Stack, Linked
Representation of Stack, Operations Associated with Stacks, Application
of stack: Conversion of Infix to Prefix and Postfix Expressions,
Evaluation of postfix expression using stack.
Recursion: Recursive definition and processes, recursion, example of
recursion, Tower of Hanoi Problem, simulating recursion, Backtracking,
recursive algorithms.
UNIT II Queues: Array and linked representation and implementation of queues,
Operations on
Queue: Create, Add, Delete, Full and Empty, Circular queues, D-queues 10
and Priority Queues.
Linked list: Representation and Implementation of Singly Linked Lists,
Two-way Header
List, Traversing and Searching of Linked List, Overflow and Underflow,
Insertion and deletion to/from Linked Lists, Insertion and deletion
Algorithms, Doubly linked list,
Linked List in Array, Polynomial representation and addition, Garbage
Collection and Compaction.
UNIT III Trees: Basic terminology, Binary Trees, Binary tree representation, 08
algebraic
Expressions, Complete Binary Tree, Extended Binary Trees, Array and
Linked
Representation of Binary trees, Traversing Binary trees, Threaded Binary
trees, path length algorithm. Huffman Algorithm.
Binary Search Trees: Binary Search Tree (BST), Insertion and Deletion
in BST, Complexity of Search Algorithm.
UNIT IV Searching and Hashing: Sequential search, binary search, comparison 12
and analysis,
Hash Table, Hash Functions, Collision Resolution Strategies, Hash Table
Implementation.

8
 Sorting: Insertion Sort, Bubble Sort, Quick Sort, Two Way Merge Sort,
Heap Sort, Sorting on Different Keys.
UNIT V File Structures: Physical Storage Media File Organization, Organization 08
of records into Blocks, Sequential Files, Indexing and Hashing, Primary
indices, Secondary indices, B+
Tree index Files, B Tree index Files, Indexing and Hashing Comparisons.
Suggested
Readings
1.Text Book 1. Shukla, “Data Structures using C and C++”,(1997) Wiley India

2.Reference 1. A M. Tenenbaum, “Data Structures using C & C++”,(2000) Prentice-

Books Hall of India Pvt. Ltd., New Delhi.(2 nd ed).

Semester :III

9
Course Name: Digital Electronics & Design Aspect Evaluation
Components
Course Code: CSE207 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
To understand the current, voltage, characteristic of semiconductor devices and analysis DC circuits their
operations designed and analysis of electronic circuits and their design.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction
Characteristics of digital system, Types of Digital circuits, Number
system: Direct conversion between bases Negative numbers & BCD and
their arithmetic’s, Boolean algebra, Minimization of Boolean Functions: 06
K Map upto 6 variable and multiple output circuits error detection &
correcting codes, Hamming & cyclic codes quine mcclusky method
UNIT II Combinational Logic Circuits
Design Procedure, adders, subtractiors & code conversion, Multiplexers /
Demultiplexers, encoder/decoders, decimal adders & amplitude 10
comparators, ROM as decoder, PLA & PAL. DRC, RDC.
UNIT III Sequential Logic Circuits 08
Flip-Flops and their conversions, analysis and synthesis of synchronous
sequential circuit, excitation table, state table & diagram. Design of
synchronous counters, shift registers and their applications.
UNIT IV Logic Families 12
Diode, BJT & MOS as a switching element concept of transfer
characteristics, Input characteristics and output characteristics of logic
gates, TTL, IIL,ECL,NMOS,CMOS Tri-state logic, open collector output,
Interfacing between logic families, packing density, power consumption
& gate delay.
UNIT V Hazard, Fault Detection &Memories 12
Hazard and Fault Detection: Static and dynamic Hazard: Gate delay,
Generation of spikes, Determination of hazard in combinational circuits,
Fault detection methods: Fault Table & Path sensitizing methods.
Memories: Sequential, Random Access, NMOS & CMOS Static and
Dynamic Memory elements, one and multi-dimensional selection
arrangement, Read-only memories, Formation of memory banks, internal
& External address decoding.
Suggested
Readings
1.Text Book 1. Malini, “Digital Electronics: Principles and Integrated Circuits”(1997),
Wiley India
2.Reference 1. Digital Systems: Principles and Design,(2000) Raj Kamal, Pearson
Books

Semester :III

10
Course Name: Principle of Programming Languages Evaluation
Components
Course Code: CSE209 Credit L T P I P E Total
2 2 0 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
To understand about the basic concepts of programming.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction: Characteristics of programming Languages, Factors
influencing the evolution of programming language, developments in
program ming methodologies, desirable features and de sign issues .
Programming language processors : Structure and operations of 06
translators, software simulated computer, syntax, semantics,
structure, virtual computers, binding and binding time.
UNIT II Elementary and Structured Data Types : Data object variables ,
constants, data types , elementary data types, declaration,
assignment and initialization, enumeration, characters, strings. 05
Structured data type and objects: Specification of data
structured types, vectors and arrays, records, variable size data
structure, pointers and programmer constructed data structure, Sets
files. Sub Program and programmer defined data types: Evolution
of data types , abstractions, encapsulations, information hiding,
sub programmes, abstract data types.
UNIT III Sequence Control; Implicit and Explicit sequence control, sequence 04
control with within expression and statements, recursive sub
programes, exception handling, co routines, Scheduled sub
programmes, concurrent execution. Data control referencing
environments, static and dynamic scope, local data loc al data
referencing environment, shared data: Explicit common
environment dynamic scope parameter passing mechanism .
UNIT IV Storage Management: Major run time requirements, storage 04
management phases, static storage management, stack based, heap
based storage management. Syntax and translation: General syntactic
criteria, syntactic element of a language, stages in translation, formal
syntax and semantics.
UNIT V Operating and Programming Environment: Batch Processing 05
Environments, Embedded system requirements , Theoretical
models, Introduction to Functional Programming, Lambda calculus,
Data flow language and Object Oriented language, Comparison in
various general and special purpose programming languages e.g.
Fortran, C, Pascal, Lisp, etc .
Suggested
Readings
1.Text Book 1. Terrance W P ratt, "Programming Languages: Design and
Implementation"(2000), PHI
2.Reference 2. Sebesta, "Concept of Programming Language"(1997), Addison
Books Wesley

11
 Semester :III
Course Name: Engineering Economics & Costing Evaluation
Components
Course Code: CSE211 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
Describe the role of economics in decision making process and perform calculations and Enumerate
different cost entities in estimation and costing.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Time value of money : Simple and compound interest, Time value
equivalence, Compound interest factors, Cash flow diagrams, Calculation,
Calculation of time –value equivalences.
Present worth comparisons, Comparisons of assets with equal, unequal 08
and infinite lives, comparison of deferred investments, Future worth
comparison, payback period comparison.
UNIT II Use and situations for equivalent annual worth comparison, Comparison
of assets of equal and unequal life. Rate of return, Internal rate of return,
comparison of IIR with other methods, IRR misconceptions. 10
UNIT III Analysis of public Projects: Benefit/ Cost analysis, quantification of 08
project, cost and benefits, benefit/ cost applications, Cost –effectiveness
analysis.
UNIT IV Depreciation, computing depreciation charges, after tax economic 12
comparison, Break-even analysis; linear and non-linear models.

UNIT V Product and Process Costing, Standard Costing, cost estimation, Relevant 10
Cost for decision making, Cost control and Cost reduction techniques.
Suggested
Readings
1.Text Book 1. White, Engineering Economics,(1999) Wiley India

2.Reference 1. Horn green, C.T., Cost Accounting,(2000) Prentice Hall of India

Books

12
 Semester : III
Course Name: Data structure lab Evaluation
Components
Course Code: CSE213 Credit L T P IP EP Total
1 0 0 2 30 20 50
List of Practical

1. Write a program for Stack.

2. Write a program Queue, Circular Queue.
3. Write a program demonstrating Stack operation.
4. Write a program for Stack Using Linked List and Queue Using Array.
5. Write a program for Queue Using Linked List.
6. Write a program for Traversing of Tree Using Linked List.
7. Write a program for Tree Structure, Binary Tree, Binary Search Tree.
8. Write a program for Heap Sort and Quick Sort
9. Write a program Graph Implementation BFS,DFS
10. Write a program for Insertion and Deletion in BST.

Semester : III
Course Name: Digital electronics Evaluation
Components
Course Code: CSE217 Credit L T P IP EP Total
1 0 0 2 30 20 50
List of Practical

1. Study of TTL gates – AND; OR; NOT; NAND; NOR; EX-OR; EX-NOR.
2. Design and realize a given function using K-maps and verify its performance.
3. Implementation and Verification of Decoder/De-Multiplexer and Encoder using Logic Gates.
4. Implementation of 4x1 multiplexer using Logic Gates.
5. To Design & Verify the Operation of Magnitude Comparator
6. To verify the truth tables of S-R; J-K; T and D type flip flops
7. Design, and Verify the 4- Bit Synchronous Counter
8. Design, and Verify the 4-Bit Asynchronous Counter.

13
 9. To verify the operation of bi-directional shift register.
10. Implementation of 4-Bit Parallel Adder Using 7483 IC.

Semester : III
Course Name: Programming Lab Evaluation
Components
Course Code: CSE215 Credit L T P IP EP Total
1 0 0 2 30 20 50
List of Practical

1. Write a program to become familiar with different data types, Operators and Expressions in C
2. Write a program to understand the programming knowledge using Decision Statements (if, if-else, if-
else-if ladder, switch and GOTO)
3. Write a program to successfully implement Loop & nested loop Statements (for, while, do-while)
4. Write a program to understand the Array (2D, 3D).
5. Write a program to understand function programming, its types and function-call.
6. Write a program to understand the concept for Pointer.
7. Write a program to understand the concept of programming with String.
8. Write a program to understand Function call by reference.
9. To understand programming with Structure.
10. To understand data files and file handling in C.

Semester :IV
Course Name: Computer Organization Evaluation
Components
Course Code: CSE202 Credit L T P I P E Total

14
 2 2 0 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
To Design a pipeline for consistent execution of instructions with minimum hazards and also understand
alternatives in cache design and their impacts on cost/performance.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Register Transfer Language, Bus and Memory Transfers, Bus
Architecture, Bus Arbitration, Arithmetic Logic, Shift Microoperation,
Arithmetic Logic Shift Unit, Design of Fast address, Arithmetic
Algorithms (addition, subtraction, Booth Multiplication), IEEE standard 04
for Floating point numbers.
UNIT II Control Design:
Hardwired & Micro Programmed (Control Unit): Fundamental Concepts
(Register Transfers, performing of arithmetic or logical operations, 04
fetching a word from memory, Storing a word in memory), Execution of a
complete instruction, Multiple-Bus organization, Hardwired Control,
Micro programmed control(Microinstruction, Microprogram sequencing,
Wide-Branch addressing, Microinstruction with Next-address field,
Prefetching Microinstruction).
UNIT III Processor Design: 06
Processor Organization: General register organization, Stack organization,
Addressing mode, Instruction format, Data transfer & manipulations,
Program Control, Reduced Instruction Set Computer.
Input-Output Organization:
I/O Interface, Modes of transfer, Interrupts & Interrupt handling, Direct
Memory access, Input- Output processor, Serial Communication.
UNIT IV Memory Organization: 05
Memory Hierarchy, Main Memory (RAM and ROM Chips), organization
of Cache Memory, Auxiliary memory, Cache memory, Virtual Memory,
Memory management hardware.
UNIT V Parallel Processing, Pipelining- Arithmetic Pipelining, Instruction 05
Pipelining, RISC Pipelining, Vector Processing, Array Processor.
Multiprocessor: Characteristic of Multiprocessor, Interconnection
Structure, Interprocessor Arbitration, Cache Coherence
Suggested Aquaculture principles and practices ----TVR Pillay and MN Kutty ,
Readings Encyclopedia of aquaculture ----RR Stickney,
1.Text Book 1. Computer Organization,(2000) John P.Hayes, McGraw Hill, 3 rd
Edition.
2.Reference
Books 1. Fundamentals of Computer Organization and Design, Dadamundi,
(1986) Wiley India
2. Computer System Architecture, M. Mano,(2002) Pearson

Semester :IV
Course Name: Unix & Shell Programming Evaluation
Components
Course Code: CSE204 Credit L T P I P E Total

15
 4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
To unix operating system and comparing it with windows OS. Overview to open source software. Writing
and studying about how to execute C program in Unix environment using GCC compiler along with
phases of compilation.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction
Introduction to UNIX, UNIX system organization (the kernel and the
shell), Unix File System, Basic file attributes, Editors (vi and ed). 06
UNIT II General Purpose Utilities: cal, date, echo, script, mailx, passwd, who,
uname, tty, sty, cat, cp,rm, mv, more, file, wc, od, cmp, comm, diff, lp,
banner, dos2unix, and unix2dos, gzip and gunzip, zip and unzip. 10
UNIT III Unix Shell programming: Types of Shells, Shell Metacharacters, Shell 10
variables, Shell scripts, Shell commands, the environment, Integer
arithmetic and string Manipulation, Special command line characters,
Decision making and Loop control, controlling terminal input, trapping
signals, arrays.
UNIT IV Unix System Administration: File System, mounting and unmounting file 12
system, System booting, shutting down, handling user account
UNIT V Backup: Recovery, security, creating files, storage of Files, Disk related 10
commands, User quota and accounting.
Suggested
Readings
1.Text Book 1. Saurabh, “UNIX Programming: The First Drive”, Wiley India, 2004

2.Reference 1. Sumitabh Das, “Unix Concepts and applications”, TMH, 2003

Books 2. Johnson , Shell scripting, Wiley, 2003

Semester :IV
Course Name: Theory Of Automata & Formal Language Evaluation
Components

16
Course Code: CSE206 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome It provides a formal connection between algorithm , problem solving and theory of
languages which develop them into a mathematical view towards algorithm design an computation itself.

Unit No Content Lecture

Hrs/contact
Hrs
UNIT 1 Introduction to defining language, Kleene closures, Arithmetic
expressions, defining grammar, Chomsky hierarchy, Finite Automata 06
(FA), Transition graph, generalized transition graph.
UNIT II Nondeterministic finite Automata (NFA), Deterministic finite Automata
(DFA), Construction of DFA from NFA and optimization, FA with
output: Moore machine, Mealy machine and Equivalence, Applications 08
and Limitation of FA.
UNIT III Arden Theorem, Pumping Lemma for regular expressions, Myhill-Nerode 10
theorem, Context free grammar: Ambiguity, Simplification of CFGs,
Normal forms for CFGs, Pumping lemma for CFLs, Decidability of
CFGs, Ambiguous to Unambiguous CFG.
UNIT IV Push Down Automata (PDA): Description and definition, Working of 12
PDA, Acceptance of a string by PDA, PDA and CFG, Introduction to
auxiliary PDA and Two stack PDA.
UNIT V Turing machines (TM): Basic model, definition and representation, 12
Language acceptance by
TM, TM and Type – 0 grammar, Halting problem of TM, Modifications
in TM, Universal TM, Properties of recursive and recursively enumerable
languages, unsolvable decision problem, undecidability of Post
correspondence problem, Church‟s Thesis, Recursive function theory.
Suggested
Readings
1.Text Book 1. Cohen, “Introduction to Computer theory”,(2000) Wiley India

2.Reference 1. Hopcroft, Ullman, “Introduction to Automata Theory, Language and

Books Computation”,
Nerosa Publishing House, 3rd Edition, 2006
2. K.L.P. Mishra and N.Chandrasekaran, “Theory of Computer
Science(Automata,
Languages and Computation)”, PHI, 3rd Edition, 2010

Semester :IV
Course Name: Database Management System Evaluation
Components
Course Code: CSE208 Credit L T P I P E Total
4 3 1 0 40 - 60 100

17
Prerequisite Course and code (if any)
Course Outcome
To Design ER-models to represent simple database application scenarios and also Design ER-models to
represent simple database application scenarios
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction: An overview of database management system, database
system Vs file system, Database system concepts and architecture, data
models schema and instances, data independence and data base language
and interfaces, Data definitions language, DML, Overall Database 10
Structure.
Data Modeling using the Entity Relationship Model: ER model
concepts, notation for ER diagram, mapping constraints, keys, Concepts
of Super Key, Candidate key, primary key, Generalization, aggregation,
reduction of an ER diagrams to tables, Extended ER model, relationships
of higher degree.
UNIT II Relational data Model and Language: Relational data model concepts,
integrity constraints: entity integrity, referential integrity, Keys
constraints, Domain constraints, relational algebra, relational calculus, 10
tuple and domain calculus.
Introduction to SQL: Characteristics of SQL. Advantage of SQL. SQL
data types and literals. Types of SQL commands. SQL operators and their
procedure. Tables, views, Queries and sub queries. Aggregate functions.
Insert, update and delete operations. Joins, Unions, Intersection, Minus,
Cursors in SQL.
UNIT III Data Base Design & Normalization: 08
Functional dependencies, normal forms, first, second, third normal forms,
BCNF, inclusion dependences, loss less join decompositions,
normalization using FD, MVD, and JDs, alternative approaches to
database design.
UNIT IV Transaction Processing Concepts: Transaction system, Testing of 12
serializability, Serializability of schedules, conflict & view serializable
schedule, recoverability, Recovery from transaction failures, log based
recovery, checkpoints, deadlock handling.
UNIT V Concurrency Control Techniques: Concurrency control, locking 08
Techniques for concurrency control, Time stamping protocols for
concurrency control, validation based protocol, multiple granularity, Multi
version schemes, Recovery with concurrent transaction.
Suggested 1. Korth, Silbertz, Sudarshan, “Database Concepts”, McGraw Hill, 5th
Readings Edition, 2008
1.Text Book 1. Elmasri, Navathe, “Fundamentals Of Database Systems”(2000),
2.Reference Addision Wesley,5th edition
Books 2. Gillenson, “Fundamentals of Database Management Systems”,(2007)
Wiley India
Semester :IV
Course Name: Microprocessor Evaluation
Components
Course Code: CSE210 Credit L T P I P E Total
4 3 1 0 40 - 60 100

18
Prerequisite Course and code (if any)
Course Outcome
to write programs to run on 8086 microprocessor based systems and Understand and devise techniques for
faster execution of instructions, improve speed of operations and enhance performance of microprocessors.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction – Microprocessors Evolution and types (Intel 4004 –
Pentium IV and road maps), Overview of 8085, 8086, 80286, 80386,
80486, Pentium processors and Micontrollers. 08
UNIT II Architecture of 8086 – Register Organization, Execution unit, Bus
Interface Unit, Signal, Description, Physical Memory Organization,
General Bus Operation, I/O addressing capabilities, Minimum mode and 08
maximum mode timing diagrams, Comparison with 8088
UNIT III 8086 programming – Assembly language program development tools 10
(editor, linker, loader, locator, Assembler, emulator and Debugger),
Addressing modes, Instruction set descriptions.
UNIT IV Assembler directives and operators, Procedures and Macros. (Writing 12
programs for use with an assembler MASM),8086 Interfacing –
Interfacing 8086 with semiconductor memory, 8255, 8254/ 8243, 8251,
8279.
UNIT V A/D and D/A converters, Numeric processor 8087, I/O processor 8089, 10
Bus Interface( USB,PCI).
Suggested
Readings
1.Text Book 1. D.V. Hall, “Microprocessors and Interfacing”, TMH, 2 Ed. 1991.

2.Reference 1. Barry B Brey, “INTEL Microprocessors”, Prentice-Hall.2001

Books 2. Y.-C. Liu and G. A. Gibson, “Microprocessor Systems: The 8086/8088
family Architecture, Programming & Design”, PHI, 2000.

Semester :IV
Course Name: Software Engineering Evaluation
Components
Course Code: CSE212 Credit L T P I P E Total
4 3 1 0 40 - 60 100

19
Prerequisite Course and code (if any)
Course Outcome
To Design and plan software solutions to problems using an object-oriented strategy and improve the
specification of a software system.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction
Introduction to Software Engineering, Software Characteristics, Software
Crisis, Software Engineering Processes, Software Development Life Cycle
(SDLC) Models: Water Fall Model, Prototype Model, Spiral Model, 10
Evolutionary Development Models, Iterative Enhancement Models.
UNIT II Software Requirement Specifications (SRS)
Requirement Engineering Process: Elicitation, Analysis, Documentation,
Review and Management of User Needs, Feasibility Study, Information 10
Modeling, Data Flow Diagrams, Entity Relationship Diagrams, Decision
Tables, SRS Document, IEEE Standards for SRS. Software Quality
Assurance (SQA),SEI-CMM Model.
UNIT III Software Design 10
Basic Concept of Software Design, Architectural Design, Low Level Design:
Modularization, Design Structure Charts, Pseudo Codes, Flow Charts,
Coupling and Cohesion Measures, Design Strategies: Function Oriented
Design, Object Oriented Design, Top-Down and Bottom-Up Design.
Software Measurement and Metrics: Various Size Oriented Measures:
Halestead’s Software Science, Function Point (FP) Based Measures,
Cyclomatic Complexity Measures: Control Flow Graphs.
UNIT IV Coding & Testing 10
Top-Down and Bottom –Up programming, structured programming,
Compliance with Design and Coding Standards. Testing Objectives, Unit
Testing, Integration Testing, Acceptance Testing, Regression Testing, Top-
Down and Bottom-Up Testing Strategies: Test Drivers and Test Stubs,
Structural Testing (White Box Testing), Functional Testing (Black Box
Testing)
UNIT V Software Maintenance 08
Corrective and Perfective Maintenance, Cost of Maintenance, Software Re-
Engineering, Reverse Engineering. Constructive Cost Models (COCOMO)
Suggested
Readings
1.Text 1. Pankaj Jalote, Software Engineering , Wiley India2000
Book
1. Rajib Mall, Fundamentals of Software Engineering, PHI Publication, 3rd
2.Referen Edition2001.
ce Books 2. K. K. Aggarwal and Yogesh Singh, Software Engineering, New Age
International2003 Publishers,3rd Edition.

20
 Semester : IV
Course Name: Unix & Shell Programming Lab Evaluation
Components
Course Code: CSE214 Credit L T P IP EP Total
1 0 0 2 30 20 50
List of Practical

1. Use Vi editor to create a file called myfile.txt which contain some text. Correct typing errors during
creation, Save the file & Logout of the file
2. Open the file created in Exp 1, Add, Change, delete & Save the changes
3. Use the cat command to create a file containing the following data. Call it mutable use tabs to separate
the fields 1425 ravi 15.65, 4320 ramu 26.27, 6830 sita 36.15, 1450 raju 21.86

4. Use the cat command to display the file, my table, use vi command to correct any errors in the file, my
table, use the sort command to sort the file my table according to the first field. Call the sorted file my
table(same name) & print the file my table

5. Use the cut & paste commands to swap fields 2 and 3 my table. Call it my table(same name) & print
the new file, my table.

6. Use the date and who commands in sequence ?(in one line) such that the output of date will display on
the screen and the output of who will be redirected to a file called my file2.Use the more command to
check the contents of myfile2.

7. Develop an interactive grep script that asks for a word and a file name and then tells how many lines
contain that word.

8. Write A shell script that takes a command –line argument and reports on whether it is Directory ,a file,
or something else

9. Write a shell script that accepts one or more file name as a arguments and converts all of them to
uppercase, provided they exits in the current directory.

10. Write a shell script that determines the period for which a specified user is working on the system

Semester : IV
Course Name: Database Management System Lab Evaluation
Components
Course Code: CSE216 Credit L T P IP EP Total

21
 1 0 0 2 30 20 50
List of Practical

1. Write the queries for Data Definition and Data Manipulation Language.
2. Write SQL queries using logical operations (=,<,>,etc) and SQL operators
3. Write SQL query using character, number, date and group functions
4. Write SQL queries for relational algebra
5. Write SQL queries for extracting data from more than one table
6. Write SQL queries for sub queries, nested queries
7. Write programme by the use of PL/SQL
8. Concepts for ROLL BACK, COMMIT & CHECK POINTS
9. Create VIEWS, CURSORS and TRGGERS & write ASSERTIONS.
10. Create FORMS and REPORTS.

Semester : IV
Course Name: Microprocessor Lab Evaluation
Components
Course Code: CSE218 Credit L T P IP EP Total
1 0 0 2 30 20 50
List of Practical

1. To study 8085 microprocessor System.

2. To study 8086 microprocessor System.
3. To develop and run a programme to find out largest and smallest number.
4. To develop and run a programme for converting temperature from F to C degree.
5. To develop and run a programme to compute square root of a given number
6. To develop and run a programme for computing ascending/descending order of a number.
7. To perform interfacing of RAM chip to 8085/8086.
8. To perform interfacing of keyboard controller.
9. To perform interfacing of DMA controller.
10. To perform interfacing of UART/USART.

22
 Semester :V
Course Name: Computer Graphics Evaluation
Components
Course Code: CSE301 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
Have a basic understand of core concepts of computer graphics and capable of using open GI to create
interactive computer graphics, understand a typical graphics pipeline and made pictures with the computer.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Line generation: Points lines, Planes, Pixels and Frame buffers, vector
and character generation. Graphics Primitives: Display devices, Primitive
devices, Display File Structure, Display control text. 10
UNIT II Polygon: Polygon Representation, Entering polygons, Filling polygons.
Segments : Segments table, creating deleting and renaming
segments, visibility, image transformations. 10
UNIT III Transformations: Matrices transformation, transformation routines, 08
displays procedure. Windowing and Clipping: Viewing transformation
and clipping, generalize clipping, multiple window ing.
UNIT IV Three Dimension: 3-D geometry primitives, transformations, projection 10
clipping. Interaction: Hardware input devices handling algorithms, Event
handling echoing, Interactive techniques.
UNIT V Hidden Line and Surface: Back face removal algorithms, hidden line 10
methods.
Rendering and Illumination: Introduction to curve generation, Bezier,
Hermite and B -spline algorithms and their comparisons.
Suggested Aquaculture principles and practices ----TVR Pillay and MN Kutty ,
Readings
1.Text 1. R ogers, "P rocedural E lements of Computer Graphics"(2000), Mc Graw
Book Hill
1. Asthana, Sinha, "Computer Graphics", Add ison Wesley Newman
2.Referen and Sproul, "Principle o f Interactive C omputer Graphics"(2000), McGraw
ce Books Hill
2. Steven Harrington, "Computer Graph ics"(2001), A Programming
Approach, 2nd Edition

23
 Semester :V
Course Name: Operating Systems Evaluation
Components
Course Code: CSE303 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
To understand the structure of OS and basic architectural components involved in OS design and
Understand the Mutual exclusion, Deadlock detection and agreement protocols of Distributed operating.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction: Operating System and Function, Evolution of Operating
System, Batch, Interactive, Time Sharing and Real Time System,
System Protection. Operating System Structure: System Components,
System Structure, Operating System Services. 06
UNIT II Concurrent Processes: Process Concept, Principle of
Concurrency, Producer Consumer Problem, Critical Section, Problem,
Semaphores, Classical Problems in Concurrency, Inter Processes 10
Communication, Process Generation, Process Scheduling.
UNIT III CPU Scheduling: Scheduling Concept, Performance Criteria 10
Scheduling Algorithm, Evolution, Multiprocessor Scheduling.
Deadlock: System Mode , Deadlock Characterization, Prevention, A
voidance and Detection, Recovery From Deadlock Combined
Approach.
UNIT IV Memory Management: Basic Machine, Resident 12
Monitor, Multiprogramming with Fixed Partition,
Multiprogramming With Variable Partition, Multiple B as e
Register, Paging, Segmentation, P aged Segmentation, Virtual'
Memory Concept, Demand Paging, Performance, Paged Replaced
Algorithm, Allocation of Frames , Thrashing, Cache Memory
Organization, Impact on Performance.
UNIT V I/O Management & Dis k Scheduling: I/O Devices and The 10
Organization of I/O Function, I/O Buffering, Disk I/O, Operating
System Design Issues. File System: File Concept, File Organization
and Access Mechanism, File Directories, File Sharing,
Implementation Issues.
Suggested
Readings
1.Text Book 1. Milenekovie , "Operating S ystem Concept"(2000), Mc Graw Hill.

24
2.Reference 1. Petersons, "Operating Systems"(2004), Ad dision Wesley.
Books 2. Dieta l, "An Introduction to Operating System"(1998), Addision Wesley.

Semester :V
Course Name: Design & Analysis of Algorithms Evaluation
Components
Course Code: CSE305 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
To analysis the performance of algorithm, how the choice of DS and also design methods impact the
performance of programmes.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction: Algorithms, analysis of algorithms, Growth of
Functions, Master's Theorem, Designing of Algorithms. Sorting and
order Statistics: Heap sort, Quick sort, Sorting in Linear time,
Medians and Order Statistics. 08
UNIT II Advanced Data Structure: Red-B lack Trees, Augmenting Data
Structure. B- Trees, Binomial Heaps, Fibonacci Heaps, Data
Structure for Disjoint Sets. 10
UNIT III Advanced Design and Analysis Techniques : Dynamic 10
Programming, Greedy Algorithms , Amortized Analysis , Back
Tracking.
UNIT IV Graph Algorithms: Elementary Graphs Algorithms, Minimum 12
Spanning Trees, Single-source Shortest Paths, Al l-Pairs Shortest
Paths, Maximum Flow, and Traveling Salesman Problem.
UNIT V Selected Topics: Randomized Algorithms, String Matching, NP 08
Completeness, Approximation Algorithms.
Suggested
Readings
1.Text Book 1. Corem an, Rivest, Lisserson, : “Algorithm", PHI.

2.Reference 1. Basse, "Computer Algorithms: Introduction to Des ign &

Books Analysis”, Addision Wes ley.
2. Horowitz & Sahani, "Fundamental of Computer Algorith m",
Galgotia.

25
 Semester :V
Course Name: Object Oriented Programming Evaluation
Components
Course Code: CSE307 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
To Implement OOPs concept in C++ and also he/she can write a program in C++ .
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Object Modelling: Objects and classes, links and association,
generalization and inheritance, aggregation, abstract class, multiple
inheritance, meta data, candidate keys, constraints. Dynamic Modelling:
Events and states, operations, nested state diagrams and concurrency, 08
advanced dynamic modelling concepts, a sample dynamic model.
UNIT II Functional Modelling: Data flow diagram, specifying operations,
constraints, a sample functional model.OMT (object modeling techniques)
methodologies, examples and case studies to demonstrate methodologies, 12
comparisons of methodologies, SA/SD, JSD.
UNIT III Java Programming: Introduction, Operator, Data types, Variables, 10
Methods & Classes, Multithread Programming, I/O, Java Applet.
UNIT IV Java Library: String Handling, Input/Output exploring Java.io, 10
Networking, Exception Handling, Event Handling, Introduction to AWT,
Working with window, Graphics, AWT Controls, Layout Manager and
Menus, Images.
UNIT V Software Development using Java: 08
Java Swing, Migrating from C++ to java, Application of java, JDBC.
Suggested
Readings
1.Text Book 1. Horstmann, Big Java,(2000) Wiley India
2.Reference 1. Herbert Schieldt, “The Complete Reference: Java”(2004), TMH, 7th
Books Edition.
2. Nino,” An Introduction to Programming and Object Oriented Design
using Java, w/CD”(2002), Wiley India

26
 Semester :V
Course Name: Industrial Economics & Principles Evaluation
of management Components
Course Code: MGMT309 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
To analysis the difference between science, engineering, technology, economics and apply law of demand
concept to real market and analysis all factors of production and apply break even analysis.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Industrial Economics:
Introduction: Nature and significance of Economics. Meaning of
Science Engineering and Technology and their relationship with
economic development. 06
UNIT II Basic Concept: The concept of demand and supply. Elasticity of
Demand and Supply. Indifference Curve Analysis, Price Effect,
Income Effect and Substitution Effect. 10
UNIT III Money and Banking: Functions of Money, Value o f Money, Inflation 10
and measures to control it. Brief idea of functions of banking system,
viz., Commercial and central banking, Business fluctuations .
UNIT IV Introduction: Definition, Nature and Significance of Management,. 12
Evaluation of Management thought, Contributions of Max Weber, Taylor
and Fayol.
UNIT V Human Behaviour : Fac tors of Individual Bah aviour, 10
Perception, Learning and Personality Development, Interpersonal
Relationship and Group Behaviour.
Suggested
Readings
1.Text Book 1. Dewett, K.K. / Modern E cono mic Theory(2001)/S .Chand & Co.

2.Reference 1. Luthers Fred/ O rganiz ational Behaviour(2002).

Books 2. Prasad L.M./ Pr inciples of Management(1999).

27
 Semester : V
Course Name: Computer Graphics Lab Evaluation
Components
Course Code: CSE311 Credit L T P IP EP Total
1 0 0 2 30 20 50
List of Practical

1. Implementation of line generation using slope’s method, DDA.

2. Implementation of line generation using Bresenham’s algorithms

3. Implementation of circle generation using Mid-point method.

4. Implementation of circle generation using Bresenham’s algorithm

5. Implementation of ellipse generation sings Mid-point method.

6. Implementation of polygon filling using Flood-fill, Boundary-fill and Scan-line algorithms.

7. Implementation of2D transformation: Translation, Scaling, Rotation, Mirror Reflection and

Shearing (write a menu driven program).

8. Implementation o f Line Clipping using Cohen-Sutherland algorithm and Bisection Method.

9. Implementation of Polygon Clipping using Sutherland-Hodgeman algorithm.

10. Implementation of 3D geometric transformations: Translation, Scalind and rotation.

Semester : V
Course Name: Design & Analysis of Algorithms Lab Evaluation
Components
Course Code: CSE313 Credit L T P IP EP Total
1 0 0 2 30 20 50

28
List of Practical

1 . Write a program for Divide and conquer method using quick sort.
2. Write a program for Divide and conquer method merge sort.
3. Write a program for Divide and conquer method Strassen’s matrix
multiplication
4. Write a program for Greedy method (knapsack problem, job sequencing, optimal
merge patterns, and minimal spanning trees).
5. Write a program for Dynamic programming (multistage graphs, OBST, 0/1knapsack, traveling
salesperson on problem).
6. Write a program for Backtracking (n-queens problem, graph coloring problem, Hamiltonian
cycles).
7. Write a program for Sorting: Insertion sort, Heap sort, Bubble sort.
8. Write a program for Searching: Sequential and Binary Search.
9. Write a program for Selection of Minimum/Maximum element.
10. Write a program for Selection of Kth smallest element .

Semester : V
Course Name: Object oriented programming using Evaluation
Java/ C++ Components
Course Code: CSE315 Credit L T P IP EP Total
1 0 0 2 30 20 50

29
List of Practical

1. Write a program in Java to develop the basic concept of Operators, recursion.

2. Write an object oriented program in Java using objects, classes.
3. Write an object oriented program in Java using Constructor and passing objects as parameters.
4. Write an object oriented program in Java using Inheritance, Overloading and overriding methods.
5. Write a Java program that works as a Simple Calculator.
6. Write a Java program on Exception Handling.
7. Write a Java program to develop an applets that displays a simple message.
8. Develop applications involving File Handling(I/O Streams, File I/O)
9. Develop applications involving concurrency.
10. Develop applications involving Applets.
.

Semester :VI
Course Name: Compiler Design Evaluation
Components
Course Code: CSE302 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)

30
Course Outcome
To realize basics of compiler design and apply for real time applications, introduce different translation
languages, understand the importance of code optimization, know about compiler generation tools and
techniques.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction to Compiler, Phases and passes, Bootstrapping, Finite
state machines and regular express ions and their applications to lexical
analysis , Implementation of lexical analyzers, lexical-analyzer
generator , LEX- compiler, Formal grammars and their application to 10
syntax analysis, BNF notation, ambiguity, YACC. The syntactic
specification of programming languages: Context free grammars,
derivation and parse trees, capabilities of CFG.
UNIT II Basic Parsing Techniques : Parsers, Shift reduce parsing, operator
precedence parsing, top down parsing, predictive parsers Automatic
Construction of efficient Parsers : LR parsers, the canonic al 10
Collection of LR(0) items , constructing SLR parsing tables,
constructing Canonical LR parsing tables , Constructing LALR
parsing tables, using ambiguous grammars, an automatic parser
generator, implementation of L R parsing tables , constructing LALR
sets of items .
UNIT III Syntax-directed Translation :Syntax-directed Translation 08
schemes ,Implementation of Syntax- directed Translators,
Intermediate code, postfix notation, Parse trees & syntax trees, three
address code, quadruple & triples, translation of assignment
statements, Boolean expressions, statements that alter the flow of
control, postfix translation, translation with a top down parser. More
about translation: Array references in arithmetic expressions,
procedures call, declarations, case statements .
UNIT IV Symbol Tables: Data structure for symbols tables, representing scope 12
information. Run-Time Administration: Implementation of simple
stack allocation scheme, storage allocation in block structured
language. Error Detection & Recover y: Lexical Phase errors,
syntactic phase errors semantic errors.
UNIT V Introduction to code optimization: Loop optimization, the 08
DAG representation of basic blocks, value numbers and algebraic
laws, Global Data-Flow analysis.
Suggested
Readings
1.Text Book 1. Aho, Se thi & Ullman, "Compiler Design "(1997), AddisionWesley.
2.Reference 1. Compilers: Principles Techniques and Tool | Second Edition | By
Books Pearson

Semester :VI
Course Name: Computer Networks Evaluation
Components

31
Course Code: CSE304 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
To Identify the different types of network devices and their functions within a network.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction Concepts : Goals and Application s of Networks,
Network structure and architecture, The OSI reference model,
services, Network Topology Design - Delay Analysis, Back Bone
Design, Local Access Network Design. Physical Layer Trans mission 10
Media, Switching methods, ISDN, Terminal Hand ling.
UNIT II Medium Access sub layer: Medium Access sub layer -
Channel Allocations, LAN protocols - ALOHA protocols -
Overview of IEEE standards - FDDI. Data Link Layer - Elementary 10
Data Link Protocols, Sliding Window protocols, Error Handling.
UNIT III Network Layer: Network Layer - Point - to Point Networks, routing, 08
Congestion control Internetworking -TCP / IP - IP packet, IP address,
IPv6.
UNIT IV Transport Layer: Trans port Layer - Design issues, connection 12
management, session Layer-Design issues, remote procedure call.
Presentation Layer- Design issues, Data compression techniques,
cryptograph y - TCP - Window Management.
UNIT V Application Layer: Application Layer: File Transfer, 08
Access and Management, Electronic mail, Virtual Terminals, Other
application, Example Networks - Internet and Public Networks.
Suggested
Readings
1.Text Book 1. Forouzen, "Data Communication and Networking"(2000), TMH

2.Reference 1. A.S. Tanenb aum, “Com puter Networ ks ” (1997), 3rd Edit ion,
Books Prentice Hall India, 1997.
2. S. Keshav, “An Engineering Approach on Computer Networ
king” (2002), Addison Wesley, 1997

Semester :VI
Course Name: Artificial Intelligence Evaluation

32
 Components
Course Code: CSE306 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
Analyze the running time and space complexity of algorithms. Describe, apply and analyze the
complexity of divide and conquer strategy. Describe, apply and analyze the complexity of greedy strategy.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction
Introduction to Artificial Intelligence, Simulation of
sophisticated & Intelligent Behavior in different area problem
3OIving in games, natural language, automated reasoning, visual 08
perception, heuristic algorithm versus solution guaranteed
algorithms.
UNIT II Understanding Natural Languages . Parsing techniques, context free
and transformational grammars, transition nets, augmented transition
nets, Fillmore's grammars, Shanks Conceptual Dependency, gram 10
mar free analyzers, sentence generation, and translation.
UNIT III Know ledge Representation First order predicate calculus, Horn 08
Clauses, Introduction to PR OLOG, Semantic Nets, Partitioned
Nets, Minskey frames , Case Grammar Theory, Production Rules
Knowledge Base, The Interface System, Forward & Backward
Deduction.
UNIT IV Expert System Existing Systems (DENDRAL, MYCIN ) domain 12
exploration Meta Knowledge, Expertise Transfer, Self Explaining
System
UNIT V Pattern Recognition Introduction to Pattern Recognition, 10
Structured Description, Symbolic Description, Machine perception,
Line Finding, Interception Semantic & Mode l, Object
Identification, Speech Recognition. Programming Language;
Introduction to programming Language, LISP, P ROLOG
Suggested
Readings
1.Text Book 1. Charnic k “ Introduction to A.I.” (2000), Add ision Wesley

2.Reference 1. Ric h & Knight, “Artificial In telligence” (2004)

Books 2. Wins ton, “LISP”, Add ision Wesley(2006)

Semester :VI
Course Name: Graph Theory Evaluation

33
 Components
Course Code: CSE308 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
To understand and apply the fundamental concepts in graph theory and to apply graph theory based tools
in solving practical problems with proof writing skills.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Graphs, Sub graphs, some basic properties , various example of
graphs & their sub graphs, walks, path & circuits, connected
graphs, disconnected graphs and component, euler graphs,
various operation on graphs, Hamiltonian paths and circuits , the 06
traveling sales man problem.
UNIT II Trees and fundamental circuits, distance diameters, radius and
pendent vertices, rooted and binary trees, on counting trees,
spanning trees, fundamental circuits , finding all spanning trees of 12
a graph and a weighted graph, algorithms of primes, Kruskal and di
jkstra Algorithms.
UNIT III Cuts sets and cut vertices , some properties, all cut sets in a 10
graph, fundamental circuits and cut sets , connectivity and
separability, network flows, planer graphs, combinatorial and geo
metric dual, Kuratowski to graphs detection of planarity,
geometric dual , some more criterion of planarity, thickness and
crossings.
UNIT IV Vector space of a graph and vectors, bas is vector, cut s et vector, 12
circuit vector, circuit and cut set verses subspaces , orthogonal
vectors and subs paces, incidence matrix of graph, sub matrices of
A( G), circuit matrix, cut set matrix, path matrix and
relationships among Af, Bf, and C f, fundamental circuit matrix
and rank of B, adjacency matrices, rank- nullity theorem .
UNIT V Coloring and covering and partitioning o f a graph, chromatic 08
number, chromatic partitioning, chromatic polynomials , matching,
covering, four color problem, Directed graphs, some type of
directed graphs , Directed paths, and connectedness, Euler digraphs ,
trees with directed edges, fundamental circuits in digraph, matrices
A, B and C of digraphs adjacency matrix of a digraph,,
enumeration, types of enumeration, counting of labeled and
unlabeled trees, polya’s theorem, graph enumeration with polya’s
theorem. Graph theoretic algorithm must be provided wherever
required to solve the problems.
Suggested 1. Deo, N: Graph theor y(2000), P HI
Readings
1.Text 1. Harar y, F: Graph Theory, (1999) Narosa
Book 2.Bondy and Murthy: Graph theory and application(2003).Addison Wes
2.Referenc ley.
e Books

34
 Semester :VI
Course Name: Organizational Behavior Evaluation
Components
Course Code: CSE310 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
To help the students to develop cognizance of the importance of human behavior and to enable students to
describe how people behave under different conditions and understand why people behave as they do.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction to organizations and individuals:
What is an organization, components of organization, nature and variety
of organizations (in terms of objectives, structure etc.), models of
analyzing organizational phenomena, organizational and business 10
variables, organizations in the Indian context, institutions and
structures , basic roles in an organization, etc. perceptions, attitudes ,
motives (achievement, power and affiliation ), commitment, values,
creativity, and other personality factors, profile of a manager and a
entrepreneur.
UNIT II Interpersonal trust, understanding the other person from his /her point of
view, interpersonal communication, listening, feedback, counseling,
transactional analysis, self-fulfilling prophecy, etc., leaders hip, 10
motivating people, working as a member of a team , team
functioning, team decision- making, team conflict resolution, team
problem solving.

UNIT III Organizational structure and integrating interpersonal and group 10

dynamics elements of structure, functions of structures, determinants
of structures, dysfunctionalities of structures, structure technology ?

UNIT IV Environment-people relationships, principles underlying design of 10

organizations, organizational politics, issues of power and authority,
organizational communications, organizational change, integrating
cases(s).
UNIT V Case method and lectures should be supplemented with a variety of 08
other methodologies such as feedback on questionnaires and tests,
role plays, and behavior simulation exercise.
Suggested
Readings
1.Text Book 1.Jit S Chandan "Organizational Behavior"(2003), Vikas

2.Reference 1. M.N. Mishra :Org anization Behavior"(2004), Vikas

Books 2. Arnold, John, Robertson, Ivan 1. & Cooper,Cary,I., (2000)" Work
Psychology: understanding human behavior in the
workplace"(1998), Macmillan India Ltd., Delhi. 1996.

35
 Semester : VI
Course Name: Compiler Design Lab Evaluation
Components
Course Code: CSE312 Credit L T P IP EP Total
1 0 0 2 30 20 50
List of Practical

1. Simulation of a Finite state Automata to recognize the tokens of various control statements.
2. Simulation of a Finite state machine to distinguish among Integers, Real Numbers & Numbers with
Exponents.
3. Program in LEX tool to recognize the tokens and to return the token found for a C like Language
4. Parsing of arithmetic and algebraic expressions and equations.
5. Use of YACC tool to parse the statements of C like Language.
6. Implementation of symbol table.
7. Convert the bnf rules into yacc form and write code to generate abstract syntax tree.
8. Implement control flow analysis and data flow analysis.
9. Implement any one storage allocation strategies(heap, stack, static)
10. Implementation of simple code optimization techniques (constant folding. etc.)

36
 Semester : VI
Course Name: Computer Networks Lab Evaluation
Components
Course Code: CSE314 Credit L T P IP EP Total
1 0 0 2 30 20 50
List of Practical

1. Implement three nodes point – to – point network with duplex links between them. Set the queue
size, vary the bandwidth and find the number of packets dropped.
2. Implement transmission of ping messages/trace route over a network topology consisting of 6
nodes and find the number of packets dropped due to congestion.
3. Implementation of the Data Link Layer framing method using character stuffing in C.
4. of a network of3nodesand measure the performance on the same network.
5. Simulation of a network of 3nodes.
6. Implement the data link layer framing method.
7. Simulate to Determine the Performance with respect to Transmission of Packets.
8. Simulate to Find the Number of Packets Dropped due to Congestion.
9. Simulate to Plot Congestion for Different Source/Destination
10. Implement simple ESS and with transmitting nodes in wire-less LAN by simulation and determine
the performance with respect to transmission of packets.

37
 Semester : VI
Course Name: Artificial Intelligence Lab Evaluation
Components
Course Code: CSE316 Credit L T P IP EP Total
1 0 0 2 30 20 50
List of Practical

1. Study of Prolog.
2. Write simple fact for the statements using PROLOG.
3. Write predicates One converts centigrade temperatures to Fahrenheit, the other checks if a temperature
is below freezing.
4. Write a program to solve the Monkey Banana problem.
5. WAP in turbo prolog for medical diagnosis and show t he advantage and disadvantage of green and
red cuts.
6. WAP to implement factorial, fibonacci of a given number.
7. Write a program to solve 4-Queen problem.
8. Write a program to solve traveling salesman problem.
9. Write a program to solve water jug problem using LISP
10. Solve Robot (traversal) problem using means End Analysis

38
 Semester :VII
Course Name: Introduction to Web Technology Evaluation
Components
Course Code: CSE401 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
To discuss the basics of internet programming and implement complete application over the web and also
the HTML tags, Web development tools like PHP and XML with java script and java.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction and Web Development Strategies
History of Web, Protocols governing Web, Creating Websites for
individual and Corporate World, Cyber Laws, Web Applications, Writing
Web Projects, Identification of Objects, Target Users, Web Team, 06
Planning and Process Development.
UNIT II HTML, XML and Scripting
List, Tables, Images, Forms, Frames, CSS Document type definition,
XML schemes, Object Models, Presenting XML, Using XML Processors: 12
DOM and SAX, Introduction to Java Script, Object in Java Script,
Dynamic HTML with Java Script.
UNIT III Java Beans and Web Servers 12
Introduction to Java Beans, Advantage, Properties, BDK, Introduction to
EJB, Java Beans API Introduction to Servelets, Lifecycle, JSDK, Servlet
API, Servlet Packages: HTTP package, Working with Http request and
response, Security Issues.
UNIT IV JSP 10
Introduction to JSP, JSP processing, JSP Application Design, Tomcat
Server, Implicit JSP objects, Conditional Processing, Declaring variables
and methods, Error Handling and Debugging, Sharing data between JSP
pages- Sharing Session and Application Data.
UNIT V Database Connectivity 08
Database Programming using JDBC, Studying Javax.sql.*package,
accessing a database from a JSP page, Application-specific Database
Action, Developing Java Beans in a JSP page, introduction to Struts
framework.
Suggested
Readings
1.Text Book 1. Burdman, “Collaborative Web Development” (2000), Addison Wesley.
2.Reference 1. Chris Bates, “Web Programing Building Internet Applications” (1998),
Books 2nd Edition, WILEY,
Dreamtech
2. Joel Sklar , “Principal of web Design” (2001), Vikash and Thomas
Learning

39
 Semester :VII
Course Name: Advanced Computer Architecture Evaluation
Components
Course Code: CSE403 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
Explain the organization of basic computer, its design also the working of CPU , RISC ,CISC architecture
and elaborate the concept of computer architecture, parallel processing and synchronization.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction
Introduction to parallel computing, need for parallel computing, parallel
architectural classification schemes, Flynn’s, Fengs classification,
performance of parallel processors, distributed processing, processor and 10
memory hierarchy, bus, cache & shared memory, introduction to super
scalar architectures, quantitative evaluation of performance gain using
memory, cache miss/hits.
UNIT II Multi-core Architectures
Introduction to multi-core architectures, issues involved into writing code
for multi-core architectures, development of programs for these 10
architectures, program optimizations techniques, building of some of
these techniques in compilers, Open MP and other message passing
libraries, threads, mutex etc.
UNIT III Multi-threaded Architectures 12
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: Why CMP (Moore’s law, wire delay);
shared L2 vs. tiled CMP; core complexity; power/performance; Snoopy
coherence: invalidate vs. update, MSI, MESI, MOESI, MOSI;
performance trade-offs; pipelined snoopy bus design;
Memory consistency models: SC, PC, TSO, PSO, WO/WC, RC;
Chip multiprocessor case studies: Intel Montecito and dual-core,
Pentium4, IBM Power4, Sun Niagara
UNIT IV Compiler Optimization Issues 08
Introduction to optimization, overview of parallelization; Shared memory
programming, introduction to Open MP; 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.
UNIT V Operating System Issues and Applications 08
Operating System issues for multiprocessing Need for pre-emptive OS;

40
 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; Open MP, MPI and case
studies Case studies from Applications: Digital Signal Processing, Image
processing, Speech processing.
Suggested
Readings
1.Text Book 1. Hwang, “ Advanced Computer Architecture” (2003), New Age
International
2.Reference 1. Quin, “Parallel Computing, Theory & Practices” (2005), McGraw Hill
Books 2. M. Morris Mano, “Computer System Architecture” (1998), PHI

Semester :VII
Course Name: (Elective-I) Digital Image Processing Evaluation
Components
Course Code: CSE405 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: Review the fundamental concepts of a digital image processing system, To analyze
images in the frequency domain using various transforms and evaluate the techniques for image
enhancement and image restoration.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction and Fundamentals 10
Motivation and Perspective, Applications, Components of Image
Processing System, Element of Visual Perception, A Simple Image
Model, Sampling and Quantization.
Image Enhancement in Spatial Domain
Introduction; Basic Gray Level Functions – Piecewise-Linear
Transformation Functions: Contrast Stretching; Histogram Specification;
Histogram Equalization; Local Enhancement; Enhancement using
Arithmetic/Logic Operations – Image Subtraction, Image Averaging;
Basics of Spatial Filtering; Smoothing – Mean filter, Ordered Statistic
Filter; Sharpening – The Laplacian.
UNIT II Image Enhancement in Frequency Domain 08
Fourier Transform and the Frequency Domain, Basis of Filtering in
Frequency Domain,

41
 Filters – Low-pass, High-pass; Correspondence Between Filtering in
Spatial and Frequency
Domain; Smoothing Frequency Domain Filters – Gaussian Lowpass
Filters; Sharpening
Frequency Domain Filters – Gaussian Highpass Filters; Homomorphic
Filtering.
Image Restoration
A Model of Restoration Process, Noise Models, Restoration in the
presence of Noise only- Spatial Filtering – Mean Filters: Arithmetic Mean
filter, Geometric Mean Filter, Order
Statistic Filters – Median Filter, Max and Min filters; Periodic Noise
Reduction by Frequency Domain Filtering – Bandpass Filters; Minimum
Mean-square Error Restoration.
UNIT III Color Image Processing 12
Color Fundamentals, Color Models, Converting Colors to different
models, Color Transformation, Smoothing and Sharpening, Color
Segmentation.
Morphological Image Processing
Introduction, Logic Operations involving Binary Images, Dilation and
Erosion, Opening and Closing, Morphological Algorithms – Boundary
Extraction, Region Filling, Extraction of Connected Components, Convex
Hull, Thinning, Thickening
UNIT IV Registration 10
Introduction, Geometric Transformation – Plane to Plane transformation,
Mapping, Stereo Imaging – Algorithms to Establish Correspondence,
Algorithms to Recover Depth
Segmentation
Introduction, Region Extraction, Pixel-Based Approach, Multi-level
Thresholding, Local Thresholding, Region-based Approach, Edge and
Line Detection: Edge Detection, Edge Operators, Pattern Fitting
Approach, Edge Linking and Edge Following, Edge Elements Extraction
by Thresholding, Edge Detector Performance, Line Detection, Corner
Detection.
UNIT V Feature Extraction 08
Representation, Topological Attributes, Geometric Attributes
Description
Boundary-based Description, Region-based Description, Relationship.
Object Recognition
Deterministic Methods, Clustering, Statistical Classification, Syntactic
Recognition, Tree Search, Graph Matching
Suggested
Readings
1.Text Book 1.Digital Image Processing 2nd Edition, Rafael C. Gonzalvez and Richard
E. Woods. Published (1998) by: PHI.
2.Reference 1. B. Chanda, D.D. Majumder, “Digital Image Processing & Analysis”
Books (2006), PHI
2. Digital Image Processing and Computer Vision, R.J. Schalkoff.
Published by: John Wiley
and Sons, NY. Fundamentals of Digital Image Processing, A.K. Jain.
Published by Prentice Hall, Upper Saddle River, NJ. (2007)

42
 Semester :VII
Course Name: (Elective-I) Network Programming & Evaluation
Administration Components
Course Code: CSE405 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: Demonstrate advanced knowledge of networking, understand the key protocols which
support the Internet, be familiar with several common programming interfaces for network communication
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction to Systems Programming: Files, System Files, File Formats, 10
Buffered I/O, Directories, File System, Inodes, links, fcntl, links, locks,
Device I/O, Terminal I/O, ioctl(), Files and Devices ,Signals, video
I/O ,Multi-Tasking
UNIT II Processes and Inter-Process Communication: timers, polling vs interrupts, 10
environment, fork, exec, wait, environment, exit and wait, pipe, fifos,
message queues, semaphore
UNIT III Network Programming: Sockets, Operation, Socket types, Domains Name 10
Binding, Closing Sockets, I/O Multiplexing
UNIT IV Client/Server Models, Connection Based Services, Handling Out of Band 10
Data, Connectionless Services, Design issues of Concurrent and iterative
servers, Socket options
UNIT V XDR and Remote Procedure Calls, Network Programming at the level of 08
Programming
Language (can use Java or Python as case study)
Suggested
Readings
1.Text Book 1. Unix Network Programming, W. Richard Stevens, Prentice Hall, 1998

2.Reference 1. Internetworking with TCP/IP, Volume3, Douglas Comer, Prentice Hall,

Books 2000
2. Internetworking with TCP/IP, Volume1, Douglas Comer, Prentice Hall,
2000

43
 Semester :VII
Course Name: (Elective-I) Real Time System Evaluation
Components
Course Code: CSE405 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: To present the mathematical model of the system, to develop real-time algorithm for
task scheduling, to understand the working of real-time operating systems and real-time database and to
work on design and development of protocols related to real-time communication.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction 10
Definition, Typical Real Time Applications: Digital Control, High Level
Controls, Signal Processing etc., Release Times, Deadlines, and Timing
Constraints, Hard Real Time Systems and Soft Real Time Systems,
Reference Models for Real Time Systems: Processors and Resources,
Temporal Parameters of Real Time Workload, Periodic Task Model,
Precedence Constraints and Data Dependency.
UNIT II Real Time Scheduling 08
Common Approaches to Real Time Scheduling: Clock Driven Approach,
Weighted Round Robin Approach, Priority Driven Approach, Dynamic
Versus Static Systems, Optimality of Effective-Deadline-First (EDF) and
Least-Slack-Time-First (LST) Algorithms, Offline Versus Online
Scheduling, Scheduling Aperiodic and Sporadic jobs in Priority Driven
and Clock Driven Systems.
UNIT III Resources Access Control 12
Effect of Resource Contention and Resource Access Control (RAC),
Nonpreemptive Critical Sections, Basic Priority-Inheritance and Priority-
Ceiling Protocols, Stack Based Priority- Ceiling Protocol, Use of Priority-
Ceiling Protocol in Dynamic Priority Systems, Preemption Ceiling
Protocol, Access Control in Multiple-Unit Resources, Controlling
Concurrent Accesses to Data Objects.
UNIT IV Multiprocessor System Environment 10
Multiprocessor and Distributed System Model, Multiprocessor Priority-
Ceiling Protocol,

44
 Schedulability of Fixed-Priority End-to-End Periodic Tasks, Scheduling
Algorithms for Endto- End Periodic Tasks, End-to-End Tasks in
Heterogeneous Systems, Predictability and Validation of Dynamic
Multiprocessor Systems, Scheduling of Tasks with Temporal
Distance Constraints.
UNIT V Real Time Communication 08
Model of Real Time Communication, Priority-Based Service and
Weighted Round-Robin
Service Disciplines for Switched Networks, Medium Access Control
Protocols for Broadcast Networks, Internet and Resource Reservation
Protocols, Real Time Protocols,
Communication in Multicomputer System, An Overview of Real Time
Operating Systems.
Suggested
Readings
1.Text Book 1. Real Time Systems by Jane W. S. Liu, (1999) Pearson Education
Publication.
2.Reference 1. Real-Time Systems: Scheduling, Analysis, and Verification (2003) by
Books Prof. Albert M. K. Cheng, John Wiley and Sons Publications.

Semester :VII
Course Name: (Elective-I) Wireless Networks Evaluation
Components

45
Course Code: CSE405 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: To keep himself updated on latest wireless technologies and trends in the
communication field Understand the transmission of voice and data through various networks.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction 08
Liberalization of communications Industry, Digitalization of content,
changes in spectrum management, cellular reuse, drive towards
broadband, IEEE 802.11 networks.
UNIT II Wireless Network Systems 10
Cellular networks
Tthe GSM circuit switched network, GSM channel structure,
Authentication and location updating, physical channels, TMN.
GPRS
Introduction to GPRS, contexts, PDP context, Mobility management
context, MS-SGSN physical layer, MS-SGSN protocols, GPRS
operations.
UNIT III Principles of access network planning 12
Circuit voice networks
Introduction to CVN, coverage, capacity, planning for circuit multimedia
services
Planning for packet multimedia services
Planning approaches, buffer-pipe model, characterization of applications,
practical modelling methodologies, multiuser packet transport
configurations
UNIT IV Planning and design 10
RAN, GSM RAN, UMTS RAN, Cellular OFDM RAN, Mesh network
UNIT V Network operation and optimization 08
Enhanced telecom operations model (eTOM), wireless network life
cycle ,strategy, infrastructure and product, operations, enterprise
management,
GSM network performance optimization, principles and key performance
indicators, coverage optimization, GPRS RAN optimization, UMTS
network performance optimization
Suggested
Readings
1.Text Book 1. Deploying Wireless networks, Andy wilton(1996), Tim charity,
Cambridge university press
2.Reference 1. Fundamental of Wireless Networking, Ron Price(2000), TMH
Books 2. 3G Wireless Networks, Clint Smity(1998), TMH

Semester :VII
Course Name: (Elective-I)OOSE Evaluation

46
 Components
Course Code: CSE405 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: To learn and understand various O-O concepts along with their applicability contexts.
Given a problem, identify domain objects, their properties, and relationships among them. How to identify
and model/represent domain constraints on the objects and (or) on their relationships.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction to Software Engineering: Software Engineering 10
Development, Software Life Cycle Models, Comparison of various
models Requirement Elicitation: Introduction to Object Oriented
Methodology, Overview of Requirements Elicitation, Requirements
Model-Action & Use cases, Requirements Elicitation Activities,
Managing Requirements Elicitation.                               
UNIT II Architecture: Introduction, System development is model building, model 10
architecture, requirements model, analysis model, the design model, the
implementation model, test model Analysis: Introduction, the
requirements model, the analysis model
UNIT III Construction: Introduction, the design model, block design, working with 10
construction
UNIT IV Testing: introduction, on testing, unit testing, integration testing, system
testing, the Testing process
UNIT V Modelling with UML: Basic Building Blocks of UML, A Conceptual 08
Model of UML, Basic Structural Modeling, UML Diagrams.
CaseStudies                                                                                                   
Suggested
Readings
1.Text Book 1. Ivar Jacobson, “Object Oriented Software Engineering”, Pearson, 2004.

2.Reference 1. Grady Booch, James Runbaugh, Ivar Jacobson, “The UML User
Books Guide”, Pearson, 2004.
2. Wendy Boggs,Boggs,Michael Boggs “Mastering UML with Rational
Rose”, BPB Publication, 2003.

Semester :VII
Course Name: (Elective-II) Cryptography & Evaluation

47
Network Security Components
Course Code: CSE407 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: Describe network security services and mechanisms. Symmetrical and Asymmetrical
cryptography. Data integrity, Authentication, Digital Signatures. Various network security applications,
IPSec, Firewall, IDS, Web security, Email security, and Malicious software etc.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction to security attacks, services and mechanism, introduction to 10
cryptography.
Conventional Encryption: Conventional encryption model, classical
encryption techniques substitution ciphers and transposition ciphers,
cryptanalysis, stereography, stream and block ciphers. Modern Block
Ciphers: Block ciphers principals, Shannon’s theory of confusion and
diffusion, fiestal structure, data encryption standard(DES), strength of DES,
differential and linear crypt analysis of DES, block cipher modes of
operations, triple DES, IDEA encryption and decryption, strength of IDEA,
confidentiality using conventional encryption, traffic confidentiality, key
distribution, random number generation.
UNIT II Introduction to graph, ring and field, prime and relative prime numbers, 08
modular arithmetic, Fermat’s and Euler’s theorem, primality testing,
Euclid’s Algorithm, Chinese Remainder theorem, discrete logarithms.
Principals of public key crypto systems, RSA algorithm, security of RSA,
key management, Diffle-Hellman key exchange algorithm, introductory
idea of Elliptic curve cryptography, Elganel encryption.
UNIT III Message Authentication and Hash Function: Authentication requirements, 12
authentication functions, message authentication code, hash functions,
birthday attacks, security of hash functions and MACS, MD5 message
digest algorithm, Secure hash algorithm(SHA).
Digital Signatures: Digital Signatures, authentication protocols, digital
signature standards(DSS), proof of digital signature algorithm.
UNIT IV Authentication Applications: Kerberos and X.509, directory authentication 10
service, electronic mail security-pretty good privacy (PGP), S/MIME.

UNIT V IP Security: Architecture, Authentication header, Encapsulating security 08

payloads, combining security associations, key management.
Web Security: Secure socket layer and transport layer security, secure
electronic transaction (SET). System Security: Intruders, Viruses and
related threads, firewall design principals, trusted systems.
Suggested
Readings
1.Text 1. William Stallings, “Cryptography and Network Security: Principals and
Book Practice” (2006), Prentice Hall, New Jersy.
1. Johannes A. Buchmann, “Introduction to Cryptography” (2006), Springer-
2.Referenc Verlag.
e Books 2. B. Forouzan, “Cryptography and Network Security, (1999) TMH

Semester :VII

48
Course Name: (Elective-II) .Net Technologies & Evaluation
Visual Programming Components
Course Code: CSE407 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: Learn to work with .net, data types & variables, using the .net framework , branching &
flow control. Classes & objects, properties & methods, object oriented techniques etc. Delegates &
events, generics, handling exceptions, collections classes.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 The Philosophy of .NET 12
Understanding the previous states affair, The .NET Solution, The building
Block of the .NET platform (CLR,CTS,CLS), the role of the .NET base
class libraries, What C# brings to the table, additional .NET – Aware
programming Languages, An overview of .NET binaries (aka assemblies),
The role of the common intermediate language, The role of .NET type
metadata, The role of the assembly manifest, Compiling CIL to platform
specific instruction, Understanding the common type system, Intrinsic
CTS data types, Understanding the common languages specification,
Understanding the common languages runtime, A tour of the .NET
namespace, increasing your namespace nomenclature, Deploying
the .NET runtime.
UNIT II Building C# Applications 08
The role of the command line compiler (CSC.exe), Building C#
application using csc.exe, Working with csc.exe response file, generating
bug reports, Remaining C# compiler option, The command line debugger,
using the visual studio. Net IDE, Other key aspects of the VS.Net IDE,
Documenting your source code via XML, C# preprocessor directives, An
interesting Aside: The System.Environment class, Building .Net
application with other IDEs. C# Language Fundamentals : An Anatomy
of a basic C# class, Creating objects: Constructor basic, the composition
of a C# application, Default Assignment and variable scope, The C#
member initialization syntax, Basic input and output with the console
class, Understanding value types and reference types, The master node:
System. Objects, The system Data type (And C# aliases), Converting
between value type and reference type: Boxing and Unboxing, Defining
program constraints, C# Iterations constructs, C# control flow constructs,
The complete set C# operator, Defining Custom class methods,
Understanding static methods, Method parameter modifiers, Array
manipulation in C#, String manipulation in C#, C# Enumerations,
Defining structures in C#, Defining custom namespaces.
UNIT III Object Oriented Programming with C# 10
Formal definition of the C# class, Definition the “Default public
interface” of a type, Recapping the pillars of OOP, The first pillar: C#
Encapsulation services, Pseudo Encapsulation: Creating read only field,
The second pillar: C#’s Inheritance supports keeping family secrets: The
“Protected” keyword, The Nested type definitions, The third pillar: C#’s
Polymorphic support casting between types, Generating class definitions
using Visual Studio. Net. Exceptions and Objects Life Time Ode to errors,

49
 Bugs and exceptions, The role of .NET exceptions handling, The system.
Exception base class throwing a generic exception catching exception,
CLR system level exception (System. system exception),Custom
application level exception (System. application exception), Handling
multiple exception, The finally block, The last chance exception,
dynamically identify application and system level exception, Debugging
system exception using VS.Net, Understanding Object life time, The CIT
of new, The basic of garbage collection, Finalizing a type, Finalization
process, building and Ad hoc destruction method, garbage collection
optimization, The system .GC type.
UNIT IV Interfaces and Collections 10
Defining interfaces using C#, Invoking interface member at the object
level, Exercising the shape hierarchy, Understanding explicit interface
implementation, Interfaces as Polymorphic agents, Building interface
hierarchies, Implementing interface using VS.Net, Understanding the
convertible interface, Building a custom enumerator (I Enumerable and
Ienumerator), Building cloneable objects (Icloneable), Building
comparable objects (I Comparable),Exploring the system the collection
namespace, Building a custom container (Retrofitting the cars type).
UNIT V Understanding .Net Assembles Problems with classic COM Binaries, An 08
overview of .Net assembly, Building a simple file test assembly, A C#
Client Application, A Visual Basic .Net Client application, Cross
Language Inheritance, Exploring the Carlibrary’s manifest, Exploring the
Carlibrary’s Types, Building the multi file assembly, Using the multi file
assembly, Understanding private assemblies, Probing for private
assemblies (The Basics), Private assemblies and XML Configuration files,
Probing for private assemblies (The Details),Understanding Shared
assembly, Understanding Shared Names, Building a Shared assembly,
Understanding delay Signing, Installing/Removing shared assemblies,
Using a Shared assembly.
Suggested
Readings
1.Text Book
1. Andrew Troelsen C# and The .Net platform, , Second edition,2003,
2.Reference Dream TECH Press, India.
Books 1. Tom Archer Inside C#, 2001,WP Publishers.

Semester :VII

50
Course Name:(Elective-II) System Software and Evaluation
Administration Components
Course Code: CSE407 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: Learn basics of system software and essential systems administration skills related to
server operating systems, system and network service administration, computer and information security,
and directory services administration. Also learn to diagnose and solve network problems.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Assemblers: General design procedures, Design of two pass assemblers, 10
Cross Assemblers, Macro Processors – Features of a macro facility,
(macro instruction arguments, conditional macro expansion, macro calls
within macros), Implementation of a restricted facility : A two pass
algorithm; Macro Assemblers. Loader schemes: Compile and go loaders,
absolute loaders, relocating loader, Linking, Reallocation- static &
dynamic linking, Direct linking loaders, Binders, Overlays, dynamic
binders; Working principle of Editors, Debuggers. System Administration
UNIT II Introduction: Duties of the Administrator, Administration tools, 08
Overview of permissions.
Processes: Process status, Killing processes, process priority. Starting up
and Shut down: Peripherals, Kernel loading, Console, The scheduler, init
and the inittab file, Run-levels, Run level scripts.
Managing User Accounts: Principles, password file, Password security,
Shadow file, Groups and the group file, Shells, restricted shells, user
management commands, homes and permissions, default files, profiles,
locking accounts, setting passwords, Switching user, Switching group,
Removing users.
UNIT III Managing Unix File Systems: Partitions, Swap space, Device files, Raw 12
and Block files, Formatting disks, Making filesystems, Superblock, I-
nodes, Filesystem checker, Mounting File systems, Logical Volumes,
Network Filesystems, Boot disks
Configuring the TCP/IP Networking : Kernel Configuration; Mounting
the /proc File system, Installing the Binaries, Setting the Hostname,
Assigning IP Addresses, Creating Subnets, Writing hosts and networks
Files, Interface Configuration for IP, ifconfig, netstat command, Checking
the ARP Tables; Name service and resolver configuration.
UNIT IV TCP/IP Firewall : Methods of Attack, What Is a Firewall? What Is IP 10
Filtering? Setting Up
Linux for Firewalling Testing a Firewall Configuration; A Sample
Firewall Configuration: IP Accounting, Configuring the Kernel for IP
Accounting, Configuring IP Accounting, Using IP Accounting Results
IP Masquerade and Network Address Translation : Side Effects and
Fringe Benefits, Configuring the Kernel for IP Masquerade, Configuring
IP Masquerade.
UNIT V The Network Information System : Getting Acquainted with NIS, NIS 08
Versus NIS+ , The Client Side of NIS, Running an NIS Server, NIS
Server Security.
Network file system: Preparing NFS, Mounting an NFS Volume, The

51
 NFS Daemons, The exports File.
System Backup & Recovery: Log files for system and applications;
Backup schedules and methods (manual and automated).
Suggested
Readings
1.Text Book 1. L.L. Beck – “System Software “ (3rd Ed.)- Pearson Education
2.Reference 1. W. R. Stevens – “Unix network programming, vol. 1(2nd Ed.) (2008)” –
Books Pearson Education/PHI
2. W. R. Stevens – “TCP/IP illustrated, vol. 1” (2007) – PHI/Pearson
Education

Semester :VII

52
Course Name: (Elective-II) Soft Computing Evaluation
Components
Course Code: CSE407 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: To analyze and appreciate the applications which can use fuzzy logic. Ability to design
inference systems. Ability to understand the difference between learning and programming and explore
practical applications of Neural Networks (NN).
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction to soft computing. Applications of Artificial Neural 10
Networks, fuzzy logic, genetic algorithms and other soft-computing
techniques. Their strengths and weaknesses. Synergy of soft computing
techniques. Artificial neural networks: over view of history, Mathematical
Models of Neurons, ANN architecture.
UNIT II Introduction to artificial neural network Neural Networks: Learning rules, 10
Learning Paradigms-Supervised, Unsupervised and reinforcement
Learning, ANN training Algorithms-perceptions, Training rules, Delta,
Back Propagation Algorithm, Multilayer Perceptron Model, Competitive
learning networks, Kohonen self organizing networks, Hebbian learning;
Hopfield Networks.
UNIT III Fuzzy Logic: Introduction to Fuzzy Logic, Classical and Fuzzy Sets: 10
Overview of Classical Sets, Membership Function, Fuzzy rule generation.
Operations on Fuzzy Sets: Compliment, Intersections, Unions,
Combinations of Operations, Aggregation Operations.
Fuzzy Arithmetic: Fuzzy Numbers, Linguistic Variables, Arithmetic
Operations on Intervals & Numbers, Lattice of Fuzzy Numbers, Fuzzy
Equations.
UNIT IV Genetic algorithms(Gas),Evolution strategies(Ess),Evolutionary 10
programming(EP),Genetic Programming(GP),Selecting, crossover,
mutation, schema analysis, analysis of selection algorithms; convergence;
Markov & other stochastic models.
UNIT V Other Soft computing approaches Simulated Annealing, Tabu Search, Ant 08
colony based optimisation, etc.
Suggested
Readings
1.Text Book 1. “Neuro-Fuzzy and Soft computing” (2008), Jang, Sun, Mizutani,
2.Reference Pearson
Books
1. An Introduction to Neural Networks”, Anderson J.A., PHI, 1999.
2. “Introduction to the Theory of Neural Computation”, Hertz J. Krogh,
R.G. Palmer, Addison- Wesley, California, 1991.

Semester :VII

53
Course Name: (Elective-II) Advanced DBMS Evaluation
Components
Course Code: CSE407 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: To understand broad database concepts and database management system software
have a high-level understanding of major DBMS components and their function. To be able to model an
application’s data requirements using conceptual modeling tools like ER diagrams and design database
schemas based on the conceptual model.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Distributed DBMS Concepts and design: Introduction, functions and 10
architecture of a DDBMS, distributed relational database design,
Transparencies in a DDBMS, Twelve rules for a DDBMS. Advanced
concepts: Distributed transaction management, distributed concurrency
control, distributed deadlock management, distributed database recovery,
X/open distributed Transaction processing model, Replication servers,
Distributed query optimization, Mobile databases.
UNIT II Object-Oriented DBMS Introduction, advanced database applications, 08
weakness of RDBMS, storing objects in a relational database, next-
generation database systems .
Concepts and design: OODBMS perspectives, persistence, issues in
OODBMS, advantages and disadvantages of OODBMS, Object-oriented
database design.
UNIT III Standards and systems: object management group, object database 10
standard ODMG 3.0 1999, Object store. Object relational DBMS:
Introduction, third generation database manifestos, SQL8, Object oriented
extensions in Oracle, Comparison of ORDBMS and OODBMS.
UNIT IV Web technology and DBMS Web as a database Application Platform: 12
Requirements for web-DBMS integration, web-DBMS architecture,
advantages and disadvantages of web-DBMS approach, approaches to
integrating the web and DBMS, Oracle Internet Application Server (IAS).
UNIT V Data Warehousing Concepts, OLAP and Data mining Evolution of data 08
warehousing, data warehousing concepts, benefits and problems of data
warehousing, comparison of OLTP systems and data warehousing, On-
Line Processing, Introduction to data mining.
Suggested
Readings
1.Text Book 1. Adam, Nabil R., Bhargava, Bharat K., “Advanced Database Systems”,
Springer 1998.
2.Reference 1. Carlo Zaniolo, Stefano Ceri, “Advanced Database Systems”, Morgan
Books Kaufmann, 1997

Semester :VII

54
Course Name: Simulation and Modeling Evaluation
Components
Course Code: CSE409 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
To discuss the fundamental element of discrete event simulation like statistical method, random process,
random variants and input to simulation. Also realize the real word problem and applying modeling
methodology.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction: Definition of Simulation, Simulation Terminologies,
Application areas, Types of simulation, Advantages and disadvantages of
simulation, Definition of system, System concepts
Types of System: Continuous and discrete systems, Modelling process, 08
Verification and validation
UNIT II Discrete System Simulation and Mathematical Model
Monte Carlo method Concepts – Discrete and Continuous probability
distributions, Generation: Congruence, long period generators Uniformity 12
and Independence testing, Generations of random numbers and pseudo
random numbers, properties of random numbers, Inverse transformation
method
UNIT III Queuing theory and GPSS 10
Queuing theory: Introduction, notation and assumption Little’s theorem
queuing model with poison, exponential service and arbitrary service
times Simulation of single-server queue and two server queuing system
Model structure, entities and transactions, blocks in GPSS Programming
User defined functions and SNA
UNIT IV Inventory Control and Evaluation of Simulation 10
Elements of Inventory Theory, more complex inventory models
Finite and Infinite delivery rate model Simulation of inventory systems
UNIT V Project Management: PERT/CPM techniques, simulation of PER 08
networks Model as components of information systems Modelling for
decision support
Suggested
Readings
1.Text Book 1. Acha, E., Fuerte-Esquivel, C. R., Ambriz-Pérez, H., and Angeles-
Camacho, C. (2004), FACTS: Modelling and Simulation in Power
Networks. John Wiley and Sons.
2.Reference 1. Al-Begain, K., and Bargiela, A., Eds. (2016), Seminal Contributions to
Books Modelling and Simulation: 30 Years of the European Council of
Modelling and Simulation. Springer.
2. Arifin, S. N., Madey, G. R., and Collins, F. H. (2016), Spatial Agent-
Based Simulation Modeling in Public Health: Design, Implementation,
and Applications for Malaria Epidemiology. John Wiley and Sons.

Semester : VII

55
Course Name: Web technology Lab Evaluation
Components
Course Code: CSE411 Credit L T P IP EP Total
1 0 0 2 30 20 50
List of Practical

1. Home page Development static pages (using Only HTML) of an online Book store.
2. Validate the Registration, user login and payment by credit card pages using JavaScript.
3. To write a program, which takes user id as input and displays the user details by taking the user
information from the XML document.
4. To create a Java Bean so that it converts value of INR(Indian Rupees) into equivalent
American/Canadian/Australian Dollar value.
5. To create a simple Bean with a label - which is the count of number of clicks and a BeanInfo class
such that only the “count” property is visible in the Property Window.
6. To create two Beans Traffic Light which implemented as a Label with only three background
colors Red, Green, Yellow and Automobile which is implemented as a Text Box which states its
state/movement with above stated conditions.
7. To convert the static web pages online library into dynamic web pages using servlets and cookies.
8. Write an HTML code to illustrate the usage of the following: Ordered List Unordered List
Definition List
9. Write an HTML code to create a frameset having header, navigation and content sections.
10. Write an HTML code to demonstrate the usage of inline CSS.

Semester : VII
Course Name: Advanced Computer Architecture Lab Evaluation

56
 Components
Course Code: CSE413 Credit L T P IP EP Total
1 0 0 2 30 20 50
List of Practical

1. Design all gates using VHDL.

2. Write VHDL programs for the following circuits, check the wave forms and the hardware generated.
a. Multiplexer b. De-multiplexer.
3. Write VHDL program for encoder and check the wave forms and the hardware generated.
4. Implement Half Adder using FPGA & CPLD.
5. Implement Full Adder using FPGA & CPLD.
6. Implement Delay Flip flop using FPGA & CPLD.
7. Implement BCD to 7 segments Decoder using FPGA& CPLD.
8. Implement an Up Counter using FPGA & CPLD.
9. Implement 1-bit Comparator using FPGA & CPLD.
10. Implement ALU using FPGA & CPLD.

Semester : VII
Course Name: Seminar on Industrial Interaction Evaluation

57
 Components
Course Code: CSE415 Credit L T P IP EP Total
1 0 0 2 30 20 50
List of Practical

1. Selection of topic: Select a topic according to the specialization of students.

2. Approval to the selected topic: After selecting the topic, get approval from the concerned
faculty in charge.
3. Study of topic: Students are requested to acquire a thorough knowledge on the approved topic
by referring genuine documents.
4. Preparation of slides: For presentation Slides may be presented in MS power point. Time
allowed for presentation is 15 minutes for presentation and 5 minutes for discussions. So,
number of slides may be around 10 - 15 to adhere the time limit.
5. Organization of slides
a. The first slide will be a title page showing the title, name of author (presenter), roll no.
and Class.
b. 2nd page will contain overview of the seminar.
c. Successive pages will contain:
i. Introduction to the selected topic.
ii Graphs, block diagrams etc. arranged in a logical sequence depending on the topic.
iii. Results and discussions.
iv. Conclusion.
d. Last page will contain references and bibliography.
6. Each slide consists of 4 or 5 lines with enough space between lines.
7. All equations(if used) must be typed using equation editor (available with MS office/other
office suite)
8. Each slide will have a title and each figure have a caption.

Semester :VIII
Course Name: Distributed System Evaluation

58
 Components
Course Code: CSE402 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
To expose students to both the abstraction and details of file systems, introduce concepts related to
distributed computing systems and focus on performance and flexibility issues related to systems design
decisions.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Characterization of Distributed Systems: Introduction, Examples of
distributed Systems, Resource sharing and the Web Challenges.
System Models: Architectural models, Fundamental Models
Theoretical Foundation for Distributed System: Limitation of 10
Distributed system, absence of global clock, shared memory, Logical
clocks, Lamport’s & vectors logical clocks, Causal ordering of messages,
global state, termination detection.
Distributed Mutual Exclusion: Classification of distributed mutual
exclusion, requirement of mutual exclusion theorem, Token based and
non token based algorithms, performance metric for distributed mutual
exclusion algorithms.
UNIT II Distributed Deadlock Detection: system model, resource Vs
communication deadlocks, deadlock prevention, avoidance, detection &
resolution, centralized dead lock detection, distributed dead lock 10
detection, path pushing algorithms, edge chasing algorithms.
Agreement Protocols: Introduction, System models, classification of
Agreement Problem, Byzantine agreement problem, Consensus problem,
Interactive consistency Problem, Solution to Byzantine Agreement
problem, Application of Agreement problem, Atomic Commit in
Distributed Database system.
UNIT III Distributed Objects and Remote Invocation: Communication between 08
distributed objects, Remote procedure call, Events and notifications, Java
RMI case study.
Security: Overview of security techniques, Cryptographic algorithms,
Digital signatures Cryptography pragmatics, Case studies: Needham
Schroeder, Kerberos, SSL & Millicent.
Distributed File Systems: File service architecture, Sun Network File
System, The Andrew File System, Recent advances.
UNIT IV Transactions and Concurrency Control: Transactions, Nested 12
transactions, Locks, Optimistic Concurrency control, Timestamp ordering,
Comparison of methods for concurrency control.
Distributed Transactions: Flat and nested distributed transactions,
Atomic Commit protocols, Concurrency control in distributed
transactions, Distributed deadlocks, Transaction recovery. Replication:
System model and group communication, Fault - tolerant services, highly
available services, Transactions with replicated data.
UNIT V Distributed Algorithms: Introduction to communication protocols, 08
Balanced sliding window protocol, Routing algorithms, Destination based
routing, APP problem, Deadlock free Packet switching, Introduction to

59
 Wave & traversal algorithms, Election algorithm.
CORBA Case Study: CORBA RMI, CORBA services.
Suggested
Readings
1.Text Book 1. Singhal & Shivaratri, "Advanced Concept in Operating Systems" (2006),
McGraw Hill
2.Reference 1. Coulouris, Dollimore, Kindberg, "Distributed System: Concepts and
Books Design” (2007), Pearson Ed.
2. Gerald Tel, "Distributed Algorithms"(1999), Cambridge University
Press.

Semester :VIII
Course Name: Mobile Computing Evaluation
Components

60
Course Code: CSE404 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome
To explain the principles and theories of mobile computing technologies, describe infrastructures and
technologies of mobile computing technologies and list applications in different domains that mobile
computing offers to the public, employees, and businesses.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction, issues in mobile computing, overview of wireless telephony:
cellular concept, GSM: air-interface, channel structure, location
management: HLR-VLR, hierarchical, handoffs, channel allocation in
cellular systems, CDMA, GPRS. 06
UNIT II Wireless Networking, Wireless LAN Overview: MAC issues, IEEE
802.11, Blue Tooth, Wireless multiple access protocols, TCP over
wireless, Wireless applications, data broadcasting, Mobile IP, WAP: 12
Architecture, protocol stack, application environment, applications.
UNIT III Data management issues, data replication for mobile computers, adaptive 08
clustering for mobile wireless networks, File system, Disconnected
operations.
UNIT IV Mobile Agents computing, security and fault tolerance, transaction 12
processing in mobile computing environment.
UNIT V Ad Hoc networks, localization, MAC issues, Routing protocols, global 10
state routing (GSR),Destination sequenced distance vector routing
(DSDV), Dynamic source routing (DSR), AdHoc on demand distance
vector routing (AODV), Temporary ordered routing algorithm (TORA),
QoS in Ad Hoc Networks, applications.
Suggested
Readings
1.Text Book 1. J. Schiller, Mobile Communications(2005), Addison Wesley.
2.Reference 1. A. Mehrotra(2001) , GSM System Engineering.
Books 2. M. V. D. Heijden, M. Taylor, Understanding WAP(1999), Artech
House.

Semester :VIII
Course Name: (Elective-III)Embedded Systems Evaluation
Components

61
Course Code: CSE406 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: To acquire knowledge about microcontrollers embedded processors and their
applications. 1. Foster ability to understand the internal architecture and interfacing of different peripheral
devices with Microcontrollers. 2. Foster ability to write the programs for microcontroller. 3. Foster ability
to understand the role of embedded systems in industry. 4. Foster ability to understand the design concept
of embedded systems.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction to embedded systems: Classification, Characteristics and 10
requirements
UNIT II Timing and clocks in Embedded systems, Task Modeling and 08
management, Real time operating system issues.
UNIT III Signals, frequency spectrum and sampling, digitization (ADC, DAC), 12
Signal Conditioning and Processing. Modeling and Characterization of
Embedded Computation System.
UNIT IV Embedded Control and Control Hierarchy, Communication strategies for 10
embedded systems: Encoding and Flow control.
UNIT V Fault-Tolerance 08
Formal Verification.
Suggested
Readings
1.Text Book 1. H.Kopetz, “Real-Time Systems” , Kluwer, 1997.

2.Reference 1. R.Gupta, “Co-synthesis of Hardware and Software for Embedded

Books Systems”, Kluwer 1995.
2. Rajkamal, “Embedded Systems”, TMH, 2008

Semester :VIII
Course Name: (Elective-III) Parallel Computing Evaluation
Components

62
Course Code: CSE406 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: Students demonstrate they can define and apply parallel computing to a variety of
applications in Mathematics and Engineering.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction: What is parallel and distributed computing, Scope of parallel 10
and distributed computing, Scope of parallel computing. Parallel
Programming Platforms: implicit parallelism, Dichotomy of parallel
computing platforms, Physical organization for parallel platforms,
communication cost in parallel machines, routing mechanism for
interconnection networks.
UNIT II Basic Communication Operation: One-to-all broadcast; All-to-all 08
broadcast; Reduction and prefix sums; One-to-all personalized
communication; All-to-all personalized communication;
UNIT III Performance and Scalability of Parallel Systems: Performance matrices 10
for Parallel systems? Run time, Speed up, Efficiency and Cost; The effect
of granularity on performance
UNIT IV Sorting: Sorting networks; Bubble sort and its variants; Quick sort and 10
other sorting algorithms

UNIT V Dynamic Programming: Overview of dynamic programming, Serial 10

monadic DPFormulations: The shortest path Problem, the 0/1 Knapsack
Problem, Serial Polyadic DP Formulation : all pair shortest paths
algorithms.
Suggested
Readings
1.Text Book 1. Vipin Kumar, Ananth Grama, Anshul Gupta and George Karypis;
Introduction to Parallel Computing, The Benjamin/Cumming Publishing
Company 2000, Inc., Masschachusetts
2.Reference 1. George Coulouris, Jean Dollimore and Tim Kindberg; Distributed
Books Systems Concepts and
Design, Addison-Wesley, Masschachusetts 1999
2. S G Akl; The Decision and analysis of parallel algorithms, PH
Englewood Cliffs, New Jersey.2003

Semester :VIII
Course Name: (Elective-III) Multimedia Evaluation

63
Communication & System Design Components
Course Code: CSE406 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: To describe technical characteristics and performance of multimedia system and
terminals, design creative approach in application of multimedia devices, equipment and systems, carry
out experiments and measurements on the multimedia systems in laboratory conditions on real.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction 08
Introduction to Multimedia, Multimedia Information, Multimedia Objects,
Multimedia in business and work. Convergence of Computer,
Communication and Entertainment products
Stages of Multimedia Projects
Multimedia hardware, Memory & storage devices, Communication
devices, Multimedia software's, presentation tools, tools for object
generations, video, sound, image capturing, authoring tools, card and page
based authoring tools.
UNIT II Multimedia Building Blocks 08
Text, Sound MIDI, Digital Audio, audio file formats, MIDI under
windows environment Audio & Video Capture.
UNIT III Data Compression 14
Huffman Coding, Shannon Fano Algorithm, Huffman Algorithms,
Adaptive Coding, Arithmetic
Coding Higher Order Modelling. Finite Context Modelling, Dictionary
based Compression,
Sliding Window Compression, LZ77, LZW compression, Compression,
Compression ratio loss less & lossy compression.
UNIT IV Speech Compression & Synthesis 10
Digital Audio concepts, Sampling Variables, Loss less compression of
sound, loss compression & silence compression.
UNIT V Images 08
Multiple monitors, bitmaps, Vector drawing, lossy graphic compression,
image file formatic animations Images standards, JPEG Compression, Zig
Zag Coding, Multimedia Database. Content based retrieval for text and
images
Video: Video representation, Colors, Video Compression, MPEG
standards, MHEG Standard Video Streaming on net, Video Conferencing,
Multimedia Broadcast Services, Indexing and retrieval of Video Database,
recent development in Multimedia.
Suggested
Readings
1.Text Book 1. Tay Vaughan “Multimedia, Making IT Work” (2003) Osborne McGraw
Hill.
2.Reference 1. Buford “Multimedia Systems” (2004) Addison Wesley.
Books 2. Agrawal & Tiwari “Multimedia Systems” (2003) Excel.

64
 Semester :VIII
Course Name: (Elective-III) Pattern Recognition Evaluation
Components
Course Code: CSE406 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: Design systems and algorithms for pattern recognition (signal classification), with
focus on sequences of patterns that are analyzed using, e.g., hidden Markov models (HMM), Analyse
classification problems probabilistically and estimate classifier performance, Understand and analyse
methods for automatic training of classification systems
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction 08
Pattern recognition, classification and description, patterns and features
extraction, training and learning in PR systems, pattern recognition
approaches
UNIT II Pattern Discrimination 10
Decision regions and functions, feature Space Metrics, The Covariance
Matrix, Principal components, feature assessment, dimensionality ratio
problem
Data Clustering
Unsupervised classification, Standardization issues, tree clustering,
dimensional reduction, Kmeans clustering, cluster validation
UNIT III Statistical Classifications 10
Linear Discriminants, Bayesian classification, Model free techniques,
feature selection, classifier evaluation, tree classifier
UNIT IV Syntactic pattern recognition 12
Introduction, quantifying structure in pattern description, grammar based
approach and applications, elements of formal grammars, recognition of
syntactic descriptions, parsing, CYK parsing algorithm
UNIT V Structural pattern recognition 08
Primitives, structural representations, syntactic analysis, structural
matching
Suggested
Readings
1.Text Book 1. Pattern Recognition: Statistical, structural and neural approaches,
Robert J. Schalkoff,
WILEY 1992
2.Reference 1. Pattern Recognition: Concepts, Methods and applications, J.P.
Books Marques, Springer 2008
2. Pattern Recognition: Techniques and applications, rajjan Shinghal,
Oxford University Press, 2006

Semester :VIII

65
Course Name: (Elective-III) Natural Language Evaluation
Processing Components
Course Code: CSE406 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: Understand approaches to syntax and semantics in NLP, understand approaches to
discourse, generation, dialogue and summarization within NLP, understand current methods for statistical
approaches to machine translation, understand machine learning techniques used in NLP, including hidden
Markov models and probabilistic context-free grammars, clustering and unsupervised methods, log-linear
and discriminative models.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction to Natural Language Understanding: The study of Language, 10
Applications of NLP, Evaluating Language Understanding Systems,
Different levels of Language Analysis,
Representations and Understanding, Organization of Natural language
Understanding Systems, Linguistic Background: An outline of English
syntax.
UNIT II Introduction to semantics and knowledge representation, Some 10
applications like machine translation, database interface.
UNIT III Grammars and Parsing: Grammars and sentence Structure, Top-Down and 10
Bottom-Up Parsers, Transition Network Grammars, Top-Down Chart
Parsing. Feature Systems
Augmented Grammars: Basic Feature system for English, Morphological
Analysis and the Lexicon, Parsing with Features, Augmented Transition
Networks.
UNIT IV Grammars for Natural Language: Auxiliary Verbs and Verb Phrases, 10
Movement Phenomenon in Language, Handling questions in Context-Free
Grammars. Human preferences in Parsing, Encoding uncertainty,
Deterministic Parser.
UNIT V Ambiguity Resolution: Statistical Methods, Probabilistic Language 08
Processing, Estimating Probabilities, Part-of-Speech tagging, Obtaining
Lexical Probabilities, Probabilistic Context-Free Grammars, Best First
Parsing. Semantics and Logical Form, Word senses and Ambiguity,
Encoding Ambiguity in Logical Form.
Suggested
Readings
1.Text Book 1. Akshar Bharti, Vineet Chaitanya and Rajeev Sangal, NLP: A Paninian
Perspective, Prentice Hall(2000), New Delhi
2.Reference 1. James Allen, Natural Language Understanding, 2/e, Pearson
Books Education, 2003
2. D. Jurafsky, J. H. Martin, Speech and Language Processing, Pearson
Education, 2002

Semester :VIII

66
Course Name: (Elective-III) Decision Support Evaluation
System Components
Course Code: CSE406 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: To reflect upon and apply basic scientific theories about hypothesis testing,
falsibiability, equifinality, and predictive power as applied to environmental decision-making
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 DECISION MAKING AND COMPUTERIZED SUPPORT 08
Management Support Systems: An Overview - Decision Making,
Systems, Modeling, and Support.
UNIT II DECISION SUPPORT SYSTEMS 10
Decision Support Systems: An Overview - Modeling and Analysis –
Business Intelligence: Data Warehousing, Data Acquisition, Data Mining,
Business Analysis,and Visualization - Decision Support System
Development.
UNIT III COLLABORATION, COMMUNICATION, ENTERPRISE DECISION 12
SUPPORT SYSTEMS AND KNOWLEDGE MANAGEMENT
Collaborative Computing Technologies: Group Support Systems –
Enterprise Information Systems - knowledge Management.
UNIT IV INTELLIGENT DECISION SUPPORT SYSTEMS 10
Artificial Intelligence and Expert Systems: Knowledge-Based System –
Knowledge Acquisition, Representation, and Reasoning - Advanced
Intelligent Systems -Intelligent Systems over the Internet.
UNIT V IMPLEMENTING IN THE E-BUSINESS ERA 08
Electronic Commerce - Integration, Impacts, and the Future of the
Management Support Systems.
Suggested
Readings
1.Text Book 1. Efraim Turban, Jay Aronson E., Ting-Peng Liang, "Decision Support
Systems and Intelligent Systems", 7th Edition, Pearson Education,
2006.
2.Reference 1. George M .Marakas , "Decision Support Systems in the 21st
Books century",2nd Edition, PHI, 2009.
2. Janakiraman V.S., Sarukesi K., “ Decision Support Systems”, PHI,
2009.

Semester :VIII

67
Course Name: (Elective-IV) Cloud computing Evaluation
Components
Course Code: CSE408 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: Analyze the Cloud computing setup with it's vulnerabilities and applications using
different architectures. Design different workflows according to requirements and apply map reduce
programming model. Apply and design suitable Virtualization concept, Cloud Resource Management and
design scheduling algorithms.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Overview of cloud computing : What is a cloud, Definition of cloud , 08
Definition of cloud ,characteristics of cloud ,Why use clouds, How
clouds are changing , How clouds are changing , Driving factors towards
cloud, Comparing grid with cloud and other computing systems, workload
patterns for the cloud, “Big Data”, IT as a service.
UNIT II Cloud computing concepts: Concepts of cloud computing, Cloud 10
computing leverages the Internet,
Positioning cloud to a grid infrastructure, Elasticity and scalability,
Virtualization, Characteristics of virtualization, Benefits of virtualization,
Virtualization in cloud computing, Hypervisors, Multitenancy
UNIT III Types of tenancy, Application programming interfaces (API), Billing and 12
metering of services , Economies of scale, Management, tooling, and
automation in cloud computing, Management: Desktops in the
Cloud,Security.
Cloud service delivery: Cloud service , Cloud service model
architectures, Infrastructure as a service (IaaS) architecture, Infrastructure
as a service (IaaS) details, Platform as a service (PaaS) architecture,
Platform as a service (PaaS) details, Platform as a service (PaaS) ,
Examples of PaaS software, Software as a service (SaaS) architecture,
Software as a service (SaaS) details, Examples of SaaS applications,
Trade-off in cost to
install versus , Common cloud management platform reference
architecture: Architecture overview diagram, Common cloud management
platform.
UNIT IV Cloud deployment scenarios: Cloud deployment models, Public clouds, 10
Hybrid clouds, Community,
Virtual private clouds, Vertical and special purpose, Migration paths for
cloud, Selection criteria for cloud deployment.
UNIT V Security in cloud computing : Cloud security reference model, How 08
security gets integrated , Cloud
security , Understanding security risks, Principal security dangers to cloud
computing, Virtualization and multitenancy, Internal security breaches,
Data corruption or loss, User account and service hijacking, Steps to
reduce cloud security breaches, Steps to reduce cloud security breaches,
Reducing cloud security, Identity management: Detection and forensics,
Identity management: Detection and Identity management, Benefits of
identity, Encryption techniques, Encryption & Encrypting data ,
Symmetric key encryption, Asymmetric key encryption, Digital signature,

68
 What is SSL?
IBM Smart Cloud, Amazon Web Services, Google Cloud platform,
Windows Azure platform, A comparison of Cloud Computing Platforms,
Common building Blocks.
Suggested
Readings
1.Text Book 1. Raj Kumar Buyya, James Broberg, Andrezei M.Goscinski, Cloud
Computing: Principles and paradigms, 2011
2.Reference 1. Michael Miller, Cloud Computing, 2008.
Books 2. Judith Hurwitz, Robin Bllor, Marcia Kaufman, Fern Halper, Cloud
Computing for dummies, 2009.

Semester :VIII

69
Course Name: (Elective-IV) Data Mining & Data Evaluation
Warehousing Components
Course Code: CSE408 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: Understand Data preprocessing and data quality. Learn Modeling and design of data
warehouses. Learn Algorithms for data mining.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Overview, Motivation(for Data Mining),Data Mining-Definition & 10
Functionalities, Data Processing, Form of Data Preprocessing, Data
Cleaning: Missing Values, Noisy Data,(Binning, Clustering, Regression,
Computer and Human inspection),Inconsistent Data, Data Integration and
Transformation. Data Reduction:-Data Cube Aggregation,
Dimensionality reduction, Data Compression, Numerosity Reduction,
Clustering, Discretization and Concept hierarchy generation.
UNIT II Concept Description:- Definition, Data Generalization, Analytical 10
Characterization, Analysis of attribute relevance, Mining Class
comparisions, Statistical measures in large Databases. Measuring Central
Tendency, Measuring Dispersion of Data, Graph Displays of Basic
Statistical class Description, Mining Association Rules in Large
Databases, Association rule mining, mining Single-Dimensional Boolean
Association rules from Transactional
Databases– Apriori Algorithm, Mining Multilevel Association rules from
Transaction Databases and Mining Multi-Dimensional Association rules
from Relational Databases.
UNIT III Classification and Predictions: 10
What is Classification & Prediction, Issues regarding Classification and
prediction, Decision tree, Bayesian Classification, Classification by Back
propagation, Multilayer feed-forward Neural Network, Back propagation
Algorithm, Classification methods K nearest neighbour classifiers,
Genetic Algorithm.
Cluster Analysis:
Data types in cluster analysis, Categories of clustering methods,
Partitioning methods. Hierarchical Clustering- CURE and Chameleon,
Density Based Methods-DBSCAN, OPTICS, Grid Based Methods-
STING, CLIQUE, Model Based Method –Statistical Approach, Neural
Network approach, Outlier Analysis
UNIT IV Data Warehousing: Overview, Definition, Delivery Process, Difference 10
between Database System and Data Warehouse, Multi Dimensional Data
Model, Data Cubes, Stars, Snow Flakes, Fact Constellations, Concept
hierarchy, Process Architecture, 3 Tier Architecture, Data Marting.
UNIT V Aggregation, Historical information, Query Facility, OLAP function and 08
Tools. OLAP Servers, ROLAP, MOLAP, HOLAP, Data Mining interface,
Security, Backup and Recovery, Tuning Data Warehouse, Testing Data
Warehouse.
Suggested
Readings
1.Text Book 1. M.H.Dunham,”Data Mining:Introductory and Advanced Topics”

70
 Pearson Education 2000
2.Reference 1. Jiawei Han, Micheline Kamber, ”Data Mining Concepts & Techniques”
Books Elsevier 2003
2. Sam Anahory, Dennis Murray, “Data Warehousing in the Real World :
A Practical Guide
for Building Decision Support Systems, 1/e “ Pearson Education 2001

Semester :VIII

71
Course Name: (Elective-IV)Computational Evaluation
Geometry Components
Course Code: CSE408 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: To acquaint with the typical problems of computational geometry, understand the
existing solutions and their applications in computer graphics and machine vision,get deeper knowledge of
mathematics.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Convex hulls: construction in 2d and 3d, lower bounds; Triangulations: 08
polygon triangulations, representations, point-set triangulations, planar
graphs;
UNIT II Voronoi diagrams: construction and applications, variants; Delayney 10
triangulations: divide and-conquer, flip and incremental algorithms,
duality of Voronoi diagrams, minmax angle properties;
UNIT III Geometric searching: point-location, fractional cascading, linear 12
programming with prune and search, finger trees, concatenable queues,
segment trees, interval trees; Visibility: algorithms for weak and strong
visibility, visibility with reflections, art-gallery problems;
UNIT IV Arrangements of lines: arrangements of hyper planes, zone theorems, 10
many-faces complexity and algorithms; Combinatorial geometry: Ham-
sandwich cuts.
UNIT V Sweep techniques: plane sweep for segment intersections, Fortune's 08
sweep for Voronoi diagrams, topological sweep for line arrangements;
Randomization in computational geometry: algorithms, techniques for
counting; Robust geometric computing; Applications of computational
geometry
Suggested
Readings
1.Text Book 1. Computational Geometry: An Introduction by Franco P. Preparata and
Michael Ian Shamos; SpringerVerlag, 1985.
2.Reference 1. Computational Geometry, Algorithms and Applications by Mark de
Books Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf;
Springer-Verlag, 1997. from Springer.
2. Algorithmische Geometrie (auf deutsch)by Rolf Klein Addison-Wesley,
1996

72
 Semester :VIII
Course Name: Elective-IV(Granular Computing) Evaluation
Components
Course Code: CSE408 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: To understand granular computing and use it in problem solving. To study granular
computing algorithms.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Methodology and mathematical framework 10
Information Granules, Formal models of information granules, conceptual
aspects, granular world, granular computing: pyramid, communication
between granular worls.
UNIT II Sets and Intervals 08
Formalism of sets, set enclosure, Interval analysis, Interval Vectors,
Interval Matrices, enclosure of functions.
Fuzzy Sets
Concept and formalism, geometry of fuzzy sets, main classes, operations
on fuzzy sets, relationships, transformation, fuzzy arithmetic
Rough sets
Concept, set approximation, characterization, rough functions.
UNIT III Algorithm of Information Granulation 12
Principle of granular clustering, computational aspects of granular
computing, granular analysis.
Recursive information granulation
Introduction, design and characterization of information granules,
assessment and Interpretation, Granular time series.
UNIT IV Granular Systems Application 10
Temporal granulation and signal analysis, Granulation of signals in spatial
domain, Granular models of signals, rough sets in signal granulation.
UNIT V Granular Data Compression 08
Fuzzy relational equations, relational calculus in image compression,
experiments.
Suggested
Readings
1.Text Book 1. Granular computing: An introduction Andrez bargiela, Witold Pedrycz,
Kluwer Academic Publisher, 2003
2.Reference 1. Handbook Of Granular Computing, Witold Pedrycz, Andrzej Skowron,
Books Vladik Kreinovich, by Wiley 2001.
2. Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing,
Slezak, Wang, Szczuka, Springer, 2005.

73
 Semester :VIII
Course Name: (Elective-IV) Storage Networks Evaluation
Components
Course Code: CSE408 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: Identify the need for performance evaluation and the metrics used for it Apply the
techniques used for data maintenance. Realize strong virtualization concepts ,Develop techniques for
evaluating policies for LUN masking, file systems
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Introduction to Storage Technology 10
Introduction to storage network, Five pillars of IT, parameters related with
storage, data proliferation, problem caused by data proliferation,
Hierarchical storage management, Information life cycle management
(ILM), Role of ILM, Information value vs. time mapping, Evolution of
storage, Storage infrastructure component, basic storage management
skills and activities, Introduction to Data centers, Technical & Physical
components for building data centers.
UNIT II Technologies for Storage network 08
Server centric IT architecture & its limitations, Storage centric IT
architecture & advantages, replacing a server with storage networks, Disk
subsystems, Architecture of disk subsystem, Hard disks and Internal I/O
channel, JBOD, RAID& RAID levels, RAID parity, comparison of RAID
levels, Hot sparing, Hot swapping, Caching : acceleration of hard disk
access, Intelligent Disk subsystem architecture,
Tape drives
Introduction to tape drives, Tape media, caring for Tape& Tape heads,
Tape drive performance, Linear tape technology, Helical scan tape
technology
UNIT III I/O techniques 12
I/O path from CPU to storage systems, SCSI technology – basics &
protocol, SCSI and storage networks, Limitations of SCSI,
Fibre channel
Fibre channel, characteristic of fibre channel, serial data transfer vs.
parallel data transfer, Fibre channel protocol stack, Links, ports &
topologies, Data transport in fibre channel, Addressing in fibre channel,
Designing of FC-SAN, components, Interoperability of FCSAN, FC
products,
IP Storage
IP storage standards (iSCSI, iFCP, FCIP, iSNS), IPSAN products,
Security in IP SAN, introduction to infiniband, Architecture of Infiniband
NAS – Evolution, elements & connectivity, NAS architecture.
UNIT IV Storage Virtualization 12
Introduction to storage virtualization, products, definition, core concepts,
virtualization on various levels of storage network, advantages and
disadvantages, Symmetric and asymmetric virtualization, performance of
San virtualization, Scaling storage with virtualization.
UNIT V Management of storage Networks 06

74
 Management of storage network, SNMP protocol, requirements of
management systems, Management interfaces, Standardized and
proprietary mechanism, In-band& Out-band management,
Suggested
Readings
1.Text Book 1. "Storage Networks: The Complete Reference", R. Spalding, McGraw-
Hill(2003)
2.Reference 1. "Storage Networking Fundamentals: An Introduction to Storage
Books Devices, Subsystems, Applications, Management, and Filing Systems",
Marc Farley, Cisco Press.2004
2. "Designing Storage Area Networks: A Practical Reference for
Implementing Fibre Channel and IP SANs, Second Edition", Tom Clark
Addison Wesley.(2005)

75
 Semester :VIII
Course Name: (Elective-IV) Big Data Analytics Evaluation
Components
Course Code: CSE408 Credit L T P I P E Total
4 3 1 0 40 - 60 100
Prerequisite Course and code (if any)
Course Outcome: To understand the key issues in big data management and its associated applications in
intelligent business and scientific computing. Acquire fundamental enabling techniques and scalable
algorithms like Hadoop, Map Reduce and NO SQL in big data analytics.
Unit No Content Lecture
Hrs/contact
Hrs
UNIT 1 Overview of Big Data, Stages of analytical evolution, State of the Practice 10
in Analytics, The Data Scientist, Big Data Analytics in Industry Verticals,
Data Analytics Lifecycle
UNIT II Operationalizing Basic Data Analytic Methods Using R, 08
UNIT III Analytics - Analytics for Unstructured Data - Map Reduce and Hadoop, 12
The Hadoop Ecosystem, In-database Analytics,
UNIT IV Data Visualization Techniques, Stream Computing Challenges, Systems 10
architecture, Main memory data management techniques
UNIT V energy-efficient data processing, Benchmarking, Security and Privacy, 08
Failover and reliability.
Suggested
Readings
1.Text Book 1. Bill Franks, Taming The Big Data Tidal Wave, 1st Edition, Wiley,
2012.
2.Reference 1. Frank J. Ohlhorst, Big Data Analytics,1st Edition, Wiley, 2012.
Books

76
 Semester : VIII
Course Name: Project Work Evaluation
Components
Course Code: CSE412 Credit L T P IP EP Total
2 0 0 4 40 60 100
List of Practical

1. Write an abstract or a summary of the Project Work. It must be as brief (NOT MORE THAN 30 A4
sized paper pages) as is sufficient enough to explain the objective and implementation of the project
that the student is going to take up.
2. The write up must adhere to the guidelines and should include the following :
a. Title of the Project.
b. Introduction, objectives and scope of the Project.
c. Project Category (Database/Web Application/ Client-server/Networking/ Multimedia/gaming etc.).
d. Tools / Platform, Hardware and Software Requirement specifications.
e. Analysis (DFDs at least up to second level, ER Diagrams/ Class Diagrams, Database Design etc. as per the
project requirements).
f. A complete structure which includes: Number of modules and their description to provide an
estimation of the student's effort on the project, Data Structures as per the project requirements for all
the modules, Process logic of each module, testing process to be used, reports generation (Mention
tentative content of report).
g. Whether Industry Defined/Client Defined/User Defined Project? Mention the type. Mention the Name
and Address of the Industry/Client.
h. Limitation of the project.
i. Future scope and further enhancement of the project.

77