B.Tech.

(Computer Science & Engineering)

Programme Structure & Syllabi

Third Semester

Course Exam.
Relative weightage (%)
Duration
Code Course Name L T P C
PR M ET
Th P
CWS S TE E PRE
MA1302 Engineering Mathematics-III 3 1 0 4 3 10 - 40 50 -
Computer Organization &
CS1301 Architecture 3 1 0 4 3 10 - 40 50 -
Switching Theory & Logic
CS1302 Design 3 1 0 4 3 10 - 40 50 -
CS1303 Data Structures 3 1 0 4 3 10 - 40 50 -
Object Oriented
CS1304 Programming(java) 3 1 0 4 3 10 - 40 50 -
Switching Theory & Logic
CS1330 Design Lab. 0 1 2 2 1.5 - 60 - - 40
CS1331 Data Structures Lab. 0 1 2 2 1.5 - 60 - - 40
Object Oriented
CS1332 Programming(java) Lab 0 1 2 2 1.5 - 60 - - 40
Total 15 8 6 26

Fourth Semester
Course Exam.
Relative weightage (%)
Code Course Name L T P C Duration
MT
Th P
CWS PRS E ETE PRE
MA1402 Engineering Mathematics IV 3 1 0 4 3 10 - 40 50 -
CS1401 Operating Systems 3 1 0 4 3 10 - 40 50 -
Relational Database
CS1402 Management Systems 3 1 0 4 3 10 - 40 50 -
CS1403 Microprocessors 3 1 0 4 3 10 - 40 50 -
---------- Open Elective-I 3 0 0 3 3 10 - 40 50 -
CS1430 Operating System Lab 0 1 2 2 1.5 - 60 - - 40
CS1431 Relational DBMS Lab 0 1 2 2 1.5 - 60 - - 40
CS1432 Microprocessors Lab 0 1 2 2 1.5 - 60 - - 40
Total 15 7 6 25
Fifth Semester
Course Course Name L T P C Exam. Relative weightage (%)
Code Duration
Th P CWS PRS MTE ETE PRE
CS1501 Design & Analysis 3 1 0 4 3 - 10 - 40 50 -
Of Algorithms
CS1502 Software 3 1 0 4 3 - 10 - 40 50 -
Engineering
CS1503 Computer Graphics 3 1 0 4 3 - 10 - 40 50 -
CS1504 Formal Languages 3 1 0 4 3 - 10 - 40 50 -
And Automata
Theory
IT1504 Data 3 1 0 4 3 - 10 - 40 50 -
Communications
CS1530 Design & Analysis 0 1 2 2 - 1.5 60 40
Of Algorithms Lab.
CS1531 Computer Graphics 0 1 2 2 - 1.5 60 40
Lab
CS1532 Software 0 1 2 2 - 1.5 60 40
Engineering Lab
Total 15 8 6 26

Sixth Semester
Course Course Name L T P C Exam. Relative weightage (%)
Code Duration
Th P CWS PRS MTE ETE PRE
CS1601 Language 3 1 0 4 3 - 10 - 40 50 -
Processors
CS1602 Computer 3 1 0 4 3 - 10 - 40 50 -
Networks &
Protocols
CS1603 Parallel Processing 3 1 0 4 3 - 10 - 40 50 -
---------- Open Elective-II 3 0 0 3 3 - 10 - 40 50 -
CS16xx Program Elective –I 3 0 0 3 3 - 10 - 40 50 -
CS16xx Program Elective - 3 0 0 3 3 - 10 - 40 50 -
II
CS1630 Language 0 1 2 2 - 1.5 60 40
Processors Lab.
CS1631 Computer 0 1 2 2 - 1.5 60 40
Networks
&Protocols Lab.
CS1632 Parallel Processing 0 1 2 2 - 1.5 60 40
Lab.
Total 18 6 6 27
Seventh Semester
Course Course Name L T P C Exam. Relative weightage (%)
Code Duration
Th P CWS PRS MTE ETE PRE
MB1721 Essentials of 3 1 0 4 3 - 10 - 40 50 -
Management &
Engineering
Economics
CS1701 Big Data Analytics 3 1 0 4 3 - 10 - 40 50 -
CS1702 Object Oriented 3 1 0 4 3 - 10 - 40 50 -
Analysis & Design
CS17xx Program Elective 3 0 0 3 3 - 10 - 40 50 -
III
CS17xx Program Elective- 3 0 0 3 3 - 10 - 40 50 -
IV
CS1730 Big Data Analytics 0 1 2 3 - 1.5 60 40
Lab
CS1731 Object Oriented 0 1 2 3 - 1.5 60 40
Analysis & Design
Lab
CS1779 Mini project 0 0 - 3 100#
Total 18 5 4 26

Eighth Semester
Course Course Name L T P C Exam. Relative weightage (%)
Code Duration
Th P CWS PRS MTE ETE PRE
CS1881 Major Project 0 0 - 20 25# 75##
TOTAL 0 0 - 20

*will be done in the summer and evaluated in eighth semester

Note:- # Midterm presentation.
## Final presentation

Project work evaluation (mid semester evaluation) = 100 marks (Committee=Guide+HOD+Co

ordinator)
Project work evaluation (end semester evaluation) = 300 marks (100 marks for Report
evaluation+100 mark for Guide + Viva-voce = 100 marks (Jointly)

L = Number of Lectures hrs/week T= Number of Tutorials hrs/week

P = Number of practical hours/week C= Number of Credits.
CWS: Class Work Sessionals PRS: Practical Sessionals
MTE: Mid-Term Exam ETE: End Term Exam
PRE: End Term Practical Exam * Presentations Only

Open Electives
CS1690 Principles of Programming Languages
CS1691 Programming in C++
CS1692 Programming in Java
CS1693 Linux Basics and Programming
CS1694 Web 2.0 and Rich Internet Applications
CS1695 Information Retrieval
CS1696 Database Management Systems
CS1697 Principles of Software Engineering

Program Electives

ELECTIVE I:
CS1650 Digital Image Processing
CS1651 Information Retrieval

ELECTIVE II:
CS1652 Distributed Systems
CS1653 Cloud Computing Infrastructure Services

ELECTIVES III
CS1750 Artificial Intelligence
CS1751 Advanced Internet Technology

ELECTIVE IV
CS1752 Cryptography & Network Security
CS1753 Mobile computing

Note: A few Electives from the above list will be offered depending on the availability of
Faculty.

1st year Credits: 52

2nd-4th year credits: 150
Total credits: 202

SYLLABI
MA1302 ENGINEERING MATHEMATICS-III [3 1 0 4]

Boolean Algebra, subalgebra, Direct product & Homomorphism, Lattices and Algebraic
Systems, properties of Lattices and related theorem, Statements and Notations, Tautologies and
contradictions, equivalence of formulas, Tautological implications, Theory of inference, rules of
inference, statement function, variables and quantifiers, Predicate Calculus, Permutations and
Combinations, Generating function, Principle of inclusion and exclusion, Partitions,
compositions, Lexicographical and Fikes ordering of permutations, Algorithms for generating
functions, Graph theory, path, cycle, Basic theorems, Dijkstra’s Algorithms, Group theory,
semigroups and monoids, Permutation groups, cyclic groups.

Text Books:
1. J. P. Tremblay and R. Manohar, Discrete Mathematics Structures with Application to
computer Science, Tata Mc Graw Hill, 2001.
References:
1. C. L. Liu, Elements of Discrete Mathematics, Mc Graw Hill, 2008.
2. E. P. Page and L. B. Wilson, An introduction to computational combinatorics, Cambridge
Univ. Press, 1979.

CS1301 COMPUTER ORGANIZATION AND ARCHITECTURE [3 1 0 4]

Basic Structure of computers: Computer types, functional units, basic operational concepts,
bus structures, software, performance; Machine Instructions and programs: Numbers,
arithmetic operations and characters, Memory locations and addresses; Memory operations,
Addressing modes; Arithmetic: Addition and subtraction of signed numbers, Adders, ALU
design, Bit slice processor, Multiplication of positive numbers Signed operand multiplication,
Fast multiplication, Integer division, Floating point numbers and operations; Memory Systems:
Introduction, Basic concepts, Design methods; RAM memories, Read only memories, Speed
size and cost, Cache memories, Performance considerations, Virtual memories, Memory,
Management Requirements, Secondary storage; Input/Output organization: Accessing I/O
devices, Interrupts, Direct memory access, Buses, Interface circuits

References:
1. C. Hamacher, Z. Vranesic, “Computer Organization”, TMH, 2002.
2. W. Stallings, “Computer Organization and Architecture – Designing for Performance”, PHI,
2009.

CS1302 SWITCHING THEORY & LOGIC DESIGN [3 1 0 4]

Introduction to logic circuits: Variables and functions, Inversion, Truth tables, Logic gates and
networks, Boolean algebra, Introduction to VHDL; Optimized implementation of logic
functions: Synthesis using AND OR and NOT gates, Karnaugh map, Strategy for minimization,
Minimization of POS forms, Incompletely Specified Functions, Multiple output circuits NAND
and NOR logic networks, multilevel NAND and NOR circuits, Analysis of multilevel circuits;
Number representation and arithmetic circuits: Positional number representation, Addition of
unsigned numbers, Signed numbers, Fast adders, Design of arithmetic circuits using VHDL,
BCD representation; Combinational-Circuit building blocks: Multiplexer, decoder, Encoder,
Code converter, Arithmetic comparison circuits, VHDL for Combinational Circuits; Flip Flops,
Registers, Counters; Overview of semiconductor diode: BJT, MOSFET, TTL–standard, High
speed, low-power, low-power schottky, CMOS logic-NAND, NOR

References:
1. S. Brown and Z. Vranesic, “Fundamentals of Digital Logic with VHDL Design”, TMH,
2000.
2. M. Mano, “Digital Design”, PHI Pvt. Ltd., 3rd Edition, 2000.
3. P. Leach, A. Malvino, G. Saha, “Digital Principles and Applications”, TMH, 6th Edition,
2006.
4. J. Bhasker, “A VHDL Primer”, PHI Pvt. Ltd., 3rd Edn, 2005.

CS1303 DATA STRUCTURES [3 1 0 4]

Introduction: Algorithm specification; Performance Analysis: Time and Space Complexity,

Asymptotic notation; pointer declaration and definition, memory allocation functions, array of
pointers; The type definition, enumerated types, accessing structures, complex structures, arrays
of structures, structures and functions; Recursive definition & processes, Recursion in C, writing
recursive programs efficiency of recursion, Examples: Tower of Hanoi, GCD, Fibonacci
Definition and examples, Representing stacks in C, Evaluation of expressions, multiple stacks
and queues; Applications: infix, postfix and prefix and their conversions Linked lists
representations, Singly, doubly, header node, circular, Applications: linked stacks and queues,
polynomial and long integer arithmetic, union, intersection, Basic terminologies, binary tree
representation, recursive/ non recursive, Binary search tree, AVL trees; Applications:
Expression trees, inserting, deleting, searching, height of BST Terminology and representations,
Graph operations, spanning trees, minimum cost spanning tree, shortest path and transitive
closure, Binary and linear search, insertion, quick, merge, heap, radix sort Static Hashing

References:
1. A. Forouzan, R. F. Gilberg, “A Structured Programming Approach Using C”, Thomson, 2003.
2. A. Tenenbaum, J. Augenstein, “Data Structures using C”, Pearson Education, 2006.
3. E. Horowitz, S. Sahni, “Fundamentals of Data Structures in C”, Silicon Press, 2nd Edn, 2007.

CS1304 OBJECT ORIENTED PROGRAMMING USING JAVA [3 1 0 4]

The History and Evolution of java: The Creation of Java, how java changed the internet,
Java’s Magic, Servlets, The java Buzzwords; An Overview of Java, arrays; Introduction to
classes: Class fundamentals, declaring objects, Assigning Object reference variables,
Introduction to methods, Constructors, this keyword, Garbage collection, finalize() method,
Overloading, objects as parameters, argument passing, returning objects, recursion, access
control, final, nested and inner classes, string class; I/O Basics: Reading Console Input, Writing
Console Output, Files, Applet fundamentals; Inheritance: basics, super, multilevel hierarchy,
overriding, abstract classes, final with inheritance; Packages and Interfaces, Exception Handling,
Multithreaded programming; String Handling, Applet Class, Event Handling; Introduction to
AWT: Classes, component, Container, Panel, Window, frame, Canvas, working with frame,
working with Graphics, using AWT Controls.

References:
1. Herbert Schildt , “The Complete Reference Java Eight Edition”, Tata McGraw-Hill, reprint
2011
2. Steven Holzner, “Java 2 programming black book” , Dream Tech, New Delhi, reprint: 2005.

CS1330 SWITCHING THEORY& LOGIC DESIGN LAB [0 1 2 2]

Simulation of the following logic circuits using VHDL code MAX+ and Verification of logic
gates and Boolean algebra; Boolean algebra, Simplification of expressions using Kmap.
Experiments on multilevel NAND, NOR circuits; Arithmetic circuits; multiplexers and
Multiplexer Applications.

References:
1. S. Brown and Z. Vranesic, “Fundamentals of digital logic with VHDL design”, TMH, 2000.
2. J. Bhasker, “A VHDL Primer”, PHI Pvt. Ltd., 3rd Edition, 2005.

CS1331 DATA STRUCTURES LAB [0 1 2 2]

Review of C and programs on Recursion, Stacks, Stacks, Queues, lists, Trees, Graphs, using C
language.

References:
1. A. Forouzan, R. F. Gilberg, “A Structured Programming Approach Using C, Thomson”, 2nd
Edition, 2003.
2. A. Tanenbaum, J. Augeustein, “Data Structures using C”, Pearson Education, 2006.
3. E. Horowitz, S. Sahni, “Fundamentals of Data Structures in C”, Silicon Press, 2nd Edition,
2007.

CS1332 OBJECT ORIENTED PROGRAMMING USING JAVA LAB [0 1 2 2]

Control statements and arrays, Stacks and Lists, Strings, Classes and methods, Inheritance,
Packages, Interfaces, Exception Handling, Threads, Input/Output, Event Handling, Applets,
involving AWT, Programs involving AWT

References:
Herbert Schildt , “The Complete Reference Java Eight Edition”, Tata McGraw-Hill, reprint
2011

MA1402 ENGINEERING MATHEMATICS-IV [3 1 0 4]

Probability, distributions, Moment generating functions, functions of random variables, F and T
distributions, Sampling distribution, Central limit theorem, Point estimation, MLE, interval
estimation, Test of Hypothesis, significance level, certain best tests, Stichastic process,
classification of statistics of stochastic process, stationary and Ergodic process.

Text Books:
1. P. L. Meyer, Introduction to Probability and Statistical Applications, Addison-Wesley
Pub. Co., 1970.

References:
1. K. S. Trivedi, Probability, Statistics with Reliability, Queuing and computer science
applications, PHI, 2002.
2. Miller, Fruend and Johnson, Probability and Statistics for Engineers, PHI 2009.

CS1401 OPERATING SYSTEMS [3 1 0 4]

Introduction: Functions, Operating System Structure and Operations, Process Management,

Memory Management, Storage Management, Protection and Security, Special Purpose Systems,
Operating System Services, User Operating System Interfaces, System Calls, Types of System
Calls, System Programs, Operating System Structure, Virtual Machines, System Boot;
Processes: Concept, Process Scheduling, Operations on Processes, Inter-process Communication
Overview, Multithreaded Models, Thread Libraries, Threading Issues, Linux Threads, Basic
Concepts; CPU Scheduling: Scheduling Algorithms, Thread Scheduling, Linux Scheduling,
Algorithm Evaluation Background, Critical Section Problem; Memory management:
Contiguous Memory Allocation, Paging, Page Table Structure, Segmentation, Examples: The
Intel Pentium; Background, Demand Paging, Copy-On-Write, Page Replacement, Allocation of
Frames, Thrashing, Allocating Kernel Memory, Other Consideration; Files: Access Methods,
Directory Structure, File System, Access Matrix, Implementation of Access Matrix; Security
Problem: Program Threats, System and Network threats, User Authentication Design Principles,
Kernel Modules, Process Management, Scheduling, Memory Management, File Systems, Inter-
process Communication, Security

References:
1. A. Silberschatz, P. B. Galvin, “Operating System Concepts”, International student version,
Wiley India Student Edition, Eighth Edition, 2009.
2. W. Stallings, “Operating Systems: Internals and Design Principles”, Pearson Ed., 2009.
3. J. Harris, “Operating Systems”, Tata McGraw-Hill publications, 2002.

CS1402 RELATIONAL DATABASE MANAGEMENT SYSTEMS [3 1 0 4]

Introduction: Database-System Applications, Relational Databases, Database Design, Data

Storage and Querying, Transaction Management, Database Architecture; Relational Algebra:
Fundamental Relational-Algebra Operations, Extended Relational-Algebra Operations, Null
Values, Modification of the Database; SQL: Data Definition Language, Data manipulation
language , SQL Data Types and Schemas, Integrity Constraints, Basic Structure of SQL Queries,
Set Operations, Aggregate Functions, Null Values, Nested Sub-queries, Complex Queries,
Views, Modification of the Database, Joined Relations, Authorization, Overview of the Design
Process; The Entity-Relationship Model: Constraints, Entity-Relationship Diagrams, Entity-
Relationship Design Issues, Weak Entity Sets, Extended E-R Features; Hashing Techniques:
Dynamic Hashing; Transactions: Transaction State, Implementation of Atomicity and
Durability, Concurrent Executions, Serializability, Recoverability, Implementation of Isolation,
Testing for Serializability, Lock-Based Protocols, Log-Based Recovery, Recovery algorithms

References:
1. S. Korth, “Database System Concepts”, Mc-GrawHill, 6th Edition, 2011.
2. R. Elmasri, S. Navathe, “Fundamentals of Database Systems”, Pearson Education, 2006.
3. T. Connolly, C. Begg, “Database Systems–A Practical Approach to Design, Implementation
and Management”, Pearson Education, 3rd Edition, 2002.
.

CS1403 MICROPROCESSORS [3 1 0 4]

8086: internal architecture, programming the 8086, Addressing modes, Flags; Instruction Set:
assembler and Assembler directives, Simple sequence programs, Jumps and conditional jumps,
Loop instructions, Instruction timing and delay loops; String instructions, Writing and Using
Procedures and Macros, Interrupts and Interrupt Responses: 8259 Priority Interrupt
Controller, 8254 Software-Programmable Timer/counter; Software interrupts, DOS 21h
functions; Timing and Functional diagram: reset and wait state, Min and Max mode operation,
Min and max mode input, output timing diagrams; 8255: Programmable Parallel ports and
Handshake Input/ Output, 8087 Math Coprocessor, ISA Bus, PCI Bus, USB Bus, Accelerates
graphics port (AGP) Architecture, Real address and PVAM mode, Task protection and
Task Switching, Paging, Architecture, addressing modes, Instruction set, Simple assembly
language programs

References:
1. D. V. Hall, “Microprocessors and Interfacing”, TMH, Revised Second Edition, 2006.
2. B. B. Brey, “The Intel Microprocessors”, Seventh Edition, Prentice Hall India, 2005.
3. A. Clements, “Microprocessor system design 68000 Hardware”, Software, and Interfacing,
PWS Publishing Company, Third Edition, 1997.

CS1430 OPERATING SYSTEMS LAB [0 1 2 2]

Testing the use of UNIX commands, UNIX shell commands, Basics of Shell Programming,
UNIX System Calls, CPU Scheduling Algorithms, Deadlock Detection Algorithms, Deadlock
Avoidance Algorithms, Page Replacement Algorithms, Memory Allocation Algorithms, Disk
Scheduling Algorithms, UNIX Inter Process Communication.

References:
1. A. Silberschatz, P. B. Galvin, “Operating System Concepts”, International student version,
Wiley India Student Edition, Eighth Edition, 2009.
2. W. Stallings, “Operating Systems: Internals and Design Principles”, Pearson Ed., 2009.
3. J. Harris, “Operating Systems”, Tata McGraw-Hill publications, 2002.

CS1431 RELATIONAL DBMS LAB [0 1 2 2]

DB application development with MS Access, Experiments on DDL and Basic SQL, Advanced
SQL, ER diagrams using DIA tool, Data Integrity Constraints and Built-in Functions, Design and
Implementing the data requirements of a simple DB application, Experiments on Basic PL/SQL,
PL/SQL Exceptions and Transactions, PL/SQL Cursors, PL/SQL Procedures, Functions and
Packages, DB application development with Java as front end

References:
1. S. Korth, “Database System Concepts”, McGrawHill, 6th Edition, 2011.
2. R. Elmasri, S. Navathe, “Fundamentals of Database Systems”, Pearson Education, 2006.
3. T. Connolly, C. Begg, “Database Systems–A Practical Approach to Design”, Implementation
and Management, Pearson Education, 3rd Edition, 2002.

CS1432 MICROPROCESSORS LAB [0 1 2 2]

Basics of Assembly Programming, Programs using Addition, Subtraction and Branching

Instructions, Operations on BCD and ASCII data (Packing, Unpacking, Conversion between
BCD and ASCII), Multiplication and Division List Operations (Arrays)
String Operations, DOS and BIOS interrupts – String Operations DOS interrupts – Integer
Operations and file operations, Logic Controller Interfacing, DAC Interfacing
Elevator Interfacing

References:
1. Respective User Manual for the kit.

CS 1501 Design & Analysis of Algorithms [3 1 0 4]

Algorithm Analysis: A priori and a posteriori Analysis, Time Space Tradeoff, Asymptotic
Notations, Properties of asymptotic notations, Recurrence equations, Solving recurrence
equations using Substitution method and Master’s method, Divide and Conquer: Binary Search,
Finding Maximum and Minimum, Merge Sort, Quick Sort, Matrix Multiplication, Greedy
Algorithms: Knapsack Problem, Job Sequencing with deadline, Optimal Merge Pattern, Single
Source Shortest Path, Minimum Cost Spanning tree, Dynamic Programming: Multistage
Graphs, Matrix Chain Multiplication, All-Pair shortest paths, Optimal binary search trees, 0/1
Knapsack, Travelling salesperson problem, Graph Traversals, Connected Components, Spanning
Trees, Bi-connected components, Introduction to NP-Hard and NP-Completeness.

TEXT BOOKS:

1. Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, Computer Algorithms C++,
Second Edition, Universities Press, 2007.
2. K.S. Easwarakumar, Object Oriented Data Structures using C++, Vikas Publishing House pvt.
Ltd., 2000

REFERENCES:

1. T. H. Cormen, C. E. Leiserson, R.L.Rivest, and C. Stein, "Introduction to Algorithms",

Second Edition, Prentice Hall of India Pvt. Ltd, 2003.
2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, "The Design and Analysis of
Computer Algorithms", Pearson Education, 1999.

CS1502 SOFTWARE ENGINEERING [3 1 0 4]

Introduction: The Evolving Role of Software, The changing nature of software, Legacy
software, Software Myths, Software Engineering: A Layered Technology, A Process
Framework, The Capability Maturity Model Integration (CMMI), Specialized Process Models,
The Unified Process; Agile development: Agile Process Models Software Engineering Practice,
Communication Practice, Planning Practices, Modeling Practices, Construction Practice,
Deployment Computer–Based Systems, The System Engineering Hierarchy, Business Process
Engineering: An Overview; Product Engineering: An Overview, Data Modeling Concepts,
Object Oriented Analysis, Flow-Oriented Modeling, Taxonomy of Quality Attributes,
Perspectives of Quality, Quality System, Software Quality Assurance, Capability Maturity
Model Observation on Estimation, The Project Planning Process, Software Scope and
Feasibility, Human Resources, Empirical Estimation Model

References:
1. R. Pressman, “Software Engineering: A Practitioners Approach”, McGrawHill Pubs, 2000.
2. H. Valiet, “Software Engineering: Principles and Practice”, Wiley India, 3rd Edition, 2005.

CS1503 COMPUTER GRAPHICS [3 1 0 4]

Overview of Graphics Systems: Video display devices, Raster scan systems, Graphics software,
Introduction to OpenGL; Graphics Output primitives: Line drawing algorithms, Circles and
Ellipses generating algorithms, General Scan line polygon fill algorithm, Scan line fill of convex
polygons and regions with curved boundaries, Filling of areas with irregular boundaries;
Geometrical Transformations: Basic 2D transformations, Matrix representation and
Homogeneous coordinates, Inverse transformations, 2D composite transformations, Geometric
transformations in 3D space, 3D translation, rotation and scaling, Composite 3D transformations,
Affine transformations; Illumination Models: Light sources, Ambient light, Diffuse reflection,
Specular reflection and Phong model, Shadows, Displaying light intensities, Halftone patterns
and Dithering techniques, Basic ray tracing algorithm; Computer Animation: Raster methods
for computer animation, Design of animation sequences, Traditional and Computer animation
techniques, Key-Frame systems, Motion specifications, Articulated figure animation, Periodic
motion

References:
1. D. Hearn, M. Baker, Computer Graphics with OpenGL, Pearson Education, 3rd Edition, 2010.
2. E. Angel, Interactive Computer Graphics- A top down approach using OpenGL, Pearson
Education, 5th Edition, 2003.

CS1504 FORMAL LANGUAGES AND AUTOMATA THEORY [3 1 0 4]

Mathematical Preliminaries and Notation: Three basic concepts, Some Applications,

Deterministic Finite Accepters, Nondeterministic Finite Accepters, Equivalence of Deterministic
and Nondeterministic Finite Accepters, Reduction of the Number of States in Finite Automata;
Regular Expressions, Identifying Non-regular Languages; Context-Free grammars: Parsing
and Ambiguity, Context-Free Grammars and Programming Languages, Methods for
Transforming Grammars, Two important Normal Forms; Nondeterministic Pushdown Automata,
Pushdown Automata and Context–Free Languages, Deterministic Pushdown Automata and
Deterministic Context-Free Languages; The Standard Turing Machine: Linear Bounded
Automata, Recursive and Recursively Enumerable Languages, Unrestricted Grammars, Context
Sensitive grammars and Languages, The Chomsky Hierarchy

References:
1. P. Linz, “An Introduction To Formal Languages and Automata”, Narosa Publishing House,
Fourth Edition, 2006.
2. J. Martin, “Introduction to Languages and the Theory of Computation”, McGraw Hill, 2002.
3. J. Hopcroft, R. Motwani, “Introduction to Automata Theory, Languages and Computation”,
Pearson Education, 2006.

IT1504 DATA COMMUNICATION [3 1 0 4]

Introduction: Introduction to computer networks, evolution of computer networks and its uses,
OSI 7-Layer Architecture. The Physical layer: Basics of data communication, transmission
media, wireless transmission, telecom infrastructure, PSTN, Communication Satellites, Data
Link Layers, Framing, Error Detection and Correction, Retransmission Algorithms; Queuing
Models: Introduction & Little's Theorem, M/M/1, M/M/m, Queues. Networks of Queues, M/G/1
Queues, M/G/1, Priority Queues, Multiple Access & Aloha, Stabilized Aloha, Tree Algorithms,
CSMA, CSMA/CD and Ethernet, High-Speed LANs, Token Rings, Satellite Reservations;
Introduction to Switch Architecture: High Speed Switch Scheduling, Broadcast Routing &
Spanning Trees, Shortest Path Routing, Distributed Routing Algorithms, Optimal Routing, Flow
Control - Window/Credit Schemes, Rate Based Schemes, Transport Layer and TCP/IP;
Introduction to ATM Networks: Optical Networks and Wireless Networks.

TEXT BOOKS:

1. Bertsekas, Dimitri, Gallager, Robert, “Data Networks” (2nd Edition). Prentice Hall India,
ISBN: 9789332518742.
2. Tanenbaum A. S., “Computer networks” (5th Edition). Pearson Education, ISBN:
9788120307803.
3. Behrouz Forouzan, “Data communication & networking” (5th Edition). TMH, ISBN:
9781259064753.

REFERENCES:

1. Peterson and Davie “Computer Networks: A Systems Approach” (5th Edition), Morgan
Kaufmann Publishers, ISBN: 978-0123850591.
2. William Stallings, “Data and Computer Communications” (9th Edition). Pearson
Education, ISBN: 9789332518865.
3. Stevens, “TCP/IP Illustrated”, Addison-Wesley Publication, ISBN: 978-0201633467.
 4. Kleinrock, Leonard, “Queueing Systems, Vol 1: Theory”, Wiley Publication ISBN:
9780471491101.
1. Kleinrock, Leonard, “Queueing Systems, Vol 1: Theory”, Wiley Publication ISBN:
9780471491101.

CS1530 DESIGN AND ANALYSIS OF ALGORITHMS LAB [0 0 3 1]

Review of fundamental data structures, Fundamentals of algorithmic problem solving, Brute

force techniques, Divide and Conquer, Decrease and Conquer, Transform and Conquer, Space
and Time tradeoffs, Dynamic Programming, Greedy Technique, Backtracking, Branch and
Bound

References:
1. A. Levitin, “Introduction to The Design and Analysis of Algorithms”, Pearson Education, 2nd
Edition, 2007.
2. E. Horowitz, S. Sahni, “Computer Algorithms”, Galgotia Publications, 2001.
3. H. Cormen, C. E. Leiserson, “Introduction to Algorithms”, PHI, 2nd Edition, 2006.

CS1531 COMPUTER GRAPHICS LAB [0 1 2 2]

Understanding OpenGL and programs to draw objects, Line drawing algorithms, Midpoint
Circle and Ellipse algorithms, Polygon filling algorithms, Line and Polygon clipping algorithms,
2D transformation functions, 3D transformation functions, Transformation of user defined
objects in 2D and 3D, 2D curves, Effects of lighting in OpenGL, Programs for illustration of
graphical principles using OpenGL, Creating animation programs

References:
1. D. Hearn, M. Baker, “Computer Graphics with OpenGL”, Pearson Education, 3rd Edition,
2010.
2. E. Angel, “Interactive Computer Graphics- A top down approach using OpenGL”, Pearson
Education, 5th Edition, 2003.

CS1532 SOFTWARE ENGINEERING LAB [0 1 2 2]

Introduction to Unified Modeling Language (UML), Use case diagrams, Class diagram, Object
diagram, Activity diagram, sequence diagram, component diagram, deployment diagram, stat
chart diagram.

References:
Wendy Boggs and Michael Boggs. 1999. Mastering Uml with Rational Rose with Cdrom.
SYBEX Inc., Alameda, CA, USA.
CS1601 LANGUAGE PROCESSORS [3 1 0 4]

Introduction: Structure of a Compiler; The Role of the Lexical Analyzer, Input Buffering,
Specification of Tokens, Recognition of Tokens, The Lexical-Analyzer Generator Lex, Finite
Automata, From Regular Expression to Automata, Design of a Lexical-Analyzer Generator;
Context-Free Grammars, Writing a Grammar, Top-Down Parsing, Bottom-Up Parsing,
Introduction to LR Parsing: Simple LR, More Powerful LR Parsers, Using Ambiguous
Grammars, Parser Generators. Syntax-Directed Definition, Construction of Syntax Trees;
Variants of Syntax Trees, Three-Address Code, Types and Declarations: Type Expressions, Type
Equivalence; Translation of Expressions: Operations within Expressions, Type Checking:
Rules for Type Checking, Storage Organization, Stack, Allocation of Space; Issues in the Design
of a Code Generator, Target Language, Addresses in the Target Code, Basic Blocks and Flow
Graphs, Elements of Assembly Language Programming, A Simple Assembly Scheme, Pass
Structure of Assemblers, Design of Two Pass Assemblers

References:

1. K. C. Louden, “Compiler Construction - Principles and Practice”, Thomson, India

Edition, 2007.
2. D. M. Dhamdhere, “Systems Programming and Operating Systems”, Tata McGraw Hill,
2nd Revised Edition, 2001.
3. A.V. Aho, M. S. Lam, R. Sethi, J. D. Ullman, “Compilers Principles, Techniques and
Tools”, Pearson Education, 2nd edition, 2000.

CS1602 COMPUTER NETWORKS & PROTOCOLS [3 1 0 4]

Network introduction: Classful addressing, other issues, Subnetting Classless addressing,

variable length blocks, Subnetting, address allocation, Network Address Translation.
Encapsulation, operation Data Link Layer: ARP package & RARP- Introduction, packet
format Encapsulation, RARP server datagram , fragmentation , options, checksum, Network
Layer: IP Package Types of messages, message format, error reporting, Query, Checksum,
Debugging tools; Transport Layer: Process to process communication, User datagram,
checksum, UDP operation UDP package Introduction, TCP services, TCP features, segment,
TCP connection, State transition diagram, Flow control, Error control, Congestion control, TCP
timers, options, TCP package; TCP Variants: SCTP services, SCTP features, packet format,
association, state transition diagram, flow control, error control, congestion control, TCP RENO,
Dynamic routing protocols : RIP,OSCF & BGP; Domain name Space (Application Layer):
Name space, distribution of name space, DNS in the internet, resolution, DNS messages,
controlling the server, out of band signaling, escape character. Transition from IPv4 to IPv6.
Introduction to VLAN concept, Wireless Network protocols: WAP Architecture introduction.
Introduction to MANET & VANET

References:
1. W. R Stevens, “TCP/IP Illustrated, Volume 1: The Protocols”, Addison-Wesley, 1994.
2. P. Loshin, “IPV6 Clearly Explained”, Morgan Kauffman, 1999.
3. C. E. Perkins, “Mobile IP Design Principles and Practices”, Addison-Wesley, 1998.
4. B. A. Forouzan, “TCP/IP Protocol Suite”, TMH, 3rd Edition, 2005.
CS1603 PARALLEL PROCESSING [3 1 0 4]

Introduction: Heterogeneous Parallel Computing, Architecture of a Modern GPU, Parallel

Programming Languages and Models, History of GPU Computing , Introduction to Data
Parallelism, Data parallelism and CUDA C: Data Parallelism ,CUDA Program Structure ,
Device Global Memory and Data Transfer, Kernel Functions and Threading; Data-Parallel
Execution Model: Cuda Thread Organization, Mapping Threads to Multidimensional Data,
Matrix-Matrix Multiplication, Synchronization and Transparent Scalability, Assigning Resources
to Blocks, Thread Scheduling and Latency Tolerance; CUDA Memories: Importance of
Memory Access Efficiency, CUDA Device Memory Types Strategy for Reducing Global
Memory Traffic, Tiled Matrix, Memory as a Limiting Factor to Parallelism, Performance
Considerations; Performance Considerations: Warps and Thread Execution, Global Memory
Bandwidth, Dynamic Partitioning of Execution Resources, Instruction Mix and Thread
Granularity; Parallel Patterns: Convolution -1D/2D, Constant Memory and Caching, Prefix
Sum, Sparse Matrix vector Multiplication; Programming Models: Open ACC, CUDA
FORTRAN, C++AMP, Thrust, and important trends in heterogeneous parallel computing, CASE
Studies.

References:
1. D. Kirk and W. Hwu, “Programming Massively Parallel Processors A Hands on approach”,
2nd edition, Morgan Kaufmann, 2013.
2. Peter S. Pacheco, “An introduction to parallel programming”, Morgan Kaufmann, 2011.
3. Shane Cook, “CUDA Programming: A Developer's Guide to Parallel Computing with
GPUs”, Morgan Kaufmann, 2013
4. Jason Sanders, Edward Kandrot,” CUDA by example: an introduction to general-purpose
GPU programming” NVIDIA corporation, 2011

CS1630 LANGUAGE PROCESSORS LAB [0 1 2 2]

Preliminary Scanning Applications, Design & Implementation of Lexical Analyzer, Design &
Implementation of Parser, Implementation of Code Generator, Programs using LEX, Programs
using YACC.

References:
1. A. V. Aho, M. S. Lam, R. Sethi, J. D. Ullman, Compilers Principles, Techniques and Tools,
Pearson Education, 2nd edition, 2000.
2. D. M. Dhamdhere, Systems Programming and Operating Systems, Tata McGraw Hill, 2nd
Revised Edition, 2001.
3. K. C. Louden, Compiler Construction - Principles and Practice, Thomson India Ed., 2007.

CS1631 COMPUTER NETWORKS & PROTOCOLS LAB [0 1 2 2]

Programs on UNIX/LINUX file API's, Client-Server Programming using TCP and UDP,
Implementation of Data Encapsulation, De-capsulation, fragmentation in TCP/IP, Networking
basics: (IN LINUX OS) Basic Network Configurations: Assigning IP address, Subnet Mask,
gateway address, LAN behind proxy, Connecting to Internet Network Server Configurations: (IN
LINUX OS) Web Server/Telnet/SSH Server, FTP/TFTP Server, DHCP Server, DNS Server,
Database Server (MySQL/PostGreSql), Squid
References:
1. W. R Stevens, TCP/IP Illustrated, Volume 1: The Protocols, Addison-Wesley, 1994.
2. P. Loshin, IPV6 Clearly Explained, Morgan Kauffman, 1999.
3. C. E. Perkins, Mobile IP Design Principles and Practices, Addison-Wesley, 1998.
4. B. A. Forouzan, TCP/IP Protocol Suite, TMH, 3rd Edition, 2005.

CS1632 PARALLEL PROCESSING LAB [0 1 2 2]

Recap of Dynamic Memory Allocation in CPU; Programs on CUDA, Hello, World!, A kernel
Call, Passing Parameters; Vector Additions, Matrix additions using single block without shared
memory and multiple block without shared memory, Matrix transpose Dynamic memory
allocation in GPU; Dynamic Programming in CPU and GPU; Programs on single block shared
memory and multiple block shared memory; Case Study Projects on Parallel processing

References:
1. D. Kirk and W. Hwu, “Programming Massively Parallel Processors A Hands on approach”,
2nd edition, Morgan Kaufmann, 2013.
2. Peter S. Pacheco, “An introduction to parallel programming”, Morgan Kaufmann, 2011.
3. Shane Cook, “CUDA Programming: A Developer's Guide to Parallel Computing with
GPUs”, Morgan Kaufmann, 2013
4. Jason Sanders, Edward Kandrot,” CUDA by example: an introduction to general-purpose
GPU programming” NVIDIA corporation, 2011

MB1721 ESSENTIALS OF MGMT & ENGINEERING ECONOMICS [310 4]

Management: Definition of Management, Nature and scope of management, Functions of

managers, corporate social responsibility, Theories of Planning, Organizing, Staffing, Leading
and Controlling; Engineering Economics: Introduction to Micro and Macro Engineering
Economics, Value, Utility, Consumer & Producer goods, Factors of Production, Law of demand
and supply, Elasticity of demand & supply, Equilibrium of demand and supply; Time value of
Money, Economic Evaluation of Alternatives, Replacement analysis and Depreciation
Text Book:
1. D. Koontz, Essentials of Management, McGraw Hill, New York, 2006.
2. J. L. Riggs, D. D. Bedworth, S.U. Randhawa, “Engineering Economics”, Tata McGraw –
Hill Publishing Company Ltd, New Delhi, 2004.
3. D. G. L. Paul, “Engineering Economy”, Macmillan, New York, 1971.

References:
1. P. Drucker, Management, Task and Responsibility, Allied, 2002.
2. P. Drucker, The practice of management, Butterworth Hein Mann, 2003.
3. G. J. Tuesen & H. G. Tuesen, Engineering Economy, Prentice Hall of India, 2002.
4. L. T. Blank & A. J. Tarquin, Engineering Economy, McGraw Hill, 1989.
CS1701 DATA SCIENCE & BIG DATA ANALYTICS [3 1 0 4]

Introduction to big data, definition, need and evolution of BDA, applications of Big Data, Big
Data Analytics: analyzing big data, sources of big data, characteristics of big data (4 V’s),
Drivers of BDA, types of data, structured vs. unstructured data, data marts, Case study based
tutorial, Differences between traditional DWDM and BDA, Limitations of traditional RDBMSs
to store and analyze Big Data, Data science, definition and concepts, data scientists: key
competencies and characteristics of data scientists, More discussions on data science: data
wrangling, data munging, data jujitsu, Tutorial based on data science applications, Big Data
Analytics Ecosystem, State of the Practice in Analytics: Data Analytics Lifecycle and
discussions, Roles for a Successful Analytics Project; Case Study to apply the data analytics
lifecycle, Analytical databases and DW appliances; Hadoop distributions – Comparing various
BDA tools, Analyzing and Exploring the Data: Challenges when managing and analyzing big
data, The role of Data Virtualization in a Big Data environment; Why to visualize data. Statistics
for Model Building and Evaluation: Statistics in the Analytic Lifecycle, Hypothesis Testing,
Difference of means, Advanced Analytics – Theory and Methods Overview: K-means clustering,
Association Rules, Linear Regression, Logistic Regression, Naïve Bayesian Classifiers , Tutorial
based on advanced analytics, Decision Trees, Time Series Analysis, Text Analytics; Tutorial
based on analytics, Big Data Platforms and Storage Options: The new multi-platform Analytical
Ecosystem; Beyond the Data Warehouse - Analytical databases, Hadoop and NoSQL DBMSs
References:
1. Data Science and Big Data Analytics: Discovering, Analyzing, Visualizing and Presenting
Data, EMC Education Services.
2. Michael Minelli, Michele Chambers, Ambiga Dhiraj, “Big Data, Big Analytics: Emerging
Business Intelligence and Analytic Trends”, john wiley,2013.

CS1702 OBJECT ORIENTED ANALYSIS AND DESIGN [3 1 0 4]

Introduction: Analyst as a Business Problem Solver; software development process: The

Systems Development Life Cycle, Methodologies, Models, Tools and Techniques, The UP
Disciplines, Overview of Object Oriented Concepts, Tools to support System Development
Project Management; Requirement Capture and Analysis: The Requirements Discipline in
More Detail, Systems requirements, Models and Modeling, Techniques for Information
Gathering, Validating the Requirements, The UML Class Diagram, Locations and the CRUD
Matrix, Use Cases, the Domain Model and Iteration Planning Detailed Object oriented
Requirements Definitions, Design Phase: Moving from Business Modeling to Requirements to
Design, Understanding the Elements of Design, Design Discipline Activities, Project
Management, deployment Environment, Software Architecture, Network Design Bridging
between Requirements and Implementation, Design Classes and Design Class Diagrams

References:
1. M. Docherty & A. Bahrami, “Object Oriented Systems Development using the unified
modeling language”, McGraw Hill International Edition, 1999.
2. B. Jackson, “Object Oriented Analysis and Design with Unified Process”, Satzinger Cengage
Learning, 2011.
3. A. Dennis, B. Wixom, D. Tegarden, “System Analysis and Design with UML Version 2.0: An
Object Oriented Approach”, Wiley-India, Second Ed, 2005.
3. A. Dennis, B. Wixom, D. Tegarden, System Analysis and Design with UML Version 2.0: An
Object Oriented Approach, Wiley-India, Second Ed, 2005.

CS1730 DATA SCIENCE & BIG DATA ANALYTICS LAB [0 1 2 2]

Introduction to data environment accessing lab environment, database environment-retail

data, census data; Introduciton to R; Basic Statistics, visualization and hypothesis tests; K-
means clustering; Association rules; Linear regression; logistic regression; naïve Bayesian
classifier building naïve Bayesian classifier, census data; Decision trees; time series analysis
with arima; HADOOP, HDFS, MAPREDUCE and PIG; In-database analytics click stream data,
computation of ordered aggregates, logistic regression with MADLIB; Case study.
References:
1. Data Science and Big Data Analytics: Discovering, Analyzing, Visualizing and Presenting
Data, EMC Education Services.
2. Michael Minelli, Michele Chambers, Ambiga Dhiraj, “Big Data, Big Analytics: Emerging
Business Intelligence and Analytic Trends”, john wiley,2013

CS1731 OBJECT ORIENTED ANALYSIS & DESIGN LAB [0 1 2 2]

Object Oriented Programs on Inheritance, Problem Statement and Requirements Elicitation,

Class Diagram, Use case Diagram, Sequence Diagram, Collaboration Diagram, Activity
Diagram, Component and Deployment Diagrams, Generate and implement the Code,
Demonstration of the Project.

References:
1. M. Docherty, A. Bahrami, “Object Oriented Systems Development using the unified modeling
language”, McGraw Hill International Edition, 1999.
2. B. Jackson, “Object Oriented Analysis and Design with Unified Process”, Satzinger Cengage
Learning, 2011.
3. A. Dennis, B. Wixom, D. Tegarden, “System Analysis and Design with UML Version 2.0: An
Object Oriented Approach”, Wiley-India, Second Edition, 2005.

CS1779 SEMINAR [0 0 - 1]

Each student has to present a seminar individually, on any technical topic related to the subject,
but not covered in the syllabus. The time duration for presentation is 20 minutes and 10 minutes
is devoted for question and answer session. Slides have to be prepared for the presentation. A
seminar report has to be submitted a week before the day of the presentation.

Reference: IEEE transactions, Technical journals, Proceedings of National and International

Conferences, Web sites.

CS1881 PROJECT WORK / PRACTICE SCHOOL [0 0 - 20]

The project work may be carried out in the institution/ industry/ research laboratory or any other
competent institutions. The duration of the project work shall be a minimum of 16 weeks, which
may be extended up to 24 weeks. A mid-semester evaluation of the project work shall be done
after about 8 weeks. An interim project report on the progress of the work shall be submitted to
the department by the student, before the mid-semester evaluation. The final evaluation and viva-
voice will be conducted after submission of the final project report in the prescribed form. As
part of project evaluation, the student has to make a presentation on the work carried out, before
the departmental committee

CS1650 Digital Image Processing [3 0 0 3]

Introduction: Digital Image Processing: Digital Image Representation, Digital Image

Processing Problems and Applications, Elements of Visual Perception, Sampling and
Quantization, Relationship between pixels; Image transforms: Fourier Transform and Fast
Fourier Transform, Other Image transforms and their properties: Cosine transform, Sine
transform, Hadamard Transform, Haar Transform; Image Enhancement and Restoration:
Point operations, Contrast stretching, Clipping and thresholding, Digital Negative, Intensity
Level Slicing; Histogram modeling: Equalization, Modification and Specification; Spatial
Operations: Averaging, Directional smoothing, Median, Filtering, Magnification by replication
and Interpolation; Image Coding and Compression: Pixel coding, run length, bit plane coding,
Huffman coding; Predictive and Inter-frame coding; Pattern Recognition basic concepts:
Pattern Recognition Systems, Fundamental Problems in pattern recognition system design;
Design concepts and Methodologies: Character recognition, Speech recognition, Finger-print
Recognition; Pattern recognition in Images and Classification: Feature Extraction, Models,
Division of Sample Space; Grey level features edges and lines: Similarity and correlation,
Template matching, Edge detection using templates, Edge detection using gradient models,
model fitting, Line detection; Segmentation: Segmentation by thresholding, Regions based
segmentation, edges, line and curve detection; Advanced topics: Neural networks and their
applications to pattern recognition, Hopfield Nets, Hamming Nets, Perceptron

Text Books:
1. R.C. Gonzalez and P Wintz, “Digital Image Processing”, Second Edition, Addison-
Wesley Publishing, 2009.
2. K Castlemann, “Digital Image Processing”, Prentice Hall of India Ltd, 2007.
3. J.T.TOU, R.C. Gonzalez, “Pattern Recognition Principles”, Addison-Wesley Publishing,
1979.
4. Sing Tze Bow, M Dekker, “Pattern Recognition Principles and Image Processing”,
Signal Processing and Communication Series, 2002.
Reference Books:
1. A.K Jain, “Fundamentals of Digital Image Processing”, Prentice Hall of India Pvt Ltd,
1989.
2. M James, “Pattern Recognition”, BSP Professional Books, 1988.
3. P. Moniqque, “Fundamentals of Pattern Recognition”, Marcel Dekker Inc, 1993.

CS1651 Information Retrieval [3 0 0 3]

Introduction to information retrieval: Mathematical basics, Vector spaces and similarity,

Probabilities and Statistics, Text Analysis; Preprocessing: Document processing, stemming,
String matching, Basic NLP tasks – POS tagging shallow parsing; Overview of text retrieval
systems: System architecture, Boolean models, Inverted Indexes, Document ranking, IR
Evaluation; Retrieval models and implementation: Vector Space Models, Vector space
models, TF-IDF weighting, Retrieval axioms, Implementation issues, Probabilistic models,
statistical language models: Okapi/BM25, Language models, KL-divergence, Smoothing,
Query expansion and feedback: Query reformulation, Relevance feedback, Pseudo-relevance
feedback, Language model based, feedback; Web Search Engines: Models of the Web, Web
crawling; Static ranking: PageRank HITS, Query log analysis, Adversarial IR, Information
filtering: Adaptive filtering, Collaborative filtering, User Interfaces, Text classification, Naïve
Bayes; k-nearest neighbors, Feature selection, Semi-supervised Learning; Text clustering:
Vector-space clustering; K-means, EM algorithm, Text shingling; Graph-based methods:
WordNet, Document and word graphs, Network analysis, Random Walks, Harmonic Functions;
Latent Semantic Analysis: Topic Modeling, Latent semantic indexing, Singular value
decomposition, Probabilistic Latent Semantic Indexing, Latent Dirichlet Allocation; IR
applications: Information extraction, Question answering, Opinion summarization,
Computational advertising.

Text Books:

1. Christopher D. Manning, Prabhakar Raghavan and Hinrich Schütze. “Introduction to

Information Retrieval”, Cambridge University Press. 2008.
2. ChengXiang Zhai, Morgan , “Statistical Language Models for Information Retrieval”,
Claypool Publishers, 2008.

CS1652 Distributed Systems [3 0 0 3]

introduction: Definition of a Distributed System, Goals, Hardware Concepts, Software

Concepts, Client-Server Model; inter-process communication: External Data Representation,
Client-server communication, Group Communication, Case Study—Inter process
communication in UNIX; distributed object and remote invocation: Introduction,
Communication between Distributed Object, Remote Procedure call, Event and notifications,
Java RMI case study; processes: Threads, Client , Servers, Code Migration, Software Agents;
distributed file system: Introduction, File Service architecture, Sun Network File; name
services: Introduction, Name services and DNS, Directory and Discovery services, Case Study
of Global name service, Case Study of X.500 directory service; synchronization: Clock
Synchronization, Logical clocks, Global State, Election Algorithm, Mutual Exclusion,
Distributed system; consistency and replication: Introduction, Data-centric Consistency
Models, Client-Centric Consistency Models, Distribution Protocol, Consistency Protocols; fault
tolerance: Introduction to fault tolerance, Process Resilience, Reliable Client-Server
Communication, Reliable Group communication, Distributed Commit, Recovery; security:
Introduction to security, Secure Channels, Access control

Text books :

1. Coulouris George, Dollimore Jean, Kindberg Tim: “Distributed Systems, Concepts and
Design”: Pearson Education Asia (LPE) 3rd edition 2001.
2. Andrew S Tannenbaum, Maarteen Van Steen: “ Distributed Systems, Principles and
Paradigms”: Pearson Education Asia: (LPE) 1st Indian Reprint 2002

References:
 1. Ajay D. Kshemkalyani, Mukesk Singhal, “Distributed Computing : Principles,
Algorithms, and Systems”, Cambridge University Press/ Foundation Books India , New
Delhi, 2008.
2. Mei- Ling Liu, “ Distributed Computing: Principles and Application”, Pearson
Education, Inc. New Delhi. 2004,

CS 1653 Cloud Computing & Cloud Infrastructure Services [3 0 0 3]

Introduction: Clouds and Cloud Computing: Basic Concepts, Cloud Classifications, and Types
of Services, deployment models; Classic Data Center (CDC): DBMS concepts, CDC
drawbacks and need of Cloud Resources, CDC Management and case studies; Virtualized Data
Center (VDC): Compute and Storage, Compute virtualization overview, Compute virtualization
techniques, Virtual Machines, VM Resource management techniques, Physical to virtual
conversion, Hypervisor Management Software, Virtual Infrastructure Requirements; Storage:
Storage virtualization overview, Virtual Machine Storage, Block level and File level
virtualization, Virtual provisioning and automated storage tiering; Networking: VDC
networking overview, VDC networking components , VLAN and VSAN technologies, Network
traffic management, Exercise – VDC networking; Desktop and Application: Desktop
virtualization, Application virtualization, Business Continuity in VDC, Fault tolerance
mechanism in VDC, Backup in VDC, Replication and migration in VDC, Cloud infrastructure
and service creation, Cloud service management; Cloud Security: Security basics, Cloud
security concerns and threats, Cloud security mechanisms, Access control and identity
management in Cloud, Governance, risk, and compliance, Security best practices for Cloud,
Cloud Migration; Issues in Cloud Considerations: Migration Considerations, Security issues at
different phases to adopt the Cloud.
Text Books:
1. Course materials from EMC² Education Services
2. Miller M, “Cloud Computing”, 8th Edition, Que Publishers 2008.
3. Buyya R K, “Cloud Computing: Principles and Paradigms”, Wiley Press, 2011.

Reference Books:
1. K Saurabh, “Cloud Computing”, 2nd Edition, Wiley India
2. V Joysula, M Orr, G Page, “Cloud Computing: Automating the Virtualized Data Center”, Cisco
Press, 2012.

CS1750 Advanced Computer Networks [3 0 0 3]

Computer Network: Definitions, goals, components, structure, Architecture, Classifications &
types, Growth, Complexity and applications etc. Layered Architecture: Protocol hierarchy,
Connection Oriented & Connectionless Services, Service permative Design issues & its
functionality. ISO-OSI Reference Model: Principle, Model, Descriptions of various layers and its
comparison with TCP/IP. Network standardization. Examples of Networks: Telecommunication
Network, Corporate Networks, Connection oriented network i.e., X.25, Frame relay & ATM,
Wireless LAN 802.11, internet, Intranet, Extranet, SNA & DNA etc.Data Link Layer: Need,
Services Provided, Framing & its methods, Flow Control, Error control. DLL Protocol:
Elementary & Sliding Window. Piggybacking & Pipelining. Protocol verification: Finite State
Machine Models & Petri net models. Example in Data Link Layers: HDLC & Internet.
Comparison of BISYNC and HDLC Features. Bridges and layer-2 switches. MAC Sub layer:
Static & Dynamic channel allocation, Media access control for LAN & WAN. Classification of
MAC Sub layer protocol, Study of various collision, Collision free & limited contention protocol
i.e., ALOHA : pure, slotted , CSMA, CSMA/CD,CSMA/CA, Bit Map, Binary count down,
BRAP, MLMA, Adaptive tree walk & urn protocol etc. IEEE 802 standards for LAN & MAN &
their comparison. Ethernet: Cabling, Binary exponentials algorithms, performance fast Ethernet,
Gigabit Ethernet, FDDI. Wireless LANs, Broadband Wireless, Bluetooth: Architecture,
Application & Layering. Network Layer: Need, Services Provided , Design issues, Routing
algorithms: Least Cost Routing algorithm, Dijkstra's algorithm, Bellman-ford algorithm,
Hierarchical Routing, Broadcast Routing, Multicast Routing, Routing for mobile hosts, Routing
in Ad Hoc Networks Routing Strategies, Congestion Control Algorithms: General Principles of
Congestion control, Prevention Policies, Congestion Control in Virtual-Circuit Subnets,
Congestion Control in Datagram subnets. IP protocol, IP Addresses, Comparative study of IPv4
& IPv6, Mobile IP. Processes to Processes Delivery Transmission Control Protocol (TCP) –
User Datagram Protocol, Data Traffic, Congestion Control and Quality of Service, Techniques to
improve QOS, Integrated Services, and Differentiated Services. Network Security:
Cryptography, Message Security, Digital Signature, User Authentication, Key Management,
Security Protocols in Internet ,DNS,SMTP, FTP, HTTP, WWW, Virtual Terminal Protocol,
VoIP: Basic IP Telephone System,H.323 Characteristic & Layering, SIP Characteristics, Method
& Sessions.

Reference Books:
1. Tanenbaum A. S ,”Computer Networks”, Pearson Education.
2. Stalling W, “Computer Networks”, Pearson Education
3. Douglas E. Comer & M.S Narayanan,”Computer Network & Internet”, Pearson Education
4. Behraj A Forouzan,”Data Communication & Networking”, McGraw-Hill.
5. Natalia Olifar & Victor Olifer,”Computer Networks”, Willey Pub.
6. Prakash C. Gupta, “Data Comunications and Computer Networks”, PHI
7. Bertsekas & Gallager “Data Network” , PHI
8 Gallo,”Computer Communication & Networking Technologies”,Cengage Learning

CS1751 Mobile Computing [3 0 0 3]

Overview of Mobile Communication: Introduction, Signals, Antennas, Multiplexing
techniques, Cellular concepts. Personal Communication Service: PCS, AMPS, Cordless
telephony and Low tier PCS, Mobility management, Handoff detection and assignment,
Roaming and roaming management under SS7, ANSI-41, SS7 and wireless, PCS network
elements, ISDN Interworking, CDPD. Mobile IP: Overview, Agent solicitation and discovery
mechanisms, mobility agent operation, Mobile node registration procedures, Security, Tunneling,
Encapsulation, Unicast and multicast, Routing failures and recovery, Tunnel management, Route
optimization, IPv6’s mobility management support, Problems associated with TCP, Wireless
TCP, Performance over TCP GSM: GSM overview, GSM network architecture, GSM SMS,
International Roaming, GSM OAM, Mobile prepaid service, Mobile number portability
Wireless LAN: WLAN technologies and application,Topologies, IEEE 802.11 standard,
Bluetooth, HiperLAN 3G Wireless Networks: CDMA2000, WCDMA/UMTS-design and
principle, Network architecture and protocol, 3G network design methodologies, Air interface
Mobile Computing Models: Client server models, Location management for mobile networks,
Wireless location services, Application design for wireless computing, Storage alternatives,
Disconnected operation in mobile computing, Strategies for query processing, Handheld
computers and their OS, Case study-CODA Ad-hoc Network: Mobile Ad-hoc networks,
Routing protocols, Wireless sensor networks
References:
1. Yi-Bing, Imrich Chlamtac, “Wireless and Mobile Networks Architectures”, John Wiley,
Kundali, India, 2001
 2. William Stallings, “Mobile Communication & Networking”, Pearson Education, Delhi,
2005
3. T.S Rappaport, ”Wireless Communication-Principles and Practices”, Pearson Education,
Delhi, 2005
4. Deitel.H, Deitel.P, Nieto T & Steinbuhler.K, “Wireless Internet & Mobile Business”,
Prentice Hall, 2001

CS1752 Cryptography And Network Security [3 0 0 3]

Introduction: Computer Security Concepts, The OSI Security Architecture, Security Attacks,
Security Services, Security Mechanisms, A Model for Network Security Symmetric Cipher
Model, Substitution Techniques, Transposition Techniques, Block Ciphers; Data Encryption
Standard: Block Cipher Principles, The Data Encryption Standard (DES), A DES Example, The
Strength of DES The Origins AES, AES Structure, AES Round Functions, AES Key Expansion,
AES Example; Block Cipher Operation: Multiple Encryption and Triple DES, Electronic
Codebook Mode, Cipher Block Chaining Mode, Cipher Feedback Mode, Output Feedback
Mode, Counter Mode; Pseudorandom Number Generation: principes, Pseudorandom Number
Generators, Pseudorandom Number Generation Using a Block Cipher, Stream Ciphers; Public-
Key Cryptography and RSA: Principles of Public-Key Cryptosystems, The RSA Algorithm,
Diffie-Hellman Key Exchange Applications of Cryptographic Hash Functions, Authentication
Requirement, Message Authentication Function, Message Authentication Codes, Digital
Signatures; Transport-Level Security: Web Security Issues, Secure Sockets Layer (SSL),
Transport Layer Security (TLS), Electronic Mail Security, Pretty Good Privacy (PGP), IP
Security: IP Security Overview, IP Security Policy, Encapsulating Security Payload, Combining
Security Associations, Internet Key Exchange

References:
1. B. A. Forouzan, D. Mukhopadhyay, “Cryptography and Network Security”, Mc-Graw Hill,
2nd Edition, 2008.
2. W. Stallings, “Cryptography and Network Security: Principles and Practice”, Prentice Hall,
5th edition, 2010.

CS1753 Artificial Intelligence [3 0 0 3]

Introduction: Intelligent Systems, Foundations and Applications of AI, Current trends in AI;
Problems: Characteristics of Problems, Problem reduction, Game playing, Bounded look-ahead
strategy and use of evaluation functions, Alpha-Beta Pruning, Two – Player perfect information
games, Propositional Logic: Natural deduction system, Resolution Refutation in PL, Predicate
Logic approaches to knowledge representation, Knowledge representation: using Semantic
Network, Extended semantic Networks for KR, Knowledge Representation using Frames,
Probability Theory: Bayesian Belief Networks, Certainty Factor Theory; Agents vs. software
programs: Classification of Agents, Working of an Agent, Single Agent and Multi-Agent
systems, Performance evaluation of Agents, Architectures for Intelligent Agents, Fuzzy sets:
Fuzzy set operations, Types membership functions, Multi-valued logic and Fuzzy Logic,
Machine-Learning Systems, Supervised and Unsupervised learning, Inductive learning,
Deductive learning, Support Vector Machine, ANN, Single layer feed-forward networks, Multi-
layer feed-forward NN.

References:
1. S. Kaushik, “Artificial Intelligence, Cengage Learning Publications”, First Edition, 2011.
2. E. Rich, K. Knight, “Artificial Intelligence”, Tata McGraw Hill Edition, 1991.
3. N. J. Nilsson, “Principles of Artificial Intelligence”, Springer Verlag, 1982.

Open Elective – I
CS1690 PRINCIPLES OF PROGRAMMING LANGUAGES
[3 0 0 3]

INTRODUCTION:What is a Programming Language, Abstractions in Programming Languages,

Computational Paradigms, Language Definition, Language Translation; LANGUAGE DESIGN
PRINCIPLES: History and design criteria, Efficiency, Regularity, Further Language design
principles; SYNTAX : Lexical Structure of programming Languages, Context Free grammars
and BNFs, Parse Trees and Abstract Syntax Trees, Ambiguity, Associativity and Precedence,
EBNFs and Syntax Diagrams; BASIC SEMANTICS:
Attributes bindings and semantic functions, Declarations, Blocks, and Scope, The Symbol Table,
Name resolution and Overloading, Allocation, Lifetimes, and the Environment, Variables and
Constants, Aliases, Dangling references and Garbage; DATA TYPES: Data Types and Type
Information, Simple types, Type Constructors; EXPRESSIONS AND STATEMENTS:
Expressions, Conditional Statements and Guards, Loops and Variation on WHILE, The GOTO
controversy, Exception Handling; OBJECT ORIENTED PROGRAMMING : Software reuse and
Independence, Java : objects, classes and methods, Inheritance, Dynamic Binding;
FUNCTIONAL PROGRAMMING: Programs as functions, Functional Programming in an
Imperative language, Scheme : A dialect of Lisp; LOGIC PROGRAMMING: Logic and logic
Programs, Horn clauses, Resolution and Unification
Text Book:
1. Kenneth C. Louden “Programming Languages Principles and Practice” Thomson
Brooks/Cole Publication, second edition.

References:
1. Terrence W. Pratt, Masvin V. Zelkowitz “Programming Languages design and
Implementation” , Pearson Education, Fourth Edition .
2. Allen Tucker, Robert Noonan “Programming Languages Principles and Paradigms Tata
MC Graw –Hill Publication, First edition.
 Open Elective – I
CS1691 PROGRAMMING IN C++
[3 0 0 3]

INTRODUCTION TO C++: Object-Oriented Programming Systems, Comparison of C++ with

C, Reference Variables in C++, Function Prototyping, Function Overloading, Default Values for
Formal Arguments of Functions, Inline Functions. Object oriented concepts & its applications;
CLASSES AND OBJECTS: Introduction to Classes and Objects ; CLASSES AND OBJECTS
CONTD: Member Functions and Member Data, Objects and Functions, Objects and Arrays,
Namespaces, Nested classes; DYNAMIC MEMORY MANAGEMENT: Introduction, Dynamic
Memory Allocation, Dynamic Memory De allocation; CONSTRUCTORS AND
DESTRUCTORS:Constructors, zero argument constructor, parameterized constructor,
copy constructor, Destructors; INHERITANCE: Introduction to Inheritance, Base Class and
Derived Class Pointers, Function Overriding, Base Class Initialization, The Protected Access
Specifier, Deriving by Different Access Specifiers, Different Kinds of Inheritance, Order of
Invocation of Constructors and Destructors. VIRTUAL FUNCTIONS AND DYNAMIC
POLYMORPHISM: The Need for Virtual Functions, Virtual Functions, The mechanism of
virtual functions, Pure virtual functions, Virtual destructors and Virtual constructors; STREAM
HANDLING: Streams, The class hierarchy of handling streams, Text and Binary Input/Output,
Text Versus Binary Files, Text Input/Output, Binary Input/Output. Opening and Closing Files,
Files as Objects of the fstream class, File Pointer, Random Access to Files, Object Input/Output
through Member functions, Error Handling, Manipulators; OPERATOR OVERLOADING:
Operator Overloading, Overloading the various operators- Overloading the Increment and the
Decrement Operators (Prefix and Postfix), Overloading the Unary Minus and the Unary Plus
Operator, Overloading the Arithmetic Operators.Overloading the Relational Operators,
Overloading the Assignment Operator, Overloading the Insertion and Extraction Operators,
Overloading the subscript operator. EXCEPTION HANDLING: Introduction, C-Style handling
of error generating codes, C++ Style solution – the try/throw/catch construct, Limitation of
exception handling.
Text Books:
1. Sourav Sahay, “Object-Oriented Programming with C++”, Oxford University Press,
2008.
2. Object Oriented programming with C++, Balagurusamy , 3rd Edition, 2006.

References:
1. Stanley B. Lippman, Josee Lajoie, Barbara E. Moo, “C++ Primer”, Addison Wesley, 4th
Edition, 2005.
2. Herbert Schildt, “The Complete Reference C++”, TMH., 4th Edition, 2005.
 Open Elective – I
CS1692 PROGRAMMING IN JAVA
[3 0 0 3]

OVERVIEW OF JAVA:Object Oriented Programming Byte Code Concept, Java Buzzwords, A

First Simple Program, Data Types, Variables And Arrays, primitive wrapper classes, Operators,
Control Statements, Classes And Methods, Inheritance ; PACKAGES AND INTERFACE :
Packages, Access Protection, Importing Packages;EXCEPTION HANDLING: Exception
Handling Fundamentals, Exception Types, Using Try And Catch, Multiple Catch
Clauses, Nested Try Statements, Throw, Throws, Finally Creating Own Exception Subclass;
MULTITHREADED PROGRAMMING: The Java Thread Model, Creating Thread, Creating
Multiple Threads, Synchronization, Interthread Communication; INPUT/OUTPUT: The Java
I/O Classes And Interface, File, Standard Streams – System.In, System.Out, System.Err - Their
Purpose And Usage, The Byte Streams - Input Stream, Output Stream, File Input Stream, File
Output Stream, Print Stream, The Character Streams – Reader, Writer, File Reader, File Writer,
Buffered Reader, Buffered Writer, Printwriter, Serialization – Use Of Object Input Stream And
Object Output Stream; THE APPLET CLASS: Applet Fundamentals, Applet Basics, Applet
Architecture, An Applet Skeleton, Simple Applet Display Methods, Requesting Repainting,
Passing Parameters To Applets; EVENT HANDLING: Two Event Handling Mechanisms, The
Event Delegation Modes, Event Classes (ActionEvent, AdjustmentEvent, MouseEvent,
WindowEvent, KeyEvent, TextEvent) Sources Of Events, Event Listener
Interface(ActionListener,AdjustmentListener,MouseListener,MouseMotionListener, Keylisten,
WindowListener,TextListener), Adapter Classes, Inner Classes; INTRODUCTION TO AWT:
Working With Windows , Controls , Layout Managers Awt Classes, Window Fundamentals,
Working With Frame Windows, Creating a Frame window From Applet, Controls,
Labels, Using Buttons, Understanding Layout Managers, Menu Bars And Menus, Dialog
Boxes, File Dialog; DATA BASES: Data Bases Introduced, Jdbc: The Java Database
Connectivity, Jdbc Explored.
Text Books:
1. Java 7 The Complete Reference, 7th Edition Herbert Schildt.

References:
1. Steven Holzner, “Java 2 Programming Black Book”, DreamTech, New Delhi,
reprint: 2005.
2.Pratik Patel & KarlMoss , ”Java database programming with JDBC” DreamTech,
New Delhi, second edition, 2000.
 Open Elective – I
CS1693 LINUX BASICS AND PROGRAMMING
[3 0 0 3]
INTRODUCTION:What is Unix? What is Linux? Distributions, The GNU Project and the Free
Software Foundation Programming Linux, Unix Programs, The C/C++ Compiler. Development
System Roadmap, Unix Philosophy; The Unix Operating System: A brief Session in
Unix/Linux,T he Unix Architecture and Command Usage. The Unix Architecture, Features of
Unix, POSIX and Single Unix Specification, Locating commands, Internal and External
Commands, Command Structure, Flexibility of command usage and Browsing the manual pages
on-line and understanding it; GENERAL PURPOSE UTILITIES AND THE FILE SYSTEM:
cal,date,echo,printf,bc,script. E.Mail basics, mailx: The Universal Mailer,passwd:Changing your
password, Password Framing Rules and Discipline. who,uname,tty,sty; THE FILE: What's in a
file name?,Tthe parent-child relationship, the home directory, pwd,cd,mkdir,rmdir,absolute path
names, using absolute pathname for a command, relative pathnames,ls:Listing directory contents,
ls Options, The Unix/Linux File System.; ANDLING UNIX/LINUX FILES:
cat,cp,rm,mv,more,lp,file,wc,od,split,cmp,comm,dif,dos2unix,unix2dos,compressing,archiving,
extracting with gzip/gunzip,zip/unzip,tar, bzip2/bunzip2 File attributes,ls –l :Listing File
Attributes,the –d option: listing directory attributes, file Ownership,file permissions, chmod:
Changing File Permissions,Directory Permissions,Changing File Ownership File Systems and
Inodes,Hard Links, Symbolic Links,umask:Default file and Directory Permissions,Modifications
and access times,find:Locating Files; SHELL AND PROGRAMMING: The Shells interpretive
Cycle,Shell Offerings,Pattern Matching -The Wild Cards,Escaping andQuoting,Redirection:
The Three standard files, /dev/null and /dev/tty: Two special Files,Pipes,Creating aTee,
Command Substitution,Shell Variables; THE SHELL AS A PROGRAMMING LANGUAGE:
Shell Syntax: Variables, Conditions, Control Structures,Functions,Commands,Command
Execution, Here Documents,Debugging Scripts; FILTERS: pr,head,tail,cut,paste,sort,uniq,nl,
tr grep,Basic Regular Expressions(BRE),Extended Regular Expressions(ERE) and egrep,
sed:The StreamEditor; THE PROCESS: sh process, parents and children, ps, system process,
mechanism of Process creation,Running jobs in background, kill, nice, at and batch and cron.
ESSENTIAL SYSTEM ADMINISTRATION: Linux Installation-Single and Dual boot, Disk
partition basics,Connecting to LAN,Connecting to Internet,Setting up IP address-static and
dynamic,assigning hostname.
The System Administrators Login and Privileges,Maintaining Security,User
Management,Startup and Shutdown,Managing Diskspace,Device files,Handling floppy/USB
drives,backup/Restore with cpio

Text Books:
1. Neil Matthew and Richard Stones “Beginning Linux Programming” Wrox
Publication.
2. Sumitabha Das “UNIX Concepts and Applications” TMH Publications New-Delhi.
References:

1. Behrouz A Forouzan and Richard F Gilbery “UNIX and Shell Programming”,

CENGAGE Learning India Edition New Delhi
 OPEN ELECTIVE-II
CS1694 WEB 2.0 and RICH INTERNET APPLICATIONS(3 0 0 3)
INTRODUCTION, WEB SERVICES: What is Web 2.0?, Folksonomies and Web 2.0, Software
as a Service (SaaS), Data and Web 2.0, Convergence, Iterative development, Rich User
experience, Multiple Delivery Channels, Social Networking. Web Services: SOAP, RPC Style
SOAP, Document style SOAP, WSDL, REST services, JSON format, What is JSON?, Array
literals, Object literals, Mixing literals, JSON Syntax, JSON Encoding and Decoding, JSON
versus XML; BUILDING RICH INTERNET APPLICATIONS WITH AJAX-1: Building Rich
Internet Applications with AJAX: Limitations of Classic Web application model, AJAX
principles, Technologies behind AJAX, Examples of usage of AJAX, Dynamic web applications
through Hidden frames for both GET and POST methods; BUILDING RICH INTERNET
APPLICATIONS WITH AJAX-2: Frames, Asynchronous communication and AJAX
application model, XMLHTTP Object – properties and methods, handling different browser
implementations of XMLHTTP, The same origin policy, Cache control, AJAX Patterns (Only
algorithms – examples not required): Predictive fetch pattern, Submission throttling pattern,
Periodic refresh, Multi stage download, Fall back patterns; BUILDING RICH INTERNET
APPLICATIONS WITH FLEX - 1: Flash player, Flex framework, MXML and Actionscript,
Working with Data services, Understanding differences between HTML and Flex applications,
Understanding how Flex applications work, Understanding Flex and Flash authoring, MXML
language, a simple example; BUILDING RICH INTERNET APPLICATIONS WITH FLEX -
2:Using Actionscript, MXML and Actionscript correlations. Understanding Actionscript 3.0
language syntax: Language overview, Objects and Classes, Packages and namespaces, Variables
& scope of variables, case sensitivity and general syntax rules, Operators, Conditional, Looping,
Functions, Nested functions, Functions as Objects, Function scope, OO Programming in
Actionscript: Classes, Interfaces, Inheritance, Working with String objects, Working with
Arrays, Error handling in Actionscript: Try/Catch, Working with XML; BUILDING RICH
INTERNET APPLICATIONS WITH FLEX - 3: Framework fundamentals, Understanding
application life cycle, Differentiating between Flash player and Framework, Bootstrapping Flex
applications, Loading one flex application in to another, Understanding application domains,
Understanding the preloader. Managing layout, Flex layout overview, Working with children,
Container types, Layout rules, Padding, Borders and gaps, Nesting containers, Making fluid
interfaces. BUILDING RICH INTERNET APPLICATIONS WITH FLEX – 4: Working with UI
components: Understanding UI Components, Creating component instances, Common UI
Component properties, Handling events, Button, Value selectors, Text components, List based
controls, Data models and Model View Controller, Creating collection objects, Setting the data
provider, Using Data grids, Using Tree controls, Working with selected values and items, Pop up
controls, Navigators, Control bars Working with data: Using data models, Using XML, Using
Actionscript classes, Data Binding; BUILDING ADVANCED WEB 2.0 APPLICATIONS:
Definition of mash up applications, Mash up Techniques, Building a simple mash up application
with AJAX, Remote data communication, strategies for data communication, Simple
HTTPServices, URLLoader in Flex, Web Services in Flex, Examples: Building an RSS reader
with AJAX, Building an RSS reader with Flex.
Text Books:
1. Nicholas C Zakas et al - Professional AJAX, Wrox publications, 2006.
2. Chafic Kazoun - Programming Flex 2, O’Reilly publications, 2007.
3. Francis Shanahan – Mashups, Wrox, 2007.

References:
1. Thomas A. Powel - Ajax: The Complete Reference , McGraw Hill, 2008.
2. Gottfried Vossen, Stephan Hagemann - Unleashing Web 2.0: From Concepts to
Creativity, Elsevier, 2007.
3. Colin Moock - Essential Actionscript 3.0, O’Reilly Publications, 2007.
4. Steven Holzner - Ajax Bible, Wiley India, 2007.
5. Justin Gehtland et al - A Web 2.0 Primer Pragmatic Ajax, SPD Publications, 2006.
6. Eric Van derVlist et al - Professional Web 2.0 Programming , Wiley India, 2007.
 OPEN ELECTIVE-II
CS1695 INFORMATION RETRIEVAL
[3 0 0 3]
INTRODUCTION, RETRIEVAL STRATEGIES :Introduction; Retrieval Strategies: Vector
Space Model; Probabilistic Retrieval strategies Some More Retrieval Strategies: Language
Models; Inference Networks; Extended Boolean Retrieval; Latent Semantic Indexing; Neural
Networks; Genetic Algorithms; Fuzzy Set Retrieval. RETRIEVAL UTILITIES: Relevance
feedback; Clustering; Passage-Based Retrieval; N-Grams; Regression Analysis; Thesauri;
Semantic Networks; Parsing; INDEXING AND SEARCHING:Introduction; Inverted Files;
Other indices for text; Boolean queries; Sequential searching; Pattern matching; Structural
queries; Compression; CROSS-LANGUAGE INFORMATION RETRIEVAL AND
EFFICIENCY: Introduction; Crossing the language barrier; Cross-Language retrieval strategies;
Cross language utilities. Duplicate Document Detection.; INTEGRATING STRUCTURED
DATA AND TEXT: Review of the relational model; A historical progression; Information
retrieval as a relational application; Semi-structured search using a relational schema; Multi-
dimensional data model; PARALLEL INFORMATION RETRIEVAL, DISTRIBUTED
INFORMATION RETRIEVAL: Parallel text scanning; Parallel indexing; Clustering and
classification; Large parallel systems; A theoretic model of distributed information retrieval;
Web search; Result fusion; Peer-to-Peer information systems; Other architectures;
MULTIMEDIA IR: Introduction; data modeling; Query languages; Spatial access methods; A
general multimedia indexing approach; One-dimensional time series; Two-dimensional color
images; Automatic picture extraction.
Text Books:
1.David A. Grossman, Ophir Frieder: Information Retrieval Algorithms and Heuristics,
Springer, 2nd Edition, 2004.
2. Ricardo Baeza-Yates, Berthier Ribeiro-Neto: Modern Information Retrieval, Pearson
Education, 1999.
References:
1. William B. Frakes, Ricardo Baeza-Yates (Editors):Information Retrieval Data
Structures & Algorithms, Prentice Hall PTR, 1992.
 OPEN ELECTIVE-II

CS1696 DATABASE MANAGEMENT SYSTEMS

[3 0 0 3]

INTRODUCTION : Database-System Applications, Purpose of Database Systems, View of

Data, Database Languages, Relational Databases, Data Storage and Querying, Transaction
Management, Database Architecture, Database Users and Administrators; RELATIONAL
MODEL: Structure of Relational Databases, Fundamental Relational-Algebra
Operations, Additional Relational-Algebra Operations, Extended Relational-Algebra Operations,
Null Values, Modification of the Database; DATABASE DESIGN AND THE E-R MODEL:
Overview of the Design Process, The Entity-Relationship Model, Constraints, Entity-
Relationship Diagrams, Entity-Relationship Design Issues, Weak Entity Sets, Extended E-R
Features, Reduction to Relational Schemas, Other Aspects of Database Design ;SQL: Data
Definition, SQL Data Types and Schemas, Integrity Constraints, Basic Structure of SQL
Queries, Set Operations, Aggregate Functions, Null Values, Nested Sub queries, Complex
Queries, Views, Modification of the Database, Joined Relations; RELATIONAL DATABASE
DESIGN: Features of Good Relational Design, Atomic Domains and First Normal Form,
Decomposition Using Functional Dependencies, Functional Dependency Theory, Algorithms for
Functional Dependencies, Decomposition Using Multivalued Dependencies ,More Normal
Form, Database-Design Process ;TRANSACTION MANAGEMENT AND RECOVERY: Lock
Based and timestamp based Protocols, Multiple Granularity, Multiversion Schemes, Deadlock
Handling, Weak Levels of Consistency, Recovery and Atomicity, recovery algorithm, Buffer
Management, Remote Backup Systems.

Text Books:

1. Silberschatz, Korth, Sudarshan, “Database System Concepts”, McGrawHill, 6th

Edition , 2011.

References:

1. Ramez Elmasri and Shamkant Navathe, Durvasula V L N Somayajulu, Shyam K

Gupta, “Fundamentals of Database Systems”, Pearson Education, 2006.
2. Thomas Connolly, Carolyn Begg, “Database Systems – A Practical Approach to
Design, Implementation and Management”, Pearson Education, 3rd Edition, 2002.
3. Raghu ramakrishnan ,”Database Management Systems”, Publisher: McGraw Hill,
Third edition.
 CS1697 PRINCIPLES OF SOFTWARE ENGINEERING

(3 0 0 3)

INTRODUCTION: What is Software Engineering? A Systems Approach, An Engineering

Approach; MODELLING THE PROCESS AND LIFE CYCLE: The meaning of process,
Software process models, Process Improvement model(Capability Maturity Model);
CAPTURING THE REQUIREMENTS: The requirement process, Characteristics of
Requirements, How to express requirements, SRS; DESIGNING THE SYSTEM: Definition of
Design, Issues in Design creation, Characteristics of good design, Design Reviews, Function
oriented software design;CODING AND TESTING: Coding, Code review,Internal
documentation, External documentation, Software faults and failures, Testing Issues, Unit
testing, Integration testing, Test plan; PLANNING AND MANAGING THE PROJECT:
Tracking Progress, Project Personnel, Effort Estimation, Risk Management, The project plan
Text Books:
1. Shari Lawrence Pfleeger, Joanne M. Atlee “Software Engineering Theory and Practice”
4th edition Pearson 2010
2. Rajib Mall “Fundamentals of Software Engineering” 3rd edition PHI learning 2009.

References:
1. Roger S. Pressman “Software Engineering A Practioner’s Approach, McGraw-Hill, 6th
edition, 2005.
2. Ian Sommerville “Software Engineering”, Pearson, 9th edition, 2010
3. Pankaj Jalote “ An integrated approach to Software Engineering” Springer, 3rd edition,
2005.