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