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





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



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

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

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



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

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

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

42 43 44 45 46 47 48


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

37. 38. 40. 41.

05BCE 403 05BCE 405

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

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

3 3 3 3

0 0 0 0 2 2 6

3 3 3 3

50 51

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

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


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

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. Proj Credits 3 3 3 3 3 3 2 2 2 4 28 SEVENTH SEMESTER: S.Syllabus (Board of studies – 25th Feb 2006) SIXTH SEMESTER: S.No Sub Code .B. 26 27 28 29 30 31 32 33 34 06BCE302 06BCE 304 06BCE 306 06BCE 308 06BCE 310 06BCE 312 06BCE 314 L 06BCE 316 L Subject Lec Programming Langauage Processors Object Oriented Analysis and Design Linux System Programming Operating Systems* Graph Theory And its Application Elective .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 . Sub Code Subject No . (Computer Science and Engineering) .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.Tech.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.


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

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

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

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

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

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

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

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

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

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

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

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

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

B.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. 38 .

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

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

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

TEXT BOOK: 1. Attacks.Stenography – Classical Encryption Techniques. “Network Security” – 2nd edition.Key management – Diffie-Hellman key exchange – Elliptic curve cryptography Message Authentication and Hash functions: Authentication requirements –Authentication functions – Hash functions – Security of hash functions and MAC. 2005. Prentice-Hall of India Pvt Ltd. Mike speciner. Services & Mechanisms: Security attacks – Security services – Network Security Model.Audit records Viruses and related Threats – Firewalls: Firewall design principles – Firewall characteristics – types of firewalls – Firewall configurations.B. (Computer Science and Engineering) . Electronic Mail Security: Pretty Good Privacy – PGP services – Transmission and reception of PGP messages – PGP message generation – PGP message reception. Worms: Intruders – Intrusion techniques – Password protection – Access control – Password selection strategies -Intrusion detection. 2002.Different approaches of Intrusion detection . REFERENCE BOOK: 1. Objectives: The students would be able to understand and use encryption algorithms such as RSA.Tech. Pearson Education. Hash Algorithm: Message Digest algorithm (MD5) – Secure Hash algorithm (SHA-1) – HMAC. 2nd edition. IP Security: Overview – Architecture – Authentication header – Web Security: A comparison of Threats on the Web – Secure Socket Layer and transport layer security: SSL architecture – SSL record protocol – Handshake protocols. “Cryptography and Network Security”. Crypto-analysis. Tata McGraw Hill. Blow Fish etc.Modern Techniques: The Data Encryption Standard – The Strength of DES – Differential and Linear. 2. William Stallings “Cryptography and Network security – Principles and Practice". 2002. Intruders and Viruses. It also covers the topics such as cryptography and various encryption algorithms. authentication techniques digital signatures and System-level security issues. 42 . Digital Signatures and Authentication Protocols: Digital signatures – Authentication protocols – Digital signature standard. Charlie Kaufman. Atul Khate.Syllabus (Board of studies – 25th Feb 2006) 06BCE 405 NETWORK SECURITY L 3 T 0 P C 3 Aim: The subject aims to cover the significance of security of computer systems and computer networks. Raja perlman. Conventional Encryption: Classical Techniques: Conventional Encryption model . Public Key Cryptography: Principles of public-key cryptosystems – The RSA algorithm .

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

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

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

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

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

Data Mining primitives.H. Data mining applications. 48 . Han J. Association Rule Mining: Basic concepts – market basket analysis . Anahory S. fact data and dimension data. Data Mining Introduction: Introduction to Data Mining – Data Mining Functionalities – Classification of Data Mining systems. REFERENCE BOOKS: 1. Classification & prediction: What’s classification .W. 3rd Edition.B.. Cluster analysis: Types of Data in cluster analysis . D. To sail along with the various approaches in data mining. & Kambler. summary table. 2. Morgan Kaufmann. 2005.A multidimensional Data Model – Data Warehouse architecture – Data preprocessing. M. Immon.Data Mining Query language – Designing Graphical User interfaces based on DMQL Architecture of Data mining.Major clustering methods. 1st Edition. To familiarize with the various data warehousing and data mining tools Data Warehouse and OLAP Technology for Data mining: Introduction to Data Warehouse. languages & system architecture: Data Mining primitives: Task – relevant data – kind of knowledge to be mined – Background knowledge – interestingness measures– presentation & visualization of discovered pattern . “Data Warehousing in the Real World”. Murray. 2003. (Computer Science and Engineering) .Data cleaning – Data integration and Transformation..Tech. Major issues in Data mining. Wiley Dream Tech. “Data Mining: Concepts and Techniques”.issues regarding classification and prediction – Bayesian classification – prediction: linear – non linear. “Building the Data Warehouse”. 1997.Syllabus (Board of studies – 25th Feb 2006) 06BCE E07 DATAWAREHOUSING AND DATA MINING ** L 3 T 0 P C 3 Aim: The subject aims to cover knowledge discovery process and to design and populate a business data warehouse. Objectives : To make familiar with the various concepts of data warehousing like meta data. Addison Wesley. data mart. TEXT BOOK: 1.Mining single dimensional Boolean association rules from transactional databases.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Sign up to vote on this title
UsefulNot useful

Master Your Semester with Scribd & The New York Times

Special offer for students: Only $4.99/month.

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

Cancel anytime.