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