(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


14 School of Computer Sciences COURSE – B.No 9 10 11 12 13 14 15 16 Sub Code 06BCE202 06BCE 204 06BCE 206 06BCE 208 06BCE 210 06BCE 212 06BCE 214L 06BCE 216L Subject Probability. (Computer Science and Engineering) .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. 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.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.B.Tech. VELLORE .TECH – COMPUTER SCIENCE & ENGINEERING (For Students admitted during the Academic Year 2006 – 2007 and thereafter) THIRD 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.Syllabus (Board of studies – 25th Feb 2006) SIXTH SEMESTER: S.I Linux System Programming Lab Operating System Lab Inplant Training Project Total 2 3 2 3 2 3 Periods / Week Tut 1 0 1 0 1 0 2 2 12 6 4 2 4 6 Pra Inp.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) .No Sub Code . Proj Credits 3 3 3 3 3 3 2 2 2 4 28 SEVENTH SEMESTER: S. 26 27 28 29 30 31 32 33 34 06BCE302 06BCE 304 06BCE 306 06BCE 308 06BCE 310 06BCE 312 06BCE 314 L 06BCE 316 L Subject Lec Programming Langauage Processors Object Oriented Analysis and Design Linux System Programming Operating Systems* Graph Theory And its Application Elective . Sub Code Subject No .Tech.B.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

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

Cancel anytime.