Syllabus

B.Tech.
(Computer Science and Engineering) - Syllabus

(Board of studies – 25th Feb 2006)
CURRICULUM & SYLLABUS
B. TECH.
(COMPUTER SCIENCE AND
ENGINEERING)
SCHOOL OF COMPUTER SCIENCES
VELLORE INSTITUTE OF TECHNOLOGY

DEEMED UNIVERSITY
VELLORE – 632 014.
A PLACE TO LEARN; A CHANCE TO GROW

1
B.Tech. (Computer Science and Engineering) - Syllabus
VELLORE INSTITUTE OF TECHNOLOGY

DEEMED UNIVERSITY
INDEX
Sl.no Sub-code Subject L T P IPT Proj C Pg.no

SEMESTER- III
1. 05BCE201 Complex Variables and Partial Differential 2 1 3 15
Equations*
2. 05BCE203 Data Structures and Algorithms* 3 0 3 17
3. 05BCE205 Electronic Devices & Circuits* 3 0 3 18
4. 05BCE207 Introduction to Nano Technology 3 0 3 19
5. 05BCE209 Digital Computer Fundamentals * 3 0 3 20
6. 05BCE211 Object Oriented Programming * 2 1 3 21
7. 05BCE213L Object Oriented Programming Lab 2 2 22
8. 05BCE215L Electronic Devices Lab 2 2 23
SEMESTER – IV
9. 05BCE202 Probability, Statistics and Reliability * 2 1 3 24
10. 05BCE204 Computer Profession and Society * 3 0 3 25
11. 05BCE206 Microprocessor & Interfacing Techniques 3 0 3 27
*
12. 05BCE208 Principles of Computation * 3 0 3 28
13. 05BCE 210 Software Engineering * 2 1 3 29
14. 05BCE 212 Data base Management System* 3 0 3 30
15. 05BCE 214L Microprocessor And Interfacing Lab 2 2 31
SEMESTER – V
17. 05BCE 301 Discrete Mathematical Structures* 2 1 3 34
18. 05BCE 303 Internet Programming 2 1 3 35
19. 05BCE 305 Computer Architecture And Organisation* 3 0 3 36
20. 05BCE 307 Computer and Communication Networks 3 0 3 37
21. 05BCE 309 Theory of Computation* 3 0 3 38
22. 05BCE 311 Soft Computing 3 0 3 39
23. 05BCE 313L Net working Lab 2 2 40
24. 05BCE 315L Internet Programming Lab 2 2 41
25. Project 2 2
SEMESTER – VI
26 ELECTIVE - I 2 1 3
05BCE 302 Programming Language Processors 2 1 3 42
27. 05BCE 304 Object Oriented Analysis and Design 3 0 3 43
28. 05BCE 306 Linux System Programming 2 1 3 44
29. 05BCE 308 Operating Systems* 3 0 3 45
30. 05BCE 310 Graph Theory And its Application 2 1 3 46
32. 05BCE 314L Linux System Programming Lab 2 2 47
33. 05BCE 316L Operating System Lab 2 2 48
34. Inplant Training 2 2
35. Project 4 4
SEMESTER – VII
36. 05BCE 401 Peripherals Interfacing and Trouble 2 1 3 49
Shooting
2
37. 05BCE 403 Embedded Systems 3 0 3 50

38. 05BCE 405 Network Security 3 0 3 51
40. ELECTIVE – II (FREE ELECTIVES) 3 0 3
41. ELECTIVE – III (SCHOOL 3 0 3
SPECIFIC ELECTIVES)
42. 05BCE 413L Peripherals Interfacing Lab 2 52
43. 05BCE 415L Embedded Systems Lab 2 53
45. Project 6 6
SEMESTER – VIII
46. 05BCE 402 Project 28
ELECTIVE – I
05BCE E 02 Resource Management 37
05BCE E 04 Real Time Systems 38
05BCE E 06 Distributed Data Base Systems 39
05BCE E 08 Soft Computing 40
05BCE E 10 Internet Working & Technologies 40
05BCE E 12 Basic Bio-Informatics 41
05BCE E 14 Distributed Computing 42
ELECTIVE – II (FREE ELECTIVES)

05BCE E01 Computer Simulation & Modelling 54
05BCE E03 Distributed Computing 55
05BCE E05 Distributed Database System 56
05BCE E07 Data warehousing and data mining 57
05BCE E09 Mobile Communication** 58
05BCE E11 Web Services 59
ELECTIVE – III (SCHOOL SPECIFIC ELECTIVES)
05BCE E15 Pattern Recognition 60
05BCE E17 Client Server Technology 61
05BCE E21 Web Commerce 62
05BCE E23 Data Compression Techniques 63
05BCE E25 Software Practice and Testing 64
05BCE E27 Computer Graphics 66
05BCE E29 ROBOTICS 67
05BCE E31 Neural Networks 68
05BCE E33 Operation Research 69
05BCE E35 Digital Signal Processing 70
05BCE E37 Decision Support System** 71
* COMMON BETWEEN CSE & IT

** SCHOOL SPECIFIC ELECTIVES
***FREE ELECTIVES
3
VELLORE INSTITUTE OF TECHNOLOGY, VELLORE - 14

School of Computer Sciences
COURSE – B.TECH – COMPUTER SCIENCE & ENGINEERING
(For Students admitted during the Academic Year 2006 – 2007 and thereafter)
THIRD SEMESTER:
Periods/Week Credits
S.No Sub Code Subject
Lec Tut Pra
1 06BCE 201 Complex Variables and Partial Differential 2 1 3
Equations*
2 06BCE 203 Data Structures and Algorithms* 3 0 3
3 06BCE 205 Electronic Devices & Circuits* 3 0 3
4 06BCE 207 Introduction to Nano Technology 3 0 3
5 06BCE 209 Digital Computer Fundamentals * 3 0 3
6 06BCE 211 Object Oriented Programming * 2 1 3
7 06BCE 215 L Object Oriented Programming Lab 2 2
8 06BCE 217 L Electronic Devices Lab 2 2
TOTAL 12 6 4 22
FOURTH SEMESTER:
Periods/Week
S.No Sub Code Subject Credits
Lec Tut Pra
9 06BCE202 Probability, Statistics and Reliability * 2 1 3
10 06BCE 204 Computer Profession and Society * 3 0 3
11 06BCE 206 Microprocessor & Interfacing Techniques * 3 0 3
12 06BCE 208 Principles of Computation * 3 0 3
13 06BCE 210 Software Engineering * 3 0 3
14 06BCE 212 Data base Management System* 3 0 3
15 06BCE 214L Microprocessor And Interfacing Lab 2 2
16 06BCE 216L RDBMS Lab 2
TOTAL 12 6 4 22
FIFTH SEMESTER:
Periods/Week
Lec Tut Pra Proj
17 06BCE 301 Discrete Mathematical Structures* 2 1 3
18 06BCE 303 Internet Programming 2 1 3
Computer Architecture And 3 0
19 06BCE 305 3
Organisation*
Computer and Communication 3 0
20 06BCE 307 3
Networks
21 06BCE 309 Theory of Computation* 3 0 3
22 06BCE 311 Soft Computing 3 0 3
23 06BCE 313 L Net working Lab 2 2
24 06BCE 315 L Internet Programming Lab 2 2
25 Project 2 2
TOTAL 12 6 4 2 24
* COMMON BETWEEN CSE & IT

***FREE ELECTIVES
4
SIXTH SEMESTER:
S.No Sub Code Subject Periods / Week Credits
.
Lec Tut Pra Inp. Proj
26 06BCE302 Programming Langauage Processors 2 1 3

27 06BCE 304 Object Oriented Analysis and Design 3 0 3
28 06BCE 306 Linux System Programming 2 1 3
29 06BCE 308 Operating Systems* 3 0 3
30 06BCE 310 Graph Theory And its Application 2 1 3
31 06BCE 312 Elective - I 3 0 3
32 06BCE 314 L Linux System Programming Lab 2 2
33 06BCE 316 L Operating System Lab 2 2
34 Inplant Training 2 2
Project 4 4
Total 12 6 4 6 28
SEVENTH SEMESTER:
S. Periods/Week
No Sub Code Subject Pra Com Credits
Lec Tut Proj
.
Peripherals Interfacing and Trouble
35 06BCE 401 2 1 3
Shooting
36 06BCE 403 Embedded Systems 2 1 3
37 06BCE 405 Network Security 2 1 3
ELECTIVE – II (FREE
38 2 1 3
ELECTIVES)
ELECTIVE – III (SCHOOL 2
58 2
SPECIFIC ELECTIVES)
59 06BCE 413 L Peripherals Interfacing Lab 2 2
60 06BCE 415 L Embedded Systems Lab 2 2
61 Project 6 6
Total 12 6 4 2 6 30
* * SCHOOL SPECIFIC ELECTIVES
EIGHTH SEMESTER:
Periods/Week
Lec Tut Pra
63 06BCE 402 Project 28
TOTAL 28
5
L T P C
06BCE 201 COMPLEX VARIABLES AND PARTIAL 2 1 0 3
DIFFERNTIAL EQUATIONS *
Aim & Objectives:
The aim of this course is to present a comprehensive, compact and integrated treatment of two most
important branches of applied mathematics for engineers and scientists namely
(i) The functions of complex variable and
(ii) Partial differential equations in finite and infinite domains.
Since difference equations arise very frequently in engineering sciences and numerical analysis it is proposed to
devote a few classes on difference equations and Z-transforms also.
By the end of the course, the students are expected to develop the necessary mathematical skills, physical
understanding of problems and intuition to independently analyze the mathematical equations which model the
problems in their respective fields of study.
Functions of a Complex Variable: Functions of a complex variable, limits and continuity, Cauchy – Riemann
equations, Analytic and Harmonic functions – Complex potential – Applications to flow around a corner and
around a cylinder, Branch points, branch cuts, linear transformations (w = zA+B, w = z2 ,w= ez), Bilinear
transformation, concept of conformal transformation – Qualitative discussion on applications.
Complex Integration: Integration in the complex plane along a contour, the Cauchy- Goursat theorem, integral
theorem – Derivatives of analytic functions, Taylor and Laurent series(without proof's) singularities – zeros –
Poles, Residues, Cauchy’s Residue theorem – Evaluation of integrals by the method of residues, Jordan’s lemma
(without proof), Indented contour integral, Inversion contours for Laplace, Fourier and z- transforms.
Partial Differential Equations: Introduction – Formation of PDEs – Solution of PDE – General, Particular and
Complete integrals – Lagrange’s Linear Equations – Linear PDE of Higher order with Constant Coefficients –
Homogeneous and non homogeneous equation – Solution of PDEs by the method of separation of variables.
Applications of Partial Differential Equations : Solution of Laplace equations in Cartesian, Cylindrical and
Spherical coordinates – variable separable method: Potential flow over a sphere. Wave Equation-Vibrations of a
Stretched string-Variable Separable Method- D’Alembert’s solution for the initial value problem, Vibrations of a
circular membrane Diffusion equation in Cartesian and Cylindrical coordinates.
Integral Transforms, Difference Equations & Z-transforms: Difference equations with constant coefficients-
Complementary function, particular integral – method of undetermined co-efficient, variation of parameters
technique (without proof), application to ladder type electrical network. Z-transform – definition – relation
between Z – transform and Laplace transform, Z-transform of elementary functions, properties of Z-transforms
(proofs not required) Initial and final value theorems- Inverse Z-transforms – partial fraction expansion method,
Inversion contour method-solution of difference equations by Z- transform method. Exponential Fourier series –
Fourier Integral Transforms – Definition – Fourier Integral – Fourier sine and cosine transforms; - Properties of
Fourier transforms – Convolution theorem for Fourier transforms – Parseval’s identity for Fourier transforms
(proof not required) Application of Integral Transforms to Partial differential equations: (i) Heat flow in an infinite
bar (ii) Wave propagation on a semi infinite string (iii) Steady state heat flow in a semi-infinite domain.
6
TEXT BOOKS:
1. Erwin Kreyzsizig, “Advanced Engineering Mathematics”, 8th Edition, John Wilag & Sons (Wiley student
Edison), 2004.
2. B. S. Grewal, “Higher Engineering Mathematics”, 38th Edition, Khanna Publications, 2005.
REFERENCE BOOKS:
1. J. W. Brown and R.V. Churchill, “Complex variables and application”, McGraw Hill International ed., 7th
Edition, 2004.
2. R. V. Churchill and J. W. Brown, “Fourier series and Boundary value problems”, International student edition
(1978).
3. Ian Sneddon, “Elements of Partial Differential equations”, McGraw – Hill International edition (1985).
4. MichaelD. Greenberg, “Advanced Engineering Mathematics”, 2nd Edition, Pearson Education (2002).
5. Peter V. O’ Neil, “Advanced Engineering Mathematics”, 5th Edition, John Wiley & Sons (2000).
7
L T P C
06BCE 203 DATA STRUCTURES AND ALGORITHMS * 3 0 3
Aim: This subject aims to impart knowledge about various types of data structures (standard and user defined). It
covers algorithm analysis for the run time complexities and the space requirements.
Objectives: To make the Students learn various types of data structures and algorithm analysis. The students
would be able to implement various data structures and apply operations on them and also implement various
sorting and searching techniques.
Algorithm Analysis: Mathematical background model – running time calculations – complexity analysis –
Abstract Data Types (ADT) – asymptotic notations.
Stacks, Queues & Lists: Stack: ADT – stack model – implementation of stacks – applications of stacks– infix,
prefix and postfix expressions and their conversions, Queue: ADT – queue model – array implementation of
queues, List: ADT – simple array implementation of lists – linked lists– doubly and circular linked lists – cursor
implementation of linked lists – polynomial addition and multiplication, Overview of Garbage collection &
Compaction
Trees: Preliminaries – implementations of trees – tree traversals (inorder, preorder, postorder) – binary trees –
implementation – expression trees – binary search trees – threaded binary trees – B_tree – B+trees – hashing –
hash function, depth first search and breadth first search – shortest path algorithm.
Sorting Techniques: Insertion sort and its analysis, Shell sort, Heap sort and its analysis, merge sort and its
analysis, quick sort and its analysis, bucket sort, selection sort, external sort.
Algorithm Design Techniques: Divide and Conquer Algorithm – Strassen’s matrix multiplication and its
analysis, Greedy Method- knapsack 0/1, Dynamic Programming- traveling salesman problem, Back Tracking- 8
queens problem, Branch and Bound- traveling salesman problem – algebraic manipulations, Lower Bound
Theory- Basic concepts of NP-hard and NP-complete.
TEXT BOOK:
1. Mark Allen Weiss, “Data Structures & Algorithm Analysis in C++”, Addison Wesley, 2004.
REFERENCE BOOKS:
1. E. Horowitz, S. Sahni and S. Rajesekar, “Computer Algorithms”, Galgotia-1999.

2. Jean-Paul Tremblay and Paul. G. Sorenson, “An Introduction to Data Structures with Applications”, Tata
McGraw Hill, 1991.
8
L T P C
06BCE 205 ELECTRONIC DEVICES AND CIRCUITS * 3 0 3
Aim: The subject aims to introduce most of the basic electronic devices and discuss about the functioning,
application and selection of appropriate devices to achieve a particular circuit function.
Objective: The students would become aware of the range of devices with respect to frequency, temperature,
power ratings etc. The students will understand the constructional features and characteristics of various electronic
devices and circuits.
Semiconductor Basics: Review of extrinsic semiconductor – drift and diffusion currents – thermal generation of
minority carriers – Hall Effect. Junction Diodes- Energy band diagram – PN junction – junction diode – volt –
ampere characteristics – ratings – transition and diffusion capacitance – varactor diode – avalanche and Zener
break down – Zener diode – tunnel diode – PIN diode, clipper and clamper circuits.
Bipolar Junction Transistor: Principle of transistor action – current components – cutoff, active and saturation
region – input and output characteristics – CE, CB, & CC Configurations – small signal and large signal beta –
transistor breakdown ratings – Thermal runaway problems – Use of Heat sinks.
FET And Other Devices: Constructional features and characteristics of JFET and MOSFET – depletion and
enhancement modes – VVR operation of FET – handling precautions for MOSFET – construction and
characteristics of UJT, fabrication and characteristics of four layer devices such as SCR, TRIAC and DIAC.
Photo Electric Devices: Photo emissivity - photo electric theory - Photo diodes – Photo voltaic cell – LED &
LCD – Photo multiplier circuit – Light absorption and photo devices – Photo conductive cell (LDR) – Photo
transistor – PN junction LASER – Solar energy converters.
Electronic Circuits: Half – wave and full – wave rectifier circuits – performance characteristics of rectifier
circuits – filter consideration capacitor, inductor, L section, RC section filters – Voltage regulators – current
regulators, IC voltage regulators – protection circuits for DC power supplies – switched mode power supplies.
TEXT BOOK:
1. G.K. Mithal, “Electronic Devices & Circuits”, Khanna Publishers, New Delhi, 2001.
REFERENCE BOOKS:
1. Ben.G. Streetman, “Solid state electronic devices”, Prentice Hall of India, 1999.
2. S.P. Mathur, D.C.Kulshreshtha and P.R. Chanda, “Electronic Devices and Applications of Integrated Circuits”,
1998.
3. J. Millman, C.C. Halkias, “Electronic Devices and Integrated Circuits”, McGraw Hill, 1997.
9
L T P C
06BCE207 INTRODUCTION TO NANO TECHNOLOGY 2 1 3
Aim: The subject covers the basic principles behind Nanostructures, their Characterization and their potential
applications in various fields
Objective: The students would become aware of various fabrication principles behind nanostructure preparation,
what characterizations of nanostructures can be measured and in which domains in can be applied.
Introduction
The Nanoworld - from Micro to Nanostructures – Definition of Nanostructures – Insight into the Nanoworld -
Building Blocks of Nanotechnology – Interactions and Topology – The Microscopic Environment of the
Nanoworld.
Types of Bonding
Molecular Basis of Nanotechnology – Particles and Bonds – Chemical Bonds in Nanotechnology – Vander Walls
Interactions – Dipole – Dipole Interactions – Ionic Interactions – Metal Bonds Covalent bonds – Coordinate
Bonds – Hydrogen bridge bonds – Polyvalent bonds – Assembly of Complex Structures through Internal
Hierarchy of Bonding.
Synthesis of Nano Materials

Preparation of Nanostructures – Principles of Fabrication – Subtractive and Additive Creation of Nanostructures
– Nanolithography – Structure Transfer by Electromagnetic Radiation – EUV and X-Ray Lithography – Electron
Beam Lithography- Atomic beam Lithography – Nanofield Generation by Optical Nearfield Probes.
Structural Characterization
Characterization of Nanostructures – Geometrical Characterization – Layer Dimensions – Structures that Assist
Measurement Characterization of Composition of Layers and Surfaces – Atomic Composition – Characterization
of the Chemical Surface – Functional Characterization of Nanostructures.
Applications
Applications – Nanotransducers – Nanochemical Sensors – Nanoelectronic Devices – Electrical Contacts and
Nanowires – Quantum dots and Localization of Elementary particle – Nanodiodes – Nanoswitches – Molecular
Switches and Basic Elements - Nanostructures as Optical Sensors. Nanosensors as Optical Actuators – Magnetic
Nanotransducers – Chemical Nanoscale Sensors and Actuators.
Text/Reference Books:
1. Michel Kohler, Wolfgang Fritzche “Nanotechnology – An Introduction to Nanostructuring techniques” ,

WILEY –VCH publications
2. Pulickel M Ajayan, Linda S.Schadler, Paul U Braun. “Nanocomposite Science”, WILEY –VCH publications
10
L T P C
06BCE 209 DIGITAL COMPUTER FUNDAMENTALS* 3 0 3
Aim: The subject aims to impart the knowledge about digital logic fundamentals, design steps involved in flip-
flop, shift register and designing a simple computer which is capable of providing few arithmetic and logical
operations.
Objectives: The students shall be able to understand Boolean laws, Boolean algebra, Boolean logic, logic gate
fundamentals, function of flip-flop and shift register, arithmetic and Logic unit, understand the memory
representation in ROM, RAM and CPU.
Number Systems and Boolean algebra: Number systems – converting number from one base to another
complements – algorithms for r’s and r-l’s complements sign. Floating point representation. Codes- Binary
decimal, error detection – reflection – alphanumeric codes. Basic laws, theorems and properties of Boolean
algebra – Boolean functions – canonical and standard forms logical operations – logic gates – Karnaugh map up to
6 variables – Sum of Products (SOP) and Product of Sums (POS) simplification with don’t care condition –
tabulation method.
Combinational Logic Design: Adder – subtractor – code conversion – analyzing a combinational circuit multi
level NAND and NOR circuits – binary parallel adder decimal adder BCD adder – Magnitude comparator –
decoders – demultiplexer.
Sequential Logic Design- Flip flops – triggering of flip flops – analyzing a sequential circuit state reduction
excitation tables – counters – design with state equation registers shift registers ripple and synchronous counters.
Processor Organization: Memory unit – inter register transfer – micro operations bus organization scratch pad
memory – ALU – design of ALU - status register effect of O/P carry – design of shifter – processor unit – design
of accumulator.
Control Logic Design: Control organization – PLA control – microprogram control hardwired control
microprogram sequencer – microprogrammed CPU organization.
Computer Design: Computer configuration – instructions and data formats instruction sets timing and control
execution of instruction – design of computer.
TEXT BOOK:
1. Morris M. Mano, "Digital Design", Prentice Hall India, Third Edition, 2001
REFERENCE BOOKS:
1. Thomas C. Bartee, "Computer Architecture Logic Design", Tata McGraw Hill 1997.
2. A. P. Malvino and D. P. Leach, “Digital Principles and Applications”, 4th edition, McGraw Hill 1999.
11
L T P C
06BCE 211 OBJECT ORIENTED PROGRAMMING * 2 1 3
Aim: The subject aims to introduce the salient features of Object Oriented Programming, evolution of c++ as a
object oriented programming language with focus on generic programming with templates and Exception
Handling.
Objectives: Students will be able to know the fundamentals of object oriented programming and incorporate
OOPs’ features such as inheritance, polymorphism, templates using c++ as language.
Introduction to Fundamentals concepts: Object oriented fundamentals- Structured versus object-oriented

development, elements of object oriented programming, fundamentals of OO-class, object, and abstraction and its
importance, encapsulation, polymorphism, benefits of OOP, structure of C++ program.
Classes and Objects: Working with classes- Classes and Objects- Class specification, class objects, accessing class
members, defining member functions, inline functions, accessing member functions within class, data hiding, class
member accessibility, empty classes, constructors, parameterized constructors, constructor overloading, copy
constructor, new, delete operators, “this” pointer, friend classes and friend functions.
Overloading: Overloading-Function overloading, operator overloading- overloadable operators, unary operator

overloading, operator keyword, limitations of increment/decrement operators, binary operator overloading,
arithmetic operators, concatenation of strings, comparison operators, Generic programming with templates-
Function templates, class templates.
Inheritance: Inheritance- Base class and derived class relationship, derived class declaration, Forms of
inheritance, inheritance and member accessibility, constructors in derived class, destructors in derived class,
constructor invocation and data member initialization, data conversion, abstract classes, virtual base classes, virtual
functions.
Exception handling and Files: Files and Streams-Opening and Closing a file, file modes, file pointers and their
manipulation, sequential access to a file, ASCII and binary files, random access to a file, error handling during file
manipulations, Exception handling-exception handling model, exception handling constructs, lists of exceptions,
catching exceptions, handling exceptions.
TEXT BOOK:
1. K.R.Venugopal, T.Ravishankar, and Rajkumar, "Mastering C++”, Tata McGraw Hill, 1997
REFERENCE BOOKS:
1. E.Balagurusamy, “Object Oriented Programming with C++”, Tata McGraw Hill, 2nd Edition, 2004,
2. Bjarne stroustrup, “The C++ programming Language”, Addison Wesley, 3rd edition, 1988.
12
L T P C
06BCE 213L OBJECT ORIENTED PROGRAMMING LAB 2 2
(Implementation of OOPS AND Data Structures Concepts)
1. Program illustrating function overloading feature.

2. Programs illustrating the overloading of various operators
Ex: Binary operators, Unary operators, New and delete operators etc.
3. Programs illustrating the use of following functions :
a) Friend functions b) Inline functions c) Static Member functions
d) Functions with default arguments.
4. Programs illustrating the use of destructor and the various types of constructors (no arguments, constructor,
constructor with arguments, copy constructor etc).
5. Programs illustrating the various forms of inheritance :
Ex. Single, Multiple, multilevel, hierarchical inheritance etc.
6. Write a program having student as an abstract class and create many derived classes such as Engg. Science,
Medical, etc. from students class. Create their objects and process them.
7. Write a program illustrating the use of virtual functions.
8. Write a program which illustrates the use of virtual base class.
9. Write Program illustrating File Handling operations
Ex. a) Copying a text files b) Displaying the contents of the file etc.
10. Write programs illustrating how exceptions are handled (ex: division-by-zero, overflow and underflow in stack
etc)
Data Structure:
1. Implementing Stacks and queues.
2. Implementation and processing in lists.
3. Sorting:
a. Insertion sort
b. Merge sort
c. Quick sort
d. Selection sort
e. Heap sort
f. Shell sort
4. Searching:
a. Linear search
b. Binary search
13
L T P C
06BCE 215L ELECTRONIC DEVICES LAB 2 2
LIST OF EXPERIMENTS:
1. Study of CRO and measurement of amplitude frequency time period and phase angle.
2. Forward and reverse characteristics of PN junction diode.
3. Characteristics of Zener diode and study of its power ratings.
4. Input and output characteristics of BJT (CE CB CC) and graphical determination of h-parameters.
5. Drain and transfer characteristics of JFET and graphical determination of transconductance.
6. Static emitter characteristics of UJT and PUT.
7. V-I characteristics of SCR and TRIAC.
8. Switching characteristics of BJT SCR and MOSFET.
9. V-I characteristics of tunnel diode and varactor diode.
10. Study of Logic Gates (AND OR NAND NOT EXOR gates).
11. Study of Flip flops (D T JK SR flip-flops).
12. Design and testing of Half and Full adders.
13. Design and testing of Half and Full subtractor.
14. Implementation and testing of 3 bit binary ripple counter.
15. Implementation and. testing of code converters.
16. Implementation and testing of Multiplexers.
17. Implementation of shift registers using flip-flops.
18. Study of decade counter using flip-flops.
14
L T P C
06BCE 202 PROBABILITY, STATISTICS AND RELIABILITY * 2 1 0 3
Aim and Objectives: The aim of the course is to motivate the students to address the relevance of Probability
and Statistical Theory to Engineering problems.
By the end of the course, students will
• Have an understanding of the Probability concepts.
• Analyze the problems connected with statistics and reliability
• Understand how to make the transition from a real problem to a probability model for that
problem.
The most desirable is to expose students to practical applications of expectation and probability that
provide the proper tools for handling the design of the system that involve randomness.
Probability and Random Variables: Axioms- Conditional Probability- Baye's Theorem- Independent Events-
Random Variables-Distribution Function-Density Function (PDF)- Random Vector-Joint Distribution- Joint
Density- Conditional Distribution and Density Functions- Independent Random Variables- Binomial, Poisson,
Normal, Exponential, Gamma, Weibull distributions.
Statistical Parameters: Mathematical Expectation- Variance- Moment Generating Function-Characteristic

Function-Regression and Correlation- Partial and Multiple correlations.
Tests of Statistical Hypothesis: Large sample Tests - Procedure of Testing Hypothesis- small sample tests -
Student’s t-distribution - F-test - Chi-square test- theory of estimation.
ANOVA: One way and Two way classifications- CRD-RBD-LSD.
Statistical Quality Control: Control Charts - Control Charts for Measurements - x -chart- R-chart- Control
Charts for Attributes- p-chart- np-chart- c-chart
Reliability: Terms related to Reliability- Hazard Models- System Reliability - Reliability Allocation Maintainability
and Availability.
Queuing Theory: Preliminary Ideas (Markov Chains) - Exponential Distribution- Little's formula - Pure Birth
and Death Models.
TEXT BOOK:
1. R.E.Walpole, R.H.Myers, S.L.Myers and K.Ye, “Probability and statistics for Engineers and Scientists”, 7th
Edition, Pearson Education, 2003.
REFERENCE BOOKS:
1. Bhat, B.R, “Modern Probability Theory”, 3rd Edison. New Age International Pvt. Ltd., New Delhi, 1999.
2. Freund, JE, “Mathematical Statistics”, Prentice Hall International, 1998.
3. Rohatgi, V.K. and Ebsanes Saleh, A.K. Md., “An introduction to Probability and Statistics”, 2nd Ed., John Wiley &
Sons, Inc., New York, 2002.
4. Morris H. DeGroot, Probability and Statistics, 3rd Edition, Addison-Wesley, 2002.
5. J.L.Devore, Probability and Statistics, 5th Edition, Thomson, 2000.
15
L T P C
06BCE204 COMPUTER PROFESSION AND SOCIETY 3 0 3
Aim: Describes about the ethics, decision, and communication skills and also provide knowledge on working with
groups and presentation.
Objectives: After completion the students will be able to work in groups and will be capable of presenting their
ideas.
Introduction to Computer Ethics

What is computer ethics? Philosophical Ethics; Professional Ethics; The Social Implication of Computers:
Autonomy and Access. Ethics and Ethical Decision Making – Why we should care about Ethics, Computer Ethics
and Regular Ethics, Competing Factors that affect our behavior, Value judgments, The types of ethical choices,
Making defensible decisions. Ethics and Information Technology – New Technologies, New Problems, Why is
Ethical Computer Use a Special Challenge? What is Unethical computer use?
Ethical Issues and Ethical Decision

Property rights in Computer Software; Computers and Privacy; Crime, Abuse, and Hacker, Ethics; Responsibility
and Liability.
Solving Ethical Dilemmas

A Sample Case Exercise-A Four-Step Analysis Process, Sample Case-Too much of a good thing? Discovering an
Ethical Dilemma, Using the Four-Step process. Select Cases-
• Abort, Retry, Ignore: Recovery of Data leads to Discovery Of Confidential File
• Messages from All Over: Who controls the content of Email and BBS?
• Charades: A Stolen Password and its After-Effects.
• Trouble in Sardonia: Do Copyright Ethics Change Overseas?
Ethics Codes and Polices

The need for Codes and Polices, An Email Privacy Policy, An Internet Use Policy.
Communication and Personal Skill

Communicating at work- The importance of Communication, The nature of Communication, Using
communication networks, choosing the optimal communication channel; Communication, Culture, and Work-
Cultural Diversity and Communication, Organizational Culture. Verbal and Nonverbal Messages – Verbal
messages, Sexual harassment, Nonverbal Communication; Listening – The Importance of Listening, Barriers to
effective listening, Approaches to listening, Reasons for listening; Interpersonal Skills- Building Positive
relationships, Dealing with criticism, Managing, Conflict, Negotiating skills.
Working In Groups and Making Effective Presentations

Working in Groups: Working in Teams – Characteristics of Groups and Teams, Types of Groups and teams,
Leadership and Influence in groups and teams, Problem-Solving Communication, Effective Communication in
groups and teams. Making Effective Presentations: Developing the Presentation-Establishing a purpose,
Developing the Thesis, Analyzing the situation; Organizing your Ideas- The importance of clear organization,
Gathering ideas and material. Organizing the Body, Planning the introduction, planning the conclusions, Adding
transitions; Verbal and Visual Support in Presentations – Functions of supporting material, Verbal support, Visual
Aids; Developing the Presentations- Types of Delivery, Guidelines for delivery, Question and Answer Sessions,
Speaking with confidence.
TEXT BOOKS
1. Deborah.G.Johnson, - “Computer Ethics” - Prentice Hall - 2nd Edition - 2002
2. Ernest A Kallman, John.P. Grillo - “Ethical Decision making and Information Technology”, McGraw Hill -
2nd Edition - 1996.
3. Ronald B.Adler - Jeanne Marguardt Elmhorst - “Communicating a work” - McGraw Hill - 6th Edition - 1999.
16
REFERENCE BOOKS
1. Deborah.G.Johnson, Helen Nissenbaum (eds) - “Computers, Ethics, and Social Values” - Prentice Hall - 1995.
2. Jonathan Price, Kenry Korman.- “How to communicate Technical Information” - Addison- Wesley - 1993.
17
L T P C
06BCE 206 MICROPROCESSOR & INTERFACING 3 0 3
TECHNIQUES *
Aim: The subject aims to introduce various features of 8086, 80286, 386, Pentium, processors, peripheral devices.
Objectives: The student shall be able to understand 8086 processor design and basic operations, Instruction set
and aspects of assembly language programming, Interface peripherals with 8086 serial and parallel I/O (8251 A &
8255), PIT (8253), programmable DMA controller(8257), programmable Interrupt controller (8259), Keyboard
and display controller(8279),the 80286 processor features, addressing modes, operation and Memory management
,the 80386 and 80486 processor features, addressing modes, operation, the advances in processors – overview of
Pentium – I, II, III, IV and Microcontrollers 8051.
Introduction to 8086 Processor: 8086 Processor-Introduction, 8086 architecture, Pin configuration, 8086 in
min/max mode, Addressing modes, Instruction set of 8086, Assembler directives, Assembly language
programming.
Peripherals & Interfacing With 8086: Serial & parallel I/O (8251A and 8255), Programmable interval timer
8253, Programmable DMA controller 8257, programmable interrupt controller 8259A, Keyboard and display
controller 8279, ADC / DAC interfacing.
80286 Processor: Features of 80286, internal architecture of 80286, real addressing mode, virtual addressing
mode, privilege, protection, basic bus operation of 80286, fetch cycles of 80286.
80386 and 80486 Processor: Features of 80386Dx, internal architecture of 80386Dx, pin configuration of 80386,
register organization of 80386Dx, features of 80486, register organization of 80486.
Advance In Microprocessors: Features of Pentium processor, Pentium – I, Pentium – II, Pentium – III,
Pentium – IV, Introduction to microcontroller 8051, architecture of 8051, Register set of 8051.
TEXT BOOK:
1. A.K. Ray and K.M. Bhurchandi, “Advanced Microprocessors and Peripherals”, First Edition, Tata McGraw
Hill, 2000.
REFERENCE BOOKS:
1. Douglas V. Hall, “Microprocessors and Interfacing Programming and Hardware”. Tata McGraw Hill, 1999.
2. Goankar, “Microprocessor Architecture Programming and Applications with 8085”, Wiley Eastern, 2000.
18
L T P C
05BCE208 PRINCIPLES OF COMMUNICATION 2 1 3
Aim: This subject aims to introduce fundamental concepts of Analog and digital communication system
Objectives: At the end of the course the students will understand various types of signals, Amplitude modulation
and demodulation techniques, and basic band pass digital communication systems.
Spectral analysis and random process

Spectral characteristics of periodic and aperiodic signals – spectra of common signals related to communication –
cross correlation – auto-correlation and power / energy density spectra – random signals and process.
Analog modulation systems

Basic principles of Amplitude Modulation (AM), Frequency Modulation (FM) & Phase Modulation (PM) – spectra
– power consideration – receiver’s characteristics and deduction of AM, FM & PM systems performance –
threshold effects reduction
Base band data communication

Sampling & quantization – PCM, ADPCM, DM, ADM, base band pulse shaping – binary data formats – base
band transmission – Intersymbol Interference (ISI) – correlative coding – optimum SNR – matched filter
detection.
Digital modulation
Digital modulation – coherent binary modulation techniques – coherent quadrature modulation techniques – non-
coherent binary modulation – m-array modulations – performance of digital modulation systems based on
probability if error – bandwidth – ISI
Spread spectrum and error correction techniques

Fundamental concepts – direct sequence spread spectrum and frequency hopping spread spectrum – Block codes
– Cyclic codes.
TEXT BOOKS:
1. Taub & Schilling, “Principles of Communication”, Tata McGraw Hill Publication, 1990
2. Simon Haykins, “Principles of Communication”, PHI, 1990
REFERENCE BOOKS:
1. B.P.Lathi, “Analog and Digital Communication Systems”, PHI, 1992
2. Proakis, “Digital Communication”, McGraw Hill, 1992
3. A.B. Carlson, “Communication Systems”, McGraw Hill, 1992
19
L T P C
06BCE 210 SOFTWARE ENGINEERING * 3 0 3
Aim: The subject aims to impart sound knowledge to design and implement an efficient software system and
manage the resources.
Objectives: The students would be able to analyze software requirements, develop an efficient software system
through group cohesiveness, use the testing tools and methods.
Software Engineering Fundamentals: The system engineering process, Software process models, Process
iteration, Software Specification, Software design and implementation, Software validation, Software Evolution,
Project management activities- Project planning, Project scheduling, Risk management, Software requirements-
Functional and non-functional requirements, User requirements, System requirements, software requirements
document.
Requirements Engineering Processes: Feasibility studies, Requirements elicitation and analysis, Requirements
validation, Requirements management, System Models- Context, Behavioral, Data and Object models, CASE
workbenches, Software prototyping- Prototyping in the software process, Rapid prototyping techniques, User
interface prototyping, Formal Specification- Formal specification in the software process, Interface specification,
Behavioral specification
Architectural Design: System structuring, Control models, Modular decomposition, Domain-specific

architectures, Overview of design for Distributed systems, Object-oriented and Real-time software, Design with
Reuse- Component-based development, Application families, Design patterns, User interface design - User
interface design principles, User interaction, Information presentation, User support, Interface evaluation.
Critical Systems: Overview of Dependability, System Specification, and System Development, Verification and
validation- Planning, Software inspections, Automated static analysis, Cleanroom software development, Software
testing- Defect testing, Integration testing, Object-oriented testing, Critical systems validation- Formal methods
and critical systems, Reliability validation, Safety assurance, Security assessment.
Industry Standards: Overview of Managing software people, Software cost estimation- Productivity, Estimation
techniques, Algorithmic cost modeling, Project duration and staffing, Overview of Quality management & Process
Improvement, Overview of Legacy Systems, Software change & re-engineering, Configuration management-
planning and managing change, version and release, Overview of SEI-CMM, ISO 9000 and Six Sigma, Over view
of CASE tools.
TEXT BOOK:
1. Ian Sommerville, "Software Engineering", Addison-Wesley, 2004
REFERENCE BOOK:
1. Roger S. Pressman, "Software Engineering", McGraw Hill, 2004.
20
L T P C
06BCE 212 DATA BASE MANAGEMENT SYSTEM * 3 0 3
Aim: The subject aims to introduce techniques to design, implement, tune, maintain a database application and
advance database concepts.
Objectives: The students shall be able to understand fundamental concepts of database management system,
database modeling and design, SQL, PL/SQL, system implementation techniques. They will be able to analyze and
design ER model for a customized application and distributed databases, concurrency techniques, Federated
systems, active databases.
Basic concepts: Data bases and databases users – database system concepts and architecture – data modeling
using Entity Relationship model – Files of Unordered & Ordered Records, Hashing Techniques, Other primary
file Organizations – Index structures for files- E.F.Codd Rules
Relational model, languages & systems: The relational data model, relational constraints, and the relational
algebra – SQL – the relational database standard – ER to relational mapping and other relational languages –
Oracle Architectures.
Database design theory and methodology: Functional dependencies and normalization for relational databases
– relational database design algorithms and further dependencies – practical database design and tuning.
System Implementation Techniques: Database system architectures and the system catalog – query processing-
Translating queries to relational algebra, basic algorithms for executing query operations, using heuristics in query
optimization – transaction-processing concepts.
Concurrency control techniques: Locking techniques, time stamp ordering, using locks for concurrency control
in indexes, and some other concurrency control issues Database recovery techniques- Recovery concepts, Recover
techniques based on deferred update and immediate update, shadow paging, arise algorithm, database backup and
recovery from catastrophic failures. Database security and authorization- Introduction to database security issues,
discretionary access control based on granting and revoking of privileges. Distributed Database: Introduction and
Concepts, Data Fragmentation, Replication, and allocation techniques.
TEXT BOOK:
1. Elmasri & Navathe – “Fundamentals of Database Systems”, 3rd ed., Addison Wesley, 2000
REFERENCE BOOK:
1. Korth and Silberschatz, “Data Base System Concepts”, Tata McGraw Hill, 1997.
21
L T P C
06BCE 214L MICROPROCESSOR AND INTERFACING LAB 2 2
1. Study Experiments
i) Study of 8086 Architecture
ii) Study of 8255 – PPI
iii) Study of 8253 – PIT
iv) Study of 8279 – PKI
v) Study of 8259 – PIC
2. Write an ALP to find out factorial of a given hexadecimal number using 8086 MP
Data: OAH, OFH, 1OH
3. Write an ALP to perform 16 bit arithmetic operations (ADD, SUB, MUL, DIV)
4. Write an ALP to generate the sum of first ‘N’ natural numbers using 8086 MP
5. Write an ALP to convert given hexadecimal number to binary using 8086 MP

Data: ABH, CDH, 101H
6. Write an ALP to convert given binary number to hexadecimal number using 8086 MP
Data: 101010102, 111111112, 11002, 11112
7. Write an ALP to order give set of hexadecimal numbers in ascending and descending order
Data: 0AH, 0FH, 0DH, 10H, 02H
8. Write an ALP to move block of data from locations 1200H-1205H to 2200H – 2205H
9. Write an ALP to reverse the given string

Data: WELCOME
10. Write an ALP to generate the following series 1+1/x+1/x3+1/x5+ ……..
11. Write an ALP to generate square wave using 8255 PPI
12. Write an ALP to generate rate generator using 8253 PIT
13. Write an ALP to interface keyboard with 8086 using 8279 PKI
14. Write an ALP to display the given message using 8279 PKI
Message: INFORMATION TECHNOLOGY
15. Write an ALP to interface analog to digital converter.
22
L T P C
06BCE 313L DATABASE MANAGEMENT SYSTEMS LAB * 2 2
1. a) Create a table EMP with the following fields.

EName
Eno
Salary
DeptNo
Address
Dname
b) Insert 5 records into EMP

c) ALTER EMP table I) Varying size of Eno field
II) Adding a new field job
d) Delete the table EMP
2. Create a table EMP with the above mentioned fields.

i) Insert 5 records into EMP
ii) Update the salary of the Employees by 10% hike
iii) Delete the employees whose name is ‘AAA’
3. Create a table ORDER with the following fields and constraints.
ORDER
Column Name Constraint Name Constraint Type

Order-no pk-order-no PRIMARY KEY
Item-name itn UNIQUE
Qty ck-aty CHECK
(25<QTY<50)
Rate-unit Nn-rate NOT NULL
4. Using Ex 3.
1. Drop unique constraint for item-name
2. Disable the constraint Nn-rate
3. Insert a record with NULL values for rate unit
4. Enable the constraint with NULL value existing on rate-unit
5. Create a table EMP mentioned above and test all the arithmetic functions and character functions.
6. Add a field date-of-birth to EMP table and test all the date functions.
7. i) Modify EMP table adding a new field BONUS, update it using NVL
ii) Retrieve the employees whose name starts with S.
iii) Select all the employees who are working in IT department.
8. I) Using EMP table find the employee getting maximum salary

ii) Find the employee whose salary is minimum
iii) Find the sum of salaries of all the employees working in ‘ACCOUNTS’ department.
9. Create a table DEPT with the following fields

DNo. Primary Key
DName
23
Modify EMP table adding a foreign key constraint on DeptNo.
i) Insert 6 records into Dept.

ii) Implement the following Join operations
a) Self Join
b) Equi Join
c) Non Equi Join
d) Outer Join
e) Natural Join
10. Using EMP and DEPT, implement all type of view techniques.
a) Row subset view
b) Column subset view
c) Row column subset view
d) Grouped view
e) Joined view
f) With check option
11. Using EMP and DEPT

a) Create a sequence to insert the empno in EMP table
b) Create a synonym for the above two tables
PL/SQL Programming
1. Create a cursor to update the salary of employees in EMP table

2. a) Write a PL/SQL program to raise an Exception
i) When the bonus exceeds salary
b) Write a PL/SQL program to test the built-in Exceptions
3. Write a procedure to insert a record into ORDER table by validating qty limit of the item and also check
whether that item exists.
4. Write a function to find substring.
5. Create a trigger which checks whether employee with Emp_no is present in the Employee table before
inserting into EMP.
24
L T P C
06BCE 301 DISCRETE MATHEMATICAL STRUCTURES * 2 1 3
Aim and Objective: The aim of this course is to motivate the students to address the challenge of the relevance
of inference theory, Algebraic structures and graph theory to computer science and engineering problems. By the
end of the course, the students are expected to use inference theory in circuit models, and algebraic theory in
computer science problems, graph theory in network models and lattices & Boolean algebra in Boolean functions.
Mathematical Logic: Introduction -Statements and Notation - Connectives - Tautologies - Equivalence -

Implications - Normal Forms - Principal Disjunctive Norm Forms - Principal Conjunctive Norm Forms.
Inference Theory: The Theory of Inference for the Statement Calculus -The Predicate Calculus - Inference
Theory of the Predicate Calculus.
Set Theory: Basic Concepts of Set Theory- Relations and Ordering- Functions- Recursion
Algebraic Structures: Semigroups and Monoids - Grammars and Languages- Polish Expressions and their
Compilation - Groups - The Application of Residue Arithmetic to Computers - Group Codes.
Lattices and Boolean algebra: Lattices as Partially Ordered Sets - Boolean algebra - Boolean Functions -
Representation and Minimization of Boolean Functions.
Graph Theory: Basic Concepts of Graph Theory - Matrix Representation of Graphs - Trees -Storage
Representation and Manipulation of Graphs.
TEXT BOOK:
1. J.P. Trembley and R.Manohar, “Discrete Mathematical Structures with Applications to Computer Science”, Tata
McGraw Hill – 13th reprint, 2001.
REFERENCE BOOKS:
1. Richard Johnsonbaugh, “Discrete Mathematics”, 5th Edition, Pearson Education, 2001.

2. S. Lipschutz and M. Lipson, “Discrete Mathematics”, Tata McGraw Hill, 2nd Edition, 2000.
3. B.Kolman, R.C.Busby and S.C.Ross, “Discrete Mathematical structures”, 4th Edition, PHI, 2002.
4. C.L.Liu, “Elements of Discrete Mathematics”, Tata McGraw Hill, 2nd Edition, 2002.
5. N.Ch.S.N.Iyengar, V.M.Chandrasekaran, K.A.Venkatesh and P.S.Arunachalam, “Discrete
Mathematics”, Vikas Pub., 2003.
25
L T P C
06BCE 303 INTERNET PROGRAMMING 2 1 3
Aim: To introduce the concepts of internet programming technologies.
Objective: The students would be able to understand and develop web applications.
Common Gateway Interface (CGI)

CGI applications, configuring the server, programming in CGI. Input to the CGI-environmental variables,
accessing from input, languages under different operating systems. Examining environmental variables. Output
from CGI and response headers. Forms and CGI: HTML tags; sending data to the server; designing applications
using forms in PERL. Decoding forms in other languages. Server side includes (SSI)- configuration, environmental
variables. Including boilerplates. File statistics. Executing external program and CGI programs. Tailoring SSI
output. Common errors.
Introduction to java
Overview of java language: introduction, simple java program, java tokens, java statements, implementing a java
program, java virtual machine, command line arguments, programming style. Constants, variables, data types,
operators, expressions, decision making and branching. Classes, objects and methods, constructors, methods
overloading, static members, inheritance: extending a class, overriding methods, final variables and methods,
finalize method, abstract methods and classes, visibility control. Arrays, strings and vectors: arrays, one-
dimensional arrays, creating an array, two-dimensional arrays, strings, vectors, wrapper classes.
Interfaces, Packages, multithreading and Exceptions

Interfaces: multiple inheritance, packages, multithreaded programming, synchronization, implementing the
“runnable” interface. Managing errors and exceptions.
Applet programming and Files

Applet programming, designing a web page, getting input from the user. Managing input/output files in java,
input/output exceptions, creating of files, interactive input and output, other stream classes
Networking and Servlets

Introduction to networking using Java API, TCP/IP Sockets and Datagram Sockets. Overview and architecture of
a Servlets, Handling HTTP GET and POST requests, Using JDBC in Servlets.
TEXT BOOKS:
1. Herbert Schildt, “JAVA 2: The Complete Reference”, 5th Edition, TMH, 2002
REFERENCE BOOKS:
1. Shishir Gundavaram: “CGI Programming On the World Wide Web”, O’ Reilly and Associates, 1996.
2. Thomas Boutel: “CGI Programming In C and Perl”, Addison-Wesley, 1996.
3. Kenarnold and James Gosling: “The Java Programming Language”, Addison-Wesley, 1998.
4. Deital H.M, Deital P.J, “JAVA How to program”, Pearson Education, 6th Edition, 2005.
26
L T P C
06BCE 305 COMPUTER ARCHITECTURE AND 3 0 3
ORGANISATION *
Aim: The subject aims at imparting the knowledge of Computer architecture, the design of computers, including
the instruction sets, hardware components, system organization, Memory Management and Networking.
Objectives : At the end of the course students should be able to understand the basic principles such as locality of
reference, coarse-grain parallelism, overlapping communication and computation, performance/power trade-offs,
and reliability, also how the computer systems are organized and the characteristics of modern processors that
affect system architecture.
Introduction: Nature of computing, Elements of Computers, Limitations of Computers - the evolution of

computers- Mechanical Era, Electronic Computers, The later generation – the VLSI era - Integrated Circuits,
Processor Architecture, System Architecture. Design Methodology - System design - System Representation,
Design process, The Gate level – the Register level- Register - level components, programmable logic devices,
Register level design – the Processor Level - Processor Level Components, Processor level design.
Processor Basics: CPU organization: Fundamentals; – Data Representation: Basic formats, Fixed –Point
Numbers, Floating point numbers; – Instruction Sets: Instruction formats, Instruction Types, Programming
Considerations.
Arithmetic Logic unit: Data Path Design-Fixed point arithmetic-Addition and Subtraction, Multiplication,
Division; – Arithmetic – Logic Units- Combinational ALU, Sequential ALU – Advanced Topics- Floating point
Arithmetic, Pipeline Processing
Memory Organization: Memory technology: Memory Device Characteristics, Random Access Memory (RAM),
Serial Access Memory; memory systems: Multilevel memories, Address translations, Memory Allocation – Caches:
Main features, address mapping, Structure versus performance.
System Organization- Communication methods: Basic concepts, Bus control – IO and System Control:
Programmed IO, DMA and Interrupts, IO processors, Operating Systems; – Parallel Processing: Processor –Level
Parallelism, Multiprocessors, and Fault Tolerance.
TEXT BOOK:
1. John P. Hayes, “Computer Architecture and Organization”, 3rd Ed. McGraw Hill, 1998.
REFERENCE BOOK:
1. John. L. Hennessy & David A. Patterson, “Computer Architecture”, Elsevier, India, 3rd Ed, 2003.
27
L T P C
06BCE 307 COMPUTER AND COMMUNICATION NETWORKS 3 0 3
Aim: The subject aims to introduce basics of Networks, client/server systems, Network design approaches,
Architecture of Networks, and also future Networking Technology.
Objectives : Students shall be able to understand about working of Intranet, LAN, WAN, MAN setups, different
topologies like Star, Mesh, etc., various functions of layers, different network architectures, different switching
techniques, different protocol standards, congestion & traffic control, different internetworking devices like
bridges, switches, routers, etc, security protocols & security algorithms
Networks and Services: Approaches to Network Design, OSI Reference Model; Overview of TCP/IP
Architecture, Application Protocols and TCP/IP Utilities
Peer-to-Peer Protocols: Service Models, ARQ Protocols, Sliding Window Flow Control, Multiple Access
Communications, LAN access methods, Introduction to LAN Standards and LAN Bridges, Ethernet networking.
Packet Switching Networks: Network Services and Internal Network Operation, Packet Network Topology,
Routing in Packet Networks, Shortest Path Algorithms, and Introduction to traffic management & QoS.
TCP/IP Architecture: The Internet Protocol, Limitations of IPv4 and Introduction to IPv6, User Datagram
Protocol, Transmission Control Protocol, DHCP, Introduction to Internet Routing Protocols
Advanced Network: Architectures and Security Protocols- Introduction to MPLS and Differentiated Services;
RSVP; Security and Cryptographic Algorithms, Security Protocols, Cryptographic Algorithms
TEXT BOOK:
1. A. Leon-Garcia, Indra Widjaja, "Communication Networks", Tata McGraw Hill, 2000
REFERENCE BOOKS:
1. William Stallings, “Data and Computer Communications", Pearson Education, 7th Edition, 2003
2. Andrew S. Tanenbaum, "Computer Networks", Prentice Hall India, 4th Edition, 2003
28
L T P C
06BCE 309 THEORY OF COMPUTATION * 3 0 3
Aim: The subject aims to introduce Formal Languages, Automata Theory and Abstract models of Computation
and Computability, Computational complexities and NP – Completeness.
Objectives: The students would be able to understand universal Model of Computation in terms of both the
current Platforms and the Philosophical ideas about the nature of Computation. They would be able to analyze the
problems by determining whether a problem is solvable, efficiently solvable, and simply solvable or it cannot be
solved.
Overview: An overview of grammars and languages, Regular expressions and Regular languages Finite Automata
and its minimization, Construction of NFA and DFA from Regular expressions, Conversion of NFA into DFA
Theorem & Problem: Chomsky hierarchy of language, Non – determinism and kleenes theorem – pumping
lemma – Decision problems. Normal Forms: Chomsky’s & Griebach’s Normal Forms
Push Down Automata & Context Free Languages: Context free grammars – Derivation trees – Ambiguity –
PDA& CFG – Context Free and non-Context free languages.
Turing Machines: Church Turing hypothesis – Turing machine as language acceptors – Partial function – Non –
deterministic Turing Machine – Universal Turing Machines – Applications.
Unsolvable Problems & Computable Functions: Rice theorem – Halting problem – Post’s correspondence
Problem – Primitive recursive functions – Godel Numbering – Recursive and recursively enumerable languages.
TEXT BOOK:
1. John C. Martin, “Introduction to Languages and the Theory of Computation”, Tata McGraw Hill, 3rd Edition,
1997.
REFERENCE BOOK:
1. K.L.P Mishra, N. Chandrasekaran, "Theory of Computation", Prentice Hall of India, 2nd Edition, 1998.
29
L T P C
06BCE 311 SOFT COMPUTING 3 0 3
Aim: The subject aims to introduce neural networks, fuzzy logic and genetic algorithms
Objectives: The students would be able to understand and explain the concepts of neural networks, learning in
biological neuron, learning algorithms, fuzzy sets, fuzzy arithmetic, handling uncertainty and problem solving
using genetic algorithms
Neural Networks: History, overview of biological Neuro-system, Mathematical Models of Neurons, ANN
Architecture, Learning rules, Learning Paradigms – supervised, unsupervised and reinforcement learning, ANN
training algorithms – perceptron, training rules, Delta, Back Propagation Algorithm, Multilayer perceptron Model,
Hopfield Networks, Associative Memories, Applications of Artificial Neural Networks.
Fuzzy Logic: Introduction to Fuzzy Logic, Classical and Fuzzy Sets: Overview of Classical sets, Membership
Function, Fuzzy Rule generation, Operations on Fuzzy Sets- Complement, Intersections, Union, Combination of
Operations, aggregation operations.
Fuzzy Arithmetic: Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on Intervals and Numbers,
Lattice of Fuzzy Numbers, Fuzzy Equations. Fuzzy Logic: Classical Logic, Multivalued Logics, Fuzzy
Propositions, Fuzzy Qualifiers, Linguistic Hedges.
Uncertainty based Information and Application of Fuzzy Logic: Information and Uncertainty,
Nonspecificity of Fuzzy and Crisp Sets, Fuzziness of Fuzzy Sets, Application of Fuzzy Logic: Medicine,
Economics Etc.
Genetic Algorithm: An Overview, GA in problem solving, Implementation of GA.
TEXTBOOK:
1. Klir and TA Folger, “Fuzzy Sets, Uncertainty, and Information”, Prentice Hall (1988).
REFERENCE BOOKS:
1. Ross T.J. “Fuzzy Logic with Engineering Applications”, McGraw Hill, 1995
2. Zurada, J.M. “Introduction to Artificial Neural systems”, Jaico Publishing House, 1997
3. David. E. Goldberg, “Genetic Algorithms in Search, Optimization and Machine Learning”, Addison Wesley,
1985.
30
L T P C
06BCE 313L NETWORKING LAB 2 2
1. Write a program to display the server’s date and time details at the client end.
2. Write a program to display the client’s address at the server end.
3. Write a program to implement an echo UDP server.
4. Write a program to develop a simple Chat application.
5. The message entered in the client is sent to the server and the server encodes the message and returns it to the
client. Encoding is done by replacing a character by the character next to it i.e. a as b, b as c …z as a. This
process is done using the TCP/IP protocol. Write a program for the above
6. The message entered in the client is sent to the server and the server encodes the message and returns it to the
client. Encoding is done by replacing a character by the character next to it i.e. a as b, b as c …z as a. This
process is done using UDP. Write a program for the above
7. Write a program to display the name and address of the computer that we are currently working on.
8. Write a program to capture each packet and to examine its checksum field.
9. Write a program to create a daemon process.
10. A server should run for 10 secs and generate numbers continuously. The client connecting to it should read
data and find out the sum of the data thus read. Write a Java program to implement this scenario.
11. Write graphical user interface for the sales database which lists all the customer names in one choice box and
all products in another. When the user selects a customer name and product and press the “submit” button,
display a list with the customer name, product, quantity, and date of order by the customer with the name of
that product. Use prepared statements whenever possible.
12. Design and populate a database for a car rental system. Allow the client to check the availability of a category
of car and to make reservation.
13. Write program to illustrate the following:
i). Remote object interaction.
ii). File downloading and uploading.
31
L T P C
06BCE315L INTERNET PROGRAMMING LAB 2 2
Exercises on inter networking involving CGI, HTML and JAVA
Mini-project has to be completed and submitted.
1. On a computer network consisting of WINDOWS NT LINUX/UNIX machine running a web

server software and client machines running a browser, develop html and CGI programs in java for
web based applications like bank transaction, student information system etc.
2. Develop a stand-alone java application program that exploits the graphics processing capability of the
java language.
The evaluation is based on the demonstration and viva. The student has to submit a report to the examiner.
32
L T P C
06BCE302 PROGRAMMING LANGUAGE PROCESSORS 2 1 3
Aim: To provide basics of programming language processors and to serve as a foundation for more advanced
studies of high performance parallel compilers and advanced compiler design implementation.
Objectives: At the end of the course students should

• be able to discuss implementation issues of complier for a sample language.
• be able to design computational model for finite automata
• be able to analyze the optimization techniques of complier.
Introduction to compiling and lexical analysis : Introduction to language processor, Compiler Vs Interpreter,
cross compiler, bootstrap arrangement, logical phases of compiler, pass Vs phase-cousins of compilers, Lexical
Analysis phase: - Design issues-patterns, lexemes, Tokens-attributes- specification of tokens, Regular expressions-
Overview of automata-Thompson construction NFA-DFA-minimized DFA-lexical errors- Lex
Syntax Analysis : Role of parser-Context Free Grammars-Parse Tree- Ambiguity- Elimination of ambiguity- Top
down parsing: Recursive-Descent parsing, Non- recursive predictive parsing; LL(1) grammars, Bottom-Up
parsing:- Shift-Reduce parsers, Operating precedence parsing: design of operator precedence table, parsing –LR
parsers:- Construction of SLR parser tables and parsing , CLR parsing-LALR parsing- Syntax errors-Yacc
Semantics & runtime environments : Syntax-directed definitions, construction of syntax trees, DAG’S-
bottom-up evaluation of s-attributed definitions, l-attributed definitions; Run-time environments:- Source
language issues, storage organization, storage-allocation strategies, access to non-LOCAL names, parameter
passing, symbol tables:- Storage classes, visibility, and life times- attributes-entries- local and global symbol table
structures and management.
Intermediate Code Generation & Optimization : Intermediate languages, Three Address Code : - declarations,
assignment statements, addressing array elements, Boolean expressions, case statements, back patching. Code
optimizations:- The principle source of optimization, optimization of basic blocks, loops in flow graphs.
Code optimization, Assemblers & Macros : Issues in the design of a code generator, the target machine,
Reducing the memory access times by exploiting addressing modes-peephole optimizations, basic blocks, DAG’s-
Elements of Assembly language – assemblers – Passes of an assembler-Macros-design of macro processors –
passes of a macro processor.
TEXT BOOK
1. Alfred V. Aho, Ravi Sethi, Jeffery D. Ullman “Compilers – Principles, Techniques, and tools” Pearson
REFERENCE BOOKS :
1. Steven S. Muchnick “ Advanced Compiler Design Implementation “ Elsevier Science India.
2. D.M. Dhamdhere “Systems Programming and operating systems” Tata McGraw Hill Pub
33
L T P C
06BCE 304 OBJECT ORIENTED ANALYSIS & DESIGN 3 0 3
Aims: The subject aims to introduce of the object-oriented development processes, UML and related
methodologies.
Objectives: The students would be able to understand the techniques, applications and UML based object
oriented analysis and design.
Complexity of software: Structure of complex systems, decomposing complexity, Designing complex systems,
Object Model: Evolution, Elements of object model, Applying object model
Elements of Notation: Class diagrams, state transition diagrams, object diagrams, Interaction diagrams, module
diagrams, process diagrams, applying the notation. Principles, micro development process, macro development
process.
Management and planning: Staffing, Release management, Reuse, Quality Assurance and Metrics,
Documentation, Tools, Benefits and Risks of Object Oriented development
Introduction to Object-Oriented Paradigm and UML: Unified Process, the Requirement Workflow, Object-
Oriented Analysis Workflow, Object-Oriented Design Workflow, Workflow and phases of the Unified process.
Analysis and Design: Case studies, Teams, Testing, Management Issues, Planning and Estimating, Maintenance,
User Interface system, Introduction to Web – Based Systems.
TEXT BOOK:
1. Grady Booch, "Object Oriented Analysis and Design with applications", Addison Wesley, 1994.
REFERENCE BOOK:
1. Schach, Stephen R., "An Introduction to Object-Oriented Systems Analysis and Design with UML and the
Unified Process", Tata McGraw Hill, 2003
34
L T P C
06BCE306 LINUX SYSTEM PROGRAMMING 2 1 3
Aim : To introduce the various system related commands and features of the Linux operating system
Objective : To enable the student to write their own device drivers, system related utilities, message oriented
protocols
Introduction : Linux – the operating system; compiling the kernel; introduction to the kernel - important data
structures, main algorithms, implementing system calls. Memory management - architecture-independent memory
model, virtual address space for a process, block device caching, pages under linux.
IPC, File System: IPC- Synchronization in the kernel, communication via files, pipes, debugging using ptrace,
system V IPC, IPC with sockets. File system -basic principles, representation of file system in the kernel, the proc
file system and ext2 file system.
Device drivers, modules, and debugging: Device drivers - Character and block devices, polling and interrupts,
the hardware, implementing a driver, an example of DMA operation. Modules- concepts, implementation in the
kernel, what can be implemented as a module? Parameter passing, the kernel daemon, an example module.
Debugging- concepts, the debugger printk(), debugging with gdb.
Network implementation : Introduction concepts, important structures, network devices under linux, ARP,
IP,UDP and TCP, the packet interface.
System calls, commands, file system, boot process

System calls : Process management, the file system, communication, memory management, initialization, all that
remains, kernel-related commands: free, ps, top, init, shutdown, strace, traceroute, mount, configuring kernel,
network interface, serial interface, and parallel interface. The proc file system: the proc/directory. The
net/directory, the self/directory, the sys/directory. The boot process: carrying out the boot process, lilo-the linux
loader.
TEXT BOOK :
1. M. Bek Et Al : LINUX Kernel Internals, Addison-Wesley, 1997 (Chapters 1 to 9, Appendices, A,B,C,D)
REFERENCE BOOKS :
1. Remy Card Et Al : The LINUX Kernel Book, John Wiley, 1998

2. Mark G. Sobel : A Practical Guide To LINUX, Addison-Wesley, 1997.
35
L T P C
06BCE 308 OPERATING SYSTEMS * 3 0 3
Aim: This subject aims to introduce operating system concepts such as processes & threads, memory
management, scheduling algorithms and distributed file systems
Objectives : The students would be able to understand and explain various OS concepts such as time-sharing,
Multiprogramming, Parallel, Distributed systems, processes & Threads, CPU scheduling algorithms, Semaphores
and Critical regions, Deadlock prevention, Memory Management, I/O systems and File Systems They would be
able to use Linux system, windows 2000.
Introduction: Computer-System Structures, Operating-System Structures
Process Management: Processes, Threads, CPU Scheduling, Process Synchronization, Deadlocks
Memory, File & IO Management: Memory Management, Virtual Memory, File-System Interface, File-System
Implementation, I/O Systems, Mass-Storage Structure
Distributed System: Distributed System Structures, Distributed File Systems, Distributed Coordination,
Protection, Security
Case Study: The Linux System, Windows 2000.
TEXT BOOK:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, "Operating System Concepts", John Wiley &
Sons, Inc. 6th Edition
REFERENCE BOOK:
1. Stallings William, "Operating Systems", Prentice Hall of India, Fourth Edition
36
L T P C
06BCE310 GRAPH THEORY AND ITS APPLICATIONS 2 1 3
Aim: This subject aims to cover basic concepts of Graph theory
Objective: The students would be able to understand and explain fundamentals of Graph Theory their
applications.
Introduction
Definitions, importance, isomorphism, walk, paths, circuits, connected, disconnected graphs, operation
on graphs operation on graphs, Euler and Hamiltonian graphs.
Trees, Cut sets, Planar and Dual Graphs

Properties, distance and centers, trees, spanning trees, fundamental circuits, minimal spanning tree.Cut sets -
Properties, fundamental circuits and cut sets, connectivity, separatability, network flows, 1-2 isomorphism.Planar
and dual graphs -Combinatorial representation, planar graphs, kuratowski’s graphs, detection of planarity, dual
graphs.
Matrix representation of graphs

Incidence matrix, circuit matrix, cut set matrix, fundamental matrices, relationships amongst matrices, path matrix,
and adjacency matrix.
Coloring, covering and partitioning

Chromatic number, chromatic partitioning, matching, covering, four color problem.
Directed graphs
Different types, directed paths and connectedness, Euler digraphs, trees-matrix representation, tournament.
Graph theoretic algorithms

Computer representation of graphs – input & output, algorithms for connectedness, spanning tree, fundamental
circuits, cut vertices, directed circuits and shortest paths.
TEXT BOOK:
1. Narasing Deo, Graph Theory With Application To Engineering And Computer Science, Prentice Hall India,
1995.
REFERENCE BOOKS:
1. Tulasiraman And M.N.S. Swamy, Graph, Networks And Algorithms, John Wiley, 1981.
2. F.Harary, Graph Theory, Addison Wesley/ Narosa, 1998.
3. E.M.Reingold, J.Nievergelt, N.Deo, Combinatorial Algorithms: Theory And Practice, Prentice Hall,
N.J.1977.
37
SYLLABUS (VI – SEMESTER)
L T P C
06BCE314L LINUX SYSTEM PROGRAMMING LAB 2 2
To carryout a mini project based on the various system related commands learnt in the theory subject.
38
L T P C
06BCE 316L OPERATING SYSTEM LAB 2 2
1. Program to report the behavior of the OS to get the CPU type and model, kernel version.
2. Program to get the amount of memory configured into the computer, amount of memory currently available.
3. Write a program to create processes and threads.
4. Implement the various process scheduling mechanisms such as FCFS, SJF, Priority, round – robin.
5. Inter Process Communication (IPC) using Message Queues.
6. IPC using pipes.
7. Implementation of wait and signal using counting semaphores.
8. Implementation of wait and signal using binary semaphores.
9. Implement the solution for reader – writer’s problem.
10. Implement the solution for dining philosopher’s problem.
11. Implement banker’s algorithm.
12. Signaling process
13. Implement the first fit; best fit and worst fit file allocation strategy.
14. Implementation of page replacement algorithms.
15. Write a program that uses a waitable timer to stop itself K.sec. After it started where K is a command line
parameter.
39
06BCE401 PERIPHERALS INTERFACING AND TROUBLE 2 1 3

SHOOTING
Aim : To expose the students to know about Internals of PC and how they are functioning.
Objective : To assemble a PC and identify the frequently occurring errors and troubleshooting them
appropriately.
Introduction to Microcomputer System

Peripheral Devices – Keyboard – CRT Display Monitor – Printer – Magnetic Storage Devices – FDD –
HDD – Special Peripherals – PC Hardware Overview – BIOS – DOS interaction _ PC Family – PC
Hardware – Mother board Logic – Memory Space – I/O port address – Wait state – Interrupts – I/O
Data transfer – DMA channels – Keyboard interface – Parallel Interface – Serial Interface – CRT Display
Controller – FDC – HDC – Hard disk card – Memory Refresh – POST Sequence.
Hardware Components and ICS

Microprocessors in PC Intel 8088 – Internal Organisation – Bus cycle – 8088 Operation – I/O Addressing –
Interrupt Handling – 8088 Instruction – Coprocessor – Support chips in the Mother board – Dump and Smart
Chips – Clock Generator 8284 – Bus controller – Interrupt controller 8259A – Programmable Interval Timer
8253 – 8255A-5 PPI - DMA Controller 8237A-5
Mother board circuits

Motherboard functions – Reset Logic – CPU Nucleus Logic – DMA Logic – Wait state logic – Bus Arbitration –
RAM Logic – ROM Logic – ROM Decode Logic – RAM Parity Logic – NMI – Logic – I/O Ports Decode Logic
– Time of day (TOD) Logic – Dynamic Memory Refresh Logic – Speaker Logic – Mode switch Input Logic
Keyboard Interface – coprocessor Unit – Control Bus Logic – Address Bus Logic – Data Bus Logic – I/O slot
signals – New generation Mother Board – Mother Board Connectors and Jumpers – Design Variations – SMPS –
Printer controller – Floppy Disk Controller.
Hard Disk / Display Controller Subsystem

Display Adaptor – CRT Display – CRT Controller Principle – CRT Controller Motorola 6845 – MDA Design
Organisation – Colour – Graphics Adapter – Advanced Graphics adapters – New Generation display Adapters –
Display Adapters – Device Interface – Auxiliary Subsystems – Serial Port in PC – RTC – LAN
Installation and Preventive Maintenance

Pre – Installation Planning – Practice – Routine Checks – Special Configurations – Memory, Hard disk up
gradation – DOS and Software – Preventive Maintenance – System Usage – Trouble Shooting – Nature and
Types of Faults – Trouble – shooting Tools – Fault Elimination Process – Systematic Trouble – shooting – Post –
Motherboard Problems – Diagnosis – FDC – FDD, HDC, HDD Problems – Over view of Advanced PCs.
REFERENCE BOOK:
1. B. Govindarajulu, “IBM PC and Clones Hardware, Trouble Shooting and Maintenance”, Tata McGraw Hill.
Pub. Ltd., 6th Reprint, 1993.
40
L T P C
06BCE 403 EMBEDDED SYSTEMS 3 0 3
Aim: The subject aims to cover the concepts of embedded systems, their design and applications, programming
models and Interprocess communication.
Objectives: The student would be able to understand and use in embedded systems, device drivers, software
engineering practices in embedded systems development and Inter process communication.
Introduction to Embedded Systems: Processor in the System – Software Embedded into a system – Exemplary
Embedded Systems – Embedded System-On-chip and in VLSI Circuit Processor and Memory
Organization – Structural Units in a Processor – Processor Selection for an Embedded System – Memory Devices
– Memory Selection for an Embedded System – Allocation of Memory to Program Segments and Blocks and
Memory Map of a System – Direct Memory Access – Interfacing Processor, Memories and I/O Devices.
Devices and Buses for Device Networks: I/O Devices – Timer and Counting Devices – Serial Communication
Using the I2 C, ‘CAN’ and Advanced I/O Buses between the Networked Multiple Devices – Host System or
Computer Parallel Communication between the Networked I/O Multiple Devices Using the ISA, PCI, PCI – X
and Advanced Buses
Device Drivers and Interrupts Servicing Mechanism: Device Drivers – Parallel Port Device Drivers in a
System – Serial Port Device Drivers in a System – Device Drivers for Internal Programmable Timing Devices –
Interrupt Servicing (Handling) Mechanism – Context and the periods for Context – Switching, Deadline and
Interrupt Latency
Program Modeling Concepts: Single and Multiprocessor Systems Software – Development Process- Modeling
Processes for Software Analysis Before Software Implementation – Programming Models for Event Controlled or
Response Time Constrained Real Time Programs – Modeling of Multiprocessor Systems
Software Engineering Practices: Embedded Software Development Process-Software Algorithm Complexity –

Software Development Process Life Cycle and its Models – Software Analysis – Software Design – Software
Implementation – Software Testing, Validating and Debugging – Real Time Programming Issues During the
Software Development Process – Software Project Management – Software Maintenance –Unified Markup
Language (UML) – Interprocess Communication & Synchronization of processes, Task & Threads – Multiple
processes in an Application – Problems of Sharing Data by Multiple Tasks & Routines – Interprocess
Communication.
TEXT BOOK:
1. Rajkamal, “Embedded Systems-Application, Practice & Design”, Tata McGraw Hill, 2003
REFERENCE BOOKS:
1. Arnold S. Berger, “Embedded Systems Design”, CMP Books, 1997
41
L T P C
06BCE 405 NETWORK SECURITY 3 0 3
Aim: The subject aims to cover the significance of security of computer systems and computer networks. It also
covers the topics such as cryptography and various encryption algorithms.
Objectives: The students would be able to understand and use encryption algorithms such as RSA, Blow Fish etc;
authentication techniques digital signatures and System-level security issues.
Attacks, Services & Mechanisms: Security attacks – Security services – Network Security Model. Conventional
Encryption: Classical Techniques: Conventional Encryption model - Stenography – Classical Encryption
Techniques- Modern Techniques: The Data Encryption Standard – The Strength of DES – Differential and
Linear, Crypto-analysis.
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 – Hash
functions – Security of hash functions and MAC. Hash Algorithm: Message Digest algorithm (MD5) – Secure
Hash algorithm (SHA-1) – HMAC. Digital Signatures and Authentication Protocols: Digital signatures –
Authentication protocols – Digital signature standard.
Electronic Mail Security: Pretty Good Privacy – PGP services – Transmission and reception of PGP messages –
PGP message generation – PGP message reception. IP Security: Overview – Architecture – Authentication header
– Web Security: A comparison of Threats on the Web – Secure Socket Layer and transport layer security: SSL
architecture – SSL record protocol – Handshake protocols.
Intruders and Viruses, Worms: Intruders – Intrusion techniques – Password protection – Access control –
Password selection strategies -Intrusion detection- Different approaches of Intrusion detection - Audit records
Viruses and related Threats – Firewalls: Firewall design principles – Firewall characteristics – types of firewalls –
Firewall configurations.
TEXT BOOK:
1. William Stallings “Cryptography and Network security – Principles and Practice", 2nd edition, Pearson
Education, 2002.
REFERENCE BOOK:
1. Atul Khate, “Cryptography and Network Security”, Tata McGraw Hill, 2005.
2. Charlie Kaufman, Raja perlman, Mike speciner, “Network Security” – 2nd edition, Prentice-Hall of India Pvt
Ltd, 2002.
42
L T P C
06BCE413L PERIPHERALS AND INTERFACING LAB 2 2
1. Keyboard Scanning Routine
2. 7 – segment LED Display Routine
3. Software decoder driver
4. Printer Interface
5. Programmable Peripheral Interface
6. Programmable Communication Interface
7. Programmable Timer
8. Power On self Test (POST)
9. Diagnostics home menu
10. Trouble Shooting in PC’s
11. Data Acquisation System
12. Floppy Disk Drive, Hard Disk Drive Mechanism
43
L T P C
06BCE415L EMBEDDED SYSTEMS LAB 2 2
Student has to do a mini project based on the knowledge acquired in the theory paper.
44
L T P C
06BCE E01 COMPUTER SIMULATION & MODELLING 3 0 3
Aim: This subject aims to cover statistical models in simulation, Inventory systems, Random numbers & variables,
Input and output analysis
Objectives: The students would be able to understand and use discrete event simulation, simulation techniques,
statistical methods.
Introduction to Simulation: Advantages and disadvantages of simulation, areas of application, Systems and
system environment, Components of a system, Discrete and continuous systems, Model of a system. Types of
models, Discrete – events system simulation, Steps in a simulation study. Simulation Examples, Simulation of
queuing systems, Simulation of inventory systems, other examples of simulation, discrete event simulation, general
principles and computer simulation languages. Concepts in DES, Programming languages for DESS: FORTRAN,
GASP, SIMSCRIPT, GPSS, SLAM, Summary and comparison of simulations.
Statistical Models in Simulation: Review of terminology & concepts, Useful statistical models, Discrete
distributions, Continuous distributions, Process, Empirical distributions. Queuing Models: Characteristics of
queuing systems, queuing notation, Transient & steady state behavior of queuing notation, Transient & steady
state behavior of queues, long run measures of performance of queuing systems, steady – state behavior of finite
population models.
Inventory Systems: Measures of effectiveness, Inventory policies, Deterministic systems, and probabilistic
systems, Simulation in inventory analysis. Random Number Generation: Properties of random numbers,
Generation of Pseudo – random. Nos., techniques for generating random nos., tests for random nos. Random
variable Generation: Inverse transform technique, Direct Transformation for the normal distribution, Convolution
method, Acceptance-Rejection technique.
Input Data Analysis: Data collection, identifying the distribution, parameter estimation, goodness-of-fit tests.
Verification and validation of simulation models: Model building, verification & validation, verification of
simulation models, calibration & validation of models.
Output Analysis For a Single Model: Stochastic nature of O/P data, types of simulations with respect to O/P
analysis, measures of performance and their estimation, O/P analysis for terminating simulations, O/P analysis for
steady-state simulations. Comparison and evaluation of alternative system designs: Comparison of two and several
system designs, statistical models for estimating the effect of design alternatives.
TEXT BOOK:
1. Jerry Banks, John S. Carson, Discrete-event System Simulation, PHI, 3rd Edition
REFERENCE BOOK:
1. Karian, Z.A. and Dvdewicz. E.J., Modern Statistical Systems and GPSS Simulation, Freeman, 1991.
45
L T P C
06BCE E03 DISTRIBUTED COMPUTING 3 0 3
Aim: The subject aims to cover parallel & distributed computing architecture, networked clusters of computers,
utilization and management of the expensive resources that are remote to the users.
Objectives: The students would be able to understand and use different network models, security mechanisms
and design methodologies of Distributed systems
Models & IPC: Introduction to distributed computing system, evolution different models, gaining popularity,
definition, issues in design, DCE, message passing –introduction, desirable features of a good message passing
system, issues in IPC, synchronization, buffering, multigram messages, encoding and decoding of message data,
process addressing, failure handling, group communication.
RPC: RPC-Introduction, model, transparency, implementation mechanism, stub generation, RPC messages,
marshalling arguments and results, server management, parameter - passing semantics, call semantics,
communication protocols for RPCs, client – server binding, exception handling, security, mini project using Java
RMI
Distributed Shared Memory: Distributed shared memory- general architecture of DSM systems, design and
implementation issues of DSM systems, granularity, structure of shared memory space, consistency model,
replacement strategy, thrashing, advantages of DSM, clock synchronization,
Resource and process Management: Introduction, desirable features of good global scheduling algorithm, task
assignment approach, load balancing approach, process migration, threads.
Distributed File Systems and Security: DFS and security- Desirable features of good DFS, file models, file
accessing Models, file sharing semantics, file caching schemes, and file replication. Fault Tolerance, atomic
transaction, potential attacks to computer system, cryptography, authentication, access control. Digital signatures,
DCE security service.
TEXT BOOK:
1. Pradeep K. Sinha, "Distributed Operating Systems: Concepts & Design", PHI, 2005.
REFERENCE BOOK:
1. Andrew S. Tanenbaum, “Distributed Operating Systems” Pearson Education, 2002.
46
L T P C
06BCE E05 DISTRIBUTED DATABASE SYSTEM 3 0 3
Aim: This subject aims to cover Distributed Data processing, Distributed Database Design, Query processing,
Query decomposition, Transaction management and Distributed DBMS reliability.
Objectives: The students would be able to understand and use distributed Database Processing, Distributed
databases, Query processing, Query decomposition and Transaction Management.
Introduction to Distributed Data Processing: What is a distributed database system – Promises of DDBS –
Complicating Factors – Problem Areas, DBMS Standardization – Architectural models for distributed DBMS –
Distributed DBMS Architecture – Global Directory issues
Distributed Database Design: Alternative Design Strategies – Distributed Design issues – Fragmentation –
Allocation, Semantic Data Control: View Management – Data Security – Semantic Integrity Control Overview of
Query Processing - Query processing problem – objectives of query processing – Complexity of Relational
Algebra operations – characteristics of Query Processors – Layers of Query processing
Query Decomposition: Localization of Distributed Data, Query Optimization – Centralized Query Optimization
– Join Ordering in fragment queries – distributed query optimization algorithms.
Introduction to Transaction Management: Definition of a Transaction – Properties of Transaction – Types of

Transaction, Distributed concurrency control- Serializability theory – Taxonomy of concurrency control
mechanisms – Locking based concurrency control algorithms Timestamp-based concurrency control algorithms –
Optimistic concurrency control algorithms – Deadlock management – Relaxed concurrency control.
Distributed DBMS Reliability: Reliability concepts and measures – Failures and fault tolerance in distributed
systems – local reliability protocols – distributed reliability protocols – dealing with site failures – Network
partitioning – Architectural considerations.
TEXT BOOK:
1. M. Tamer Ozsu, Patrick Valduriesz, "Principles of Distributed Database Systems", PHI, 1999
REFERENCE BOOK:
1. Stefanoceri, Giuseppe Pelagatti, "Distributed Database Principles and Systems", McGraw Hill publications,
1987.
47
L T P C
06BCE E07 DATAWAREHOUSING AND DATA MINING ** 3 0 3
Aim: The subject aims to cover knowledge discovery process and to design and populate a business data
warehouse.
Objectives : To make familiar with the various concepts of data warehousing like meta data, data mart, summary
table, fact data and dimension data. To sail along with the various approaches in data mining. To familiarize with
the various data warehousing and data mining tools
Data Warehouse and OLAP Technology for Data mining: Introduction to Data Warehouse- A
multidimensional Data Model – Data Warehouse architecture – Data preprocessing- Data cleaning – Data
integration and Transformation.
Data Mining Introduction: Introduction to Data Mining – Data Mining Functionalities – Classification of Data
Mining systems, Major issues in Data mining.
Data Mining primitives, languages & system architecture: Data Mining primitives: Task – relevant data –
kind of knowledge to be mined – Background knowledge – interestingness measures– presentation & visualization
of discovered pattern - Data Mining Query language – Designing Graphical User interfaces based on DMQL -
Architecture of Data mining.
Association Rule Mining: Basic concepts – market basket analysis - Mining single dimensional Boolean
association rules from transactional databases. Classification & prediction: What’s classification - issues regarding
classification and prediction – Bayesian classification – prediction: linear – non linear.
Cluster analysis: Types of Data in cluster analysis - Major clustering methods. Data mining applications.
TEXT BOOK:
1. Han J. & Kambler, M, “Data Mining: Concepts and Techniques”, Morgan Kaufmann, 2005.
REFERENCE BOOKS:
1. Immon.W.H., “Building the Data Warehouse”, Wiley Dream Tech, 3rd Edition, 2003.
2. Anahory S., Murray, D, “Data Warehousing in the Real World”, Addison Wesley, 1st Edition, 1997.
48
L T P C
06BIT E09 MOBILE COMMUNICATION ** 3 0 3
Aim: The subject aims to impart the knowledge about the technologies like CDMA, GSM, GPRS and Wireless
Application protocols
Objectives: The student would be able to understand the principles and practices of Mobile Communication,
Satellite Communication, Medium Access Control techniques, Mobile Devices, Wireless Local Area Networks,
HiperLAN and Bluetooth, Wireless ATM operations, mobile network layer and various wireless Application
Protocol.
Introduction: Wireless Transmission –Frequencies for Radio transmission –signals-Antennas –Signal propagation
–multiplexing Modulation-Spread spectrum –Cellular systems
Communication Systems: Medium access control-Motivation for a specialized MAC SDMA-FDMA-TDMA-

CDMA-comparison of S/T/F/CDMA. Telecommunication Systems –GSM, DECT, TETRA, UMTS and IMT -
2000, Satellite Systems –GEO139, LEO139, MEO140. Routing, Localization, Handover. Broadcast systems
Overview –Cyclic Repetition of Data Digital Audio Broadcasting –Digital Video Broadcasting.
Wireless Communication: Wireless LAN-Infrared vs. Radio transmission, Infrastructure and ad hoc networks,
IEEE802.11, HIPERLAN, Bluetooth. Wireless ATM, Motivation for WATM, Wireless ATM working group,
WATM Services, Reference Model, Functions, Radio Access Layer: Handover, Location Management,
Addressing, Mobile quality of service, Access point control protocol.
Mobile Network Layer: Mobile IP-Dynamic host configuration protocol-Ad hoc networks. Mobile transport
layer-Traditional TCP292: Indirect TCP, Snooping TCP. Mobile TCP: Fast Retransmit/Fast recovery,
transmission/Timeout Freezing, Selective Retransmission, Transaction oriented TCPU
Support for Mobility: File Systems-Consistency –World Wide Web – Hyper Text mark up language (HTML) –
approaches that might help wireless access-System architecture –Wireless Application Protocol.
TEXT BOOK:
1. Johchen schiller, Mobile Communication, Addison Wesley, 2000.
REFERENCE BOOK`:
1. Asoke K. Talukder, Roopa R.Yavagal, “Mobile Computing-Technology, Applications and Service Creation”,
Tata McGraw Hill, 2005.
49
L T P C
06BCE E11 WEB SERVICES 3 0 3
Aim: To provide the student with the basics of .NET, C#.
Objectives: After completion of this course the students will be able to undergo projects in .NET
Introduction to Microsoft .NET Platform: Building Blocks of .NET C# Language Fundamentals: Object
Oriented Programming in C#.
.NET Framework Concepts I: console I/O-working with strings-formatting and conversion- file I/O –
serialization.
Threading NET Framework Concepts II: Reflection- Remoting -XML Parsing-Security;
Writing GUI Applications with .NET Framework: Introduction to ADO.NET; Writing Web Application with
the .NET framework;
Introduction to Web Services: Writing Mobile Application with .NET Framework; Advanced Concepts.
TEXT BOOK:
1. Rick Leinecker ASP.NET on the edge, IDG Books India Pvt. Ltd, 2003
REFERENCE BOOKS:
1. MSDN, Microsoft C# Language specification, WP Publishers and Distributors, 2001

2. MSDN, Microsoft Visual Basic .NET framework, WP Publishers and Distributors, 2003
3. MSDN, .NET Framework, WP Publishers and Distributors, 2003
50
L T P C
06BCE E15 PATTERN RECOGNITION 3 0 3
Aim: This subject aims to cover basic concepts of Pattern recognition, Artificial Neural Network Structures,
Advanced learning algorithms for Pattern Recognition.
Objectives: The students would be able to understand and explain fundamentals of pattern recognition, their
applications and comparative studies of feed forward artificial networks.
Basic Concepts: Basic Concepts of Pattern Recognition, Feature Detection- Decision theoretic algorithms –
structural pattern recognition. Clustering – Nearest neighbor classification – Non parametric techniques.
Artificial Neural Network Structures: Supervised training via error back propagation - derivations. Decision
Trees – Multilayer perceptrons.
Advanced Fundamentals of Neural Network: Acceleration and stabilization of supervised gradient training of
MLPs – advances in network algorithm for classification and recognition – recurrent neural networks.
Neural Feature and Data Engineering: Neural engineering and testing of FANN’s – feature and data
engineering.
Testing and Applications: Some comparative studies of feed forward artificial networks – pattern recognition
applications in texture classification & recognition – speech recognition – neural processing of digital images –
character recognition. Recognition of emergencies using ANN.
TEXT BOOK:
1. Carl G. Looney, “Pattern recognition using Neural Networks – theory and algorithms for engineering and
scientists”, Newyork Oxford University Press – 1997.
REFERENCE BOOK:
1. Christopher M. Bishop, “Neural Networks for Pattern Recognition,” Oxford University Press, 1995.
2. Earl Gose, R.Johnsonbaugh, S.Josh, “Pattern Recognition and Image Analysis”, Prentice Hall, 1996.
51
L T P C
06BCEE17 CLIENT SERVER TECHNOLOGY 2 1 3
Aim : To explain various issues related with SQL database services and transaction processing.
Objective : To design an efficient database and evaluate the transaction processing mechanism under different
loading environments.
Introduction : Client-server computing : Concepts, building blocks; the state of the client-server infrastructure :
components, middleware building block, the current state.
Middleware : Networking Operating System (NOS)- creating the single system image; the transparent illusion,
peer –to –peer communications, remote procedure calls, messaging and queuing, stack middleware; TCP/ IP and
sockets, NETWARE, net bios, named pipes, SNA, IBM LAN server; NETWARE vs. LAN server; Distributed
Computing Environment (DCE) - the post modern NOS, DFS, threads, OSF’s DCE releases.
Sql database services: Fundamentals; database servers; functions, stored procedures, triggers and rules; SQL
middleware and federated databases; the options, SQL API, open SQL gateways; data warehouses; concepts,
OLTP, information at the fingertips, information warehouses.
Client- server transaction processing : Transactions : Concepts, acid properties, transaction models, transaction
processing monitors, transaction management standards, TP-lite: origins and concepts, tp-lite vs tp-heavy; client-
server groupware: concepts and importance of groupware, components of groupware: lotus notes: features and
applications.
TEXT BOOK :
1. Robert Orfali Et Al , “Essential Client-Server Survival Guide” , John Wiley, 1994. (Chapters 1 to 20)
REFERENCE BOOK :
1. Linthicelm : David Linthicelm’s “Guide To Client / Server And Intranet Development” , John Wiley, 1997
52
L T P C
06BCEE21 WEB COMMERCE 2 1 3
Aim: To introduce the basics of Electronic Commerce Technology and other electronic payment techniques and
issues
Objectives: The students would be able to understand the basic concepts and applications of Electronic
commerce and have knowledge about different electronic payments, their related issues and security.
Introduction: Electronic commerce environment and opportunities: Background, the electronics commerce
environment, electronic marketplace technologies. Modes of electronic commerce: overview - electronic data
interchange (EDI), migration to open EDI. E-commerce with internet/www, commerce-net advocacy, web
commerce going forward. Approaches to safe e-commerce: overview - secure transport protocols secure
transactions, secure electronics payment protocol, secure electronics transaction, certificates for authentication,
security on web servers and enterprise networks.
Payments and security : Electronic payment systems: types, digital token-based electronic payment systems,
smart cards and electronic payment systems, credit cards- based electronic payment systems, risk and electronic
payment systems, designing electronic payment systems, master card/visa secure electronics transaction -
Introduction, business requirements, concept and payment processing e-mail and secure e-mail technologies,
Introduction the meaning of distribution, a model for message handling working of E-mail, MIME, S/MIME and
MOSS, comparisons of security methods, MIME and related facilities for EDI over internet.
Application: Consumer-oriented e-commerce: application mercantile process models, mercantile models from the
consumer’s perspective and from the merchant’s perspective. Intra organizational commerce and EDI : EDI,
applications of EDI in business, legal, security and privacy issues; EDI and e-commerce; standardization and EDI
software implementation, EDI envelope for message transport, values-added networks, Internet-based EDI. Intra
organizational e-commerce: internal information systems, macroforces and internal commerce, workflow
automation and coordination customization and internal commerce, supply chain management.
Advertising and marketing:: The new age of information-based marketing, advertising on the Internet, charting
the online marketing process. Consumer search and resource discovery; search and resource discovery paradigms,
information search and retrieval, e-commerce catalogs or directories, information filtering, consumer-data
interface: emerging tools.
Electronics publishing: EP and web-based EP, Intellectual property issues in the age of EP, intellectual property
issue for multimedia/ hypermedia development.
TEXT BOOKS:
1. Daniel Minoli, Emma Minoli, “Web Commerce Technology Handbook”, Tata McGraw – Hill, 1998.
2. Ravi Kalakota, Andrew B. Whinston “Frontiers of Electronics Commerce”, Addison-Wesley, 1996
REFERENCE BOOK:
1. Daniel Lynch And Leslie Lundquist, “Digital Money: The New Era Of Internet Commerce”, John Wiley,
1996
53
L T P C
06BCEE23 DATA COMPRESSION TECHNIQUES 2 1 3
Aim: This subject aims to cover standard compression techniques
Objectives: The students would be able to understand and design new compression techniques.
Introduction to Information theory

Compression techniques, lossless compression, lossy compression, measures of performance, modeling and
coding. Mathematical preliminaries: Overview, introduction to information theory, models, physical models,
probability models, markov models.
Various compression coding techniques

Huffman coding: Good codes, huffman coding algorithm, minimum variance huffman codes, length of huffman
codes, extended huffman codes, non binary huffman codes, adaptive huffman codes, applications. Arithmetic
codes: Overview, coding a sequence, generating a binary code, comparison of huffman and arithmetic coding,
applications.
Lossless image compression and vector quantization

Lossless image compression: Introduction, facsimile encoding, run length encoding, progressive image
transmission, other approaches. Vector quantization: Introduction, advantages LBG (Linde, Buzo, Gray)
algorithm, empty cell problem, tree structured vector quantizer, other vector quantization schemes, Codebook
Initialization, JPEG Compression, Machine Learning
Differential coding
Overview, introduction, basic algorithm, Differential Pulse Code Modulation(DPCM), Adaptive Differential Pulse
Code Modulation (ADPCM), delta modulation, Constant Factor Delta Modulation (CFDM), speech coding.
Transform coding
Different transforms, Quantization and coding of transforms, application to image compression. Wavelet
transforms and data compression introduction, transform coding, Discrete Wavelet Transforms (DWT) for image
compression, audio compression, video coding using multi-resolution techniques.
TEXT BOOK:
1. Khalid Sayood, “Introduction to Data Compression”, Morgan Kaufmann Publications, Second Edition,
1996.
REFERENCE BOOKS:
1. Ralf Steinmetz and Klara Nahrsedt, “Multimedia Computing and Communication and Applications”,
Pearson Education, 2000.
2. Raghuveer M. Rao, “Wavelet Transforms: Introduction to Theory and Applications”, Addison Wesley Pub.
Co. Ltd., 1998.
54
L T P C
06BCEE25 SOFTWARE PRACTICE AND TESTING 2 1 3
Aim : To expose the various testing methods, notations, algorithms used for a testing software
Objective : To train the students to enable them to design their own software testing and software management
tools
Software Practice :
Style : names, expressions, statement, consistency and idioms, function macros, constants, comments; interface :
csv, prototype libraries, interface principles, resource management, user interfaces.
Algorithms and data structures : Searching, sorting, libraries, growing arrays, lists, trees, hash tables. Design and
implementation : markov chain algorithm, data structure alternatives, building the data structures in ‘C’, generating
the output, performance liaisons.
Performance : Performance bottlenecks, timing and profiling speed, spacy efficiency, estimation, portability :
language, headers and libraries, program organization, isolation, data exchange, byte order, portability and upgrade,
internationalization.
Notation : formatting data, regular expressions, programming tools, interpreters and compilers, program
generators, macros. Debugging : debuggers, clues and bugs, debugging tools.
Software testing process maturity and framework for test process improvement
The six essentials of software testing : the state of the art and the state of the practice; the clean sheet approach to
getting started. Establishing a practical perspective; critical choices; what, when, and how to test; critical
disciplines: frameworks for testing.
Testing methods
Verification testing : basic verification methods, getting leverage on verification, verifying documents at different
phases, getting the best from verification, three critical success factors for implementing verification,
recommendations;
Validation testing : validation overview, validation methods, validation activities, and recommendation strategy
for validation testing; controlling validation costs; minimizing the cost of performance tests, minimizing the cost
of maintaining the tests, minimizing validation testware development costs. Recommendations; testing tracks
deliverables, validation testing tasks and deliverables, a testing orphan- user manuals, product release criteria,
summary of IEEE/ANSI test related documents, life-cycle mapping of tasks and deliverables; software testing
tools; categorizing test tools, tool acquisition; measurement provide answers, useful measures and other interesting
measures, recommendations.
Managing test technology, standard checklists : Organizational approaches to testing : organizing and
reorganizing , structural design elements, approaches to organizing the test function, selecting the right approach;
current practices, trends, challenges; GUIs: what’s new here? Usage testing, tester-to-developer ratios, software
measures and practices benchmark study; getting sustainable grains in place; getting gains to happen, getting help,
follow-up; standards relevant to software engineering and testing; verification checklists.
TEXT BOOKS :
1. Brain W. Kernighan and Rob Pike, “The Practice of Programming” , Addison-Wesley, 1999
2. Ed Kit : “Software Testing in the Real World”, Addison-Wesley, 1995.
55
REFERENCE BOOKS :
1. William Perry, “Effective Methods For Software Testing” (Second Edition), John Wiley, 1999
2. Beizer B, “Software Testing Techniques” (Second Edition), Van Nostrand Reinhold, 1990
3. Myers, G.J. “The Art of Software Testing”, John Wiley, 1979
4. Steve Merger ,”Writing Solid Code”, Microsoft Press, 1993
56
L T P C
06BCE E27 COMPUTER GRAPHICS 3 0 3
Aim: The subject aims to cover Interactive and Non Interactive computer graphics methods, 2D and 3D
modeling.
Objectives: The student would be able to understand and use Computer Graphics various Clipping algorithms,
2D and 3D transformations.
Introduction to Computer Graphics: Display devices – Hardcopy devices – Interactive input devices – Display
processors – Graphic Adapters – basic function – Monochrome adapters, video monitors – Graphic software –
Output primitives – Line and circle drawing algorithms – Attributes of output primitives
Two-Dimensional Transformation: Clipping and windowing – Clipping algorithms – Segmented display files –
Display file compilation – Modeling and modeling transformation
Interactive Input Methods: Physical devices – Logical classification of input devices – Interactive picture
construction techniques – Input functions (9).
3D concepts: Methods of 3D representation – 3D transformations – Viewing – 3D clipping – Hidden – Surface

and Hidden – line elimination – shading and coloring methods – Basic modeling concepts and modeling methods
(10).
Computer Graphics Applications: CAD/CAM, Image processing, VLSI, games graphs and charts animation –
Introduction of graphics and kernel system (GKS) – binding language for GKS – programming examples using
GKS, PHIGS.
TEXT BOOK:
1. Donald Hearn and Pauline Baker Computer Graphics, Prentice Hall, New Delhi, 2000.
REFERENCE BOOKS:
1. Steven Harrington, "Computer Graphics- A programming approach", McGraw Hill, 1986.

2. Foley J.D., Van Dam A, "Fundamentals of Interactive Computer Graphics", Addison Wesley, 1990
57
L T P C
06BCEE29 ROBOTICS 2 1 3
Aim: This subject aims to cover basic concepts of Robotics
Objective: Upon completion of the course, student should be able to understand the concepts of spatial
mechanisms and their principles of design, control system devices, actuators along with robot part programming.
Introduction: Background, the mechanics and control of mechanical manipulators, notations
Spatial description and transformation : Introduction : description : positions orientation and frames; mapping:
changing descriptions from frame to frame, operators translators, rotations transformation: summary of
interpretations, transformation arithmetic, transform equations, more on representation of orientation
transformation of free vectors, computational considerations.
Manipulator kinetics: Introduction, link descriptions: link connection description, convention for affixing
frames to links, manipulator kinematics inverse manipulator kinematics: introduction solvability repeatability and
accuracy.
Manipulator mechanism design: Introduction, basing design on task requirements, kinematic configuration
position sensing force sensing.
Linear control of manipulators: Introduction, feedback and close loop control, second-order linear systems,
control of second order systems.
Robot programming language and systems : Introduction, the three level of robot programming, a sample
application, requirements of a robot programming , problem peculiar to robot programming languages.
Off-line programming systems: Introduction, central issues in OLP systems, CIM-station, automating subtasks
in OLP systems, summary.
TEXT BOOK:
1. John J. Craig, “Introduction To Robotics – Mechanics And Control”, Addison- Wesley, 2nd Edition 1999.
REFERENCE BOOKS:
1. K.S. Fu, R.C. Gonzalez, C.S.G Lee, “Robotics – Control Sensing Vision And Intelligence”, McGraw-Hill
Book Company
2. Robert J. Schilling, “Fundamentals of Robotics – Analysis and Control”, Prentice Hall Of India, 1996.
58
L T P C
06BCE E31 NEURAL NETWORKS 3 0 3
Aim: The subject aims to introduce the concepts of Neural Networks with emphasis on supervised and
unsupervised learning algorithms as well as on computational characteristics.
Objectives: The students shall be able to understand the biological and artificial model of neuron. Multi layer
perceptrons, pattern recognition techniques, Associative memories and Holographic Pattern Recognition system.
Introduction: Why Neural Networks and Why Now - What is a neural Net - Where are Neural Nets being used -
How are Neural Nets being used - the McCulloch Pitt’s Neuron.
Simple Neural Nets for Pattern Classification: General Discussion, Hebb Net: Algorithm, Application,
Perceptron: Architecture, Algorithm, Application, Back Propagation Net: Standard Back Propagation:
Architecture, Algorithm, Applications, Theoretical Results: Derivation of Learning rules, Multi Layer Neural Nets
as Universal Approximators.
Pattern Association: Auto associative Net: Architecture, Algorithm, Applications, Storage Capacity, Bidirectional
Associative Memory: Architecture, Algorithm, Applications, Analysis.
Neural Networks based on Competition: Kohonen Self –Organizing Maps: Architecture, Algorithm,
Applications, Learning Vector Quantization: Architecture, Algorithm, Application, Variations.
Adaptive Resonance Theory: Introduction, ART1: Architecture, Algorithm, Applications, Analysis, ART2:
Architecture, Algorithm, Applications, Analysis.
TEXT BOOK:
1. Laurene Fausett, “Fundamentals of Neural Networks Architectures, Algorithms, and Applications” 3rd
Edition, Pearson Education, 2004
REFERENCE BOOKS:
1. Simon Haykin, “Neural Networks – A Comprehensive Foundation, Pearson Education, 2nd Edition
2004.
2. I.R. Beale and T. Jackson, “Neural Computing”, IOP Publishing, 2000
59
L T P C
06BCE E33 OPERATIIONS RESEARCH 3 0 3
Aim: This subject aims to introduce the operations research techniques such as Linear Programming, Integer
Programming.
Objectives: The students would be able to understand and use concepts of OR, such as Linear programming,
dynamic programming. They would be able to solve Inventory, maintenance and replacement problems.
Concept of OR: Concept and scope of operations research (OR) – Development of OR – phase of OR – Models
in OR. Linear Programming-Methods of solution – graphical and SIMPLEX methods of solution VARIATIONS
– duality in LP – revised SIMPLEX method – applications for business and industrial problem.
Integer Programming: Formulation – graphical representation – Gomory’s cutting plane method,

Transportation and Assignment Problem- Initial solution – methods of improving the initial solution – traveling
salesman problem – dynamic programming – principle of optimality.
Sequencing and Scheduling Problems: Job sequencing – ‘n’ jobs through two machines, two jobs through ‘m’
machines and ‘n’ jobs through ‘m’ machines. PERT & CPM Techniques – critical path – normal and crash time –
resource allocation – resource leveling and smoothing.
Inventory Problems: Deterministic model – costs decision variables – economic order quality – instantaneous
and non-instantaneous receipt of goods with and without shortage – quality discount – probabilistic inventory
model – inventory systems – safety stock – reorder level (ROL), reorder point (ROP) determination.
Maintenance and Replacement Problems: Models for routine maintenance and preventive maintenance
decisions – replacement models that deteriorate with time and those fail completely.
TEXT BOOK:
1. Taha. H.A. “Operation Research- An Introduction”, Macmillan, 2000.
REFERENCE BOOKS:
1. Sharma. S.D., “Operation Research”, Keder Nath Ram Nath & co., 1989.
2. Billy. B. Gillet “Introduction to Operation Research”, Tata McGraw Hill 1982.
3. S. Hamblin & Stevens Jr. “Operation Research”, McGraw Hill Co., 1974.
60
L T P C
06BCE E35 DIGITAL SIGNAL PROCESSING 3 0 3
Aim: To understand the underlying the mathematics behind digital signal processors and designing various DSPs.
Objective: To design a appropriate filter and evaluate its efficiency by comparing with various design methods.
Review of Basic Concepts: Signals and signal processing: characterization and classification of signals, typical
signal processing operations, examples of typical signals, typical signal processing applications, why digital signal
processing - Transform-domain representations of Linear Time Invariant (LTI) systems: the frequency response,
the transfer function, types of transfer functions, all pass transfer function, minimum-phase and maximum-phase
transfer functions, complementary transfer functions, digital two-pairs, stability test, discrete-time processing of
random signals.
Digital Filters: Structures: block diagram representation, signal flow-graph representation, equivalent structures,
basic Finite Impulse Response(FIR) digital filter structures, basic Infinite Impulse Response (IIR) filter structures,
state-space structures, all pass filters, tunable iir digital filters, cascaded lattice realization of IIR and FIR filters,
parallel all pass realization of IIR transfer functions, digital sine-cosine generator, computational complexity of
digital filter structures. Design: preliminary consideration, impulse invariance method of IIR filter design, bilinear
transform method of IIR filter design, design of digital IIR notch filters, low pass IIR digital filter design.
Examples, spectral transformations of IIR filters, FIR design based on truncated Fourier series, FIR filter design
based on frequency sampling approach, computer-aided design of digital filters.
Digital Signal Processors: Overview of Motorola dsp563xx family of digital signal processors, architectures of
dsp56307: assembly language instructions and programming: typical software applications.
Implementation, Applications: Implementation consideration: basic issues, software implementation,

computation of the discrete Fourier transform the quantization process and errors, analysis of coefficient
quantization effects, analysis of coefficient quantization effects in fir filters. Representative applications: dual –
tone multifrequency signal detection, spectral analysis using dft, short-term discrete Fourier transform, musical
sound processing, digital fm stereo generation, discrete-time analytic signal generation, voice privacy system,
subband coding of speech and audio signals.
TEXT BOOK:
1. Sanjit K. Mitra: Digital Signal Processing – A Computer –Based Approach, Tata McGraw-Hill, 1998.
(Chapters 1,4,6,7,8.1 To 8.3, 9.1 To 9.10, 11.1 To 11.8)
REFERENCE BOOKS:
1. Alan V. Oppenhein, And Ronald W. Schafer: Discrete – Time Signal Processing (Second Edition), Prentice
– Hall, 1998.
2. John G. Proakis & Dimitris G. Manolakis: DSP Principles, Algorithms, and Applications Prentice-Hall,
1996.
61
L T P C
06BCE E37 DECISION SUPPORT SYSTEM** 3 0 3
Aim: To provide an environment to understand the system and to make decisions.
Objectives: The students will be capable of designing the decision support system for managers to take the
decision. The need for computerized decision support technologies, a framework for decision support, the
concept of decision support systems, group decision support systems, executive information (support) systems,
expert systems, artificial neural networks, hybrid support systems, the evolution and attributes of computerized
decision aids, introduction and definitions, systems models, the modeling process; evaluation.
DSS configuration: Characteristics, capabilities, and components of DSS, the user, DSS hardware, distinguishing
DSS from management science and MIS, classifications of DSS, data warehousing, access, analysis, and
visualization, the nature and sources of data, data collection and data problems, the internet and commercial
database services, database management systems in DSS.
Database organization and Structure: Data warehousing, OLAP: data access and mining, querying and analysis,
data visualization and multidimensionality, intelligent database and data mining, Support systems.
The GDSS meeting process: Constructing a GDSS and the determinants of its success, GDSS research
challenges Modeling for mss, static and dynamic models, treating certainty, uncertainty and risk, influence
diagrams, mss modeling in spreadsheets, decision analysis of a few alternatives, optimization.
Heuristic Programming: Simulation, multidimensional modeling, visual spreadsheets, financial and planning
modeling, visual modeling and simulation, ready-made quantitative software packages, model base management,
knowledge-based DSS & AI concepts and definitions, AI verses natural intelligence, knowledge in AI, how AI
differs from conventional computing, the AI field, types of knowledge-based DSS.
Intelligent DSS: The future of AI. DSS construction; the DSS development process; the DSS of the future,
decision making in groups, group DSS, the goal of GDSS and its technology levels, the technology of GDSS, the
decision (electronic meeting) room, GDSS software idea generation, negotiation.
TEXT BOOK:
1. Efrain Turban and Jay E. Aronson, “Decision Support Systems and Intelligent Systems”, Fifth Edition,
Prentice-Hall, 1998.
62

Syllabus

Transféré par

Informations du document

Description originale:

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

Syllabus

Transféré par

Droits d'auteur :

Formats disponibles

B.Tech.

(Computer Science and Engineering) - Syllabus

CURRICULUM & SYLLABUS

SCHOOL OF COMPUTER SCIENCES

VELLORE INSTITUTE OF TECHNOLOGY

A PLACE TO LEARN; A CHANCE TO GROW

VELLORE INSTITUTE OF TECHNOLOGY

Sl.no Sub-code Subject L T P IPT Proj C Pg.no

37. 05BCE 403 Embedded Systems 3 0 3 50

ELECTIVE – II (FREE ELECTIVES)

* COMMON BETWEEN CSE & IT

VELLORE INSTITUTE OF TECHNOLOGY, VELLORE - 14

COURSE – B.TECH – COMPUTER SCIENCE & ENGINEERING

* COMMON BETWEEN CSE & IT

26 06BCE302 Programming Langauage Processors 2 1 3

Aim & Objectives:

1. E. Horowitz, S. Sahni and S. Rajesekar, “Computer Algorithms”, Galgotia-1999.

Synthesis of Nano Materials

1. Michel Kohler, Wolfgang Fritzche “Nanotechnology – An Introduction to Nanostructuring techniques” ,

Introduction to Fundamentals concepts: Object oriented fundamentals- Structured versus object-oriented

Overloading: Overloading-Function overloading, operator overloading- overloadable operators, unary operator

1. Program illustrating function overloading feature.

Statistical Parameters: Mathematical Expectation- Variance- Moment Generating Function-Characteristic

ANOVA: One way and Two way classifications- CRD-RBD-LSD.

Introduction to Computer Ethics

Ethical Issues and Ethical Decision

Solving Ethical Dilemmas

Ethics Codes and Polices

Communication and Personal Skill

Working In Groups and Making Effective Presentations

Spectral analysis and random process

Analog modulation systems

Base band data communication

Spread spectrum and error correction techniques

Architectural Design: System structuring, Control models, Modular decomposition, Domain-specific

1. Ian Sommerville, "Software Engineering", Addison-Wesley, 2004

1. Roger S. Pressman, "Software Engineering", McGraw Hill, 2004.

5. Write an ALP to convert given hexadecimal number to binary using 8086 MP

9. Write an ALP to reverse the given string

10. Write an ALP to generate the following series 1+1/x+1/x3+1/x5+ ……..

11. Write an ALP to generate square wave using 8255 PPI

12. Write an ALP to generate rate generator using 8253 PIT

15. Write an ALP to interface analog to digital converter.

1. a) Create a table EMP with the following fields.

b) Insert 5 records into EMP

2. Create a table EMP with the above mentioned fields.

3. Create a table ORDER with the following fields and constraints.

Column Name Constraint Name Constraint Type

8. I) Using EMP table find the employee getting maximum salary

9. Create a table DEPT with the following fields

Modify EMP table adding a foreign key constraint on DeptNo.

i) Insert 6 records into Dept.

11. Using EMP and DEPT

1. Create a cursor to update the salary of employees in EMP table

Mathematical Logic: Introduction -Statements and Notation - Connectives - Tautologies - Equivalence -

1. Richard Johnsonbaugh, “Discrete Mathematics”, 5th Edition, Pearson Education, 2001.

Aim: To introduce the concepts of internet programming technologies.

Common Gateway Interface (CGI)

Interfaces, Packages, multithreading and Exceptions

Applet programming and Files

Networking and Servlets

Introduction: Nature of computing, Elements of Computers, Limitations of Computers - the evolution of

1. A. Leon-Garcia, Indra Widjaja, "Communication Networks", Tata McGraw Hill, 2000