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

(Computer Science and Engineering) . 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.Tech.B.Syllabus (Board of studies – 25th Feb 2006) VELLORE INSTITUTE OF TECHNOLOGY. VELLORE .TECH – COMPUTER SCIENCE & ENGINEERING (For Students admitted during the Academic Year 2006 – 2007 and thereafter) THIRD SEMESTER: S.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.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 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.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.Syllabus (Board of studies – 25th Feb 2006) SIXTH SEMESTER: S.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.B. Proj Credits 3 3 3 3 3 3 2 2 2 4 28 SEVENTH SEMESTER: S.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 . 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 . (Computer Science and Engineering) . Sub Code Subject No .

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

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

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

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

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

Leach. TEXT BOOK: 1. error detection – reflection – alphanumeric codes. A. Thomas C. design steps involved in flipflop.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. McGraw Hill 1999. 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. "Digital Design". Floating point representation. Third Edition.B. P. 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. Computer Design: Computer configuration – instructions and data formats instruction sets timing and control execution of instruction – design of computer. 2. Malvino and D. understand the memory representation in ROM. shift register and designing a simple computer which is capable of providing few arithmetic and logical operations.status register effect of O/P carry – design of shifter – processor unit – design of accumulator. P. logic gate fundamentals. Boolean algebra. Boolean logic. Mano.Tech. function of flip-flop and shift register. Tata McGraw Hill 1997.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. Control Logic Design: Control organization – PLA control – microprogram control hardwired control microprogram sequencer – microprogrammed CPU organization. "Computer Architecture Logic Design". Codes. “Digital Principles and Applications”. Prentice Hall India. Bartee. arithmetic and Logic unit. 11 . (Computer Science and Engineering) . Processor Organization: Memory unit – inter register transfer – micro operations bus organization scratch pad memory – ALU – design of ALU . 2001 REFERENCE BOOKS: 1. Basic laws. Objectives: The students shall be able to understand Boolean laws. theorems and properties of Boolean algebra – Boolean functions – canonical and standard forms logical operations – logic gates – Karnaugh map up to 6 variables – Sum of Products (SOP) and Product of Sums (POS) simplification with don’t care condition – tabulation method. RAM and CPU.Binary decimal. Sequential Logic Design. Morris M. 4th edition.

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

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

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

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

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

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

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

and basic band pass digital communication systems. A. “Analog and Digital Communication Systems”. Spectral analysis and random process Spectral characteristics of periodic and aperiodic signals – spectra of common signals related to communication – cross correlation – auto-correlation and power / energy density spectra – random signals and process. 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. “Digital Communication”. 1992 19 . “Principles of Communication”. base band pulse shaping – binary data formats – base band transmission – Intersymbol Interference (ISI) – correlative coding – optimum SNR – matched filter detection.B. 1992 2. “Principles of Communication”. B.B. Tata McGraw Hill Publication. Proakis.Lathi. 1992 3. FM & PM systems performance – threshold effects reduction Base band data communication Sampling & quantization – PCM. Analog modulation systems Basic principles of Amplitude Modulation (AM). 1990 2. “Communication Systems”. PHI. (Computer Science and Engineering) . McGraw Hill. ADPCM.P. PHI. 1990 REFERENCE BOOKS: 1. Carlson.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. Amplitude modulation and demodulation techniques.Tech. DM. McGraw Hill. Taub & Schilling. TEXT BOOKS: 1. Simon Haykins. Frequency Modulation (FM) & Phase Modulation (PM) – spectra – power consideration – receiver’s characteristics and deduction of AM. ADM.

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

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

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

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

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

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

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

Turing Machines: Church Turing hypothesis – Turing machine as language acceptors – Partial function – Non – deterministic Turing Machine – Universal Turing Machines – Applications. and simply solvable or it cannot be solved. Non – determinism and kleenes theorem – pumping lemma – Decision problems. 3rd Edition. Regular expressions and Regular languages Finite Automata and its minimization. “Introduction to Languages and the Theory of Computation”. Chandrasekaran.B. TEXT BOOK: 1. Tata McGraw Hill. Automata Theory and Abstract models of Computation and Computability.Tech. 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. 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. Overview: An overview of grammars and languages. K. John C. efficiently solvable. 29 . They would be able to analyze the problems by determining whether a problem is solvable. Construction of NFA and DFA from Regular expressions. REFERENCE BOOK: 1. 1998. Unsolvable Problems & Computable Functions: Rice theorem – Halting problem – Post’s correspondence Problem – Primitive recursive functions – Godel Numbering – Recursive and recursively enumerable languages. 1997. Martin.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. Computational complexities and NP – Completeness. N. (Computer Science and Engineering) . Conversion of NFA into DFA Theorem & Problem: Chomsky hierarchy of language. 2nd Edition.P Mishra. Prentice Hall of India.L. "Theory of Computation".

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

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

(Computer Science and Engineering) . T P C 2 2 1.B. 32 .Tech. HTML and JAVA Mini-project has to be completed and submitted.Syllabus (Board of studies – 25th Feb 2006) L 06BCE315L INTERNET PROGRAMMING LAB Exercises on inter networking involving CGI. 2. student information system etc. Develop a stand-alone java application program that exploits the graphics processing capability of the java language. On a computer network consisting of WINDOWS NT LINUX/UNIX machine running a web server software and client machines running a browser. develop html and CGI programs in java for web based applications like bank transaction. The evaluation is based on the demonstration and viva. The student has to submit a report to the examiner.

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

B. Stephen R. Introduction to Web – Based Systems. Maintenance. Reuse.Tech. Tools. ObjectOriented Analysis Workflow. state transition diagrams. Benefits and Risks of Object Oriented development Introduction to Object-Oriented Paradigm and UML: Unified Process. TEXT BOOK: 1. UML and related methodologies. REFERENCE BOOK: 1. Documentation. the Requirement Workflow. Management Issues. Teams. 2003 34 .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. Elements of object model. Object Model: Evolution. Objectives: The students would be able to understand the techniques. decomposing complexity. Interaction diagrams. macro development process. process diagrams. Analysis and Design: Case studies. Release management. module diagrams. Object-Oriented Design Workflow. Designing complex systems. micro development process. Principles. Management and planning: Staffing. User Interface system. 1994. Testing. Schach. Planning and Estimating. Quality Assurance and Metrics. Grady Booch. Workflow and phases of the Unified process. Addison Wesley. applications and UML based object oriented analysis and design. Complexity of software: Structure of complex systems. Applying object model Elements of Notation: Class diagrams. applying the notation. object diagrams. "Object Oriented Analysis and Design with applications". (Computer Science and Engineering) . "An Introduction to Object-Oriented Systems Analysis and Design with UML and the Unified Process".. Tata McGraw Hill.

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

Inc. Deadlocks Memory. Abraham Silberschatz. Prentice Hall of India.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. scheduling algorithms and distributed file systems Objectives : The students would be able to understand and explain various OS concepts such as time-sharing. John Wiley & Sons. Peter Baer Galvin. Security Case Study: The Linux System.B. (Computer Science and Engineering) . CPU scheduling algorithms. Deadlock prevention. Memory Management. Fourth Edition 36 .Tech. I/O Systems. Multiprogramming. windows 2000. Distributed Coordination. File-System Implementation. Stallings William. Operating-System Structures Process Management: Processes. Process Synchronization. TEXT BOOK: 1. CPU Scheduling. "Operating System Concepts". Parallel. Distributed systems. Introduction: Computer-System Structures. Semaphores and Critical regions. memory management. processes & Threads. Greg Gagne. Mass-Storage Structure Distributed System: Distributed System Structures. Threads. 6th Edition REFERENCE BOOK: 1. Virtual Memory. Protection. "Operating Systems". Windows 2000. File-System Interface. I/O systems and File Systems They would be able to use Linux system. Distributed File Systems. File & IO Management: Memory Management.

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

Tech.B.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. 38 . (Computer Science and Engineering) .

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

Tata McGraw Hill. Ltd. 6th Reprint. REFERENCE BOOK: 1.B. Govindarajulu. Pub. B. “IBM PC and Clones Hardware. HDD Problems – Over view of Advanced PCs.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. Objective : To assemble a PC and identify the frequently occurring errors and troubleshooting appropriately.Tech. Trouble Shooting and Maintenance”. 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 . 40 .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. (Computer Science and Engineering) . Hard disk up gradation – DOS and Software – Preventive Maintenance – System Usage – Trouble Shooting – Nature and Types of Faults – Trouble – shooting Tools – Fault Elimination Process – Systematic Trouble – shooting – Post – Motherboard Problems – Diagnosis – FDC – FDD.. HDC. 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. 1993.

programming models and Interprocess communication. Practice & Design”.B. CMP Books. Tata McGraw Hill. software engineering practices in embedded systems development and Inter process communication. Introduction to Embedded Systems: Processor in the System – Software Embedded into a system – Exemplary Embedded Systems – Embedded System-On-chip and in VLSI Circuit Processor and Memory Organization – Structural Units in a Processor – Processor Selection for an Embedded System – Memory Devices – Memory Selection for an Embedded System – Allocation of Memory to Program Segments and Blocks and Memory Map of a System – Direct Memory Access – Interfacing Processor. “Embedded Systems-Application. Rajkamal.Tech. PCI. Arnold S. ‘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. TEXT BOOK: 1. Deadline and Interrupt Latency Program Modeling Concepts: Single and Multiprocessor Systems Software – Development Process. Berger. Objectives: The student would be able to understand and use in embedded systems.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. 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. Memories and I/O Devices. Devices and Buses for Device Networks: I/O Devices – Timer and Counting Devices – Serial Communication Using the I2 C. their design and applications.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. 1997 41 . “Embedded Systems Design”. (Computer Science and Engineering) . device drivers. 2003 REFERENCE BOOKS: 1. Task & Threads – Multiple processes in an Application – Problems of Sharing Data by Multiple Tasks & Routines – Interprocess Communication. 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.

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

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

Tech. 44 .B. (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.

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

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

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

fact data and dimension data. Major issues in Data mining. (Computer Science and Engineering) . To sail along with the various approaches in data mining. TEXT BOOK: 1. summary table. 48 . To familiarize with the various data warehousing and data mining tools Data Warehouse and OLAP Technology for Data mining: Introduction to Data Warehouse.Tech. Data mining applications. “Data Mining: Concepts and Techniques”.Data Mining Query language – Designing Graphical User interfaces based on DMQL Architecture of Data mining.Mining single dimensional Boolean association rules from transactional databases. Objectives : To make familiar with the various concepts of data warehousing like meta data. Immon. 3rd Edition. Classification & prediction: What’s classification . 2. “Building the Data Warehouse”. 2003. & Kambler. Wiley Dream Tech. “Data Warehousing in the Real World”.. D.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. Data Mining primitives. 2005. Data Mining Introduction: Introduction to Data Mining – Data Mining Functionalities – Classification of Data Mining systems.issues regarding classification and prediction – Bayesian classification – prediction: linear – non linear. Han J. data mart..Data cleaning – Data integration and Transformation. Murray. Cluster analysis: Types of Data in cluster analysis .A multidimensional Data Model – Data Warehouse architecture – Data preprocessing.W. REFERENCE BOOKS: 1. Association Rule Mining: Basic concepts – market basket analysis . Anahory S. M. 1st Edition. 1997.H. languages & system architecture: Data Mining primitives: Task – relevant data – kind of knowledge to be mined – Background knowledge – interestingness measures– presentation & visualization of discovered pattern .Major clustering methods. Addison Wesley.B. Morgan Kaufmann.

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

NET Framework. WP Publishers and Distributors. Microsoft Visual Basic . Rick Leinecker ASP.file I/O – serialization. Writing Web Application with the .NET framework.NET C# Language Fundamentals: Object Oriented Programming in C#. (Computer Science and Engineering) .NET.Remoting -XML Parsing-Security. 2001 2. Advanced Concepts. 2003 3. .NET. Writing GUI Applications with . C#.NET framework. 2003 50 .NET Introduction to Microsoft . Threading NET Framework Concepts II: Reflection. .NET Framework.Tech. Objectives: After completion of this course the students will be able to undergo projects in .NET Platform: Building Blocks of . Microsoft C# Language specification.B. Introduction to Web Services: Writing Mobile Application with . MSDN. TEXT BOOK: 1. 2003 REFERENCE BOOKS: 1. WP Publishers and Distributors. WP Publishers and Distributors.NET Framework Concepts I: console I/O-working with strings-formatting and conversion.NET Framework: Introduction to ADO. Ltd.NET on the edge. IDG Books India Pvt.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 . MSDN. MSDN.

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

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

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

physical models. Introduction to Information theory Compression techniques. Arithmetic codes: Overview. comparison of huffman and arithmetic coding. Wavelet transforms and data compression introduction. Morgan Kaufmann Publications. “Introduction to Data Compression”. huffman coding algorithm. coding a sequence. run length encoding. Rao. Gray) algorithm. Second Edition. Buzo. transform coding. non binary huffman codes. TEXT BOOK: 1. applications. progressive image transmission. Ltd. Transform coding Different transforms. Ralf Steinmetz and Klara Nahrsedt.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. Adaptive Differential Pulse Code Modulation (ADPCM). lossy compression. “Multimedia Computing and Communication and Applications”. measures of performance. Various compression coding techniques Huffman coding: Good codes. advantages LBG (Linde.. other approaches. application to image compression. introduction to information theory. adaptive huffman codes. minimum variance huffman codes. length of huffman codes. Pearson Education. other vector quantization schemes. empty cell problem. 54 . 1996. probability models. (Computer Science and Engineering) . Khalid Sayood. facsimile encoding. tree structured vector quantizer. applications. speech coding. markov models. Raghuveer M. REFERENCE BOOKS: 1. Addison Wesley Pub. delta modulation. modeling and coding. Discrete Wavelet Transforms (DWT) for image compression. Codebook Initialization. extended huffman codes. JPEG Compression. Quantization and coding of transforms. 2000. lossless compression. models. 2.B. basic algorithm. Machine Learning Differential coding Overview. video coding using multi-resolution techniques.Tech. Vector quantization: Introduction. audio compression. 1998. introduction. Mathematical preliminaries: Overview. Differential Pulse Code Modulation(DPCM). Co. “Wavelet Transforms: Introduction to Theory and Applications”. generating a binary code. Lossless image compression and vector quantization Lossless image compression: Introduction. Constant Factor Delta Modulation (CFDM).

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

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

New Delhi. Computer Graphics Applications: CAD/CAM. VLSI. Foley J. 1986. 3D concepts: Methods of 3D representation – 3D transformations – Viewing – 3D clipping – Hidden – Surface and Hidden – line elimination – shading and coloring methods – Basic modeling concepts and modeling methods (10). "Computer Graphics. Donald Hearn and Pauline Baker Computer Graphics.B.D.Tech. Objectives: The student would be able to understand and use Computer Graphics various Clipping algorithms. 2.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. games graphs and charts animation – Introduction of graphics and kernel system (GKS) – binding language for GKS – programming examples using GKS. "Fundamentals of Interactive Computer Graphics". TEXT BOOK: 1.A programming approach". 1990 57 . 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). Introduction to Computer Graphics: Display devices – Hardcopy devices – Interactive input devices – Display processors – Graphic Adapters – basic function – Monochrome adapters. 2D and 3D modeling. Prentice Hall. Addison Wesley. PHIGS. (Computer Science and Engineering) . 2D and 3D transformations. REFERENCE BOOKS: 1. Van Dam A. Image processing.. 2000. Steven Harrington. McGraw Hill.

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

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

S. “Operation Research.. Keder Nath Ram Nath & co. Macmillan. Integer Programming. 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).An Introduction”.D.Initial solution – methods of improving the initial solution – traveling salesman problem – dynamic programming – principle of optimality. (Computer Science and Engineering) . Concept of OR: Concept and scope of operations research (OR) – Development of OR – phase of OR – Models in OR. Objectives: The students would be able to understand and use concepts of OR. Taha. Sharma.. TEXT BOOK: 1.B. 3. PERT & CPM Techniques – critical path – normal and crash time – resource allocation – resource leveling and smoothing. S. Hamblin & Stevens Jr. Transportation and Assignment Problem. Billy. dynamic programming. 60 .Tech. “Operation Research”. reorder point (ROP) determination. maintenance and replacement problems.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. B. Integer Programming: Formulation – graphical representation – Gomory’s cutting plane method. Sequencing and Scheduling Problems: Job sequencing – ‘n’ jobs through two machines. two jobs through ‘m’ machines and ‘n’ jobs through ‘m’ machines. such as Linear programming.. H. Tata McGraw Hill 1982. They would be able to solve Inventory. McGraw Hill Co. Maintenance and Replacement Problems: Models for routine maintenance and preventive maintenance decisions – replacement models that deteriorate with time and those fail completely.A. 1974. REFERENCE BOOKS: 1. Linear Programming-Methods of solution – graphical and SIMPLEX methods of solution VARIATIONS – duality in LP – revised SIMPLEX method – applications for business and industrial problem. 1989. 2000. Gillet “Introduction to Operation Research”. 2. “Operation Research”.

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

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

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.