Anda di halaman 1dari 54

Course Contents

Category of Course Title Course Code Credits-4C Theory Papers


Course (ES)
Information Computer CS 3303/ L T P Max.Marks-100
Technology Programming -III CS306 0 0 4 Min.Marks-35
IT-3 Duration-3hrs.

Branch: Computer Science and Engineering III Semester


Course: CS 3303/CS306 Computer Programming-III
SECTION A: VISUAL C++
Unit I
Visual C++ Basics
Introduction, Building a Basic Application, Using Microsoft Foundation Class (MFC) Library, Visual
C++ resources: Application Wizard, Accelerators and Menus, Toolbars.
Unit II
Visual C++ and Database Management
Data Access Objects (DAO) versus Open Database Connectivity (ODBC), Database Building Overview,
Building a Database Application Using ODBC, Building a Database Application Using DAO.
Unit III
Visual C++ and the Internet
Designing a Web Page, An Overview of JavaScript, Creating and ActiveX Control, Creating an ActiveX
Document Application, Using URLs and Monikers, Working with Internet Information Server (IIS),
Designing with Security in Mind, Building a Help File, Packaging Your Application.

SECTION B: VISUAL BASIC


Unit IV
Introduction
Creating First VB Application, Adding Controls, Activation Controls, Creating Menus, VB Program
Structure, Handling Data, Fundamental Expressions, Working with Interactive Keyboard and Screen
110, Adding Loops, Using Arrays, Procedures.
Unit V
Intermediate VB Programming
VB Forms, Dialog Boxes, Additional Controls, Printing with VB, Understanding Objects and Using
Object Browser, Accessing Files, Adding OLE to a Program.
Unit VI
Adding Power to VB Programs
Using Graphics and Multimedia, Using Form Template, Accessing Database, Using Keyboard and
Mouse I/0, Building Help Subsystem, Using ActiveX, Adding Internet Access to the Applications.
Unit VII
Building a Professional Application
Developing and Designing Forms, Adding the Controls, Integrating Code, Debugging and Testing,
Packaging Your Application.

Suggested List of Experiment:


Programs based on each unit in Section A (Visual C++) and Section B (Visual Basic). Atleast 8 programs in
Visual C++ and Visual Basic each.

Reference Books:
1) Visual C++: John Paul Mueller 1997, Tata McGraw Hill Edition.
2) Programming with C++ : Hitesh Sanghavi, Vikas Publishing.
3) Visual Basic 5: The Comprehensive Guide - Mansfield, Galgotia Pub.
Course Contents
Category of Course Title Course Code Credit-6C Theory Papers
Course (ES)
Engineering Electronics CS 3405/ L T P Max.Marks-
Science ES-5 CS304 100
3 1 2 Min.Marks-35
Duration-3hrs.
Branch: Computer Science III Semester
Course: CS 3405/CS304 Electronics

Unit I
Semiconductor device, theory of P-N junction, temperature dependence and break down characteristics,
junction capacitances. Zener diode, Varactor diode, PIN diode, LED, Photo diode. Transistors BJT,
FET, MOSFET, types, working principal, characteristics, and region of operation, load line biasing
method. Transistor as an amplifier,gain, bandwidth, frequency response, h- parameters equivalent ,type
of amplifier.

Unit II
Feedback amplifier, negative feedback, voltage-series, voltage shunt ,current series and current shunt
feedback , Sinusoidal oscillators, L-C (Hartley-Colpitts) oscillators, RC phace shift, Wien bridge, and
Crystal oscillators. Power amplifiers, class A, class B , class A B, C amplifiers , their efficiency and
power Dissipation.

Unit III
Switching characteristics of diode and transistor,turn ON, OFF time, reverse recovery time , transistor as
switch , Multivibrators, Bistable, Monostable, Astable multivibarators. Cllipers and clampers,
Differential amplifier, calculation of differential , common mode gain and CMRR using h-parameters,
Darlington pair , Boot strapping technique. Cascade and cascode amplifier.

Unit IV
Operational amplifier characteristics, slew rate , full power bandwidth, offset voltage ,bais current,
application ,inverting , non inverting amplifier , summer , averager , differentiator, integrator,
differential amplifier , instrumentation amplifier , log and antilog amplifier , voltage to current and
current to voltage converters , comparators Schmitt trigger , active filters, 555 timer and its
application.

Unit V
Introduction to thyristor family , silicon controlled rectifier (SCR),V-I characteristics, turn ON and
OFF mechanism, series and parallel connection of SCR, single phase controlled rectifier with resistive
and inductive load , freewheel diode , circuits for gate triggering , solid state firing circuits using UJTs
and transistors , introduction to converters ,inverters and chopper circuits . Introduction to GTO, Power
MOSFET and IGPT. Regulated power supplies.
Suggested List of Experiments
1. Differential amplifier
2. Power and application related experiments
3. SCR
4. 555 Times of its applications
5. V/F, F/V converter
6. Single phase and three phase controlled rectifier
Suggested further readings
1. Milliman Halleias - Integrated Electronics
2. OP-amp-Gayakwad
3. Power Electronics – Rushid
4. Integrated electronics by Miliman Grabel.
5. Rulsi digital and Switching by Miliman Taub Wave Shapes.
6. OP amp by Tobbery etal.
7. Semiconductor Power Electronics Circuits & Devices, Vol. I & II by Pauddar.
Course Contents
Category of Course Title Course Code Credits-4C Theory
Course Papers (ES)
Humanities Energy Ecology CS 3102/ L T P Max.Marks-100
science HS-2 Environ. & CS302 3 1 0 Min.Marks-35
Society Duration-3hrs.

Branch: Computer Science III Semester


Course: CS 31O2/CS302 Energy, Ecology, Environment & Society

Unit I
Introduction of energy scenario, Conventional and non-conventional resources of energy, utility and
waste management of thermal, hydral energy. General idea of solar, Wind, Bio-mass, Geothermal, Tidal
and Wave energy, Sources and waste management of nuclear power energy. Electromagnetic energy,
radio frequency and microwaves, its biological effects.
Unit II
Global warming, depletion of ozone layer, human activity and meteorology, Genetic and plant bio-
diversity, EL-Nino phenomenon and its effects. Solid waste, waste disposal methods, recycling of solid
waste and its management.
Unit III
Atmosphere - introduction, Structure of the atmosphere, Chemical and Photochemical reactions in the
atmosphere, primary air pollutants - Sources, control and harmful effects of CO, NOx, S0x, HC,
particulars, sampling techniques, Air pollution from automobiles, Photochemical smog, Acid rain some
case studies of air pollution.
Unit IV
Hydrosphere - Aquatic environment, organic and inorganic water pollutants, Domestic and Industrial
waste water treatment, -Aerobic and anaerobic treatment processes, sampling and preservation, some
case studies of water pollution.
Unit V
Lithosphere and Noise Pollution - Introduction of Land and Soil pollution, Control and disposal, harmful
effects. General introduction of noise pollution and its effects. Sound unwanted form of noise, changes,
and Traffic noise. Prediction and control.

Reference Books:
1 Environmental Engineering-Howand S. Peavy, Rowe, McGraw Hill.
2 Environmental Protection - Emil T. Chanlett.
3 Environmental Chemistry - A.K. Dey. Wiley Eastern Ltd.
4 Environmental Science - Cumingham, Saigo, McGraw Hill.
5 Ecology Concepts and Application - Manuel C. Mmoller, Jr. - McGraw Hill.
6 Environmental Chemistry and Pollution Control - S. S. Dara, S. Chand & co. Ltd.
7. Environmental Studies-Erach Bharucha. University Grants Commission
Course Contents
Category of Course Title Course Code Credits-4C Theory Papers
Course (ES)
Basic Sciences Mathematics - III CS-3205/ L T P Max.Marks-100
BS-5 CS301 3 1 0 Min.Marks-35
Duration-3hrs.

Branch: Computer Science III semester


Course: CS 32O5/CS301 Mathematics – III

Unit I
Functions of Complex Variables:
Analytic functions, Harmonic Conjugate, Cauchy - Riemann Equations, Line integral, Cauchy's
theorem, Cauchy's Integral formula, Singular points, Poles and Residues, Residue theorem, Evaluation
of Real Integral, Bilinear Transformation.
Unit II
Numerical Analysis:
Difference operators, Errors and Approximations, Interpolation, Inverse interpolation, Numerical
differentiation, Numerical Integration by using Simpson’s method, Weddel’s rule and Gauss legendre
open quadrature formula.
Unit III
Solutions of algebraic and transcendental equations( Regula False, Newton-Rephson, Iterative, Graffe’s
root squaring methods), Solutions of simultaneous algebraic equations, Solutions of ordinary differential
equations ( Toyler’s Series, Picard’s Method, Modified Euler’s method, Runge Kutta Method, Predictor-
Corrector Method), Solution of Partial differential equation.
Unit IV
Linear Algebra:
Simultaneous linear equations, Vector space and subspaces, Bases and dimension, Linear
transformations and their matrix representations, Change of basis.
Unit V
Diagonalizable operators, Quadratic forms and their diagonalization, Canonical form, Bilinear,
Hermitian forms, Definite and semi definite forms.

Reference Books:
Engineering Maths Part II & III, D.S. Chandrasekharaiah, Prism Books Pvt. Ltd., 1999.
Advanced Engineering Mathematics, E. Kveyszig - Wiley Eastern Limited.
Numerical Analysis by Ralph J.Stanton.
Engineering Mathematics by Lazpa thory.
Engineering Mathematics by Dr. D.V.S. Kushwah. Shivani Publications. Gwalior
COURSE CONTENTS
Category of Course Title Course Credits-6C Theory Papers
Course Code (ES)
Departmental Network CS 3503/ L T P Max.Marks-100
Core – Analysis CS303 3 1 2 Min.Marks-35
DC -3 Duration-3hrs.

Branch: Computer Science Engineering: III Semester


Course: CS 3503/ CS303 Network Analysis

Unit I
Introduction to LLBP circuit elements R,L,C and their characteristics in terms of Linearity & time
dependant nature, KCL and KVL analysis dual networks analysis of magnetically coupled circuits Dot
convention, coupling co-efficient, Tuned circuits. Series & parallel resonance voltage & current sources,
controlled sources.

Unit II
Network topology, concept of Network graph, Tree, Tree branch & link, Incidence matrix, cut set and
tie set matrices.
Network Theorems – Thevenins & Norton’s theorem, see preposition reciprocity, compensation,
maximum power transfer and millmanis theorem, problems with controlled sources.

Unit III
Transient analysis Transients in RL, RC& RLC Circuits initial conditions, time constants. Network
driven by constant driving sources & their solutions.
Steady state analysis - Concept of phasor & vector, impealance & admittance. Node & mesh analysis of
RL,RC and RLC networks with sinvsoidal and other driving sources.

Unit IV
Frequency domain analysis – Laplace transform solution of Intefro differential equations. Transform of
Waveform – synthesized with step rarup, Gate and sinusoideal functions. Initial & final value theorem.
Network Theorems in transform domain.

Unit V
Concept of signal spectra, Fourier series co-efficient of a periodic waveform. Waveform symmetries.
Trigonometric and Exponential form of Fourier series, steady state response to periodic signals.

Unit VI
Network function & Two port networks – concept of complex frequency, port. Network functions of one
port & two ports, poles and geros network of different kinds.
Two port parameters – Z,Y, chain parameters relationship between parameters. Interconnection of two
ports. Terminated two port network.
References:
• M.E. Van Valkenburg, Network Analysis, (PHI)
• F.F.Kon, Network Analysis
Course Contents
Category of Course Title Course Credits-6C Theory Paper
Course Code (ES)
Departmental Object Oriented CS L T P Max. Marks-100
Course DC – II Programming 3502/ 3 1 2 Min.Marks-35
Methodology CS305 Duration-3hrs.

Branch: Computer Science III Semester


Course: CS 3502/CS305 Object Oriented Programming Methodology

Unit I
Objects, Objects as software modules, Objects interaction, Classes, Method lookup, Hierarchies of
classes, Inheritance, Polymorphism, Abstract classes.
Unit II
Identifying objects and classes, Representation of objects, Association between objects, aggregate
components of objects.
Unit III
Object oriented programming languages, Class declarations, Object declarations, Mandatory profiles,
Message sending, Association, Recursive association, Many to many association, Argument passing.
Unit IV
Inherited methods, Redefined methods, the protected interface, Abstract base classes, Public and
protected properties, Private operations, Disinheritance, Multiple inheritance.
Unit V
Study of C++ as object oriented programming language.

Suggested list of experiments:


Programming assignments may be given to students so that they can better understand the concepts of
object oriented programming such as objects, classes, inheritance, polymorphism etc.

Reference Books
1) Object oriented programming in C++ by Robert Lafore: Galgotia
2) Programming with C++ Made simple by K. Kumar , TMH 2002
3) Programming with C++ Made Simple by K. Kumar, TMH 2002
4) Mastering C++ by Venugopal, TMH
5) Object oriented programming in C++ : Subburaj Prentice Hall of India, New Delhi.
6) Object oriented programming in C++ Sarang Prentice Hall of India, New Delhi.
Course Contents
Category of Course Title Course Credits-6C Theory Paper
Course Code (ES)
Departmental Analog & CS 4503/ L T P Max. Marks-100
Core DC-3 Digital CS404 Min.Marks-35
3 1 2
Communication Duration-3hrs.

Branch: Computer Science & Technology IV Semester


Course: CS 4503/CS404 Analog & Digital Communication

Unit I
Signals and its Representation
Review of Fourier transform, Convention, Signal transmission though linear systems, signal distortion
in transmission, poley wiener criteria, Bandwidth and rise time, energy and power signals,
spectral density and persevalls theorem for energy of power signals, Hilbert transform representation
of bandpass signal.

Unit II
Linear Modulation
Definition, Necessity of modulation, Principle of amplitude modulation, Generation and detection of
AM, Side bands, The generation and detection of side bands, Comparison of various AM systems,
FDM, Synchronous detection.
Exponential Modulation
Definitions and relationship between PM and FM frequency deviation, Bessells function, spectrum and
transmission BW of FM signals, NBFM, VirBFM, phaser diagram of FM signal, multi tone FM,
Generation and detection of FM Non linear effects in FM systems, comparison of AM and FM systems,
TDM.

Unit III
Radio Transmitter and Receivers
Different types of AM and FM transmitters and receivers, AM and FM standard broadcast transmitter
and receivers, image rejection, mixer.
Noise
Classification and sources of noise, Noise calculations for single and cascaded stages, SNR, SNR in
DSB, SSB, VSB, AM and FM systems, pre-emphasis and De-emphasis Sampling theorem, quantization,
PCM, Companding intesymbol interface, Eye patterns, Delta modulation, Adaptive delta modulation,
DPCM, SIN performance of PCM and delta modulation, bandwidth of PCM and delta modulation.

Unit IV
ASK, BPSK, QPSK, M-ray PSK, DPSK, BFSK, M-ray FSK, Duobinary signalling baseband signal
receiver, Probability of error, Optimum filter, Matched filter, Coherent and non-coherent detection, bit
error rate.Random signals, random variables and processes, cumnlative distribution function,
probability density function, average value, variance, standard deviation moment and moment,]
generating function, characteristics function, Tchebycheffs inequality, Binary, Poisson and Gaussian
distributions, other distributions, central limit theorem.
Unit V
Unit of information, average information, joint and conditional entropy, mutual information, channel
capacity efficiency, BBS and BEC, Shannon's Theorem, Shannon-Hartely theorem, bandwidth - SIN
ratio trade-off. Coding separable codes, Prefix property, Coding efficiency, Source coding, Shannon -
Fano code, Huffman code, Error connection codes, FEC and ARQ, Hamming distance, Minimum
distance, Channel coding, Block code, Cyclic code, Convolutional code.

Suggested List of Experiments


• Study of amplitude modulation and determinations of modulation index. Design AM
generator and its implementation
• Design of AM detector and its implementation
• Study of FM
• Design of FM generator and its implementation
• Study of wave florin synthesizer
• Verification of sampling theorem
• Timq division multiplexing
• Study of PCM system-
• Study of DM system
• Study of ASK system
• Study of BPSK system
• Study of DPSK system
• Study of BFSK system
Suggested text
• Communication System S Hykinl
• Principle of Communication Taub Schilling
• Communication System B.P. Lathi
Course Contents
Category of Course Course Title Course Credits-4C
Code
Information Technology IT- Computer CS 4304/ L T P
IV Programming – IV/ CS406 0 0 4

Branch: Computer Science IV Semester


Course: CS 4304/CS406 Computer Programming – IV
(UNIX and LINUX)
SECTION A: UNIX
Unit I
UNIX Overview
UNIX Features, The Kernel The Shell
File System
Directory System, Login Directory, Inode-User Identification, Permission bits, File Sharing.
Unit II
Scheduling, Inter process Communication, Unix Signal, Pipes and Filters, Multithreaded Execution
Timers
Memory Management
Swapping in Real-Storage UNIX Systems, Address Mapping in a virtual Storage UNIX System Paging,
Swapping in Virtual Storage UNDC Systems, Dynamic Storage Allocation
Unit III
The Input/Output System
Devices, Descripters, I/O System calls, Non-Blocking I/0
Unit IV
Working with C-UNIX
System Calls and UNIX Library Functions, UNIX-C Interface,
Working with UNIX C Files and Graphics, UNIX Program
Development: cc, make, and Applications, UNIX Tools: grep, sed, tr. awk.
SECTION B: LINUX
Unit V
Installing Linux
Overview of Features, Linux’s Hardware Requirements, Partitioning Hard Drive, installing Linux,
installing Red hat, Running Linux Applications
System Administration
Understanding System Administration, Booting and Shutting Down, managing User Accounts,
Backing Up Data, System Security
Unit VI
Managing the File System managing end Upgrading the File, and Directory System
Working with Linux
Linux Shell Managing Multiple Processes, Using the VI Editor, Using the emacs Editor, Printing
Unit VII
Network Administration
Understanding TCP/IT Protocol Suite, Configuring a TCPIIP Network, Configuring Domain Name
Service, Using SLIP and PPP
Unit VIII
Using the Internet
Accessing the Network with telnet, ftp, and the r-commands Surfing the internet with Wide Web, Using
Electronic mail, Usenet News
Setting Up a Web Site
Working with Apache, managing an Internet Web Server
Suggested List of Experiments
Programs based on the topics given above. At least eight programs from each Section.
Suggested Books:
1. Advanced UNIX: A Programmers Guide – Stephen Prata, The Wait Group, Sams Pub.
2. Using Linux - The Most Complete Reference, 3rd Edition QUE Pub.Jack Tackett Jr. and David
Gunter
3. Linux: The Complete Reference: Retersen, TMH
4. Introduction to Unix & Linnx, Muster:TMH.
Course Contents
Category of Course Title Course Credits-5C Theory Paper
Course Code (ES)
Departmental Computer System CS 4506/ L T P Max. Marks-100
Core DC-6 Organization CS403 3 2 0 Min.Marks-35
Duration-3hrs.

Branch: Computer Science IV Semester


Course: CS 4506/CS403 Computer System Organization

Unit-I
Von newmann model- CPU, Memory, I/O, System Bus, Memory address register, Memory data register,
Program Counter, Accumulator, Instruction register, Micro operations, Register Transfer Language,
Instruction Fetch, decode and execution, Instruction formats and addressing modes.

Unit-II
Control Unit Organization, Hardwired control unit, Micro programmed control unit, Control Memory,
Address Sequencing, Micro Instruction formats, Micro program sequencer, Microprogramming

Unit-III
Arithmetic Processor design, Addition and subtraction algorithms Multiplication algorithm, Division
algorithm, Floating point arithmetic, Decimal Arithmetic unit.

Unit-IV
Input Output Organization, I/O Interface, Asynchronous data transfer, Programmed I/O, Interrupt
initiated I/O, DMA, I/O processor, Priority Interrupts.

Unit-V
Memory organization - RAM, ROM, Memory Maps, Memory Hierarchy, Cache Memory- Organization
and mappings. Associative memory, Virtual memory, Memory Management Hardware. Introduction to
parallel processing, Instruction and Arithmetic Pipeline.

References:

• Morris Mano, Computer System Architecture, PHI.


• William Stallings, Computer Organization and Architecture, PHI
Course Contents
Category of Course Title Course Credits-6C Theory Paper
Course Code (ES)
Departmental Data Structure CS 4504/ L T P Max. Marks-100
Core DC-4 and Algorithm CS401 Min.Marks-35
Duration-3hrs.
3 1 2

Branch: Computer Science and Engineering IV semester


Course: CS 4504/CS401 Data Structure and Algorithm

Unit I
Structural programming, top-down design., abstract data type, implementation of arrays, triangular
arrays, structures, character strings, Pointers dynamic memory management.
Unit II
Singly linked list, implementation linked list using arrays, implementation of linked list using dynamic
memory allocation circular link list, Josphus problem, doubly linked list, polynomial manipulation using
linked list, representation of sparse matrices.Stacks - their concepts and implementation, multiple stacks.
Conversion of infix to postfix notation using stack, evaluation of postfix expression, recursion, how
recursion- works, queues their concepts and implementation, deque, primary queues, simulation.
Unit III
Trees, Binary tree - their representation and operations, tree traversals, threaded binary trees, conversion
of general trees to binary trees, binary expression tree, applications of trees. sequential searching, binary
search, height balanced tree and weight balanced trees, multiway search trees, digital search, trees,
hashing and collision - resolution techniques.
Unit IV
Various sorting algorithms viz. bubble sort, selection sort, inserted sort, Quicksort, merge sort, address
calculation sort and heap sort, complexity of the algorithm.
Unit V
Graphs, terminology, representation of graphs, reachability, minimum path problem, critical events,
Graph traversals, spanning trees, application of graph.

Suggested List of Experiments


1. Classes teaching with more emphasis on problems and algorithms to give a better understanding
of Object.
2. Programs to implement stacks, queue, trees and graphs.
3. Programs to solve josephus problem, simulation, polynomial manipulation.
4. Programs to implement various searching and sorting techniques.
Suggested further readings:
• Data structures using C: By Tannenballam
• Data structures: By Trembley Sorenson: TMH Delhi.
• Data structures using C: By Rajiv Jindal
• Data structures & Program design :Kruse-Pearson,
• Discrete Structure & Algorithm Nitin Upadhyay. Shivani Publications. Gwalior
Course Contents
Category of Course Title Course Credits-6C Theory Paper
Course Code (ES)
Departmental Digital Circuits CS 4505/ L T P Max. Marks-100
Core DC-5 & Systems CS402 3 1 2 Min.Marks-35
Duration-3hrs.

Branch: Computer Science IV Semester


Course: CS 4505/CS402 Digital Circuits & systems

Unit I
Number systems & codes, Binary arithmetic Boolean algebra and switching function. Minimization of
switching function, concept of prime implecant etc. Karnaugh's map method, Quine & McCluskey's
method, cases with don't care terms and multiple output switching function.
Unit II
Introduction to logic gates NAND, NOR realization of switching function : half-adders half subtractor
full adders full subtractor circuits. Series & parallel addition and BCD adders, look-ahead carry
generator.
Unit III
Linear wave shaping circuits, Bistable, monostable & astable multivibrators, Schmitt trigger circuits &
Schmitt-Nand gates.
Unit IV
Logic families : RTL, DTL, all types of TTL circuits , ECL, 12 L and PMOS, NMOS & CMOS logic
etc. Gated flip-flops and gated multivibrators etc ; Interfacing between TTL to MOS, vice-versa.
Unit V
Introduction to shift registers / ring counters .1 synchronous & asynchronous counters and designing of
combinational circuits like code converters & counters etc.
Unit VI
Introduction to various semiconductor memories & designing with ROM and PLA: Decoders Encoders
multiplexers & demultiplexers
Unit VII
Introduction to D/A converters. Various types of Analog Digital & Digital to Analog converters
sample. & hold circuits and V-F converters.
Books
i) W.H. Gothman, "Digital Electronics" (PHI).
ii) R.J. Tocci, "Digital Systems Principles &: Applications".
iii) Z. Kohair (TMH), "Switching & Automata Theory".
iv) M. Mano (PHI), "Digital Logic & Computer Design".
v) M. Mano, "Digital Design".
vi) H.V. Malmstadt & C.G. Euke (W.A. Benjamin IOC), "Digital Electronics for Scientists".
vii) B.S. Sonde (New Age International),"Introduction to System Design using Integrated Circuits".
viii) Millman & Taub (McGraw Hill). "Pulse, Digital & Switching Waveforms".
Course Contents
Category of Course Title Course Credits-5C Theory Paper
Course Code (ES)
Departmental Discrete CS 4507/ L T P Max.Marks-100
Core DC-7 Structure CS405 3 2 0 Min.Marks-35
Duration-3hrs.

Branch: Computer Science IV Semester


Course: CS 4507/CS405 Discrete Structure

Unit I
Introduction, Sets, Finite and to sets uncountable. Infinite sets Mathematical induction, Principles of
inclusion and exclusion and multi sets. Relations and functions, A relational model for' data bases,
Properties of binary relations, equivalence relations and partitions partial ordering relations and lattices
chains and antichains, A job scheduling problem functions and pigeonhole principle.
Unit II
Prepositional logic, Conjunction, Dysfunctions and negation interpretation of formulas in prepositional
logic. Validity and consistency, Normal form in prepositional logic and logic and logic consequences,
Introduction to finite state machine Finite state machines as models of physical system equivalence
machines, Finite state machines. as language recognizers.
Unit III
Introduction and basic terminology of graphs, Planner graphs, Multigraphs and weighted graphs,
Shortest path in weighted graph, Introduction to Eulerian paths and circuits, Hamiltonian paths and
circuits, Introduction to trees, Rooted trees, path length in rooted trees prefix codes spanning trees and
cut trees.
Unit IV
Introduction to discrete numeric functions and generating functions, Introduction to combinational
problems, Introduction to recurrence relations and recursive algorithms linear recurrence. Relations with
constant coefficients Homogeneous' solutions particular solutions total solutions.
Unit V
Introduction to groups and rings. Sub groups generations and evaluation of power, Cosets and
Lagrange's theorem C odes and groups codes. Isomorphism and auto orphisms, homomorphism and
normal subgroups, Rings, integeral domains and fields.
Suggested Text.
1. Elements of Discrete mathematics C.L. Liu
2. Concepts in Discrete Mathematics Sahni S.
3. Discrete Structure of Computer Science Levy L.S.
4. Discrete Mathematical Structures Soma Sundaram-PHI
5. Discrete Structure Dr. D.V.S. Kushwah. Shivani Publications. Gwalior
Course Contents
Category of Course Course Credit-6C Theory Paper
Course Title Code (ES)
Departmental Computer CS 5512/ L T P Max.Marks-100
Core DC-12 Graphics & CS504 3 1 2 Min.Marks-35
Multimedia Duration-3hrs.

Branch: Computer Science and Engineering V semester


Course: CS 5512/ CS504 Computer Graphics & Multimedia

Unit I
Introduction to Raster scan displays, Storage tube displays, refreshing, flickring, interlacing, colour
monitors, display processors resolution, working principle of dot matirix, inkjet laser printers, working
principles of keyboard, mouse scanner, digitizing camera, track ball , tablets and joysticks, graphical
input techniques, positioning techniques, rubber band techniques, dragging etc.
Unit II
Scan conversion techniques, image representation, line drawing, simple DDA, Bresenham’s Algorithm,
Circle drawing, general method, symmetric DDA, Bresenham’s Algorithm, curves, parametric function,
Beizier Method, B-spline Method.
Unit III
2D & 3D Co-ordinate system, Translation, Rotation, Scaling, Reflection Inverse transformation,
Composite transformation, world coordinate system, screen coordinate system, parallel and perspective
projection, Representation of 3D object on 2D screen.
Unit IV
Point Clipping. Line Clipping Algorithms, Polygon Clipping algorithms, Introduction to Hidden Surface
elimination, Basic illumination model, diffuse reflection, specular reflection, phong shading, Gourand
shading ray tracing, color models like RGB, YIQ, CMY, HSV etc.
Unit V
Multimedia components, Multimedia Hardware, SCSI, IDE, MCI, Multimedia data and file formats,
RTF, TIFF, MIDI, JPEG, DIB, MPEG, Multimedia Tools, Presentation tools, Authoring tools,
presentation.

Suggested books :

1. James E. Shuman, “Multimedia in Action” Thomson / Vikas Publishing House.


2. Tay Vaughan “ Multimedia: making it work” Tata McGraw Hill 1999, 4th Edition
3. Prabhat k Andleigh, Kiran Thakral “Multimedia System Design”, PHI
4. Donald Hearn and M.P. Becker “Computer Graphics” PIR Pub.
5. Folay Vandam,Feiner, Hughes “Computer Graphics Principle & Practice” Adison Wesley,2/e. 1997
6. Principles of Computer Graphics “Rogers” TMH.
Course Contents
Category of Course Title Course Credit-4C
Course Code
Information Computer CS 5305/ L T P
Technology Programming V CS506 0 0 4
IT 5 (Hardware Lab.)

Branch: Computer Science and Engineering V Semester


Course: CS 5305/ CS506 Computer Programming V (Computer Hardware-Lab).

Essentials of Networking
Installation and implementation of:
1. Workstations in NOS.
2. Servers in NOS.
3. Enterprise servers in NOS
Options of NOS are
a. Microsoft Windows NT
b. Linux
c. Unix.
d. Sun-Solaris.

(H/W Examples: AS/400; RS-6000; IBM-Compatible Platform Silicon-Graphics


for multimedia; IBM-Net Finity Server)
Course Contents
Category of Course Course Credit-6C Theory Paper
Course Title Code (ES)
Departmental Data Base CS 5510/ L T P Max.Marks-100
Core DC- 10 Management CS503 3 1 2 Min.Marks-35
System Duration-3hrs.
Branch: Computer Science V Semester
Course: CS 5510/ CS503 Data Base Management System
Unit I
DBMS Concepts and architecture Introduction, Review of file organization techniques, Database
approach v/s Traditional tile accessing approach, Advantages of database systems, Data models,
Schemas and instances, Data independence, Functions of DBA and designer. Entities and attributes,
Entity types, Value, Sets, Key attributes, Relationships, Defining the E-R diagram of database, Various
data models : Basic concepts of Hierarchical data model, Network data model, and Relational data
model, Comparison between the three types of models.
Unit II
Relational Data models: Domains, Tuples, Attributes, Relations, Characteristics of relations, Keys, Key
attributes of relation, Relational database, Schemas, Integrity constraints, Intension and Extension,
Relational Query languages: Relational algebra and relational calculus, Relational algebra operations
like select, Project, Join, Division, outer union etc.
Unit III
Types of relational calculus i.e. Tuple oriented and domain oriented relational calculus and its
operations.
SQL: Data definition in SQL, update statements and views in SQL QUEL & QBE: Data storage and
definitions, Data retrieval queries and update statements etc.
Unit IV
Data Base Design: Introduction to normalization, Normal forms, Functional dependency,
Decomposition, Dependency preservation and losless join, problems with null valued and dangling
tuples, multivalued dependencies. Distributed databases, protection, security and integrity constraints,
concurrent operation on databases, recovery, transaction processing, basic concepts of object oriented
data base system and design.
Unit V
Case study of relational database management systems: Oracle and Microsoft access, Oracle tools.
Suggested list of experiments
In this subject the students are supposed to prepare a small database application in complete semester
like financial accounting system, Railway reservation system, institute time-table management system,
student record system, library management system, hospital management system etc. In RDBMS.
Suggested further Reading

1. Data Base Management System by C.J. Date


2. Data Base Management System by Ullman
3. Fundamental of database system by Elmasri / Navathe the Benjamin / Cunnings Publishing company
inc.
4. Database Management System-Narang, Prentice Hall of India, New Delhi.
Course Contents
Category of Course Title Course Credit-4C Theory Paper
Course Code (ES)
Departmental Core Data CS- 5508/ L T P Max.Marks-100
DC-8 Communication CS501 3 1 0 Min.Marks-35
Duration-3hrs.

Branch: Computer Science Engineering: V Semester


Course: CS 5508/ CS501 Data Communication

Unit I
Basic Data Communication Concepts :
Host computer and terminal modems, parallel and serial transmission Asynchronomy and synchronous
transmission. Simplex, half duplex and Duplex. Front –end processor, port-sharing device, Line splitters
and remote intelligent controllers. Multiplexer: TDM,FDM,VVDM. Data compression devices, Inverse
multiplexer.
Unit II
Data Interfaces and transmission :
Digital interface standards: RS-232 standard, hand shaking, connecting a DTE in RS-232 C, RS –449,
RS-422A and RS-423A standards. High-speed desktop serial interfaces. Remote digital transmission
carrier ISDN, Packet data network, Digital access. Data communication Efficiency: Modems, AM,
FM, Phase modulation, multispeed modems, high speed modems, Error Correcting modems data
compression in modems. Short-wave modems, Facsimile and Fax modems.

Unit III
Data Integrity and, security:
Data Integrity, sources of error control approaches. Implementation of error control Echo checking
parity checking and cyclical purity, Hammering code, checksums, Cyclical Redundancy check. Security
and security measuring.

Unit IV
Architecture and Protocols :
OSI models, Traditional communication architecture: System network Architecture and other
communication architecture Protocols : polling and selecting , automatic repeat request common link
level protocols. Converters and code converters TCP/IP protocols.
Unit V
Data transport Network
Packet switching, LAN and indent working

Suggested Books:

1. Data & Network Communication, Michael A. Miller – DELMAR (Thomson learning) / Vikas
Publication.
2. Data & Computer Communication, William Stallings – Pearson Education.
3. Understanding Data Communication & Networks, William A Shay – Thomson Learning / Vikas
Publication.
Course Contents
Category of Course Course Credit-6C Theory Paper
Course Title Code (ES)
Departmental Operating CS 5509/ L T P Max.Marks-100
Core DC- 09 System CS502 3 1 2 Min.Marks-35
Duration-3hrs.

Branch: Computer Science Engineering: V Semester


Course: CS 5509/ CS502 Operating System

Unit I
Introduction to Operating Systems, Operating system services, multiprogramming, time-sharing system,
storage structures, system calls, multiprocessor system. Basic concepts of CPU scheduling, Scheduling
criteria, Scheduling algorithms, algorithm evaluation, multiple processor scheduling, real time
scheduling I/0 devices organization, I/0 devices organization, I/0 devices organization, I/0 buffering.
Unit II
Process concept, process scheduling, operations on processes, threads, interprocess communication,
precedence graphs, critical section problem, semaphores, classical problems of synchronization.
Deadlock problem, deadlock characterization, deadlock prevention, deadlock avoidance, deadlock
detection, recovery from deadlock, Methods for deadlock handling.
Unit III
Concepts of memory management, logical and physical address space, swapping, contiguous and non-
contiguous allocation, paging, segmentation, and paging combined with segmentation.
Unit IV
Concepts of virtual memory, demand paging, page replacement algorithms, allocation of frames,
thrashing, demand segmentation. Security threads protection intruders-Viruses-trusted system.
Unit V
Disk scheduling, file concepts, file access methods, allocation methods, directory systems, file
protection, introduction to distributed systems and parallel processing case study.

Suggested Instructions
1. Class room lectures.
2. Seminar on various operating systems with special reference to their CPU scheduling, memory
management, 1/0 management and file systems.
3. Minor project.

Suggested further readings


Operating System by Silberschatz
Operating System by Deitel
Modern operating system by Tanneubacem.
Course Contents
Category of Course Course Credit-4C Theory Paper
Course Title Code (ES)
Departmental Theory of CS 5511/ L T P Max.Marks-100
Core DC-11 Computation CS505 3 1 0 Min.Marks-35
Duration-3hrs.

Branch: Computer Science and Engineering V semester.


Course: CS 5511/ CS505 Theory of Computation

Unit I
Introduction to theory of Computation and Finite Automata: Mathematical Preliminaries &
Notation : Sets, functions and relations, Graphs and Trees, Proof Techniques, Basic concepts ,
Languages, Grammars, automats, deterministic finite accepters, Deterministic accepters and Transition
Graphs, Languages, Non deterministic finite accepters, definition of a NDRA, Equivalent of DFA and
NDFA, Reduction of the Number of states in finite automata.
Unit II
Grammers and Languages: Regular expression, Regular Grammer, Regular languages, closure
properties of Regular languages, Context free grammars, Simplification of Context free grammars and
Normal forms, Properties of context free languages.
Unit III
Push – Down Automata: Non deterministic push down automata: Definition of a push down automata,
The language accepted by a push down automata, Push down automata and context free languages, Push
down automata for context free languages, CFG’s for PDA, Deterministic Push down automata and
Deterministic Context free languages, Grammers and Deterministic context free languages
Unit IV
Turning Machines: The Standard Turning Machine: Definition of a Turning Machine, Turning
Machines as language accepters, and Turning Machines as Transducers. Combining Turning Machines
for complicated tasks, Turning thesis, Other models of Turning Machines.
Unit V
Limits of algorithmic computation, Some Problems that can not be solved by Turning Machines,
Computability and Decidability, the Turning Machine Halting Problem, Reducing one Undecidable
Problem to another, Undecidable Problems for Recursively Enumerable languages, The post
correspondence problem : Indecidable problems for context free languages, Recursive function,
Primitives recursive functions, Ackermanris functions, recursive functions, Post Systems : Rewriting
systems : Matrix grammars, Markor Algorithms.

Suggested Books:
1. John C. Martin, “Introduction to languages & the theory of Computation” TNM.
2. Peter Linz, “ An Introduction to formal languages & automata” Narosa Publication House.
3. Z. Kovahi “Switching & Finite Automata Theory” Mc Graw Hill.
4. M.A. Harrison “Introduction to Formal Langues Theory” Addison Wesley.
5. J.E. Hopecroff & J.D. Ullman “Introduction automata theory languages & computation” Addison Wesley.
Course Contents
Category of Course Title Course Credits-6C Theory Papers
Course Code (ES)
Departmental Analysis & Design CS 6516/ L T P Max.Marks-100
Core DC-16 of Algorithm CS603 Min.Marks-35
3 1 2
Duration-3 hrs.
Branch: Computer Science & Engineering VI Semester
Course: CS 6516/ CS603 Analysis & Design of Algorithm

Unit I
Algorithms, Designing algorithms, analyzing algorithms, asymptotic notations, trees and graphs, sets
and disjoint sets, recursion, functions and subroutine, heap and heap sort.

Unit II
Introduction to divide and conquer technique, analysis, design and comparison of various algorithms
based on this technique, example binary search, merge sort, quick sort, strassen’s matrix multiplication.

Unit III
Study of Greedy strategy, examples of greed method like optimal merge patterns, minimum spanning
trees, knapsack problem etc.
Concept of dynamic programming and problems based on this approach such as 0/1 knapsack,
multistage graph, reliability design etc.

Unit IV
Backtracking concept and its examples like 8 queen’s problem, Hamiltonian cycle etc.
Introduction to branch & bound method, examples of branch and bound method like traveling salesman
problem etc.
Meaning of lower bound theory and its use in solving algebric problem, introduction to parallel
computation.

Unit V
Binary search trees, height balanced trees, AVL trees, 2-3 trees, B-trees, basic search and traversal
techniques for trees and graphs (In order, preorder, postorder, DFS, BFS), NP- completeness.

Suggested Books :

1. Introduction to Algorithms (PHI), Thomas H. Coremen, Charles E. Leiserson, Ronald L. Rivest.


2. Analysis & Design of Algorithm by Horowitz & Sahini.
3. Analysis & Design of Algorithm by Ullmann (TMH)
Course Contents
Category of Course Title Course Credit-6C Theory Paper
Course Code (ES)
Departmental Core Computer CS 6515/ L T P Max.Marks-100
DC-15 Networking CS604 3 1 2 Min.Marks-35
Duration-3hrs.
Branch: Computer Science & Engineering VI Semester.
Course: CS 6515/ CS604 Computer Networking
Unit I
Introduction Theoretical Model for Communication, analog and digital signal, Bandwidth, Noise,
Channel Capacity, Data-rate, Concepts of Circuit Switching, Message switching and Packet switching
with their timing diagrams, comparison of switching techniques, ISDN.
Unit II
Evolution of Computer Networks - Layered Network architecture, OSI Layers Model, transmission
media – topology, error detection & Correction techniques, Parity checks, CRC, Asynchronous and
synchronous transmission, TDM, FDM.
Unit III
Data-Link layer: Different Types of line discipline, simplex, Half duplex and full duplex, Flow control
stop and wait protocol, sliding Window Protocol With their efficiency, AR techniques & their
performance, HDLC.
Unit IV
LAN : Static & Dynamic channel allocation, Media access control for LAN & WAN;ALOHA : pure,
slotted ALOHA, CSMA, CSMA/CD IEEE 802 standards for LAN & MAN: 802.3, 802.4,802.5, 802.6
and 802.2 & their comparison Fast LANs : fast Ethernet, FDDI,
Unit V
Routing: Definition, Elements of routing techniques, Least Cost Routing algorithm Dijkstra's
algorithm, Bellman-ford algorithm, Routing Strategies, Congestion Control encryption & de-
encryption
techniques, Internet working, Internet and Intranet
Suggested Instructional Strategies
All units required the Lecture, Tutorial, Practical and Seminar.
Suggested List of Experiments
1. Study of different types of LANs
2. Channel Capacity
3. B/W - Noise relation
4. Internet
5. Simplex, half duplex, full duplex
6. TDM
7. FDM
Suggested further readings
1. Computer Networks - Tanenbaum A. S. PHI.
2. LANs - Keizer
3. Computer Networks - Stalling W., PHI.
4. ISDN & Broadband
5. ISDN: Stalling W., PHI.
Course Contents
Category of Course Title Course Credit-6C Theory Paper
Course Code (ES)
Departmental Micro-Processor CS 6513/ L T P Max.Marks-100
Core DC-13 & Interfacing CS601 3 1 2 Min.Marks-35
Duration-3hrs.

Branch: Computer Science and Engineering VI Semester.


Course: CS 6513/ CS601 Microprocessor and Interfacing

Unit I
Salient features of advanced microprocessors. RISC & CISC processors. Review of evolution of
advanced microprocessors : 8086 8088 186 / 286 / 386 / 486 / Pentium. Super scalar architecture of
Pentium. Alpha AXP and Ultrasparc processors. Architecture of Intel 8086 / Motorola 68000 and
assembly language programming with Intel 8086 microprocessors.
Unit II
Introduction to the various interfacing chips like 8212, 8155, 8255, 8755, and interfacing keyboards,
printers, LEDS, motors, ADC, DAC, and stepper motors and introduction to programmable keyboard /
display interface, memory Interfacing.
Unit III
General purpose programmable peripheral devices (8253) 8254 programmable interval timer, 8259A
Programmable interrupt controller & 8257 DMA controller, USART.
Unit IV
Serial 1/0 & Data communication: use RS 232C, Modern etc. and various bus standards.
Unit V
Introduction to micro controllers, (8051), Its architecture pin description, I/o configuration, interrupts,
addressing modes, an overview of 8051 instruction set.

Books

1. B.B. Brey (PHI), "The Intel Microprocessors, Architecture, Programming and Interfacing".
2. Triebel & Avtar Singh (PHI), "The 8088 & 8086 Microprocessor".
3. Hall (Mc-Graw Hill), "Advanced Microprocessor and Interfacing".
4. Pal (TME), "Microprocessors Principles & Applications".
5. R.L. Krutz (John Wiley), "Interfacing techniques in Digital Design with emphasis on Microprocessors”
6. A.P. Mathur (TMA), "Introduction to Microprocessors". Intel Corporation Microprocessors Data
manuals.
7. Microprocessor Training Inc., "Microprocessor Fundamentals & Applications (Handson)".
Course Content
Category of Course Title Course Credit-4C Theory Paper
Course Code (CS)
Departmental Parallel Processing & CS-6517/ L T P Max.Marks-100
Core DC-17 Distributed Computing CS605 Min.Marks-35
3 1 0 Duration-3hrs.

Branch: Computer Science and Engineering VI Semester


Course: CS 6517/ CS605 Parallel Processing & Distributed Computing.

Unit I
Introduction to Parallel Processing & pipelining:
Multi-programming and time sharing, Classification schemes, performance measures.
General pipelines, reservation tables, instruction and arithmetic pipelines, instruction prefectch, branch
handling, data buffering, internal forwarding and register tagging, hazard detection and resolution,
collision prevention.
Unit II
Array Processing and Vector Processing:
SIMD organizations, Interconnection networks, Parallel algorithms for array processing, Associative
array processing
Characteristics of vector processing, Pipelined vector processing, reconfigurability
Unit III
Multiprocessor Architecture, Programming & Control:
Loosely and tightly coupled architectures, Interconnection networks, Parallel memory organizations
operating systems.
Process synchronization mechanisms: Samaphores , Critical sections and monotors, System deadlocks
and protection schemes, Multiprocessors scheduling strategies, Parallel algorithms.
Unit IV
Distributed Computing :
Introduction, distribution of data & control : Clock synchronization, distributed termination problem,
load distribution, distributed elections, agreement problem.
Unit V
Language Support for Distributed Computing :
Message passing primitives, atomic actions, remote procedure calls mechanism : Case study of some
language like Occam II & Linda.

Suggested Text Books


1. Computer Architecture & Parallel processing by K. Hwang & Briggs (TMH).
2. Advanced Computer Architecture by Kai Hwang (TMH).
3. Computer Architecture & Organisation by J.P. Hayes (TMH).
4. Distributed Operating System by P.K. Sinha (TMH).
5. Distributed Systems by G.F. Colouris and Dollimore (Addison-Wesley)
Course Contents
Category of Course Course Title Course Credit – 4C Theory Paper
Code (ES)
Departmental Core Software CS 6514/ L T P Max.Marks-100
DC-14 Engineering I CS602 Min.Marks-35
3 1 0 Duration-3hrs.

Branch: Computer Science & Engineering VI Semester


Course: CS 6514/ CS602 Software Engineering I

Unit I
The Software Product and Software Process:
Software Engineering - A layered Technology
Software Process Models: Linear Sequential Model, Prototyping Model, RAD Model Evolutionary
Software Process Models: Incremental Model, Spiral Model Coniponent Assembly Model, Formal
Methods, Fourth-Generation Techniques
Unit II
Systems Engineering:
The Systems Engineering Hierarchy, Information Engineering. Information Strategy Planning, Business
Area Analysis, Product Engineering
Unit III
Requirement Analysis Modeling:
Analysis Concepts and Principles, The Elements of the Analysis Model Data Modifying, Functional
Modeling and Information Flow and Behavior Modeling, Mechanics of Structured Analysis, Data
Dictionary
Unit IV
Design Concepts, Principles, and Methods:
The Software Design Process: Design Principles
Design Concepts: Effective Modular Design, Design Heuristics, Design Documentation,
Design Methods: Data Design, Architectural Design, Interface Design, Human Computer Interface
Design, Procedural Design.
Unit V
Software Testing Methods:
Software Testing Fundamentals, Test Case Design, Black-Box Testing, White-Box Testing
Software Testing Strategies: Verification and Validation, Strategic Issues, Unit Testing, Integration
Testing, Validation Testing. System Testing
Unit VI
Software Process and Project Metrics:
Measures, Metrics and Indicators, Metrics in the Process and Project Domains, Software Measurement,
Metrics of Software Quality
Unit VII
Project Management Concepts and Software Project Planning
Project Management Concepts, Project Planning objectives, Resources, Software project Estimation,
Decomposition Techniques, Empirical Estimation Models, Automation Estimation Tools.

Text Book:
1. Software Engineering: A Practitioner's Approach
- by P,S. Pressman Fourth edition 1997, McGraw-Hw pub.
Reference Books:
2. An Integrated Approach to Software Engineering – Pankaj Jalote, 1991, Narosa Pub.
3. Software Engineering University Press – by 1. Sonunerville Oxford university press 1996
4. Fundamentals of Software Engineering Leon and Leon – Vikas Publishing House Pvt. Ltd.
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL.

PROGRAMME: B.E. Computer Science and Engineering, VII Semester


Course: CS702 Artificial Intelligence

CATEGORY OF COURSE COURSE CREDIT-4C THEORY


COURSE TITLE CODE PAPER
Departmental Artificial CS702 L T P Max.Marks-100
Core DC-20 Intelligence COMMON WITH 3 1 0 Min.Marks-35
IT Duration-3hrs.

COURSE CONTENTS

Unit I
Meaning and definition of artificial intelligence, Various types of production systems,
Characteristics of production systems, Study and comparison of breadth first search
and depth first search. Techniques, other Search Techniques like hill Climbing, Best
first Search. A* algorithm, AO* algorithms etc, and various types of control
strategies.
Unit II
Knowledge Representation, Problems in representing knowledge, knowledge
representation using propositional and predicate logic, comparison of propositional
and predicate logic, Resolution, refutation, deduction, theorem proving, inferencing,
monotonic and nonmonotonic reasoning.

Unit III
Probabistic reasoning, Baye's theorem, semantic networks scripts schemas, frames,
conceptual dependency, fuzzy logic, forward and backward reasoning.

Unit IV
Game playing techniques like minimax procedure, alpha-beta cut-offs etc, planning,
Study of the block world problem in robotics, Introduction to understanding and
natural languages processing.

Unit V
Introduction to learning, Various techniques used in learning, introduction to neural
networks, applications of neural networks, common sense, reasoning, some example
of expert systems.

References:

• Rich E and Knight K, Artificial Intelligence, TMH, New Delhi.


• Nelsson N.J., Principles of Artificial Intelligence, Springer Verlag, Berlin.
• Barr A, Fergenbaub E.A. and Cohen PR., Artificial Intelligence,
Addison Wesley, Reading (Mars)
• Waterman D.A., A guide to Expert System, Addison Wesley, Reading (Mars).
• Giarratand & Riley, Expert Systems: Principles and Programming, Thomson.

4
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME: B.E. Computer Science and Engg., VII-Semester


Course: CS705 Major Project (Planning & Literature Survey)

CATEGORY COURSE TITLE COURSE CREDITS-2C PRACTICAL


OF COURSE CODE EXAMN.
Departmental Major Project CS705 L T P Max. Marks-50
Core (Planning & 0 0 4 Min. Marks-25
DC-23 Literature . Survey) Duration-3 Hrs

COURSE GUIDELINES

The Major Project Work provides students an opportunity to do something on their own and
under the supervision of a guide. Each student shall work on an approved project, which may
involve fabrication, design or investigation of a technical problem that may take design,
experimental or analytical character or combine element of these areas. The project work
involves sufficient work so that students get acquainted with different aspects of
manufacture, design or analysis. The students also have to keep in mind that in final
semester they would be required to implement whatever has been planned in the Major
Project in this semester. It is possible that a work, which involves greater efforts and time
may be taken up at this stage and finally completed in final semester, but partial completion
report should be submitted in this semester and also evaluated by an external examiner. At
the end of semester, all students are required to submit a synopsis.

10
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME: B.E. Computer Science & Engineering., VII Semester


Course: CS703 Simulation And Modeling
CATEGORY COURSE COURSE CREDITS - 6C THEORY
OF COURSE TITLE CODE PAPERS
Departmental Simulation CS703 L T P Max.Marks-100
Core and Modeling 3 1 2 Min.Marks-35
DC-21 Duration-3hrs.

COURSE CONTENTS
Unit-I
Introduction to modeling and simulation:
Modeling and simulation methodology, system modeling , concept of simulation,
continuous and discrete time simulation.
Basic concept of probability and random variables continuous and discrete random
variables, distribution of random variables: discrete and continuous, Compartmental
models: linear, nonlinear and stochastic models.

Unit-II
Introduction to Queuing Theory:
Characteristics of queuing system, poisson’s formula, beatth-death system,
equilibrium of queuing system, analysis of M/M/1 queues. Application of queuing
theory in computer system like operating systems, computer networks etc.

Unit-III
System Dynamics modeling:
Identification of problem situation , preparation of causal loop diagrams and flow
diagrams, equation writing, level and rate relationship. Simulation of system
dynamics model.

Unit-IV
Verification and validation:
Design of simulation experiments, validation of experimental models, testing and
analysis. Simulation languages comparison and selection, study of SIMULA,
DYNAMO, STELLA, POWERSIM. simulation software.

List of Experiments
1. Simulate CPU scheduling algorithm using queueing system
a) FCFS b) SJF c) Priority Algo
2. Simulate multiplexer/ concentrator using queuing system
3. Simulate congestion control algorithms.
4. Simulate disk scheduling algorithms.
5. Prepare model and write a program in Dynamo/Stella for inventory control.
6. Prepare model and write a program in Dynamo/Stella for population control.
7. Prepare model and write a program in Dynamo/Stella for Energy Management.

References:
• Gorden G., System simulation, Printice Hall.
• Payer T., Introduction to system simulation, McGraw Hill.
• Spriet, Computer Aided Modeling and Simulation, W.I.A.
• Sushil, System Dynamics, Wiley Eastern Ltd.
• Shannon R.E., System simulation, Prentice Hall.

5
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL.

PROGRAMME: B.E. Computer Science and Engineering VII Semester


Course: CS701 Compiler Design

CATEGORY OF COURSE COURSE CODE CREDITS - 6C THEORY PAPERS


COURSE TITLE
Departmental Compiler CS701 L T P Max.Marks-100
Core Design COMMON WITH Min.Marks-35
IT 3 1 2 Duration-3hrs.
DC-19

COURSE CONTENTS
Unit-I
Compiler, Translator, Interpreter definition, Phase of compiler introduction to one
pass & Multipass compilers, Bootstrapping, Review of Finite automata lexical
analyzer, Input, buffering, Recognition of tokens, Idea about LEX: A lexical analyzer
generator, Error handling

Unit-II
Review of CFG Ambiguity of grammars, Introduction to parsing. Bottom up parsing
Top down parsing techniques, Shift reduce parsing, Operator precedence parsing,
Recursive descent parsing predictive parsers. LL grammars & passers error handling
of LL parser. LR parsers, Construction of SLR, Conical LR & LALR parsing tables,
parsing with ambiguous grammar. Introduction of automatic parser generator: YACC
error handling in LR parsers.

Unit-III
Syntax directed definitions, Construction of syntax trees, L~attributed definitions,
Top down translation. Specification of a type checker, Intermediate code forms using
postfix notation and three address code, Representing TAC using triples and
quadruples, Translation of assignment statement. Boolean expression and control
structures.

Unit-IV
Storage organization, Storage allocation, Strategies, Activation records, Accessing
local and non local names in a block structured language, Parameters passing, Symbol
table organization, Data structures used in symbol tables.

Unit -V
Definition of basic block control flow graphs, DAG representation of basic block,
Advantages of DAG, Sources of optimization, Loop optimization, Idea about global
data flow analysis, Loop invariant computation, Peephole optimization, Issues in
design of code generator, A simple code generator, Code generation from DAG.

List of Experiments:
• Develop a lexical analyzer to recognise a few patterns in PASCAL and C.
(ex: identifiers, constants, comments, operators etc.)
• Write a programme to parse using Brute force technique of Topdown parsing.
• Develop on LL (1) parser (Construct parse table also).
• Develop an operator precedence parser (Construct parse table also)
• Develop a recursive descent parser

2
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL.

PROGRAMME: B.E. Computer Science and Engineering VII Semester


Course: CS701 Compiler Design
• Write a program for generating for various intermediate code forms
i) Three address code ii) Polish notation
7. Write a program to simulate Heap storage allocation strategy
8. Generate Lexical analyzer using LEX
9. Generate YACC specification for a few syntactic categories.
10. Given any intermediate code form implement code optimization techniques.

References:
• Aho-Ullman, Principles of compiler Design, Narosa Publishing House.
• Aho-Ullman, Compilers: Principles Techniques & Tools, Addison Wesley.
• Dhamdhere, Compiler Construction.

3
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME: B.E. Computer Science & Engg.,-VIII Semester


Course: CS803 Major Project

CATEGORY COURSE COURSE CREDITS - 8C PRACTICAL


OF COURSE TITLE CODE EXMN.
Departmental Major Project CS803 L T P Max.Marks-100
Core 0 0 8 Min.Marks-50
DC-26 Duration-3hrs.

COURSE GUIDELINES

The objectives of the course ‘Major Project’ are


• To provide students with a comprehensive experience for applying the knowledge
gained so far by studying various courses.
• To develop an inquiring aptitude and build confidence among students by working
on solutions of small industrial problems.
• To give students an opportunity to do some thing creative and to assimilate real life
work situation in institution.
• To adapt students for latest developments and to handle independently new
situations.
• To develop good expressions power and presentation abilities in students.

The focus of the Major Project is on preparing a working system or some design or
understanding of a complex system using system analysis tools and submit it the same in
the form of a write-up i.e. detail project report. The student should select some real life
problems for their project and maintain proper documentation of different stages of
project such as need analysis, market analysis, concept evaluation, requirement
specification, objectives, work plan, analysis, design, implementation and test plan. Each
student is required to prepare a project report and present the same at the final
examination with a demonstration.
The faculty and student should work according to following schedule:

i) Each student undertakes substantial project in an approved area of the subject and
supervised by a member of staff.
ii) The student must submit outline and action plan for the project execution (time
schedule) and the same be approved by the concerned faculty.
iii) At all the steps of the project, students must submit a written report of the same.

27
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME: B.E. Computer Science & Engineering, VIII semester


Course: CS801 Neural Networks

CATEGORY OF COURSE COURSE CREDIT-6C THEORY


COURSE TITLE CODE PAPER
Departmental Neural CS801 L T P Max.Marks-100
Core Network Min.Marks-35
DC-24 3 1 2 Duration-3hrs.

COURSE CONTENTS

Unit-I
Introduction
Structure and Function of a single neuron: Biological neuron, artificial neuron,
definition of ANN, Taxonomy of neural net, Difference between ANN and human
brain, characteristics and applications of ANN, single layer network, Perceptron
training algorithm, Linear reparability, Widrow & Hebb’s learning rule/Delta rule,
ADALINE, MADALINE, AI v/s ANN.

Unit-II
Introduction of MLP problem with linear activation function, different activation
functions, sigmoidal, linear thresholding, hyperbolic tangent function etc, Error back
propagation algorithm, derivation of EBPA, momentum, limitation, characteristics
and application of EBPA, case-study: NETTALK, two dimensional pattern
recognition.

Unit-III
Counter propagation network, architecture, functioning in normal and training mode,
characteristics of counter. Propagation network, Deterministic v/s statistical training,
Boltzman training, Cauchy training, artificial specific heat method.

Unit-IV
Hopfield / Recurrent network, configuration, stability constraints, associative
memory, characteristics, limitations and applications Hopfield v/s Boltzman machine.
Adaptive Resonance Theory: Architecture, classification, Implementation and
training.

Unit-V
Optical neural network, advantages and disadvantages, vector matrix multiplies,
electro-optical matrix multiplier, introduction to cognitron and neocognitron.

References

• Hagan, Dernuth & Beale, Neural network design, Thomson learning, VP.
• Mehrotra, Mohan & Ranka, Elements of Artificial Neural Network, Penram.
• Philip D. Wasserman, Neural Computing, Van Nostrand Reinhold Pub.
• Judith E. Dayhoff, Neural Network Architecture, Van Nostrand Reinhold Pub.

24
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME: B.E. Computer Science & Engg., VII semester


Course : CS704- Industrial Training

CATEGORY OF COURSE COURSE CREDITS-4C PRACTICAL


COURSE TITLE CODE EXAMN

Departmental Core Industrial CS704 L T P Max. Marks-50


DC-22 Training Min. Marks-25
0 0 4
(Six Weeks) Duration-3 Hrs

SCHEME OF STUDIES

Duration: 6 weeks after the VI semester in the summer break, Assessment in VII semester.

SCHEME OF EXAMINATION

For the assessment of industrial training undertaken by the students, following components
are considered with their weightage.
(a) Term work
In Industry Marks allotted
1. Attendance and General Discipline 10
2. Daily diary Maintenance 10
3. Initiative and participative attitude during training 10
4. Assessment of training by Industrial Supervisor 20
----------------------------------------------------------------------------------------------------------------
TOTAL 50
----------------------------------------------------------------------------------------------------------------

(b) Practical/Oral Examination (Viva-Voce)


In Institution Marks allotted
1. Training Report 25
2. Seminar and cross questioning (defense) 25
----------------------------------------------------------------------------------------------------------------
TOTAL 50
----------------------------------------------------------------------------------------------------------------

Marks of various components in industry should be awarded to the students, in consultations


with the Training and Placement Officer/Faculty of Institute and I/c of training from Industry.
During training students will prepare a first draft of training report in consultation with
section in-charge. After training they will prepare final draft with the help of T.P.O./Faculty
of the institute. Then they will present a seminar on their training and they will face viva-
voce on training in the institute.

6
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME: B.E. Computer Science & Engg., VII semester


Course : CS704- Industrial Training
1.1 OBJECTIVE OF INDUSTRIAL TRAINING

The objective of undertaking industrial training is to provide work experience so that


student’s engineering knowledge is enhanced and employment prospects are improved. The
student should take this course as a window to the real World of Work and should try to learn
as much as possible from real life experiences by involving and interacting with industry
staff. Industrial training also provides an opportunity to students to select an engineering
problem and possibly an industry guide for their Major Project in final semester.

Industrial training of the students is essential to bridge the wide gap between the classroom
and industrial environment. This will enrich their practical learning and they will be better
equipped to integrate the practical experiences with the classroom learning process.

1.2 LEARNING THROUGH INDUSTRIAL TRAINING


During industrial training students must observe following to enrich their learning:
- Industrial environment and work culture.
- Organisational structure and inter personal communication.
- Machines/ equipment/ instruments - their working and specifications.
- Product development procedures and phases.
- Project planning, monitoring and control.
- Quality control and assurance.
- Maintenance system.
- Costing system.
- Stores and purchase systems.
- Layout of Computer/ EDP/MIS centres.
- Roles and responsibilities of different categories of personnel.
- Customer services.
- Problems related to various areas of Work etc.
Faculty and TPO are supposed to plan industrial training in such a manner that students get
exposure on most of the above arena in the field (world of work). Students are supposed to
acquire the knowledge on above by -
1. Observation,
2. Interaction with officials at the workplace
3. Study of Literature at the workplace (e.g. User Manual, standards, maintenance
schedules, etc.)
4. "Hand's on" experience
5. Undertaking / assisting project work.
6. Solving problems at the work place.
7. Presenting a seminar.
8. Participating in-group meeting/ discussion.
9. Gathering primary and secondary data/ information through various sources, Storage,
retrieval and analysis of the gathered data.
10. Assisting officials and managers in their working.
11. Undertaking a short action research work.
12. Consulting current technical journals and periodicals in the library.
13. Discussions with peers.

7
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME: B.E. Computer Science & Engg., VII semester


Course : CS704- Industrial Training
1.3 GUIDANCE TO THE FACULTY/TPO FOR PLANNING AND
IMPLEMENTING THE INDUSTRIAL TRAINING

The industrial training programme, which is spread to 6 weeks’ duration, has to be designed
in consultation with the authorities of the work place, keeping in view the need of the
contents. Following are some of the salient points:
• Spelling out the objectives of the industrial training in behavioral terms and same is
informed in advance to the 1) students, 2) authorities of the work place and 3)
supervising faculty members.
• Discussing and preparing students for the training for which meetings with the
students has to be planned.
• Meeting with industrial personnel and orienting them regarding the objective of the
training and the expectations of the programme.
• Correspondence with the authorities of the work place.
• Orientation classes for students on how to make the training most beneficial -
monitoring daily diary, writing weekly reports, how to interact with various categories
of industrial personnel, how to behave and undertake responsibilities, how to gather
information from the workplace, ethics etc.
• Guiding students to make individual plans (week wise/ day wise) to undertake
industrial training
• Developing a system of maintaining training records, by teachers for every batch of
students for convenient retrieval.
• Inviting industrial personnel to deliver lectures on some aspects of training.

1.4 ACTION PLAN FOR PLANNING STAGES AT THE INSTITUTION LEVEL


----------------------------------------------------------------------------------------------------------------
S.No. Activity Commencing Week Finishing week
Remarks
----------------------------------------------------------------------------------------------------------------
1. Meeting with Principal
2. Meeting with Colleagues
3. Correspondence with work place
(Industries concerned)
4. Meeting with authorities of
work place
5. Orientation of students for industrial
training
6. Scrutinizing individual training plan
of students
7. Commencement of industrial training
8. First monitoring of industrial training
9. Second monitoring of industrial training
10. Finalization of Training report
11. Evaluation of performance at
Industry level
12. Evaluation of industrial programme in the institution.

8
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME: B.E. Computer Science & Engg., VII semester


Course : CS704- Industrial Training
1.5 INDUSTRIAL TRAINING
DAILY DIARY

Name of the
Trainee:……………………………………….College:……………………………….
Industry/Work place:…………………………………………………………..Week
No.:………………
Department/Section:………………………………………………………….Date:…………
…………
----------------------------------------------------------------------------------------------------------------
Dates Brief of observations made, work done, problem/project undertaken,
discussion held, literature-consulted etc.
----------------------------------------------------------------------------------------------------------------

----------------------------------------------------------------------------------------------------------------

Signature of Supervisor Signature of Trainee Signature of Official In-


charge for
(TPO/Faculty) Training in Industry

1.6 SUPERVISION OF INDUSTRIAL TRAINING

- One faculty member or TPO will plan Industrial training of students in consultation
with training manager of the industry (work place) as per the predefined objectives of
training.
- During training students will maintain a proper daily diary (format enclosed). Main
purpose of daily diary is to inculcate the habit of systematic recording of learning
experiences and events etc. Section in-charge of the industry is requested to sign the
daily diary at the end of the week and offer his comments about the initiative and
participative attitude of trainee during training. Details about how to write daily diary
will be provided by the institute.
- Attendance record of each trainee may please be kept in the industry. Absence
without permission may please be communicated to the concerned college.
- Monitoring visits will be made by training and placement officer/faculty in-charge for
the group of students, of the College during training.

9
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL.

PROGRAMME: B.E. Computer Science and Engineering, VIII Semester


Course: CS802 Web Engineering

CATEGORY OF COURSE COURSE CREDIT-6C THEORY


COURSE TITLE CODE PAPER
Departmental Web Engineering CS802 L T P Max.Marks-100
Core COMMON WITH Min.Marks-35
3 1 2
DC-25 IT Duration-3hrs.

COURSE CONTENTS

Unit-I
Introduction
Introduction, layering, DNS - encapsulation, de-multiplexing, client /server model,
port numbers, standardization process, the Internet.
Link layer: introduction, Ethernet and IEEE 802 encapsulation, trailer encapsulation,
SLIP, PPP- Loop back interface, MTU.
Internet protocol: introduction, IP header, IP routing, subnet addressing, subnet mask-
special case of IP addresses, a subnet example.

Unit-II
Address Resolution Protocol
Introduction, an example, ARP cache, ARP packet format, ARP examples, Proxy
ARP, ARP command.
RARP: Introduction, RARP packet format, RARP examples, RARP server design.
ICMP: Introduction, ICMP message types, ICMP address mask request and reply-
ICMP timestamp request and reply- 4.4 BSD processing of ICMP Messages.

Unit-III
Ping Program
Introduction, ping program, IP record route option, IP time stamp option.
Trace route program: Introduction, trace route program operation, LAN output, and
WAN output- IP source routing option.
IP routing: Introduction, routing principles, ICMP host, and ICMP redirect errors
Dynamic Routing protocols: introduction, dynamic routing, RIP- OSPF, BGP, CIDR.
UDP: introduction, UDP header, UDP checksum, IP Fragmentation, UDP Server
design.

Unit-IV
DNS
Introduction- basics, message format, simple example, pointer quires, resource
records, caching, UDP
TFTP: introduction, protocol, security. BOOTP: introduction, packet format, server
design, through router.
TCP: Introduction, services, headers, connection establishment and termination,
timeout of connection establishment- maximum segment size- half, close, state
transition diagram, reset segments, simultaneous open and close- options, server
design.

25
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL.

PROGRAMME: B.E. Computer Science & Engineering. VIII Semester


Course: CS802 Web Engineering

Unit-V
SNMP
Introduction, protocol, structure of management information, object identifiers,
management information base, instance identification.
Telnet: rlogin protocols, examples, telnet protocol and examples. FTP, protocol,
examples, SMTP protocols, examples, NFS, TCP/IP Applications.

References:
• W. Richard Stevens , TCP/IP Illustrated Volume , I “ The Protocols “,
Addison Wesley Longman.
• Jaiswal .S, TCP\IP Principles, Architecture, Protocols And Implementation,
First Edition, Galgotia Publications Pvt Ltd.

26
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME: B.E. Computer Science & Engineering, VII semester


Course: CS7101 Network Management

CATEGORY OF COURSE COURSE CREDIT-4C THEORY


COURSE TITLE CODE PAPER
Departmental Network CS 7101 L T P Max.Marks-100
Elective Management Min.Marks-35
DCO (E)-I 3 1 0 Duration-3hrs.

COURSE CONTENTS

Unit-I
Protocols and architecture , Protocols , Characteristics , Functions , Need for
multiple protocols , Conceptual layers of multiple protocol software , Protocol
layering principles , Multiplexing and Demultiplexing.

Unit-II
Internet Protocol , Virtual network , Internet architecture and philosophy ,
Purpose of the internet protocol , Internet diagram , Routing in an internet , table
driven IP internet , IP routing algorithm , Internet control message protocols
(ICMP) , Internet protocol version 6 , Features , Format , Source routing , Options
, address space assignment , User data gram protocol , Format of UDP messages ,
UDP encapsulation and protocol layering.

Unit-III
Transmission control protocol, Need for stream delivery, Properties of reliable
delivery service, Ports, Connections and pins, Window size and flow control -
TCP segment format, Acknowledgement, Timeouts, Robustness, Establishing and
clearing TCP connects.
Route discovery protocols, Core, peers, Gateway to gating algorithm (GGP),
Routing, Autonomous system concepts, Exterior gateway protocol, Routing
information protocol (RIP), The Hello protocol, Open shortest path first protocol
(OSPF).
Application layer protocols, TELNET protocols, File transfer protocols (FTP),
Simple mail transfer protocol (SMTP), X-Window system protocol, Remote
procedure call, Network file system, proof to point protocol.

Unit -IV
General structure of a network management product , Information extraction and
collection instruments , Monitoring principles , Instruments supporting physical
network management , Line monitors , Data scopes , network monitors ,
Instruments supporting logical network management , Accounting packages ,
Application monitoring , Communication monitors , Security monitors , LAN
monitors.

12
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME: B.E. Computer Science & Engineering, VII semester


Course: CS 7101 Network Management

Unit-V
Configuration management , Configuration management functions , Inventory
managements , Network topology services , Order processing and provisioning ,
Charge management directory services.
Fault management, Processes and procedure , Fault management functions ,
Performance management , Security management , accuracy management ,
Network capacity planning.

References:
• Uyless Black, TCP/IP and related protocols, McGraw Hill.
• Udupa, Network Management System Essentials, McGraw Hill.
• Doughals E. Comer, Internetworking with TCP/IP Vol. I , Principles,
Protocols, and Architecture, Prentice Hall, India.
• Kernel Terplan, Communication Network management, Prentice Hall of
India.

13
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL
PROGRAMME : B.E. Computer Science & Engineering, VII semester
Course : CS 7102 Advance Computer Architecture

CATEGORY OF COURSE COURSE CREDIT-4C THEORY


COURSE TITLE CODE PAPER
Departmental Advance CS7102 L T P Max.Marks-100
Elective Computer Min.Marks-35
DCO(E)-I Architecture 3 1 0 Duration-3hrs.

COURSE CONTENTS
Unit-I
Evolution of Computer Architecture, System Attributes to performance,
Multiprocessor and Multi computers, Data and resource dependencies, Hardware &
Software Parallelism, Program Partitioning and scheduling, Grain sizes and latency,
Grain packing & Scheduling, Static Multiprocessor scheduling, Program flow
Mechanisms, Control flow and Data flow, Demand- driven mechanism, Back plane
Bus systems, Bus specification, Arbitration, Transaction and interrupt, IEEE future
bus + Standards.

Unit-II
Cache Memory organization, Cache performance issues, Interleaved Memory
organizations, Bandwidth and fault tolerance, Memory allocation Schemes. Linear
pipeline processors, asynchronous and synchronous Nudels, Speedup, Efficiency and
through put. Non-linear pipeline processors, Reservation and latency analysis,
Collision free scheduling. Braches handling and Hazard avoidance, Dynamic
instruction scheduling, Arithmetic pipeline design, super scalar and super pipeline
design.

Unit-III
Vector computers, Vector instruction types, Vector access Memory schemes, Multi
vector Multi processors, Compound vector processing, Static and dynamic
Interconnection networks. Cache coherence, Snoopy bus protocols, Directory
protocols, Hardware synchronization mechanisms, Message passing mechanisms,
Message routing schemes, Deadlock and Virtual channels, Flow control strategies,
Multicast reacting algorithms.

Unit-IV
Principles of scalable performance, Performance metrics and measures, Parallelism
profile in programs, Harmonic mean performance, Efficiency, Utilization and quality,
Standard performance measures, Application models of parallel computers. Speedup
performance laws, Amdahls law for fixed workload, Memory bounded speedup
model, Scalability analysis and approaches, Scalability matrix and goals.

Unit-V
Introduction to parallel programming and parallel programming models, Parallel
languages and compilers, dependence analysis of data arrays, Code optimization and
scheduling, Loop parallization and pipelining, Parallel program development and
environments, Synchronization, Shared variable program structures.

References:
• Kai Hwang, Advance Computer Architecture, McGraw Hill.

15
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME : B.E. Computer Science & Engineering, VII semester


Course : CS7103 Software Project Management
CATEGORY OF COURSE COURSE CREDIT-4C THEORY
COURSE TITLE CODE PAPER
Departmental Software CS7103 L T P Max.Marks-100
Elective Project Min.Marks-35
3 1 0
DCO(E)-I Management Duration-3hrs.

COURSE CONTENTS
Unit-I
Managing Software Projects
Software products, process and project management, CMM, KPAs for Project
management, Software process improvement, resource management, team
work and structure, training, project metrics, documentation, project
management for conventional and object oriented software projects, Software
Project, Knowledge Based Management

Unit-II
Project Planning
Project planning infrastructure, process planing, feasibility analysis, cost and
efforts estimation, models and techniques, risk analysis and RMMM plan,
project scheduling and tracking plan, SQA and quality planing, SCM activities
and plan, project management plan.

Unit-III
Project Execution and Closure
Data collection, measurements, reviews, monitoring and control, status
reporting, process inputs and outputs, synchronization, deliverables, milestone
recording and their analysis, Defect analysis and prevention, audits, project
closure analysis and reporting

Unit-IV
Project Management for special classes of Software Projects
Using CASE tools, CBSE, Re-engineering, reverse, forward engineering,
client/server software engineering, web engineering, outsourcing, Software
project management standards

References:
• Dr. Pankaj Jalote, “Software Project Management”, Pearson Publication
• Dr. Pankaj Jalote, CMM in Practice, Pearson Publication
• R. Pressman, Software Engineering 5th edition McGraw Hill Publication
• Ian Somerville , Software Engineering, 5th edition, AWL Publication
• Stephen R. Schach, “Object-Oriented and Classical Software
Engineering”, 5th edition, Tata-McGraw Hill.
• Hughes and Cotterell, Software Project Management, TMH.

16
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME : B.E. Computer Science & Engineering, VII semester


Course : CS 7201 Network Security

CATEGORY OF COURSE COURSE CREDIT-4C THEORY


COURSE TITLE CODE PAPER
Departmental Network CS 7201 L T P Max.Marks-100
Elective Security Min.Marks-35
DCO(E)-II 3 1 0 Duration-3hrs.

COURSE CONTENTS

Unit-I
Conventional Encryption
Convention Encryption: Conventional Encryption Model , Steganography , Classical
Encryption Techniques , Simplified DES , Block Cipher Principles , The Data
Encryption Standard , The Strength of DES , Differential and Linear Cryptanalysis ,
Block Cipher Design Principles , Block Cipher Modes of operation , Conventional
Encryption algorithms

Unit-II
Public Key Encryption And Hash Functions
Public Key Cryptography , Principles of Public Key Cryptosystems , The RSA
Algorithm , Key Management , Diffie Hellman Key Exchange , Elliptic Curve
Cryptography
Message Authentication and Hash Functions
Authentication Requirements, Authentication Functions, Message Authentication
Codes , Hash Functions , Security of Hash Functions

Unit-III
Hash And Mac Algorithms
MD5 Message Digest Algorithm , Secure Hash Algorithm (SHA-I) , RIPEMD ,
HMAC
Digital Signatures and Authentication Protocols
Digital Signatures , Authentication Protocols -Digital Signature Standard

Unit-IV
Authentication Applications , IP Security , Web Security

Unit-V
Intruders, Viruses and Worms
Intruders , Viruses and Related Threats
Firewalls
Firewall Design Principles , Trusted Systems

References:
• William Stallings, “ Cryptography and Network Security”, Second edition, Prentice
Hall,1999.

19
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME : B.E. Computer Science & Engineering, VIII semester


Course : CS 7202 CAD of Digital Systems

CATEGORY COURSE TITLE COURSE CREDIT-4C THEORY


OF COURSE CODE PAPER
Departmental CAD of Digital CS 7202 L T P Max.Marks-100
Elective Systems Min.Marks-35
DCO(E)-II 3 1 0 Duration-3hrs.

COURSE CONTENTS
Unit-I:
Introduction to VLSI: History of IC Design. Design requirements, basics of VLSI
Issues like speed, area , power. Introduction to ASICs, Difference between ASICs and
PLDs, Various EDA tool their features, Design flow using Xilinx foundation series
software.

Unit- II
Deigning with VHDL: Introduction to VHDL, features and abstraction, VHDL
language elements, Entity, architecture, configuration and library, Sequential &
concurrent constructs, generics and attributes, Behavioural modeling in VHDL.

Unit-III
Simulation & Synthesis: Fundamental of simulation, concept of delays, simulation
process & type of simulators.
Introduction to synthesis, simulation vs. synthesis, synthesis design flow, synthesis
process, synthesis tools, and features, optimisation in VHDL. Synchronous and
asynchronous reset hardware modeling examples.

Unit-IV
Study of programmable logic device architecture types of prog. Logic classification,
architecture of CPLD 9572 & fpga 4000 SERIES FROM XILINX .
Finite state machines (FSM ) types( sync./async Moore/mealy) FSM design
procedures state vector encoding reduction methods .

Unit-V
Timing issues clock issues timing groups and paths calculation of max. Frequency,
timing constraints, static time analysis (STA) critical path difference between STA
and dynamic timing analysis.
Introduction to CMOS VLSI: MOS transistor theory, CMOS inverter design,
Designing CMOS logic gates, issues related to sizing of transistor stage ratio, stick
diagrams, design rules and layout of some standard logic gates.

References:
• Dougles, Basic VLSI design Systems and circuits, PHI.
• Wolf, Modern VLSI design, Prentice Hall.
• Navabz, VHDL Analysis & Modeling, McGraw Hill.
• Peter Ashenden, The designer guide to VHDL,
• Neil, Principle of CMOS VLSI Design, Pearson Education.
• WWW.XLINX.COM Notes available on Website of Xinlinx.

21
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME: B.E. Computer Science & Engineering, VII semester


Course: CS 7203 Fuzzy Logic for Engineering Applications

CATEGORY OF COURSE COURSE CREDIT-4C THEORY


COURSE TITLE CODE PAPER
Departmental Fuzzy Logic CS7203 L T P Max.Marks-100
Elective for Engg. Min.Marks-35
DCO (E)-II Applications 3 1 0 Duration-3hrs.

COURSE CONTENTS
Unit-I
Introduction:
Introduction to fuzzy logic, neuro fuzzy, and soft computing, from conventional AI to
computational intelligence, Neural Network, Evolutionary computation, Neuro fuzzy
and soft computing characteristics, Fuzzy set theory; Basic definition & terminology,
set theoretic operations, MF formulation & parameterization, Fuzzy union,
intersection & compliment.

Unit-II
Fuzzy Rules & fuzzy Reasoning:
Extension Principles and Fuzzy Relations, Fuzzy if-then rules, linguistic Variables,
Fuzzy reasoning, compositional rules of inference, Fuzzy systems as function
estimators, Fuzziness as multivalence.

Unit-III
Fuzzy Inference system:
Mamdani Fuzzy models, other variants, sugeno Fuzzy models, Tsukamoto Fuzzy
models, Input space partitioning, Fuzzy modeling, Intelligent behavior as adaptive
model free estimation.

Unit-IV
Adaptive Fuzzy Systems:
Fuzzy sets and systems, Fuzziness in a probabilistic world, randomness V/S
ambiguity, The universe as a fuzzy set, The geometry of fuzzy sets, the Fuzzy entropy
theorem, The subsethood theorem, the entropy subsethood theorem, Introduction to
Fuzzy associative memories.

Unit-V
Regression and optimization :
Introduction to least-square methods for system identification and derivative based
optimization, derivative free optimization : Genetic algorithm, Simulated Annealing,
Random search, Downhill simplex search.

References:
• S.R. Jang, Sun & Mizutani, Neuro-Fuzzy and soft computing, PHI.
• Bart Kosko, Neural Network & Fuzzy Systems, PHI.
• Haykin, Fuzzy Logic & Artificial Neural Network: A Comprehensive
Foundation, Asea Pearson.

22
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME: B.E. Computer Science & Engineering, VIII semester


Course: CS8301 ATM Networks

CATEGORY OF COURSE COURSE CREDIT-4C THEORY


COURSE TITLE CODE PAPER
Departmental ATM CS8301 L T P Max.Marks-100
Elective Networks Min.Marks-35
DCO (E)-III 3 1 0 Duration-3hrs.

COURSE CONTENTS

Unit-I
Introduction to ISDN, B-ISDN, B-ISDN services, ATM basics, ATM Services,
Architecture of B-ISDN, virtual channel, Virtual path, ATM performance Parameters,
Signaling techniques

Unit-II
ATM – performance Reference Model (PRM) layered architecture, relationship
between ATM PRM and OSI reference model. Layer functions, User Network
Interface (UNI), Physical layer of UNI, functions of transmission convergence sub
layer, physical medium characteristic ATM layer cell headers of B-ISDN, UNI &
NNI, ATM adaptation layer, operation and maintenance of B-ISDN UNI.

Unit-III
B-ISDN signaling, meta signaling, ATM adaptation layer for signaling, signaling
protocols, switches & cross connects.

Unit-IV
ATM transmission network, Cell transfer functions, transmission systems, network
synchronization, B-ISDN local network Topology & Technology, trunk, network
structure, ATM network implementation and its equipments.

Unit-V

Evolutionary scenarios for BISDN fiber to the customer, integration of TV


distribution, LAN’s, Man’s to BISDN, Voice delay & Eco problem, Tainting in
BISDN, Telecommunication management networks, Gigabits LAN’s, Optical
switching, ATM standardization.

References:

• Rainer Handel, Huber & Schooder ATM Network, Addison Wesley


• David E Mc Dysan, ATM Theory & application, McGraw Hill
• Tennenbaum, Computer Network
• William Stalling, An Introduction to ISDN, McMillan publishing Co., USA

29
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME: B.E. Computer Science & Engg. VIII Semester


Course: CS 8302 Embedded Systems

CATEGORY COURSE COURSE CREDIT-4C THEORY PAPER


OF COURSE TITLE CODE
Departmental Embedded CS8302 L T P Max.Marks-100
Elective Systems 3 1 0 Min.Marks-35
DCO(E)-III Duration-3hrs.

COURSE CONTENTS
Unit-I
Introduction and Review Of Embedded Hardware
Terminology Gates, Timing Diagram, Memory, microprocessors Buses, Direct
Memory Access, interrupts, Built, ins on the Microprocessor, Conventions Used on
Schematic, Interrupts Microprocessor Architecture, Interrupt Basics, Shared Data
Problem, Interrupt latency.

Unit-II
Pic Micro controller And Interfacing
Introduction, CPU architecture, registers, instruction sets addressing modes Loop
timing, M, Analog to digital converter, UART, Baud Rate, Data Handling,
Initialisation, Special Features, serial Programming, Parallel Slave Port.

Unit-III
Embedded Microcomputer Systems `
Motorola MC68H11 Family Architecture Registers, Addressing modes Programs.
Interfacing methods parallel I/O interface, Parallel Port interfaces, Memory
Interfacing, High Speed I/o Interfacing, Interrupts, interrupt service routing, features
of interrupts, Interrupt vector and Priority, timing generation and measurements, Input
capture, Output compare, Frequency Measurement, Serial I/O devices RS. 232, RS.
485. Analog Interfacing Applications.

Unit-IV
SOFTWARE DEVELOPMENT AND TOOLS
Embedded system evolution trends. Round, Robin, robin with Interrupts, function,
One, Scheduling Architecture, Algorithms. Introduction to, assembler, compiler, cross
compilers and Integrated Development Environment (IDE) Object Oriented
Interfacing, Recursion, Debugging strategies, Simulators.

Unit-V
Real Time Operating Systems
Task and Task States, tasks and data, semaphores and shared Data Operating system
Services, Message queues, Timer Function, Events, Memory Management, Interrupt
Routines in an RTOS environment, Basic design using RTOS.

30
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME: B.E. Computer Science & Engg., VII Semester


Course: CS8302 Embedded Systems
References:
• David E Simon, “ An embedded software Primer” Pearson education Asia.
• John B Peat man “ Design with Micro controller” Pearson education Asia.
• Jonathan W. Valvano Brooks/Cole “ Embedded Micro Computer Systems.
Real time Interfacing”, Thomson learning.
• Burns, Alan and Welling, Andy, “ Real-Time Systems and Programming
Languages”, Second Edition. Harlow: Addison, Wesley, and Longman.
• Raymond J.A. Bhur and Donald L. Bialey, “An Introduction to real time
systems: Design to networking with C/C++”, Prentice Hall Inc. New
Jersey.
• Grehan Moore, and Cyliax, “Real time Programming: A guide to 32 Bit
Embedded Development. Reading,” Addison, Wesley, Longman.
• Health, Steve, “Embedded Systems Design”, Newnes.

31
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME: B.E. Computer Science & Engineering, VIII semester


Course: CS8303 Digital Image Processing

CATEGORY OF COURSE COURSE CREDIT-4C THEORY


COURSE TITLE CODE PAPER
Departmental Digital Image CS8303 L T P Max.Marks-100
Elective Processing Min.Marks-35
DCO (E)-III 3 1 0 Duration-3hrs.

COURSE CONTENTS

Unit-I
Digital Image fundamentals, A simple image model, Sampling and Quantization.
Relationship between pixels. Imaging geometry. Image acquisition systems, Different
types of digital images

Unit-II
Image transformations, Introduction to Fourier transforms, Discrete Fourier
transforms, Fast Fourier transform, Walsh transformation, Hadmord transformation,
Discrete Cosine Transformation.

Unit-III
Image enhancement, Filters in spatial and frequency domains, Histogram based
processing. Image subtraction, Averaging, Image smoothing, Nedion filtering, Low
pass filtering, Image sharpening by High pass filtering.

Unit-IV
Image encoding and segmentation, Encoding: Mapping, Quantizer, Coder. Error free
compression, Lossy Compression schemes. JPEG Compression standard. Detection of
discontinuation by point detection, Line detection, edge detection, Edge linking and
boundary detection, Local analysis, Global processing via Hough transforms and
graph theoretic techniques

Unit-V
Mathematical morphology- Binary, Dilation, crosses, Opening and closing, Simple
methods of representation, Signatures, Boundary segments, Skeleton of a region,
Polynomial approximation

References:
• R. Gonzalez & Richard E. Woods, Digital Image Processing.
• Sonka, HLAVAC, Boyle, Image Processing, Analysis and Machine Vision,
Vikas Pub.
• Pratt K William, Digital Image Processing, John Wiley.
• Sonka M., Hilvac V, Boyle R, Analysis and Machine Vision, Vikas/Thomson
Learning.
.

34
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME: B.E. Computer Science & Engg., VIII Semester


Course: CS8401 Wireless Network & Computing

CATEGORY COURSE COURSE CREDITS - 4C THEORY


OF COURSE TITLE CODE PAPERS
Departmental Wireless CS8401 L T P Max.Marks-100
Electives Network & 3 1 0 Min.Marks-35
DCO(E)-IV Computing Duration-3hrs.

COURSE CONTENTS

Unit-I
Introduction to wireless, Cellular, Digital, PCS mobile radio, Speech coding for
wireless system and application like PCM, DPCM, DM, Vocoder & Linear
Predictive coding. Performance comparison.

Unit-II
Media Access Control, Telcom System Satellite System, Broadcast System.

Unit-III
Wireless LAN
IEEE802-11Hiper LAN, Bluetooth, Adhoc Network: Characteristic, Performance
issue, Routing in mobile host.

Unit-IV
Network issue
Mobile IP, DHCP, Mobile Transport layer, Indirect TCP, Snooping TCP, Mobile
TCP, Time out freezing, Selective transmission, Transaction oriented TCP.

Unit-V
Application Issue
Wireless Application control Dynamic DNS, File System synchronization
protocol, Context aware application security, Analysis of existing wireless
Network.

References:

• J. Schiller, Mobile Communication, Addision Wiley


• William C.Y. Lee, Mobile Comm. Design Fundamental. John wiley.
• Dr. Kamilo Feher, Wireless Digital Communication, PHI.
• Mark Ceampa, Design & Implementation of Wireless LANs, Thomson
Learning.

38
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL. Formatted

PROGRAMME: B.E. Computer Science & Engg., VIII Semester


Course: CS8402 Data Mining and Warehousing

CATEGORY COURSE COURSE CREDITS - 4C THEORY


OF COURSE TITLE CODE PAPERS
Departmental Data Mining and CS8402 L T P Max.Marks-100
Elective Warehousing 3 1 0 Min.Marks-35
DCO(E)-IV Duration-3hrs.

Course Contents
Unit-I
Information, Theoretic Approach to knowledge discovery – Data explosion in
the Internet Age, Knowledge discovery in databases (KDD), Verification-Based
Methods of Data Mining, Feature Selection Methods, Learning issues,
Information theory-the data mining perspective, Data Modeling, Book
Organization.

Unit-II
Automated data pre-processing – Discretization of Ordinal Features, Static
Discretization Algorithms, The Partitioning Procedure, Computational
Complexity of the static Algorithm, Static Discretization and Dimensionality
Reduction.

Unit-III
Information-Theoretic Connectionist Networks- A Unified Approach to Data
Modeling, Constant Structure information-Theoretic Networks, Multi-Layer
Information-Theoretic Network, Dynamic Discretization of Ordinal Attributes.
Post-Processing of Data Mining Results-Rule Extraction and Reduction,
Prediction, From Local to Global Modeling.

Unit-IV
Methodology of Application- Overview of the Discovery Process, Understanding
the Problem Domain, Obtaining and Understanding the Data, Preparation of the
Data, Construction of the Knowledge Model from Data, Evaluation of the Model,
Using the Model (Inter preparation and Post – Processing) Advanced data mining
methods-Anytime Algorithm for Knowledge Discovery, Data Reliability.

Unit-V
Summary and Some Open Problems- Methods Benefits and Limitations Future
Research.

References:
• Oded Maimon & Mank, Knowledge Discovery and Data Mining, Kluwer
Academic Publisher.

41
RAJIV GANDHI PROUDYOGIKI VISHWAVIDYALAYA, BHOPAL

PROGRAMME : B.E. Computer Science & Engineering, VIII semester


Course : CS8403 Pattern Recognition

CATEGORY OF COURSE COURSE CREDIT-4C THEORY


COURSE TITLE CODE PAPER (ES)
Departmental Pattern CS8403 L T P Max.Marks-100
Elective Recognition Min.Marks-35
DCO(E)-IV 3 1 0 Duration-3hrs.

COURSE CONTENTS

Unit-I
Introduction to pattern recognition, Types of images, Regular patterns, Irregular
pattern, Pattern recognitions systems: Fundamental problems, Design, Concepts
and methodologies: Character recognition, Speech recognition, Finger print
recognition.

Unit-II
Combined detection method, Edge detection, Edge linking, Gradient, laplacian,
Line detection, Motion based, Point detection, Snake Method.

Unit-III
Boundary description, Detection, Matching merging, Segmentation, Smoothing,
Splitting of boundaries, Syntactic analysis of region boundaries, Study of shape
by region analysis.

Unit-IV
Statistical pattern recognition, Bayer theorem: Bayes Classifier for normal
patterns, Multiple features, Conditionally independent features, Decision
boundaries, Estimation of error rates. Trainable pattern classifier, Deterministic
approach, Perception approach, Gradient approach: Gradient descent algorithms-
LMSE algorithms. Features extraction, syntactic pattern clustering, Hierarchical
and partional clustering

Unit-V
Fuzzy approach applied to pattern recognition, Classificatory analysis
preprocessing, Feature detection and primitive extraction, Adaptive classification
of fuzzy grammar.

References:
• Earl Rose, Richard Johnson Baugh, Steve Jost, Pattern Recognition & Image
Analysis.
• J.T. Tou, R.C Gohzale, Pattern Recognition Principle, Addison Wesley.

42