This action might not be possible to undo. Are you sure you want to continue?
(Computer Science and Engineering) - Syllabus
(Board of studies – 25th Feb 2006)
CURRICULUM & SYLLABUS
B. TECH. (COMPUTER SCIENCE AND ENGINEERING)
SCHOOL OF COMPUTER SCIENCES
VELLORE INSTITUTE OF TECHNOLOGY DEEMED UNIVERSITY VELLORE – 632 014. A PLACE TO LEARN; A CHANCE TO GROW
B.Tech. (Computer Science and Engineering) - Syllabus
(Board of studies – 25th Feb 2006)
VELLORE INSTITUTE OF TECHNOLOGY DEEMED UNIVERSITY
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
52 53 6 28 37 38 39 40 40 41 42 54 55 56 57 58 59 60 61 62 63 64 66 67 68 69 70 71
ELECTIVE – II (FREE ELECTIVES) 05BCE E01 Computer Simulation & Modelling 05BCE E03 Distributed Computing 05BCE E05 Distributed Database System 05BCE E07 Data warehousing and data mining 05BCE E09 Mobile Communication** 05BCE E11 Web Services ELECTIVE – III (SCHOOL SPECIFIC ELECTIVES) 05BCE E15 Pattern Recognition 05BCE E17 Client Server Technology 05BCE E21 Web Commerce 05BCE E23 Data Compression Techniques 05BCE E25 Software Practice and Testing 05BCE E27 Computer Graphics 05BCE E29 ROBOTICS 05BCE E31 Neural Networks 05BCE E33 Operation Research 05BCE E35 Digital Signal Processing 05BCE E37 Decision Support System** * COMMON BETWEEN CSE & IT ** SCHOOL SPECIFIC ELECTIVES ***FREE ELECTIVES
No 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.B. Statistics and Reliability * Computer Profession and Society * Microprocessor & Interfacing Techniques * Principles of Computation * Software Engineering * Data base Management System* Microprocessor And Interfacing Lab RDBMS Lab TOTAL Periods/Week Lec Tut Pra 2 1 3 0 3 0 3 0 3 0 3 0 2 12 6 4 Credits 3 3 3 3 3 3 2 2 22 FIFTH SEMESTER: S.No 1 2 3 4 5 6 7 8 Sub Code 06BCE 201 06BCE 203 06BCE 205 06BCE 207 06BCE 209 06BCE 211 06BCE 215 L 06BCE 217 L Subject Complex Variables and Partial Differential Equations* Data Structures and Algorithms* Electronic Devices & Circuits* Introduction to Nano Technology Digital Computer Fundamentals * Object Oriented Programming * Object Oriented Programming Lab Electronic Devices Lab TOTAL Periods/Week Lec Tut Pra 2 1 3 3 3 3 2 12 0 0 0 0 1 6 2 2 4 Credits 3 3 3 3 3 3 2 2 22 FOURTH SEMESTER: S. (Computer Science and Engineering) .Syllabus (Board of studies – 25th Feb 2006) VELLORE INSTITUTE OF TECHNOLOGY.14 School of Computer Sciences COURSE – B.TECH – COMPUTER SCIENCE & ENGINEERING (For Students admitted during the Academic Year 2006 – 2007 and thereafter) THIRD SEMESTER: S. VELLORE .Tech.No 17 18 19 20 21 22 23 24 25 Sub Code 06BCE 301 06BCE 303 06BCE 305 06BCE 307 06BCE 309 06BCE 311 06BCE 313 L 06BCE 315 L Subject Discrete Mathematical Structures* Internet Programming Computer Architecture And Organisation* Computer and Communication Networks Theory of Computation* Soft Computing Net working Lab Internet Programming Lab Project TOTAL Lec 2 2 3 3 3 3 Periods/Week Tut Pra Proj 1 1 0 0 0 0 2 2 12 6 4 2 2 Credits 3 3 3 3 3 3 2 2 2 24 * COMMON BETWEEN CSE & IT ***FREE ELECTIVES 4 .
Syllabus (Board of studies – 25th Feb 2006) SIXTH SEMESTER: S. Peripherals Interfacing and Trouble 35 06BCE 401 Shooting 36 06BCE 403 Embedded Systems 37 06BCE 405 Network Security ELECTIVE – II (FREE 38 ELECTIVES) ELECTIVE – III (SCHOOL 58 SPECIFIC ELECTIVES) 59 06BCE 413 L Peripherals Interfacing Lab 60 06BCE 415 L Embedded Systems Lab 61 Project Total * * SCHOOL SPECIFIC ELECTIVES EIGHTH SEMESTER: S.B.I Linux System Programming Lab Operating System Lab Inplant Training Project Total 2 3 2 3 2 3 Periods / Week Tut 1 0 1 0 1 0 2 2 12 6 4 2 4 6 Pra Inp.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 . 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 . Proj Credits 3 3 3 3 3 3 2 2 2 4 28 SEVENTH SEMESTER: S.Tech.No Sub Code . Sub Code Subject No . (Computer Science and Engineering) .
Vibrations of a circular membrane Diffusion equation in Cartesian and Cylindrical coordinates.B. limits and continuity. Inversion contour method-solution of difference equations by Z. 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. branch cuts.w= ez). Z-transform – definition – relation between Z – transform and Laplace transform. 6 .Goursat theorem. properties of Z-transforms (proofs not required) Initial and final value theorems. Z-transform of elementary functions. Complex Integration: Integration in the complex plane along a contour. application to ladder type electrical network. Cauchy’s Residue theorem – Evaluation of integrals by the method of residues.transform method. physical understanding of problems and intuition to independently analyze the mathematical equations which model the problems in their respective fields of study. Taylor and Laurent series(without proof's) singularities – zeros – Poles. Branch points. the students are expected to develop the necessary mathematical skills. Cylindrical and Spherical coordinates – variable separable method: Potential flow over a sphere. Residues. Integral Transforms. particular integral – method of undetermined co-efficient. Cauchy – Riemann equations. integral theorem – Derivatives of analytic functions. w = z2 . Analytic and Harmonic functions – Complex potential – Applications to flow around a corner and around a cylinder. Partial Differential Equations: Introduction – Formation of PDEs – Solution of PDE – General. 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. variation of parameters technique (without proof). linear transformations (w = zA+B. Difference Equations & Z-transforms: Difference equations with constant coefficientsComplementary function. Wave Equation-Vibrations of a Stretched string-Variable Separable Method. Jordan’s lemma (without proof).D’Alembert’s solution for the initial value problem. Applications of Partial Differential Equations : Solution of Laplace equations in Cartesian.transforms. concept of conformal transformation – Qualitative discussion on applications.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.Inverse Z-transforms – partial fraction expansion method. Indented contour integral. . 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. Exponential Fourier series – Fourier Integral Transforms – Definition – Fourier Integral – Fourier sine and cosine transforms.Properties of Fourier transforms – Convolution theorem for Fourier transforms – Parseval’s identity for Fourier transforms (proof not required) Application of Integral Transforms to Partial differential equations: (i) Heat flow in an infinite bar (ii) Wave propagation on a semi infinite string (iii) Steady state heat flow in a semi-infinite domain. Inversion contours for Laplace.Tech. (Computer Science and Engineering) . Fourier and z. Functions of a Complex Variable: Functions of a complex variable. By the end of the course. Bilinear transformation. the Cauchy.
V. John Wiley & Sons (2000). MichaelD. 38th Edition. 2005. 7th Edition. V. McGraw Hill International ed. Erwin Kreyzsizig. “Complex variables and application”. Churchill. 2. 5th Edition.B.Tech. 7 . O’ Neil. Khanna Publications. International student edition (1978). S. J. McGraw – Hill International edition (1985). 3. Pearson Education (2002). John Wilag & Sons (Wiley student Edison). “Advanced Engineering Mathematics”. Churchill and J. 2004. 4. Greenberg. W. 2. 2nd Edition. B. “Advanced Engineering Mathematics”. W. REFERENCE BOOKS: 1. (Computer Science and Engineering) . 2004.. 8th Edition. R. Brown and R. 5. Peter V. “Advanced Engineering Mathematics”. Ian Sneddon. Grewal.Syllabus (Board of studies – 25th Feb 2006) TEXT BOOKS: 1. “Higher Engineering Mathematics”. Brown. “Fourier series and Boundary value problems”. “Elements of Partial Differential equations”.
S.B. Rajesekar. REFERENCE BOOKS: 1. “An Introduction to Data Structures with Applications”. prefix and postfix expressions and their conversions. bucket sort. The students would be able to implement various data structures and apply operations on them and also implement various sorting and searching techniques. selection sort. external sort. 1991.Tech. Sorting Techniques: Insertion sort and its analysis. Branch and Bound. G. depth first search and breadth first search – shortest path algorithm. Back Tracking. Queue: ADT – queue model – array implementation of queues. Lower Bound Theory. “Data Structures & Algorithm Analysis in C++”. It covers algorithm analysis for the run time complexities and the space requirements. merge sort and its analysis. Sahni and S. Dynamic Programming. Queues & Lists: Stack: ADT – stack model – implementation of stacks – applications of stacks– infix. 2.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). 2004. Objectives: To make the Students learn various types of data structures and algorithm analysis. Galgotia-1999. quick sort and its analysis. “Computer Algorithms”. Mark Allen Weiss. 8 . Heap sort and its analysis. List: ADT – simple array implementation of lists – linked lists– doubly and circular linked lists – cursor implementation of linked lists – polynomial addition and multiplication. Overview of Garbage collection & Compaction Trees: Preliminaries – implementations of trees – tree traversals (inorder. Algorithm Analysis: Mathematical background model – running time calculations – complexity analysis – Abstract Data Types (ADT) – asymptotic notations.traveling salesman problem – algebraic manipulations. Greedy Method. TEXT BOOK: 1. E. Stacks. postorder) – binary trees – implementation – expression trees – binary search trees – threaded binary trees – B_tree – B+trees – hashing – hash function. Jean-Paul Tremblay and Paul. Tata McGraw Hill. Addison Wesley.8 queens problem. Algorithm Design Techniques: Divide and Conquer Algorithm – Strassen’s matrix multiplication and its analysis. Shell sort.knapsack 0/1. Sorenson. preorder.traveling salesman problem. (Computer Science and Engineering) . Horowitz.Basic concepts of NP-hard and NP-complete.
Millman. IC voltage regulators – protection circuits for DC power supplies – switched mode power supplies. C. active and saturation region – input and output characteristics – CE.C. 1999. REFERENCE BOOKS: 1. TEXT BOOK: 1. Bipolar Junction Transistor: Principle of transistor action – current components – cutoff. J. power ratings etc. Chanda. Semiconductor Basics: Review of extrinsic semiconductor – drift and diffusion currents – thermal generation of minority carriers – Hall Effect. fabrication and characteristics of four layer devices such as SCR. 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.K.B. (Computer Science and Engineering) .P. & CC Configurations – small signal and large signal beta – transistor breakdown ratings – Thermal runaway problems – Use of Heat sinks. 2001. Mithal. “Solid state electronic devices”. “Electronic Devices and Applications of Integrated Circuits”. inductor. “Electronic Devices & Circuits”. S. RC section filters – Voltage regulators – current regulators. Halkias.R. TRIAC and DIAC.Tech. application and selection of appropriate devices to achieve a particular circuit function. Electronic Circuits: Half – wave and full – wave rectifier circuits – performance characteristics of rectifier circuits – filter consideration capacitor.G. L section. 9 . 3. Mathur.photo electric theory . temperature. New Delhi. Photo Electric Devices: Photo emissivity .Kulshreshtha and P. Prentice Hall of India.C. 1997. G. 2. McGraw Hill. D. CB. Khanna Publishers.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. Ben. The students will understand the constructional features and characteristics of various electronic devices and circuits.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. Streetman.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”. Junction Diodes. clipper and clamper circuits. 1998. Objective: The students would become aware of the range of devices with respect to frequency.
Text/Reference Books: 1. Nanosensors as Optical Actuators – Magnetic Nanotransducers – Chemical Nanoscale Sensors and Actuators. (Computer Science and Engineering) .Atomic beam Lithography – Nanofield Generation by Optical Nearfield Probes. Pulickel M Ajayan. WILEY –VCH publications 10 . Wolfgang Fritzche “Nanotechnology – An Introduction to Nanostructuring techniques” . 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. 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.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. their Characterization and their potential applications in various fields Objective: The students would become aware of various fabrication principles behind nanostructure preparation. WILEY –VCH publications 2.from Micro to Nanostructures – Definition of Nanostructures – Insight into the Nanoworld Building Blocks of Nanotechnology – Interactions and Topology – The Microscopic Environment of the Nanoworld. Michel Kohler.B. Paul U Braun.Nanostructures as Optical Sensors. Introduction The Nanoworld . what characterizations of nanostructures can be measured and in which domains in can be applied. Linda S. “Nanocomposite Science”. Applications Applications – Nanotransducers – Nanochemical Sensors – Nanoelectronic Devices – Electrical Contacts and Nanowires – Quantum dots and Localization of Elementary particle – Nanodiodes – Nanoswitches – Molecular Switches and Basic Elements .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.Schadler.
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. 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. Sequential Logic Design.status register effect of O/P carry – design of shifter – processor unit – design of accumulator. P. Malvino and D. design steps involved in flipflop. TEXT BOOK: 1. Computer Design: Computer configuration – instructions and data formats instruction sets timing and control execution of instruction – design of computer. RAM and CPU. Basic laws. logic gate fundamentals. Objectives: The students shall be able to understand Boolean laws.Binary decimal. 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. Morris M. shift register and designing a simple computer which is capable of providing few arithmetic and logical operations. (Computer Science and Engineering) .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. 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. 2001 REFERENCE BOOKS: 1.Tech. Control Logic Design: Control organization – PLA control – microprogram control hardwired control microprogram sequencer – microprogrammed CPU organization. 4th edition. P. Processor Organization: Memory unit – inter register transfer – micro operations bus organization scratch pad memory – ALU – design of ALU . Boolean algebra. Tata McGraw Hill 1997. McGraw Hill 1999. Floating point representation. Bartee. 2. understand the memory representation in ROM. Boolean logic. Thomas C. “Digital Principles and Applications”. error detection – reflection – alphanumeric codes. Leach.B. "Digital Design". "Computer Architecture Logic Design". Codes. Third Edition. function of flip-flop and shift register. A. 11 . arithmetic and Logic unit. Mano. Prentice Hall India.
“Object Oriented Programming with C++”. virtual functions. inline functions. operator overloading. Inheritance: Inheritance. 12 . Addison Wesley. 2.Tech.Base class and derived class relationship. handling exceptions. derived class declaration. Forms of inheritance. polymorphism. class templates. friend classes and friend functions. 2004. file modes. copy constructor. T. lists of exceptions. constructor invocation and data member initialization. constructors in derived class. TEXT BOOK: 1. Generic programming with templatesFunction templates. Objectives: Students will be able to know the fundamentals of object oriented programming and incorporate OOPs’ features such as inheritance. parameterized constructors.Venugopal. accessing class members. benefits of OOP. class objects. E. 2nd Edition. data hiding. empty classes. new. constructors.Ravishankar. inheritance and member accessibility.Balagurusamy. defining member functions. ASCII and binary files.R. 1988. evolution of c++ as a object oriented programming language with focus on generic programming with templates and Exception Handling. and abstraction and its importance. class member accessibility. “The C++ programming Language”. “this” pointer. Tata McGraw Hill. Introduction to Fundamentals concepts: Object oriented fundamentals.Class specification. and Rajkumar. accessing member functions within class. fundamentals of OO-class. object.Structured versus object-oriented development. arithmetic operators. virtual base classes. random access to a file. Bjarne stroustrup. K.B. structure of C++ program. encapsulation. operator keyword. concatenation of strings.Classes and Objects. comparison operators. catching exceptions. elements of object oriented programming. exception handling constructs. limitations of increment/decrement operators. "Mastering C++”. Exception handling and Files: Files and Streams-Opening and Closing a file. Classes and Objects: Working with classes. unary operator overloading. abstract classes. file pointers and their manipulation. templates using c++ as language. 1997 REFERENCE BOOKS: 1. Overloading: Overloading-Function overloading. Tata McGraw Hill. (Computer Science and Engineering) .overloadable operators. binary operator overloading. sequential access to a file. delete operators. destructors in derived class. data conversion. 3rd edition. constructor overloading. error handling during file manipulations. Exception handling-exception handling model.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. polymorphism.
Searching: a. Implementing Stacks and queues. e. 2. copy constructor etc). a) Copying a text files b) Displaying the contents of the file etc. Write Program illustrating File Handling operations Ex. 8. Programs illustrating the use of destructor and the various types of constructors (no arguments. Linear search b. 6. constructor. Programs illustrating the various forms of inheritance : Ex. Implementation and processing in lists. Write a program illustrating the use of virtual functions. 2. multilevel. (Computer Science and Engineering) . Medical. Write a program which illustrates the use of virtual base class. b. 9.Tech. New and delete operators etc. Programs illustrating the overloading of various operators Ex: Binary operators. Write programs illustrating how exceptions are handled (ex: division-by-zero. Program illustrating function overloading feature. etc. 4. 4. overflow and underflow in stack etc) Data Structure: 1. Binary search Insertion sort Merge sort Quick sort Selection sort Heap sort Shell sort 13 . 10. constructor with arguments. Unary operators. Science. Single. 3. 5.Syllabus (Board of studies – 25th Feb 2006) 06BCE 213L L OBJECT ORIENTED PROGRAMMING LAB (Implementation of OOPS AND Data Structures Concepts) T P 2 C 2 1. Sorting: a. 7. d. f. 3. hierarchical inheritance etc. Write a program having student as an abstract class and create many derived classes such as Engg.B. Create their objects and process them. Programs illustrating the use of following functions : a) Friend functions b) Inline functions c) Static Member functions d) Functions with default arguments. from students class. c. Multiple.
(Computer Science and Engineering) . 4. Forward and reverse characteristics of PN junction diode. Switching characteristics of BJT SCR and MOSFET. 16. 17. Design and testing of Half and Full subtractor. Study of decade counter using flip-flops. 7. 3. Study of CRO and measurement of amplitude frequency time period and phase angle. 18. 11. V-I characteristics of tunnel diode and varactor diode.B. 13.Tech. V-I characteristics of SCR and TRIAC. Static emitter characteristics of UJT and PUT. Study of Logic Gates (AND OR NAND NOT EXOR gates). 8. testing of code converters. Design and testing of Half and Full adders. Characteristics of Zener diode and study of its power ratings. Study of Flip flops (D T JK SR flip-flops). 14. 9. 2. Implementation and testing of 3 bit binary ripple counter. Drain and transfer characteristics of JFET and graphical determination of transconductance. Implementation and testing of Multiplexers. 12. 14 . 5. 6. Implementation and. 10. 15. ELECTRONIC DEVICES LAB T P 2 C 2 Input and output characteristics of BJT (CE CB CC) and graphical determination of h-parameters. Implementation of shift registers using flip-flops.Syllabus (Board of studies – 25th Feb 2006) L 06BCE 215L LIST OF EXPERIMENTS: 1.
System Reliability .np-chart. Thomson.theory of estimation. 15 .CRD-RBD-LSD. 2. • 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. 4. 2002. 2000. Md.Little's formula . Statistical Quality Control: Control Charts . A. ANOVA: One way and Two way classifications.small sample tests Student’s t-distribution . STATISTICS AND RELIABILITY * L 2 T 1 P 0 C 3 Aim and Objectives: The aim of the course is to motivate the students to address the relevance of Probability and Statistical Theory to Engineering problems. Probability and Random Variables: Axioms.. V.L.Moment Generating Function-Characteristic Function-Regression and Correlation.x -chart.p-chart. Bhat. 3rd Edison.Conditional Distribution and Density Functions. Freund.L.R.Tech. Ltd. 7th Edition..Joint Density. REFERENCE BOOKS: 1. S. Weibull distributions. Gamma. Statistical Parameters: Mathematical Expectation. 1999.E. By the end of the course.Syllabus (Board of studies – 25th Feb 2006) 06BCE 202 PROBABILITY.Variance. “Probability and statistics for Engineers and Scientists”. R. 3rd Edition. 2003. 2nd Ed.Pure Birth and Death Models.Partial and Multiple correlations. DeGroot.Control Charts for Measurements . Normal. TEXT BOOK: 1.Myers.Hazard Models. New Delhi. Addison-Wesley. J. “Mathematical Statistics”. “Modern Probability Theory”.Reliability Allocation Maintainability and Availability.Random Vector-Joint Distribution.Myers and K. New Age International Pvt. Tests of Statistical Hypothesis: Large sample Tests . Rohatgi. Prentice Hall International. 1998.Walpole. B. (Computer Science and Engineering) .. Inc.Binomial.Devore. 2002.. Exponential. 5.Chi-square test.Exponential Distribution. Queuing Theory: Preliminary Ideas (Markov Chains) .Procedure of Testing Hypothesis. R. students will • Have an understanding of the Probability concepts.Baye's Theorem.K. The most desirable is to expose students to practical applications of expectation and probability that provide the proper tools for handling the design of the system that involve randomness. Pearson Education.B.K. Poisson. 5th Edition. Probability and Statistics. 3. Morris H. Probability and Statistics. John Wiley & Sons.Independent Random Variables. “An introduction to Probability and Statistics”. and Ebsanes Saleh. New York.Independent EventsRandom Variables-Distribution Function-Density Function (PDF). JE.R-chart.c-chart Reliability: Terms related to Reliability.H.Conditional Probability.Control Charts for Attributes.Ye.F-test .
Ethics. Kenry Korman.Addison.Prentice Hall .B.1995..Syllabus (Board of studies – 25th Feb 2006) REFERENCE BOOKS 1. Deborah.1993.Tech.“How to communicate Technical Information” . and Social Values” .G. 17 . 2.Wesley . Jonathan Price.“Computers.Johnson. (Computer Science and Engineering) . Helen Nissenbaum (eds) .
REFERENCE BOOKS: 1. Wiley Eastern. TEXT BOOK: 1. Bhurchandi. features of 80486. Ray and K. programmable DMA controller(8257). Tata McGraw Hill. the advances in processors – overview of Pentium – I. programmable interrupt controller 8259A. Keyboard and display controller 8279. Instruction set of 8086. peripheral devices. Tata McGraw Hill. processors. II. virtual addressing mode. programmable Interrupt controller (8259). Instruction set and aspects of assembly language programming. (Computer Science and Engineering) . Pentium – III. Douglas V. Programmable interval timer 8253. Hall. Introduction to 8086 Processor: 8086 Processor-Introduction.K. register organization of 80386Dx. III. ADC / DAC interfacing. operation and Memory management .Tech. addressing modes. Pentium. pin configuration of 80386. Register set of 8051. internal architecture of 80386Dx. 8086 architecture. protection. Addressing modes. Peripherals & Interfacing With 8086: Serial & parallel I/O (8251A and 8255). First Edition. basic bus operation of 80286. 80286. “Advanced Microprocessors and Peripherals”.B.M. 2000. 2000. Pin configuration. Goankar. Assembler directives. Assembly language programming. Programmable DMA controller 8257. 386. 80286 Processor: Features of 80286. real addressing mode.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. 2. 8086 in min/max mode.the 80386 and 80486 processor features. Pentium – IV. addressing modes. Objectives: The student shall be able to understand 8086 processor design and basic operations. register organization of 80486. Pentium – I. architecture of 8051. 1999. IV and Microcontrollers 8051. 80386 and 80486 Processor: Features of 80386Dx. “Microprocessor Architecture Programming and Applications with 8085”. Advance In Microprocessors: Features of Pentium processor.the 80286 processor features. operation. PIT (8253). Pentium – II. fetch cycles of 80286. internal architecture of 80286. “Microprocessors and Interfacing Programming and Hardware”. Introduction to microcontroller 8051. 18 . A. Keyboard and display controller(8279). privilege. Interface peripherals with 8086 serial and parallel I/O (8251 A & 8255).
B. “Communication Systems”. A. “Analog and Digital Communication Systems”.Tech. 1992 19 . DM. McGraw Hill. Carlson. Analog modulation systems Basic principles of Amplitude Modulation (AM). “Digital Communication”.P.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. (Computer Science and Engineering) .Lathi.B. ADPCM. Proakis. Amplitude modulation and demodulation techniques. “Principles of Communication”. 1990 2. Simon Haykins. 1992 2. 1992 3. 1990 REFERENCE BOOKS: 1. base band pulse shaping – binary data formats – base band transmission – Intersymbol Interference (ISI) – correlative coding – optimum SNR – matched filter detection. Tata McGraw Hill Publication. FM & PM systems performance – threshold effects reduction Base band data communication Sampling & quantization – PCM. Taub & Schilling. TEXT BOOKS: 1. PHI. 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. ADM. Frequency Modulation (FM) & Phase Modulation (PM) – spectra – power consideration – receiver’s characteristics and deduction of AM. B. Digital modulation Digital modulation – coherent binary modulation techniques – coherent quadrature modulation techniques – noncoherent binary modulation – m-array modulations – performance of digital modulation systems based on probability if error – bandwidth – ISI Spread spectrum and error correction techniques Fundamental concepts – direct sequence spread spectrum and frequency hopping spread spectrum – Block codes – Cyclic codes. McGraw Hill. “Principles of Communication”. PHI. and basic band pass digital communication systems.
Formal specification in the software process. Project management activities. Software change & re-engineering. Information presentation. Modular decomposition. ISO 9000 and Six Sigma. User support. Software Evolution. develop an efficient software system through group cohesiveness. Software cost estimation. Industry Standards: Overview of Managing software people.B. Addison-Wesley. Requirements management.User interface design principles. Data and Object models. Design patterns. User interface prototyping. Process iteration. Interface evaluation. version and release. 2004.Context. User interaction. System requirements. Automated static analysis. Application families. "Software Engineering". Software Specification. and System Development. Overview of Legacy Systems. Roger S. System Models. Reliability validation. Configuration managementplanning and managing change. Ian Sommerville.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. Behavioral. Overview of SEI-CMM. Object-oriented testing. McGraw Hill. Integration testing. Domain-specific architectures. Overview of Quality management & Process Improvement. System Specification.Defect testing. 20 . Software testing. 2004 REFERENCE BOOK: 1. TEXT BOOK: 1. Control models.Prototyping in the software process. User interface design . Security assessment. Software process models. Project scheduling. Over view of CASE tools. Critical systems validation. Rapid prototyping techniques. (Computer Science and Engineering) . "Software Engineering". Object-oriented and Real-time software. Verification and validation. Cleanroom software development. Design with Reuse. Behavioral specification Architectural Design: System structuring. Safety assurance. User requirements. Algorithmic cost modeling. use the testing tools and methods. Risk management. CASE workbenches. Estimation techniques.Project planning. Software design and implementation. Software prototyping. Requirements elicitation and analysis.Tech. Objectives: The students would be able to analyze software requirements. Software inspections.Component-based development. Software Engineering Fundamentals: The system engineering process. Pressman. Critical Systems: Overview of Dependability.Productivity. Requirements Engineering Processes: Feasibility studies. Formal Specification. Project duration and staffing. Requirements validation. Interface specification.Formal methods and critical systems. Software requirementsFunctional and non-functional requirements. Overview of design for Distributed systems.Planning. software requirements document. Software validation.
“Data Base System Concepts”.Codd Rules Relational model. TEXT BOOK: 1. and allocation techniques. languages & systems: The relational data model. active databases. Database design theory and methodology: Functional dependencies and normalization for relational databases – relational database design algorithms and further dependencies – practical database design and tuning. Addison Wesley. Replication.Recovery concepts. (Computer Science and Engineering) . Distributed Database: Introduction and Concepts. Tata McGraw Hill. Concurrency control techniques: Locking techniques. system implementation techniques. They will be able to analyze and design ER model for a customized application and distributed databases.B. 3rd ed. database modeling and design. shadow paging.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. Federated systems. discretionary access control based on granting and revoking of privileges. PL/SQL. and some other concurrency control issues Database recovery techniques. Database security and authorization. and the relational algebra – SQL – the relational database standard – ER to relational mapping and other relational languages – Oracle Architectures. 1997. basic algorithms for executing query operations. 2000 REFERENCE BOOK: 1. 21 . concurrency techniques. database backup and recovery from catastrophic failures. using locks for concurrency control in indexes. System Implementation Techniques: Database system architectures and the system catalog – query processingTranslating queries to relational algebra. Elmasri & Navathe – “Fundamentals of Database Systems”. time stamp ordering. using heuristics in query optimization – transaction-processing concepts. relational constraints. Data Fragmentation. Other primary file Organizations – Index structures for files.. Hashing Techniques. arise algorithm. Objectives: The students shall be able to understand fundamental concepts of database management system.Tech. Recover techniques based on deferred update and immediate update. tune.F. SQL. Basic concepts: Data bases and databases users – database system concepts and architecture – data modeling using Entity Relationship model – Files of Unordered & Ordered Records.E. maintain a database application and advance database concepts. Korth and Silberschatz. implement.Introduction to database security issues.
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.
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
4. Using Ex 3. 1. Drop unique constraint for item-name 2. Disable the constraint Nn-rate 3. Insert a record with NULL values for rate unit 4. Enable the constraint with NULL value existing on rate-unit 5. Create a table EMP mentioned above and test all the arithmetic functions and character functions. 6. Add a field date-of-birth to EMP table and test all the date functions. 7. i) Modify EMP table adding a new field BONUS, update it using NVL ii) Retrieve the employees whose name starts with S. iii) Select all the employees who are working in IT department. 8. I) Using EMP table find the employee getting maximum salary ii) Find the employee whose salary is minimum iii) Find the sum of salaries of all the employees working in ‘ACCOUNTS’ department. 9. Create a table DEPT with the following fields DNo. Primary Key DName
B.Tech. (Computer Science and Engineering) - Syllabus
(Board of studies – 25th Feb 2006)
Modify EMP table adding a foreign key constraint on DeptNo. i) ii) Insert 6 records into Dept. Implement the following Join operations a) Self Join b) Equi Join c) Non Equi Join d) Outer Join e) Natural Join
10. Using EMP and DEPT, implement all type of view techniques. a) Row subset view b) Column subset view c) Row column subset view d) Grouped view e) Joined view f) With check option 11. Using EMP and DEPT a) Create a sequence to insert the empno in EMP table b) Create a synonym for the above two tables PL/SQL Programming 1. Create a cursor to update the salary of employees in EMP table 2. a) Write a PL/SQL program to raise an Exception i) When the bonus exceeds salary b) Write a PL/SQL program to test the built-in Exceptions 3. Write a procedure to insert a record into ORDER table by validating qty limit of the item and also check whether that item exists. 4. Write a function to find substring. 5. Create a trigger which checks whether employee with Emp_no is present in the Employee table before inserting into EMP.
“Discrete Mathematics”.C.. Trembley and R. Tata McGraw Hill. 3. 2. 4.The Application of Residue Arithmetic to Computers . 2001.Group Codes. Graph Theory: Basic Concepts of Graph Theory . (Computer Science and Engineering) . J.Boolean Functions Representation and Minimization of Boolean Functions. 2001. Inference Theory: The Theory of Inference for the Statement Calculus -The Predicate Calculus . “Discrete Mathematical Structures with Applications to Computer Science”. Algebraic structures and graph theory to computer science and engineering problems.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. the students are expected to use inference theory in circuit models.Groups . “Elements of Discrete Mathematics”. Lattices and Boolean algebra: Lattices as Partially Ordered Sets .Principal Conjunctive Norm Forms.L.Kolman.Liu.S.Arunachalam.Principal Disjunctive Norm Forms .Grammars and Languages. Vikas Pub. Tata McGraw Hill – 13th reprint.B. TEXT BOOK: 1. “Discrete Mathematical structures”. Richard Johnsonbaugh. graph theory in network models and lattices & Boolean algebra in Boolean functions. Lipson. 5th Edition.Tech.Chandrasekaran. R.Iyengar. 25 . 2000.Busby and S.Normal Forms .Ch. and algebraic theory in computer science problems. Set Theory: Basic Concepts of Set Theory.Ross. N. S. 2nd Edition.Boolean algebra . V.Trees -Storage Representation and Manipulation of Graphs. 5.Tautologies .S.A.Polish Expressions and their Compilation . C.P. 2002. Mathematical Logic: Introduction -Statements and Notation . K.N. 4th Edition.Matrix Representation of Graphs . 2002. 2003. “Discrete Mathematics”.Venkatesh and P.M.Manohar.Functions. Pearson Education.Connectives . PHI. B. Lipschutz and M. “Discrete Mathematics”.Inference Theory of the Predicate Calculus. 2nd Edition. By the end of the course.Equivalence Implications . Tata McGraw Hill.C.Recursion Algebraic Structures: Semigroups and Monoids .Relations and Ordering. REFERENCE BOOKS: 1.
Packages. strings and vectors: arrays. 1998. wrapper classes. File statistics. Applet programming and Files Applet programming. 2002 REFERENCE BOOKS: 1. Addison-Wesley. inheritance: extending a class. Objective: The students would be able to understand and develop web applications. “JAVA How to program”. command line arguments.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. Decoding forms in other languages. strings. programming in CGI. getting input from the user. Overview and architecture of a Servlets. 5th Edition. java tokens. constructors. Constants. vectors. objects and methods. multithreaded programming. TCP/IP Sockets and Datagram Sockets. overriding methods. Shishir Gundavaram: “CGI Programming On the World Wide Web”.B. decision making and branching. multithreading and Exceptions Interfaces: multiple inheritance. Handling HTTP GET and POST requests. 1996. Common errors. Deital H. implementing the “runnable” interface. java virtual machine. implementing a java program. Arrays. synchronization.Tech. simple java program. designing applications using forms in PERL. Introduction to java Overview of java language: introduction. Output from CGI and response headers. java statements. TMH. abstract methods and classes. environmental variables. 1996. Forms and CGI: HTML tags. Interfaces. Using JDBC in Servlets. Classes.configuration. Input to the CGI-environmental variables. 6th Edition. “JAVA 2: The Complete Reference”. Deital P. interactive input and output. visibility control. Pearson Education. other stream classes Networking and Servlets Introduction to networking using Java API. finalize method. configuring the server. onedimensional arrays. languages under different operating systems. creating of files. Examining environmental variables. (Computer Science and Engineering) . Tailoring SSI output. Kenarnold and James Gosling: “The Java Programming Language”. 4. expressions. Managing errors and exceptions. Herbert Schildt. variables. O’ Reilly and Associates. Addison-Wesley.M. 26 .J. Executing external program and CGI programs. two-dimensional arrays. Including boilerplates. Common Gateway Interface (CGI) CGI applications. TEXT BOOKS: 1. 2. Managing input/output files in java. 2005. packages. 3. sending data to the server. Thomas Boutel: “CGI Programming In C and Perl”. accessing from input. static members. creating an array. Server side includes (SSI). operators. data types. input/output exceptions. final variables and methods. programming style. designing a web page. methods overloading.
Integrated Circuits. Multiprocessors. (Computer Science and Engineering) . 2003. Operating Systems. Bus control – IO and System Control: Programmed IO. Sequential ALU – Advanced Topics. and reliability. Arithmetic Logic unit: Data Path Design-Fixed point arithmetic-Addition and Subtraction. Serial Access Memory. memory systems: Multilevel memories. Design process.Communication methods: Basic concepts. 27 . Address translations.Processor Level Components. “Computer Architecture and Organization”. India. IO processors.B. Division. Floating point numbers. John P. overlapping communication and computation.Mechanical Era.Tech.Floating point Arithmetic. John. The Gate level – the Register level. – Data Representation: Basic formats.the evolution of computers. Objectives : At the end of the course students should be able to understand the basic principles such as locality of reference. Processor Architecture. – Instruction Sets: Instruction formats. Elements of Computers. Register level design – the Processor Level . Design Methodology . 3rd Ed. Hayes. Pipeline Processing Memory Organization: Memory technology: Memory Device Characteristics. – Parallel Processing: Processor –Level Parallelism. Hennessy & David A. address mapping. Elsevier. Patterson. System Architecture. Programming Considerations. system organization. TEXT BOOK: 1. – Arithmetic – Logic Units. Memory Allocation – Caches: Main features. System Organization. the design of computers. Fixed –Point Numbers. Memory Management and Networking. Processor Basics: CPU organization: Fundamentals.System design . also how the computer systems are organized and the characteristics of modern processors that affect system architecture. DMA and Interrupts. hardware components. programmable logic devices. REFERENCE BOOK: 1.Register . 3rd Ed.System Representation. Instruction Types. “Computer Architecture”. including the instruction sets. Multiplication.level components. The later generation – the VLSI era . Structure versus performance. coarse-grain parallelism. L. Electronic Computers. Processor level design. Limitations of Computers . Introduction: Nature of computing. 1998. performance/power trade-offs.Combinational ALU. and Fault Tolerance. McGraw Hill. Random Access Memory (RAM).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.
Indra Widjaja. Pearson Education. Routing in Packet Networks. A. Security and Cryptographic Algorithms. etc. Tanenbaum. Prentice Hall India. different topologies like Star. Architecture of Networks. Transmission Control Protocol. Objectives : Students shall be able to understand about working of Intranet. William Stallings. "Communication Networks". 2003 28 . Cryptographic Algorithms TEXT BOOK: 1. "Computer Networks". and also future Networking Technology. DHCP. Shortest Path Algorithms. different switching techniques. Mesh. and Introduction to traffic management & QoS.. 4th Edition. security protocols & security algorithms Networks and Services: Approaches to Network Design. client/server systems.Tech. Tata McGraw Hill. 2003 2.Syllabus (Board of studies – 25th Feb 2006) L 06BCE 307 COMPUTER AND COMMUNICATION NETWORKS 3 T 0 P C 3 Aim: The subject aims to introduce basics of Networks. different internetworking devices like bridges. Leon-Garcia. congestion & traffic control. WAN.Introduction to MPLS and Differentiated Services. MAN setups. etc. different network architectures. Application Protocols and TCP/IP Utilities Peer-to-Peer Protocols: Service Models. OSI Reference Model. Sliding Window Flow Control. User Datagram Protocol. Network design approaches. Packet Switching Networks: Network Services and Internal Network Operation. “Data and Computer Communications". Ethernet networking. 2000 REFERENCE BOOKS: 1. various functions of layers. ARQ Protocols. Overview of TCP/IP Architecture. Introduction to Internet Routing Protocols Advanced Network: Architectures and Security Protocols. LAN. Security Protocols. different protocol standards. routers. Packet Network Topology. LAN access methods. Introduction to LAN Standards and LAN Bridges. (Computer Science and Engineering) . switches. Multiple Access Communications. Andrew S.B. 7th Edition. Limitations of IPv4 and Introduction to IPv6. TCP/IP Architecture: The Internet Protocol. RSVP.
“Introduction to Languages and the Theory of Computation”. K. Tata McGraw Hill. Prentice Hall of India.Tech. REFERENCE BOOK: 1. Conversion of NFA into DFA Theorem & Problem: Chomsky hierarchy of language. Overview: An overview of grammars and languages. Unsolvable Problems & Computable Functions: Rice theorem – Halting problem – Post’s correspondence Problem – Primitive recursive functions – Godel Numbering – Recursive and recursively enumerable languages. "Theory of Computation". 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. Construction of NFA and DFA from Regular expressions. 29 . Regular expressions and Regular languages Finite Automata and its minimization.P Mishra. Non – determinism and kleenes theorem – pumping lemma – Decision problems. 1998.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.L. N. John C. 2nd Edition. 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. 1997. TEXT BOOK: 1. 3rd Edition. (Computer Science and Engineering) . Computational complexities and NP – Completeness. Chandrasekaran. 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. Martin. Automata Theory and Abstract models of Computation and Computability. efficiently solvable.B. and simply solvable or it cannot be solved.
Lattice of Fuzzy Numbers.B. Ross T. REFERENCE BOOKS: 1. Fuzziness of Fuzzy Sets. Nonspecificity of Fuzzy and Crisp Sets. Implementation of GA. Application of Fuzzy Logic: Medicine. ANN training algorithms – perceptron.Tech. Back Propagation Algorithm. unsupervised and reinforcement learning. Associative Memories. Fuzzy Qualifiers. Learning rules. 1997 3. “Fuzzy Sets. fuzzy sets. Optimization and Machine Learning”. Addison Wesley. Multilayer perceptron Model. Learning Paradigms – supervised. 1995 2. Klir and TA Folger. Classical and Fuzzy Sets: Overview of Classical sets. “Genetic Algorithms in Search. fuzzy arithmetic.M. E. Economics Etc. Uncertainty. learning algorithms. aggregation operations. Mathematical Models of Neurons. training rules. overview of biological Neuro-system. 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. Applications of Artificial Neural Networks. Fuzzy Arithmetic: Fuzzy Numbers. Jaico Publishing House. J. handling uncertainty and problem solving using genetic algorithms Neural Networks: History. Intersections. 30 . Multivalued Logics. learning in biological neuron. Combination of Operations.J. Uncertainty based Information and Application of Fuzzy Logic: Information and Uncertainty. Arithmetic Operations on Intervals and Numbers. “Fuzzy Logic with Engineering Applications”. Fuzzy Equations. Goldberg. Genetic Algorithm: An Overview. David. McGraw Hill. GA in problem solving. Fuzzy Propositions. Delta. Hopfield Networks. Membership Function. Zurada. Fuzzy Logic: Introduction to Fuzzy Logic. Linguistic Variables. TEXTBOOK: 1. “Introduction to Artificial Neural systems”.Complement. ANN Architecture. Prentice Hall (1988). (Computer Science and Engineering) . 1985. Union. and Information”. Fuzzy Logic: Classical Logic. Linguistic Hedges. Fuzzy Rule generation.Syllabus (Board of studies – 25th Feb 2006) L 06BCE 311 SOFT COMPUTING 3 Aim: The subject aims to introduce neural networks. Operations on Fuzzy Sets.
Write graphical user interface for the sales database which lists all the customer names in one choice box and all products in another. 31 . 12. ii). 2. display a list with the customer name. Write a program to display the name and address of the computer that we are currently working on. 13. Write a program for the above 7. The message entered in the client is sent to the server and the server encodes the message and returns it to the client.e. Remote object interaction. Write a program to create a daemon process. and date of order by the customer with the name of that product. This process is done using the TCP/IP protocol. product. 9. When the user selects a customer name and product and press the “submit” button.Tech. 11. 3. Write a program to develop a simple Chat application. File downloading and uploading. Write a program to capture each packet and to examine its checksum field. (Computer Science and Engineering) . This process is done using UDP. T P 2 C 2 5. b as c …z as a.Syllabus (Board of studies – 25th Feb 2006) L 06BCE 313L NETWORKING LAB 1. a as b. Encoding is done by replacing a character by the character next to it i. 8. Use prepared statements whenever possible. Design and populate a database for a car rental system. The message entered in the client is sent to the server and the server encodes the message and returns it to the client. Write a program to display the client’s address at the server end. Write a Java program to implement this scenario. quantity. 4. Write a program for the above 6. 10. Write program to illustrate the following: i). Write a program to implement an echo UDP server. Allow the client to check the availability of a category of car and to make reservation.B. a as b. A server should run for 10 secs and generate numbers continuously. Write a program to display the server’s date and time details at the client end.e. b as c …z as a. Encoding is done by replacing a character by the character next to it i. The client connecting to it should read data and find out the sum of the data thus read.
Develop a stand-alone java application program that exploits the graphics processing capability of the java language. HTML and JAVA Mini-project has to be completed and submitted. (Computer Science and Engineering) .Tech. develop html and CGI programs in java for web based applications like bank transaction. 2. 32 . The evaluation is based on the demonstration and viva. student information system etc.Syllabus (Board of studies – 25th Feb 2006) L 06BCE315L INTERNET PROGRAMMING LAB Exercises on inter networking involving CGI. On a computer network consisting of WINDOWS NT LINUX/UNIX machine running a web server software and client machines running a browser. The student has to submit a report to the examiner. T P C 2 2 1.B.
Three Address Code : . Ravi Sethi. Alfred V. Code optimization.Top down parsing: Recursive-Descent parsing. Assemblers & Macros : Issues in the design of a code generator. Operating precedence parsing: design of operator precedence table. TEXT BOOK 1.M. Steven S. bootstrap arrangement. Code optimizations:. and life times. addressing array elements. Lexical Analysis phase: .Elimination of ambiguity.Construction of SLR parser tables and parsing .declarations. logical phases of compiler. CLR parsing-LALR parsing. parameter passing. Techniques. Regular expressionsOverview of automata-Thompson construction NFA-DFA-minimized DFA-lexical errors. Jeffery D.The principle source of optimization. lexemes.Storage classes. visibility.Syntax errors-Yacc Semantics & runtime environments : Syntax-directed definitions. cross compiler.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.Design issues-patterns.Source language issues.Shift-Reduce parsers. Non. construction of syntax trees. basic blocks.Lex Syntax Analysis : Role of parser-Context Free Grammars-Parse Tree. (Computer Science and Engineering) . l-attributed definitions. the target machine.recursive predictive parsing. storage organization. Tokens-attributes. 2. LL(1) grammars. Boolean expressions.local and global symbol table structures and management. DAG’Sbottom-up evaluation of s-attributed definitions. Objectives: At the end of the course students should • be able to discuss implementation issues of complier for a sample language. Compiler Vs Interpreter. optimization of basic blocks. Muchnick “ Advanced Compiler Design Implementation “ Elsevier Science India. parsing –LR parsers:. Bottom-Up parsing:. D.specification of tokens. case statements.Tech. symbol tables:. Run-time environments:. • be able to design computational model for finite automata • be able to analyze the optimization techniques of complier. loops in flow graphs.B. Introduction to compiling and lexical analysis : Introduction to language processor.attributes-entries. and tools” Pearson REFERENCE BOOKS : 1. access to non-LOCAL names. pass Vs phase-cousins of compilers. Aho. assignment statements. storage-allocation strategies. Intermediate Code Generation & Optimization : Intermediate languages. DAG’sElements of Assembly language – assemblers – Passes of an assembler-Macros-design of macro processors – passes of a macro processor.Ambiguity. back patching. Dhamdhere “Systems Programming and operating systems” Tata McGraw Hill Pub 33 . Reducing the memory access times by exploiting addressing modes-peephole optimizations. Ullman “Compilers – Principles.
macro development process. Management Issues.B. applying the notation. state transition diagrams. Tata McGraw Hill. Tools. Interaction diagrams. Quality Assurance and Metrics. 1994.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. Workflow and phases of the Unified process. 2003 34 . (Computer Science and Engineering) . Grady Booch. "An Introduction to Object-Oriented Systems Analysis and Design with UML and the Unified Process". REFERENCE BOOK: 1. module diagrams. "Object Oriented Analysis and Design with applications". Analysis and Design: Case studies. decomposing complexity. Objectives: The students would be able to understand the techniques. Schach. Object-Oriented Design Workflow. Stephen R. Testing. User Interface system. Principles. Maintenance. Documentation. Elements of object model. Release management. TEXT BOOK: 1. applications and UML based object oriented analysis and design. Management and planning: Staffing. Introduction to Web – Based Systems. micro development process. Object Model: Evolution. Complexity of software: Structure of complex systems. Planning and Estimating. the Requirement Workflow. Designing complex systems. UML and related methodologies. Teams. Benefits and Risks of Object Oriented development Introduction to Object-Oriented Paradigm and UML: Unified Process. Applying object model Elements of Notation: Class diagrams. process diagrams. Addison Wesley.Tech. object diagrams. Reuse. ObjectOriented Analysis Workflow..
the self/directory. representation of file system in the kernel. 1998 2. communication via files. the kernel daemon. A. an example module.B. pipes. TEXT BOOK : 1. network devices under linux. debugging using ptrace. Mark G. an example of DMA operation. lilo-the linux loader. The net/directory. the sys/directory. ps. The boot process: carrying out the boot process. the hardware. implementing system calls. shutdown. the proc file system and ext2 file system. initialization. serial interface. and debugging: Device drivers . 1997 (Chapters 1 to 9. Modules. important structures. (Computer Science and Engineering) . Network implementation : Introduction concepts. IP.C. system V IPC. kernel-related commands: free. top. introduction to the kernel . and parallel interface. init. network interface. file system. Device drivers. memory management. block device caching. Bek Et Al : LINUX Kernel Internals. main algorithms. System calls. IPC. polling and interrupts.architecture-independent memory model.Character and block devices.Synchronization in the kernel. IPC with sockets. File system -basic principles. what can be implemented as a module? Parameter passing.D) REFERENCE BOOKS : 1.Tech.concepts. Addison-Wesley. File System: IPC.concepts.important data structures. Appendices. ARP. traceroute. The proc file system: the proc/directory. Remy Card Et Al : The LINUX Kernel Book. 35 . John Wiley. message oriented protocols Introduction : Linux – the operating system. boot process System calls : Process management. all that remains. 1997. Sobel : A Practical Guide To LINUX. communication. the file system. implementation in the kernel. the packet interface. virtual address space for a process. pages under linux.UDP and TCP. strace. implementing a driver. modules. debugging with gdb. Debugging. Memory management . compiling the kernel. mount. the debugger printk(). Addison-Wesley. commands. M. configuring kernel. system related utilities.B.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.
Parallel. Inc. Stallings William. Memory Management. processes & Threads. Greg Gagne. CPU scheduling algorithms.Tech. Deadlocks Memory. I/O Systems. Multiprogramming. (Computer Science and Engineering) . Introduction: Computer-System Structures. Operating-System Structures Process Management: Processes. File-System Interface. John Wiley & Sons. Distributed File Systems. CPU Scheduling. Abraham Silberschatz. TEXT BOOK: 1. Mass-Storage Structure Distributed System: Distributed System Structures. scheduling algorithms and distributed file systems Objectives : The students would be able to understand and explain various OS concepts such as time-sharing. Security Case Study: The Linux System. 6th Edition REFERENCE BOOK: 1. Distributed Coordination. "Operating System Concepts". Prentice Hall of India. Semaphores and Critical regions. Virtual Memory. "Operating Systems". Deadlock prevention. File-System Implementation. memory management. I/O systems and File Systems They would be able to use Linux system.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.B. File & IO Management: Memory Management. Peter Baer Galvin. Process Synchronization. Fourth Edition 36 . Windows 2000. Distributed systems. Threads. Protection. windows 2000.
cut set matrix. walk. 1998. J. Prentice Hall India. tournament.N. N.B. four color problem. paths. disconnected graphs.Harary. directed paths and connectedness. kuratowski’s graphs. spanning trees. E. connectivity. circuit matrix. trees-matrix representation. Graph Theory. 1981. Properties.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. minimal spanning tree. Combinatorial Algorithms: Theory And Practice. and adjacency matrix. Graph Theory With Application To Engineering And Computer Science. Introduction Definitions. trees. fundamental circuits. distance and centers. matching. operation on graphs operation on graphs. planar graphs. Networks And Algorithms. chromatic partitioning.Tech.S. dual graphs. TEXT BOOK: 1. Matrix representation of graphs Incidence matrix. 1995. cut vertices. fundamental circuits and cut sets. (Computer Science and Engineering) . N. 3.Nievergelt. circuits. F.J. covering. Narasing Deo. Swamy. 1-2 isomorphism. 2. fundamental matrices. relationships amongst matrices. Tulasiraman And M. Different types.Cut sets Properties. spanning tree.1977. separatability.M. algorithms for connectedness. covering and partitioning Directed graphs Chromatic number. Cut sets. connected.Deo. importance. Graph theoretic algorithms Computer representation of graphs – input & output. Prentice Hall. isomorphism. Euler digraphs. Graph. Trees. Planar and Dual Graphs Coloring. network flows. Addison Wesley/ Narosa. directed circuits and shortest paths. fundamental circuits. John Wiley. Euler and Hamiltonian graphs. detection of planarity.Reingold. path matrix. 37 .Planar and dual graphs -Combinatorial representation. REFERENCE BOOKS: 1.
B. (Computer Science and Engineering) .Syllabus (Board of studies – 25th Feb 2006) SYLLABUS 06BCE314L (VI – SEMESTER) L T P 2 C 2 LINUX SYSTEM PROGRAMMING LAB To carryout a mini project based on the various system related commands learnt in the theory subject. 38 .Tech.
10. Implement banker’s algorithm. (Computer Science and Engineering) . Program to report the behavior of the OS to get the CPU type and model. 5. 15. Implementation of page replacement algorithms. Write a program to create processes and threads. kernel version. 14.B. Implement the solution for dining philosopher’s problem. Signaling process 13. Implement the various process scheduling mechanisms such as FCFS. Implement the solution for reader – writer’s problem. 4. Inter Process Communication (IPC) using Message Queues. SJF. 11. Program to get the amount of memory configured into the computer. 6. Implement the first fit.sec. Priority. Implementation of wait and signal using binary semaphores. 12. round – robin. 7.Syllabus (Board of studies – 25th Feb 2006) L 06BCE 316L OPERATING SYSTEM LAB T P C 2 2 1. 3. 39 . After it started where K is a command line parameter. 8. 2. Implementation of wait and signal using counting semaphores. IPC using pipes. best fit and worst fit file allocation strategy.Tech. 9. Write a program that uses a waitable timer to stop itself K. amount of memory currently available.
HDD Problems – Over view of Advanced PCs. Ltd.. Pub. 6th Reprint. 1993. Objective : To assemble a PC and identify the frequently occurring errors and troubleshooting appropriately. “IBM PC and Clones Hardware. 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. REFERENCE BOOK: 1. Trouble Shooting and Maintenance”. B. 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 . Govindarajulu. 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.B. 40 . Tata McGraw Hill. 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. 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) .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.Tech.
Memories and I/O Devices. software engineering practices in embedded systems development and Inter process communication. 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. Tata McGraw Hill.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.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. 2003 REFERENCE BOOKS: 1. Practice & Design”. Devices and Buses for Device Networks: I/O Devices – Timer and Counting Devices – Serial Communication Using the I2 C. Berger.B. programming models and Interprocess communication.Tech. “Embedded Systems Design”. their design and applications. PCI – X and Advanced Buses Device Drivers and Interrupts Servicing Mechanism: Device Drivers – Parallel Port Device Drivers in a System – Serial Port Device Drivers in a System – Device Drivers for Internal Programmable Timing Devices – Interrupt Servicing (Handling) Mechanism – Context and the periods for Context – Switching. PCI. Task & Threads – Multiple processes in an Application – Problems of Sharing Data by Multiple Tasks & Routines – Interprocess Communication. TEXT BOOK: 1. Introduction to Embedded Systems: Processor in the System – Software Embedded into a system – Exemplary Embedded Systems – Embedded System-On-chip and in VLSI Circuit Processor and Memory Organization – Structural Units in a Processor – Processor Selection for an Embedded System – Memory Devices – Memory Selection for an Embedded System – Allocation of Memory to Program Segments and Blocks and Memory Map of a System – Direct Memory Access – Interfacing Processor. device drivers. Rajkamal. Arnold S. 1997 41 . CMP Books. Deadline and Interrupt Latency Program Modeling Concepts: Single and Multiprocessor Systems Software – Development Process. “Embedded Systems-Application. ‘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. (Computer Science and Engineering) .
Audit records Viruses and related Threats – Firewalls: Firewall design principles – Firewall characteristics – types of firewalls – Firewall configurations. Objectives: The students would be able to understand and use encryption algorithms such as RSA.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.Different approaches of Intrusion detection . Services & Mechanisms: Security attacks – Security services – Network Security Model. Electronic Mail Security: Pretty Good Privacy – PGP services – Transmission and reception of PGP messages – PGP message generation – PGP message reception. Conventional Encryption: Classical Techniques: Conventional Encryption model . Prentice-Hall of India Pvt Ltd. Charlie Kaufman.Stenography – Classical Encryption Techniques. TEXT BOOK: 1. Intruders and Viruses. William Stallings “Cryptography and Network security – Principles and Practice". (Computer Science and Engineering) . 2nd edition. “Cryptography and Network Security”. Worms: Intruders – Intrusion techniques – Password protection – Access control – Password selection strategies -Intrusion detection. It also covers the topics such as cryptography and various encryption algorithms. Raja perlman.B. authentication techniques digital signatures and System-level security issues.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. Tata McGraw Hill. REFERENCE BOOK: 1. “Network Security” – 2nd edition. Crypto-analysis. Pearson Education. 2002. Hash Algorithm: Message Digest algorithm (MD5) – Secure Hash algorithm (SHA-1) – HMAC. Attacks. 2002. 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. Atul Khate. Digital Signatures and Authentication Protocols: Digital signatures – Authentication protocols – Digital signature standard. Public Key Cryptography: Principles of public-key cryptosystems – The RSA algorithm . 2005.Modern Techniques: The Data Encryption Standard – The Strength of DES – Differential and Linear. Blow Fish etc. Mike speciner. 2. 42 .Tech.
Tech. Trouble Shooting in PC’s 11. Programmable Peripheral Interface 6. 7 – segment LED Display Routine 3. Printer Interface 5. Software decoder driver 4. Programmable Timer 8. Keyboard Scanning Routine 2. Hard Disk Drive Mechanism 43 . Floppy Disk Drive. Programmable Communication Interface 7.Syllabus (Board of studies – 25th Feb 2006) L 06BCE413L PERIPHERALS AND INTERFACING LAB T P 2 C 2 1. Data Acquisation System 12. Diagnostics home menu 10. (Computer Science and Engineering) .B. Power On self Test (POST) 9.
Tech. 44 .B.Syllabus (Board of studies – 25th Feb 2006) L 06BCE415L EMBEDDED SYSTEMS LAB T P 2 C 2 Student has to do a mini project based on the knowledge acquired in the theory paper. (Computer Science and Engineering) .
verification & validation. Simulation in inventory analysis. general principles and computer simulation languages. TEXT BOOK: 1. Steps in a simulation study. Useful statistical models.. measures of performance and their estimation. Input Data Analysis: Data collection. identifying the distribution.B. O/P analysis for terminating simulations. parameter estimation. Systems and system environment. areas of application. Introduction to Simulation: Advantages and disadvantages of simulation. Empirical distributions. Verification and validation of simulation models: Model building. goodness-of-fit tests. Statistical Models in Simulation: Review of terminology & concepts. Programming languages for DESS: FORTRAN. Discrete and continuous systems. Modern Statistical Systems and GPSS Simulation. long run measures of performance of queuing systems. Continuous distributions. Simulation of queuing systems. other examples of simulation. Jerry Banks. Transient & steady state behavior of queuing notation. (Computer Science and Engineering) . Random Number Generation: Properties of random numbers. Convolution method. Random numbers & variables. and Dvdewicz. Random variable Generation: Inverse transform technique. Queuing Models: Characteristics of queuing systems. Acceptance-Rejection technique.J. Discrete-event System Simulation. GASP. Output Analysis For a Single Model: Stochastic nature of O/P data. Components of a system. 1991. SIMSCRIPT. Summary and comparison of simulations. Deterministic systems. Generation of Pseudo – random. Inventory Systems: Measures of effectiveness. verification of simulation models. SLAM. and probabilistic systems. PHI. Discrete – events system simulation. Inventory policies. Discrete distributions. John S.Tech. GPSS. tests for random nos. Transient & steady state behavior of queues. Model of a system. discrete event simulation. Simulation of inventory systems. Simulation Examples. queuing notation. Input and output analysis Objectives: The students would be able to understand and use discrete event simulation. statistical methods. statistical models for estimating the effect of design alternatives. Inventory systems. Types of models. 45 . Concepts in DES. calibration & validation of models. Karian. Carson. techniques for generating random nos. types of simulations with respect to O/P analysis. simulation techniques. E. 3rd Edition REFERENCE BOOK: 1. Process. Nos..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. Freeman. Comparison and evaluation of alternative system designs: Comparison of two and several system designs. steady – state behavior of finite population models.A.. Direct Transformation for the normal distribution. O/P analysis for steady-state simulations. Z.
utilization and management of the expensive resources that are remote to the users. Andrew S. encoding and decoding of message data. 2005. client – server binding. granularity. failure handling. file sharing semantics.general architecture of DSM systems. task assignment approach. PHI.Tech. desirable features of good global scheduling algorithm.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. message passing –introduction. threads.passing semantics. call semantics. synchronization. Resource and process Management: Introduction. implementation mechanism. communication protocols for RPCs.Desirable features of good DFS. file caching schemes. mini project using Java RMI Distributed Shared Memory: Distributed shared memory. definition. model. parameter . gaining popularity. authentication. buffering. DCE. thrashing. atomic transaction. TEXT BOOK: 1. security mechanisms and design methodologies of Distributed systems Models & IPC: Introduction to distributed computing system. networked clusters of computers. Pradeep K. server management. security.B. transparency. access control. Tanenbaum. issues in IPC. file models. consistency model. potential attacks to computer system. Distributed File Systems and Security: DFS and security. DCE security service. desirable features of a good message passing system. Objectives: The students would be able to understand and use different network models. issues in design. and file replication. advantages of DSM. load balancing approach. Fault Tolerance. RPC messages. 46 . group communication. file accessing Models. stub generation. replacement strategy. multigram messages. process migration. marshalling arguments and results. structure of shared memory space. clock synchronization. "Distributed Operating Systems: Concepts & Design". REFERENCE BOOK: 1. RPC: RPC-Introduction. exception handling. “Distributed Operating Systems” Pearson Education. (Computer Science and Engineering) . design and implementation issues of DSM systems. evolution different models. cryptography. Sinha. Digital signatures. process addressing. 2002.
Semantic Data Control: View Management – Data Security – Semantic Integrity Control Overview of Query Processing . 1999 REFERENCE BOOK: 1. TEXT BOOK: 1. 1987. Query decomposition. 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. M. (Computer Science and Engineering) . Transaction management and Distributed DBMS reliability. Giuseppe Pelagatti.Syllabus (Board of studies – 25th Feb 2006) 06BCE E05 DISTRIBUTED DATABASE SYSTEM L 3 T 0 P C 3 Aim: This subject aims to cover Distributed Data processing. 47 . McGraw Hill publications. Introduction to Transaction Management: Definition of a Transaction – Properties of Transaction – Types of Transaction.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. PHI. Tamer Ozsu. Objectives: The students would be able to understand and use distributed Database Processing.B.Tech. "Distributed Database Principles and Systems". Patrick Valduriesz. Query processing. Distributed databases. "Principles of Distributed Database Systems". Distributed Database Design. Query decomposition and Transaction Management. Query processing.Serializability theory – Taxonomy of concurrency control mechanisms – Locking based concurrency control algorithms Timestamp-based concurrency control algorithms – Optimistic concurrency control algorithms – Deadlock management – Relaxed concurrency control. 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 Optimization – Centralized Query Optimization – Join Ordering in fragment queries – distributed query optimization algorithms. Distributed concurrency control. Introduction to Distributed Data Processing: What is a distributed database system – Promises of DDBS – Complicating Factors – Problem Areas. Stefanoceri.
M. To sail along with the various approaches in data mining.B. “Data Mining: Concepts and Techniques”. Objectives : To make familiar with the various concepts of data warehousing like meta data. Classification & prediction: What’s classification . & Kambler. Murray. Major issues in Data mining. Anahory S. summary table. Wiley Dream Tech.Data cleaning – Data integration and Transformation. TEXT BOOK: 1. languages & system architecture: Data Mining primitives: Task – relevant data – kind of knowledge to be mined – Background knowledge – interestingness measures– presentation & visualization of discovered pattern . data mart. Association Rule Mining: Basic concepts – market basket analysis . 2003. Cluster analysis: Types of Data in cluster analysis .. Addison Wesley.issues regarding classification and prediction – Bayesian classification – prediction: linear – non linear. 3rd Edition.Major clustering methods. Data Mining primitives. fact data and dimension data.A multidimensional Data Model – Data Warehouse architecture – Data preprocessing. Morgan Kaufmann. 2. D.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..Mining single dimensional Boolean association rules from transactional databases. Han J.Tech. (Computer Science and Engineering) .Data Mining Query language – Designing Graphical User interfaces based on DMQL Architecture of Data mining. REFERENCE BOOKS: 1. 48 . To familiarize with the various data warehousing and data mining tools Data Warehouse and OLAP Technology for Data mining: Introduction to Data Warehouse. “Data Warehousing in the Real World”. “Building the Data Warehouse”. 2005.H. Data Mining Introduction: Introduction to Data Mining – Data Mining Functionalities – Classification of Data Mining systems. 1997. Data mining applications. Immon.W. 1st Edition.
Access point control protocol. Mobile Communication. DECT. Functions. Snooping TCP. 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.B. HIPERLAN. mobile network layer and various wireless Application Protocol. WATM Services. transmission/Timeout Freezing. Addison Wesley. Mobile quality of service. Radio transmission. TETRA. Routing. Wireless ATM. GPRS and Wireless Application protocols Objectives: The student would be able to understand the principles and practices of Mobile Communication. Mobile transport layer-Traditional TCP292: Indirect TCP. 49 . Satellite Systems –GEO139. Johchen schiller. TEXT BOOK: 1. (Computer Science and Engineering) . Radio Access Layer: Handover. Roopa R. IEEE802. Tata McGraw Hill. Talukder. Addressing.Yavagal. Asoke K. Wireless Communication: Wireless LAN-Infrared vs. 2000. GSM. Medium Access Control techniques. MEO140.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. “Mobile Computing-Technology. Bluetooth. Motivation for WATM. Selective Retransmission. Infrastructure and ad hoc networks. Mobile TCP: Fast Retransmit/Fast recovery. 2005. Mobile Network Layer: Mobile IP-Dynamic host configuration protocol-Ad hoc networks. Wireless ATM working group. Broadcast systems Overview –Cyclic Repetition of Data Digital Audio Broadcasting –Digital Video Broadcasting. Applications and Service Creation”. HiperLAN and Bluetooth. Telecommunication Systems –GSM. REFERENCE BOOK`: 1. UMTS and IMT 2000. Reference Model.Tech. Mobile Devices. Location Management. Satellite Communication. Wireless Local Area Networks. LEO139. Localization. Transaction oriented TCPU Support for Mobility: File Systems-Consistency –World Wide Web – Hyper Text mark up language (HTML) – approaches that might help wireless access-System architecture –Wireless Application Protocol.11. Handover. Wireless ATM operations.
Introduction to Web Services: Writing Mobile Application with . . 2003 REFERENCE BOOKS: 1.NET Framework Concepts I: console I/O-working with strings-formatting and conversion. . WP Publishers and Distributors. WP Publishers and Distributors. 2003 3.NET Platform: Building Blocks of .NET framework. WP Publishers and Distributors. 2003 50 .NET framework. Ltd.NET C# Language Fundamentals: Object Oriented Programming in C#.NET.NET Framework: Introduction to ADO.Tech. MSDN. Writing Web Application with the . Threading NET Framework Concepts II: Reflection. TEXT BOOK: 1. MSDN.B. C#.NET Introduction to Microsoft .NET Framework.NET on the edge.NET. 2001 2. IDG Books India Pvt. Microsoft C# Language specification.Remoting -XML Parsing-Security. Microsoft Visual Basic . MSDN. (Computer Science and Engineering) .file I/O – serialization.Syllabus (Board of studies – 25th Feb 2006) 06BCE E11 WEB SERVICES L 3 T 0 P C 3 Aim: To provide the student with the basics of . Writing GUI Applications with . Rick Leinecker ASP. Objectives: After completion of this course the students will be able to undergo projects in .NET Framework. Advanced Concepts.
Advanced learning algorithms for Pattern Recognition. REFERENCE BOOK: 1. TEXT BOOK: 1. 2. 1995. Recognition of emergencies using ANN. “Pattern Recognition and Image Analysis”.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. Artificial Neural Network Structures. Prentice Hall. Christopher M. 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.Decision theoretic algorithms – structural pattern recognition. Bishop. Newyork Oxford University Press – 1997. (Computer Science and Engineering) . Neural Feature and Data Engineering: Neural engineering and testing of FANN’s – feature and data engineering.Josh. Clustering – Nearest neighbor classification – Non parametric techniques.derivations. Decision Trees – Multilayer perceptrons. 51 . their applications and comparative studies of feed forward artificial networks.B. Feature Detection.Tech. S. Earl Gose. “Neural Networks for Pattern Recognition. Objectives: The students would be able to understand and explain fundamentals of pattern recognition. Looney. Basic Concepts: Basic Concepts of Pattern Recognition. 1996. 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. Carl G.” Oxford University Press. Artificial Neural Network Structures: Supervised training via error back propagation . “Pattern recognition using Neural Networks – theory and algorithms for engineering and scientists”.Johnsonbaugh. R.
LAN server. the transparent illusion. OLTP. OSF’s DCE releases. SNA. DFS. Objective : To design an efficient database and evaluate the transaction processing mechanism under different loading environments. functions. threads. the current state. information warehouses. Linthicelm : David Linthicelm’s “Guide To Client / Server And Intranet Development” .Tech. NETWARE vs. transaction processing monitors. IBM LAN server. SQL middleware and federated databases.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. (Computer Science and Engineering) . peer –to –peer communications. transaction models.creating the single system image. acid properties. Client. Robert Orfali Et Al .B. John Wiley. Introduction : Client-server computing : Concepts. building blocks. named pipes. the options. 1994. net bios. stored procedures. (Chapters 1 to 20) REFERENCE BOOK : 1. stack middleware. “Essential Client-Server Survival Guide” .the post modern NOS. the state of the client-server infrastructure : components. tp-lite vs tp-heavy. database servers. components of groupware: lotus notes: features and applications. remote procedure calls. TEXT BOOK : 1. Distributed Computing Environment (DCE) . NETWARE. SQL API. clientserver groupware: concepts and importance of groupware. 1997 52 . messaging and queuing. transaction management standards. Sql database services: Fundamentals. triggers and rules. TCP/ IP and sockets.server transaction processing : Transactions : Concepts. information at the fingertips. open SQL gateways. concepts. data warehouses. TP-lite: origins and concepts. middleware building block. John Wiley. Middleware : Networking Operating System (NOS).
Application: Consumer-oriented e-commerce: application mercantile process models. Addison-Wesley. designing electronic payment systems. advertising on the Internet. migration to open EDI.based electronic payment systems. Emma Minoli. Internet-based EDI. Modes of electronic commerce: overview . legal.secure transport protocols secure transactions. Daniel Lynch And Leslie Lundquist. Electronics publishing: EP and web-based EP. Approaches to safe e-commerce: overview . Andrew B. values-added networks. business requirements. 2. Intra organizational e-commerce: internal information systems. John Wiley. Introduction the meaning of distribution. concept and payment processing e-mail and secure e-mail technologies. Whinston “Frontiers of Electronics Commerce”. electronic marketplace technologies. secure electronics payment protocol. 1996 REFERENCE BOOK: 1. charting the online marketing process. their related issues and security. a model for message handling working of E-mail. information filtering. “Digital Money: The New Era Of Internet Commerce”. EDI envelope for message transport.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. e-commerce catalogs or directories. “Web Commerce Technology Handbook”. Ravi Kalakota. EDI and e-commerce. workflow automation and coordination customization and internal commerce. MIME. 1996 53 . comparisons of security methods. standardization and EDI software implementation. smart cards and electronic payment systems. Payments and security : Electronic payment systems: types. S/MIME and MOSS. Intellectual property issues in the age of EP. intellectual property issue for multimedia/ hypermedia development. master card/visa secure electronics transaction Introduction. security and privacy issues. secure electronics transaction. Intra organizational commerce and EDI : EDI. commerce-net advocacy. risk and electronic payment systems. consumer-data interface: emerging tools. E-commerce with internet/www. MIME and related facilities for EDI over internet. applications of EDI in business. Tata McGraw – Hill. Advertising and marketing:: The new age of information-based marketing. 1998. macroforces and internal commerce.B. the electronics commerce environment. search and resource discovery paradigms. Introduction: Electronic commerce environment and opportunities: Background. Daniel Minoli. mercantile models from the consumer’s perspective and from the merchant’s perspective. Consumer search and resource discovery.electronic data interchange (EDI). information search and retrieval.Tech. credit cards. TEXT BOOKS: 1. digital token-based electronic payment systems. supply chain management. web commerce going forward. security on web servers and enterprise networks. certificates for authentication. (Computer Science and Engineering) .
video coding using multi-resolution techniques.Tech. minimum variance huffman codes. models. empty cell problem. extended huffman codes. Co. speech coding. Ralf Steinmetz and Klara Nahrsedt. delta modulation. run length encoding. Discrete Wavelet Transforms (DWT) for image compression. length of huffman codes.B. Vector quantization: Introduction. introduction. Buzo. 2. huffman coding algorithm. coding a sequence. 54 .Syllabus (Board of studies – 25th Feb 2006) 06BCEE23 DATA COMPRESSION TECHNIQUES L 2 T 1 P C 3 Aim: This subject aims to cover standard compression techniques Objectives: The students would be able to understand and design new compression techniques. facsimile encoding. progressive image transmission. Transform coding Different transforms. Quantization and coding of transforms. Adaptive Differential Pulse Code Modulation (ADPCM). Khalid Sayood. advantages LBG (Linde. “Wavelet Transforms: Introduction to Theory and Applications”. Constant Factor Delta Modulation (CFDM). Arithmetic codes: Overview.. adaptive huffman codes. non binary huffman codes. Second Edition. Rao. Addison Wesley Pub. Gray) algorithm. 1996. “Introduction to Data Compression”. Codebook Initialization. other approaches. transform coding. tree structured vector quantizer. comparison of huffman and arithmetic coding. applications. TEXT BOOK: 1. Morgan Kaufmann Publications. probability models. Wavelet transforms and data compression introduction. application to image compression. (Computer Science and Engineering) . physical models. REFERENCE BOOKS: 1. basic algorithm. JPEG Compression. Various compression coding techniques Huffman coding: Good codes. 1998. 2000. generating a binary code. Mathematical preliminaries: Overview. applications. “Multimedia Computing and Communication and Applications”. modeling and coding. Introduction to Information theory Compression techniques. introduction to information theory. Raghuveer M. measures of performance. markov models. Differential Pulse Code Modulation(DPCM). lossless compression. Lossless image compression and vector quantization Lossless image compression: Introduction. lossy compression. Ltd. Machine Learning Differential coding Overview. Pearson Education. other vector quantization schemes. audio compression.
what. getting leverage on verification. Establishing a practical perspective. critical disciplines: frameworks for testing. 1999 2. standard checklists : Organizational approaches to testing : organizing and reorganizing . Kernighan and Rob Pike. data structure alternatives. verifying documents at different phases. regular expressions. prototype libraries. the clean sheet approach to getting started. GUIs: what’s new here? Usage testing. interpreters and compilers. Debugging : debuggers. statement. and recommendation strategy for validation testing. growing arrays. useful measures and other interesting measures. Brain W. challenges. spacy efficiency. estimation. testing tracks deliverables. Managing test technology. programming tools. Ed Kit : “Software Testing in the Real World”. getting sustainable grains in place. critical choices. data exchange. Design and implementation : markov chain algorithm. notations. approaches to organizing the test function. comments. current practices. sorting. trends.user manuals. product release criteria. user interfaces. minimizing the cost of maintaining the tests. standards relevant to software engineering and testing. consistency and idioms. performance liaisons. building the data structures in ‘C’. clues and bugs. 1995. headers and libraries. when.B. software measures and practices benchmark study. constants. Validation testing : validation overview. resource management. Testing methods Verification testing : basic verification methods. a testing orphan. validation activities. getting help. program generators. controlling validation costs. macros. recommendations. generating the output. life-cycle mapping of tasks and deliverables. three critical success factors for implementing verification. portability : language. follow-up. 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.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. structural design elements. 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. validation testing tasks and deliverables. Addison-Wesley. getting the best from verification. selecting the right approach. Performance : Performance bottlenecks. tool acquisition. internationalization. interface : csv. interface principles. getting gains to happen. minimizing the cost of performance tests. function macros. Notation : formatting data. timing and profiling speed. trees. Algorithms and data structures : Searching. (Computer Science and Engineering) . portability and upgrade. TEXT BOOKS : 1. tester-to-developer ratios. Addison-Wesley. and how to test. program organization. verification checklists. software testing tools. “The Practice of Programming” . isolation. debugging tools. minimizing validation testware development costs. 55 . validation methods. Recommendations. byte order. hash tables. expressions. lists. recommendations.Tech. libraries. categorizing test tools. summary of IEEE/ANSI test related documents. measurement provide answers.
William Perry. 1999 Beizer B.B. John Wiley. (Computer Science and Engineering) . 1990 Myers. Van Nostrand Reinhold. Microsoft Press. 1993 56 . 2.J. John Wiley. 4.”Writing Solid Code”. “Effective Methods For Software Testing” (Second Edition). 1979 Steve Merger . “The Art of Software Testing”.Syllabus (Board of studies – 25th Feb 2006) REFERENCE BOOKS : 1. G. “Software Testing Techniques” (Second Edition).Tech. 3.
(Computer Science and Engineering) . Prentice Hall. TEXT BOOK: 1. Computer Graphics Applications: CAD/CAM. 1986.Syllabus (Board of studies – 25th Feb 2006) 06BCE E27 COMPUTER GRAPHICS L 3 T 0 P C 3 Aim: The subject aims to cover Interactive and Non Interactive computer graphics methods. "Fundamentals of Interactive Computer Graphics".. 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). Van Dam A. Introduction to Computer Graphics: Display devices – Hardcopy devices – Interactive input devices – Display processors – Graphic Adapters – basic function – Monochrome adapters. 1990 57 . McGraw Hill. 2000.A programming approach". Steven Harrington. 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). Donald Hearn and Pauline Baker Computer Graphics. 2. New Delhi. Objectives: The student would be able to understand and use Computer Graphics various Clipping algorithms. Image processing. Foley J. games graphs and charts animation – Introduction of graphics and kernel system (GKS) – binding language for GKS – programming examples using GKS.D. VLSI.Tech. REFERENCE BOOKS: 1. 2D and 3D transformations. PHIGS.B. "Computer Graphics. 2D and 3D modeling. Addison Wesley.
2nd Edition 1999. requirements of a robot programming . basing design on task requirements. transformation arithmetic. CIM-station. mapping: changing descriptions from frame to frame. REFERENCE BOOKS: 1. (Computer Science and Engineering) . control of second order systems. rotations transformation: summary of interpretations.Wesley. the mechanics and control of mechanical manipulators.C. kinematic configuration position sensing force sensing. K. “Fundamentals of Robotics – Analysis and Control”.S. Robot programming language and systems : Introduction. “Robotics – Control Sensing Vision And Intelligence”. Addison. manipulator kinematics inverse manipulator kinematics: introduction solvability repeatability and accuracy. John J. a sample application. 58 .S. transform equations. notations Spatial description and transformation : Introduction : description : positions orientation and frames. convention for affixing frames to links. operators translators. Schilling.G Lee. R. Gonzalez. Manipulator mechanism design: Introduction. Introduction: Background. 1996. problem peculiar to robot programming languages. second-order linear systems. link descriptions: link connection description. “Introduction To Robotics – Mechanics And Control”. student should be able to understand the concepts of spatial mechanisms and their principles of design. Robert J. TEXT BOOK: 1. central issues in OLP systems. McGraw-Hill Book Company 2. Craig. more on representation of orientation transformation of free vectors.B. Fu. Manipulator kinetics: Introduction. computational considerations.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. Linear control of manipulators: Introduction. Off-line programming systems: Introduction. control system devices. actuators along with robot part programming. feedback and close loop control. the three level of robot programming. automating subtasks in OLP systems. summary. Prentice Hall Of India. C.Tech.
Associative memories and Holographic Pattern Recognition system. Multi Layer Neural Nets as Universal Approximators. Simon Haykin. Application. ART2: Architecture. “Neural Computing”. 2000 Applications” 3rd 59 . Multi layer perceptrons.R. Adaptive Resonance Theory: Introduction. Bidirectional Associative Memory: Architecture.the McCulloch Pitt’s Neuron. Algorithm. 2nd Edition 2004. Application. (Computer Science and Engineering) . Objectives: The students shall be able to understand the biological and artificial model of neuron. Hebb Net: Algorithm. “Neural Networks – A Comprehensive Foundation. Algorithms.Where are Neural Nets being used How are Neural Nets being used . Jackson. Pearson Education. Beale and T. I. Application. and Edition. Pearson Education. “Fundamentals of Neural Networks Architectures. Variations. Introduction: Why Neural Networks and Why Now . Algorithm.Tech. Storage Capacity.Syllabus (Board of studies – 25th Feb 2006) 06BCE E31 NEURAL NETWORKS L 3 T 0 P C 3 Aim: The subject aims to introduce the concepts of Neural Networks with emphasis on supervised and unsupervised learning algorithms as well as on computational characteristics. 2004 REFERENCE BOOKS: 1. Algorithm. Analysis. Algorithm. Algorithm. Analysis. Applications.What is a neural Net .B. Analysis. TEXT BOOK: 1. Pattern Association: Auto associative Net: Architecture. Algorithm. Applications. Applications. Back Propagation Net: Standard Back Propagation: Architecture. Applications. ART1: Architecture. Applications. Laurene Fausett. pattern recognition techniques. Perceptron: Architecture. Theoretical Results: Derivation of Learning rules. Algorithm. Applications. Simple Neural Nets for Pattern Classification: General Discussion. 2. Algorithm. Learning Vector Quantization: Architecture. Neural Networks based on Competition: Kohonen Self –Organizing Maps: Architecture. IOP Publishing.
B. 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. B. dynamic programming. TEXT BOOK: 1. PERT & CPM Techniques – critical path – normal and crash time – resource allocation – resource leveling and smoothing. 1989. “Operation Research”. Keder Nath Ram Nath & co. 2000. Tata McGraw Hill 1982. “Operation Research”. Sharma.A. maintenance and replacement problems. 1974. S.Initial solution – methods of improving the initial solution – traveling salesman problem – dynamic programming – principle of optimality. (Computer Science and Engineering) . They would be able to solve Inventory.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. Transportation and Assignment Problem. Maintenance and Replacement Problems: Models for routine maintenance and preventive maintenance decisions – replacement models that deteriorate with time and those fail completely. Integer Programming: Formulation – graphical representation – Gomory’s cutting plane method. Integer Programming.Tech. Objectives: The students would be able to understand and use concepts of OR. Hamblin & Stevens Jr. such as Linear programming. Taha. 2.. 3. Concept of OR: Concept and scope of operations research (OR) – Development of OR – phase of OR – Models in OR. Gillet “Introduction to Operation Research”. “Operation Research.An Introduction”. two jobs through ‘m’ machines and ‘n’ jobs through ‘m’ machines. Billy. S.. reorder point (ROP) determination. 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). REFERENCE BOOKS: 1. McGraw Hill Co. 60 . Sequencing and Scheduling Problems: Job sequencing – ‘n’ jobs through two machines.. Macmillan.D.
8.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. examples of typical signals. all pass filters. Manolakis: DSP Principles. Algorithms. and Applications Prentice-Hall. typical signal processing applications. state-space structures.8) REFERENCE BOOKS: 1. impulse invariance method of IIR filter design. Objective: To design a appropriate filter and evaluate its efficiency by comparing with various design methods. typical signal processing operations. Representative applications: dual – tone multifrequency signal detection. 1998. computation of the discrete Fourier transform the quantization process and errors. short-term discrete Fourier transform. voice privacy system. Digital Filters: Structures: block diagram representation. 2. Proakis & Dimitris G. Alan V. bilinear transform method of IIR filter design. (Chapters 1. Oppenhein. computational complexity of digital filter structures. 61 . low pass IIR digital filter design. digital fm stereo generation. tunable iir digital filters. Design: preliminary consideration. design of digital IIR notch filters. equivalent structures. analysis of coefficient quantization effects in fir filters. Sanjit K. software implementation.10. discrete-time processing of random signals. Examples. Prentice – Hall.4. basic Finite Impulse Response(FIR) digital filter structures. 1996. complementary transfer functions. parallel all pass realization of IIR transfer functions. signal flow-graph representation. Digital Signal Processors: Overview of Motorola dsp563xx family of digital signal processors. all pass transfer function. Mitra: Digital Signal Processing – A Computer –Based Approach. spectral analysis using dft. Applications: Implementation consideration: basic issues. computer-aided design of digital filters. (Computer Science and Engineering) . spectral transformations of IIR filters. 1998.1 To 8.1 To 11. 9.Tech. FIR filter design based on frequency sampling approach.6.B. digital sine-cosine generator. Schafer: Discrete – Time Signal Processing (Second Edition). Implementation. subband coding of speech and audio signals. FIR design based on truncated Fourier series.Transform-domain representations of Linear Time Invariant (LTI) systems: the frequency response. analysis of coefficient quantization effects. stability test. the transfer function. musical sound processing. why digital signal processing . Review of Basic Concepts: Signals and signal processing: characterization and classification of signals. 11. discrete-time analytic signal generation. basic Infinite Impulse Response (IIR) filter structures. TEXT BOOK: 1. architectures of dsp56307: assembly language instructions and programming: typical software applications. minimum-phase and maximum-phase transfer functions. cascaded lattice realization of IIR and FIR filters. digital two-pairs.7. Tata McGraw-Hill. John G. And Ronald W. types of transfer functions.1 To 9.3.
hybrid support systems. Aronson. model base management. knowledge in AI. Efrain Turban and Jay E. multidimensional modeling. how AI differs from conventional computing. executive information (support) systems. DSS hardware. 62 . the user. The need for computerized decision support technologies. Heuristic Programming: Simulation. group decision support systems. types of knowledge-based DSS. AI verses natural intelligence. visual modeling and simulation. the concept of decision support systems. negotiation. GDSS research challenges Modeling for mss. Prentice-Hall.B. artificial neural networks. expert systems. capabilities. the DSS development process. data visualization and multidimensionality. decision making in groups. Fifth Edition. DSS construction. database management systems in DSS. influence diagrams. 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. the modeling process. Support systems. distinguishing DSS from management science and MIS. treating certainty. visual spreadsheets. and components of DSS. data collection and data problems. DSS configuration: Characteristics. “Decision Support Systems and Intelligent Systems”. (Computer Science and Engineering) . static and dynamic models. the decision (electronic meeting) room. data warehousing. decision analysis of a few alternatives. uncertainty and risk. and visualization. access. mss modeling in spreadsheets. the goal of GDSS and its technology levels. the AI field. the nature and sources of data. optimization. introduction and definitions. 1998. OLAP: data access and mining. TEXT BOOK: 1. ready-made quantitative software packages. Database organization and Structure: Data warehousing. GDSS software idea generation. a framework for decision support. the technology of GDSS.Tech. the DSS of the future. classifications of DSS. the internet and commercial database services. financial and planning modeling. Intelligent DSS: The future of AI. Objectives: The students will be capable of designing the decision support system for managers to take the decision. the evolution and attributes of computerized decision aids. evaluation. querying and analysis. The GDSS meeting process: Constructing a GDSS and the determinants of its success. intelligent database and data mining. analysis. knowledge-based DSS & AI concepts and definitions. group DSS.