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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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.


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

HDD Problems – Over view of Advanced PCs. 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. 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 . “IBM PC and Clones Hardware. Pub.. 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. (Computer Science and Engineering) . 1993. Ltd.Tech. HDC.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. 40 . Trouble Shooting and Maintenance”.B. REFERENCE BOOK: 1. Objective : To assemble a PC and identify the frequently occurring errors and troubleshooting appropriately. Govindarajulu. B. Hard Disk / Display Controller Subsystem Display Adaptor – CRT Display – CRT Controller Principle – CRT Controller Motorola 6845 – MDA Design Organisation – Colour – Graphics Adapter – Advanced Graphics adapters – New Generation display Adapters – Display Adapters – Device Interface – Auxiliary Subsystems – Serial Port in PC – RTC – LAN Installation and Preventive Maintenance Pre – Installation Planning – Practice – Routine Checks – Special Configurations – Memory.Syllabus (Board of studies – 25th Feb 2006) 06BCE401 PERIPHERALS INTERFACING AND TROUBLE SHOOTING 2 1 3 Aim : To expose the students to know about Internals of PC and how they are functioning. Tata McGraw Hill. 6th Reprint.

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

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

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

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

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

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

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

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

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

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

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

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

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

coding a sequence. lossy compression. Co. Quantization and coding of transforms. Gray) algorithm. video coding using multi-resolution techniques. Discrete Wavelet Transforms (DWT) for image compression. Machine Learning Differential coding Overview. non binary huffman codes. 2000. lossless compression. “Introduction to Data Compression”. tree structured vector quantizer. transform coding.B. applications. advantages LBG (Linde. length of huffman codes. application to image compression. audio compression. Mathematical preliminaries: Overview.. other approaches. Arithmetic codes: Overview. 54 . Lossless image compression and vector quantization Lossless image compression: Introduction. basic algorithm. JPEG Compression. introduction to information theory. huffman coding algorithm. delta modulation. Ralf Steinmetz and Klara Nahrsedt. markov models. Morgan Kaufmann Publications. generating a binary code. physical models. empty cell problem. Differential Pulse Code Modulation(DPCM). minimum variance huffman codes. Adaptive Differential Pulse Code Modulation (ADPCM).Tech. extended huffman codes. 1996. Introduction to Information theory Compression techniques. REFERENCE BOOKS: 1. Second Edition. models. Transform coding Different transforms. Addison Wesley Pub. comparison of huffman and arithmetic coding. progressive image transmission. 1998. facsimile encoding. 2. Vector quantization: Introduction. probability models. adaptive huffman codes. Constant Factor Delta Modulation (CFDM). speech coding. run length encoding. applications. Raghuveer M. measures of performance.Syllabus (Board of studies – 25th Feb 2006) 06BCEE23 DATA COMPRESSION TECHNIQUES L 2 T 1 P C 3 Aim: This subject aims to cover standard compression techniques Objectives: The students would be able to understand and design new compression techniques. (Computer Science and Engineering) . modeling and coding. Various compression coding techniques Huffman coding: Good codes. other vector quantization schemes. Wavelet transforms and data compression introduction. Khalid Sayood. TEXT BOOK: 1. “Multimedia Computing and Communication and Applications”. Buzo. introduction. Codebook Initialization. Ltd. “Wavelet Transforms: Introduction to Theory and Applications”. Rao. Pearson Education.

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

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

1990 57 . Image processing.A programming approach". Van Dam A. Foley J. McGraw Hill. Steven Harrington. games graphs and charts animation – Introduction of graphics and kernel system (GKS) – binding language for GKS – programming examples using GKS. VLSI. Objectives: The student would be able to understand and use Computer Graphics various Clipping algorithms. "Fundamentals of Interactive Computer Graphics". video monitors – Graphic software – Output primitives – Line and circle drawing algorithms – Attributes of output primitives Two-Dimensional Transformation: Clipping and windowing – Clipping algorithms – Segmented display files – Display file compilation – Modeling and modeling transformation Interactive Input Methods: Physical devices – Logical classification of input devices – Interactive picture construction techniques – Input functions (9). 2000. Addison Wesley.Tech. 1986.. TEXT BOOK: 1. 2D and 3D transformations.B. Prentice Hall.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. Donald Hearn and Pauline Baker Computer Graphics.D. PHIGS. 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). New Delhi. REFERENCE BOOKS: 1. Introduction to Computer Graphics: Display devices – Hardcopy devices – Interactive input devices – Display processors – Graphic Adapters – basic function – Monochrome adapters. Computer Graphics Applications: CAD/CAM. (Computer Science and Engineering) . 2D and 3D modeling. 2. "Computer Graphics.

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

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

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

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

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

Sign up to vote on this title
UsefulNot useful