(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


VELLORE .No 1 2 3 4 5 6 7 8 Sub Code 06BCE 201 06BCE 203 06BCE 205 06BCE 207 06BCE 209 06BCE 211 06BCE 215 L 06BCE 217 L Subject Complex Variables and Partial Differential Equations* Data Structures and Algorithms* Electronic Devices & Circuits* Introduction to Nano Technology Digital Computer Fundamentals * Object Oriented Programming * Object Oriented Programming Lab Electronic Devices Lab TOTAL Periods/Week Lec Tut Pra 2 1 3 3 3 3 2 12 0 0 0 0 1 6 2 2 4 Credits 3 3 3 3 3 3 2 2 22 FOURTH SEMESTER: S. Statistics and Reliability * Computer Profession and Society * Microprocessor & Interfacing Techniques * Principles of Computation * Software Engineering * Data base Management System* Microprocessor And Interfacing Lab RDBMS Lab TOTAL Periods/Week Lec Tut Pra 2 1 3 0 3 0 3 0 3 0 3 0 2 12 6 4 Credits 3 3 3 3 3 3 2 2 22 FIFTH SEMESTER: S.Syllabus (Board of studies – 25th Feb 2006) VELLORE INSTITUTE OF TECHNOLOGY. (Computer Science and Engineering) .TECH – COMPUTER SCIENCE & ENGINEERING (For Students admitted during the Academic Year 2006 – 2007 and thereafter) THIRD SEMESTER: S.B.No 9 10 11 12 13 14 15 16 Sub Code 06BCE202 06BCE 204 06BCE 206 06BCE 208 06BCE 210 06BCE 212 06BCE 214L 06BCE 216L Subject Probability.Tech.14 School of Computer Sciences COURSE – B.No 17 18 19 20 21 22 23 24 25 Sub Code 06BCE 301 06BCE 303 06BCE 305 06BCE 307 06BCE 309 06BCE 311 06BCE 313 L 06BCE 315 L Subject Discrete Mathematical Structures* Internet Programming Computer Architecture And Organisation* Computer and Communication Networks Theory of Computation* Soft Computing Net working Lab Internet Programming Lab Project TOTAL Lec 2 2 3 3 3 3 Periods/Week Tut Pra Proj 1 1 0 0 0 0 2 2 12 6 4 2 2 Credits 3 3 3 3 3 3 2 2 2 24 * COMMON BETWEEN CSE & IT ***FREE ELECTIVES 4 .

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

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

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

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

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

Michel Kohler. WILEY –VCH publications 2. Paul U Braun. their Characterization and their potential applications in various fields Objective: The students would become aware of various fabrication principles behind nanostructure preparation.Tech. Nanosensors as Optical Actuators – Magnetic Nanotransducers – Chemical Nanoscale Sensors and Actuators.Schadler.Atomic beam Lithography – Nanofield Generation by Optical Nearfield Probes.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. what characterizations of nanostructures can be measured and in which domains in can be applied. Linda S. “Nanocomposite Science”. Pulickel M Ajayan.Syllabus (Board of studies – 25th Feb 2006) L 06BCE207 INTRODUCTION TO NANO TECHNOLOGY 2 T 1 P C 3 Aim: The subject covers the basic principles behind Nanostructures. Text/Reference Books: 1. 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. 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. Applications Applications – Nanotransducers – Nanochemical Sensors – Nanoelectronic Devices – Electrical Contacts and Nanowires – Quantum dots and Localization of Elementary particle – Nanodiodes – Nanoswitches – Molecular Switches and Basic Elements . (Computer Science and Engineering) . Structural Characterization Characterization of Nanostructures – Geometrical Characterization – Layer Dimensions – Structures that Assist Measurement Characterization of Composition of Layers and Surfaces – Atomic Composition – Characterization of the Chemical Surface – Functional Characterization of Nanostructures. WILEY –VCH publications 10 .Nanostructures as Optical Sensors. Wolfgang Fritzche “Nanotechnology – An Introduction to Nanostructuring techniques” . Introduction The Nanoworld .

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

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

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

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

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

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

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

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

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

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

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

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.


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

“Embedded Systems Design”. 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. Arnold S. “Embedded Systems-Application.B. Practice & Design”.Tech. software engineering practices in embedded systems development and Inter process communication. TEXT BOOK: 1. CMP Books. ‘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. (Computer Science and Engineering) . 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. 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. Objectives: The student would be able to understand and use in embedded systems. Berger. their design and applications. 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.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.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. 1997 41 . 2003 REFERENCE BOOKS: 1. device drivers. Memories and I/O Devices. PCI. Rajkamal. programming models and Interprocess communication. Deadline and Interrupt Latency Program Modeling Concepts: Single and Multiprocessor Systems Software – Development Process. Tata McGraw Hill.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.