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