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