(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


B.Syllabus (Board of studies – 25th Feb 2006) VELLORE INSTITUTE OF TECHNOLOGY.14 School of Computer Sciences COURSE – B. VELLORE .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 . (Computer Science and Engineering) .No 9 10 11 12 13 14 15 16 Sub Code 06BCE202 06BCE 204 06BCE 206 06BCE 208 06BCE 210 06BCE 212 06BCE 214L 06BCE 216L Subject Probability.Tech.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.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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.


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

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

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

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

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

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

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

T P C 2 2 1. HTML and JAVA Mini-project has to be completed and submitted. 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. 2. Develop a stand-alone java application program that exploits the graphics processing capability of the java language. (Computer Science and Engineering) . 32 . The evaluation is based on the demonstration and viva. The student has to submit a report to the examiner.B.Syllabus (Board of studies – 25th Feb 2006) L 06BCE315L INTERNET PROGRAMMING LAB Exercises on inter networking involving CGI.Tech. student information system etc.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.