(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


VELLORE .Syllabus (Board of studies – 25th Feb 2006) VELLORE INSTITUTE OF TECHNOLOGY.TECH – COMPUTER SCIENCE & ENGINEERING (For Students admitted during the Academic Year 2006 – 2007 and thereafter) THIRD SEMESTER: S.Tech.B.No 1 2 3 4 5 6 7 8 Sub Code 06BCE 201 06BCE 203 06BCE 205 06BCE 207 06BCE 209 06BCE 211 06BCE 215 L 06BCE 217 L Subject Complex Variables and Partial Differential Equations* Data Structures and Algorithms* Electronic Devices & Circuits* Introduction to Nano Technology Digital Computer Fundamentals * Object Oriented Programming * Object Oriented Programming Lab Electronic Devices Lab TOTAL Periods/Week Lec Tut Pra 2 1 3 3 3 3 2 12 0 0 0 0 1 6 2 2 4 Credits 3 3 3 3 3 3 2 2 22 FOURTH SEMESTER: S.No 17 18 19 20 21 22 23 24 25 Sub Code 06BCE 301 06BCE 303 06BCE 305 06BCE 307 06BCE 309 06BCE 311 06BCE 313 L 06BCE 315 L Subject Discrete Mathematical Structures* Internet Programming Computer Architecture And Organisation* Computer and Communication Networks Theory of Computation* Soft Computing Net working Lab Internet Programming Lab Project TOTAL Lec 2 2 3 3 3 3 Periods/Week Tut Pra Proj 1 1 0 0 0 0 2 2 12 6 4 2 2 Credits 3 3 3 3 3 3 2 2 2 24 * COMMON BETWEEN CSE & IT ***FREE ELECTIVES 4 .No 9 10 11 12 13 14 15 16 Sub Code 06BCE202 06BCE 204 06BCE 206 06BCE 208 06BCE 210 06BCE 212 06BCE 214L 06BCE 216L Subject Probability. (Computer Science and Engineering) . Statistics and Reliability * Computer Profession and Society * Microprocessor & Interfacing Techniques * Principles of Computation * Software Engineering * Data base Management System* Microprocessor And Interfacing Lab RDBMS Lab TOTAL Periods/Week Lec Tut Pra 2 1 3 0 3 0 3 0 3 0 3 0 2 12 6 4 Credits 3 3 3 3 3 3 2 2 22 FIFTH SEMESTER: S.14 School of Computer Sciences COURSE – B.

Proj Credits 3 3 3 3 3 3 2 2 2 4 28 SEVENTH SEMESTER: S. Sub Code Subject No .I Linux System Programming Lab Operating System Lab Inplant Training Project Total 2 3 2 3 2 3 Periods / Week Tut 1 0 1 0 1 0 2 2 12 6 4 2 4 6 Pra Inp. Peripherals Interfacing and Trouble 35 06BCE 401 Shooting 36 06BCE 403 Embedded Systems 37 06BCE 405 Network Security ELECTIVE – II (FREE 38 ELECTIVES) ELECTIVE – III (SCHOOL 58 SPECIFIC ELECTIVES) 59 06BCE 413 L Peripherals Interfacing Lab 60 06BCE 415 L Embedded Systems Lab 61 Project Total * * SCHOOL SPECIFIC ELECTIVES EIGHTH SEMESTER: S. (Computer Science and Engineering) . 26 27 28 29 30 31 32 33 34 06BCE302 06BCE 304 06BCE 306 06BCE 308 06BCE 310 06BCE 312 06BCE 314 L 06BCE 316 L Subject Lec Programming Langauage Processors Object Oriented Analysis and Design Linux System Programming Operating Systems* Graph Theory And its Application Elective .B.No 63 Sub Code 06BCE 402 Project TOTAL Subject Lec 2 2 2 2 Periods/Week Pra Com Tut 1 1 1 1 2 2 2 Proj Credits 3 3 3 3 2 2 2 6 30 12 6 4 2 6 6 Periods/Week Lec Tut Pra Credits 28 28 5 .No Sub Code .Syllabus (Board of studies – 25th Feb 2006) SIXTH SEMESTER: S.Tech.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.


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

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

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

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

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

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

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

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

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

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

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

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

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

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.

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

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 . Pub. HDC. HDD Problems – Over view of Advanced PCs. 40 .B. Trouble Shooting and Maintenance”. (Computer Science and Engineering) .. 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. Tata McGraw Hill. REFERENCE BOOK: 1. “IBM PC and Clones Hardware.Tech. 6th Reprint. Ltd.DMA Controller 8237A-5 Mother board circuits Motherboard functions – Reset Logic – CPU Nucleus Logic – DMA Logic – Wait state logic – Bus Arbitration – RAM Logic – ROM Logic – ROM Decode Logic – RAM Parity Logic – NMI – Logic – I/O Ports Decode Logic – Time of day (TOD) Logic – Dynamic Memory Refresh Logic – Speaker Logic – Mode switch Input Logic Keyboard Interface – coprocessor Unit – Control Bus Logic – Address Bus Logic – Data Bus Logic – I/O slot signals – New generation Mother Board – Mother Board Connectors and Jumpers – Design Variations – SMPS – Printer controller – Floppy Disk Controller.Syllabus (Board of studies – 25th Feb 2006) 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. Govindarajulu. 1993. 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. B. Hard disk up gradation – DOS and Software – Preventive Maintenance – System Usage – Trouble Shooting – Nature and Types of Faults – Trouble – shooting Tools – Fault Elimination Process – Systematic Trouble – shooting – Post – Motherboard Problems – Diagnosis – FDC – FDD. Objective : To assemble a PC and identify the frequently occurring errors and troubleshooting appropriately.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

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

Cancel anytime.