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





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



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

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



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


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


Tech.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. 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.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. VELLORE .No 17 18 19 20 21 22 23 24 25 Sub Code 06BCE 301 06BCE 303 06BCE 305 06BCE 307 06BCE 309 06BCE 311 06BCE 313 L 06BCE 315 L Subject Discrete Mathematical Structures* Internet Programming Computer Architecture And Organisation* Computer and Communication Networks Theory of Computation* Soft Computing Net working Lab Internet Programming Lab Project TOTAL Lec 2 2 3 3 3 3 Periods/Week Tut Pra Proj 1 1 0 0 0 0 2 2 12 6 4 2 2 Credits 3 3 3 3 3 3 2 2 2 24 * COMMON BETWEEN CSE & IT ***FREE ELECTIVES 4 .Syllabus (Board of studies – 25th Feb 2006) VELLORE INSTITUTE OF TECHNOLOGY.B. (Computer Science and Engineering) .

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. 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 . Proj Credits 3 3 3 3 3 3 2 2 2 4 28 SEVENTH SEMESTER: S. Sub Code Subject No .No Sub Code .B.Tech.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 . (Computer Science and Engineering) .Syllabus (Board of studies – 25th Feb 2006) SIXTH SEMESTER: S. 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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.


P 2

C 2


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


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

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.


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

HDC. Trouble Shooting and Maintenance”. Govindarajulu. B. HDD Problems – Over view of Advanced PCs. Pub. 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. 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. (Computer Science and Engineering) . Tata McGraw Hill. Hard Disk / Display Controller Subsystem Display Adaptor – CRT Display – CRT Controller Principle – CRT Controller Motorola 6845 – MDA Design Organisation – Colour – Graphics Adapter – Advanced Graphics adapters – New Generation display Adapters – Display Adapters – Device Interface – Auxiliary Subsystems – Serial Port in PC – RTC – LAN Installation and Preventive Maintenance Pre – Installation Planning – Practice – Routine Checks – Special Configurations – Memory.B.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.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. REFERENCE BOOK: 1. 40 . 1993. “IBM PC and Clones Hardware.. 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 .Tech. Ltd. 6th Reprint.

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

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

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

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.Tech.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Sign up to vote on this title
UsefulNot useful