handbook of cse

7/23/2019 Handbook of CSE

http://slidepdf.com/reader/full/handbook-of-cse 1/24

Department of Computer Science and Engineering

The Department of Computer Science and Engineering was started in 2011 as a founding

Department in the School of Engineering. It is moving towards becoming a Center of

Excellence, with highly motivated faculty, having expertise in state-of-the-art and thrust areasin Computer engineering and technology. We provide in-depth technical knowledge and

opportunities for innovation and research to both students and faculty. The department has

already conducted many Seminars, Workshops and Conferences on varied topics, so as to

expose the faculty and students to the basic technologies in CSE as also the rapid advances

occurring in this field.

Courses Offered

UG B.Tech. in Computer Science & Engineering

PG M.Tech. in Computer Science & Engineering

M.Tech. in Network & Information Security

M.Tech. in Software EngineeringPh.D. Doctoral programme in specialized areas of Computer Science.

Laboratories

• Post Graduate and Research Lab.

• Central Computing Facility

• C/C++/Java Lab.

• DBMS Lab.

ResearchThe faculty of the department is actively involved in research work in the areas of Computer

Networking, Wireless systems, Ad-hoc and wireless sensor Networks, Information Security

and Data Mining. Many research papers have been published in national and international

Journals and Conferences on the basis of the research work.

FIRST YEAR

Course Contents

CS1101 PROBLEM SOLVING USING COMPUTERS [3 1 0 4]

Introduction to Computers: Block diagram of a computer, Hardware, Software-systemsoftware and application software, Number System-binary, decimal, octal, hexadecimal;

Algorithms and Flowcharts: Problem Solving steps, Definition of Algorithm; C++

Fundamentals: The C++ character set, identifiers and keywords, data types, variables,

declarations, statements, C++ program structure; Operators and Expressions: Operator

precedence and associativity, evaluation of expressions; Flow of Control: Statements and

blocks, simple if, if-else, nested if statements, else-if ladder, switch-case statement, looping ;

1-Dimensional and 2-Dimensional Arrays: 1-D arrays-Declaration and Initialization, sorting

and searching techniques, programs on strings; Functions: Modular programming; Unions

and Pointers: Structures-basic operations and programs, advantages of structures over arrays;

Introduction to Object Oriented Programming: Procedure oriented programming versus



object oriented programming, basic concepts of object oriented programming; File

Manipulation: File handling.

References:

1. E. Balaguruswamy, Computing Fundamentals & C Programming, TMH, 2008.2. E. Balaguruswamy, Object Oriented Programming with C++, TMH, 2007.

3. R. Mall, Fundamentals of Software Engineering, PHI, 2nd Edition, 2003.

4. R. LaFore, Object Oriented Programming with Turbo C++, Galgotia Publications, 2002.

CS1130 PROBLEM SOLVING USING COMPUTERS LAB [0 0 3 1]

Familiarization with PC and working with DOS commands; MS Windows basic operations,

working with MS-Word; Working with MS-Excel and PowerPoint.; Simple C++ Programs

(expression oriented operations); Programs using branching constructs; Programs using

looping constructs; Programs on 1D Arrays; Programs on 2D Arrays; Programs on strings;

Programs using user defined functions; Programs on structures and pointers; Programs using

class declarations and operations on objects, file manipulation.

References:

1. E. Balaguruswamy, Computing Fundamentals & C Programming, TMH, 2008.

2. E. Balaguruswamy, Object Oriented Programming with C++, TMH, 2007.



THIRD SEMESTER

FOURTH SEMESTER

Course

Code

Course Name L T P C

MA1302

CS1301

CS1302

CS1303

CS1304

CS1330

CS1331

CS1332

Engineering Mathematics-III

Computer Organization & Architecture

Switching Theory & Logic Design

Data Structures

Object Oriented Programming

Switching Theory & Logic Design Lab.

Data Structures Lab.

Object Oriented Programming Lab

3

3

3

3

3

0

0

0

1

1

1

1

1

1

1

1

0

0

0

0

0

2

2

2

4

4

4

4

4

2

2

2

Total 15 8 6 26

Course Code Course Name L T P C

MA1402

CS1401

CS1402

CS1403

---------CS1430

CS1431

CS1432

Engineering Mathematics IV

Operating System and Linux

Relational Database Management Systems

Microprocessors

Open Elective-IOperating System and Linux Lab.

Relational DBMS Lab.

Microprocessors Lab.

3

3

3

3

30

0

0

1

1

1

1

01

1

1

0

0

0

0

02

2

2

4

4

4

4

32

2

2

15 7 6 25



FIFTH SEMESTER

SIXTH SEMESTER


CS1501

CS1502

CS1503

CS1504

CS1505

CS1530

CS1531

CS1532

Design & Analysis Of Algorithms

Software Engineering

Computer Graphics

Formal Languages And Automata Theory

Computer Networks

Design & Analysis Of Algorithms Lab.

Computer Graphics Lab

Java Programming Lab.

3

3

3

3

3

0

0

0

1

1

1

1

1

1

1

1

0

0

0

0

0

2

2

2

4

4

4

4

4

2

2

2

15 8 6 26


CS1601

CS1602

CS1603

---------

CS16xx

CS16xx

CS1630

CS1631

CS1632

Language Processors

Network Protocols

Parallel Processing Architecture

Open Elective-II

Program Elective – I

Program Elective -II

Language Processors Lab.

Computer Networks Lab.

Parallel Processing Lab.

3

3

3

3

3

3

0

0

0

1

1

1

0

0

0

1

1

1

0

0

0

0

0

0

2

2

2

4

4

4

3

3

3

2

2

2

18 6 6 27



SEVENTH SEMESTER

EIGHTH SEMESTER

CourseCode

Course Name L T P C

CS1880 (*)

CS1881

Industrial Training

Major Project

0

0

0

0

-

-

1

20

TOTAL 0 0 - 21

Note: (*) Evaluation is carried out in 7th

semester and grade is included in 8th

semester

grade sheet.

Open ElectivesCS1690 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


MB1721CS1701

CS1702

CS17xx

CS17xx

CS17xx

CS1730

CS1731

Essential of Management and Engineering EconomicsAdvanced Internet Technology

Object Oriented Analysis & Design

Program Elective III

Program Elective-IV

Program Elective-V

Advanced Internet Technology Lab

Object Oriented Analysis & Design Lab

33

3

3

3

3

0

0

11

1

0

0

0

1

1

00

0

0

0

0

2

2

44

4

3

3

3

2

2

18 5 4 25



PROGRAM ELECTIVES - ICourse Code Course Name

CS1650 Digital Image Processing

CS1651 Information Retreival

PROGRAM ELECTIVES - II

Course Code Course Name

CS1652 Distributed Systems

CS1653 Cloud Computing and Cloud Infrastructure Services

PROGRAM ELECTIVES - III

Course Code Course Name

CS1750 Advanced Computer Networks

CS1751 Moblie Computing

PROGRAM ELECTIVES - IVCourse Code Course Name

CS1752 Cryptography & Network Security

CS1753 Artificial Intelligence

PROGRAM ELECTIVES - VCourse Code Course Name

CS1754 Data Warehouse & Data Mining

CS1755 Embedded System

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

Faculty.



THIRD SEMESTER

MA1302 ENGINEERING MATHEMATICS-III [4 0 0 4]

Boolean Algebra, Lattices and Algebraic Systems, Predicate Calculus, Permutations and

Combinations, Generating function, Principle of inclusion and exclusion, Partitions,

compositions, Lexicographical and Fikes ordering of permutations, Algorithms for generatingfunctions, Graph theory, Dijkstr a’s Algorithms, Group theory.

Text Books:

1. C. L. Liu, Elements of Discrete Mathematics, Mc Graw Hill.

References:

2.

J. P. Trembaly and R. Manohar, Discrete Mathematics Structures with Application to

computer Science, MGH.

3.

E. P. Page and L. B. Wilson, An introduction to computational combinatorics,

Cambridge Univ., Press.

CS1301 COMPUTER ORGANIZATION AND ARCHITECTURE [3 1 0 4]Computer types, functional units, basic operational concepts, bus structures, software,

performance. Numbers, arithmetic operations and characters, Memory locations and

addresses; Memory operations, Addressing modes, 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 Introduction, Basic concepts, Design methods Basic concepts, RAM memories,

Read only memories, Speed size and cost, Cache memories, Performance considerations,

Virtual memories, Memory, Management Requirements, Secondary storage, 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]

Variables and functions, Inversion, Truth tables, Logic gates and networks, Boolean algebra,

Introduction to VHDL, 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. Positional number representation, Addition of unsigned

numbers, Signed numbers, Fast adders, Design of arithmetic circuits using VHDL, BCD

representation. 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 Edition, 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 inC, writing recursive programs efficiency of recursion, Example: Tower of Hanoi, GCD,

Fibonacci Definition and examples, Representing stacks in C, Evaluation of expressions,

multiple stacks and queues, Application: 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. Augeustein, Data Structures using C , Pearson Education, 2006.

3. E. Horowitz, S. Sahni, Fundamentals of Data Structures in C , Silicon Press, 2nd Edition,

2007.

CS1304 OBJECT ORIENTED PROGRAMMING USING C++ [3 1 0 4]A Review of Structures, Procedure-Oriented Programming Systems, Object-Oriented

Programming Systems, Comparison of C++ with C, Console Input/output in C++, Function

Prototyping, Function Overloading, Introduction to Classes and Objects, Member Functions

and Member Data, Objects and Functions, Objects and Arrays, Nested Classes; Dynamic

Memory Management: Introduction, Dynamic Memory Allocation, Dynamic Memory De-

allocation, function, Constructors, Destructors, the Philosophy of OOPS; Inheritance:

Introduction to Inheritance, Base Class and Derived Class Pointers, Function Overriding,

Base Class Initialization, Different Kinds of Inheritance, Order of Invocation of Constructors

and Destructors, virtual Functions, Stream Handling, Operator Overloading, Function

Templates, Class Templates, the Standard Template Library (STL); Exception Handling:

Introduction, C-Style Handling of Error-generating Codes, C++ Style Solution – the

try/throw/catch Construct, Limitations of Exception Handling.

References:

1. S. Sahay, Object oriented programming with C++, Oxford Higher Education, 2008.

2. R. Lafore, Object oriented programming in C++, Galgotia publications, 3rd edition, 2006.

CS1330 SWITCHING THEORY& LOGIC DESIGN LAB [0 0 3 1]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 0 3 1]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. Tenenbaum, 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 LAB [0 0 3 1]Review of C++ functions, Structures, Character pointers, Classes, friend functions,

Constructors, static members Inheritance, Dynamic method dispatch, Files, Dynamic

allocation, destructors, operator overloading, Matrix, stack classes, Single and doubly linked

lists, Templates, overloaded functions.

References:1. S. Sahay, Object oriented programming with C++, Oxford Higher Education, 2008.

2. S. Lippman, J. Lajoe, B. Moo, C++ Primer , 4th edition 2005

3. R. Lafore, Object oriented programming in C++, Galgotia publications, 3rd edition, 2006.

FOURTH SEMESTER

MA1402 ENGINEERING MATHEMATICS-IV [4 0 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, IBH.

References:

1. K. S. Trivedi, Probability, Statistics with Reliability, Queuing and computer science

applications, PHI.

2. Miller, Freud and Johnson, Probability and Statistics for Engineers, PHI.

CS1401 OPERATING SYSTEMS AND LINUX [3 1 0 4]What Operating Systems do, Operating System Structure, Operating System 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 Process Concept, Process Scheduling, Operations on Processes,

Inter-process Communication Overview, Multithreaded Models, Thread Libraries, Threading

Issues, Linux Threads Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Thread

Scheduling, Linux Scheduling, Algorithm Evaluation Background, Critical Section Problem,

Contiguous Memory Allocation, Paging, Page Table Structure, Segmentation, Example: TheIntel Pentium; Background, Demand Paging, Copy-On-Write, Page Replacement, Allocation



of Frames, Thrashing, Allocating Kernel Memory, Other Consideration File Concept, Access

Methods, Directory Structure, File System, Access Matrix, Implementation of Access Matrix

The 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]

Database-System Applications, Relational Databases, Database Design, Data Storage and

Querying, Transaction Management, Database Architecture, Fundamental Relational-Algebra

Operations, Extended Relational-Algebra Operations, Null Values, Modification of theDatabase; 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,

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, Dynamic Hashing, 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, Introduction to programming the 8086, Addressing modes,

assembler and Assembler directives, Simple sequence programs, Jumps, Flags, and

conditional jumps, Loop instructions, Instruction timing and delay loops; The 8086 String

instructions, Writing and Using Procedures and Macros. 8086 Interrupts and InterruptResponses, 8259 Priority Interrupt Controller, 8254 Software-Programmable Timer/counter,

Software interrupts: DOS 21h functions; 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 SYSTEM AND LINUX LAB [0 1 3 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 AllocationAlgorithms, 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 3 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-inFunctions, 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 3 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.

FIFTH SEMESTER

CS1501 DESIGN & ANALYSIS OF ALGORITHMS [3 1 0 4]What is an Algorithm, Fundamentals of Algorithmic Problem Solving, Important Problem

Types, Fundamental Data Structures Analysis Framework, Asymptotic Notations and Basic

Efficiency Classes, Mathematical Analysis of Non-recursive and Recursive Algorithms,



Example – Fibonacci Numbers; Selection Sort and Bubble Sort, Sequential Search and Brute-

Force String Matching, Exhaustive Search Binary tree traversals and related properties,

Multiplication of large integers and Stressen's Matrix Multiplication; Insertion Sort, Depth

First Search, Breadth First Search, Topological Sorting, Presorting, Balanced Search Trees,

Heaps and Heapsort, Problem Reduction Sorting by Counting, Input Enhancement in String

Matching. Computing a Binomial Coefficient, Warshall's and Floyd's Algorithms, TheKnapsack Problem and Memory Functions; Prim's Algorithm, Kruskal's Algorithm, Dijkstra's

Algorithm, Huffman Trees Basic Concepts, Cook's Theorem, NP-Hard Graph problems, NP-

Hard Scheduling Algorithms, NP-Hard Code Generation problems.

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.

CS1502 SOFTWARE ENGINEERING [3 1 0 4]

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 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, Resources, Human

Resources, Empirical Estimation Model.

References:1. R. Pressman, Software Engineering: A Practitioners Approach, McGrawHill Publications,

2000.

2. H. Valiet, Software Engineering: Principles and Practice, Wiley India, 3rd Edition, 2005.

CSE1503 COMPUTER GRAPHICS [3 1 0 4]

Video display devices, Raster scan systems, Graphics software, Introduction to OpenGL;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; 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; Light sources, Ambient light, Diffuse reflection,

Specular reflection and Phong model, Shadows, Displaying light intensities, Halftone

patterns and Dithering techniques, Basic ray tracing algorithm. 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 ChomskyHierarchy.

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.

CS1505 COMPUTER NETWORKS [3 1 0 4]

Uses of Computer Networks, Network Hardware, Network Software, Reference Models;

Concepts and Terminology, Analog and Digital Data Transmission, Transmission

Impairments, Channel Capacity, Decibels and Signal Strength; Guided Transmission Media,

Wireless Transmission. Digital Data, Digital Signals, Digital Data, Analog Signals.

Asynchronous and Synchronous Transmission, Types of errors, Error Detection; Flow

Control, Error Control, Performance Issues; Frequency Division Multiplexing, Synchronous

Time Division Multiplexing- Characteristics only, Statistical Time Division Multiplexing.

The Channel Allocation Problem, Multiple Access Protocols, Ethernet, Wireless LANs.

Network Layer Design Issues, Routing Algorithms, Congestion Control algorithms.

References:

1. A. Forouzan, Data Communications and Networking , Tata McGraw-Hill, 2006.

2. M. Gallo & W. M. Handcock, Computer Communications and Networking Technologies,

Thomson, 2003.

CS1530 DESIGN AND ANALYSIS OF ALGORITHMS LAB [0 1 2 2]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 JAVA PROGRAMMING LAB [0 1 2 2]Experiments on Control statements and arrays, Stacks and Lists, Strings, Classes and

methods, Inheritance and Packages, Interfaces, Exception Handling. Threads and

Input/Output, Applets and Event Handling, Programs involving AWT and Swings, Programs

involving AWT and Swings, Design and Implementing the data requirements of a simple DB

application, Implementing simple Servlets, Design and development of Servlets based

application.

References:1. H. Schildt, The Complete Reference Java Seventh Edition, TMH, 2007.

2. P. Patel , K. Moss, Java database programming with JDBC , Dream Tech, 2000.

3. S. Holzner, Java 2 programming black book , Dream Tech, 2005.

SIXTH SEMESTER

CS1601 LANGUAGE PROCESSORS [3 1 0 4]

Language Processors, 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. 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 Edition,

2007.

CS1602 NETWORK PROTOCOLS [3 1 0 4]Introduction, Classfull addressing, other issues, Sub-netting Classless addressing, variable

length blocks, Sub-netting, address allocation, Introduction, Encapsulation, operation ARP

package & RARP- Introduction, packet format Encapsulation, RARP server Introduction,

datagram, fragmentation, options, checksum, IP Package Types of messages, message format,

error reporting, Query, Checksum, Debugging tools, 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 SCTP services, SCTP features, packet

format, association, state transition diagram, flow control, error control, congestion control. Name space, domain name space, distribution of name space, DNS in the internet, resolution,

DNS messages, controlling the server, out of band signaling, escape character, mode of

operation, user interface, security issues.

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 ARCHITECTURE [310 4]

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

Programming Languages and Models; History of GPU Computing: Evolution of graphics

pipelines, GPU computing; Introduction to 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 aLimiting Factor to Parallelism; 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; Parallel Patterns-Prefix Sum: Work Efficiency Considerations, A Work-Efficient

Parallel Scan, Parallel Scan for Arbitrary-Length Inputs, 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, 2nd Edition,

Elsevier Inc. 2012.2.

Ananth Grama, George Karypis, Vipin Kumar, and Anshul Gupta, Introduction to

Parallel Computing,2nd Edition, Addison Wesley 2003.



3. Shame Cook, CUDA Programming: A Developer's Guide to Parallel Computing with

GPUs, 1st edition, Morgan Kaufmann, 2012.

4. Jason Sanders, Edward Kandrot, CUDA by example: an introduction to general-

purpose GPU programming , Addison-Wesley Professional, 2010.

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 Edition,

2007.

CS1631 COMPUTER NETWORKS 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]First program: Hello,World!, kernel Call, Passing Parameters, Summing vectors, Thread

cooperation: Vector sums, dot product, shared memory bit map, Single block without shared

memory: Matrix addition, Matrix multiplication, Square of first 100 integers, Matrixtranspose. Single block with shared memory: Matrix addition, Matrix multiplication, Square

of first 100 integers, Matrix transpose. Multiple block without shared memory: Matrix

addition, Matrix multiplication, Square of first 100 integers, Matrix transpose. Multiple block

with shared memory: Matrix addition, Matrix multiplication, Square of first 100 integers,

Matrix transpose. Case Study.

References:1. Shane Cook, CUDA Programming: A Developer's Guide to Parallel Computing with

GPUs, Morgan Kaufmann Publishers,2013

2. Jason sanders, Edward Kandrot, CUDA by Example: An Introduction General

purpose GPU programming.



SEVENTH SEMESTER

CS1701 ADVANCED INTERNET TECHNOLOGY [3 1 0 4]

SQL, HTML, ASP The .NET Framework, Learning the Visual Basic .NET Language Types,Objects and Namespaces Web Form Fundamentals, Web Controls, Using Visual Studio

.NET, Validation and Rich Controls, State Management Tracing, Logging, and Error

Handling Deploying ASP.NET ADO.NET Data Access, Data Binding, DataList, DataGrid,

and Repeater, Files, Streams, and Email, Using XML Creating Web Services, Using Web

Services Custom Controls, Caching and Performance Tuning, Implementing Security.

References:1. M. J. Crouch, ASP.NET & VB.NET Web programming, Pearson Education Inc., 2002.

2. R. Leinecker, ASP.NET Solutions-23 case studies, Pearson Education Inc., 2004.

3. E. Harold, W. S. Means, XML In a nutshell , O'Reilly, 3rd edition, 2005.

4. D. Hunter, Beginning XML, Wrox Press Ltd, 2000.

CS1702 OBJECT ORIENTED ANALYSIS AND DESIGN [31 0 4]Analyst as a Business Problem Solver, 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, 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, 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 Edition, 2005.

CS1730 ADVANCED INTERNET TECHNOLOGY LAB [0 1 2 2]

Working on VB.Net, Creating a VB application, a web application project and creating

different HTML web pages to convert above application to web based, Develop a session

management for the above project to transfer data from one web page to another, Provide

security to the web application using Cookies, Perform read and write operations on the

cookies, Connect to any two available databases (SQL server and MySQL) using ADO.net,

Creating a proper data base and change the created web pages to use these data connections,

Use AJAX controls, partial refreshes, timed refreshes and other advanced concepts to changethe above created web pages, Use Silver light, Host the project on to the servers.



References:1. M. MacDonald, Beginning ASP.NET 4 in VB.NET 2010, Apress, 2010.

2. M. J. Crouch, ASP.NET & VB.NET Web programming, Pearson Education Inc., 2002

3. R. Leinecker, ASP.NET Solutions-23 case studies, Pearson Education Inc., 2004.

CS1880 INDUSTRIAL TRAINING/ TOUR [0 0 0 1]Each student has to undergo industrial training for a minimum period of 4 weeks. This may

be taken in a phased manner during the vacation starting from the end of third semester.

• Student has to submit to the department a training/tour report in the prescribed format.. The

report should include the certificates issued by the industry.

• Students who opt for industrial visit should visit a minimum of ten industries and submit the

report.

• Student has to make the presentation on the industrial training/ visits

CS1881 PROJECT WORK / PRACTICE SCHOOL [0 0 0 2]• 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

during the mid-semester evaluation.

• The final evaluation and viva-voice will be conducted after submission of the final project

report in the prescribed form.

• Student has to make a presentation on the work carried out, before the departmental

committee as part of project evaluation.

PROGRAMME ELECTIVES

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, IntensityLevel 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; Advancedtopics: 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-WesleyPublishing, 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 and 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. Introduction to Information Retrieval, Christopher D. Manning, Prabhakar

Raghavan and Hinrich Schütze. Cambridge University Press. 2008.

2. Statistical Language Models for Information Retrieval , ChengXiang Zhai,

Morgan & Claypool Publishers, 2008.

CS1652 Distributed System [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, RemoteProcedure 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 , FAULTTOLERANCE: 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 to 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 inVDC, 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 Services2. Miller M, Cloud Computing , 8

th 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



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: Protocolhierarchy, 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 ofIPv4 & 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, Problemsassociated 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

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 layerfeed-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.

CS1754 Data Mining and Data Warehousing [3 0 0 3]

Introduction: The Evolution of Data Warehousing (The Historical Context), The Data

Warehouse - A Brief History, Characteristics, Operational Database Systems and Data

Warehouse (OLTP & OLAP), Today’s Development Environment, Data Marts, Metadata.

Multidimensional Data Models: Types of Data and Their Uses, from Tables and Spreadsheets

to Data Cubes, Identifying Facts and Dimensions, Designing Fact Tables, Designing

Dimension Table, Data Warehouse Schemas, OLAP Operations. Principles of Data

Warehousing(Architecture and Design Techniques):System Processes, Data Warehousing

Components, Architecture for a warehouse, Three-tier Data Warehouse Architecture, Steps

for the design and construction of Data Warehouses, Conceptual Data Architecture, Logical

Architectures, Design Techniques. Unlocking the Data Asset for End Users (The Use of

Business Information): Designing, Business Information Warehouses, Populating Business

information Warehouses, User Access to Information, Information Data in Context.Implementation: Methods for the implementation of Data Warehouse Systems. Data Mining:

Introduction: Motivation, Importance, Knowledge Discovery Process, KDD and Data

Mining, Data Mining vs. Query Tools, Kind of Data data mining, kind of data,

Functionalities, interesting patterns, Classification of data mining systems, Major issues, from

Data warehousing to data Mining. Data Preparation: Preprocess data Cleaning, Data

Integration and Transformation, Data Reduction.Data Warehouse and OLAP Technology for

Data Mining: data warehouse, operational database systems and data warehouses,

Architecture, Implementation, development of data cube technology, data warehousing to

data mining, Data warehouse usage.

References:

1. J. Han, M. Kamber, Data Mining Concepts and Techniques, Elsevier, 2007.



2. M. Berry, G. Linoff, Data Mining Techniques, Wiley Publishing, 2004.

3. T. Davenport, Competing on Analytics, Harvard Business Review (Decision

Making), January 2006.

4. R.N Prasad, S. Acharya, Fundamentals of Business Analytics, John Wiley & Sons,

2011.

5.

M.H.Dunham,”Data Mining:Introductory and Advanced Topics” Pearson Education

6. Jiawei Han, Micheline Kamber, ”Data Mining Concepts & Techniques” Elsevier

7. Sam Anahory, Dennis Murray, “Data Warehousing in the Real World : A PracticalGuide

for Building Decision Support Systems, Pearson Education

8. Mallach,”Data Warehousing System”,McGraw –Hill

CS1755 Embedded System [3 0 0 3]

Introduction to Embedded systems design:Introduction to Embedded system, Embedded

System Project Management, ESD and Codesignissues in System development Process,Design cycle in the development phase for an embedded system, Use of target system or its

emulator and In-circuit emulator, Use of software tools for development of an ES. 8051

Microcontroller: Microprocessor V/s Micro-controller, 8051 Microcontroller: General

architecture; Memory organization; I/O pins, ports & circuits; Counters and Timers; Serial

data input/output; Interrupts.

8051 Instructions: Addressing Modes, Instruction set: Data Move Operations, Logical

Operations, Arithmetic Operations, Jump and Call Subroutine, Advanced Instructions. 8051

Interfacing and Applications: Interfacing External Memory, Keyboard and Display

Devices: LED, 7-segment LED display, LCD. Advanced Microcontrollers: Only brief

general architecture of Atmel AVR, PIC and ARM microcontrollers; JTAG: Concept and

Boundary Scan Architecture.

References:

1. Embedded Systems by Raj Kamal, TMH, 2006.

2. The 8051 Microcontroller by K Ayala, 3rd Ed., Thomson Delmar Learning, 2007.

3. 8051 Microcontroller by S. Ghoshal, Pearson Education, 2010.

4. The 8051 Microcontrollers by K. Uma Rao and A. Pallavi, Pearson Ed., 2009.

5. Microcontrollers by Raj Kamal, Pearson Education, 2005.

6. PIC Microcontroller by H.W Huang, Delmar CENGAGE Learning, 2007.

7. J B Peatman, Design with PIC Microcontrollers, Prentice Hall.

handbook of cse

Documents