(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


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Syllabus (Board of studies – 25th Feb 2006) 06BCE401 PERIPHERALS INTERFACING AND TROUBLE SHOOTING 2 1 3 Aim : To expose the students to know about Internals of PC and how they are functioning. REFERENCE BOOK: 1. Pub. 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. Govindarajulu. 40 . 6th Reprint.Tech. Tata McGraw Hill. Objective : To assemble a PC and identify the frequently occurring errors and troubleshooting appropriately.B. Trouble Shooting and Maintenance”. 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. (Computer Science and Engineering) . B.DMA Controller 8237A-5 Mother board circuits Motherboard functions – Reset Logic – CPU Nucleus Logic – DMA Logic – Wait state logic – Bus Arbitration – RAM Logic – ROM Logic – ROM Decode Logic – RAM Parity Logic – NMI – Logic – I/O Ports Decode Logic – Time of day (TOD) Logic – Dynamic Memory Refresh Logic – Speaker Logic – Mode switch Input Logic Keyboard Interface – coprocessor Unit – Control Bus Logic – Address Bus Logic – Data Bus Logic – I/O slot signals – New generation Mother Board – Mother Board Connectors and Jumpers – Design Variations – SMPS – Printer controller – Floppy Disk Controller. 1993. HDC. Ltd. Hard disk up gradation – DOS and Software – Preventive Maintenance – System Usage – Trouble Shooting – Nature and Types of Faults – Trouble – shooting Tools – Fault Elimination Process – Systematic Trouble – shooting – Post – Motherboard Problems – Diagnosis – FDC – FDD. “IBM PC and Clones Hardware. 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 .. HDD Problems – Over view of Advanced PCs.

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

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

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

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

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

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

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

& Kambler. Morgan Kaufmann.issues regarding classification and prediction – Bayesian classification – prediction: linear – non linear. 2. Han J. languages & system architecture: Data Mining primitives: Task – relevant data – kind of knowledge to be mined – Background knowledge – interestingness measures– presentation & visualization of discovered pattern . Addison Wesley. (Computer Science and Engineering) . “Data Warehousing in the Real World”. TEXT BOOK: 1.Data cleaning – Data integration and Transformation. Wiley Dream Tech. Data Mining Introduction: Introduction to Data Mining – Data Mining Functionalities – Classification of Data Mining systems. 1st Edition. Cluster analysis: Types of Data in cluster analysis . 2005.W. Classification & prediction: What’s classification . 48 .Major clustering methods. data mart. 3rd Edition. M. Anahory S. 1997. Immon. summary table. REFERENCE BOOKS: 1. 2003. “Building the Data Warehouse”. “Data Mining: Concepts and Techniques”. Data mining applications.B. To sail along with the various approaches in data mining.Syllabus (Board of studies – 25th Feb 2006) 06BCE E07 DATAWAREHOUSING AND DATA MINING ** L 3 T 0 P C 3 Aim: The subject aims to cover knowledge discovery process and to design and populate a business data warehouse..Tech.Mining single dimensional Boolean association rules from transactional databases. D. Murray. Major issues in Data mining. To familiarize with the various data warehousing and data mining tools Data Warehouse and OLAP Technology for Data mining: Introduction to Data Warehouse. fact data and dimension data.H. Objectives : To make familiar with the various concepts of data warehousing like meta data..Data Mining Query language – Designing Graphical User interfaces based on DMQL Architecture of Data mining.A multidimensional Data Model – Data Warehouse architecture – Data preprocessing. Association Rule Mining: Basic concepts – market basket analysis . Data Mining primitives.

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

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

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

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

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

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

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

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

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

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

Hebb Net: Algorithm. Applications. Algorithm. Introduction: Why Neural Networks and Why Now . Jackson. Multi Layer Neural Nets as Universal Approximators. Algorithm. 2000 Applications” 3rd 59 . Analysis. Algorithm. “Neural Networks – A Comprehensive Foundation. Neural Networks based on Competition: Kohonen Self –Organizing Maps: Architecture. Variations. Algorithm. Storage Capacity. Simple Neural Nets for Pattern Classification: General Discussion. I. “Neural Computing”. Associative memories and Holographic Pattern Recognition system. Applications. Application. Laurene Fausett. 2. Applications. Algorithms. Back Propagation Net: Standard Back Propagation: Architecture. Algorithm. Objectives: The students shall be able to understand the biological and artificial model of neuron. Beale and T. Pearson Education. Applications. and Edition. Adaptive Resonance Theory: Introduction. Application. Pearson Education.the McCulloch Pitt’s Neuron. Algorithm.B. Theoretical Results: Derivation of Learning rules. Learning Vector Quantization: Architecture. Algorithm. Bidirectional Associative Memory: Architecture. TEXT BOOK: 1. “Fundamentals of Neural Networks Architectures. Multi layer perceptrons. ART2: Architecture. ART1: Architecture. Perceptron: Architecture. Applications. (Computer Science and Engineering) . Simon Haykin.What is a neural Net . Applications. 2nd Edition 2004. Algorithm.Syllabus (Board of studies – 25th Feb 2006) 06BCE E31 NEURAL NETWORKS L 3 T 0 P C 3 Aim: The subject aims to introduce the concepts of Neural Networks with emphasis on supervised and unsupervised learning algorithms as well as on computational characteristics. Pattern Association: Auto associative Net: Architecture. IOP Publishing. Application.R. 2004 REFERENCE BOOKS: 1. Analysis.Tech. pattern recognition techniques.Where are Neural Nets being used How are Neural Nets being used . Analysis.

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

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

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

Master your semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master your semester with Scribd & The New York Times

Cancel anytime.