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

B.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) . 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.No Sub Code . Sub Code Subject No .Syllabus (Board of studies – 25th Feb 2006) SIXTH SEMESTER: S. 26 27 28 29 30 31 32 33 34 06BCE302 06BCE 304 06BCE 306 06BCE 308 06BCE 310 06BCE 312 06BCE 314 L 06BCE 316 L Subject Lec Programming Langauage Processors Object Oriented Analysis and Design Linux System Programming Operating Systems* Graph Theory And its Application Elective .Tech. Proj Credits 3 3 3 3 3 3 2 2 2 4 28 SEVENTH SEMESTER: S.No 63 Sub Code 06BCE 402 Project TOTAL Subject Lec 2 2 2 2 Periods/Week Pra Com Tut 1 1 1 1 2 2 2 Proj Credits 3 3 3 3 2 2 2 6 30 12 6 4 2 6 6 Periods/Week Lec Tut Pra Credits 28 28 5 .

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

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

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

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

Tech. their Characterization and their potential applications in various fields Objective: The students would become aware of various fabrication principles behind nanostructure preparation.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.B.Nanostructures as Optical Sensors. 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. Wolfgang Fritzche “Nanotechnology – An Introduction to Nanostructuring techniques” . (Computer Science and Engineering) . Nanosensors as Optical Actuators – Magnetic Nanotransducers – Chemical Nanoscale Sensors and Actuators.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.Schadler. Synthesis of Nano Materials Preparation of Nanostructures – Principles of Fabrication – Subtractive and Additive Creation of Nanostructures – Nanolithography – Structure Transfer by Electromagnetic Radiation – EUV and X-Ray Lithography – Electron Beam Lithography. Paul U Braun. WILEY –VCH publications 10 . what characterizations of nanostructures can be measured and in which domains in can be applied. 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. Text/Reference Books: 1. Introduction The Nanoworld . Applications Applications – Nanotransducers – Nanochemical Sensors – Nanoelectronic Devices – Electrical Contacts and Nanowires – Quantum dots and Localization of Elementary particle – Nanodiodes – Nanoswitches – Molecular Switches and Basic Elements . Pulickel M Ajayan. “Nanocomposite Science”. Linda S. Michel Kohler.

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

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

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

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

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

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

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

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

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

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

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

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.


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

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

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

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

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

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

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

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

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

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

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

Distributed Coordination. windows 2000. Process Synchronization. processes & Threads. Deadlock prevention. Security Case Study: The Linux System. Windows 2000. memory management. I/O Systems. Peter Baer Galvin. Greg Gagne. Distributed systems.Syllabus (Board of studies – 25th Feb 2006) 06BCE 308 OPERATING SYSTEMS * L 3 T 0 P C 3 Aim: This subject aims to introduce operating system concepts such as processes & threads. "Operating System Concepts". I/O systems and File Systems They would be able to use Linux system. Abraham Silberschatz. CPU Scheduling. Multiprogramming. Inc. John Wiley & Sons. File & IO Management: Memory Management. (Computer Science and Engineering) . scheduling algorithms and distributed file systems Objectives : The students would be able to understand and explain various OS concepts such as time-sharing. Prentice Hall of India. Stallings William. "Operating Systems". File-System Implementation. Operating-System Structures Process Management: Processes. Protection.B. Deadlocks Memory. Parallel. Mass-Storage Structure Distributed System: Distributed System Structures. Threads.Tech. Semaphores and Critical regions. File-System Interface. 6th Edition REFERENCE BOOK: 1. Introduction: Computer-System Structures. Memory Management. TEXT BOOK: 1. Distributed File Systems. CPU scheduling algorithms. Fourth Edition 36 . Virtual Memory.

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

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

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

HDC. 6th Reprint. Tata McGraw Hill. 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. 40 . B.Tech.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. (Computer Science and Engineering) . “IBM PC and Clones Hardware. 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.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. Govindarajulu. REFERENCE BOOK: 1. Trouble Shooting and Maintenance”. 1993. Ltd.B. Hardware Components and ICS Microprocessors in PC Intel 8088 – Internal Organisation – Bus cycle – 8088 Operation – I/O Addressing – Interrupt Handling – 8088 Instruction – Coprocessor – Support chips in the Mother board – Dump and Smart Chips – Clock Generator 8284 – Bus controller – Interrupt controller 8259A – Programmable Interval Timer 8253 – 8255A-5 PPI .. Pub. HDD Problems – Over view of Advanced PCs. 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.

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

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

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

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

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

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

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

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

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

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

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

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

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

Transform coding Different transforms. Addison Wesley Pub. applications. Buzo. extended huffman codes. generating a binary code. Lossless image compression and vector quantization Lossless image compression: Introduction. applications. Adaptive Differential Pulse Code Modulation (ADPCM).Tech. JPEG Compression. “Introduction to Data Compression”. advantages LBG (Linde. facsimile encoding. 1998. Morgan Kaufmann Publications. Ltd. delta modulation. 2000. transform coding. 2. Ralf Steinmetz and Klara Nahrsedt. Constant Factor Delta Modulation (CFDM).. Mathematical preliminaries: Overview. lossy compression. Various compression coding techniques Huffman coding: Good codes.B. Khalid Sayood. 1996. Raghuveer M. modeling and coding. huffman coding algorithm.Syllabus (Board of studies – 25th Feb 2006) 06BCEE23 DATA COMPRESSION TECHNIQUES L 2 T 1 P C 3 Aim: This subject aims to cover standard compression techniques Objectives: The students would be able to understand and design new compression techniques. speech coding. other vector quantization schemes. run length encoding. models. “Wavelet Transforms: Introduction to Theory and Applications”. tree structured vector quantizer. Codebook Initialization. adaptive huffman codes. physical models. REFERENCE BOOKS: 1. measures of performance. non binary huffman codes. (Computer Science and Engineering) . Gray) algorithm. Quantization and coding of transforms. 54 . Second Edition. Pearson Education. Vector quantization: Introduction. Machine Learning Differential coding Overview. Introduction to Information theory Compression techniques. application to image compression. Arithmetic codes: Overview. basic algorithm. Wavelet transforms and data compression introduction. minimum variance huffman codes. coding a sequence. audio compression. length of huffman codes. other approaches. empty cell problem. Discrete Wavelet Transforms (DWT) for image compression. Rao. probability models. introduction to information theory. TEXT BOOK: 1. Co. introduction. progressive image transmission. lossless compression. video coding using multi-resolution techniques. comparison of huffman and arithmetic coding. “Multimedia Computing and Communication and Applications”. Differential Pulse Code Modulation(DPCM). markov models.

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

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

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

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

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

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

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

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

Sign up to vote on this title
UsefulNot useful