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





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



Sl.no Sub-code SEMESTER- III 1. 05BCE201 2. 05BCE203 3. 05BCE205 4. 05BCE207 5. 05BCE209 6. 05BCE211 7. 05BCE213L 8. 05BCE215L SEMESTER – IV 9. 05BCE202 10. 05BCE204 11. 05BCE206 12. 05BCE208 13. 05BCE 210 14. 05BCE 212 15. 05BCE 214L SEMESTER – V 17. 05BCE 301 18. 05BCE 303 19. 05BCE 305 20. 05BCE 307 21. 05BCE 309 22. 05BCE 311 23. 05BCE 313L 24. 05BCE 315L 25. SEMESTER – VI 26 05BCE 302 27. 05BCE 304 28. 05BCE 306 29. 05BCE 308 30. 05BCE 310 32. 05BCE 314L 33. 05BCE 316L 34. 35. SEMESTER – VII 36. 05BCE 401

Subject Complex Variables and Partial Differential Equations* Data Structures and Algorithms* Electronic Devices & Circuits* Introduction to Nano Technology Digital Computer Fundamentals * Object Oriented Programming * Object Oriented Programming Lab Electronic Devices Lab Probability, Statistics and Reliability * Computer Profession and Society * Microprocessor & Interfacing Techniques * Principles of Computation * Software Engineering * Data base Management System* Microprocessor And Interfacing Lab Discrete Mathematical Structures* Internet Programming Computer Architecture And Organisation* Computer and Communication Networks Theory of Computation* Soft Computing Net working Lab Internet Programming Lab Project ELECTIVE - I Programming Language Processors Object Oriented Analysis and Design Linux System Programming Operating Systems* Graph Theory And its Application Linux System Programming Lab Operating System Lab Inplant Training Project Peripherals Interfacing and Trouble Shooting

L T P 2 3 3 3 3 2 1 0 0 0 0 1 2 2 2 3 3 3 2 3 2 2 3 3 3 3 1 0 0 0 1 0 2 1 1 0 0 0 0 2 2



C 3 3 3 3 3 3 2 2 3 3 3 3 3 3 2 3 3 3 3 3 3 2 2 2 3 3 3 3 3 3 2 2 2 4 3

Pg.no 15 17 18 19 20 21 22 23 24 25 27 28 29 30 31 34 35 36 37 38 39 40 41

2 2 2 3 2 3 2 1 1 0 1 0 1 2 2 2 4 2 1

42 43 44 45 46 47 48


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

37. 38. 40. 41.

05BCE 403 05BCE 405

42. 05BCE 413L 43. 05BCE 415L 45. Project SEMESTER – VIII 46. 05BCE 402 ELECTIVE – I 05BCE E 02 05BCE E 04 05BCE E 06 05BCE E 08 05BCE E 10 05BCE E 12 05BCE E 14

Embedded Systems Network Security ELECTIVE – II (FREE ELECTIVES) ELECTIVE – III (SCHOOL SPECIFIC ELECTIVES) Peripherals Interfacing Lab Embedded Systems Lab Project Resource Management Real Time Systems Distributed Data Base Systems Soft Computing Internet Working & Technologies Basic Bio-Informatics Distributed Computing

3 3 3 3

0 0 0 0 2 2 6

3 3 3 3

50 51

52 53 6 28 37 38 39 40 40 41 42 54 55 56 57 58 59 60 61 62 63 64 66 67 68 69 70 71

ELECTIVE – II (FREE ELECTIVES) 05BCE E01 Computer Simulation & Modelling 05BCE E03 Distributed Computing 05BCE E05 Distributed Database System 05BCE E07 Data warehousing and data mining 05BCE E09 Mobile Communication** 05BCE E11 Web Services ELECTIVE – III (SCHOOL SPECIFIC ELECTIVES) 05BCE E15 Pattern Recognition 05BCE E17 Client Server Technology 05BCE E21 Web Commerce 05BCE E23 Data Compression Techniques 05BCE E25 Software Practice and Testing 05BCE E27 Computer Graphics 05BCE E29 ROBOTICS 05BCE E31 Neural Networks 05BCE E33 Operation Research 05BCE E35 Digital Signal Processing 05BCE E37 Decision Support System** * COMMON BETWEEN CSE & IT ** SCHOOL SPECIFIC ELECTIVES ***FREE ELECTIVES


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.TECH – COMPUTER SCIENCE & ENGINEERING (For Students admitted during the Academic Year 2006 – 2007 and thereafter) THIRD SEMESTER: S. (Computer Science and Engineering) . VELLORE .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 .B.14 School of Computer Sciences COURSE – B.No 9 10 11 12 13 14 15 16 Sub Code 06BCE202 06BCE 204 06BCE 206 06BCE 208 06BCE 210 06BCE 212 06BCE 214L 06BCE 216L Subject Probability.Tech.Syllabus (Board of studies – 25th Feb 2006) VELLORE INSTITUTE OF TECHNOLOGY. Statistics and Reliability * Computer Profession and Society * Microprocessor & Interfacing Techniques * Principles of Computation * Software Engineering * Data base Management System* Microprocessor And Interfacing Lab RDBMS Lab TOTAL Periods/Week Lec Tut Pra 2 1 3 0 3 0 3 0 3 0 3 0 2 12 6 4 Credits 3 3 3 3 3 3 2 2 22 FIFTH SEMESTER: S.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

L 06BCE 214L MICROPROCESSOR AND INTERFACING LAB 1. Study Experiments i) Study of 8086 Architecture ii) Study of 8255 – PPI iii) Study of 8253 – PIT iv) Study of 8279 – PKI v) Study of 8259 – PIC 2. Write an ALP to find out factorial of a given hexadecimal number using 8086 MP Data: OAH, OFH, 1OH 3. Write an ALP to perform 16 bit arithmetic operations (ADD, SUB, MUL, DIV) 4. Write an ALP to generate the sum of first ‘N’ natural numbers using 8086 MP 5. Write an ALP to convert given hexadecimal number to binary using 8086 MP Data: ABH, CDH, 101H 6. Write an ALP to convert given binary number to hexadecimal number using 8086 MP Data: 101010102, 111111112, 11002, 11112 7. Write an ALP to order give set of hexadecimal numbers in ascending and descending order Data: 0AH, 0FH, 0DH, 10H, 02H 8. Write an ALP to move block of data from locations 1200H-1205H to 2200H – 2205H 9. Write an ALP to reverse the given string Data: WELCOME 10. Write an ALP to generate the following series 1+1/x+1/x3+1/x5+ …….. 11. Write an ALP to generate square wave using 8255 PPI 12. Write an ALP to generate rate generator using 8253 PIT 13. Write an ALP to interface keyboard with 8086 using 8279 PKI 14. Write an ALP to display the given message using 8279 PKI Message: INFORMATION TECHNOLOGY 15. Write an ALP to interface analog to digital converter.


P 2

C 2


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

L 06BCE 313L DATABASE MANAGEMENT SYSTEMS LAB * 1. a) Create a table EMP with the following fields. EName Eno Salary DeptNo Address Dname b) Insert 5 records into EMP c) ALTER EMP table I) Varying size of Eno field II) Adding a new field job d) Delete the table EMP 2. Create a table EMP with the above mentioned fields. i) Insert 5 records into EMP ii) Update the salary of the Employees by 10% hike iii) Delete the employees whose name is ‘AAA’ 3. Create a table ORDER with the following fields and constraints. ORDER Column Name Order-no Item-name Qty Rate-unit Constraint Name pk-order-no itn ck-aty (25<QTY<50) Nn-rate Constraint Type PRIMARY KEY UNIQUE CHECK NOT NULL


P 2

C 2

4. Using Ex 3. 1. Drop unique constraint for item-name 2. Disable the constraint Nn-rate 3. Insert a record with NULL values for rate unit 4. Enable the constraint with NULL value existing on rate-unit 5. Create a table EMP mentioned above and test all the arithmetic functions and character functions. 6. Add a field date-of-birth to EMP table and test all the date functions. 7. i) Modify EMP table adding a new field BONUS, update it using NVL ii) Retrieve the employees whose name starts with S. iii) Select all the employees who are working in IT department. 8. I) Using EMP table find the employee getting maximum salary ii) Find the employee whose salary is minimum iii) Find the sum of salaries of all the employees working in ‘ACCOUNTS’ department. 9. Create a table DEPT with the following fields DNo. Primary Key DName

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

Modify EMP table adding a foreign key constraint on DeptNo. i) ii) Insert 6 records into Dept. Implement the following Join operations a) Self Join b) Equi Join c) Non Equi Join d) Outer Join e) Natural Join

10. Using EMP and DEPT, implement all type of view techniques. a) Row subset view b) Column subset view c) Row column subset view d) Grouped view e) Joined view f) With check option 11. Using EMP and DEPT a) Create a sequence to insert the empno in EMP table b) Create a synonym for the above two tables PL/SQL Programming 1. Create a cursor to update the salary of employees in EMP table 2. a) Write a PL/SQL program to raise an Exception i) When the bonus exceeds salary b) Write a PL/SQL program to test the built-in Exceptions 3. Write a procedure to insert a record into ORDER table by validating qty limit of the item and also check whether that item exists. 4. Write a function to find substring. 5. Create a trigger which checks whether employee with Emp_no is present in the Employee table before inserting into EMP.


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

“IBM PC and Clones Hardware. 6th Reprint. 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. Pub. HDD Problems – Over view of Advanced PCs. 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. 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.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.B. (Computer Science and Engineering) .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. Trouble Shooting and Maintenance”. Govindarajulu. Hardware Components and ICS Microprocessors in PC Intel 8088 – Internal Organisation – Bus cycle – 8088 Operation – I/O Addressing – Interrupt Handling – 8088 Instruction – Coprocessor – Support chips in the Mother board – Dump and Smart Chips – Clock Generator 8284 – Bus controller – Interrupt controller 8259A – Programmable Interval Timer 8253 – 8255A-5 PPI . 40 . Ltd.. HDC.Tech. Objective : To assemble a PC and identify the frequently occurring errors and troubleshooting appropriately. Tata McGraw Hill. B. 1993. REFERENCE BOOK: 1.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Sign up to vote on this title
UsefulNot useful