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