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





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



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

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

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



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

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

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

42 43 44 45 46 47 48


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

37. 38. 40. 41.

05BCE 403 05BCE 405

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

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

3 3 3 3

0 0 0 0 2 2 6

3 3 3 3

50 51

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

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


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.


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

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

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

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

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

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

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

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

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

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

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

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

Syllabus (Board of studies – 25th Feb 2006) 06BCE310 GRAPH THEORY AND ITS APPLICATIONS L 2 T 1 P C 3 Aim: This subject aims to cover basic concepts of Graph theory Objective: The students would be able to understand and explain fundamentals of Graph Theory their applications. Graph Theory With Application To Engineering And Computer Science.N. importance. chromatic partitioning. Networks And Algorithms. algorithms for connectedness. circuit matrix. 1981. four color problem.Reingold. John Wiley. 1998. Introduction Definitions. detection of planarity.Cut sets Properties. Different types.S.Planar and dual graphs -Combinatorial representation. 1-2 isomorphism. fundamental matrices. Prentice Hall India. 3. walk.J. Properties. connected. network flows. Prentice Hall. N. connectivity. REFERENCE BOOKS: 1. tournament. disconnected graphs. spanning trees.Harary.Deo. Narasing Deo. Matrix representation of graphs Incidence matrix. J.M. Trees. 37 . Euler and Hamiltonian graphs. TEXT BOOK: 1.Tech. covering. directed paths and connectedness. kuratowski’s graphs. trees-matrix representation. dual graphs. trees. circuits. Addison Wesley/ Narosa. 2. Euler digraphs. and adjacency matrix. Graph. Tulasiraman And M. isomorphism. directed circuits and shortest paths. planar graphs. (Computer Science and Engineering) . cut set matrix. E. Planar and Dual Graphs Coloring. fundamental circuits. relationships amongst matrices. Cut sets. covering and partitioning Directed graphs Chromatic number. Graph theoretic algorithms Computer representation of graphs – input & output. fundamental circuits. path matrix. Graph Theory. N. Combinatorial Algorithms: Theory And Practice. paths.B. spanning tree. operation on graphs operation on graphs. distance and centers. separatability. F. Swamy. matching. cut vertices.Nievergelt.1977. minimal spanning tree. fundamental circuits and cut sets. 1995.

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

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

. 1993. “IBM PC and Clones Hardware. Govindarajulu. Trouble Shooting and Maintenance”. Hard Disk / Display Controller Subsystem Display Adaptor – CRT Display – CRT Controller Principle – CRT Controller Motorola 6845 – MDA Design Organisation – Colour – Graphics Adapter – Advanced Graphics adapters – New Generation display Adapters – Display Adapters – Device Interface – Auxiliary Subsystems – Serial Port in PC – RTC – LAN Installation and Preventive Maintenance Pre – Installation Planning – Practice – Routine Checks – Special Configurations – Memory. Objective : To assemble a PC and identify the frequently occurring errors and troubleshooting appropriately. Hardware Components and ICS Microprocessors in PC Intel 8088 – Internal Organisation – Bus cycle – 8088 Operation – I/O Addressing – Interrupt Handling – 8088 Instruction – Coprocessor – Support chips in the Mother board – Dump and Smart Chips – Clock Generator 8284 – Bus controller – Interrupt controller 8259A – Programmable Interval Timer 8253 – 8255A-5 PPI . HDD Problems – Over view of Advanced PCs. REFERENCE BOOK: 1. 40 . (Computer Science and Engineering) .Tech. Ltd. Hard disk up gradation – DOS and Software – Preventive Maintenance – System Usage – Trouble Shooting – Nature and Types of Faults – Trouble – shooting Tools – Fault Elimination Process – Systematic Trouble – shooting – Post – Motherboard Problems – Diagnosis – FDC – FDD. HDC.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.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. Tata McGraw Hill. B. Pub.B. them Introduction to Microcomputer System Peripheral Devices – Keyboard – CRT Display Monitor – Printer – Magnetic Storage Devices – FDD – HDD – Special Peripherals – PC Hardware Overview – BIOS – DOS interaction _ PC Family – PC Hardware – Mother board Logic – Memory Space – I/O port address – Wait state – Interrupts – I/O Data transfer – DMA channels – Keyboard interface – Parallel Interface – Serial Interface – CRT Display Controller – FDC – HDC – Hard disk card – Memory Refresh – POST Sequence. 6th Reprint.

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

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

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

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

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

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

Tech. Giuseppe Pelagatti. (Computer Science and Engineering) .Syllabus (Board of studies – 25th Feb 2006) 06BCE E05 DISTRIBUTED DATABASE SYSTEM L 3 T 0 P C 3 Aim: This subject aims to cover Distributed Data processing. Query decomposition and Transaction Management.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. 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. Semantic Data Control: View Management – Data Security – Semantic Integrity Control Overview of Query Processing . Patrick Valduriesz. "Principles of Distributed Database Systems". Distributed concurrency control. Distributed DBMS Reliability: Reliability concepts and measures – Failures and fault tolerance in distributed systems – local reliability protocols – distributed reliability protocols – dealing with site failures – Network partitioning – Architectural considerations. Query Optimization – Centralized Query Optimization – Join Ordering in fragment queries – distributed query optimization algorithms. M. Query processing. Tamer Ozsu. Query processing. Distributed Database Design. "Distributed Database Principles and Systems". TEXT BOOK: 1. PHI. Introduction to Distributed Data Processing: What is a distributed database system – Promises of DDBS – Complicating Factors – Problem Areas. Query decomposition.B. DBMS Standardization – Architectural models for distributed DBMS – Distributed DBMS Architecture – Global Directory issues Distributed Database Design: Alternative Design Strategies – Distributed Design issues – Fragmentation – Allocation. 1999 REFERENCE BOOK: 1. Distributed databases. McGraw Hill publications. Transaction management and Distributed DBMS reliability. Stefanoceri.Serializability theory – Taxonomy of concurrency control mechanisms – Locking based concurrency control algorithms Timestamp-based concurrency control algorithms – Optimistic concurrency control algorithms – Deadlock management – Relaxed concurrency control. 1987. 47 .

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Sign up to vote on this title
UsefulNot useful