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