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