B.tech CSE Syllabus

Syllabus
PEOPLES UNIVERSITY, BHOPAL
PROGRAMME: B. Tech. (CSE) SEM: III
Subject
Subject Title Credits Theory
Code
Externals Internals Total
L T
(70) (30) (100)
Mathematics-II BT-301
Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)
Duration of Theory (Externals): 3 Hours
Theory Internal - Max Marks: 30

Best of Two Mid Semester Test Max Marks: 15
Assignment / Quiz Max. Marks: 15
Unit Contents (Theory)

FOURIER SERIES: Introduction of Fourier series, Fourier series for Discontinues Functions,
I
Fourier series for even and odd function, half range series and method of Least Squares.
LAPLACE TRANSFORMATIONS : Introduction of Laplace Transform of elementary
functions, Properties of Laplce transform ,Change of scale property, second shifting property,
II
Laplace transform of the derivative, Inverse Laplace transform and its properties, Convolution
theorem and Applications of Laplace Transformation to solve the ordinary differential equations
SECOND ORDER LINEAR DIFFERENTIAL EQUATIONS with VARIABLE
III COEFFICIENTS: Methods one integral is known, removal of first derivative, changing of
independent variable and variation of parameter.
LINEAR & NON LINEAR DIFFERENTIAL EQUATIONS of FIRST ORDER :
Formulation of partial differential equations, solution of equation by direct integration,
IV lagranges Linear equation, charpits method, Linear partial differential equation of second and
higher order, Linear homogeneous and Non-homogeneous partial differential equation of nth
order with constant coefficients.
VECTOR CALCULUS : Differentiation of vectors, scalar and vector point function,
geometrical meaning of Gradient, Unit Normal vector and directional derivative, physical
V
interpretation of divergence and curl, line integral, surface integral and volume integral, Greens
Strokes and gauss divergence theorem.
TEXT BOOKS:
1. D.C. Aggarwal Engg. Mathematics 2

2. Higher Engineering Mathematics by BS Grewal, Khanna Publication
3. Mathematics for Engineers by S.Arumungam, SCITECH Publications
REFERENCES:
1. Advanced Engineering Mathematics by Erwin Kreyszig, Wiley India

2. Advance Engineering Mathematics by D.G.Guffy
3. Engineering Mathematics by S S Sastri. P.H.I.
4. Advanced Engineering Mathematics by Peter V.ONeil, Thomson Learning
5. Higher Engineering Mathematics by John Bird, Elsevier
Peoples College of Research & Technology 1

Syllabus

Subject
Code
L T
Data Structures (70) (30) (100)
CS 302
and Algorithm Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)
INTRODUCTION TO DATA STRUCTURE Basic terminology, Data types and its
classification, Algorithm complexity notations like big O, , . Application: Storage pools,
I
Garbage collection and compaction Complexity of algorithm (BEst, worst, average), Asymptotic
analysis.
LINEAR DATA STRUCTURE Array Definition, Representation and Analysis of Arrays,
Single and multidimensional arrays, Address calculation, Arrays as parameters, Ordered list and
operations, sparse and matrices, and garbage collection ,Stack, Array implementation of stack,
II
Linked Representation of stack, Application of stack, Conversion of infix to prefix and postfix
Expressions and expression evaluation, Queue Array and linked implementation of queues,
Circular Queues, D- queues and priority Queues, Linked list in array
TREES Basic terminology, Binary trees, property of binary tree, binary search property/s heap
property,Quering a binary search tree, Algebraic expressions, complete binary tree, Extended
III binary trees, Array and linked representation of binary trees, traversing Binary trees, Threaded
Binary trees, Binary search trees (BST), AVL Tress, and B trees. Application: Algebraic
Expression
SORTING & SEARCHING TECHNIQUES Searching Techniques (Linear search, binary
search) Sorting Internal Sorting Bubble Sort, Insertion Sort, Quick Sort, Heap Sort, BinSort,
Radix Sort External Sorting Merge Sort, Multi-way Merge Sort, Polyphase Sorting - Design
IV
Techniques - Divide and Conquer - Dynamic Programming - Greedy Algorithm Backtracking -
Local Search searching and hashing: Sequential search, Binary search, Hash table
implementation, Symbol table, Static tree table, Dynamic tree table.
GRAPH Introduction, sequential representations of graphs, adjacency Matrices, Traversal,
V
Connected Component and spanning trees, Minimum cost of spanning trees, Dijkstras algorithm.
TEXT BOOKS:
1. Lipschutz; Data structure (Schaum); TMH
2. Horowitz and Sahani, Fundamentals of data Structures, Galgotia Publication Pvt. Ltd., N.
Delhi.
3. M. Tenenbaum, Data Structures using C & C++, Prentice-Hall of India Pvt. Ltd., New Delhi.
REFERENCES
1. R. Kruse et al, Data Structures and Program Design in C, Pearson Education Asia,
Delhi-2002
2. Radha Ganesan Data Structure using C,Scitech Publication PVT.LTD. Chennai
3. Data Structures Trembley and Sorenson, TMH Publications
4. Pai; Data structure and algorithm; TMH
5. Anup.Kr.Bhaumik,Data Structure and Algorithm, S.Chand New Delhi
6. Agrawal and Birthare, Data Structure using C and C++, Kamal Prakashan,Indore

Syllabus
Subject
Subject Title Credits Practical
Code
P
Data Structures (30) (20) (50)
CS 302
and Algorithm Min: 12 Min: 20
2 Min: Nil
(D Grade) (D Grade)
Practical Internal - Max Marks: 20

Lab work & Sessional Max Marks: 10
PRACTICALS:
Suggested list of experiments (expandable)
1. Write a program to show Array in C

2. Write a program to implement Stack using array.
3. Write a program to implement stack using linked list.
4. Write a program to implement Queue using array.
5. Write a program to implement Binary Tree.
6. Write a program to implement Binary Search Tree.
7. Write a program to implement bubble sort algorithm.
8. Write a program to implement linear search algorithm.
9. Write a program to implement Binary Search Algorithm.
10. Write a program to implement BFS and DFS Algorithm.

Syllabus

Subject
Code
L T
Digital Circuit & (70) (30) (100)
CS 303
Systems Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


NUMBER SYSTEMS & LIGIC GATES: NumBEr systems & codes, Binary arithmetic,
Boolean algebra and switching function, Error types, correction and detection, Hamming code,
I
De Morgans Theorem, Introduction to logic gates, Universal gate, Combination and sequential
circuits.
MINIMIZATION & COMBINATIONAL LOGIC CIRCUITS : Minimization of switching
function, Concept of prime implica
II t, Karnaugh map method, Cases with don't care terms, Half adder, Half subtractor, Full adder,
Full subtractor Circuits, serial & parallel addition, BCD adders, Look-ahead carry generator and
Logic circuit design
FLIP FLOPS & COMBINATIONAL CIRCUITS : Flip flops, RS, JK, D, T, Master slave flip
III flop, Diode, Transistor, Diode as a switch, Transisitor as a switch, Decoders, Encoders,
Multiplexers, Demultiplexers and Designing of Combinational circuits like code converters.
COMBINATIONAL CIRCUITS & MULTIVIBRATORS : Introduction to various
semiconductor Memories, PLA, Introduction to Shift Registers, Counters, Synchronous &
IV asynchronous counters,
Astable, Monostable & Bitable multivibrator, Schmitt trigger, IC 555 Timer, Introduction to
Logic families and CMOS.
MODULATION TECHNIQUES: Introduction to Modulation and Modulation Techniques,
V
Introduction to Analog to Digital & Digital to Analog conversion.
TEXT BOOKS:
1. M. Mano; "Digital Logic & Computer Design"; PHI.

2. Kapoor, Digital Electronics,Macmillan Publishers India LTD
3. R. K. Gaur Digital Electronics
4. Khan & Khan DIGITAL LOGIC & DESIGN SCITECH
5. P Raja DIGITAL ELECTRONICS SCITECH
REFERENCES:
1. S.S. Bhatti & Rahul Malhotra, Digital Electronics, IK Publications

2. W.H. Gothman; "Digital Electronics"; PHI.
3 Millman & Taub; "Pulse, Digital & Switching Waveforms"; TMH
4. Jain RP; Modern digital Electronics; TMH
5. R.J. Tocci, "Digital Systems Principles & Applications".

Syllabus
Subject
Code
P
Digital Circuit & (30) (20) (50)
CS 303
Systems Min: 12 Min: 20
2 Min: Nil
(D Grade) (D Grade)

PRACTICALS:
1. Study & Test of Operation of Basic Logic Gates

2. Study & Test of Universal Logic Gates
3. Study & Test of Exclusive Logic Gates
4. Verification of Demorgans theorem.
5. To construct of half adder and full adder
6. To construct of half subtractor and full subtractor circuits
7. Study & Test of RS Flio Flop & D Flip Flop
8. Study & Test of JK Flip Flop & T Flip Flop
9. Study of Multiplexer and Demultiplexer Circuits.
10. Study of Encoder and Decoder Circuits.

Syllabus

Subject
Code
L T
Object Oriented (70) (30) (100)
CS-304
Programming Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


INTRODUCTION to OOP : Introduction to OOP paradigm, need for OOPS, differences
BEtween OOP and Procedure Oriented Programming, Overview of OOP principles, Introduction
I to Objects, Objects as software units, Objects instantiations and interactions, Object lifetime,
Static and dynamic objects, global and local objects, Modeling the real world objects and
Modularity
CLASS : Introduction to Classes, difference BEtween Structure & classes, Static data memBEr,
Static memBEr function, Abstract data types, Friend function, Inline function, Scope resolution
II
expression, MemBEr Selection Expression, Metaclass, Introduction to Constructor, its Types
and Destructor.
INHERITANCE : Introduction to Inheritance, Types of Inheritance, Introduction to Access
III Specifiers, Introduction to Specialization and Generalization, Introduction to Association and
Aggregation, Introduction to Object Interaction and Message Passing Techniques
POLYMORPHISM : Introduction to Polymorphism, Types of polymorphism, Static and
dynamic Binding, Introduction to Overloading, Function overloading, Operator Overloading,
IV
Difference BEtween Overloading and Overriding, Introduction to Virtual Functions and Pure
Virtual Functions, Generic Polymorphism and Templates.
STREAM CLASSES : Introduction to C++, C++ Streams, Stream classes, Dynamic Memory
V Allocation, Introduction to Garbage Collection, Introduction to new and delete operators,
Introduction to Exception Handling and its Operations
TEXT BOOKS:
1..Object Oriented programming with C++, E. Balaguruswamy, TMH, 2001

2. MISHRA OOP with C++ SCITECH
3. N.Parimala Object orientation through C++,Macmillan Publishers India LTD.
REFERENCES:
1. Object Oriented Design and Modelling, Rambaugh James etal,PHI-1997

2. Object Oriented Programming in C++, R. Lafore, Galgotia Publications Pvt. Ltd.
3. Object Oriented Programming in c++, Shashi Banzal, Kamal Prakashan, Indore

Syllabus
Subject
Code
P
Object Oriented (30) (20) (50)
CS-304
2 Min: Nil
(D Grade) (D Grade)

PRACTICALS:
1. Program to Implement Object and Class
2. Program to Access private memBErs of a class using Friend Function
3. Program to invoke memBEr of a class using constructor
4. Program to implement Parameterized Constructor
5. Program to implement Single Inheritance
6. Program to Implement Multiple Inheritance
7. Program to Implement Polymorphism using function overloading
8. Program to implement Generic Polymorphism using Templates
9. Program to implement Dynamic Memory Allocation using new and delete Operators
10. Program to implement Virtual Functions to show Polymorphism

Syllabus

Subject
Code
L T
Internet (70) (30) (100)
CS 305
Technologies Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


INTRODUCTION to INTERNET : Internet Evolution, Concepts, Internet Vs Intranet, Internet
Services USENET, GOPHER, WAIS, ARCHIE (WWW) - History, Working, Web Browsers, Its
I Functions, URLs, Web Sites, Domain Names, Concept of Search Engines, Search Engines types,
Web Servers, E-Mail: Sending & Receiving Email, Free E-Mail Services, Introduction to Blogs,
Information Communication Technologies (ICT), Accessing ICT and Information Societies.
HTML : Concepts of Hypertext, Static and Dynamic Pages, HTML Introduction, Features, Uses
II & Versions Using Various HTML Tags, Elements of HTML Syntax, Head & Body Sections, ,
Inserting Texts, Text Alignment.
CSS with HTML: Using Images In Pages, Hyperlinks Text and Images, Bookmarks,
Backgrounds and Color Controls, Creating and Using Tables in HTML, Use of Font Size &
III Attributes, List Types and its Tags. Introduction to WYSIWYG Design tools for HTML,
Overview of MS- FrontPage, Introduction to CSS, its Types and its Application for Formatting of
HTML Pages.
JAVA SCRIPT: JavaScript Overview, JavaScript and the WWW, JavaScript vs. Java,
JavaScript versions, JavaScript Comments, Variables: Variables overview, declaring variables,
IV Types of variables, Casting variables. JavaScript Alert box, Prompt & confirm. Expressions,
Operators, Precedence, Statements: If statement, For statement, While statement,
Break/Continue, Introduction to XML, AJAX and their Applications
E COMMERCE : E - Commerce an Introductions, Concepts, Advantages and Disadvantages,
Internet & E-Business, Applications, Electronic Payment Systems: Introduction, Types of
V
Electronic Payment Systems, Smart Cards and Credit Card-Based Payment Systems, Introduction
E-Governance and its applications
TEXT BOOKS :
1. Level Module - M 1.2 - Internet & Web Page Designing By V.K.Jain Bpb Publications.
2. E-Commerce An Indian Perspective (Second Edition) - By P. T. Joseph, S.J. Presentice-Hall
Of India
3. Internet For Everyone - Alexis Leon And Mathews Leon, Vikas Publishing House Pvt. Ltd.,
New
Delhi
4. ITL Solutions, Internet and Web Design Macmillan Publishers India Ltd.
REFERENCES
1. Learn Html In A Weekend By Steven E. Callihan, Phi
2. Using Html By Lee Anne Phillips,
3. Phi Teach Yourself Javascript In 24 Hrs. By Michael Moncur, T Echmedia

Syllabus
Subject
Code
P
Internet (30) (20) (50)
CS 305
Technologies Min: 12 Min: 20
2 Min: Nil
(D Grade) (D Grade)

List of Practical:
1. Study of Internet and its Services

2. Study of Search Engines
3. Designing of a Blog
4. Study of ICT
5. Designing a Web Page using Basic HTML Tools
6. Designing Web Page using Table Attributes
7. Designing Web Page using Forms
8. Designing Web Page with Formatting by CSS
9. Designing a Page using Microsoft Office Front Page
10. Implementation of Conditional and Looping Statements in Java Scripts

Syllabus

Subject
Code
P
C++ (30) (20) (50)
CS 306
2 Min: Nil
(D Grade) (D Grade)
Unit Contents (Practical)
OOPS : Introduction to OOPS, differences BEtween OOP and Procedure Oriented
I
Programming, Overview of OOP principles, introduction to C++.
C++ STATEMENTS : C++ Basics: Structure of a C++ program, Data types, Declaration of
variables, Expressions, Operators, Operator Precedence, Evaluation of expressions, Type
II
conversions, Pointers, Arrays, Strings, Structures, Flow control statement-if, switch, while, for,
do, break, go to statements.
FUNCTIONS & CLASSES : Functions- Scope of variables, Parameter passing, Default
arguments, inline functions, Recursive functions, Dynamic memory allocation and reallocation,
III operators-new and delete, Preprocessor directives, C++ Classes, Objects and Data Abstraction:
Class Definition, Class Structure, Class Object, Class Scope, Friends to a class, Static class
memBErs, Constant memBEr functions.
INHERITANCE : Constructors and Destructors, Dynamic creation and destruction of objects,
IV Data Abstraction, Inheritance: Defining a class hierarchy, Different forms of inheritance,
Defining the Base and Derived classes, Access to the base class memBErs
POLYMORPHISM : Function overloading, Operator Overloading , Virtual Functions and
Polymorphism: Static and Dynamic binding, Base and Derived class virtual functions, Pure
V
virtual functions, Abstract classes, C++ Exception Handling and File Handling, Comparison of
C++ with C, Java and C#.
TEXT BOOKS:
1.Object Oriented programming with C++, E. Balaguruswamy, TMH, 2001
2. Let us C++ by Yashwant Kanitkar
3. Object Oriented Programming with C++, Radha Ganesan, Scitech Publication PVT.LTD. Chennai
4. Padam Gulwani & Anshuman Sharma, Elementary Concepts of Computer Design and Hardware,
Kamal Prakashan, Indore
REFERENCES 1) ERIC NAGLER Learning C++ JAICO Pub.
List of Practical:
1) Program to print any Message
2) Program for Conditional Statements, Looping Statements and Switch Case
3) Program to implement Arrays, Strings and Pointers
4) Program to implement Functions and Dynamic Memory Allocation
5) Program to implement Class and Objects
6) Program to implement Friend Functions and Constructors
7) Program for Inheritance
8) Program for Polymorphism
9) Program for File Handling
10) Program for Exception Handling

Syllabus
PROGRAMME: B. Tech. (CSE) SEM: IV
Subject
Code
L T
(70) (30) (100)
Mathematics-III BT 401
Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


FUNCTIONS of COMPLEX VARIABLES: Analytic functions, Harmonic Conjugate, Cauchy
I Riemann Equations, Line integral, Cauchy's theorem, Cauchy's Integral formula, Singular
points, Poles and Residues, Residue theorem and Evaluation of Real Integral
NUMERICAL ANALYSIS: Difference operators, Errors and Approximations, Interpolation,
II Inverse interpolation, Numerical differentiation, Numerical Integration by using Simpsons
method, Weddels rule and Trapezoidal Rule.
SOLUTION OF ALGEBRIAC & SIMULTANEOUS EQUATIONS : Solutions of algebraic
and transcendental equations( Regular False, Newton-Raphson, Iterative, Graffes root squaring
III
methods) and Solutions of simultaneous algebraic equations (Gauss Elimination, Gauss Jordan,
Gauss Iterative, Jacobi,Gauss Seidel and Crouts Traingularization).
SOLUTION TO DIFFERENTIAL EQUATIONS: Solutions of ordinary differential equations
IV ( Taylors Series, Picards Method, Euler Method, Modified Eulers method, Runge Method and
Runge Kutta Method).
OPTIMIZATION by LINEAR PROGRAMMING: Introduction, 2 Variable Problems,
V Solution by Graphical and Simplex Methods, Concept of Degeneracy and Duality, Simple 3
Variable Transport and Assignment Problems and Modeling into LPP.
TEXT BOOKS:
1. Higher Engineering Methematics by B.S. Grewal,Khanna Publications

2. D.C. Aggarwal Engineering Mathematics II
3. Mathematical Methods by KV Suryanarayan Rao, SCITECH Publuication
REFERENCES :
1. Numerical Methods using Matlab by J.H.Mathews and K.D.Fink, P.H.I.

2. Numerical Methods for Scientific and Engg. Computation by MKJain, Iyengar and RK Jain, New
Age International Publication
3. Numerical Methods using Matlab by Yang,Wiley India
4. Pobability and Statistics by Ravichandran ,Wiley India
5. Mathematical Statistics by George R., Springer

Syllabus

Subject
Code
Computer Externals Internals Total
L T
Organization & (70) (30) (100)
CS 402
Architecture Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


Computer Basics and CPU Von Newman model, various subsystems, CPU, bus organization,
computer memory, Memory registers, I/O, Register Transfer Language, Instruction Fetch, decode
I
and execution, data movement and manipulation, Instruction formats and addressing modes of
basic computer, Flynn's and Handler's Classification of parallel computing structures.
Control Unit, Organization, Hardwired control unit, Micro and nano programmed control unit,
Control Memory, Address Sequencing, Micro Operations & Instruction formats, horizontal and
vertical micro instruction, Micro program sequencer, Data and control hazards and method to
II
resolve them, Arithmetic and Logic Unit, Arithmetic Processor, Addition, subtraction,
multiplication and division, Floating point and decimal arithmetic and arithmetic units and design
of arithmetic unit.
Input Output Organization & Modes Of Data Transfer Program controlled, interrupt driven &
direct memory access, I/O Interface, programmed I/O, I/O addressing & instruction, I/O
III processor, I/O Synchronization, I/O processors, DMA, Data transfer Serial / parallel,
synchronous / asynchronous, simplex / half duplex and full duplex, Interconnection networks,
Parallel Algorithms for array processors and Search algorithms
Memory & 8085 Microprocessor Memory Hierarchy, Cache Memory - Organization and
mappings, Associative memory, Virtual memory, semiconductor memories (RAM, ROM),
IV
memory allocation and management policies, 8085 I/O structure, Assembly Language,
instruction set and basic programming and Data communication.
Multiprocessors Pipeline and Vector processing, Instruction and arithmetic pipelines, Vector and
V array processors, Interconnection structure and inter-processor communication structure of
multiprocessors, parallel processing and pipeline processing, SIMD & MIMD multiprocessor
TEXT BOOKS:
1. Morris Mano: Computer System Architecture, PHI.

2. Advanced Computer Architecture: A System Design Approach- Kain, PHI Publication.
3. Computer Architecture and Parallel Processing- Hwang And Briggs, TMH.
4. Tanenbaum: Structured Computer Organization, Pearson Education
References
1. Gaonkar: Microprocessor Architecture, Programming, Applications with 8085; Penram Int.

2. William Stallings: Computer Organization and Architecture, PHI
3. K.M.HebBTr: Computer Architecture, Macmillan Publishers India LTD
4. J P Hayes, Computer Architecture and Organisations, Mc- Graw Hills, New Delhi

Syllabus
Subject
Code
Computer Externals Internals Total
P
Organization & (30) (20) (50)
CS 402
Architecture Min: 12 Min: 20
2 Min: Nil
(D Grade) (D Grade)

PRACTICALS:
1. Program in Assembly Language for Addition and Subtraction of 2 NumBErs.

2. Program in Assembly Language for Multiplication and Division of 2 NumBErs.
3. Program in Assembly Language for Addition of 2 Hexadecimal NumBErs
4. Program in Assembly Language for Addition of 2 Four Bit Binary NumBErs
5. Program in Assembly Language for Multiplication of 2 Four Bit Binary NumBErs
6. Program in Assembly Language for Division of 2 Four Bit Binary NumBErs
7. Program to implement Booths Algorithm
8. Program to implement Interrupt Processing Techniques

Syllabus

Subject
Code
Analysis & Externals Internals Total
L T
Design of (70) (30) (100)
CS 403
Algorithms Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


Basics of Algorithms and data types: - Algorithms, Abstract Data Type, The Running Times
Of a Program, Use of the Big-Oh, small o, Big-omega and small omega notation, Inequalities
I
involving such notation: data structures like linked lists, Basic algorithms like quick sort, depth
and breadth first search in graphs.
Trees and Sorting: Basic terminology, Implementation of tree, An Array Representation of
Trees, Representation of Trees by List of Children, Binary trees, Deterministic selection and
II
sorting, Optimality of algorithms for sorting and selection, Randomized algorithms like
randomized quick sort, and expected linear time randomized selection.
Divide and Conquer Technique: Divide and Conquer with examples such as Sorting, Matrix
Multiplication, Convex hull and Searching. Greedy methods with examples such as Optimal
III
Reliability Allocation, Knapsack, Minimum Spanning trees Prims and Kruskals algorithms,
Single source shortest paths - Dijkstras and BEllman Ford algorithms.
Dynamic programming: Dynamic programming with examples such as Kanpsack, All pair
shortest paths Warshals and Floyds algorithms, Resource allocation problem. Backtracking,
IV
Branch and Bound with examples such as Travelling Salesman Problem, Graph Coloring, n-
Queen Problem, Hamiltonian Cycles and Sum of subsets.
NP Complete Problem: Introduction to NP Problem, Polynomial-time, Abstract Problems,
Encoding, NP-Completeness and Reducibility, NP-Completeness, Circuit Satisfiability, NP-
V
Complete Problems, The Vertex-cover Problem, The Subset-sum Problem, The Hamiltonian-
cycle Problem, The Traveling-salesman Problem.
TEXT BOOKS:
1. Horowitz & Sahani; Analysis & Design of Algorithm

2. V.V.Muniswamy; Design and Analysis of Algorithm,I.K International Publishing House PVT.
LTD, New Delhi
3. Shanthi, Design and Anaysis of Algorithm, Scitech Publication PVT.LTD. Chennai
REFERENCES
1. Coremen Thomas, Leiserson CE, Rivest RL; Introduction to Algorithms; PHI.

2. Ullmann; Analysis & Design of Algorithm

Syllabus
Subject
Code
Analysis & Externals Internals Total
P
Design of (30) (20) (50)
CS 403
2 Min: Nil
(D Grade) (D Grade)

PRACTICALS:
1. Write a program to show linear Search.

2. Write a program for Binary Search.
3. Write a program for Merge Sort.
4. Write a program for Quick Sort.
5. Write a program for minimum spanning trees using Kruskals algorithm.
6. Write a program for minimum spanning trees using Prims algorithm.
7. Write a algorithm for Floyd-Warshall.
8. Write a program for traveling salesman problem.

Syllabus

Subject
Code
Data L T
(70) (30) (100)
Communication CS404
Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


Introduction to Data Communication Data Communication System, Elements of Data Comm.
System, Introduction to Transmission Modes, Types, Line Configuration, Types, Introduction to
I Serial Transmission, Parallel Transmission, Synchronous Transmission v/s Asynchronous
Transmission, Introduction to Topology and Types, Introduction to Multiplexing, FDM, TDM,
Types, WDM and CDMA.
Transmission Medium and Modulation Introduction to Transmission Medium, STP, UTP, Co
Axial Cables, Optical Fibre Cables, Introduction to Wireless Mediums and Satellite
II Comunication, Introduction to Data Compression, Data Compression Techniques, Run Length
Encoding, Lampel Ziv Welch Encoding, Introduction to Modulation, AM, FM, PM, Introduction
to Shift Keying Techniques, ASK, BSK, PSK, QAM and PCM.
Encodings & Information Theory Introduction to Encoding Techniques, Polar, Unipolar and
Bipolar Encoding Techniques, Introduction to Spread Spectrum, Direct Sequence Spread
III
Spectrum and Frequency Hopping Spread Spectrum, Introduction to Channel, Channel Capacity,
S/N Ratio, Shannon Fanos Coding Technique and Huffmans Coding Techniques
Error Correction & Detection Introduction to Errors, Types, Error Correction, Error Detection,
IV VRC, CRC, LRC, Checksum, Internet Checksum and Hamming Codes, Introduction to Modems
and DTE-DCE Interfaces, RS232 and Other Interfacing Devices
Error Control & Flow Control Introduction to Error Control and Flow Control, Flow Control
Techniques, Stop & Wait Protocol, Go Back N Protocol, ENQ / ACK, Polling, Selecting, Sliding
V
Window Protocol, Selective Repeat, Selective Reject, ARQ and its Techniques, Introduction to
Congestion Control and Congestion Control Techniques.
TEXT BOOKS:
1. Data Communications by William Stallings, Prentice Hall

2. Data Communications by BEhrouz Forouzan, Tata Mc Graw Hill Publications
REFERENCES
1. Communication Systems by Singh & Sapre, Tata McGraw Hill Publications

2. Communication Systems by B. P. Lathi, Oxford University Press

Syllabus
Subject
Code
Data P
(30) (20) (50)
Communication CS404
Min: 12 Min: 20
2 Min: Nil
(D Grade) (D Grade)

PRACTICALS:
1. Simulation of ISO-OSI reference model.

2. Simulation of Data Link Protocol: HDLC
3. Implementation of multiplexers.
4. To study FDM modulation techniques.
5. To study TDM modulation techniques
6. To study WDM modulation techniques
7. To study various transmission media like twisted pairs, co-axial cables, optical fiBErs

Syllabus

Subject
Code
Computer L T
(70) (30) (100)
Graphics and CS 405
Min: 28 Min: 40
Multimedia 3 1 Min: Nil
(D Grade) (D Grade)


Introduction to raster & random graphics fundamentals, Display devices & comparison Point
I plotting, line drawing & circle drawing & their algorithm like DDA & Bressenhams, Video
Basics, Adapter Cards (MCA, CGA, EGA, VGA, etc.)
2D Translation:Translation,Rrotation,Scaling,Shearingreflection,Inverse transformation,
Homogeneous co-ordinate system, Matrices transformation, Composite transformation,
II Windowing and clipping, World co-ordinate system,Screen co-ordinate system, Viewing
traformation, Line clipping, Cohen Sudherland, Midpoint line clipping algorithms, Polygon
clipping: sudherland- Hodgeman, Weliler-Atherton algorithms.
3D translation: Translation, Rotation, Scaling, Parallel and perspective projection, Types of
parallel and perspective projection, Hidden surface elimination: Depth comparison, Back face
III
detection algorithm, Painters algorithm, Z-buffer algorithm, Curve generation, BEzier and B-
spline methods.
Basic Illumination Model, Diffuse reflection, Specular reflection, Phong Shading, Gourand
IV
shading, ray tracing, color models like RGB, YIQ, CMY, HSV.
Multimedia System: An Introduction, Multimedia hardware, Multimedia System Architecture.
Data & File Format standards. i.e RTF, TIFF, MIDI, JPEG, DIB, MPEG,Audio: digital audio,
V
MIDI, processing sound, sampling, compression. Video: Avi, 3GP,MOV, MPEG , compression
standards, compression through spatial and temporal redundancy. Multimedia Authoring .
TEXT BOOKS:
1. Donald Hearn and M.P. BEcker Computer Graphics Pearson Pub.

2. Pradeep K.Bhatia Computer Graphics,I.K International Publishing House PVT.LTD
3. Sinha and Udai , "Computer Graphics", Tata McGraw Hill
REFERENCES
1. Principles of Interactive Computer Graphics by William M. Newman

2. Rogers, "Procedural Elements of Computer Graphics", Tata McGraw Hill
3. Folay Vandam, Feiner, Hughes Computer Graphics Principle & Practice , Pearson Pub.
4. Parekh Principles of Multimedia Tata McGraw Hill
5. Prabhat k Andleigh, Kiran Thakral , Multimedia System Design PHI Pub.
6. James E. Shuman, Multimedia in Action Thomson / Vikas Publishing House.
7. Tay Vaughan Multimedia: making it work Tata McGraw Hill 1999, 4th Edition
8. Buss,3D Computer Graphics, Cambridge University Press,New Delhi

Syllabus
Subject
Code
Computer P
(30) (20) (50)
Graphics and CS 405
Min: 12 Min: 20
Multimedia 2 Min: Nil
(D Grade) (D Grade)

PRACTICALS:
1. A Brief Study of Various Types of Input and Output Devices

2. Introduction on Graphics Programming and Graphics Functions
3. Program to Implement a Line Using Slop Intercept Formula
4. Program to Implement Line Using DDA Algorithm
5. Program to Implement Line Using Bresenhams Algorithm
6. A Program to Implement Circle Using Midpoint Algorithm
7. Program to Implement Translation of a line and Triangle
8. Program to Implement Rotation of Line and Triangle
9. Program to Implement Cohen Sutherland Line Clipping algorithm.
10. Program to draw BEzier Curve

Syllabus

Subject
Code
P
(30) (20) (50)
DOT Net CS 406
Min: 12 Min: 20
2 Min: Nil
(D Grade) (D Grade)
INTRODUCTION Introduction to DOT NET Framework, its Architecture, Components,
I Languages, Application Development, Requirements and Features, Installation of DOT NET, IIS
Server, Introduction to C#, Comparison of C, C++, Java and C#
C# CONSOLE Introduction to C# Program Structure, Tokens, Expressions, Data Types,
Conditional Statements, Loops, Switch Case, Functions, Strings, Arrays, File Handling,
II
Exception Handling, C# as Object Oriented Language, Classes & Objects, Constructors,
Inheritance, Polymorphism, C# Packages and Namespaces
WINDOWS APPLICATIONS Introduction to HTML, HTML Tags, Introduction to CSS,
III Types, Introduction to Windows Applications, Use of C# Tools in Development of Windows
Applications, Validation Controls, MDI Forms and Introduction to Crystal Reports
WEB APPLICATIONS Introduction to ASP.NET, Introduction to Web Page Designing, Web
Development, Static Pages, Dynamic Pages, Introduction to SQL, SQL Queries, SQL Server,
IV Introduction to ADO.NET, Development of Applications with Data Base, Front End Back End
Connectivity, Types, Data Base Controls, Introduction to Content Management System and FCK
Editor
ADDITIONAL TECHNOLOGIES Introduction to XML, Structure and Syntax of XML,
Introduction to Java Scripts, Using Java Scripts on Web Forms, Introduction to AJAX,
V
Application of AJAX in Web Design Applications and Development of a Small Project in
ASP.NET using C#
TEXT BOOKS:
1. C# Programming by E.Balagurusamy, Tata Mc Graw Hill Publications
2. C# Complete Reference, Tata McGraw Hill Publications
3. DOT NET for BEginners by Wrox Publications
REFERENCES
1) DOT NET 4.0 by Harvey Dietal & Paul Dietal
2) DOT NET Technology by Daminni Grover, IK Publications
List of Practical:
1. Program in C# to implement Conditional Statements, Looping Statements and Switch Case
2. Program in C# to implement Arrays, Functions and its Types
3. Program in C# to implement Exception Handling and File Handling
4. Program in C# to implement Classes and Inheritance
5. Program in C# to implement Polymorphism
6. Creating a Simple Window Application
7. Creating Static Web Pages using ASP.NET
8. Creating Dynamic Web Pages using ADO.NET
9. Study of XML and Java Script
10. Development of a Small Data Base Web Application

Syllabus
PROGRAMME: B. Tech. (CSE) SEM: V
Subject
Code
System Externals Internals Total
L T
Programming & (70) (30) (100)
CS 501
Operating Min: 28 Min: 40
3 1 Min: Nil
System (D Grade) (D Grade)


Introduction: Introduction to Language Processors, Language Processing Activities and
Language Processors Development Tools, Translators, Interpreters, Assemblers, Compiler,
I
Macros and Macro Processors, Linkers, Loaders, Software Tools, Introduction to Operating
Systems, Types of operating Systems, system protection and Operating system services.
Process Scheduling & IPC: Basic concepts of CPU scheduling, Scheduling criteria, Scheduling
algorithms, algorithm evaluation, multiple processor scheduling, Process concept, operations on
II
processes, threads, interprocess communication, precedence graphs, critical section problem,
semaphores and classical problems of synchronization
Deadlock & Memory Management : Deadlock problem, deadlock characterization, deadlock
prevention, deadlock avoidance, deadlock detection, recovery from deadlock, Methods for
III deadlock handling, Concepts of memory management, logical and physical address space,
swapping, Fixed and Dynamic Partitions, BEst-Fit, First-Fit and Worst Fit Allocation, paging,
segmentation and paging combined with segmentation.
Virtual Memory & OS Security: Concepts of virtual memory, Cache Memory Organization,
demand paging, page replacement algorithms, allocation of frames, thrashing, demand
IV
segmentation, Role of Operating System in Security, System Protection, Password Management
and Trusted Systems
Disk Scheduling & Files: Disk scheduling, file concepts, File manager, File organization, access
methods, allocation methods, free space managements, directory systems, file protection, file
V
organization & access mechanism, file sharing implement issue and introduction to distributed
systems.
TEXT BOOKS:
1. Dhamdhare, System Programming and Operating System, Tata McGraw Hill Publications
2. Peter Galvin Operating System Concepts
REFERENCES
1. Rajiv Chopra, Operating System, S.Chand New Delhi

Syllabus
Subject
Code
System Externals Internals Total
P
Programming & (30) (20) (50)
CS 501
Operating Min: 12 Min: 20
2 Min: Nil
System (D Grade) (D Grade)

PRACTICALS:
1. Program to implement FCFS CPU Scheduling Algorithm

2. Program to implement SJF CPU Scheduling Algorithm
3. Program to implement Round Robin CPU Scheduling Algorithm
4. Program to implement FIFO Page Replacement Algorithm
5. Program to implement LRU Page Replacement Algorithm
6. Program to implement Optimal Page Replacement Algorithm
7. Program to implement Bankers Algorithm for Deadlock Avoidance

Syllabus

Subject
Code
Data Base L T
(70) (30) (100)
Management CS 502
Min: 28 Min: 40
system 3 1 Min: Nil
(D Grade) (D Grade)


Introduction & Basic Models: DBMS Concepts, architecture & Advantages, Database approach
v/s Traditional file accessing approach, Data models, Schemas and instances, Data independence,
I Data Base Language and interfaces, Functions of DBA and designer, types of database users.
Various other data models object oriented data Model, Network data model, and Relational data
model, Comparison BEtween the three types of models.
Design: Introduction to ER modeling, entity, entity sets & types, attributes, relation and
relationship sets in ER models, ER diagrams, and reducing ER diagrams to tables, generalization
II and aggregation in ER models, Introduction to normalization, Normal forms, Functional
dependency, Decomposition, Dependency preservation and lossless join, problems with null
valued and dangling tuples, multivalued dependencies.
Relational Data models: Domains, Tuples, Attributes, Relations, Characteristics of relations,
Keys, Relational database, Referential integrity, Intension and Extension, Relational Query
languages: SQL-DDL, DML, integrity constraints, Complex queries, various joins, indexing,
III
triggers, assertions, deletion and modification anomalies. Relational algebra and relational
calculus, Relational algebra operations like select, Project, Join, Division, outer union and
Introduction to Query Optimization
Data definitions in SQL Queries, update statements and views in SQL, QUEL and QBE , data
and storage definition, data retrieval queries and update statements etc. Methods of storing
relational database record in files, various types of files like sequential files, indexed files,
IV indexed sequential files etc. buffer management, data dictionary, physical storage media etc.
needed for these file. Introduction to indexing and hashing: indexing techniques using B -Trees,
B+ -Trees etc., static hashing function, dynamic hashing function etc, overview of query
processing and cost estimation.
Transaction Processing Concepts: Transaction System, Testing of Serilizability, Serializability
of schedules, conflict & view serializable schedule, recoverability, Recovery from transaction
failures. Log based recovery, Concurrency Control Techniques: - Concurrency Control, locking
Techniques for concurrency control, time stamping protocols for concurrency control, validation
V based protocol, multiple granularity. Multi version schemes, Recovery with concurrent
transaction. Introduction to Distributed databases, datamining, data warehousing, Object
Technology and DBMS, Comparative study of OODBMS Vs DBMS . Temporal, Deductive,
Multimedia, Web & Mobile database .Comparison of various database models, comparison of
some existing DBMS

Syllabus
TEXT BOOKS:
1. Fundamentals of Database Systems By Elmasri & Navathe

2. Database System Concepts by SilBErschatz, Korth & Sudershan.
3. An introduction to Database Systems By C.J.Date
REFERENCES
1. Atul Kahat Introduction to Database Management System, Pearson Educations.

2. P.S Gill, Data Base Management System,I.K International Publishing House PVT.LTD,
3. Rajiv Chopra,Data Base Management System, S.Chand New Delhi
4. Priyadarshini: Data Base Management System, Scitech Publication PVT.LTD. Chennai
Subject
Code
Data Base P
(30) (20) (50)
Management CS 502
Min: 12 Min: 20
system 2 Min: Nil
(D Grade) (D Grade)

PRACTICALS:
1. Study and Implementation of Create table Command

2. Study and Implementation of Insert Command
3. Study and Implementation of Delete Command
4. Study and Implementation of Drop Table Command
5. Study and Implementation of Alter Table Command
6. Study and Implementation of Update Command
7. Study and Implementation of Select Clause
8. Study and Implementation of From Clause
9. Study and Implementation of Where Clause
10. Delete Duplicate Rows from the Table
11. Query for Join Operation
12. Query for Cartesian Product

Syllabus

Subject
Code
L T
Discrete (70) (30) (100)
CS 503
Mathematics Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)

SET THEORY and RELATIONS : Definition of Sets, countable and uncountable sets, finite
and infinite sets, Venn Diagrams, principles of inclusion and exclusion, proofs of some general
I identities on sets multi-sets and ordered pairs, Relation, Definition, Types of relation,
Composition of relations, Equivalence relation, Equivalence class, partial ordering relation and
job -scheduling problem.
FUNCTIONS & PIGEON HOLE PRINCIPLE : Definition, Domain, Co-Domain and Range
of a Function, Image of an Element, Everywhere Defined Function, Equal Function, type of
II function , Invertible Function, Composition of Functions, Identity Function, Inverse Function,
Recursively Defined Function, pigeonhole principle, Theorem proving Techniques,
Mathematical induction and proof by contradiction
PREPOSITIONAL LOGIC & FINITE STATE MACHINES : Proposition, First order logic,
Basic logical operations, Truth tables, tautologies, Contradictions, Algebra of prepositions,
III logical implications, logical equivalence, predicates, normal forms, Universal and existential
quantifiers, Introduction to finite state machine and Finite state machines as models of physical
system equivalence machines.
GRAPH THEORY : Introduction and basic terminology of graphs, planer graphs, Multigraph
and weighted graphs, Isomorphic graphs, Paths, Cycles and connectivity, Shortest path in
IV
weighted graph, Introduction to Eulerian paths and circuits, chromatic numBEr, Somorphism and
Homomorphism of graphs
COMBINATORICS & RECURRENCE RELATIONS : Introduction Permutation and
combination, Binomial Theorem, Multimonial Coefficients Recurrence Relation and Generating
V Function, Introduction to Recurrence Relation and Recursive algorithms, Linear recurrence
relations with constant coefficients, Homogeneous Solutions, Particular solutions, Total
solutions, Generating functions, Solution by method of generating functions
TEXT BOOKS:
1. D.C. Aggarwal Discrete Mathematics
2. Lipschutz; Discrete mathematics (Schaum); TMH
3. S k Sarkar Discrete Mathematics, S. Chand .
4. Discrete Mathematics,Harish Mittal, I.K International Publishing House PVT.LTD,
5. Discrete Mathematics, Geetha, Scitech Publication PVT.LTD. Chennai
REFERENCES
1. C.L.Liu, Elements of Discrete Mathematics Tata Mc Graw-Hill Edition.
2. Trembley, J.P & Manohar; Discrete Mathematical Structure with Application CS, McGraw
Hill.
3. Kenneth H. Rosen, Discrete Mathematics and its applications, McGraw Hill.
4. Deo, Narsingh, Graph Theory With application to Engineering and Computer.Science., PHI.

Syllabus

Subject
Code
L T
Computer (70) (30) (100)
CS 504
Networks Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


Introduction & Protocol Layering Introduction to Computer Networks, Elements of Computer
Networks, Applications, Types, LAN, WAN, MAN, Internet, internet, Intranet, Extranet,
I
Introduction to Protocol Layering Principle, OSI Model, Functions of 7 Layers, TCP / IP
Protocol Suite, SNA, Internetworking and Internetworking Devices
Data Link Layer & Ethernet Introduction to DLL, LLC & MAC Sub Layers, Introduction to
Physical Addressing, SLIP, PPP, HDLC, Bit Oriented & Byte Oriented Protocols, Introduction to
II ALOHA, Pure ALOHA, Slotted ALOHA, CSMA, Types, CSMA/CD, CSMA/CA, Introduction
to IEEE 802 Project, Token Bus, Token Ring, FDDI, DQDB and Ethernet, Introduction to
Spread Spectrum and its Types
Network Layer & Addressing Introduction to Addressing, Addressing Classes, Classless
Addressing, Introduction to Subnetting and Supernetting, Connectionless & Connection Oriented
III
Services, Introduction to Routing, Types, Routing Protocols, RIP, OSPF, BGP, IP, ICMP, ICMP
Messages, IGMP, ARP and RARP
Transport Layer & Application Layer Introduction to Port Addressing, UDP, TCP, 3 Way
Handshaking for TCP Connection Management, Types of TCP Connections, Introduction to
IV
BOTP, DHCP, DNS, TELNET, FTP, TFTP, Introduction to Mail Transfer, SMTP, Message
Access Agents, SNMP, SMI, MIB, HTTP, NNTP and Remote Procedure Call
SECURITY & MANAGEMENT Introduction to Encryption and Decryption, Symmetric Key
Cryptography, Classical Encryption Techniques, DES Algorithm, Public/Private Key
Cryptography, RSA Algorithm, Digital Signatures, Firewalls, Attacks, Intruders, Malicious
V
Softwares and Antivirus Softwares, Introduction to Network Management, Fault Management,
Configuration Management, Accounting Management, Performance Management, Security
Management and Introduction to Network Monitoring
TEXT BOOKS:
1. Data Communication & Networking by BEhrouz Forouzan, Tata Mc Graw Hill Publications
2. TCP/IP Protocol Suite by BEhrouz Forouzan, Tata Mc Graw Hill Publications
3. TCP/IP Protocol Suite by Steven Richards
REFERENCES
1. Computer Networks by WilliamStallings
2. Computer Networking by Sanjay Sharma
3. Implementation of TCP/IP Protocol Suite by Douglas E. Comer
4. Fundamental of Computer Network by Chandra Mohan, I.K International Publishing House
PVT.LTD,
5. Data Communication and Networking by Asish Tiwari, Kamal Prakashan,Indore

Syllabus
Subject
Code
P
Computer (30) (20) (50)
CS 504
Networks Min: 12 Min: 20
2 Min: Nil
(D Grade) (D Grade)

PRACTICALS:
1. Write a program in 'C' for PC to PC communication using RS-232 port.

2. Write a program for encryption and decryption using monoalphaBEtic substitution or
polyalphaBEtic substitution.
3. Write a program to implement Huffman data compression algorithm to generate Prefix codes and
encoded text.
4. Study of Novell Netware.
5. Study and implementation of routing algorithm
6. Study and implementation of congestion control algorithm.
7. Implementation of subnet mask concept.
8. Simulation of ARP and RARP protocols.
9. Simulation of TCP protocol.
10. Network socket programming.

Syllabus

Subject
Code
Data Modeling Externals Internals Total
L T
with UML (70) (30) (100)
CS 505
Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


Basics of Data Modeling, Types of data Modeling, CDM, EDM, LDM, PDM, RDM, Data
I Modeling Tools, Logical v/s Physical Data Modeling, Data Modeling Standards, Data Modeler
Role and Data Modeling Techniques
Basic concepts of UML Use case diagrams, Class diagrams, Sequence diagrams, State chart
II
diagrams and Activity diagrams.
System Models and Views. Notations, Concepts and Phenomena. Data Types, Abstract Data
III
Types and instances. Classes, Abstract Classes, and Objects and Event Classes
Object-Oriented Modeling - Application domain, Solution domain, Object Oriented analysis,
IV
Object Oriented design, Falsification and Prototyping
Basics of Relationships, Communication relationships, Extend relationships, Generalization
V relationships, Associations and links, Multiplicity, Association class, Aggregation,
Generalization and Specialization.
TEXT BOOK:
1. G.Booch, Object-Oriented Analysis and Design with Applications, 2nd ed.

2. P.Coad,D.North,&M.Mayfield,Objectmodels:Strategies,Patterns,&Applications, Prentice Hall,
Englewood Clffs,NJ,1995.
REFERENCES
1. K.Popper, Objective Knowledge: An Evolutionary Approach, Clarendon, Oxford B

2. Daminni Grover, Object Oriented Analysis & Design with UML, IK Publications

Syllabus
Subject
Code
Data Modeling Externals Internals Total
P
with UML (30) (20) (50)
CS 505
Min: 12 Min: 20
2 Min: Nil
(D Grade) (D Grade)

PRACTICALS:
1. Class diagram without attributes

2. Class diagram with attributes
3. Use case diagram for Mechanic.
4. Activity diagram for Cellular Company
5. Sequence diagram ATM
6. State Transition diagram for ATM
7. Online Book shop of class diagram without attributes
8. Use case diagram of Online Book Shop
9. Activity diagram of Online Book Shop
10. Draw an Activity diagrams

Syllabus

Subject
Code
Hardware and Externals Internals Total
P
Linux Lab (30) (20) (50)
CS 506
Min: 12 Min: 20
2 Min: Nil
(D Grade) (D Grade)
BASIC COMPUTER HARDWARE: History, Introduction to Computer Hardware,
I Introduction to Peripheral Devices and their Types, Introduction to Memory, Types and
Classification and Introduction to Semiconductor Memories
PORTS & PC CARDS: Introduction to Ports, Interfacing with Ports, Types of Ports,
II Introduction to PC Cards, Interfacing with PC Cards, Identification of various Ports on PC Cards
and Troubleshooting
FORMATTING & PARTITIONING: Introduction to Hard Disks, Formatting of Hard Disks,
III Partitioning of Hard Disks, Introduction to Software, Installation of System Software, Installation
of Operating System and Application Software
General Overview of the Unix/Linux System: History, System structure, Operating system
services, Assumptions about hardware, Introduction to the Kernel, Grub ,Boot Loader ,
IV
Architecture of the UNIX operating system, Use of Unix/Linux, User Commands, Editors, Shell
programming, Use of system calls, files, processes, I/O, IPC
SYSTEM CALLS FOR THE FILE SYSTEM IN LINUX: Open, Read, Write, File and record
V locking, Adjusting the position of file I/O, Close, File creation, Creation of special files,
Changing directory, root, owner, mode stat and file systems, link, unlink. Server Overview.
TEXT BOOK:
1. Craig & Zacker , Hardware Complete Reference, Tata McGraw Hill Publications
2. Padam Gulwani & Anshuman Sharma, Elementary Concepts of Computer Design and
Hardware, Kamal Prakashan,Indore
REFERENCES
1. LINUX Complete Reference by Peterson, Tata McGraw Hill Publications
2. Fundamentals of LINUX by O Reilly Publications
3. PC Hardware A BEginners Guide by Ron Gilster, Mc Graw Hill Publications
List of Practical:
Suggested list of experiments(expandable)
1. Installation of Operating System
2. Assembling of resources
3. Introduction of Hard disk.
4. Study of CD/DVD.
5. Introduction of RAM
6. Study of Mother board
7. Study of Sound/Video Driver
8. Installation of LNUX
9. Study of squid server
10. Study of DHCP server
11. Study of FTP server
12. Study of HTTP server

Syllabus
PROGRAMME: B. Tech. (CSE) SEM: VI
Subject
Code
Principal of Externals Internals Total
L T
programming CS 601 (70) (30) (100)
language Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


INTRODUCTION to LANGUAGES and PROGRAMMING Language Evaluation Criteria,
influences on Language design, Language categories, Programming Paradigms Imperative,
Object Oriented, functional Programming, Logic Programming, Programming Language
I
Implementation Compilation and Virtual Machines, programming environments, Issues in
Language Translation: Syntax, Semantics, Stages, analysis and synthesis, Parse Tree, CFG and
BNF grammar.
II INTRODUCTION to DATATYPES and STATEMENTS Data types: Introduction,
primitive, character, user defined, array, associative, record, union, pointer and reference types,
II design and implementation uses related to these types, Names, Variable, concept of binding, type
checking, strong typing, type compatibility, named constants, variable initialization, Sequence
control with Expressions, Conditional Statements, Loops and Exception handling.
INTRODUCTION to FUNCTIONS Subprograms and Blocks, Fundamentals of sub-programs,
Scope and lifetime of variable, static and dynamic scope, Design issues of subprograms and
III
operations, local referencing environments, parameter passing methods, overloaded sub-
programs, generic subprograms, design issues for functions overloaded operators and co routines
INTRODUCTION to STORAGE MANAGEMENT Abstract Data types, Abstractions and
encapsulation, introductions to data abstraction, Static and Stack-Based Storage management,
IV
heap based storage management, Garbage Collection, object oriented programming in C++, Java,
C#, PHP, Multithreading, Java threads and C# threads
INTRODUCTION to EXCEPTION HANDLING Exception handling, Exceptions, exception
V
Propagation, Exception handler in C++ and Java and Introduction to 4GL
TEXT BOOK:
1. SeBEsta,Concept of programming Language, Pearson Edu.

2. Louden, Programming Languages: Principles & Practices , Cengage Learning
3. Tucker, Programming Languages: Principles and paradigms , Tata McGraw Hill
REFERENCES
1. Terrance W Pratt, "Programming Languages: Design and Implementation" Pearson Edu.

2. Cavlo Ghezzi & Mehdi Jazayeri " Programming Languages Concepts", Willey India
3. E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

Syllabus

PROGRAMME: B. TECH. (CSE) SEM: VI
Subject
Code
Artificial Externals Internals Total
L T
Intelligence and CS 602 (70) (30) (100)
Neural Networks Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)
Introduction to Artificial Intelligence and Game Playing Introduction to AI, Applications,
Introduction to Problem Characteristics, Production Rules, Production Systems, Types,
Applications, Control Strategies, State Space Representation, AI Problems, Constraint
I Satisfaction, Crypto-Arithmetic, Introduction to Searching, DFS, BFS, Hill Climbing,
Limitations, Introduction to Heuristic Search, BEst First Search, A* Algorithm, Problem
Reduction, AO* Algorithm and Mean End Analysis, Introduction to Game Playing Techniques,
Minimax Algorithm, Minimax with Alpha-BEta Cut-Offs
Knowledge Representation Introduction to Knowledge, Knowledge Representation Techniques,
Characteristics, Introduction to Logic, Propositional Logic and Predicate Logic, Clause Form,
Resolution, Refutation, Deduction, Theorem Proving, Inferencing, Unification, Backward
II
Chaining, Introduction to Reasoning, Monotonic and Non Monotonic Reasoning, Forward and
Backward Reasoning, Semantic Nets, Frames, Scripts, Schemas, Conceptual Dependency,
Probabilistic Reasoning and Bayes Theorem
Natural Language Processing & Fuzzy Logic Introduction to Thinking, Planning, Block World
Problem in Robotics, Introduction to Understanding, Natural Language Processing, Introduction
III
to Parsing, Top Down Parsing and Bottom Up Parsing, Introduction to Fuzzy Logic, Fuzzy Sets,
Operations and Applications, Introduction to Genetic Algorithms and Soft Computing
Introduction to Learning and Neural Networks Introduction to Learning, Training, Learning
Techniques, Types, Introduction to Common Sense Reasoning, Introduction to Expert Systems,
Introduction to Neural Networks, Difference BEtween BNNs and ANNs, Classification of
IV
Neural Networks, Applications, Introduction to Learning Rules, Introduction to Activation
Functions, Introduction to ADALINE and MADALINE, Introduction to Perceptron and Linear
Separability
Classification of Neural Networks Introduction to Back Propagation, Limitations,
Characteristics, EBPA, Introduction to Counter Propagation Networks, Modes, Kohonen Self
V Organizing Feature Map, Introduction to Hopfield Networks, Boltzmann Machines, Cauchys
Training and Boltzmann Training, Introduction to ART, Architecture, Characteristics,
Operations, Limitations, Training and Applications of Neural Networks.
TEXT BOOK:
1. Fundamentals of Soft Computing by Padam Gulwani & Anshuman Sharma, I.K International
Publishing House PVT.LTD
2. Neural Computing by Wasserman
REFERENCES
1. Artificial Intelligence by Rich and Knight Tata McGraw Hill Publications
2. Artificial Intelligence by Poole, Cambridge University Press,New Delhi
3. Artificial Intelligence by Sudanshu Rajoria , Kamal Prakashan,Indore
4. Artificial Intelligence by Ela Kumar, IK Publications

Syllabus
Subject
Code
Artificial Externals Internals Total
P
Intelligence and CS 602 (30) (20) (50)
Neural Networks Min: 12 Min: 20
2 Min: Nil
(D Grade) (D Grade)

PRACTICALS:
1. To solve Towers of Hanoi problem using recursion.

2. To implement Breadth first search (BFS).
3. To implement Depth first search (DFS).
4. To implement BEst first search.
5. Solving Traveling salesman problem.
6. To find the solution of 8-puzzle.
7. To find the solution of Water Jug problem.
8. To solve monkey-bananas problem.
9. To simulate a multilayer Perceptron Network for XOR gate.
10. To identify odd and even numBErs by backpropagation.
11. To implement Hopfield neural network.
12. To solve TSP using Genetic Algorithm.

Syllabus

Subject
Code
Software Externals Internals Total
L T
Engineering (70) (30) (100)
CS 603
Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)
SOFTWARE PROCESS Introduction S/W Engineering Paradigm life cycle models (water
fall, incremental, spiral, WINWIN spiral, evolutionary, prototyping, object oriented) - system
I
engineering computer based system verification validation life cycle process
development process system engineering hierarchy.
SOFTWARE REQUIREMENTS Functional and non-functional - user system requirement
engineering process feasibility studies requirements elicitation validation and
II management software prototyping prototyping in the software process rapid prototyping
techniques user interface prototyping -S/W document. Analysis and modeling data, functional
and BEhavioral models structured analysis and data dictionary
DESIGN CONCEPTS AND PRINCIPLES Design process and concepts modular design
design heuristic design model and document. Architectural design software architecture
data design architectural design transform and transaction mapping user interface design
III
user interface design principles. Real time systems - Real time software design system design
real time executives data acquisition system - monitoring and control system. SCM Need for
SCM Version control Introduction to SCM process Software configuration items
Taxonomy of software testing levels test activities types of s/w test black box testing
testing boundary conditions structural testing test coverage criteria based on data flow
IV
mechanisms regression testing testing in the large. S/W testing strategies strategic approach
and issues - unit testing integration testing validation testing system testing and debugging
SOFTWARE PROJECT MANAGEMENT Measures and measurements S/W complexity
and science measure size measure data and logic structure measure information flow
measure. Software cost estimation function point models COCOMO model- Delphi method.-
V
Defining a Task Network Scheduling Earned Value Analysis Error Tracking - Software
changes program evolution dynamics software maintenance Architectural evolution.
Taxonomy of CASE tools
TEXT BOOKS:
1. Roger S.Pressman, Software engineering- A practitioners Approach, McGraw-Hill International
Edition, 5th edition, 2001
2. Ian Sommerville, Software engineering, Pearson education Asia, 6th edition, 2000.
3. Pankaj Jalote - An Integrated Approach to Software Engineering, Springer Verlag, 1997.
REFERENCES
1. James F Peters and Witold Pedryez, Software Engineering An Engineering Approach, John
Wiley and Sons, New Delhi, 2000.
2. Ali BEhforooz and Frederick J Hudson, Software Engineering Fundamentals, Oxford
University Press,
3. Rajani Kanta Malu Software Engineering, Scitech Publication PVT.LTD. Chennai
4. Sajan Mathew, Software Engineeing, S.Chand New Delhi
5. Paul Ammann, Introduction to Software Testing, Cambridge University Press,New Delhi

Syllabus
Subject
Code
Software Externals Internals Total
P
Engineering (30) (20) (50)
CS 603
Min: 12 Min: 20
2 Min: Nil
(D Grade) (D Grade)

PRACTICALS:
1. Study of Waterfall Model

2. Study of Prototyping Model
3. Study of RAD Model
4. Study of Spiral Model
5. Preparing an SRS Dcoument
6. Study of Verification and Validation Testing
7. Development of a Small Software using Software Development Life Cycle Processes

Syllabus

Subject
Code
Automata L T
CS 604 (70) (30) (100)
Theory Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


AUTOMATA Introduction to formal proof Additional forms of proof Inductive proofs
Finite Automata (FA) Deterministic Finite Automata (DFA) Non-deterministic Finite
I Automata (NFA) Finite Automata with Epsilon transitions. Introduction, Sets , Logic ,
Functions , Relations , Languages , Proofs Mathematical Induction , Strong Principle of
Mathematical Induction , Recursive Definitions ,Structural Induction, Kleene's Theorem
REGULAR EXPRESSIONS AND LANGUAGES Regular Expression FA and Regular
Expressions Proving languages not to BT regular Closure properties of regular languages
II
Equivalence and minimization of Automata. A Criterion for Regularity, Minimal Finite
Automata, Pumping Lemma for Regular Languages
CONTEXT-FREE GRAMMAR AND LANGUAGES Context-Free Grammar (CFG) Parse
Trees Ambiguity in grammars and languages Definition of the Pushdown automata
III Languages of a Pushdown Automata Equivalence of Pushdown automata and CFG,
Deterministic Pushdown Automata. PDA corresponding to a Given CFG , CFG Corresponding
to a Given PDA
PROPERTIES OF CONTEXT-FREE LANGUAGES Normal forms for CFG Turing
Machines Programming Techniques for TM. The Pumping Lemma for CFG , Intersection &
IV
Complement of CFGs , Decision Problems Involving CFGs, Turing Machine (TM) Definition &
Examples, Computing a Partial Function with a TM
UNDECIDABILITY A language that is not Recursively Enumerable (RE) An undecidable
problem that is RE Undecidable problems about Turing Machine Posts Correspondence
V
Problem - The classes P and NP. Recursive Enumerable & Recursive Languages, Enumerating a
Language, Context-Sensitive Languages & Chomsky Hierarchy
TEXT BOOKS:
1. Theory of Computation by Jeffery D. Ullman and Alfred Aho.

2. Theory of Computation by KLP Mishra and Chandershekharan
3. Theory of Computation by A A PuntamBEkar
REFERENCES
1. Theory of Computation by S.N.Sivanandam, I.K International Publishing House PVT.LTD,

2. A Textbook on Automata Theory by Dr.P.K.Srimani Cambridge University Press,New Delhi

Syllabus

Subject
Code
Parallel L T
CSE 605 (70) (30) (100)
Algorithm Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


Introduction Introduction, Parallel Computers, Parallel Processing Concepts,, Need of
alternative model, Elements of Parallel Computing, Level of Parallelism, Taxonomy of parallel
I Computers, Models for Parallel Computations such as Binary Tree, Network Model, etc. Pyramid
model, Fully Connected model, PRAM-CREW, EREW models, simulation of one model from
another one
Parallel Computing Paradigms Binary tree, Growing by doubling, Pointer jumping, Divide and
Conquer, Partitioning, Performance Measures of Parallel Algorithms, speed-up and efficiency of
II
Parallel Algorithms. Examples to Illustrate Cost-optimal algorithms- such as summation,
Min/Max on various models.
Parallel Algorithms Scalar product of two vectors, Matrix Multiplication, Partial sums,
III Binomial Coefficients, Range Minima Problem, Tree Algorithms, graph Algorithms B. Spanning
Tree Problem, Biconnected components problem
Array Manipulation Searching & Merging, Parallel search on CREW PRAM, Parallel Search
IV with more data, searching in unsorted array, Merging by ranking, Bitonic Merging, Sorting
Algorithms, Sorting Algorithms
Algebraic Equations and Matrices Geometric Interpretations, Bisection Method, and
Determinant of a matrix, System of Linear Equations: Gauss Elimination, Fourier transforms,
V
Polynomial Multiplication, Matrix Inversion. B. Parallel Algorithms on Gauss Sandal, Numerical
Integration etc
TEXT BOOK:
1. Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar "Introduction to Parallel
Computing", Second Edition, Addison Wesley, 2003. ISBN: 0-201-64865.
2. S.G.Akl, "The Design and Analysis of Parallel Algorithms", PHI, 1989.
3. F.T.Leighton, "Introduction to Parallel Algorithms and Architectures: Arrays, Trees,
HypercuBEs", MK Publishers, San Mateo California, 1992.
REFERENCES
1. Wilkinson, M.Allen,"Parallel Programming Techniques and Applications using networked

workstations and parallel computers", Prentice Hall, 1999.
2. Michael J. Quinn, "Parallel computer theory and practice", McGraw Hill, Second Edition, 1994

Syllabus
PROGRAMME: B. TECH. (CSE) SEM: VII
Subject
Code
Compiler Design Externals Internals Total
L T
CS 701 (70) (30) (100)
Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


Introduction & Lexical Analysis Introduction to Translator, Interpreter, Assembler, Compiler,
Analysis Synthesis Model, Phases, Pass Structure, Introduction to Porting, Cross Compiler,
I
Bootstrapping, Introduction to Lexical Analysis, Finite State Machines, Regular Expressions and
LEX
Syntax Analysis & Semantic Analysis Introduction to Syntax Analysis, Parsing, CGFs, Parse
Trees, Ambiguity, Normal Forms, Types of Parsing, LL(1) Parsing, LR Parsers, YACC,
II
Introduction to Semantic Analysis, SDT, SDD, Types of Attributes and Introduction to Type
Checker
Intermediate Code Generation & Run Time Environments Introduction to Intermediate Code
Generation, Three Address Code, Representation of TAC, 3AC for Programming Language
III Constructs, Introduction to Run Time Memory Storage, Activation Records, Parameter Passing
Mechanisms, Static Binding v/s Dynamic Binding, Memory Allocation Techniques, Dynamic
Memory Allocation and Garbage Collection
Symbol Table, Error Handler and Code Optimization Introduction to Symbol Table, its Uses,
Data Structures used for Symbol Table Management, Introduction to Error Handler, its
IV Applications, Types of Errors, Introduction to Basic Block and Flow Graph, Introduction to Code
Optimization, Code Optimization Techniques, Local Optimization, Loop Optimization, Global
Optimization, Data Flow Analysis and Peep Hole Optimization
Code Generation Introduction to Target Code Generation, Types of Target Codes, Design of a
Code Generator, Directed Acyclic Graph, Target Code Generation from DAG, Backpatching,
V
DAG for TAC, Assembly Code, Introduction to Linkers, Loaders, Decompilation and Symbolic
Debugging of Optimized Code
TEXT BOOK:
1. Compiler Design Principles by Aho, Sethi & Ullman
2. Compiler Design by A A PuntamBEkar
REFERENCES
1) Compiler Construction 2/e by D.M.Dhamdhere, Macmillan Publishers India LTD

Syllabus
Subject
Code
Compiler Design Externals Internals Total
P
CS 701 (30) (20) (50)
Min: 12 Min: 20
2 Min: Nil
(D Grade) (D Grade)

PRACTICALS:
1. Program to implement a DFA that accepts all Strings of a and b ending with abb
2. Program to implement a DFA that accepts all Strings of a and b having equal numBEr of a
andb
3. Program to implement Lexical Analyzer
4. Program to implement LL(1) Parser
5. Program to implement Recursive Descent Parser
6. Program to implement Operator Precedence Parser
7. Program to generate Intermediate Code as Postfix Notation
8. Program to generate Intermediate Code as Three Address Code

Syllabus

Subject
Code
Network L T
CS 702 (70) (30) (100)
Security Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


Introduction to Network Security, Computer Security, Information Security, Introduction to
Threats, Attacks, Types of Attacks, Introduction to Packet Sniffing, Spoofing, Introduction to
Authentication and Authorization, Introduction to Cryptography, Elements of Cryptography,
I
Steganography, Cryptanalysis, Cryptographic Attacks, Classical Encryption Techniques,
Symmetric Key Cryptography, Simple DES Algorithm, DES Algorithm, AES and IDEA
Encryption Algorithm
Introduction to Public/Private Key Cryptography, Shared Key Cryptography, RSA Algorithm,
Diffie Hellman Algorithm, Elliptic Curve Cryptography, Introduction to Key Management, Key
II
Management Techniques, Introduction to Message Digest, Introduction to Digital Signatures,
Digital Signature Algorithm and MD5 Function
Introduction to Message Digest Functions, Hash Functions, Classification, MAC Functions,
III Classifications, HMAC, Introduction to SHA and RIPEMD, Introduction to KerBEros, KerBEros
Security, Introduction to Sure Socket Layer and Secure Electronic Transactions
Introduction to Malicious Softwares, Virus and Worms, Classification, Trojan Horse and Trap
IV Doors, Types of Trojans, Zombies, Introduction to Intruders, Types, Intrusion Detection System,
Intrusion Detection Techniques, Introduction to Anti-Virus Softwares and its Applications
Application security- web application security , regular application security , emBEdded
application security, remote administration security, data base security, Firewalls and TCP/IP,
V
packet filtering firewalls, stateful packet- inspection firewalls, OS-based firewalls and functions
of firewalls
TEXT BOOKS:
1. William Stallings, Cryptography and Network Security: Principles and Practice Pearson
2. Charlie Kaufman, Radia Perlman, Mike Speciner, Michael Speciner, Network Security -
Private communication in a public world TMH
3. Fourozon, Cryptography & Network Security TMH
4. Atul Kahate,Cryptography and Network Security Mc Graw Hill
REFERENCES
1. Carl Endorf, Eugene Schultz, Jim Mellander INTRUSION DETECTION & PREVENSION
TMH
2. Joseph Migga Kizza, Computer Network Security, , Springer International Edition
3. Neal, Krawetz, Introduction to Network Security,Cengage Learning
4. P.S.Gill , Cryptography and Network Security,Macmillan Publishers India LTD.
5. Network Security and its Cryptographic Algorithm by Nitin K.Nayak,Kamal Prakashan,Indore

Syllabus
Subject
Code
Network P
CS 702 (30) (20) (50)
Security
Min: 12 Min: 20
2 Min: Nil
(D Grade) (D Grade)

PRACTICALS:
1. Footprinting using footprinting tools(Open Source & Free)(ex-nslookup, ARIN, Whois,Google

Earth etc..)
2. Scanning for vulnerabilities using (Angry IP, HPing2, IPScanner, Global Network Inventory
Scanner, Net Tools Suite Pack.)
3. NetBIOS Enumeration Using NetView Tool, Nbtstat Enumeration Tool (Open Source).
4. Steganography using tools: Tool: Merge Streams, Image Hide, Stealth Files, Blindside, STools,
Steghide, Steganos, Pretty Good Envelop, Stegdetect,.
5. Steganalysis - Stego Watch- Stego Detection Tool, StegSpy.
6. How to Detect Trojans by using Netstat, fPort, TCPView, CurrPorts Tool, Process Viewer.
7. Lan Scanner using look@LAN, wireshark.
8. Understanding DoS Attack Tools- Jolt2 , Bubonic.c, Land and LaTierra, Targa, Nemesy Blast,
Panther2, Crazy Pinger, SomeTrouble, UDP Flood, FSMax

Syllabus

Subject
Code
Information Externals Internals Total
L T
Storage & CS 703 (70) (30) (100)
Management Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)
Introduction to Storage Technology Evolution of Storage Management, Storage technologies
at a glance, Storage Devices, File Allocation Methods, Challenges in Data Storage and
I
Management, Data Storage Infrastructure , Information Lifecycle Management, Data
categorization
Storage Systems Architecture Components of a Storage System Environment , Disk drive
components, Disk Drive Performance, properties, performance, and specifications ,Logical
II Components, Concept of RAID and its Components, Different RAID levels and their suitability
for different application environments: RAID 0, RAID 1, RAID 3, RAID 4, RAID 5, RAID 0+1,
RAID 1+0, RAID 6, Comparison of Levels, mapping and operation
Introduction to Networked Storage Evolution of networked storage, Architecture, Overview of
JBOD, DAS, NAS, SAN, limitations of DAS, NAS, CAS & SAN. BEnefits of NAS,
III
Components, Implementations, CAS Architecture, Storage and Retrieval, Security Criticism in
Networked Storage Technologies, Risk Mitigation for Networked Storage
Hybrid Storage solutions Hybrid Storage Appliance, Virtualization, Types of Virtualization,
Storage Virtualization, Virtual Appliance, : Industry management standards (SNMP, SMI-S,
IV CIM), standard framework applications, Data Center. Requirement for the design of a secure data
center, Key Program Management Metrics, Back up and Disaster Recovery, Importance of
disaster recovery planning
Introduction of Cloud Computing Introduction, Types of Cloud Computing, Cloud Computing
Model Cloud Computing Characteristics, Advantage & Disadvantage of Cloud Computing,
V Essential Characteristics of Cloud Computing, Evolution of Cloud Technologies, Cloud
Application Services, Cloud Computing Model, Storage on Cloud, Cloud Security and
integration, Cloud Architecture, Risk of Cloud Computing, The future of Cloud Computing
TEXT BOOKS:
1. Padam Gulwani & Anshuman Sharma ; Information Storage and Management, Scitech
Publication,New Delhi India
2. G. Somasundaram & Alok Shrivastava (EMC Education Services) editors; Information Storage
and Management: Storing, Managing, and Protecting Digital Information; Wiley India.
Ulf Troppens, Wolfgang Mueller-Friedt, Rainer Erkens, Rainer Wolafka, Nils Haustein; Storage
3. Network explained : Basic and application of fiBEr channels, SAN, NAS, iSESI, INFINIBAND
and FCOE, Wiley India.
REFERENCES
1. John W. Rittinghouse and James F. Ransome; Cloud Computing : Implementation , Management
and Security, CRC Press, Taylor Frances Pub.
2. Nick Antonopoulos, Lee Gillam; Cloud Computing : Principles, System & Application, Springer.
3. Anthony T. Velete, Toby J.Velk, and RoBErt Eltenpeter, Cloud Computing : A practical
Approach, TMH Pub.

Syllabus
Subject
Code
Information Externals Internals Total
P
Storage & CS 703 (30) (20) (50)
Management Min: 12 Min: 20
2 Min: Nil
(D Grade) (D Grade)

PRACTICALS:
1. Study of RAID Models

2. Study of JBOD
3. Study of NAS and DAS
4. Study of CAS and SAN
5. Study of Virtualization
6. Study of Cloud Computing

Syllabus

Subject
Code
Wireless Externals Internals Total
L T
Network CS 7101 (70) (30) (100)
(Elective I) Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)

INTRODUCTION Introduction of Wireless Networks, Different Generations of Wireless
Networks, Characteristics of the Wireless Medium, Radio Propagation Mechanisms, Path Loss
Modeling and Signal Coverage, Effect of Multipath and Doppler, Channel Measurement and
I
Modeling Techniques, Wireless Network Topologies, Cellular Topology, Cell Fundamentals,
Signal to Interferences Radio Calculations, Network Planning for CDMA Systems, Wireless
Network Operations, Mobility Management, Radio Resources and Power Management.
WIRELESS LAN AND WIRELESS COMMUNICATION Cellular systems- Frequency
Management and Channel Assignment- types of handoff and their characteristics, dropped call
II rates & their evaluation - MAC SDMA FDMA TDMA CDMA Cellular Wireless
Networks IEEE 802.11 Standards Architecture Services Mobile Ad hoc Networks- WiFi
and WiMAX - Wireless Local Loop
MOBILE COMMUNICATION SYSTEMS GSM-architecture-Location tracking and call
setup- Mobility management- Handover-Security-GSM SMS International roaming for GSM-
III call recording functions-subscriBEr and service data mgt -Mobile NumBEr portability -VoIP
service for Mobile Networks GPRS Architecture-GPRS procedures-attach and detach
procedures-PDP context procedure-combined RA/LA update procedures-Billing
MOBILE NETWORK AND TRANSPORT LAYERS Mobile IP Dynamic Host
Configuration Protocol-Mobile Ad Hoc Routing ProtocolsMulticast routing-TCP over Wireless
IV Networks Indirect TCP Snooping TCP Mobile TCP Fast Retransmit / Fast Recovery
Transmission/Timeout Freezing-Selective Retransmission Transaction Oriented TCP- TCP
over 2.5 / 3G wireless Networks
APPLICATION LAYER HomeRF, Bluetooth, Interference BEtween Bluetooth and 802.11,
Adhoc Networks, Introduction to 2.5 G and 3 G Networks, WAP Model- Mobile Location based
V
services -WAP Gateway WAP protocols WAP user agent profile- caching model-wireless
BEarers for WAP - WML WMLScripts WTA - iMode- SyncML
TEXT BOOKS:
1. Jochen Schiller, Mobile Communications, Second Edition, Pearson Education, 2003.
2. William Stallings, Wireless Communications and Networks, Pearson Education, 2002
REFERENCES
1. Kaveh Pahlavan, Prasanth Krishnamoorthy, Principles of Wireless Networks, First
Edition, Pearson Education, 2003.
2. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas StoBEr, Principles of
Mobile Computing, Springer, 2003.
3. C.K.Toh, AdHoc Mobile Wireless Networks, First Edition, Pearson Education, 2002.
4. C.Y. Lee Mobile Communication Systems, Tata McGraw Hill Publications
5. Kamilo Fehir Wireless Communications, Prentice Hall Publications

Syllabus

PROGRAMME: B. TECH. (CSE) SEM:VII
Subject
Code
Computational Externals Internals Total
L T
Complexity CS 7102 (70) (30) (100)
(Elective-I) Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


I Models of Computation, resources (time and space), algorithms, computability and complexity
Complexity classes, P/NP/PSPACE, reduction s, hardness, completeness, hierarchy and
II
relationships BEtween complexity classes
Randomized computation and complexity; Logical characterizations, incompleteness and
III
Approximability
Circuit complexity, lower bounds; Parallel computation and complexity; Counting problems and
IV
Interactive proofs
V Probabilistically checkable proofs; Communication complexity and Quantum computation
TEXT BOOK:
1. Christos H. Papadimitriou., Combinatorial Optimization: Algorithms and Complexity ,

Prentice-Hall
2. Sanjeev Arora and Boaz Barak , Complexity Theory: A Modern Approach, Cambridge
University Press
REFERENCE:
1. Steven Homer , Alan L. Selman , Computability and Complexity Theory , Springer

Syllabus

Subject
Code
CyBEr Law L T
CS-7103 (70) (30) (100)
(Elective I) Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


CyBEr world: an overview, internet and online resources, security of information, digital
I signature, intellectual property (IP), historical background of IP, IPR governance, National patent
offices, the world intellectual property organization (WIPO).
Introduction about the cyBEr space: The legal framework, Confidential Information, Protection
of Confidential Information, Nature of confidential information , Confidence implied in a
contract, Confidence implied by circumstances, Identification of confidential information,
II
Essential requirements of breach of confidence, Exceptions to breach of confidence, Remedies
for breach of confidence , Employee Privacy Rights , Employer Protection, Internet Banking in
India : Analyzing Legal Issues
Introduction to computer and cyBEr crimes: CyBEr crimes and related concepts, distinction
BEtween cyBEr crimes and conventional crimes, CyBEr criminals and their objectives. Kinds of
III cyBEr crimes cyBEr stalking; cyBEr pornography, forgery and fraud, crime related to IPRs,
cyBEr terrorism; computer vandalism etc. CyBEr forensics, computer forensics and the law,
forensic evidence, computer forensic tools
Regulation of cyBEr crimes: Issues relating to investigation, issues relating to jurisdiction, issues
IV relating to evidence, relevant provisions under Information Technology Act 2000, Indian penal
code, pornography Act and evidence Act etc.
INFORMATION TECHNOLOGY ACT Observations on the Preamble, Jurisdictions
proposing to adopt provisions of the Model Law, UNCITRAL Model Law on Electronic
V
Commerce Part One. Electronic Commerce In General, Sphere of application, UNCITRAL
Model Law , Information TechnologyAct, 2000
TEXT BOOK:
1. Nelson, Phillips, Computer Forensics and Investigations, Cengage Learning India.

2. Vinod V. Sople, Managing Intellectual Property PHI Learning Private Limited.
REFERENCES
1. Rodney D. Ryder, " Guide to CyBEr Laws", Second Edition, Wadhwa and Company,
2007.
2. Joha Rao, " Law of CyBEr Crimes and Information Technology Law", Wadhwa and
Company, 2007

Syllabus
Subject
Code
Distributed L T
CS (70) (30) (100)
Systems
7201 Min: 28 Min: 40
(Elective II) 3 1 Min: Nil
(D Grade) (D Grade)
Introduction to Distributed Systems Distributed system, Architecture, Goals, and Advantages
& Disadvantage, designing Issues, examples of Distributed system, Hardware and Software
I
concepts, Distributed Computing Model, method of communication BEtween distributed objects,
Layered Protocols, ATM Networks and the Client-Server models
Synchronization in Distributed Systems Clock Synchronization, Mutual exclusion, Election
algorithm, The Bully algorithm, a ring algorithm, Atomic Transaction, Deadlock overview &
prevention technique in Distributed systems, Processes & Processors in Distributed Systems,
II Threads, system models, Processor allocation, Scheduling in distributed systems, fault tolerance
& real time distributed systems, API for Internet Protocol, Data Representation & Marshaling,
Group Communication, Client Server Communication, RPC Messages & Implementation
Mechanism and Stub Generation
Memory Sharing and File System of Distributed Systems Distributed Share Memory:
Architecture & its Types, Implementations & Designing issues, Structure of Share Memory
Space, Consistency Model, and Thrashing, Distributed File System, File Service Architecture &
III
features, File Accessing Model, File Sharing Semantics, File Catching Scheme, File Application
& Fault tolerance. Trends in distributed file systems: Features, System Oriented Names, Object
Locating Mechanism and Human Oriented Name
Distributed databases & Distributed Scheduling Distributed databases, Features & its types,
levels of distribution transparency, data fragmentation & integrity constraints, various types of
Transaction management, concurrency control, reliability, distributed database administration,
IV
locks, time stamping, Distributed Scheduling, Issues in Load Distributing, Components for Load
Distributing Algorithms, Different Types of Load Distributing Algorithms, Task Migration and
its issues
Distributed Multimedia & security techniques Distributed Multimedia, Characteristics of
multimedia Data, Quality of Service Managements, Security techniques, cryptographic
V
Algorithms, use of digital signature methods for security enhancement, Case Study of Distributed
System, Amoeba, Mach, Chorus. Protection and security in distributed systems
TEXT BOOK:
1. Distributed Systems Concepts and Design by George Coulouris, Jean Dollimore and Tim
KindBErg, Pearson Education.
2. Sinha, Distributed Operating System Concept & Design, PHI
REFERENCES
1. Singhal & Shivratari, Advance Concept in Operating System, McGraw Hill
2. Attiya & Welch, Distributed Computing, Wiley Pub.
3. Tanenbaum, Andrew.S. , Distributed Operation System, PHI
4. Distributed systems and networks by Buchanan
Syllabus
Subject
Code
Digital Image Externals Internals Total
L T
Processing & CS (70) (30) (100)
Multimedia 7202 Min: 28 Min: 40
3 1 Min: Nil
(Elective II) (D Grade) (D Grade)


Introduction Digital Image Processing, Applications, Image Processing Operations, Parts of
I Digital Image Processing Systems, Image Sampling and Quantization, Neighbors, Connectivity,
Distance Measures BEtween pixels, Linear and Non Linear Operations
Image Transformations Introduction to Gray Level Transformations, Histogram Processing,
Enhancement Using Arithmetic and Logic operations, Introduction to Spatial Filters, Types,
II Techniques, Introduction to Fourier Transform and the frequency Domain, Image Enhancements
in Frequency Domain, Frequency Domain Filters, Types, Techniques and Image Restoration
Image Degradation & Restoration Introduction to Image Degradation, Image Restoration,

Restoration and Degradation Models, Noise Models, Restoration and Degradation by Filtering,
III
Estimation of Degradation Function and various Filtering Techniques and Geometric
Transformations
Image Compression and Segmentation Introduction to Image Compression, Codings,
IV Interpixel and Psychovisual Redundancy, Introduction to Image Segmentation, Edge linking and
boundary detection, Thresholding and Types of Segmentation
Multimedia Introduction to multimedia, system architechture & technologies , Objects for
multimedia systems, Multimedia interface standards , data and file format standards, RTF, TIFF ,
V RIFF , MIDI , JPEG, MPEG,Multimedia communication protocols (UDP , RTP , RTCP , XTP ,
TELNET, IP Multicast etc), Multimedia Applications, VRML(Virtual reality modeling
language), Streaming, Hypermedia and its applications
TEXT BOOK:
1. Digital Image Processing by Gonzalez & Wood

2. Multimedia: Computing , communications and applications by Ralf Steinmetz and Kalra
Narhrstedt (Pearson Publication).
REFERENCES
1. Digital Image Processing by A.K.Jain

2. Multimedia system Design by Prabhat K Andleigh and Kiran Thakrar(PHI Publications).
3. Multimedia Communications by Fred Halsall(Pearson Publications).

Syllabus
Subject
Code
Object Oriented Externals Internals Total
L T
Analysis & CS (70) (30) (100)
Design 7203 Min: 28 Min: 40
3 1 Min: Nil
(Elective II) (D Grade) (D Grade)


Introduction to Object Orientation, Characteristics, Introduction to Object and Class,
Encapsulation and Abstraction, Data Hiding, Static and Dynamic Binding, Introduction to
I
Association, Specialization and Generalization, Aggregation, Object Interaction and Message
Passing, Access Specifiers, Inheritance and Polymorphism, Multiple Inheritance and Packages
Introduction to Object Modeling Techniques, Object Meta modeling, Metadata and Meta models,
II Functional Modeling, Pseudo code, ONN Constructs, Introduction to Object Diagrams, Data
Flow Diagrams and State Diagrams
Introduction to Software Development, Phases of Software Development, Software Models,
III Object Oriented Analysis, Object Model, Data Dictionary, Dynamic Model, Functional Model,
Object Oriented Analysis Techniques and its Classification
System Design, Devising an Architecture, Database Management Paradigm, Object Identity,
Object Oriented Designing, Object Oriented Design Techniques and its Classification,
IV
Introduction to Detailed Design, Object Model Transformations, Elaborating the Object Model,
Elaborating the Functional Model and Evaluating the Quality of a Design Model
Introduction to Unified Modeling Language (UML), Class diagram, sequence diagram Use case
diagram, Collaboration, diagram, state diagram, chart diagram, Activity diagram, component
V
diagram, deployment diagram, Introduction to Object Oriented Database, the architecture of
object oriented database and query language for Object Oriented database
TEXT BOOK:
1. Satzinger, Jackson and Burd, Object oriented Analysis and design with the Unified Process,
CENGAGE Learning.
2. Michael Blaha and J. Rumbugh, Object oriented Modeling and design with UML, Pearson
Education
3. ODocherty, Object Oriented Analysis and Design Understanding, System Development with
UML2.0, Wiley India.
REFERENCES
1. Object-Oriented Modeling and Design by Michael Blaha / William Premerlani, Prentice Hall. B
2. Object oriented analysis and Design by G.Sudha Sadasivam, Macmillan Publishers
3. Daminni Grover, Object Oriented Analysis & Design with UML, IK Publications

Syllabus

PROGRAMME: B. TECH. (CSE) SEM: VIII
Subject
Code
Web L T
(70) (30) (100)
Engineering CS 801
Min: 28 Min: 40
with PHP 3 1 Min: Nil
(D Grade) (D Grade)


Web Engineering: History of web Development, Evolution and Need, Categories, Web
Engineering Models, Web Applications: Characteristics of Web Applications, Software
Engineering v/s Web Engineering, World Wide Web, Introduction to TCP/IP and WAP, DNS,
I
Email, Tel Net, HTTP and FTP, Introduction to Browser and search engines, Working of the
search engines, Introduction to Web Servers, Features of web servers, IIS, Apache and
Configuring web servers
Information Architecture The role of the Information Architect, Collaboration and
Communication, Organizing Information, Organizational Challenges, Organizing Web sites
parameters and Creating Cohesive Websites, Website Development, Website Design issues,
II
Conceptual Design, High-Level Design, Navigation Systems, Searching Systems, Good & bad
web design, Process of Web Publishing, Phases of Web Site development, enhancing your web-
site and submission of website to search engines
Web Security Web security issues, security audit of websites, Web Security , Encryption
schemes, Secure Web document, Digital Signatures and Firewalls, CyBTr crime and laws, IT
Act, Web effort estimation, Productivity, Measurement, Quality usability and reliability,
III
Requirements Engineering for Web Applications, Introduction, Fundamentals, Requirement
Source, Type, ,Notations Tools, Principles, Requirements Engineering Activities and Adapting
RE Methods to Web Application
E Commerce E- Commerce, E-commerce Business Models, The Internet and World Wide Web,
E-commerce Infrastructure, Building an E-commerce Web Site , Electronic Commerce
environment and opportunities, Modes of Electronic Commerce, Approaches to safe Electronic
IV Commerce, Electronic Cash and Electronic Payment Schemes , Online Security and Payment
Systems, Ecommerce Marketing Concepts, Advertising on the Internet, Ecommerce Marketing
Concepts, Electronic Publishing issues, approaches, legalities and technologies ,Privacy and
Security
PHP Introduction to PHP, Syntax, Basic Programming, include(), require(), Introduction to
Forms, Developing Static & Dynamic Web Pages, GET Method, POST Method, mail(),
V
Database Connectivity with MySQL, Crating Web Applications in PHP and Introduction to
Content Management System
TEXT BOOKS:
1. Web Engineering by Pressman
2. Web Programming : Building Internet Applications by Chris Bates
3. Web Technologies by Atul Kahate
REFERENCES
1. Internet & World Wide Web How to Program by Dietal & Dietal
2. Complete Reference PHP by Steven Holzner

Syllabus
Subject
Code
Web P
(30) (20) (50)
Engineering CS 801
Min: 12 Min: 20
with PHP 2 Min: Nil
(D Grade) (D Grade)

List of PRACTICALS:
1. Study of Configuration of Web Servers

2. Study of PHP for Deigning and Development of Web Applications
3. Implementation of include() and require() in PHP
4. Implementation of GET Method and POST Method in PHP
5. Study of mail() in PHP
6. Implementing a Database Application in PHP
7. Study of Content Management System
8. Design Web Page using XML
9. Design Web Page using Java Script
10. Design Web Page using Servlets

Syllabus

Subject
Code
L T
Cloud computing (70) (30) (100)
CS 802
Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


UNDERSTANDING CLOUD COMPUTING Cloud Computing, History of Cloud Computing,
I Cloud Architecture, Cloud Storage, Why Cloud Computing Matters, Advantages of Cloud
Computing, Disadvantages of Cloud Computing and Cloud Computing Services
DEVELOPING CLOUD SERVICES Web-Based Application, Pros and Cons of Cloud Service
Development, Types of Cloud Service Development, Software as a Service, Platform as a
II
Service, Web Services, On-Demand Computing, Discovering Cloud Services Development
Services and Tools
CLOUD COMPUTING FOR EVERYONE Centralizing Email Communications,
Collaborating on Schedules, Collaborating on To-Do Lists, Collaborating Contact Lists, Cloud
III
Computing for the Community, Collaborating on Group Projects and Events, Cloud Computing
for the Corporation
USING CLOUD SERVICES Collaborating on Calendars, Schedules and Task Management,
Exploring Online Scheduling Applications, Exploring Online Planning and Task Management,
IV Collaborating on Event Management, Collaborating on Contact Management, Collaborating on
Project Management, Collaborating on Word Processing, Collaborating on Databases, Storing
and Sharing Files
OTHER WAYS TO COLLABORATE ONLINE Collaborating via Web-Based
V Communication Tools, Evaluating Web Mail Services, Evaluating Web Conference Tools,
Collaborating via Social Networks and Groupware
TEXT BOOKS:
1. Michael Miller, Cloud Computing: Web-Based Applications That Change the Way You Work
and collaborate Online, Que Publishing, August 2008.
2. Padam Gulwani and Anshuman Sharma Information Storage and Management, SCITECH
Publications
REFERENCES
1. Haley BEard, Cloud Computing BEst Practices for Managing and Measuring Processes for On-
demand Computing, Applications and Data Centers in the Cloud with SLAs, Emereo Pty Limited,
July 2008.
2. Gautam Shroff, Enterprse Cloud Computing:Technology,Architecture,Application, Cambridge
University Press,New Delhi

Syllabus

Subject
Code
L T
Pattern (70) (30) (100)
CS 803
Recognition Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


Introduction: Basics of pattern recognition, Design principles of pattern recognition system,
Learning and adaptation, Pattern recognition approaches, Mathematical foundations Linear
I
algebra, Probability Theory, Expectation, mean and covariance, Normal distribution, multivariate
normal densities, Chi squared test.
Statistical Patten Recognition: Bayesian Decision Theory, Classifiers, Normal density and
II
discriminate functions
Parameter estimation methods: Maximum-Likelihood estimation, Bayesian Parameter
estimation, Dimension reduction methods - Principal Component Analysis (PCA), Fisher Linear
III
discriminant analysis, Expectation-maximization (EM), Hidden Markov Models (HMM),
Gaussian mixture models
Nonparametric Techniques: Density Estimation, Parzen Windows, K-Nearest Neighbor
IV
Estimation, Nearest Neighbor Rule, Fuzzy classification
Unsupervised Learning & Clustering: Criterion functions for clustering, Clustering
V Techniques:Iterative square - error partitional clustering K means, agglomerative hierarchical
clustering, Cluster validation
TEXT BOOKS:
1. R.O.Duda, P.E.Hart and D.G.Stork, Pattern Classification, John Wiley, 2001

2. Pattern recognition & Image Processing : Earl Gose
REFERENCES
1. C.M.Bishop, Pattern Recognition and Machine Learning, Springer, 2006

2. S.Theodoridis and K.Koutroumbas, Pattern Recognition, 4th Ed., Academic Press, 2009

Syllabus
Subject
Code
P
Pattern (30) (20) (50)
CS 803
Recognition Min: 12 Min: 20
2 Min: Nil
(D Grade) (D Grade)

List of Practicals:
1. Programs of Bayes Classifier.

2. Programs of Decision Trees.
3. Programs of Clustering.
4. Different approaches to Feature Selection.
5. Different Paradigms of Pattern Recognition.

Syllabus

Subject
Code
DATA Externals Internals Total
L T
WAREHOUSING (70) (30) (100)
CS 8301
AND MINING Min: 28 Min: 40
(Elective III) 3 1 Min: Nil
(D Grade) (D Grade)


Data Warehousing: Need for data warehousing, Basic elements of data warehousing, Data
I Mart, Data Warehouse Architecture, extract and load Process, Clean and Transform data, Star,
Snowflake and Galaxy Schemas for Multidimensional databases, Fact and dimension data
Data Warehouse and OLAP technology Multidimensional data models and different OLAP
II Operations, OLAP Server: ROLAP, MOLAP, Data Warehouse implementation, Efficient
Computation of Data CuBEs, Processing of OLAP queries, indexing data
Data Mining: Data Mining: Definitions, KDD v/s Data Mining, DBMS v/s Data Mining , DM
techniques, Mining problems, Issues and Challenges in DM, DM Application areas, Association
Rules & Clustering Techniques: Introduction, Various association algorithms like A Priori,
III
Partition, Pincer search etc., Generalized association rules, Clustering paradigms; Partitioning
algorithms like K-Medioid, CLARA, and CLARANS; Hierarchical clustering, DBSCAN,
BIRCH, CURE; categorical clustering algorithms, STIRR, ROCK and CACTUS
Web Mining: Web Mining, Web content mining, Web structure Mining, Web Usage Mining,
Application of Neural Network, AI, Fuzzy logic and Genetic algorithm, Decision tree in DM,
IV Temporal and spatial DM: Temporal association rules, Sequence Mining, GSP, SPADE, SPIRIT,
and WUM algorithms, Episode Discovery, Event prediction, Time series analysis, Spatial
Mining, Spatial Mining tasks, Spatial clustering and Spatial Trends
Data Mining of Image and Video: Image and Video representation techniques, feature
V extraction, motion analysis, content based image and video retrieval, clustering and association
paradigm, knowledge discovery
TEXT BOOK:
1. Data Mining Techniques by Arun K. Pujari, Pearson Publications

2. Data Mining by Han & KamBEr, Morgan Kauffman Publications
3. Data Mining by Adriaans, Oxford University Press
REFERENCES
1. Data Mining by Dunham, Prentice Hall Publications

2. Data Warehousing and Mining by Vishwanathan, Scitech Publication PVT.LTD. Chennai

Syllabus

Subject
Code
Fault Tolerant & L T
(70) (30) (100)
Real Time Systems CS 8302
(Elective III) Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


Basic concepts in real time-time systems, systems and signals, reactive system, definitions of
real-time systems, event-driven and discrete-event systems, EmBEdded systems, Control
I systems, concurrent systems, distributed systems, fault tolerant systems & reliability, safety-
critical systems, internal structure of real time systems, performance measures, examples of real
time systems & real world applications modeling real time systems
Real time kernels & programming languages, multi-tasking, resource sharing. inter-task
communication & synchronization, priorities, drivers, scheduling, criteria for programming
II
languages, CONIC,PAISELY,RT-LINUX,WINDOWS CE, Vx works, RTx-DOS,QNX.
Synchronous programming languages basic concepts, Sync Charts, SIGNAL,ARGOS
Real-time computer hardware & process interfacing, central processing unit, Micro-controllers
III ,memories, specialized processors, bus structures, digital signal interfacing, , Real time clock &
timer, Interrupts, direct memory access, serial & parallel interfaces ,pipelining, coprocessors
Selection of programming languages:- machine and assembly languages, limitations of assembly
language, high level languages, advantages and disadvantages of high level languages, real time
IV languages, Integrated assembly language components:- Processor background information
required, Subroutine calls and returns, subroutine parameters, linking high and low level
programs, computer interrupt system
Fault tolerant real time systems, basic concepts, causes of failures, types of failures, fault
V detection, fault recovery, Concept of fault tolerant in a system, different characteristics and
features of fault tolerant systems, redundancy, Byzantine failure
TEXT BOOKS:
1. C. Shaw, Real Time Systems and Software, Wiley, 2001
2. R. BEnnett, Real- Time Computer Control, Prentice- Hall, 1994
REFERENCES
1. J.E. Cooling, Real-Time Software Systems, International Thompson Computer Press, 1997

Syllabus

Subject
Code
Fuzzy Logic and Externals Internals Total
L T
Genetic (70) (30) (100)
CS 8303
(Elective III) 3 1 Min: Nil
(D Grade) (D Grade)


Introduction to Fuzzy sets,Fuzzy set theory Vs Probability Theory, memBErship. Classical sets
and Fuzzy sets, Operations, Properties. Classical relations and Fuzzy relations, Operations of
I
Fuzzy relation , Crisp and Fuzzy relations, Tolerance and Equivalence relations, Cosine
amplitude method, Max-Min method
Fuzzy MemBErship functions, Features, Various forms, Fuzzification, MemBErship value
II
assignments, Intuition, Inference, Rank ordering, Inductive reasoning
Defuzzification to Crisp sets, Lambda-Cuts for Fuzzy sets and relations, Defuzzification
III methods.Classical Logic and Fuzzy Logic. Fuzzy systems, Natural language, Linguistic hedges.
Fuzzy rule-basedsystems, Graphical techniques of inference
Applications, Fuzzy Controllers (overview & example), Fuzzy Systems and Neural Networks,
IV Fuzzy Neural Networks, Fuzzy Clustering, Fuzzy Pattern Recognition, Fuzzy Image Processing,
Fuzzy Databases and Information retrieval systems
Introduction to Genetic Algorithm, Genetic Operators and Parameters, Genetic Algorithms in
Problem Solving, Theoretical Foundations of Genetic Algorithms, Implementation Issues.
V
Genetic Algorithm based Internet search technique, Hybrid systems , neuro-genetic and fuzzy-
genetic hybrids
TEXT BOOKS:
Fudamental of soft computing and intelligent system-Padam Gulwani,Anshuman Sharma,IK
Internation Publication,2012
REFERENCES
Fuzzy Logic with Engineering Applications T. J.Ross, Wiley India.

Syllabus

Subject
Code
OPERATIONS L T
(70) (30) (100)
RESEARCH CS-8401
(Elective IV) Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


Introduction to Linear Programming: Solution by Graphical and Simplex Method, Concept of
Degeneracy and Duality, Artificial Variable Techniques : Big-M Method, Two Phase Method ,
I
Solution of Transportation Problems by North-West Corner Method, Lowest Cost Entry Method,
Vogels Method, Non-Degenerate Basic Feasible Solution, Assignment Model
Integer Programming: Relationship to Linear Programming, Branch and Bound, Cutting Plane
II Techniques: General Cutting Planes, Dynamic Programming: Introduction, BEllmans Principle
of optimality, Applications of dynamic programming, Critical Path Method, PERT
Replacement: Introduction, Replacement of items that deteriorate with time when money value is
not counted and counted, Replacement of items that fail completely, group replacement. Games
Theory: Introduction, Minimax (maximin), Criterion and optimal strategy, Solution of games
III
with saddle points,
Rectangular games without saddle points, 2 X 2 games, dominance principle m X 2 & 2 X n
games
Dynamic Programming: Simulation And Decision Theory, Dynamic Programming (DP)
Deterministic Cases-Maximising and Minimising problems. DP techniques for LP problems.
IV
Decision making under risk Decision trees Decision making under uncertainty, Application
of simulation techniques for decision making
Waiting Lines: Introduction, Single Channel, Poisson arrivals, exponential service times with
infinite population and finite population models, Multi channel, Poisson arrivals, exponential
V service times with infinite population single channel Poisson arrivals: (M/M/1 : /FCFS), (M/M/1
: N/FCFS),
(M/Ek/1 : /FCFS), (M/M/S: /FCFS)
TEXT BOOKS:
1. J.K.Sharma ,Operations Research, Macmillan Publishers India LTD.
2. Ravindran , Operation Research: Principles and practice, Wiley India , 2ed.
3. S.D.Sharma-Kedar Nath Ramnath & Co, Operations Research
REFERENCES:
1. Heera & Gupta, Operations Research S Chand Publications

2. Sudhansu Rajoria Operation Research: Kamal Prakashan,Indore

Syllabus

Subject
Code
High Performance L T
(70) (30) (100)
Computing CS 8402
(Elective IV) Min: 28 Min:40
3 1 Min: Nil
(D Grade) (D Grade)


Introduction to high performance computing: Aim, Architectures, Cluster, Grid, Meta-computing
Middle ware, Examples of representative applications. Programming models: Parallel
I
programming paradigms, task partitioning and mapping, shared memory, message passing, peer-
to-peer, broker-based. Introduction to PVM and MPI
Architecture of cluster-based systems: Issues in cluster design: performance, single-system-
image, fault tolerance, manageability, programmability, load balancing, security, storage. High
II
performance sequential computing: Effects of the memory hierarchy, Out-of-order execution,
superscalar processors, Vector processing
Shared-memory processing: Architectures (extensions of the memory hierarchy), Programming
III paradigms, Open MP. Distributed-memory processing: Architectural issues (networks and
interconnects), Programming paradigms,MPI (+MPI2)
Grids:Computational grids,Data grids,Architecture of Grid systems,Grid security infrastructure,
IV Examples of Grids:Globus.The productivity crisis & future directions: Development overheads,
Petaflops programming, New parallel languages: UPC, Titanium, Co-Array FORTRAN
Performance Issues and Techniques:Cost and Frequency Models for I/O, paging, and
caching.Notion of Cacheing; temporal and spatial locality models for instruction and data
V accesses; Intra-process parallelism and pipelining.Typical Compiler Optimizations of Programs;
Improving Performance: Identifying program bottlenecks - profiling, tracing; simple high-level-
language optimizations - locality enhancement, memory disambiguation, moving loop-invariants
TEXT BOOKS:
1. Charles Severance, Kevin Dowd, Oreilly, High Performance Computing, Second Edition July
1998
2. David j. Kuck, High Performance Computing, Oxford Univ Pr, 1996
REFERENCES:
1. Gary W. Sabot, High Performance Computing , Addison-Wesley, 1995

2. Dowd K, High Performance Computing, O' Reilly Series, 1993.
3. R.E. Bryant and D. O'Hallaron, Computer Systems:A Programer's Perspective, Pearson
Education, 2003.

Syllabus

Subject
Code
Human Computer L T
(70) (30) (100)
Interaction CS 8403
(Elective IV) Min: 28 Min: 40
3 1 Min: Nil
(D Grade) (D Grade)


IIntroduction: Importance of user Interface definition, importance of good design. BEnefits
of good design. A brief history of Screen design, The graphical user interface popularity of
I
graphics, the concept of direct manipulation, graphical system, Characteristics, Web user
Interface popularity, characteristics- Principles of user interface
Design process Human interaction with computers, importance of human Characteristics
II human consideration, Human interaction speeds, understanding business
Junctions
Screen Designing:- Design goals Screen planning and purpose, organizing screen elements,
ordering of screen data and content screen navigation and flow Visually pleasing composition
III amount of information focus and emphasis presentation information simply and
meaningfully information retrieval on web statistical graphics Technological consideration in
interface design
Windows New and Navigation schemes selection of window, selection of devices based and
IV screen based controls.
Components text and messages, Icons and increases Multimedia, colors, uses Problems,
V
choosing colors. Software tools Specification methods, interface Building Tools
TEXT BOOKS:
1. Human Computer Interaction. Alan Dix, Janet Fincay, Gre Goryd, Abowd, Russell BEalg,
Pearson Education
2. The essential guide to user interface design, WilBErt O Galitz, Wiley DreamTech.
REFERENCE:
1. The essential guide to user interface design, WilBErt O Galitz, Wiley DreamTech. Publications
2. Designing the user interface. 3rd Edition BEn Shneidermann , Pearson Education Asia
3. Interaction Design Prece, Rogers, Sharps. Wiley Dreamtech Publications
4. User Interface Design, Soren Lauesen , Pearson Education.

B.tech CSE Syllabus

Diunggah oleh

Informasi Dokumen

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

B.tech CSE Syllabus

Diunggah oleh

Hak Cipta:

Format Tersedia

Syllabus

PEOPLES UNIVERSITY, BHOPAL

PROGRAMME: B. Tech. (CSE) SEM: III

Duration of Theory (Externals): 3 Hours

Theory Internal - Max Marks: 30

Unit Contents (Theory)

1. D.C. Aggarwal Engg. Mathematics 2

1. Advanced Engineering Mathematics by Erwin Kreyszig, Wiley India

Peoples College of Research & Technology 1

PEOPLES UNIVERSITY, BHOPAL

Peoples College of Research & Technology 2

Practical Internal - Max Marks: 20

1. Write a program to show Array in C

Peoples College of Research & Technology 3

PEOPLES UNIVERSITY, BHOPAL

Duration of Theory (Externals): 3 Hours

Theory Internal - Max Marks: 30

Unit Contents (Theory)

1. M. Mano; "Digital Logic & Computer Design"; PHI.

1. S.S. Bhatti & Rahul Malhotra, Digital Electronics, IK Publications

Peoples College of Research & Technology 4

Practical Internal - Max Marks: 20

1. Study & Test of Operation of Basic Logic Gates

Peoples College of Research & Technology 5

PEOPLES UNIVERSITY, BHOPAL

Duration of Theory (Externals): 3 Hours

Theory Internal - Max Marks: 30

Unit Contents (Theory)

1..Object Oriented programming with C++, E. Balaguruswamy, TMH, 2001

1. Object Oriented Design and Modelling, Rambaugh James etal,PHI-1997

Peoples College of Research & Technology 6

Practical Internal - Max Marks: 20

Peoples College of Research & Technology 7

PEOPLES UNIVERSITY, BHOPAL

Duration of Theory (Externals): 3 Hours

Unit Contents (Theory)

Peoples College of Research & Technology 8

Practical Internal - Max Marks: 20

1. Study of Internet and its Services

Peoples College of Research & Technology 9

PEOPLES UNIVERSITY, BHOPAL

REFERENCES 1) ERIC NAGLER Learning C++ JAICO Pub.

Peoples College of Research & Technology 10

PEOPLES UNIVERSITY, BHOPAL

PROGRAMME: B. Tech. (CSE) SEM: IV

Duration of Theory (Externals): 3 Hours

Theory Internal - Max Marks: 30

Unit Contents (Theory)

1. Higher Engineering Methematics by B.S. Grewal,Khanna Publications

1. Numerical Methods using Matlab by J.H.Mathews and K.D.Fink, P.H.I.

Peoples College of Research & Technology 11

PEOPLES UNIVERSITY, BHOPAL

Theory Internal - Max Marks: 30

Unit Contents (Theory)

1. Morris Mano: Computer System Architecture, PHI.

1. Gaonkar: Microprocessor Architecture, Programming, Applications with 8085; Penram Int.

Peoples College of Research & Technology 12

Practical Internal - Max Marks: 20

1. Program in Assembly Language for Addition and Subtraction of 2 NumBErs.

Peoples College of Research & Technology 13

PEOPLES UNIVERSITY, BHOPAL

Theory Internal - Max Marks: 30

Unit Contents (Theory)

1. Horowitz & Sahani; Analysis & Design of Algorithm