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





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



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

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

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



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

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

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

42 43 44 45 46 47 48


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

37. 38. 40. 41.

05BCE 403 05BCE 405

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

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

3 3 3 3

0 0 0 0 2 2 6

3 3 3 3

50 51

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

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


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.


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

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

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

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

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

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

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

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

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

1994. "Object Oriented Analysis and Design with applications". Principles. 2003 34 . "An Introduction to Object-Oriented Systems Analysis and Design with UML and the Unified Process". Object Model: Evolution. Documentation. Designing complex systems.B. Benefits and Risks of Object Oriented development Introduction to Object-Oriented Paradigm and UML: Unified Process. Teams. micro development process. Grady Booch. Addison Wesley. the Requirement Workflow. Elements of object model. Objectives: The students would be able to understand the techniques. TEXT BOOK: 1. process diagrams. applying the notation..Syllabus (Board of studies – 25th Feb 2006) 06BCE 304 OBJECT ORIENTED ANALYSIS & DESIGN L 3 T 0 P C 3 Aims: The subject aims to introduce of the object-oriented development processes.Tech. Schach. Management and planning: Staffing. Tools. module diagrams. Interaction diagrams. (Computer Science and Engineering) . Reuse. Management Issues. UML and related methodologies. Planning and Estimating. REFERENCE BOOK: 1. Stephen R. Testing. Complexity of software: Structure of complex systems. Maintenance. ObjectOriented Analysis Workflow. Analysis and Design: Case studies. User Interface system. macro development process. decomposing complexity. applications and UML based object oriented analysis and design. state transition diagrams. Quality Assurance and Metrics. Workflow and phases of the Unified process. Introduction to Web – Based Systems. Tata McGraw Hill. Applying object model Elements of Notation: Class diagrams. Object-Oriented Design Workflow. Release management. object diagrams.

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

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

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

Tech. (Computer Science and Engineering) .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.B. 38 .

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

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.DMA Controller 8237A-5 Mother board circuits Motherboard functions – Reset Logic – CPU Nucleus Logic – DMA Logic – Wait state logic – Bus Arbitration – RAM Logic – ROM Logic – ROM Decode Logic – RAM Parity Logic – NMI – Logic – I/O Ports Decode Logic – Time of day (TOD) Logic – Dynamic Memory Refresh Logic – Speaker Logic – Mode switch Input Logic Keyboard Interface – coprocessor Unit – Control Bus Logic – Address Bus Logic – Data Bus Logic – I/O slot signals – New generation Mother Board – Mother Board Connectors and Jumpers – Design Variations – SMPS – Printer controller – Floppy Disk Controller. B.Tech. Pub. Tata McGraw Hill. Ltd. HDC. Objective : To assemble a PC and identify the frequently occurring errors and troubleshooting appropriately.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. (Computer Science and Engineering) . 1993. Hardware Components and ICS Microprocessors in PC Intel 8088 – Internal Organisation – Bus cycle – 8088 Operation – I/O Addressing – Interrupt Handling – 8088 Instruction – Coprocessor – Support chips in the Mother board – Dump and Smart Chips – Clock Generator 8284 – Bus controller – Interrupt controller 8259A – Programmable Interval Timer 8253 – 8255A-5 PPI . HDD Problems – Over view of Advanced PCs.. REFERENCE BOOK: 1. 40 . Trouble Shooting and Maintenance”. Hard Disk / Display Controller Subsystem Display Adaptor – CRT Display – CRT Controller Principle – CRT Controller Motorola 6845 – MDA Design Organisation – Colour – Graphics Adapter – Advanced Graphics adapters – New Generation display Adapters – Display Adapters – Device Interface – Auxiliary Subsystems – Serial Port in PC – RTC – LAN Installation and Preventive Maintenance Pre – Installation Planning – Practice – Routine Checks – Special Configurations – Memory. Govindarajulu. 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. 6th Reprint.B. “IBM PC and Clones Hardware.

Objectives: The student would be able to understand and use in embedded systems. Practice & Design”. programming models and Interprocess communication. Introduction to Embedded Systems: Processor in the System – Software Embedded into a system – Exemplary Embedded Systems – Embedded System-On-chip and in VLSI Circuit Processor and Memory Organization – Structural Units in a Processor – Processor Selection for an Embedded System – Memory Devices – Memory Selection for an Embedded System – Allocation of Memory to Program Segments and Blocks and Memory Map of a System – Direct Memory Access – Interfacing Processor. device drivers. Memories and I/O Devices. (Computer Science and Engineering) . 2003 REFERENCE BOOKS: 1. PCI – X and Advanced Buses Device Drivers and Interrupts Servicing Mechanism: Device Drivers – Parallel Port Device Drivers in a System – Serial Port Device Drivers in a System – Device Drivers for Internal Programmable Timing Devices – Interrupt Servicing (Handling) Mechanism – Context and the periods for Context – Switching. 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.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.Tech. PCI. Arnold S. Devices and Buses for Device Networks: I/O Devices – Timer and Counting Devices – Serial Communication Using the I2 C. Task & Threads – Multiple processes in an Application – Problems of Sharing Data by Multiple Tasks & Routines – Interprocess Communication. software engineering practices in embedded systems development and Inter process communication. their design and applications. Deadline and Interrupt Latency Program Modeling Concepts: Single and Multiprocessor Systems Software – Development Process. Berger.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. 1997 41 . Rajkamal. CMP Books.B. Tata McGraw Hill. TEXT BOOK: 1. ‘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. “Embedded Systems-Application. “Embedded Systems Design”.

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

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

B.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. 44 . (Computer Science and Engineering) .Tech.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Master your semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

Master your semester with Scribd & The New York Times

Cancel anytime.