(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


(Computer Science and Engineering) .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.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 .Tech.B.14 School of Computer Sciences COURSE – B.Syllabus (Board of studies – 25th Feb 2006) VELLORE INSTITUTE OF TECHNOLOGY.TECH – COMPUTER SCIENCE & ENGINEERING (For Students admitted during the Academic Year 2006 – 2007 and thereafter) THIRD SEMESTER: S. Statistics and Reliability * Computer Profession and Society * Microprocessor & Interfacing Techniques * Principles of Computation * Software Engineering * Data base Management System* Microprocessor And Interfacing Lab RDBMS Lab TOTAL Periods/Week Lec Tut Pra 2 1 3 0 3 0 3 0 3 0 3 0 2 12 6 4 Credits 3 3 3 3 3 3 2 2 22 FIFTH SEMESTER: S. VELLORE .

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.Syllabus (Board of studies – 25th Feb 2006) SIXTH SEMESTER: S. (Computer Science and Engineering) .No Sub Code .No 63 Sub Code 06BCE 402 Project TOTAL Subject Lec 2 2 2 2 Periods/Week Pra Com Tut 1 1 1 1 2 2 2 Proj Credits 3 3 3 3 2 2 2 6 30 12 6 4 2 6 6 Periods/Week Lec Tut Pra Credits 28 28 5 . 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. Sub Code Subject No . 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.B. Proj Credits 3 3 3 3 3 3 2 2 2 4 28 SEVENTH SEMESTER: S.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

.Tech. HDD Problems – Over view of Advanced PCs. Govindarajulu. Tata McGraw Hill. 1993. 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. REFERENCE BOOK: 1. B. 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.B. them Introduction to Microcomputer System Peripheral Devices – Keyboard – CRT Display Monitor – Printer – Magnetic Storage Devices – FDD – HDD – Special Peripherals – PC Hardware Overview – BIOS – DOS interaction _ PC Family – PC Hardware – Mother board Logic – Memory Space – I/O port address – Wait state – Interrupts – I/O Data transfer – DMA channels – Keyboard interface – Parallel Interface – Serial Interface – CRT Display Controller – FDC – HDC – Hard disk card – Memory Refresh – POST Sequence.Syllabus (Board of studies – 25th Feb 2006) 06BCE401 PERIPHERALS INTERFACING AND TROUBLE SHOOTING 2 1 3 Aim : To expose the students to know about Internals of PC and how they are functioning. 6th Reprint. “IBM PC and Clones Hardware. Trouble Shooting and Maintenance”.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. 40 . Pub. Ltd. Objective : To assemble a PC and identify the frequently occurring errors and troubleshooting appropriately. 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 . (Computer Science and Engineering) . HDC.

Deadline and Interrupt Latency Program Modeling Concepts: Single and Multiprocessor Systems Software – Development Process.Tech. 1997 41 .B. Rajkamal. “Embedded Systems Design”. Memories and I/O Devices. ‘CAN’ and Advanced I/O Buses between the Networked Multiple Devices – Host System or Computer Parallel Communication between the Networked I/O Multiple Devices Using the ISA. PCI – X and Advanced Buses Device Drivers and Interrupts Servicing Mechanism: Device Drivers – Parallel Port Device Drivers in a System – Serial Port Device Drivers in a System – Device Drivers for Internal Programmable Timing Devices – Interrupt Servicing (Handling) Mechanism – Context and the periods for Context – Switching. Validating and Debugging – Real Time Programming Issues During the Software Development Process – Software Project Management – Software Maintenance –Unified Markup Language (UML) – Interprocess Communication & Synchronization of processes. their design and applications. Devices and Buses for Device Networks: I/O Devices – Timer and Counting Devices – Serial Communication Using the I2 C. programming models and Interprocess communication. CMP Books. TEXT BOOK: 1. (Computer Science and Engineering) . PCI. Practice & Design”. device drivers. Task & Threads – Multiple processes in an Application – Problems of Sharing Data by Multiple Tasks & Routines – Interprocess Communication. software engineering practices in embedded systems development and Inter process communication. Tata McGraw Hill. Berger.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. Introduction to Embedded Systems: Processor in the System – Software Embedded into a system – Exemplary Embedded Systems – Embedded System-On-chip and in VLSI Circuit Processor and Memory Organization – Structural Units in a Processor – Processor Selection for an Embedded System – Memory Devices – Memory Selection for an Embedded System – Allocation of Memory to Program Segments and Blocks and Memory Map of a System – Direct Memory Access – Interfacing Processor. “Embedded Systems-Application. Arnold S.Syllabus (Board of studies – 25th Feb 2006) 06BCE 403 EMBEDDED SYSTEMS L 3 T 0 P C 3 Aim: The subject aims to cover the concepts of embedded systems. Objectives: The student would be able to understand and use in embedded systems. 2003 REFERENCE BOOKS: 1.

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

Power On self Test (POST) 9. Keyboard Scanning Routine 2. Printer Interface 5. Floppy Disk Drive. Data Acquisation System 12. Programmable Communication Interface 7. Programmable Timer 8. Trouble Shooting in PC’s 11. Diagnostics home menu 10. Hard Disk Drive Mechanism 43 . 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) . 7 – segment LED Display Routine 3. Programmable Peripheral Interface 6.B.Tech.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

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

Cancel anytime.