(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


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.TECH – COMPUTER SCIENCE & ENGINEERING (For Students admitted during the Academic Year 2006 – 2007 and thereafter) THIRD SEMESTER: S.Syllabus (Board of studies – 25th Feb 2006) VELLORE INSTITUTE OF TECHNOLOGY. (Computer Science and Engineering) .14 School of Computer Sciences COURSE – B.B.Tech.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 . VELLORE .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. 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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

B.. B. 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. Objective : To assemble a PC and identify the frequently occurring errors and troubleshooting appropriately. Hard disk up gradation – DOS and Software – Preventive Maintenance – System Usage – Trouble Shooting – Nature and Types of Faults – Trouble – shooting Tools – Fault Elimination Process – Systematic Trouble – shooting – Post – Motherboard Problems – Diagnosis – FDC – FDD. Tata McGraw Hill. Hardware Components and ICS Microprocessors in PC Intel 8088 – Internal Organisation – Bus cycle – 8088 Operation – I/O Addressing – Interrupt Handling – 8088 Instruction – Coprocessor – Support chips in the Mother board – Dump and Smart Chips – Clock Generator 8284 – Bus controller – Interrupt controller 8259A – Programmable Interval Timer 8253 – 8255A-5 PPI .DMA Controller 8237A-5 Mother board circuits Motherboard functions – Reset Logic – CPU Nucleus Logic – DMA Logic – Wait state logic – Bus Arbitration – RAM Logic – ROM Logic – ROM Decode Logic – RAM Parity Logic – NMI – Logic – I/O Ports Decode Logic – Time of day (TOD) Logic – Dynamic Memory Refresh Logic – Speaker Logic – Mode switch Input Logic Keyboard Interface – coprocessor Unit – Control Bus Logic – Address Bus Logic – Data Bus Logic – I/O slot signals – New generation Mother Board – Mother Board Connectors and Jumpers – Design Variations – SMPS – Printer controller – Floppy Disk Controller. Ltd. Hard Disk / Display Controller Subsystem Display Adaptor – CRT Display – CRT Controller Principle – CRT Controller Motorola 6845 – MDA Design Organisation – Colour – Graphics Adapter – Advanced Graphics adapters – New Generation display Adapters – Display Adapters – Device Interface – Auxiliary Subsystems – Serial Port in PC – RTC – LAN Installation and Preventive Maintenance Pre – Installation Planning – Practice – Routine Checks – Special Configurations – Memory. 40 . “IBM PC and Clones Hardware. Trouble Shooting and Maintenance”. HDC. 1993. REFERENCE BOOK: 1. (Computer Science and Engineering) .Tech. HDD Problems – Over view of Advanced PCs. Pub. 6th Reprint.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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Steven Harrington. Van Dam A. Introduction to Computer Graphics: Display devices – Hardcopy devices – Interactive input devices – Display processors – Graphic Adapters – basic function – Monochrome adapters. "Computer Graphics.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. 2000. games graphs and charts animation – Introduction of graphics and kernel system (GKS) – binding language for GKS – programming examples using GKS. TEXT BOOK: 1. video monitors – Graphic software – Output primitives – Line and circle drawing algorithms – Attributes of output primitives Two-Dimensional Transformation: Clipping and windowing – Clipping algorithms – Segmented display files – Display file compilation – Modeling and modeling transformation Interactive Input Methods: Physical devices – Logical classification of input devices – Interactive picture construction techniques – Input functions (9). 2D and 3D transformations.D.A programming approach".. Image processing.B. REFERENCE BOOKS: 1. 2. Prentice Hall. Computer Graphics Applications: CAD/CAM. 2D and 3D modeling. New Delhi. PHIGS. Objectives: The student would be able to understand and use Computer Graphics various Clipping algorithms. Addison Wesley. 1986. "Fundamentals of Interactive Computer Graphics". VLSI. 1990 57 . McGraw Hill. 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). Donald Hearn and Pauline Baker Computer Graphics.Tech. Foley J. (Computer Science and Engineering) .

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

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

2000. 1989. dynamic programming. (Computer Science and Engineering) . PERT & CPM Techniques – critical path – normal and crash time – resource allocation – resource leveling and smoothing.. 2. Linear Programming-Methods of solution – graphical and SIMPLEX methods of solution VARIATIONS – duality in LP – revised SIMPLEX method – applications for business and industrial problem. reorder point (ROP) determination. Sequencing and Scheduling Problems: Job sequencing – ‘n’ jobs through two machines. Concept of OR: Concept and scope of operations research (OR) – Development of OR – phase of OR – Models in OR. 1974. maintenance and replacement problems. TEXT BOOK: 1.A.An Introduction”. Transportation and Assignment Problem. B. S. Sharma. Gillet “Introduction to Operation Research”. Billy. Objectives: The students would be able to understand and use concepts of OR. Hamblin & Stevens Jr. “Operation Research”.Initial solution – methods of improving the initial solution – traveling salesman problem – dynamic programming – principle of optimality. Taha. Inventory Problems: Deterministic model – costs decision variables – economic order quality – instantaneous and non-instantaneous receipt of goods with and without shortage – quality discount – probabilistic inventory model – inventory systems – safety stock – reorder level (ROL). McGraw Hill Co. Integer Programming.. S. Maintenance and Replacement Problems: Models for routine maintenance and preventive maintenance decisions – replacement models that deteriorate with time and those fail completely. 3.B.Tech. two jobs through ‘m’ machines and ‘n’ jobs through ‘m’ machines. They would be able to solve Inventory. REFERENCE BOOKS: 1.. Integer Programming: Formulation – graphical representation – Gomory’s cutting plane method. Tata McGraw Hill 1982.D. Macmillan. such as Linear programming. 60 . Keder Nath Ram Nath & co. “Operation Research. H. “Operation Research”.Syllabus (Board of studies – 25th Feb 2006) 06BCE E33 OPERATIIONS RESEARCH L 3 T 0 P C 3 Aim: This subject aims to introduce the operations research techniques such as Linear Programming.

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

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

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.