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