(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.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.B. VELLORE .Tech.No 9 10 11 12 13 14 15 16 Sub Code 06BCE202 06BCE 204 06BCE 206 06BCE 208 06BCE 210 06BCE 212 06BCE 214L 06BCE 216L Subject Probability. (Computer Science and Engineering) .TECH – COMPUTER SCIENCE & ENGINEERING (For Students admitted during the Academic Year 2006 – 2007 and thereafter) THIRD SEMESTER: S.No 17 18 19 20 21 22 23 24 25 Sub Code 06BCE 301 06BCE 303 06BCE 305 06BCE 307 06BCE 309 06BCE 311 06BCE 313 L 06BCE 315 L Subject Discrete Mathematical Structures* Internet Programming Computer Architecture And Organisation* Computer and Communication Networks Theory of Computation* Soft Computing Net working Lab Internet Programming Lab Project TOTAL Lec 2 2 3 3 3 3 Periods/Week Tut Pra Proj 1 1 0 0 0 0 2 2 12 6 4 2 2 Credits 3 3 3 3 3 3 2 2 2 24 * COMMON BETWEEN CSE & IT ***FREE ELECTIVES 4 . 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.14 School of Computer Sciences COURSE – B.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.


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

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

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

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

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

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

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

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

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

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

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

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

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

38 .Tech.B.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) .

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

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.Syllabus (Board of studies – 25th Feb 2006) 06BCE401 PERIPHERALS INTERFACING AND TROUBLE SHOOTING 2 1 3 Aim : To expose the students to know about Internals of PC and how they are functioning. REFERENCE BOOK: 1. “IBM PC and Clones Hardware. Govindarajulu. 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 . Tata McGraw Hill.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.B. 1993. 40 . Trouble Shooting and Maintenance”. Pub. Objective : To assemble a PC and identify the frequently occurring errors and troubleshooting appropriately. Ltd. 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.Tech. (Computer Science and Engineering) . 6th Reprint. HDC. 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.. HDD Problems – Over view of Advanced PCs.

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

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

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

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

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

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

"Distributed Database Principles and Systems".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. 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. Tamer Ozsu. Patrick Valduriesz.Tech. M. Query processing. Introduction to Transaction Management: Definition of a Transaction – Properties of Transaction – Types of Transaction. Stefanoceri. Distributed concurrency control.B. Distributed Database Design. 1987. Query decomposition. 47 . 1999 REFERENCE BOOK: 1. PHI. McGraw Hill publications. (Computer Science and Engineering) . Objectives: The students would be able to understand and use distributed Database Processing. Semantic Data Control: View Management – Data Security – Semantic Integrity Control Overview of Query Processing . Query decomposition and Transaction Management. 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. TEXT BOOK: 1. DBMS Standardization – Architectural models for distributed DBMS – Distributed DBMS Architecture – Global Directory issues Distributed Database Design: Alternative Design Strategies – Distributed Design issues – Fragmentation – Allocation. "Principles of Distributed Database Systems". Giuseppe Pelagatti.Syllabus (Board of studies – 25th Feb 2006) 06BCE E05 DISTRIBUTED DATABASE SYSTEM L 3 T 0 P C 3 Aim: This subject aims to cover Distributed Data processing. Distributed databases.

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

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

B.NET C# Language Fundamentals: Object Oriented Programming in C#.NET Framework: Introduction to ADO. Advanced Concepts.NET Platform: Building Blocks of . MSDN.NET.Remoting -XML Parsing-Security.file I/O – serialization.NET Framework. IDG Books India Pvt.Syllabus (Board of studies – 25th Feb 2006) 06BCE E11 WEB SERVICES L 3 T 0 P C 3 Aim: To provide the student with the basics of . (Computer Science and Engineering) . WP Publishers and Distributors. Writing Web Application with the . . TEXT BOOK: 1. 2003 REFERENCE BOOKS: 1. Microsoft Visual Basic . . WP Publishers and Distributors. Ltd. 2001 2. MSDN. 2003 3. Introduction to Web Services: Writing Mobile Application with . WP Publishers and Distributors. Objectives: After completion of this course the students will be able to undergo projects in . Microsoft C# Language specification.Tech.NET framework.NET Introduction to Microsoft .NET on the edge. Threading NET Framework Concepts II: Reflection. Writing GUI Applications with .NET Framework Concepts I: console I/O-working with strings-formatting and conversion.NET framework. MSDN. 2003 50 .NET. Rick Leinecker ASP.NET Framework. C#.

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

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

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

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

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

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

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

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

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

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

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

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

Sign up to vote on this title
UsefulNot useful