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
(Board of studies – 25th Feb 2006)

VELLORE INSTITUTE OF TECHNOLOGY DEEMED UNIVERSITY

INDEX

Sl.no Sub-code SEMESTER- III 1. 05BCE201 2. 05BCE203 3. 05BCE205 4. 05BCE207 5. 05BCE209 6. 05BCE211 7. 05BCE213L 8. 05BCE215L SEMESTER – IV 9. 05BCE202 10. 05BCE204 11. 05BCE206 12. 05BCE208 13. 05BCE 210 14. 05BCE 212 15. 05BCE 214L SEMESTER – V 17. 05BCE 301 18. 05BCE 303 19. 05BCE 305 20. 05BCE 307 21. 05BCE 309 22. 05BCE 311 23. 05BCE 313L 24. 05BCE 315L 25. SEMESTER – VI 26 05BCE 302 27. 05BCE 304 28. 05BCE 306 29. 05BCE 308 30. 05BCE 310 32. 05BCE 314L 33. 05BCE 316L 34. 35. SEMESTER – VII 36. 05BCE 401

Subject Complex Variables and Partial Differential Equations* Data Structures and Algorithms* Electronic Devices & Circuits* Introduction to Nano Technology Digital Computer Fundamentals * Object Oriented Programming * Object Oriented Programming Lab Electronic Devices Lab Probability, Statistics and Reliability * Computer Profession and Society * Microprocessor & Interfacing Techniques * Principles of Computation * Software Engineering * Data base Management System* Microprocessor And Interfacing Lab Discrete Mathematical Structures* Internet Programming Computer Architecture And Organisation* Computer and Communication Networks Theory of Computation* Soft Computing Net working Lab Internet Programming Lab Project ELECTIVE - I Programming Language Processors Object Oriented Analysis and Design Linux System Programming Operating Systems* Graph Theory And its Application Linux System Programming Lab Operating System Lab Inplant Training Project Peripherals Interfacing and Trouble Shooting
2

L T P 2 3 3 3 3 2 1 0 0 0 0 1 2 2 2 3 3 3 2 3 2 2 3 3 3 3 1 0 0 0 1 0 2 1 1 0 0 0 0 2 2

IPT

Proj

C 3 3 3 3 3 3 2 2 3 3 3 3 3 3 2 3 3 3 3 3 3 2 2 2 3 3 3 3 3 3 2 2 2 4 3

Pg.no 15 17 18 19 20 21 22 23 24 25 27 28 29 30 31 34 35 36 37 38 39 40 41

2 2 2 3 2 3 2 1 1 0 1 0 1 2 2 2 4 2 1

42 43 44 45 46 47 48

49

B.Tech. (Computer Science and Engineering) - Syllabus
(Board of studies – 25th Feb 2006)

37. 38. 40. 41.

05BCE 403 05BCE 405

42. 05BCE 413L 43. 05BCE 415L 45. Project SEMESTER – VIII 46. 05BCE 402 ELECTIVE – I 05BCE E 02 05BCE E 04 05BCE E 06 05BCE E 08 05BCE E 10 05BCE E 12 05BCE E 14

Embedded Systems Network Security ELECTIVE – II (FREE ELECTIVES) ELECTIVE – III (SCHOOL SPECIFIC ELECTIVES) Peripherals Interfacing Lab Embedded Systems Lab Project Resource Management Real Time Systems Distributed Data Base Systems Soft Computing Internet Working & Technologies Basic Bio-Informatics Distributed Computing

3 3 3 3

0 0 0 0 2 2 6

3 3 3 3

50 51

52 53 6 28 37 38 39 40 40 41 42 54 55 56 57 58 59 60 61 62 63 64 66 67 68 69 70 71

ELECTIVE – II (FREE ELECTIVES) 05BCE E01 Computer Simulation & Modelling 05BCE E03 Distributed Computing 05BCE E05 Distributed Database System 05BCE E07 Data warehousing and data mining 05BCE E09 Mobile Communication** 05BCE E11 Web Services ELECTIVE – III (SCHOOL SPECIFIC ELECTIVES) 05BCE E15 Pattern Recognition 05BCE E17 Client Server Technology 05BCE E21 Web Commerce 05BCE E23 Data Compression Techniques 05BCE E25 Software Practice and Testing 05BCE E27 Computer Graphics 05BCE E29 ROBOTICS 05BCE E31 Neural Networks 05BCE E33 Operation Research 05BCE E35 Digital Signal Processing 05BCE E37 Decision Support System** * COMMON BETWEEN CSE & IT ** SCHOOL SPECIFIC ELECTIVES ***FREE ELECTIVES

3

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

Proj Credits 3 3 3 3 3 3 2 2 2 4 28 SEVENTH SEMESTER: S.Syllabus (Board of studies – 25th Feb 2006) SIXTH SEMESTER: S.B.No Sub Code . Peripherals Interfacing and Trouble 35 06BCE 401 Shooting 36 06BCE 403 Embedded Systems 37 06BCE 405 Network Security ELECTIVE – II (FREE 38 ELECTIVES) ELECTIVE – III (SCHOOL 58 SPECIFIC ELECTIVES) 59 06BCE 413 L Peripherals Interfacing Lab 60 06BCE 415 L Embedded Systems Lab 61 Project Total * * SCHOOL SPECIFIC ELECTIVES EIGHTH SEMESTER: S. 26 27 28 29 30 31 32 33 34 06BCE302 06BCE 304 06BCE 306 06BCE 308 06BCE 310 06BCE 312 06BCE 314 L 06BCE 316 L Subject Lec Programming Langauage Processors Object Oriented Analysis and Design Linux System Programming Operating Systems* Graph Theory And its Application Elective . Sub Code Subject No . (Computer Science and Engineering) .No 63 Sub Code 06BCE 402 Project TOTAL Subject Lec 2 2 2 2 Periods/Week Pra Com Tut 1 1 1 1 2 2 2 Proj Credits 3 3 3 3 2 2 2 6 30 12 6 4 2 6 6 Periods/Week Lec Tut Pra Credits 28 28 5 .Tech.I Linux System Programming Lab Operating System Lab Inplant Training Project Total 2 3 2 3 2 3 Periods / Week Tut 1 0 1 0 1 0 2 2 12 6 4 2 4 6 Pra Inp.

Cylindrical and Spherical coordinates – variable separable method: Potential flow over a sphere.w= ez). the Cauchy.Tech. Indented contour integral. . Cauchy – Riemann equations.D’Alembert’s solution for the initial value problem. Cauchy’s Residue theorem – Evaluation of integrals by the method of residues. 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. branch cuts. Branch points. Z-transform – definition – relation between Z – transform and Laplace transform. the students are expected to develop the necessary mathematical skills. Integral Transforms. Analytic and Harmonic functions – Complex potential – Applications to flow around a corner and around a cylinder.transform method.B.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. Wave Equation-Vibrations of a Stretched string-Variable Separable Method.Syllabus (Board of studies – 25th Feb 2006) L 06BCE 201 Aim & Objectives: COMPLEX VARIABLES AND PARTIAL DIFFERNTIAL EQUATIONS * 2 T 1 P 0 C 3 The aim of this course is to present a comprehensive. particular integral – method of undetermined co-efficient. application to ladder type electrical network. 6 .Inverse Z-transforms – partial fraction expansion method. Bilinear transformation. Fourier and z. w = z2 . Functions of a Complex Variable: Functions of a complex variable. limits and continuity. Applications of Partial Differential Equations : Solution of Laplace equations in Cartesian. Partial Differential Equations: Introduction – Formation of PDEs – Solution of PDE – General. Complex Integration: Integration in the complex plane along a contour. Exponential Fourier series – Fourier Integral Transforms – Definition – Fourier Integral – Fourier sine and cosine transforms. Z-transform of elementary functions. 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. properties of Z-transforms (proofs not required) Initial and final value theorems. Inversion contour method-solution of difference equations by Z. (Computer Science and Engineering) . physical understanding of problems and intuition to independently analyze the mathematical equations which model the problems in their respective fields of study. 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. Difference Equations & Z-transforms: Difference equations with constant coefficientsComplementary function.transforms.Goursat theorem. integral theorem – Derivatives of analytic functions. Inversion contours for Laplace. By the end of the course. Jordan’s lemma (without proof). Taylor and Laurent series(without proof's) singularities – zeros – Poles. variation of parameters technique (without proof). Vibrations of a circular membrane Diffusion equation in Cartesian and Cylindrical coordinates. Residues. concept of conformal transformation – Qualitative discussion on applications. linear transformations (w = zA+B.

“Fourier series and Boundary value problems”. Erwin Kreyzsizig. Peter V. “Advanced Engineering Mathematics”. Ian Sneddon. Brown. W. International student edition (1978). 2. W. Greenberg. MichaelD. V. John Wilag & Sons (Wiley student Edison). 4.B. 2. 2005. Khanna Publications. B. Pearson Education (2002). 3. 2004. (Computer Science and Engineering) . R. 7th Edition..V. 7 . “Advanced Engineering Mathematics”. 5th Edition. John Wiley & Sons (2000). “Complex variables and application”. Churchill. J. Grewal. Brown and R. McGraw Hill International ed. 8th Edition. 5. 38th Edition. Churchill and J. 2004. “Elements of Partial Differential equations”. McGraw – Hill International edition (1985). 2nd Edition. “Higher Engineering Mathematics”. REFERENCE BOOKS: 1. S.Syllabus (Board of studies – 25th Feb 2006) TEXT BOOKS: 1.Tech. “Advanced Engineering Mathematics”. O’ Neil.

S. Back Tracking. Overview of Garbage collection & Compaction Trees: Preliminaries – implementations of trees – tree traversals (inorder. “Data Structures & Algorithm Analysis in C++”. Queue: ADT – queue model – array implementation of queues. Dynamic Programming. bucket sort. List: ADT – simple array implementation of lists – linked lists– doubly and circular linked lists – cursor implementation of linked lists – polynomial addition and multiplication.Basic concepts of NP-hard and NP-complete. Greedy Method. depth first search and breadth first search – shortest path algorithm.B. Addison Wesley. merge sort and its analysis. external sort. 1991. REFERENCE BOOKS: 1. The students would be able to implement various data structures and apply operations on them and also implement various sorting and searching techniques. prefix and postfix expressions and their conversions. Objectives: To make the Students learn various types of data structures and algorithm analysis. Sorting Techniques: Insertion sort and its analysis. Algorithm Design Techniques: Divide and Conquer Algorithm – Strassen’s matrix multiplication and its analysis. E.traveling salesman problem – algebraic manipulations. quick sort and its analysis. G.8 queens problem. Lower Bound Theory. It covers algorithm analysis for the run time complexities and the space requirements. Shell sort.knapsack 0/1.Syllabus (Board of studies – 25th Feb 2006) 06BCE 203 DATA STRUCTURES AND ALGORITHMS * L 3 T 0 P C 3 Aim: This subject aims to impart knowledge about various types of data structures (standard and user defined). Jean-Paul Tremblay and Paul. postorder) – binary trees – implementation – expression trees – binary search trees – threaded binary trees – B_tree – B+trees – hashing – hash function. preorder. Heap sort and its analysis.traveling salesman problem. Branch and Bound. Horowitz. Rajesekar. 2. Algorithm Analysis: Mathematical background model – running time calculations – complexity analysis – Abstract Data Types (ADT) – asymptotic notations. Galgotia-1999. TEXT BOOK: 1. Mark Allen Weiss. “An Introduction to Data Structures with Applications”. Queues & Lists: Stack: ADT – stack model – implementation of stacks – applications of stacks– infix. (Computer Science and Engineering) . 2004. Stacks. selection sort. Sorenson. Sahni and S. “Computer Algorithms”. 8 .Tech. Tata McGraw Hill.

Khanna Publishers. Photo Electric Devices: Photo emissivity . J. IC voltage regulators – protection circuits for DC power supplies – switched mode power supplies. New Delhi. D. RC section filters – Voltage regulators – current regulators. 1997. clipper and clamper circuits. 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. Millman. Objective: The students would become aware of the range of devices with respect to frequency.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. inductor. 1998. “Electronic Devices and Applications of Integrated Circuits”.Syllabus (Board of studies – 25th Feb 2006) 06BCE 205 ELECTRONIC DEVICES AND CIRCUITS * L 3 T 0 P C 3 Aim: The subject aims to introduce most of the basic electronic devices and discuss about the functioning.R. TRIAC and DIAC. Streetman.Kulshreshtha and P. 1999. Chanda.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. S. temperature. L section. Bipolar Junction Transistor: Principle of transistor action – current components – cutoff.C. Junction Diodes.G. CB. TEXT BOOK: 1. Mithal.P. power ratings etc. (Computer Science and Engineering) . active and saturation region – input and output characteristics – CE. 2001.C. 3. fabrication and characteristics of four layer devices such as SCR. & CC Configurations – small signal and large signal beta – transistor breakdown ratings – Thermal runaway problems – Use of Heat sinks. Mathur. “Electronic Devices & Circuits”.photo electric theory . Electronic Circuits: Half – wave and full – wave rectifier circuits – performance characteristics of rectifier circuits – filter consideration capacitor. Ben.B. “Electronic Devices and Integrated Circuits”. Prentice Hall of India. REFERENCE BOOKS: 1. The students will understand the constructional features and characteristics of various electronic devices and circuits. McGraw Hill. G.K. 9 . application and selection of appropriate devices to achieve a particular circuit function. C. Semiconductor Basics: Review of extrinsic semiconductor – drift and diffusion currents – thermal generation of minority carriers – Hall Effect. “Solid state electronic devices”. 2.Tech. Halkias.

Nanosensors as Optical Actuators – Magnetic Nanotransducers – Chemical Nanoscale Sensors and Actuators. 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. Michel Kohler.Nanostructures as Optical Sensors.Syllabus (Board of studies – 25th Feb 2006) L 06BCE207 INTRODUCTION TO NANO TECHNOLOGY 2 T 1 P C 3 Aim: The subject covers the basic principles behind 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 . Linda S.Schadler. (Computer Science and Engineering) .Tech. Wolfgang Fritzche “Nanotechnology – An Introduction to Nanostructuring techniques” .from Micro to Nanostructures – Definition of Nanostructures – Insight into the Nanoworld Building Blocks of Nanotechnology – Interactions and Topology – The Microscopic Environment of the Nanoworld. “Nanocomposite Science”. Text/Reference Books: 1. WILEY –VCH publications 2. Pulickel M Ajayan. 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.Atomic beam Lithography – Nanofield Generation by Optical Nearfield Probes. their Characterization and their potential applications in various fields Objective: The students would become aware of various fabrication principles behind nanostructure preparation.B. what characterizations of nanostructures can be measured and in which domains in can be applied. Introduction The Nanoworld . 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. WILEY –VCH publications 10 . Paul U Braun.

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. understand the memory representation in ROM. McGraw Hill 1999. Codes. Boolean algebra. "Computer Architecture Logic Design". Malvino and D. 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. 2. Mano. 11 . 2001 REFERENCE BOOKS: 1. Computer Design: Computer configuration – instructions and data formats instruction sets timing and control execution of instruction – design of computer. Tata McGraw Hill 1997. Bartee. P. Floating point representation.status register effect of O/P carry – design of shifter – processor unit – design of accumulator. Morris M. (Computer Science and Engineering) . "Digital Design".B. TEXT BOOK: 1. Objectives: The students shall be able to understand Boolean laws. “Digital Principles and Applications”. Prentice Hall India. Basic laws. Thomas C. error detection – reflection – alphanumeric codes.Binary decimal. shift register and designing a simple computer which is capable of providing few arithmetic and logical operations. design steps involved in flipflop. 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. 4th edition. RAM and CPU. P. Leach. Third Edition.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. A. Sequential Logic Design. Processor Organization: Memory unit – inter register transfer – micro operations bus organization scratch pad memory – ALU – design of ALU .Syllabus (Board of studies – 25th Feb 2006) 06BCE 209 DIGITAL COMPUTER FUNDAMENTALS* L 3 T 0 P C 3 Aim: The subject aims to impart the knowledge about digital logic fundamentals. Control Logic Design: Control organization – PLA control – microprogram control hardwired control microprogram sequencer – microprogrammed CPU organization. arithmetic and Logic unit.Tech. logic gate fundamentals. Boolean logic. function of flip-flop and shift register.

Tata McGraw Hill. encapsulation. polymorphism. TEXT BOOK: 1. "Mastering C++”. evolution of c++ as a object oriented programming language with focus on generic programming with templates and Exception Handling. 2. inline functions. Introduction to Fundamentals concepts: Object oriented fundamentals. E. 1988. destructors in derived class. Exception handling-exception handling model. Overloading: Overloading-Function overloading. (Computer Science and Engineering) . class templates. exception handling constructs. empty classes.overloadable operators. friend classes and friend functions. defining member functions. operator overloading. elements of object oriented programming. derived class declaration. abstract classes. inheritance and member accessibility. catching exceptions. benefits of OOP. K. class member accessibility.Venugopal.Syllabus (Board of studies – 25th Feb 2006) L 06BCE 211 OBJECT ORIENTED PROGRAMMING * 2 T 1 P C 3 Aim: The subject aims to introduce the salient features of Object Oriented Programming. arithmetic operators. templates using c++ as language. Generic programming with templatesFunction templates. unary operator overloading. data conversion.Ravishankar. 1997 REFERENCE BOOKS: 1. operator keyword. “The C++ programming Language”. data hiding. Tata McGraw Hill. polymorphism.B. file pointers and their manipulation. ASCII and binary files. 2004.Balagurusamy. class objects. parameterized constructors.Structured versus object-oriented development.Classes and Objects. T. 3rd edition. and abstraction and its importance. sequential access to a file. new. Exception handling and Files: Files and Streams-Opening and Closing a file. accessing member functions within class. copy constructor. virtual functions. constructors in derived class. Classes and Objects: Working with classes. random access to a file. lists of exceptions. comparison operators. constructors. Addison Wesley. fundamentals of OO-class.Tech. binary operator overloading. Objectives: Students will be able to know the fundamentals of object oriented programming and incorporate OOPs’ features such as inheritance. Inheritance: Inheritance.Class specification. “this” pointer. “Object Oriented Programming with C++”. file modes. 12 . error handling during file manipulations. limitations of increment/decrement operators.Base class and derived class relationship. accessing class members. 2nd Edition. concatenation of strings. virtual base classes. and Rajkumar. structure of C++ program. constructor overloading. handling exceptions. object. Forms of inheritance.R. delete operators. Bjarne stroustrup. constructor invocation and data member initialization.

Searching: a. Write a program which illustrates the use of virtual base class. 5. Binary search Insertion sort Merge sort Quick sort Selection sort Heap sort Shell sort 13 . 8. Science. c. 10. Implementing Stacks and queues. constructor with arguments. constructor. Linear search b. b. (Computer Science and Engineering) . Program illustrating function overloading feature.B. Single. 9. copy constructor etc). multilevel. from students class. 7. Sorting: a. 2. 4. d. Programs illustrating the use of following functions : a) Friend functions b) Inline functions c) Static Member functions d) Functions with default arguments. Write Program illustrating File Handling operations Ex. New and delete operators etc. Programs illustrating the overloading of various operators Ex: Binary operators. Implementation and processing in lists. a) Copying a text files b) Displaying the contents of the file etc. 4. Create their objects and process them. 3. 3. f. Unary operators. hierarchical inheritance etc. e. Write a program illustrating the use of virtual functions. 2. Medical.Syllabus (Board of studies – 25th Feb 2006) 06BCE 213L L OBJECT ORIENTED PROGRAMMING LAB (Implementation of OOPS AND Data Structures Concepts) T P 2 C 2 1. Write a program having student as an abstract class and create many derived classes such as Engg. Programs illustrating the various forms of inheritance : Ex. overflow and underflow in stack etc) Data Structure: 1. 6. etc. Programs illustrating the use of destructor and the various types of constructors (no arguments.Tech. Multiple. Write programs illustrating how exceptions are handled (ex: division-by-zero.

Implementation and testing of Multiplexers. 11. 8.Tech. 7. 10. 3. ELECTRONIC DEVICES LAB T P 2 C 2 Input and output characteristics of BJT (CE CB CC) and graphical determination of h-parameters. (Computer Science and Engineering) . 12. Implementation and. Study of CRO and measurement of amplitude frequency time period and phase angle. Forward and reverse characteristics of PN junction diode. 16. Implementation of shift registers using flip-flops. 18. Design and testing of Half and Full subtractor. 2. 6. 17. Drain and transfer characteristics of JFET and graphical determination of transconductance. Study of decade counter using flip-flops. V-I characteristics of tunnel diode and varactor diode. 4. 13. Study of Flip flops (D T JK SR flip-flops). Design and testing of Half and Full adders. Implementation and testing of 3 bit binary ripple counter.B. 14 . Static emitter characteristics of UJT and PUT. 5. 14.Syllabus (Board of studies – 25th Feb 2006) L 06BCE 215L LIST OF EXPERIMENTS: 1. Characteristics of Zener diode and study of its power ratings. testing of code converters. V-I characteristics of SCR and TRIAC. 9. 15. Study of Logic Gates (AND OR NAND NOT EXOR gates). Switching characteristics of BJT SCR and MOSFET.

Independent EventsRandom Variables-Distribution Function-Density Function (PDF). 2003.Reliability Allocation Maintainability and Availability.x -chart. Weibull distributions. “An introduction to Probability and Statistics”.H. Normal. “Mathematical Statistics”. 5.np-chart.Variance.Pure Birth and Death Models. New Age International Pvt. 1998. Probability and Random Variables: Axioms.Syllabus (Board of studies – 25th Feb 2006) 06BCE 202 PROBABILITY.L. J. R.Independent Random Variables.. Probability and Statistics. 2002. Rohatgi. R. Thomson. Statistical Quality Control: Control Charts . “Modern Probability Theory”.Baye's Theorem.Little's formula . 2002. 3rd Edison.R-chart.B.Random Vector-Joint Distribution..Joint Density. Exponential.Binomial. Addison-Wesley. TEXT BOOK: 1.theory of estimation. 4. B. Pearson Education. Queuing Theory: Preliminary Ideas (Markov Chains) . Morris H. 1999. Poisson. JE. Gamma. New Delhi. 7th Edition.Control Charts for Attributes.Procedure of Testing Hypothesis.Tech. Md. Statistical Parameters: Mathematical Expectation.small sample tests Student’s t-distribution . 3rd Edition..System Reliability . 5th Edition. V. 2000.Chi-square test. Bhat. and Ebsanes Saleh.Myers.Walpole.Conditional Probability.p-chart.Partial and Multiple correlations. A. students will • Have an understanding of the Probability concepts.Ye.c-chart Reliability: Terms related to Reliability.Control Charts for Measurements . STATISTICS AND RELIABILITY * L 2 T 1 P 0 C 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. Freund. John Wiley & Sons. By the end of the course. Inc. ANOVA: One way and Two way classifications..Conditional Distribution and Density Functions. Probability and Statistics. New York. Prentice Hall International.Hazard Models.Exponential Distribution.R.K.Myers and K. “Probability and statistics for Engineers and Scientists”.L.Moment Generating Function-Characteristic Function-Regression and Correlation. 15 .K. REFERENCE BOOKS: 1.Devore. S. 2nd Ed.CRD-RBD-LSD. 3.F-test . 2. Ltd. Tests of Statistical Hypothesis: Large sample Tests . 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. • 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. (Computer Science and Engineering) . DeGroot.E.

and communication skills and also provide knowledge on working with groups and presentation. An Internet Use Policy. Ethics and Information Technology – New Technologies.Syllabus (Board of studies – 25th Feb 2006) 06BCE204 COMPUTER PROFESSION AND SOCIETY L 3 T 0 P C 3 Aim: Describes about the ethics. Gathering ideas and material. Solving Ethical Dilemmas A Sample Case Exercise-A Four-Step Analysis Process. Organizing your Ideas. Types of Groups and teams. Working In Groups and Making Effective Presentations Working in Groups: Working in Teams – Characteristics of Groups and Teams.Prentice Hall . Organizational Culture. Deborah. Select Cases• Abort.The importance of Communication. Computers and Privacy. Verbal support. Question and Answer Sessions. (Computer Science and Engineering) . Speaking with confidence.2002 2. Communication and Personal Skill Communicating at work. Adding transitions. Analyzing the situation.P. Culture.B. Reasons for listening. Responsibility and Liability. The types of ethical choices.The importance of clear organization.“Computer Ethics” . . Retry. John. Approaches to listening. Guidelines for delivery. Introduction to Computer Ethics What is computer ethics? Philosophical Ethics. Ernest A Kallman. • Trouble in Sardonia: Do Copyright Ethics Change Overseas? Ethics Codes and Polices The need for Codes and Polices. Problem-Solving Communication. Abuse. choosing the optimal communication channel. Making defensible decisions. Professional Ethics.1999. Developing the Thesis. Managing. Objectives: After completion the students will be able to work in groups and will be capable of presenting their ideas. Ethics and Ethical Decision Making – Why we should care about Ethics. Conflict.G. Organizing the Body. Negotiating skills. Communication. Verbal and Visual Support in Presentations – Functions of supporting material. Ronald B. Planning the introduction. Dealing with criticism. Ethics. Grillo . The nature of Communication. decision. Nonverbal Communication. Barriers to effective listening. 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. McGraw Hill 2nd Edition . Sample Case-Too much of a good thing? Discovering an Ethical Dilemma. Interpersonal Skills. Developing the Presentations. Using the Four-Step process. 3. Making Effective Presentations: Developing the Presentation-Establishing a purpose. Sexual harassment.Adler . Listening – The Importance of Listening. Verbal and Nonverbal Messages – Verbal messages. Computer Ethics and Regular Ethics. planning the conclusions.“Communicating a work” .Building Positive relationships.McGraw Hill .2nd Edition . An Email Privacy Policy. 16 . Crime. Using communication networks. New Problems. TEXT BOOKS 1. Value judgments.Types of Delivery. and WorkCultural Diversity and Communication.“Ethical Decision making and Information Technology”.Jeanne Marguardt Elmhorst .6th Edition .Johnson. Leadership and Influence in groups and teams.Tech. The Social Implication of Computers: Autonomy and Access. Visual Aids. Competing Factors that affect our behavior. Why is Ethical Computer Use a Special Challenge? What is Unethical computer use? Ethical Issues and Ethical Decision Property rights in Computer Software. Effective Communication in groups and teams.1996. and Hacker.

Ethics.Wesley . Deborah.“How to communicate Technical Information” . Jonathan Price.1995. (Computer Science and Engineering) . and Social Values” .1993. Helen Nissenbaum (eds) .Syllabus (Board of studies – 25th Feb 2006) REFERENCE BOOKS 1. 17 .Johnson. Kenry Korman.Addison.B.Tech. 2.“Computers..G.Prentice Hall .

80286 Processor: Features of 80286. Pin configuration. 8086 in min/max mode. 80286. Pentium – I. Interface peripherals with 8086 serial and parallel I/O (8251 A & 8255). PIT (8253). Tata McGraw Hill. 1999. protection. 80386 and 80486 Processor: Features of 80386Dx. register organization of 80486. Programmable DMA controller 8257. Programmable interval timer 8253. 8086 architecture. Assembly language programming. “Microprocessor Architecture Programming and Applications with 8085”. Peripherals & Interfacing With 8086: Serial & parallel I/O (8251A and 8255). Keyboard and display controller(8279). operation and Memory management . 386. addressing modes. processors. IV and Microcontrollers 8051. features of 80486. A. Goankar. Addressing modes. 2. fetch cycles of 80286. operation. peripheral devices. 18 . 2000. ADC / DAC interfacing.K. register organization of 80386Dx. (Computer Science and Engineering) . Pentium – IV. real addressing mode. internal architecture of 80286. internal architecture of 80386Dx.M. Advance In Microprocessors: Features of Pentium processor. Instruction set and aspects of assembly language programming. III. “Microprocessors and Interfacing Programming and Hardware”. First Edition.B. TEXT BOOK: 1. “Advanced Microprocessors and Peripherals”. Bhurchandi. programmable Interrupt controller (8259). programmable interrupt controller 8259A.the 80286 processor features. virtual addressing mode. basic bus operation of 80286. Assembler directives.Syllabus (Board of studies – 25th Feb 2006) 06BCE 206 MICROPROCESSOR & INTERFACING TECHNIQUES * L 3 T 0 P C 3 Aim: The subject aims to introduce various features of 8086. pin configuration of 80386. Pentium. Tata McGraw Hill. II. Keyboard and display controller 8279. REFERENCE BOOKS: 1. Pentium – III. Hall. Introduction to microcontroller 8051.the 80386 and 80486 processor features. Pentium – II. addressing modes. 2000. Ray and K. architecture of 8051. the advances in processors – overview of Pentium – I. Douglas V. Register set of 8051. programmable DMA controller(8257). Introduction to 8086 Processor: 8086 Processor-Introduction. Objectives: The student shall be able to understand 8086 processor design and basic operations. Instruction set of 8086. Wiley Eastern.Tech. privilege.

Tech. Digital modulation Digital modulation – coherent binary modulation techniques – coherent quadrature modulation techniques – noncoherent 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. “Principles of Communication”. McGraw Hill. Analog modulation systems Basic principles of Amplitude Modulation (AM).P. Carlson. B. 1992 19 . A. DM.B. 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.B. 1992 3. Simon Haykins. 1990 REFERENCE BOOKS: 1. 1990 2. PHI. McGraw Hill.Syllabus (Board of studies – 25th Feb 2006) 05BCE208 PRINCIPLES OF COMMUNICATION L 2 T 1 P C 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. PHI. “Analog and Digital Communication Systems”. base band pulse shaping – binary data formats – base band transmission – Intersymbol Interference (ISI) – correlative coding – optimum SNR – matched filter detection. TEXT BOOKS: 1. 1992 2. Proakis. (Computer Science and Engineering) . FM & PM systems performance – threshold effects reduction Base band data communication Sampling & quantization – PCM. “Communication Systems”. “Principles of Communication”.Lathi. ADM. Frequency Modulation (FM) & Phase Modulation (PM) – spectra – power consideration – receiver’s characteristics and deduction of AM. and basic band pass digital communication systems. Taub & Schilling. ADPCM. “Digital Communication”. Tata McGraw Hill Publication. Amplitude modulation and demodulation techniques.

Software Evolution. Requirements Engineering Processes: Feasibility studies. Automated static analysis. Design with Reuse.Context. Over view of CASE tools. Critical systems validation. Software process models. Project scheduling. Design patterns. User interface design . Objectives: The students would be able to analyze software requirements. Process iteration. Overview of design for Distributed systems. System requirements. Project management activities. (Computer Science and Engineering) . Formal Specification. Software design and implementation. Overview of Legacy Systems. version and release. McGraw Hill. Rapid prototyping techniques.Tech.Planning. and System Development. Roger S. Reliability validation. Project duration and staffing. User requirements. Risk management. Critical Systems: Overview of Dependability. ISO 9000 and Six Sigma. Pressman. Software cost estimation. Information presentation. Configuration managementplanning and managing change. Requirements elicitation and analysis. Cleanroom software development. Domain-specific architectures. 20 . Software Specification. Software Engineering Fundamentals: The system engineering process. Control models. 2004 REFERENCE BOOK: 1. System Models. User interaction. Ian Sommerville. Software validation. Industry Standards: Overview of Managing software people.Formal methods and critical systems. Behavioral specification Architectural Design: System structuring.Prototyping in the software process.B. TEXT BOOK: 1. Behavioral. Software inspections. Integration testing.Syllabus (Board of studies – 25th Feb 2006) 06BCE 210 SOFTWARE ENGINEERING * L 3 T 0 P C 3 Aim: The subject aims to impart sound knowledge to design and implement an efficient software system and manage the resources. Addison-Wesley. Security assessment. Requirements management. Overview of Quality management & Process Improvement. use the testing tools and methods. CASE workbenches. Data and Object models. Application families. Requirements validation.User interface design principles. Object-oriented testing.Component-based development. Object-oriented and Real-time software. Safety assurance. develop an efficient software system through group cohesiveness. Software requirementsFunctional and non-functional requirements. Modular decomposition.Defect testing. Overview of SEI-CMM. Verification and validation. "Software Engineering".Project planning. User interface prototyping. Software prototyping. Software testing. 2004. Software change & re-engineering. Estimation techniques. Algorithmic cost modeling. System Specification.Formal specification in the software process.Productivity. Interface specification. software requirements document. User support. Interface evaluation. "Software Engineering".

system implementation techniques. shadow paging. and the relational algebra – SQL – the relational database standard – ER to relational mapping and other relational languages – Oracle Architectures.. discretionary access control based on granting and revoking of privileges. Database design theory and methodology: Functional dependencies and normalization for relational databases – relational database design algorithms and further dependencies – practical database design and tuning. arise algorithm. basic algorithms for executing query operations. Database security and authorization. Elmasri & Navathe – “Fundamentals of Database Systems”. tune. and some other concurrency control issues Database recovery techniques. database backup and recovery from catastrophic failures. Other primary file Organizations – Index structures for files. System Implementation Techniques: Database system architectures and the system catalog – query processingTranslating queries to relational algebra.Recovery concepts. Replication.Introduction to database security issues. Federated systems. TEXT BOOK: 1. PL/SQL. 1997. maintain a database application and advance database concepts.F. Tata McGraw Hill. (Computer Science and Engineering) . 2000 REFERENCE BOOK: 1. relational constraints.Codd Rules Relational model. implement.E.B. Korth and Silberschatz. active databases. database modeling and design. concurrency techniques. using heuristics in query optimization – transaction-processing concepts. Objectives: The students shall be able to understand fundamental concepts of database management system. 21 . time stamp ordering. Concurrency control techniques: Locking techniques. 3rd ed. using locks for concurrency control in indexes. Recover techniques based on deferred update and immediate update. Hashing Techniques. languages & systems: The relational data model. SQL. Basic concepts: Data bases and databases users – database system concepts and architecture – data modeling using Entity Relationship model – Files of Unordered & Ordered Records. They will be able to analyze and design ER model for a customized application and distributed databases. Data Fragmentation.Tech.Syllabus (Board of studies – 25th Feb 2006) 06BCE 212 DATA BASE MANAGEMENT SYSTEM * L 3 T 0 P C 3 Aim: The subject aims to introduce techniques to design. Addison Wesley. “Data Base System Concepts”. and allocation techniques. Distributed Database: Introduction and Concepts.

B.Tech. (Computer Science and Engineering) - Syllabus
(Board of studies – 25th Feb 2006)

L 06BCE 214L MICROPROCESSOR AND INTERFACING LAB 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.

T

P 2

C 2

22

B.Tech. (Computer Science and Engineering) - Syllabus
(Board of studies – 25th Feb 2006)

L 06BCE 313L DATABASE MANAGEMENT SYSTEMS LAB * 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 Order-no Item-name Qty Rate-unit Constraint Name pk-order-no itn ck-aty (25<QTY<50) Nn-rate Constraint Type PRIMARY KEY UNIQUE CHECK NOT NULL

T

P 2

C 2

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

B.Tech. (Computer Science and Engineering) - Syllabus
(Board of studies – 25th Feb 2006)

Modify EMP table adding a foreign key constraint on DeptNo. i) ii) Insert 6 records into Dept. 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

TEXT BOOK: 1. V. 5.Ch. graph theory in network models and lattices & Boolean algebra in Boolean functions.Functions. 2002.Recursion Algebraic Structures: Semigroups and Monoids .Relations and Ordering. “Discrete Mathematics”. 4.Liu.Principal Disjunctive Norm Forms . Lipschutz and M.Tautologies .Chandrasekaran.Syllabus (Board of studies – 25th Feb 2006) 06BCE 301 DISCRETE MATHEMATICAL STRUCTURES * L 2 T 1 P C 3 Aim and Objective: The aim of this course is to motivate the students to address the challenge of the relevance of inference theory. S. the students are expected to use inference theory in circuit models. REFERENCE BOOKS: 1.C.Grammars and Languages. “Elements of Discrete Mathematics”.Connectives .M. 2002. PHI. Algebraic structures and graph theory to computer science and engineering problems. 25 .L. “Discrete Mathematics”. N. K. “Discrete Mathematical structures”. 2003. B. 4th Edition. R.Busby and S. J. 3. 2001.Polish Expressions and their Compilation . 2nd Edition. Set Theory: Basic Concepts of Set Theory.Venkatesh and P.Matrix Representation of Graphs . Graph Theory: Basic Concepts of Graph Theory . 2.Inference Theory of the Predicate Calculus.C.S. Tata McGraw Hill – 13th reprint.Equivalence Implications .N.. Inference Theory: The Theory of Inference for the Statement Calculus -The Predicate Calculus . By the end of the course. 2001. “Discrete Mathematical Structures with Applications to Computer Science”.Boolean Functions Representation and Minimization of Boolean Functions. (Computer Science and Engineering) . Lattices and Boolean algebra: Lattices as Partially Ordered Sets .Boolean algebra . Pearson Education. Mathematical Logic: Introduction -Statements and Notation .B. Tata McGraw Hill. Lipson.Manohar.Trees -Storage Representation and Manipulation of Graphs. C.The Application of Residue Arithmetic to Computers .S.P. Tata McGraw Hill.Normal Forms . and algebraic theory in computer science problems. Trembley and R. Vikas Pub.Ross.A. 5th Edition. “Discrete Mathematics”.Kolman. Richard Johnsonbaugh.Arunachalam. 2000.Group Codes.Principal Conjunctive Norm Forms.Tech. 2nd Edition.Iyengar.Groups .

sending data to the server. operators. 1996. Tailoring SSI output. expressions. visibility control. abstract methods and classes.M. 26 . 1996. creating of files. overriding methods. 5th Edition. simple java program. Executing external program and CGI programs. configuring the server. final variables and methods. Shishir Gundavaram: “CGI Programming On the World Wide Web”. wrapper classes. Addison-Wesley. designing applications using forms in PERL. Kenarnold and James Gosling: “The Java Programming Language”. “JAVA How to program”. Deital H. java statements. Common errors. vectors. Constants. 6th Edition. command line arguments.J. multithreading and Exceptions Interfaces: multiple inheritance. Packages. (Computer Science and Engineering) . packages. accessing from input. 2. onedimensional arrays. strings and vectors: arrays. Handling HTTP GET and POST requests. finalize method. inheritance: extending a class. objects and methods. languages under different operating systems. implementing a java program. 3. Output from CGI and response headers. other stream classes Networking and Servlets Introduction to networking using Java API. Common Gateway Interface (CGI) CGI applications. static members. Objective: The students would be able to understand and develop web applications. input/output exceptions. synchronization. File statistics. Arrays. variables. O’ Reilly and Associates. Classes.Syllabus (Board of studies – 25th Feb 2006) 06BCE 303 INTERNET PROGRAMMING L 2 T 1 P C 3 Aim: To introduce the concepts of internet programming technologies. Input to the CGI-environmental variables. decision making and branching. multithreaded programming. Interfaces. Addison-Wesley. constructors. java tokens. TMH. Decoding forms in other languages. 2002 REFERENCE BOOKS: 1. getting input from the user. interactive input and output. Forms and CGI: HTML tags. Deital P. creating an array. Using JDBC in Servlets. Managing errors and exceptions. “JAVA 2: The Complete Reference”. java virtual machine. TEXT BOOKS: 1. methods overloading. data types. Herbert Schildt. Including boilerplates. Server side includes (SSI). Examining environmental variables. implementing the “runnable” interface. Thomas Boutel: “CGI Programming In C and Perl”. TCP/IP Sockets and Datagram Sockets. Managing input/output files in java. 1998. programming in CGI. environmental variables. designing a web page.configuration. Applet programming and Files Applet programming. 2005. Introduction to java Overview of java language: introduction. 4.B. Overview and architecture of a Servlets. programming style. strings. Pearson Education.Tech. two-dimensional arrays.

and reliability. Division.Integrated Circuits. Programming Considerations.System Representation. India. John. Limitations of Computers . Elsevier. address mapping. REFERENCE BOOK: 1. System Architecture.System design . Serial Access Memory. Objectives : At the end of the course students should be able to understand the basic principles such as locality of reference. Design Methodology . 27 . Instruction Types. programmable logic devices. Processor level design. Hennessy & David A. Processor Architecture.level components. L. – Parallel Processing: Processor –Level Parallelism. system organization. (Computer Science and Engineering) . Multiprocessors. IO processors. also how the computer systems are organized and the characteristics of modern processors that affect system architecture. Multiplication. performance/power trade-offs.the evolution of computers. Processor Basics: CPU organization: Fundamentals. Memory Allocation – Caches: Main features. Elements of Computers. – Arithmetic – Logic Units.Communication methods: Basic concepts. Introduction: Nature of computing. hardware components. Arithmetic Logic unit: Data Path Design-Fixed point arithmetic-Addition and Subtraction. Design process. Random Access Memory (RAM).Syllabus (Board of studies – 25th Feb 2006) 06BCE 305 COMPUTER ARCHITECTURE AND ORGANISATION * L 3 T 0 P C 3 Aim: The subject aims at imparting the knowledge of Computer architecture. and Fault Tolerance. Structure versus performance. Hayes. The Gate level – the Register level. Memory Management and Networking.B. Patterson. – Instruction Sets: Instruction formats. including the instruction sets. Fixed –Point Numbers. – Data Representation: Basic formats. 3rd Ed. John P.Floating point Arithmetic.Combinational ALU. “Computer Architecture”. Sequential ALU – Advanced Topics. overlapping communication and computation. Register level design – the Processor Level . The later generation – the VLSI era . 3rd Ed. TEXT BOOK: 1. Operating Systems. McGraw Hill. Bus control – IO and System Control: Programmed IO. Floating point numbers. Pipeline Processing Memory Organization: Memory technology: Memory Device Characteristics.Register .Mechanical Era. memory systems: Multilevel memories. “Computer Architecture and Organization”. Address translations. coarse-grain parallelism. Electronic Computers. 1998. 2003.Processor Level Components. System Organization. DMA and Interrupts. the design of computers.Tech.

switches. LAN. Shortest Path Algorithms. Security Protocols. "Computer Networks". Objectives : Students shall be able to understand about working of Intranet. Security and Cryptographic Algorithms. Overview of TCP/IP Architecture. TCP/IP Architecture: The Internet Protocol. Cryptographic Algorithms TEXT BOOK: 1. Sliding Window Flow Control. different topologies like Star. Ethernet networking. Tanenbaum.B.. Network design approaches. etc. various functions of layers. User Datagram Protocol. Architecture of Networks. 2003 28 . Indra Widjaja. different switching techniques. 4th Edition. security protocols & security algorithms Networks and Services: Approaches to Network Design. Routing in Packet Networks. 7th Edition. 2003 2. OSI Reference Model. Andrew S. Prentice Hall India. DHCP. William Stallings. WAN. different protocol standards. 2000 REFERENCE BOOKS: 1. Limitations of IPv4 and Introduction to IPv6. client/server systems. routers. Application Protocols and TCP/IP Utilities Peer-to-Peer Protocols: Service Models. A. etc. different network architectures. Packet Switching Networks: Network Services and Internal Network Operation. (Computer Science and Engineering) . Tata McGraw Hill. Leon-Garcia. "Communication Networks".Syllabus (Board of studies – 25th Feb 2006) L 06BCE 307 COMPUTER AND COMMUNICATION NETWORKS 3 T 0 P C 3 Aim: The subject aims to introduce basics of Networks. LAN access methods.Tech. congestion & traffic control. Introduction to LAN Standards and LAN Bridges. ARQ Protocols. “Data and Computer Communications". Packet Network Topology. and also future Networking Technology. Transmission Control Protocol. Multiple Access Communications. Pearson Education. MAN setups. RSVP.Introduction to MPLS and Differentiated Services. Mesh. and Introduction to traffic management & QoS. different internetworking devices like bridges. Introduction to Internet Routing Protocols Advanced Network: Architectures and Security Protocols.

Regular expressions and Regular languages Finite Automata and its minimization. Tata McGraw Hill.L. Non – determinism and kleenes theorem – pumping lemma – Decision problems. and simply solvable or it cannot be solved.Syllabus (Board of studies – 25th Feb 2006) 06BCE 309 THEORY OF COMPUTATION * L 3 T 0 P C 3 Aim: The subject aims to introduce Formal Languages. John C. Construction of NFA and DFA from Regular expressions.P Mishra. Computational complexities and NP – Completeness. Martin. "Theory of Computation". Prentice Hall of India. 2nd Edition. 3rd Edition. REFERENCE BOOK: 1. 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. “Introduction to Languages and the Theory of Computation”. Automata Theory and Abstract models of Computation and Computability. 1997. 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. Conversion of NFA into DFA Theorem & Problem: Chomsky hierarchy of language. K. (Computer Science and Engineering) . TEXT BOOK: 1.Tech. efficiently solvable. They would be able to analyze the problems by determining whether a problem is solvable. 29 . Chandrasekaran. Overview: An overview of grammars and languages.B. 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. N. 1998.

Learning Paradigms – supervised. Applications of Artificial Neural Networks. GA in problem solving. and Information”. Nonspecificity of Fuzzy and Crisp Sets.M. REFERENCE BOOKS: 1. Genetic Algorithm: An Overview. Lattice of Fuzzy Numbers. Mathematical Models of Neurons. fuzzy logic and genetic algorithms T 0 P C 3 Objectives: The students would be able to understand and explain the concepts of neural networks. Fuzzy Equations. unsupervised and reinforcement learning. Jaico Publishing House. fuzzy sets. Associative Memories. Goldberg. TEXTBOOK: 1. “Genetic Algorithms in Search. Optimization and Machine Learning”. Zurada. Fuzzy Rule generation.Syllabus (Board of studies – 25th Feb 2006) L 06BCE 311 SOFT COMPUTING 3 Aim: The subject aims to introduce neural networks. handling uncertainty and problem solving using genetic algorithms Neural Networks: History.J. “Fuzzy Logic with Engineering Applications”. 1997 3. Fuzzy Logic: Classical Logic. Uncertainty based Information and Application of Fuzzy Logic: Information and Uncertainty. Back Propagation Algorithm. Fuzzy Arithmetic: Fuzzy Numbers.B. learning in biological neuron. learning algorithms. Fuzzy Logic: Introduction to Fuzzy Logic. Fuzziness of Fuzzy Sets. aggregation operations. McGraw Hill. Klir and TA Folger. ANN Architecture. “Fuzzy Sets. 1985. 30 . Hopfield Networks. overview of biological Neuro-system. Arithmetic Operations on Intervals and Numbers. Multilayer perceptron Model. Application of Fuzzy Logic: Medicine. 1995 2. “Introduction to Artificial Neural systems”. David. Prentice Hall (1988). Combination of Operations. Linguistic Variables. Addison Wesley. J. training rules.Complement. Economics Etc.Tech. E. Multivalued Logics. Implementation of GA. (Computer Science and Engineering) . Membership Function. ANN training algorithms – perceptron. Classical and Fuzzy Sets: Overview of Classical sets. Operations on Fuzzy Sets. Delta. Learning rules. Intersections. Union. fuzzy arithmetic. Fuzzy Qualifiers. Linguistic Hedges. Fuzzy Propositions. Uncertainty. Ross T.

e. When the user selects a customer name and product and press the “submit” button. b as c …z as a. a as b. Write a Java program to implement this scenario. File downloading and uploading. T P 2 C 2 5. This process is done using UDP. The message entered in the client is sent to the server and the server encodes the message and returns it to the client. 4. Write a program to implement an echo UDP server. A server should run for 10 secs and generate numbers continuously. 2. 8. Encoding is done by replacing a character by the character next to it i. b as c …z as a. This process is done using the TCP/IP protocol. quantity. Allow the client to check the availability of a category of car and to make reservation. 13. 12. Write a program for the above 6. and date of order by the customer with the name of that product. Write a program to display the server’s date and time details at the client end. Remote object interaction. Design and populate a database for a car rental system. 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. a as b. 3. 11.B. 10.Syllabus (Board of studies – 25th Feb 2006) L 06BCE 313L NETWORKING LAB 1. display a list with the customer name. Write a program to develop a simple Chat application. 31 . The client connecting to it should read data and find out the sum of the data thus read.Tech. Write graphical user interface for the sales database which lists all the customer names in one choice box and all products in another. 9. Write a program to create a daemon process. ii).e. (Computer Science and Engineering) . Write a program for the above 7. Write program to illustrate the following: i). product. Write a program to display the client’s address at the server end. Use prepared statements whenever possible. Write a program to capture each packet and to examine its checksum field. Write a program to display the name and address of the computer that we are currently working on.

student information system etc. 2. develop html and CGI programs in java for web based applications like bank transaction. HTML and JAVA Mini-project has to be completed and submitted. T P C 2 2 1.Syllabus (Board of studies – 25th Feb 2006) L 06BCE315L INTERNET PROGRAMMING LAB Exercises on inter networking involving CGI. (Computer Science and Engineering) . 32 .B. The student has to submit a report to the examiner. On a computer network consisting of WINDOWS NT LINUX/UNIX machine running a web server software and client machines running a browser. 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.Tech.

Syntax errors-Yacc Semantics & runtime environments : Syntax-directed definitions. lexemes. Reducing the memory access times by exploiting addressing modes-peephole optimizations.M. Muchnick “ Advanced Compiler Design Implementation “ Elsevier Science India. Three Address Code : .attributes-entries.Syllabus (Board of studies – 25th Feb 2006) 06BCE302 PROGRAMMING LANGUAGE PROCESSORS L 2 T 1 P C 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.Source language issues. Code optimization. storage-allocation strategies. the target machine. storage organization. logical phases of compiler.Storage classes. Compiler Vs Interpreter. Intermediate Code Generation & Optimization : Intermediate languages. Steven S. CLR parsing-LALR parsing. and tools” Pearson REFERENCE BOOKS : 1. visibility. Regular expressionsOverview of automata-Thompson construction NFA-DFA-minimized DFA-lexical errors. symbol tables:.Lex Syntax Analysis : Role of parser-Context Free Grammars-Parse Tree. Ravi Sethi. Assemblers & Macros : Issues in the design of a code generator. Dhamdhere “Systems Programming and operating systems” Tata McGraw Hill Pub 33 . D. 2.recursive predictive parsing. Jeffery D. Non. basic blocks. access to non-LOCAL names. Bottom-Up parsing:.The principle source of optimization. Boolean expressions. case statements. TEXT BOOK 1. pass Vs phase-cousins of compilers. bootstrap arrangement. Tokens-attributes.B.specification of tokens. LL(1) grammars.Top down parsing: Recursive-Descent parsing. and life times. Alfred V. assignment statements. Run-time environments:. l-attributed definitions. addressing array elements. (Computer Science and Engineering) . Objectives: At the end of the course students should • be able to discuss implementation issues of complier for a sample language. construction of syntax trees. Aho.local and global symbol table structures and management.Construction of SLR parser tables and parsing . optimization of basic blocks.Design issues-patterns. Ullman “Compilers – Principles. Code optimizations:. parsing –LR parsers:. Lexical Analysis phase: . Techniques. DAG’Sbottom-up evaluation of s-attributed definitions.Shift-Reduce parsers.declarations.Tech. cross compiler.Ambiguity. parameter passing. • 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. Operating precedence parsing: design of operator precedence table.Elimination of ambiguity. back patching. DAG’sElements of Assembly language – assemblers – Passes of an assembler-Macros-design of macro processors – passes of a macro processor. loops in flow graphs.

Testing. Addison Wesley. "Object Oriented Analysis and Design with applications". module diagrams. Workflow and phases of the Unified process. Tools. Interaction diagrams. Applying object model Elements of Notation: Class diagrams.B. REFERENCE BOOK: 1.Syllabus (Board of studies – 25th Feb 2006) 06BCE 304 OBJECT ORIENTED ANALYSIS & DESIGN L 3 T 0 P C 3 Aims: The subject aims to introduce of the object-oriented development processes. Complexity of software: Structure of complex systems. the Requirement Workflow. Objectives: The students would be able to understand the techniques. TEXT BOOK: 1. micro development process. Release management. ObjectOriented Analysis Workflow. Management and planning: Staffing. macro development process. Maintenance. Schach. Reuse. Tata McGraw Hill. Management Issues. Principles. Elements of object model. Teams. Planning and Estimating. Designing complex systems. 2003 34 . Quality Assurance and Metrics. Analysis and Design: Case studies. UML and related methodologies.Tech. Documentation. (Computer Science and Engineering) . decomposing complexity. applications and UML based object oriented analysis and design. object diagrams. applying the notation. Benefits and Risks of Object Oriented development Introduction to Object-Oriented Paradigm and UML: Unified Process. Object Model: Evolution. Stephen R. Introduction to Web – Based Systems. process diagrams. Object-Oriented Design Workflow. "An Introduction to Object-Oriented Systems Analysis and Design with UML and the Unified Process". state transition diagrams. User Interface system. Grady Booch.. 1994.

system related utilities.concepts. network devices under linux. and debugging: Device drivers . Mark G. TEXT BOOK : 1. pages under linux. an example of DMA operation. modules. ARP. implementation in the kernel. the proc file system and ext2 file system. Network implementation : Introduction concepts. network interface.UDP and TCP. what can be implemented as a module? Parameter passing. Device drivers. mount.architecture-independent memory model. implementing system calls. debugging with gdb. Appendices. Remy Card Et Al : The LINUX Kernel Book. the debugger printk(). important structures. The proc file system: the proc/directory. kernel-related commands: free. boot process System calls : Process management. the self/directory. IP. main algorithms.Tech. introduction to the kernel . configuring kernel.D) REFERENCE BOOKS : 1.C. block device caching. shutdown. 35 . A. init. an example module.Synchronization in the kernel. the sys/directory.important data structures.Syllabus (Board of studies – 25th Feb 2006) L 06BCE306 LINUX SYSTEM PROGRAMMING 2 T 1 P C 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. traceroute. The net/directory. polling and interrupts.Character and block devices. Sobel : A Practical Guide To LINUX. and parallel interface. lilo-the linux loader. Bek Et Al : LINUX Kernel Internals. File system -basic principles. John Wiley. compiling the kernel. 1997. communication via files. pipes. debugging using ptrace. all that remains. representation of file system in the kernel. file system. (Computer Science and Engineering) . System calls. The boot process: carrying out the boot process. Memory management . top. Addison-Wesley. Addison-Wesley. File System: IPC. Debugging. initialization. message oriented protocols Introduction : Linux – the operating system. implementing a driver. serial interface. virtual address space for a process. 1998 2. IPC with sockets.B.concepts. communication. ps. the file system. system V IPC. IPC. the kernel daemon. Modules. strace. M. 1997 (Chapters 1 to 9.B. memory management. the packet interface. the hardware. commands.

memory management. (Computer Science and Engineering) . Distributed systems. Distributed File Systems. CPU Scheduling. 6th Edition REFERENCE BOOK: 1. Introduction: Computer-System Structures. Windows 2000. Abraham Silberschatz. I/O systems and File Systems They would be able to use Linux system. Mass-Storage Structure Distributed System: Distributed System Structures. Multiprogramming. Deadlocks Memory. Threads. John Wiley & Sons. "Operating System Concepts".Tech. Security Case Study: The Linux System. Process Synchronization. Protection. TEXT BOOK: 1. Fourth Edition 36 . Deadlock prevention. Stallings William. processes & Threads. scheduling algorithms and distributed file systems Objectives : The students would be able to understand and explain various OS concepts such as time-sharing. Memory Management. Semaphores and Critical regions. Peter Baer Galvin. I/O Systems. Parallel. Prentice Hall of India. "Operating Systems". Distributed Coordination. Inc.Syllabus (Board of studies – 25th Feb 2006) 06BCE 308 OPERATING SYSTEMS * L 3 T 0 P C 3 Aim: This subject aims to introduce operating system concepts such as processes & threads. CPU scheduling algorithms.B. File-System Interface. File & IO Management: Memory Management. Operating-System Structures Process Management: Processes. File-System Implementation. windows 2000. Greg Gagne. Virtual Memory.

connectivity.Tech. relationships amongst matrices. kuratowski’s graphs. covering and partitioning Directed graphs Chromatic number. Swamy. fundamental circuits. Combinatorial Algorithms: Theory And Practice. disconnected graphs. and adjacency matrix. algorithms for connectedness. N. J. covering.Cut sets Properties. Graph.J. Addison Wesley/ Narosa. spanning tree. connected. walk. distance and centers. 37 .Syllabus (Board of studies – 25th Feb 2006) 06BCE310 GRAPH THEORY AND ITS APPLICATIONS L 2 T 1 P C 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.Harary. Prentice Hall India. TEXT BOOK: 1. Graph theoretic algorithms Computer representation of graphs – input & output. fundamental circuits and cut sets. Properties. Narasing Deo. detection of planarity. 1981. dual graphs. circuit matrix. spanning trees.S. paths. John Wiley. Euler and Hamiltonian graphs.Reingold.B. fundamental matrices. separatability. matching. 2. importance. F. N. trees-matrix representation.Nievergelt.N. tournament. 3. (Computer Science and Engineering) . four color problem. trees. Planar and Dual Graphs Coloring. operation on graphs operation on graphs.1977.M. E. directed paths and connectedness. cut set matrix. Euler digraphs. Trees. fundamental circuits. Introduction Definitions. circuits. Prentice Hall. Matrix representation of graphs Incidence matrix. chromatic partitioning. minimal spanning tree. Cut sets. Different types. 1998. Networks And Algorithms. 1995. isomorphism. 1-2 isomorphism.Planar and dual graphs -Combinatorial representation. Graph Theory With Application To Engineering And Computer Science. network flows. path matrix. directed circuits and shortest paths. cut vertices. planar graphs. REFERENCE BOOKS: 1.Deo. Graph Theory. Tulasiraman And M.

38 .Tech.Syllabus (Board of studies – 25th Feb 2006) SYLLABUS 06BCE314L (VI – SEMESTER) L T P 2 C 2 LINUX SYSTEM PROGRAMMING LAB To carryout a mini project based on the various system related commands learnt in the theory subject. (Computer Science and Engineering) .B.

11. Program to report the behavior of the OS to get the CPU type and model. 9. 8. Implementation of page replacement algorithms.B. Implement the solution for dining philosopher’s problem. 39 . 7. 4. Implement the solution for reader – writer’s problem. IPC using pipes. best fit and worst fit file allocation strategy. Inter Process Communication (IPC) using Message Queues. round – robin. (Computer Science and Engineering) . amount of memory currently available. Implementation of wait and signal using counting semaphores. Write a program to create processes and threads. 5. After it started where K is a command line parameter. Write a program that uses a waitable timer to stop itself K. Implement banker’s algorithm. 6. Implement the various process scheduling mechanisms such as FCFS. Signaling process 13.Tech. Implement the first fit. 2. Program to get the amount of memory configured into the computer. 10. 14. 15. SJF. Priority. 12. kernel version. 3.sec. Implementation of wait and signal using binary semaphores.Syllabus (Board of studies – 25th Feb 2006) L 06BCE 316L OPERATING SYSTEM LAB T P C 2 2 1.

6th Reprint. 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.. REFERENCE BOOK: 1. Trouble Shooting and Maintenance”. 1993. Pub. Objective : To assemble a PC and identify the frequently occurring errors and troubleshooting appropriately. B. Tata McGraw Hill. 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. 40 .Syllabus (Board of studies – 25th Feb 2006) 06BCE401 PERIPHERALS INTERFACING AND TROUBLE SHOOTING 2 1 3 Aim : To expose the students to know about Internals of PC and how they are functioning. them 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. “IBM PC and Clones Hardware.Tech.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. Ltd. HDD Problems – Over view of Advanced PCs. HDC.B. 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 . (Computer Science and Engineering) . Govindarajulu.

Devices and Buses for Device Networks: I/O Devices – Timer and Counting Devices – Serial Communication Using the I2 C.Syllabus (Board of studies – 25th Feb 2006) 06BCE 403 EMBEDDED SYSTEMS L 3 T 0 P C 3 Aim: The subject aims to cover the concepts of embedded systems. Task & Threads – Multiple processes in an Application – Problems of Sharing Data by Multiple Tasks & Routines – Interprocess Communication. Objectives: The student would be able to understand and use in embedded systems. (Computer Science and Engineering) . TEXT BOOK: 1. “Embedded Systems Design”. 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. PCI. Tata McGraw Hill. programming models and Interprocess communication. Rajkamal.B. 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. Deadline and Interrupt Latency Program Modeling Concepts: Single and Multiprocessor Systems Software – Development Process. Berger. ‘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 – 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.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. 2003 REFERENCE BOOKS: 1. Practice & Design”. device drivers. CMP Books. Memories and I/O Devices. their design and applications. “Embedded Systems-Application.Tech. Arnold S. software engineering practices in embedded systems development and Inter process communication. 1997 41 .

William Stallings “Cryptography and Network security – Principles and Practice". Hash Algorithm: Message Digest algorithm (MD5) – Secure Hash algorithm (SHA-1) – HMAC. 2nd edition.B. Blow Fish etc. Pearson Education. Tata McGraw Hill. REFERENCE BOOK: 1.Syllabus (Board of studies – 25th Feb 2006) 06BCE 405 NETWORK SECURITY L 3 T 0 P C 3 Aim: The subject aims to cover the significance of security of computer systems and computer networks. 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. “Network Security” – 2nd edition. 42 . Raja perlman. 2005. authentication techniques digital signatures and System-level security issues.Stenography – Classical Encryption Techniques. Intruders and Viruses. Attacks. “Cryptography and Network Security”. TEXT BOOK: 1. It also covers the topics such as cryptography and various encryption algorithms. Mike speciner. Conventional Encryption: Classical Techniques: Conventional Encryption model .Tech. Digital Signatures and Authentication Protocols: Digital signatures – Authentication protocols – Digital signature standard. Crypto-analysis.Audit records Viruses and related Threats – Firewalls: Firewall design principles – Firewall characteristics – types of firewalls – Firewall configurations.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. Electronic Mail Security: Pretty Good Privacy – PGP services – Transmission and reception of PGP messages – PGP message generation – PGP message reception. Public Key Cryptography: Principles of public-key cryptosystems – The RSA algorithm .Different approaches of Intrusion detection . Worms: Intruders – Intrusion techniques – Password protection – Access control – Password selection strategies -Intrusion detection. Services & Mechanisms: Security attacks – Security services – Network Security Model.Modern Techniques: The Data Encryption Standard – The Strength of DES – Differential and Linear. 2002. Atul Khate. Prentice-Hall of India Pvt Ltd. 2. Objectives: The students would be able to understand and use encryption algorithms such as RSA. (Computer Science and Engineering) . Charlie Kaufman. 2002.

Programmable Peripheral Interface 6. 7 – segment LED Display Routine 3. Programmable Communication Interface 7. Keyboard Scanning Routine 2. Floppy Disk Drive.Syllabus (Board of studies – 25th Feb 2006) L 06BCE413L PERIPHERALS AND INTERFACING LAB T P 2 C 2 1. Diagnostics home menu 10. Hard Disk Drive Mechanism 43 . (Computer Science and Engineering) . Printer Interface 5. Power On self Test (POST) 9.Tech. Trouble Shooting in PC’s 11. Programmable Timer 8.B. Software decoder driver 4. Data Acquisation System 12.

(Computer Science and Engineering) .Syllabus (Board of studies – 25th Feb 2006) L 06BCE415L EMBEDDED SYSTEMS LAB T P 2 C 2 Student has to do a mini project based on the knowledge acquired in the theory paper. 44 .B.Tech.

identifying the distribution. Continuous distributions. Summary and comparison of simulations. Inventory policies. GPSS. Karian. Transient & steady state behavior of queuing notation. Comparison and evaluation of alternative system designs: Comparison of two and several system designs. Jerry Banks. SIMSCRIPT. Simulation Examples. verification & validation. statistical models for estimating the effect of design alternatives. Queuing Models: Characteristics of queuing systems. Deterministic systems. 1991. Random variable Generation: Inverse transform technique. 45 . Introduction to Simulation: Advantages and disadvantages of simulation.Tech. Transient & steady state behavior of queues. and Dvdewicz. Simulation of queuing systems. Systems and system environment. verification of simulation models. Simulation of inventory systems. Random numbers & variables. Model of a system. Discrete-event System Simulation. Empirical distributions. Generation of Pseudo – random. Inventory Systems: Measures of effectiveness. Carson. simulation techniques. Z. O/P analysis for steady-state simulations. tests for random nos. Programming languages for DESS: FORTRAN. Output Analysis For a Single Model: Stochastic nature of O/P data. GASP. Steps in a simulation study. discrete event simulation. E. parameter estimation.. Useful statistical models. PHI. Statistical Models in Simulation: Review of terminology & concepts. other examples of simulation. Convolution method. TEXT BOOK: 1. Input Data Analysis: Data collection. Concepts in DES. general principles and computer simulation languages. Simulation in inventory analysis. Discrete – events system simulation. Verification and validation of simulation models: Model building. and probabilistic systems. measures of performance and their estimation. Process. techniques for generating random nos. Direct Transformation for the normal distribution. Acceptance-Rejection technique. Nos. Discrete distributions. Inventory systems.. Types of models. statistical methods. areas of application. Modern Statistical Systems and GPSS Simulation. calibration & validation of models. types of simulations with respect to O/P analysis. 3rd Edition REFERENCE BOOK: 1. (Computer Science and Engineering) . long run measures of performance of queuing systems. Freeman.B.Syllabus (Board of studies – 25th Feb 2006) 06BCE E01 COMPUTER SIMULATION & MODELLING L 3 T 0 P C 3 Aim: This subject aims to cover statistical models in simulation. O/P analysis for terminating simulations. Discrete and continuous systems. queuing notation. Input and output analysis Objectives: The students would be able to understand and use discrete event simulation.J.A. Random Number Generation: Properties of random numbers.. steady – state behavior of finite population models. Components of a system. SLAM. John S. goodness-of-fit tests.

gaining popularity. model. utilization and management of the expensive resources that are remote to the users. desirable features of good global scheduling algorithm. group communication.Desirable features of good DFS. (Computer Science and Engineering) . file caching schemes. message passing –introduction. file sharing semantics. Objectives: The students would be able to understand and use different network models. Pradeep K. access control. file accessing Models. "Distributed Operating Systems: Concepts & Design". encoding and decoding of message data. atomic transaction. REFERENCE BOOK: 1. security mechanisms and design methodologies of Distributed systems Models & IPC: Introduction to distributed computing system. call semantics. Andrew S. 46 . Tanenbaum. parameter . failure handling.B. evolution different models. security. “Distributed Operating Systems” Pearson Education.Syllabus (Board of studies – 25th Feb 2006) 06BCE E03 DISTRIBUTED COMPUTING L 3 T 0 P C 3 Aim: The subject aims to cover parallel & distributed computing architecture. threads. networked clusters of computers. 2002. stub generation. DCE security service. Sinha. RPC messages. structure of shared memory space. client – server binding. Resource and process Management: Introduction. buffering. DCE. Digital signatures. definition. process addressing. file models. issues in design. granularity. marshalling arguments and results. clock synchronization. synchronization. advantages of DSM. load balancing approach. mini project using Java RMI Distributed Shared Memory: Distributed shared memory. desirable features of a good message passing system.Tech. communication protocols for RPCs. potential attacks to computer system. replacement strategy. Fault Tolerance. RPC: RPC-Introduction. implementation mechanism. transparency. TEXT BOOK: 1. consistency model. and file replication. multigram messages. exception handling. process migration. task assignment approach. authentication. 2005. Distributed File Systems and Security: DFS and security.general architecture of DSM systems. PHI. design and implementation issues of DSM systems. issues in IPC.passing semantics. cryptography. thrashing. server management.

Query processing. McGraw Hill publications. 1999 REFERENCE BOOK: 1. 47 . Transaction management and Distributed DBMS reliability. (Computer Science and Engineering) .B. Distributed databases. Query decomposition and Transaction Management. Patrick Valduriesz. Query decomposition. Introduction to Transaction Management: Definition of a Transaction – Properties of Transaction – Types of Transaction. TEXT BOOK: 1. Tamer Ozsu. Query Optimization – Centralized Query Optimization – Join Ordering in fragment queries – distributed query optimization algorithms.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. 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. Distributed Database Design. DBMS Standardization – Architectural models for distributed DBMS – Distributed DBMS Architecture – Global Directory issues Distributed Database Design: Alternative Design Strategies – Distributed Design issues – Fragmentation – Allocation. "Principles of Distributed Database Systems". "Distributed Database Principles and Systems". Stefanoceri. Objectives: The students would be able to understand and use distributed Database Processing. Introduction to Distributed Data Processing: What is a distributed database system – Promises of DDBS – Complicating Factors – Problem Areas.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. Giuseppe Pelagatti. PHI.Syllabus (Board of studies – 25th Feb 2006) 06BCE E05 DISTRIBUTED DATABASE SYSTEM L 3 T 0 P C 3 Aim: This subject aims to cover Distributed Data processing. Query processing. 1987.Tech. Distributed concurrency control. M. Semantic Data Control: View Management – Data Security – Semantic Integrity Control Overview of Query Processing .

To familiarize with the various data warehousing and data mining tools Data Warehouse and OLAP Technology for Data mining: Introduction to Data Warehouse. Anahory S. 2. Association Rule Mining: Basic concepts – market basket analysis .B. Data Mining Introduction: Introduction to Data Mining – Data Mining Functionalities – Classification of Data Mining systems. “Building the Data Warehouse”. M. Murray. Data Mining primitives.H. Morgan Kaufmann. 2005. languages & system architecture: Data Mining primitives: Task – relevant data – kind of knowledge to be mined – Background knowledge – interestingness measures– presentation & visualization of discovered pattern . Immon. & Kambler.Tech. summary table.Data cleaning – Data integration and Transformation.Data Mining Query language – Designing Graphical User interfaces based on DMQL Architecture of Data mining. “Data Mining: Concepts and Techniques”. “Data Warehousing in the Real World”. Wiley Dream Tech. 48 .issues regarding classification and prediction – Bayesian classification – prediction: linear – non linear.Syllabus (Board of studies – 25th Feb 2006) 06BCE E07 DATAWAREHOUSING AND DATA MINING ** L 3 T 0 P C 3 Aim: The subject aims to cover knowledge discovery process and to design and populate a business data warehouse. REFERENCE BOOKS: 1. Classification & prediction: What’s classification .Mining single dimensional Boolean association rules from transactional databases. Data mining applications.Major clustering methods.. D. TEXT BOOK: 1. 2003. fact data and dimension data. 3rd Edition. Cluster analysis: Types of Data in cluster analysis . Han J.A multidimensional Data Model – Data Warehouse architecture – Data preprocessing. 1997. Major issues in Data mining. To sail along with the various approaches in data mining. 1st Edition.W. Addison Wesley. data mart. (Computer Science and Engineering) . Objectives : To make familiar with the various concepts of data warehousing like meta data..

Mobile Devices. mobile network layer and various wireless Application Protocol. HIPERLAN. Wireless ATM. Wireless ATM operations. Johchen schiller. TETRA. (Computer Science and Engineering) . Selective Retransmission. Access point control protocol. Broadcast systems Overview –Cyclic Repetition of Data Digital Audio Broadcasting –Digital Video Broadcasting. 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-TDMACDMA-comparison of S/T/F/CDMA. HiperLAN and Bluetooth.B. DECT. GSM. Applications and Service Creation”. 2000. GPRS and Wireless Application protocols Objectives: The student would be able to understand the principles and practices of Mobile Communication. 49 . 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. Asoke K. Addressing. UMTS and IMT 2000.11. MEO140. Routing.Syllabus (Board of studies – 25th Feb 2006) 06BIT E09 MOBILE COMMUNICATION ** L 3 T 0 P C 3 Aim: The subject aims to impart the knowledge about the technologies like CDMA. Radio Access Layer: Handover. Wireless Communication: Wireless LAN-Infrared vs. 2005. WATM Services. Satellite Systems –GEO139. Medium Access Control techniques. Mobile quality of service. Location Management. Talukder. LEO139. Snooping TCP. Bluetooth. IEEE802. Satellite Communication. Wireless Local Area Networks. Mobile TCP: Fast Retransmit/Fast recovery. Handover. REFERENCE BOOK`: 1. Tata McGraw Hill.Yavagal. Wireless ATM working group. Mobile Communication. Infrastructure and ad hoc networks. transmission/Timeout Freezing. Mobile Network Layer: Mobile IP-Dynamic host configuration protocol-Ad hoc networks. “Mobile Computing-Technology. Localization. Roopa R. Functions. Mobile transport layer-Traditional TCP292: Indirect TCP. Radio transmission. Telecommunication Systems –GSM. Reference Model.Tech. TEXT BOOK: 1. Addison Wesley. Motivation for WATM.

Advanced Concepts. IDG Books India Pvt.NET. 2003 REFERENCE BOOKS: 1. Writing GUI Applications with .B. Microsoft C# Language specification. WP Publishers and Distributors. Rick Leinecker ASP. Writing Web Application with the . 2003 3. WP Publishers and Distributors.NET. Ltd. 2003 50 .Tech.NET Framework. 2001 2.NET Introduction to Microsoft .NET framework.NET Platform: Building Blocks of .NET Framework. C#.NET C# Language Fundamentals: Object Oriented Programming in C#.NET Framework Concepts I: console I/O-working with strings-formatting and conversion. (Computer Science and Engineering) .NET framework.NET on the edge. Introduction to Web Services: Writing Mobile Application with . Objectives: After completion of this course the students will be able to undergo projects in . MSDN. Microsoft Visual Basic .file I/O – serialization. MSDN. MSDN. Threading NET Framework Concepts II: Reflection. WP Publishers and Distributors. . .Remoting -XML Parsing-Security.NET Framework: Introduction to ADO. TEXT BOOK: 1.Syllabus (Board of studies – 25th Feb 2006) 06BCE E11 WEB SERVICES L 3 T 0 P C 3 Aim: To provide the student with the basics of .

“Pattern Recognition and Image Analysis”. “Neural Networks for Pattern Recognition. Artificial Neural Network Structures: Supervised training via error back propagation .Josh.” Oxford University Press.Syllabus (Board of studies – 25th Feb 2006) 06BCE E15 PATTERN RECOGNITION L 3 T 0 P C 3 Aim: This subject aims to cover basic concepts of Pattern recognition. their applications and comparative studies of feed forward artificial networks. S. Looney. Artificial Neural Network Structures. 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. Advanced learning algorithms for Pattern Recognition. Recognition of emergencies using ANN. TEXT BOOK: 1. Clustering – Nearest neighbor classification – Non parametric techniques.derivations. Newyork Oxford University Press – 1997. Prentice Hall. 1996.B. 51 .Decision theoretic algorithms – structural pattern recognition. Feature Detection. 2.Tech. Carl G. Earl Gose. Basic Concepts: Basic Concepts of Pattern Recognition. Decision Trees – Multilayer perceptrons. Objectives: The students would be able to understand and explain fundamentals of pattern recognition. REFERENCE BOOK: 1. Bishop. R. 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. 1995. “Pattern recognition using Neural Networks – theory and algorithms for engineering and scientists”. (Computer Science and Engineering) . Christopher M.Johnsonbaugh. Neural Feature and Data Engineering: Neural engineering and testing of FANN’s – feature and data engineering.

peer –to –peer communications. transaction processing monitors. database servers. information at the fingertips. NETWARE. Distributed Computing Environment (DCE) . the current state. 1997 52 .server transaction processing : Transactions : Concepts. tp-lite vs tp-heavy. the transparent illusion. Objective : To design an efficient database and evaluate the transaction processing mechanism under different loading environments. clientserver groupware: concepts and importance of groupware. LAN server. transaction management standards. the options. the state of the client-server infrastructure : components.the post modern NOS. OLTP. acid properties. Introduction : Client-server computing : Concepts. (Chapters 1 to 20) REFERENCE BOOK : 1. TCP/ IP and sockets. SQL API. transaction models. SQL middleware and federated databases. concepts. DFS. data warehouses. “Essential Client-Server Survival Guide” . (Computer Science and Engineering) . stored procedures. TEXT BOOK : 1.B.Syllabus (Board of studies – 25th Feb 2006) 06BCEE17 CLIENT SERVER TECHNOLOGY L 2 T 1 P C 3 Aim : To explain various issues related with SQL database services and transaction processing. named pipes. John Wiley. SNA. information warehouses. Robert Orfali Et Al . NETWARE vs. remote procedure calls. stack middleware. open SQL gateways. Middleware : Networking Operating System (NOS). IBM LAN server. Client.creating the single system image. messaging and queuing.Tech. Sql database services: Fundamentals. building blocks. TP-lite: origins and concepts. Linthicelm : David Linthicelm’s “Guide To Client / Server And Intranet Development” . triggers and rules. John Wiley. threads. middleware building block. functions. 1994. components of groupware: lotus notes: features and applications. net bios. OSF’s DCE releases.

Internet-based EDI. Intra organizational e-commerce: internal information systems. Intellectual property issues in the age of EP. credit cards. Approaches to safe e-commerce: overview . business requirements. workflow automation and coordination customization and internal commerce. Consumer search and resource discovery. Modes of electronic commerce: overview . concept and payment processing e-mail and secure e-mail technologies. “Digital Money: The New Era Of Internet Commerce”. TEXT BOOKS: 1. Application: Consumer-oriented e-commerce: application mercantile process models.B. search and resource discovery paradigms. master card/visa secure electronics transaction Introduction. EDI and e-commerce. the electronics commerce environment. charting the online marketing process. Addison-Wesley. Daniel Lynch And Leslie Lundquist. secure electronics transaction. John Wiley.Tech. security on web servers and enterprise networks. information filtering. secure electronics payment protocol. consumer-data interface: emerging tools. mercantile models from the consumer’s perspective and from the merchant’s perspective. Electronics publishing: EP and web-based EP. security and privacy issues. Introduction the meaning of distribution.based electronic payment systems. EDI envelope for message transport. MIME. 2. legal. macroforces and internal commerce. “Web Commerce Technology Handbook”. information search and retrieval. S/MIME and MOSS. commerce-net advocacy. applications of EDI in business. digital token-based electronic payment systems. E-commerce with internet/www.Syllabus (Board of studies – 25th Feb 2006) 06BCEE21 WEB COMMERCE L 2 T 1 P C 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. a model for message handling working of E-mail. smart cards and electronic payment systems. intellectual property issue for multimedia/ hypermedia development. 1996 53 . (Computer Science and Engineering) . Emma Minoli. Introduction: Electronic commerce environment and opportunities: Background. Andrew B. risk and electronic payment systems. certificates for authentication.electronic data interchange (EDI). Whinston “Frontiers of Electronics Commerce”. 1998. advertising on the Internet. Daniel Minoli. Payments and security : Electronic payment systems: types. 1996 REFERENCE BOOK: 1. comparisons of security methods. supply chain management.secure transport protocols secure transactions. designing electronic payment systems. their related issues and security. Ravi Kalakota. migration to open EDI. standardization and EDI software implementation. web commerce going forward. Advertising and marketing:: The new age of information-based marketing. values-added networks. e-commerce catalogs or directories. electronic marketplace technologies. Intra organizational commerce and EDI : EDI. MIME and related facilities for EDI over internet. Tata McGraw – Hill.

Raghuveer M. minimum variance huffman codes. Machine Learning Differential coding Overview. extended huffman codes. huffman coding algorithm. Constant Factor Delta Modulation (CFDM). markov models. Discrete Wavelet Transforms (DWT) for image compression. Pearson Education. applications. Introduction to Information theory Compression techniques. 1996. Transform coding Different transforms. transform coding. models. Ralf Steinmetz and Klara Nahrsedt. Adaptive Differential Pulse Code Modulation (ADPCM). Co. basic algorithm. coding a sequence. length of huffman codes. Buzo. Khalid Sayood. Mathematical preliminaries: Overview. introduction. Morgan Kaufmann Publications. Addison Wesley Pub. “Wavelet Transforms: Introduction to Theory and Applications”. REFERENCE BOOKS: 1. video coding using multi-resolution techniques. delta modulation. modeling and coding. facsimile encoding. introduction to information theory. application to image compression. Vector quantization: Introduction. TEXT BOOK: 1. applications. generating a binary code. physical models. Gray) algorithm. run length encoding.Tech. adaptive huffman codes. Quantization and coding of transforms. non binary huffman codes. audio compression. measures of performance. Codebook Initialization. Various compression coding techniques Huffman coding: Good codes.. other vector quantization schemes. probability models. Second Edition. JPEG Compression. empty cell problem. Differential Pulse Code Modulation(DPCM). advantages LBG (Linde. 2. lossless compression.B. lossy compression. 1998. 54 . Arithmetic codes: Overview. Lossless image compression and vector quantization Lossless image compression: Introduction. “Multimedia Computing and Communication and Applications”. other approaches. Ltd.Syllabus (Board of studies – 25th Feb 2006) 06BCEE23 DATA COMPRESSION TECHNIQUES L 2 T 1 P C 3 Aim: This subject aims to cover standard compression techniques Objectives: The students would be able to understand and design new compression techniques. 2000. “Introduction to Data Compression”. (Computer Science and Engineering) . progressive image transmission. Rao. tree structured vector quantizer. comparison of huffman and arithmetic coding. Wavelet transforms and data compression introduction. speech coding.

getting the best from verification. verification checklists. (Computer Science and Engineering) . selecting the right approach. summary of IEEE/ANSI test related documents. Validation testing : validation overview. 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. Algorithms and data structures : Searching. notations. constants. performance liaisons. headers and libraries. comments. macros. interface : csv. life-cycle mapping of tasks and deliverables. current practices. trees. 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. interface principles. data exchange. getting leverage on verification. portability : language.B. Kernighan and Rob Pike. Performance : Performance bottlenecks. resource management. program organization. 55 . software testing tools. building the data structures in ‘C’. prototype libraries. portability and upgrade. 1995. 1999 2. GUIs: what’s new here? Usage testing. Debugging : debuggers. function macros. debugging tools. standards relevant to software engineering and testing. useful measures and other interesting measures. “The Practice of Programming” . statement. getting gains to happen. minimizing validation testware development costs. Addison-Wesley. when. recommendations. Recommendations. byte order. Managing test technology. trends. Ed Kit : “Software Testing in the Real World”. interpreters and compilers. three critical success factors for implementing verification. hash tables. challenges. spacy efficiency. follow-up. consistency and idioms. minimizing the cost of performance tests. growing arrays. tool acquisition. critical choices. approaches to organizing the test function. Testing methods Verification testing : basic verification methods. verifying documents at different phases. lists. generating the output. validation testing tasks and deliverables. clues and bugs. sorting. getting sustainable grains in place. getting help. internationalization.user manuals. what. recommendations. Addison-Wesley. measurement provide answers. and how to test. structural design elements. testing tracks deliverables. expressions. validation activities. critical disciplines: frameworks for testing. programming tools. timing and profiling speed.Tech. TEXT BOOKS : 1. data structure alternatives. regular expressions. program generators. categorizing test tools. isolation. standard checklists : Organizational approaches to testing : organizing and reorganizing . libraries.Syllabus (Board of studies – 25th Feb 2006) 06BCEE25 SOFTWARE PRACTICE AND TESTING L 2 T 1 P C 3 Aim : To expose the various testing methods. the clean sheet approach to getting started. Design and implementation : markov chain algorithm. Brain W. Notation : formatting data. Establishing a practical perspective. tester-to-developer ratios. a testing orphan. software measures and practices benchmark study. validation methods. estimation. product release criteria. controlling validation costs. user interfaces. minimizing the cost of maintaining the tests. and recommendation strategy for validation testing.

J.B. 2.Tech. John Wiley. 1999 Beizer B. G. “The Art of Software Testing”. “Effective Methods For Software Testing” (Second Edition). 3. “Software Testing Techniques” (Second Edition). Van Nostrand Reinhold. 1990 Myers. (Computer Science and Engineering) .Syllabus (Board of studies – 25th Feb 2006) REFERENCE BOOKS : 1. 4. Microsoft Press. William Perry.”Writing Solid Code”. 1979 Steve Merger . 1993 56 . John Wiley.

2D and 3D transformations. Prentice Hall. Foley J. 2. McGraw Hill. (Computer Science and Engineering) . TEXT BOOK: 1. 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). Van Dam A. games graphs and charts animation – Introduction of graphics and kernel system (GKS) – binding language for GKS – programming examples using GKS.A programming approach". 1990 57 . VLSI. Introduction to Computer Graphics: Display devices – Hardcopy devices – Interactive input devices – Display processors – Graphic Adapters – basic function – Monochrome adapters. Image processing. Objectives: The student would be able to understand and use Computer Graphics various Clipping algorithms.B. "Fundamentals of Interactive Computer Graphics".. Steven Harrington. 1986.Syllabus (Board of studies – 25th Feb 2006) 06BCE E27 COMPUTER GRAPHICS L 3 T 0 P C 3 Aim: The subject aims to cover Interactive and Non Interactive computer graphics methods. "Computer Graphics. New Delhi. 2000.Tech. REFERENCE BOOKS: 1. 2D and 3D modeling. Addison Wesley. Computer Graphics Applications: CAD/CAM. PHIGS.D. Donald Hearn and Pauline Baker Computer Graphics.

Schilling. summary. Manipulator kinetics: Introduction. control of second order systems. (Computer Science and Engineering) . the mechanics and control of mechanical manipulators. rotations transformation: summary of interpretations. 1996. Addison. computational considerations. REFERENCE BOOKS: 1. actuators along with robot part programming. 58 . Introduction: Background. feedback and close loop control. Robert J.B. Fu.Tech. Gonzalez. John J. requirements of a robot programming . second-order linear systems. basing design on task requirements. C. “Fundamentals of Robotics – Analysis and Control”. mapping: changing descriptions from frame to frame. problem peculiar to robot programming languages. Linear control of manipulators: Introduction. Off-line programming systems: Introduction.Syllabus (Board of studies – 25th Feb 2006) L 06BCEE29 ROBOTICS 2 T 1 P C 3 Aim: This subject aims to cover basic concepts of Robotics Objective: Upon completion of the course. 2nd Edition 1999. transformation arithmetic. K. central issues in OLP systems. TEXT BOOK: 1. control system devices.G Lee. “Introduction To Robotics – Mechanics And Control”. link descriptions: link connection description. transform equations. Manipulator mechanism design: Introduction. the three level of robot programming. automating subtasks in OLP systems. a sample application.Wesley. “Robotics – Control Sensing Vision And Intelligence”.C. CIM-station. convention for affixing frames to links. more on representation of orientation transformation of free vectors. Prentice Hall Of India. R. McGraw-Hill Book Company 2. Craig.S. kinematic configuration position sensing force sensing. manipulator kinematics inverse manipulator kinematics: introduction solvability repeatability and accuracy. notations Spatial description and transformation : Introduction : description : positions orientation and frames. operators translators. student should be able to understand the concepts of spatial mechanisms and their principles of design. Robot programming language and systems : Introduction.S.

Adaptive Resonance Theory: Introduction. Neural Networks based on Competition: Kohonen Self –Organizing Maps: Architecture. Algorithm. Simon Haykin. Application. I. Introduction: Why Neural Networks and Why Now .Syllabus (Board of studies – 25th Feb 2006) 06BCE E31 NEURAL NETWORKS L 3 T 0 P C 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. Laurene Fausett. Analysis. ART1: Architecture. Analysis. Simple Neural Nets for Pattern Classification: General Discussion. (Computer Science and Engineering) . Theoretical Results: Derivation of Learning rules. 2004 REFERENCE BOOKS: 1. “Fundamentals of Neural Networks Architectures. ART2: Architecture. Algorithm. Algorithm. Analysis. pattern recognition techniques. Algorithm. Multi layer perceptrons. Algorithm. “Neural Networks – A Comprehensive Foundation. Algorithm. Algorithm.What is a neural Net . Associative memories and Holographic Pattern Recognition system. Perceptron: Architecture. 2000 Applications” 3rd 59 . Applications. “Neural Computing”. Applications. Bidirectional Associative Memory: Architecture. Pattern Association: Auto associative Net: Architecture. Hebb Net: Algorithm.B. Jackson. Application. 2nd Edition 2004. and Edition. TEXT BOOK: 1. Applications.Where are Neural Nets being used How are Neural Nets being used . IOP Publishing. Algorithm.R. Pearson Education. Applications. Learning Vector Quantization: Architecture.Tech.the McCulloch Pitt’s Neuron. Applications. Variations. Algorithms. Objectives: The students shall be able to understand the biological and artificial model of neuron. 2. Storage Capacity. Application. Multi Layer Neural Nets as Universal Approximators. Beale and T. Pearson Education. Back Propagation Net: Standard Back Propagation: Architecture. Applications.

60 . S.A. Objectives: The students would be able to understand and use concepts of OR.D. Billy. Gillet “Introduction to Operation Research”. Tata McGraw Hill 1982. two jobs through ‘m’ machines and ‘n’ jobs through ‘m’ machines.. reorder point (ROP) determination. They would be able to solve Inventory. Keder Nath Ram Nath & co.Initial solution – methods of improving the initial solution – traveling salesman problem – dynamic programming – principle of optimality. 3. Transportation and Assignment Problem. McGraw Hill Co. “Operation Research”.Syllabus (Board of studies – 25th Feb 2006) 06BCE E33 OPERATIIONS RESEARCH L 3 T 0 P C 3 Aim: This subject aims to introduce the operations research techniques such as Linear Programming. 2. Taha. 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).Tech.An Introduction”. Hamblin & Stevens Jr. dynamic programming. Maintenance and Replacement Problems: Models for routine maintenance and preventive maintenance decisions – replacement models that deteriorate with time and those fail completely. PERT & CPM Techniques – critical path – normal and crash time – resource allocation – resource leveling and smoothing. 1989. REFERENCE BOOKS: 1. S. (Computer Science and Engineering) . Integer Programming. Sequencing and Scheduling Problems: Job sequencing – ‘n’ jobs through two machines.B.. 2000. TEXT BOOK: 1. H. “Operation Research.. 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. Macmillan. B. “Operation Research”. Sharma. maintenance and replacement problems. Concept of OR: Concept and scope of operations research (OR) – Development of OR – phase of OR – Models in OR. such as Linear programming. 1974.

8. Tata McGraw-Hill.10. bilinear transform method of IIR filter design. computer-aided design of digital filters. And Ronald W. all pass transfer function. types of transfer functions. Algorithms. computational complexity of digital filter structures. (Computer Science and Engineering) .Tech. digital fm stereo generation.1 To 9.7. 61 . Design: preliminary consideration. computation of the discrete Fourier transform the quantization process and errors. Digital Signal Processors: Overview of Motorola dsp563xx family of digital signal processors. FIR design based on truncated Fourier series. Oppenhein. basic Finite Impulse Response(FIR) digital filter structures. Review of Basic Concepts: Signals and signal processing: characterization and classification of signals. musical sound processing. basic Infinite Impulse Response (IIR) filter structures. 9. architectures of dsp56307: assembly language instructions and programming: typical software applications. minimum-phase and maximum-phase transfer functions. 11. tunable iir digital filters. impulse invariance method of IIR filter design. equivalent structures. software implementation. design of digital IIR notch filters.6. short-term discrete Fourier transform. subband coding of speech and audio signals. Manolakis: DSP Principles. 1996. Schafer: Discrete – Time Signal Processing (Second Edition).4. parallel all pass realization of IIR transfer functions. all pass filters. the transfer function. John G. signal flow-graph representation. analysis of coefficient quantization effects. TEXT BOOK: 1. Mitra: Digital Signal Processing – A Computer –Based Approach. 2. complementary transfer functions. low pass IIR digital filter design. typical signal processing applications. state-space structures.Syllabus (Board of studies – 25th Feb 2006) 06BCE E35 DIGITAL SIGNAL PROCESSING L 3 T 0 P C 3 Aim: To understand the underlying the mathematics behind digital signal processors and designing various DSPs. Sanjit K. spectral analysis using dft. FIR filter design based on frequency sampling approach. Alan V. Digital Filters: Structures: block diagram representation. and Applications Prentice-Hall. discrete-time analytic signal generation. digital two-pairs. digital sine-cosine generator. Implementation. Prentice – Hall.8) REFERENCE BOOKS: 1.1 To 11. (Chapters 1. why digital signal processing . voice privacy system. Applications: Implementation consideration: basic issues. analysis of coefficient quantization effects in fir filters. cascaded lattice realization of IIR and FIR filters. Proakis & Dimitris G.1 To 8. typical signal processing operations. 1998.Transform-domain representations of Linear Time Invariant (LTI) systems: the frequency response. spectral transformations of IIR filters. examples of typical signals. 1998. discrete-time processing of random signals. stability test. Representative applications: dual – tone multifrequency signal detection.B. Objective: To design a appropriate filter and evaluate its efficiency by comparing with various design methods. Examples.3.

Tech. the user. knowledge-based DSS & AI concepts and definitions. decision analysis of a few alternatives. DSS configuration: Characteristics. the technology of GDSS. negotiation. evaluation. decision making in groups. The GDSS meeting process: Constructing a GDSS and the determinants of its success. uncertainty and risk. treating certainty. systems models. introduction and definitions. model base management. OLAP: data access and mining. 1998. database management systems in DSS. mss modeling in spreadsheets. TEXT BOOK: 1. static and dynamic models. ready-made quantitative software packages. GDSS software idea generation. AI verses natural intelligence. the AI field. group DSS.Syllabus (Board of studies – 25th Feb 2006) 06BCE E37 DECISION SUPPORT SYSTEM** L 3 T 0 P C 3 Aim: To provide an environment to understand the system and to make decisions. executive information (support) systems. expert systems. the goal of GDSS and its technology levels. The need for computerized decision support technologies. the DSS of the future. how AI differs from conventional computing. Efrain Turban and Jay E. Objectives: The students will be capable of designing the decision support system for managers to take the decision. the evolution and attributes of computerized decision aids. Prentice-Hall. “Decision Support Systems and Intelligent Systems”. artificial neural networks. data collection and data problems. the modeling process. data warehousing. Aronson. GDSS research challenges Modeling for mss. Support systems. distinguishing DSS from management science and MIS. intelligent database and data mining. visual spreadsheets. and visualization. Database organization and Structure: Data warehousing. Heuristic Programming: Simulation.B. (Computer Science and Engineering) . capabilities. data visualization and multidimensionality. access. querying and analysis. the DSS development process. visual modeling and simulation. a framework for decision support. and components of DSS. classifications of DSS. types of knowledge-based DSS. influence diagrams. group decision support systems. analysis. 62 . hybrid support systems. Fifth Edition. the internet and commercial database services. knowledge in AI. the decision (electronic meeting) room. Intelligent DSS: The future of AI. DSS hardware. DSS construction. financial and planning modeling. optimization. multidimensional modeling. the nature and sources of data. the concept of decision support systems.

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master Your Semester with a Special Offer from Scribd & The New York Times

Cancel anytime.