(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


Syllabus (Board of studies – 25th Feb 2006) VELLORE INSTITUTE OF TECHNOLOGY. 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.14 School of Computer Sciences COURSE – B.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.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. VELLORE .Tech. (Computer Science and Engineering) .

Syllabus (Board of studies – 25th Feb 2006) SIXTH SEMESTER: S.No Sub Code . 26 27 28 29 30 31 32 33 34 06BCE302 06BCE 304 06BCE 306 06BCE 308 06BCE 310 06BCE 312 06BCE 314 L 06BCE 316 L Subject Lec Programming Langauage Processors Object Oriented Analysis and Design Linux System Programming Operating Systems* Graph Theory And its Application Elective .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.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 . (Computer Science and Engineering) . Proj Credits 3 3 3 3 3 3 2 2 2 4 28 SEVENTH SEMESTER: S.Tech. Peripherals Interfacing and Trouble 35 06BCE 401 Shooting 36 06BCE 403 Embedded Systems 37 06BCE 405 Network Security ELECTIVE – II (FREE 38 ELECTIVES) ELECTIVE – III (SCHOOL 58 SPECIFIC ELECTIVES) 59 06BCE 413 L Peripherals Interfacing Lab 60 06BCE 415 L Embedded Systems Lab 61 Project Total * * SCHOOL SPECIFIC ELECTIVES EIGHTH SEMESTER: S.B. Sub Code Subject No .

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.


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

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

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

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

“Introduction to Languages and the Theory of Computation”. Overview: An overview of grammars and languages. and simply solvable or it cannot be solved. Tata McGraw Hill. 29 . (Computer Science and Engineering) .Tech. "Theory of Computation". 2nd Edition. efficiently solvable. Turing Machines: Church Turing hypothesis – Turing machine as language acceptors – Partial function – Non – deterministic Turing Machine – Universal Turing Machines – Applications. 1998.P Mishra. Unsolvable Problems & Computable Functions: Rice theorem – Halting problem – Post’s correspondence Problem – Primitive recursive functions – Godel Numbering – Recursive and recursively enumerable languages. Automata Theory and Abstract models of Computation and Computability. Non – determinism and kleenes theorem – pumping lemma – Decision problems. Construction of NFA and DFA from Regular expressions. N.B. REFERENCE BOOK: 1. Chandrasekaran. Normal Forms: Chomsky’s & Griebach’s Normal Forms Push Down Automata & Context Free Languages: Context free grammars – Derivation trees – Ambiguity – PDA& CFG – Context Free and non-Context free languages.Syllabus (Board of studies – 25th Feb 2006) 06BCE 309 THEORY OF COMPUTATION * L 3 T 0 P C 3 Aim: The subject aims to introduce Formal Languages. They would be able to analyze the problems by determining whether a problem is solvable. Martin. Prentice Hall of India. K. John C. Regular expressions and Regular languages Finite Automata and its minimization. 3rd Edition.L. TEXT BOOK: 1. 1997. Computational complexities and NP – Completeness. 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. Conversion of NFA into DFA Theorem & Problem: Chomsky hierarchy of language.

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

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

The student has to submit a report to the examiner. 32 . The evaluation is based on the demonstration and viva.Syllabus (Board of studies – 25th Feb 2006) L 06BCE315L INTERNET PROGRAMMING LAB Exercises on inter networking involving CGI. 2. T P C 2 2 1.Tech. 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. (Computer Science and Engineering) . Develop a stand-alone java application program that exploits the graphics processing capability of the java language. student information system etc. On a computer network consisting of WINDOWS NT LINUX/UNIX machine running a web server software and client machines running a browser.

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

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

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

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

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

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

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

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. Objective : To assemble a PC and identify the frequently occurring errors and troubleshooting appropriately. Pub. HDC. Ltd.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. HDD Problems – Over view of Advanced PCs. Govindarajulu.B. Hard disk up gradation – DOS and Software – Preventive Maintenance – System Usage – Trouble Shooting – Nature and Types of Faults – Trouble – shooting Tools – Fault Elimination Process – Systematic Trouble – shooting – Post – Motherboard Problems – Diagnosis – FDC – FDD. “IBM PC and Clones Hardware. Tata McGraw Hill. 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. 40 . 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 . REFERENCE BOOK: 1.. B. (Computer Science and Engineering) . 6th Reprint.Tech. 1993.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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

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

Cancel anytime.