B.Tech.

(Computer Science and Engineering) - Syllabus
(Board of studies – 25th Feb 2006)

CURRICULUM & SYLLABUS

B. TECH. (COMPUTER SCIENCE AND ENGINEERING)

SCHOOL OF COMPUTER SCIENCES

VELLORE INSTITUTE OF TECHNOLOGY DEEMED UNIVERSITY VELLORE – 632 014. A PLACE TO LEARN; A CHANCE TO GROW
1

B.Tech. (Computer Science and Engineering) - Syllabus
(Board of studies – 25th Feb 2006)

VELLORE INSTITUTE OF TECHNOLOGY DEEMED UNIVERSITY

INDEX

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
2

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

IPT

Proj

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

49

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

3

(Computer Science and Engineering) .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.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 .14 School of Computer Sciences COURSE – B.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. 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.TECH – COMPUTER SCIENCE & ENGINEERING (For Students admitted during the Academic Year 2006 – 2007 and thereafter) THIRD SEMESTER: S.

Sub Code Subject No .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. (Computer Science and Engineering) .B.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. 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. 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 Sub Code .Syllabus (Board of studies – 25th Feb 2006) SIXTH SEMESTER: S.Tech.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.

T

P 2

C 2

22

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

T

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
23

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.

24

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

6th Reprint. Pub. Govindarajulu.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. 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. HDD Problems – Over view of Advanced PCs. “IBM PC and Clones Hardware.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.Tech. Objective : To assemble a PC and identify the frequently occurring errors and troubleshooting appropriately.B.. 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. (Computer Science and Engineering) . HDC. 1993. Trouble Shooting and Maintenance”. Hard Disk / Display Controller Subsystem Display Adaptor – CRT Display – CRT Controller Principle – CRT Controller Motorola 6845 – MDA Design Organisation – Colour – Graphics Adapter – Advanced Graphics adapters – New Generation display Adapters – Display Adapters – Device Interface – Auxiliary Subsystems – Serial Port in PC – RTC – LAN Installation and Preventive Maintenance Pre – Installation Planning – Practice – Routine Checks – Special Configurations – Memory. B. Hardware Components and ICS Microprocessors in PC Intel 8088 – Internal Organisation – Bus cycle – 8088 Operation – I/O Addressing – Interrupt Handling – 8088 Instruction – Coprocessor – Support chips in the Mother board – Dump and Smart Chips – Clock Generator 8284 – Bus controller – Interrupt controller 8259A – Programmable Interval Timer 8253 – 8255A-5 PPI . Tata McGraw Hill. 40 . REFERENCE BOOK: 1. Ltd.

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

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

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

44 .B. (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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Sign up to vote on this title
UsefulNot useful