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