(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 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.No 9 10 11 12 13 14 15 16 Sub Code 06BCE202 06BCE 204 06BCE 206 06BCE 208 06BCE 210 06BCE 212 06BCE 214L 06BCE 216L Subject Probability.B. (Computer Science and Engineering) . VELLORE .TECH – COMPUTER SCIENCE & ENGINEERING (For Students admitted during the Academic Year 2006 – 2007 and thereafter) THIRD SEMESTER: S.14 School of Computer Sciences COURSE – B.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 .Tech.Syllabus (Board of studies – 25th Feb 2006) VELLORE INSTITUTE OF TECHNOLOGY.

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 .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. (Computer Science and Engineering) .Tech.No Sub Code .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 . Proj Credits 3 3 3 3 3 3 2 2 2 4 28 SEVENTH SEMESTER: S.B. Sub Code Subject No .Syllabus (Board of studies – 25th Feb 2006) SIXTH SEMESTER: S. Peripherals Interfacing and Trouble 35 06BCE 401 Shooting 36 06BCE 403 Embedded Systems 37 06BCE 405 Network Security ELECTIVE – II (FREE 38 ELECTIVES) ELECTIVE – III (SCHOOL 58 SPECIFIC ELECTIVES) 59 06BCE 413 L Peripherals Interfacing Lab 60 06BCE 415 L Embedded Systems Lab 61 Project Total * * SCHOOL SPECIFIC ELECTIVES EIGHTH SEMESTER: S.

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

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

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

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

Structural Characterization Characterization of Nanostructures – Geometrical Characterization – Layer Dimensions – Structures that Assist Measurement Characterization of Composition of Layers and Surfaces – Atomic Composition – Characterization of the Chemical Surface – Functional Characterization of Nanostructures. WILEY –VCH publications 10 . Introduction The Nanoworld . Pulickel M Ajayan. their Characterization and their potential applications in various fields Objective: The students would become aware of various fabrication principles behind nanostructure preparation. Linda S. Synthesis of Nano Materials Preparation of Nanostructures – Principles of Fabrication – Subtractive and Additive Creation of Nanostructures – Nanolithography – Structure Transfer by Electromagnetic Radiation – EUV and X-Ray Lithography – Electron Beam Lithography. Types of Bonding Molecular Basis of Nanotechnology – Particles and Bonds – Chemical Bonds in Nanotechnology – Vander Walls Interactions – Dipole – Dipole Interactions – Ionic Interactions – Metal Bonds Covalent bonds – Coordinate Bonds – Hydrogen bridge bonds – Polyvalent bonds – Assembly of Complex Structures through Internal Hierarchy of Bonding.Atomic beam Lithography – Nanofield Generation by Optical Nearfield Probes. Nanosensors as Optical Actuators – Magnetic Nanotransducers – Chemical Nanoscale Sensors and Actuators.Nanostructures as Optical Sensors. Wolfgang Fritzche “Nanotechnology – An Introduction to Nanostructuring techniques” .B.from Micro to Nanostructures – Definition of Nanostructures – Insight into the Nanoworld Building Blocks of Nanotechnology – Interactions and Topology – The Microscopic Environment of the Nanoworld. WILEY –VCH publications 2.Syllabus (Board of studies – 25th Feb 2006) L 06BCE207 INTRODUCTION TO NANO TECHNOLOGY 2 T 1 P C 3 Aim: The subject covers the basic principles behind Nanostructures. “Nanocomposite Science”. what characterizations of nanostructures can be measured and in which domains in can be applied. Paul U Braun. 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 . Text/Reference Books: 1. (Computer Science and Engineering) .Schadler.Tech. Michel Kohler.

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

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

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

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

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

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

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

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

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

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

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

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.


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.