This action might not be possible to undo. Are you sure you want to continue?
COURSE STRUCTURE OF B. TECH IN COMPUTER SCIENCE & ENGINEERING THIRD SEMESTER A. Theory Sl. Code No. 1. M 301 2. CS 302 3. EE 301 4. CS 303 5. EC 312 6. CS 301 Total Theory B. Practicals 1. CS 392 2. EC 382 3. CS 391 4. EE 391
Mathematics Data Structure & Algorithms Circuit Theory & Networks Computer Organisation Digital Electronics & Logic Design Principles of Programming Language
Contacts Periods/Week L T P 3 1 -3 1 -3 1 -3 0 -3 1 -3 0 -
Credits Total 4 4 4 3 4 3 22 3 3 3 3 12 32
4 4 4 3 4 3 22 2 2 2 2 8 29
Data Structures Lab Digital Electronics and Logic Design Lab Programming Practice Lab Circuits & Networks Lab Total Practical Total of Semester
3 3 3 3
Computer Science & Engineering Syllabus
FOURTH SEMESTER A.THEORY: A. Theory Sl. No. Code Theory Contacts Periods/Week T P L 3 3 1 0 3 1 0 3 1 0 0 1 0 0 Credits Total
1 2 3 4 5
M 401 CS 401 CS 402 EC 411 CS 403
Mathematics Formal Language & Automata Theory Operation Research & Optimization Techniques Principles of Communication Engg Advanced Computer Architecture Total Theory
4 4 4 3 4 19
4 4 4 3 4 19
B.PRACTICAL: Sl. No. 1 2 Code B. Practical Practical Contacts Periods/Week L T Operation Research Lab 0 0 Computer Architecture & 0 0 Organization Lab Communication Engg. Lab Total Practical 0 0 Credits P 3 3 Total 3 3
CS 492 CS 493
C. SESSIONAL : HU 481 Technical Report writing & / Language Practice Lab TOTAL OF SESSIONAL TOTAL of Semester :
3 3 31
2 2 27
Computer Science & Engineering Syllabus
FIFTH SEMESTER A. THEORY Sl. Code No. 1. 2. 3. 4. CS501 CS 502 CS 503 EI 502 THEORY Contact Periods/Week L T 3 0 3 0 3 3 1 1 Total P -----Credits
Operating System Database Management System Design & Analysis of Algorithm Microprocessor & Microcontrollers Control System
3 3 4 4
3 3 4 4
EE 503 TOTAL THEORY
Sl. Code No. 1. 2. CS591 CS 592 EI 592 3. EE 593 4.
Operating System Lab Database Management System Lab Microprocessor & Microcontrollers Lab Control System Lab TOTAL PRACTICAL
Contact Periods/Week L T 0 0 0 0 0 0 0 0
Total P 3 3 3 3
3 3 3 3 12
2 2 2 2 8
C. SESSIONAL Sl. Code No. SESSIONAL 0 TOTAL OF SESSIONAL TOTAL OF SEMESTER 0 0 Total 0 0 30 26 Credits 0 0
Computer Science & Engineering Syllabus
SIXTH SEMESTER A. THEORY
Sl. Code No. 1. 2. 3. 4. 5. CS 601 CS 602 CS 603 CS 604 CS 605
Contact Periods/Week L 3 3 3 3 3 T 1 1 0 0 0 P ------
Computer network Software Engineering Computer Graphics & Multimedia System Software and Administration Object Technology & UML TOTAL THEORY
4 4 3 3 3 17
4 4 3 3 3 17
Sl. Code No. 1. 2. 3. 4. CS 691 CS 693 CS 694 CS 695
Contact Periods/Week L 0 0 0 0 T 0 0 0 0 P 3 3 3 3
Computer network Lab Computer Graphics & Multimedia Lab System Software & Administration Lab Object Technology Lab TOTAL PRACTICAL
3 3 3 3 12
2 2 2 2 8
C. SESSIONAL Sl. Code No. 1. CS 682 SESSIONAL Gr. Discussion & seminar Total 3 3 32 Credits 2 2 27
TOTAL OF SESSIONAL TOTAL OF SEMESTER
6-Week Industrial Training during Summer Vacation
3. CS 701 CS 702 CS 703 HU 701 CS 704 THEORY Contact Periods/Week L T 3 0 3 0 3 0 3 0 3 0 Total P -----Credits Language Processor Artificial Intelligence Visual Programming and Web technology Financial Management and accounts Elective I 3 3 3 3 3 15 3 3 3 3 3 15 TOTAL THEORY B. CS 782 SESSIONAL 12 8 Total Credits 2 2 5 27 Practical Training Evaluation Seminar on Assigned /Selected Topic TOTAL OF SESSIONAL TOTAL OF SEMESTER ELECTIVE I CS 704A CS 704B CS 704C CS 704D CS 704E CS 704F CS 704G CS 704 H 0 3 3 3 30 Distributed Database Bio Informatics Parallel Programming Advanced Operating System Computational Geometry Modeling & Simulation Image Processing Network Applications(For Ceramic Technology College only) 5 . 4. 5. SESSIONAL Sl. 1. CS 781 2. 2. 3. 1. 2. CS 792 CS 793 CS 795 PRACTICAL Contact Periods/Week L 0 0 T 0 0 P 3 3 Total Credits Artificial Intelligence lab Visual Programming and Web Technology Lab Assigned Project 3 3 6 2 2 4 TOTAL PRACTICAL C. 1. Code No. Code No.Computer Science & Engineering Syllabus SEVENTH SEMESTER A. PRACTICAL Sl. Code No. THEORY Sl.
3. THEORY Sl. PRACTICAL Sl. HU 801 HU 802 CS 801 CS 802 THEORY Contact Periods/Week L T 3 0 3 0 3 0 3 0 Total P ----Credits Values & Ethics in profession Industrial Management Elective II Elective III 3 3 3 3 3 3 3 3 TOTAL THEORY B. Code No. Code No. 2. 4. 1.Computer Science & Engineering Syllabus EIGHTH SEMESTER A. 1. 1. Code No. 2. CS 881 CS 882 12 8 SESSIONAL Total Credits Comprehensive Viva-Voce Personality Development 3 3 4 2 TOTAL OF SESSIONAL 3 6 TOTAL OF SEMESTER 27 26 ELECTIVE II CS 801A Robotic Control CS 801B Soft Computing CS 801C Digital Signal Processing CS 801D VLSI Design CS 801E E-Commerce and ERP CS 801F Pattern Recognition ELECTIVE III CS 802A Mobile Computing CS 802B Real Time & Embedded System CS 802C GIS & Remote Sensing CS 802D Network Security CS 802E Advanced Java Programming CS 802F Natural Language Processing 6 . CS 893 12 12 PRACTICAL Contact Periods/Week L T Total P 12 Credits Assigned Project 12 8 TOTAL PRACTICAL C. SESSIONAL Sl.
Poisson. Testing of Hypothesis: Simple and Composite hypothesis. Height-balanced and weight-balanced trees. 7 . Frequency Definition of probability. t and χ2. Tail Recursion. General Multiplication Theorem. Distributions: Binomial. Interval estimation. Non-linear Data Structure: Trees . Stacks.Binary Trees. Doubly linked lists. Breadth-first and Depth-first Search. Sample. χ2—Test of Goodness of Fit (application only). Transformation of random variables (One variable). Statistics: Population. Reproductive Property of Binomal. Level of Significance. Axiomatic definition of probability. Probability density function and distribution function. Statistic. When not to use recursion. Exponential. Hashing . Poisson and Normal Distribution (proof not required). Binary Search Trees. Normal. Expectation and Variance (t and χ2 excluded).Arrays and Lists.Design of recursive algorithms.Linear linked lists. Counting techniques applied to probability problems. Graphs Representations. Correlation and Regression. Uniform. Random variables (discrete and continuous). Critical Region. application. Bayes’ theorem and related problems. B-trees. collision Resolution Techniques. Testing of Equality of Means.Hashing Functions.Computer Science & Engineering Syllabus Third Semester DETAILED SYLLABUS Mathematics Code: Contact: Credit: M 301 3L + IT 4 Probability: Random Experiment. 10L 10L 6L 18L 4L 48L Linear Data Structures . Application of trees. and simple problems. Finite sample spaces and equiprobable measure as special cases. Poisson and Normal distribution). circularly linked lists. Probability of events. Recursion . Application. Queues and Dequeues. Likelihood Ratio Test (proof not required). Sampling distribution of sample mean and sample variance (proof not required). Removal of recursion. Estimation of parameters (consistent and unbiased). Conditional probability. Moment generating function. Best Critical Region. Neyman-Pearson Theorem (proof not required). Chebychev inequality (statement) and problems. Traversals and Threads. Type I and Type II Errors. Link Representation . Sample space. Binomial approximation to Poisson distribution and Binomial approximation to Normal distribution (statement only). Total Data Structures and Algorithms Code: CS 302 Contact: 3L + IT Credit: 4 Overview of C language Time and Space analysis of Algorithms . Probability mass function.Order Notations. Probability of Non-disjoint events (Theorems). Normal Populations. Insertion and Deletion algorithms. Law of large numbers (Weak law).Sequential representations . Central Limit Theorem (statement). Point estimate: Maximum likelihood estimate of statistical parameters (Binomial. Simple idea of Bivariate distribution. Application to Normal Population. Independent events. B+ -trees. Linear Data Structures. Comparison of Binomial Populations. Random Events. strings. Simple applications.
Galgotria Pub.Vikas 1.their applications to the analysis of active network Active filter analysis and synthesis using operational amplifier SPICE: How SPICE works. New Age International Publishers. tree link.Bubble sort.. LC and RLC Circuits. Multi-indexed Files.: Network Analysis & Synthasis. D.Cybertech Circuit Theory & Networks Code: EE 301 Contact: 3L + IT Credit: 4 Different types of systems & networks: continuous & Discrete.EPH.Heileman:data structure algorithims &Oop Tata McGraw Hill 2.Electric Circuits Analysis.C.Data Structures and Algorithms.Computer Science & Engineering Syllabus Sorting and Searching Algorithms.. Circuits. “Data Structures using ‘C’ ” 6 Ajay Agarwal: Data structure Through C. Loop variable analysis and node variable analysis Graph of network.Rakshit: Electrical Circuits 4. “Fundamentals of Data Structures”. Horowitz Ellis & Sartaj Sahni. D.Wilsky: Signals & Systems. Inverted Files. hybrid parameters.C. Hashed Files. and Seely S.Vikas References : 1. 6. Data Structures Using C – M.. Drozdek. A. Formulation of network equations. 5 Tanenbaum A. Fixed and Time varying.Graw Hill Book Company b. File Structures . Harmonic re-composition.V. . Open circuit Impedance and Short circuit Admittance parameters.B+ tree as index.V.Radhakrishnan and V. Reza F.Chattopadhyay and P. Van. Sivandam. Kakde & U. Insertion Sort. Addison 8 .. sensitivity analysis. 3. Kuo F. “Network Analysis & Synthesis”. Aho Alfred V. Passive & Active Networks & Systems Laplace transform of impulse and sinusoidal steps waveforms for RL. and Problem Solving with C++”. Transmission parameters. harmonic decomposition (Fourier Series). 4. and their inter-relations Indefinite admittance matrix. circuits analysis. “Networks and Systems”.A. Sudhakar:Circuits & Networks:Analysis & Synthesis 2/e TMH New Delhi 2. Deshpandey. R.Jalgaonkar. Heap sort and Radix Sort. Indexed Files . A.: Hayt 6/e Tata Mcgraw-Hill 2.. ISTE/EXCEL BOOKS 2. “Algorithms. Filters & Transmission Lines 3. Fourier Series and Fourier Transform Network theorems and their applications in circuit analysis. plotting and printing.C. Oppenheimer and A. concept of tree branch. Relative Files. Data Structures and Algorithms – O. Selection Sort..S. Text book : 1. Weiss Mark Allen. capacitors and inductors in D. PHI 5.Engineering circuit analysis with PSPICE and probe-Roger 1. Roy Choudhury D. “Modern Network Analysis”. Source transformations. Hopperoft John E.Sequential and Direct Access. models for passive and active device. Transient analysis of different electrical circuits with and without initial conditions. Mc. steady state and transient. RC. Valkenburg M. Wesley 3. S. John Wiley & Sons. Linear and Non-linear. Tie-set matrix and loop currents. Prentice Hall. Lumped and distributed. input and output Impedance. Incidence matrix. Chakravarty: Networks. voltage controlled components Text books : 1. M. ISTE/EXCEL BOOKS 3. References : a. c.G. E. “Network Analysis”. Engg Circuit Analysis. Merge Sort. F..C. UIlman Jeffrey D. Model statement.Srinivasan. Data Structures. Cut set matrix and node pair potentials Two port networks. Quick Sort. “Data Structures and Algorithms”. D. Addison Wesley. small signal analysis.
Organization and erasing schemes.TMH Digital Electronics – Dr.H. various types of Registers and counters and their design. Saroj Rangnekar . 3. Computer Organization and System Software. T-States. de-multiplexer. Hexadecimal. PHI Yarbrough. Computer Organization & Architecture (TMH WBUT Series). Burd. “Computer System Architecture”. Examples from popular machines. Bipolar and MOS storage cells. sequential circuits design methodology Memory devices. ASCII. TMH Digital Electronics & Logic Design Code : EC 312 Contacts : 3L + 1T Credits :3 Data and number systems.TTL. Addressing modes registers. Registers and stack. Binary arithmetic Boolean algebra.. Von-Neumann concept. ECL. parity generator. PHI. subtractor. Interfacing buses.Taub & D.Flip Flops.Computer Science & Engineering Syllabus Computer Organization Code: CS 303 Contact: 3L Credit: 3 Concepts and Terminology: Digital computer components Hardware & Software and their dual nature.Shilling.System Architecture. 4.Virendra Kumar. EPROM. Ghosh & Pal. Mc Graw Hill Digital Technology. EEPROM. 5. decoder. Interconnecting system components.Vikas 7. Integer representation. Overflow detection. Role of Operating Systems (OS).ROM. Timing diagrams. logic gates and circuits. design and specifications Text books: 1. 5. EXCEL BOOKS 4. Mano. ROM and PROM-basic cell. 9.adder. 2. New Age Digital Logic Design. General Organization: Instruction work formats. “Computer Organisation & Design”. Instruction sequencing with examples. State table and state transition diagram. Concept of memory map. 6. Vikas 9 . address decoding. McGraw Hill. Introduction to Microprogramming.Vikas Salivahan. Signed binary number representation with 1’s and 2’s complement methods. multiplexer. “Computer Organisation”. Timing diagram Controlling arithmetic and logic instructions. EBDIC.. Organization of RAM. Timing diagrams. Venn diagram. etc Different types of A/D and D/A conversion techniques Different Logic families. The ALU: ALU organization. Hamacher.M. 10. Kmap method and Quine Mc Clauskey method Combinational circuits. 6. Givone: digital Principles &design . comparator. Irregular counter.Morries Mano. Codes and their conversions: BCD. P. Status flags. Text books : 1 2 3 Hayes J. 7. 8. ISTE/EXCEL BOOKS Malvino:Digital Principles &application TMH Jain :Modern Digital Electronics 2/e TMH Marcovitz:Intro to logic Design Tata Mcgraw-hill Digital Integrated Electronics. RAM. Minimization of logic expressions by algebraic method. Magnetic memories-recording formats and methods. Floating point number arithmetic. Disk and tape Units. Octal. “Computer Architecture & Organisation”. M.Digital Logic. PHI. MOS and CMOS. Multiplication of signed binary numbers. Chaudhuri P. Variations in Micro-programming configuration. Memory Unit: Memory classification. Pal. Binary representation. etc Design of combinational circuits-Programming logic devices and gate arrays Sequential Circuits. their operation. encoder.Digital Circuits and Design. is 1s and 2s complement arithmetic. Serial and Parallel Adders. Gray.
pointers: concept of pointers and passing parameters using pointers. Tata McGraw Hill. Application of sorting and searching algorithms Hash tables implementation: searching.Let us C. XNOR gates using universal gates A. Tucker. Allen B. Data-type handling and various constructs (conditional. LISP. loop.Vikas 7. BPB 5. deleting. Gottfried BS – Programming with C.Foundation of Programming Languages. Shah and M. “Programming Languages”. BPB 6. 2. conditional transfer. Kanetkar. files basic concept of various types of file access methods: sequential. Code conversion between BCD and EXCESS-3 10 . B. functions etc). “Programming languages design and implementation”.call by value. recursions. pointers to structures. Tennence W. AND. Recursive and Nonrecursive traversal of Trees Threaded binary tree traversal. non-numeric processing. functions and procedures . concept of data types. programming for numerical methods. Bangia.A First Course in Prog with C. PROLOG. Gray to Binary conversion & vice-versa. deterministic and in-deterministic loops. addition. inverting a linked list. Vikas 8. Digital Electronics & Logic Design Lab Code: EC 382 Contact: 3P Credit: 2 List of Experiments: 1.H. various statements for file handling Advanced Programming Languages like C++. AVL tree implementation Application of Trees. concept of arrays of pointers and pointers to pointers. OR. 3. . inserting and deleting. Realization of NOT. Thaker. Roosta. call by reference and their differences. Yashvant . Y.Pratt. ADA. Programming In C++. Kanetkar. R. Balagurusamy:ANSI C TMH 5. deleting elements Circular Queue: Adding & deleting elements Merging Problem : Evaluation of expressions operations on Multiple stacks & queues : Implementation of linked lists: inserting. structures and unions – advantage of using structures. searching & sorting techniques. Prentice Hall of India.3rd revised Edn.I. indexed sequential. precedence and associatively of operators. Jeyapoovan.Computer Science & Engineering Syllabus Principals of Programming Languages Code : CS 301 Contacts : 3L Credits :3 Concepts of structural program development. Implementation of stacks & queues using linked lists: Polynomial addition. 4. 2. Yashvant – Understanding Pointers in C. Comparison of various languages Text books: 1. and PASCAL. records. Polynomial multiplication Sparse Matrices : Multiplication. Fundamentals of Programming Languages. ISTE/EXCEL BOOKS 9. concept of information hiding. random.Cyber Tech Data Structure Lab Code: CS 392 Contact: 3P Credit: 2 Experiments should include but not limited to : Implementation of array operations: Stacks and Queues: adding. TMH pub.2nd Edn. XOR.
Evaluation of convolution integral. JK. Discrete Fourier transform for periodic & non-periodic signals and simulation of difference equations using MATLAB 8. B.Computer Science & Engineering Syllabus 3. and File handling. 4-bit comparator circuit 4. Representation of poles and zeros in z-plane. 2. Spectrum analysis of different signals Note: An Institution/College may opt for some other software or hardware simulation wherever possible in place of MATLAB Fourth Semester COMPUTER SCIENCE Mathematics M 401 Contact: 3L + IT Credit: 4 Sets and functions: Groups. Step.Roots of quadratic and Cubic equations. 5. and D flip flops using Universal logic gates 8. Exponential. Digital to Analog conversion Programming Practice Lab Code: CS 391 Contacts: 3P Credits: 2 Concepts of flow charts and decision tables. ODD and even parity generation and checking. dihedral groups. Design of combinational circuits using multiplexer 6. B. Transient response in R-L and R-C Network: Simulation/hardware Transient response in R-L-C Series & Parallel circuits Network: Simulation/hardware Determination of Impedance (Z) and Admittance(Y) parameters of two port network Frequency response of LP and HP filters Frequency response of BP and BR filters Generation of Periodic. Introduction to DOS and UNIX Operating System Development of Computer Program using C language. Arranging numbers in ascending and descending orders. Realization of Synchronous Mod-N counter 10. Subgroups and Cosets. 6. Elementary applications in coding theory. Determination of Laplace transform and inverse Laplace transformation using MATLAB 10. Examples and practice problems Introduction to Digital Computers and its components. Circuits & Networks Lab Code: EE 391 Contact: 3P Credit: 2 List of Experiments: 1. Realization of RS. Design of combinational circuit to drive seven-segment display 5. A. Sinusoidal. Normal subgroups. Realization of Asynchronous up/down counter 9. Separation of odd and even numbers. A. 3. permutation groups. Summation of N Natural numbers. Ramp signals using MATLAB in both discrete and analog form 7. Structure of cyclic groups. Pointers. Impulse. Damped sinusoidal. Cyclic semigroups and submonoids. Semigroups and monoids. Morphisms. Congruence relations on Semigroups. Arrays. problems on recursion. determination of partial fraction expansion in z-domain and cascade connection of second order system using MATLAB 9. etc. Adder/Subtractor circuits using Full-Adder using IC and/ or logic gates. 11 . 4. BCD Adder circuit using IC and/ or logic gates 7.
. merger graph & compatibility graph. Sequence and discrete function. Isomorphism. language recognised by PDA. equivalence of Moore & Mealy machines. asynchronous and liner sequential machines.MH 3. Text: 1. 1968 Reference: 1. 3/ed. 1996. Kandel A. “Graph Theory with Applications to Engineering and Computer Science”. Metric Representation of Graphs. Cotrees and Fundamental Circuits. Dijkstra's Algorithm. 1975 8 Kolamn. Cut Sets.idea of grammar. NFA. Applications of Boolean algebra in logic circuits and switching functions. Closure Properties of Regular Sets : Pumping lemma & its application. definite. Context sensitive languages. Finite State Models : Basic definition. CNF & GNF. “Introduction to combinatorial mathematics”. Fundamental Cut Sets and Cut Vertices. alphabets & languages. machine equivalence. Busby and Ross. Moore versus Mealy m/c. Ford-Fulkerson Algorithm for Maximum Flow.Lipschutz—2000 Solved Problems in Discrete Mathematics. “Discrete mathematical structures with applications to computer science”. concept of synchronous.direct product. 1968. closure properties minimization of finite automata : minimization by distinguishable pair. 1990 10 Smullyan R. Networks. McGraw Hill. Mapa—Higher Algebra (Abstract & Modern) 5 Robert J. closure properties.BFS. Tata McGraw Hill 6 Deo N.. Regular language properties and their grammars.Hararay—Graph Theory Formal Language and Automata Theory Code: CS 401 Contact: 3L + IT Credit: 4 Finite State Machines : Definition. McElice . simplification. ideals and quotient rings.K.. moves. 3 Rosen—Discrete Mathematics. 2/e. set & relations). Myhill-Nerode theorem. Morphisms. state table & state assignments. ogden’s lemma. NFA with emoves. Instantaneous Descriptions. morphism of rings. B. information loss less & inverse machines : testing table & testing graph. “Discrete mathematical structures”. Paths. Walks. definition. NFA from regular expressions. PH. PHI. “First Order Logic Springer Verlag”. and Baker T. decision algorithms. DFA. mathematical representation. derivation trees. “A first course in abstract algebra Narosa”. Closure Properties of CFLs : Pumping lemma & its applications.. concept of sequential circuits. “Discrete mathematics for Computer Scientists and Mathematicians”. Context Free Grammars : Introduction. Digraphs. Finite memory. Euclidean domains. Introduction to Z. regular sets & regular expressions : equivalence with finite automata. equivalence of DFA and NFA. Robert B. P. Planar and Dual Graphs. Circuits. Shortest Spanning Trees . Recursion and Recurrence Relation: Basic idea.Kruskal's Algorithm. 9 Fraleigh J. PHI. Graph Thoery: Graphs. decomposition : serial & parallel. deterministic PDA. regular expressions from DFA.. capability & limitations of FSM.DFS. Generating functions and applications.. 2 Mott J. 1980 7 Tremblay and Manohar. L. Subrings.Balakrishnan—Graph Theory (Schaum). Flow Augmenting Path. McGraw Hill. Ash & Carol Ash. merger table. acceptance by final state & empty stack. Text books : 12 . 1986. Liu C. closed partitions. M. equivalence of PDA and CFL. graphs & trees. state equivalence & minimization. definition. Trees.Computer Science & Engineering Syllabus Rings and Boolean algebra: Rings. Pushdown Automata : Definition. Properties of Trees. “Introduction to discrete Mathematics”.Prim’s Algorithm. TMH 2.TMH 4 S. Boolean Rings. two way finite automata equivalence with one way. incompletely specified machines. Integral domains and fields. Finite Automation : Preliminaries (strings. applications of finite automata. Boolean sub-algebra. Structure of Sequential Machines : Concept of partitions. Boolean Algebra . lattice of closed partitions. Shortest Path Problem. recognition of a language by an automata . L.
“Theory of Automata & Formal Language”. and Leibermann G. FSK. Operation Research and Optimization Techniques CS 402 Contact: 3L + IT Credit: 4 Introduction to OR modelling approach and various real life situations Linear programming problems and applications. Replacement. Data protection. “An Introduction to Formal Languages and Automata”. Narosa Publishers. 3. MH Principles of Communication Engineering EC 411 Contact: 3L Credit: 3 Amplitude and Frequency Modulation – their generation and detection Bandwidth requirements Low Power and High Modulators and Modulated amplifiers. Shannon’s sampling Theorem.. PAM. Languages & Computation”.. “Operation Research”. Narosa. application.Computer Science & Engineering Syllabus 1. “Switching & Finite Automata”. PSK performance evaluation. Digital Modulation : ASK. Game Theory—Introduction. Sensitivity analysis . 6.M. Operations Research – Schaum outline series. 2.I. 2. Data Transmission Synchronization.TMH Martin—Introduction Lewis H. Integer programming concepts. 6. Optimization. M/M/I queues in series . . Time Division Multiplexing and Demultiplexing. Fifth edn.M. error detection and correlation. “Operations Research”. basic definitions & notations. Kain. Decisions under risk.. “Introduction to Automata Theory. Elements of Satellite Communication tracking and control. P. Kohavi ZVI. D/A Converters. axiomatic derivation of the arrival & departure distributions for Poission Queue. Modems.K. formulation.L. McGraw Hill. 1974. 7/e (with CD). “Linear Programming”.Operations Research Kanti Swaroop-. Tata McGraw Hill. H. Simplex Method and extensions. Macmillan Publishing Company. 2. 1992. 2nd Edn. Taha. 3. J. Decisions under uncertainty Queuing Theory—Introduction. 4. “Elements of the theory of Computation”. Various components of LP problem formulation. 3. 1983.H. Signal to Noise ratio of A. Kapoor-. and Ullman JD. and P. Linz Peter. transmission. A/D. Dynamic Programming—Modeling . solution and applications. 4. 5. R. 5. 1987. Their generation and detection. Hopcroft JE. Reference: 1. Text: 1.P Mishra & N. Holder Day Inc. PHI Ash & Ash – “Discrete Mathematics”. Poission Queuing model.TMH Hiller F. PPM and PCM. References : 1. V. Maximal Flow including PERT-CPM. Superheterodyne detection. Chandrasekharan – “Theory of Computer Science”.Operations Research Hadley G. Channel capacity. Error control and coding. 13 .. Narosa “Introduction to Formal Languages”. and Papadimitrou C.. Hillier & Lieberman—Introduction to Operations Research. Tata McGraw Hill. K. Hamdy A. PWM. Solving Linear Programming problem using simultaneous equations and Graphical Method. Revised Simplex Transportation and assignment problems Network Analysis-shortest Paths.Duality theory.
vector register architecture. Techniques to reduce cache misses. SISD. McGraw Hill. 1993 2. P. example processors such as MIPS. 2. virtual memory. 3.TMH Reference: Quinn—Parallel Processing Operation Research Lab CS-492 Contacts: 3P Credits: 2 Software based lab using C & FORTRAN . Carter—Computer Architecture ( Schaum Series). B. Hwang & Briggs—Computer Architecture & Parallel Processing.J. For FORTRAN: 1) Familiarization with FORTRAN. distributed shared memory architectures..A. Ghosh & Pal.. TMH 5. memory to memory vector architectures. “Communication Systems . and Hennessy . “Advanced Computerat”. comparison with vector processors. J. Vector processors. S. John Wiley. “Computer architecture a quantitative approach”. addressing modes. vector length and stride issues. Addison Wesley. and Shilling D. comelier issues. etc. 1996 4. H.Graw Hill Haykin S. TMH Advanced Computer Architecture CS 403 Contacts: 3L + 1T Credits: 4 Review of Pipelining. Computer Organization & Architecture (TMH WBUT Series). pipeline hazards. 1990 7. “Interconnection Network for Large Scale parallel Processing”..L. RISC architectures. “Advanced Computer architecture with parallel programming”. Morgan Kaufman. technique to reduce cache hit times. Hwang.TMH 3. MIMD. data hazards. Text Books: 1. K. techniques to reduce cache penalties. H. Power PC. (3) 14 . “Communication Systems”. example of array processors such as MMX Technology..TMH Carlson R.Kennedy—Electronic Communication Systems.4/e. Wiley Eastern..Computer Science & Engineering Syllabus Text : 1. Lathi B. PA-RISC. Effect of main memory bandwidth.S.. McGraw Hill. “Principles of Communication Systems”. synchronization and memory consistency models. Memory hierarchy. Siegel. Mc. Array processors.Use and effectiveness. etc. Patterson D. Cache Introduction. Techniques to handle hazards. Data flow architectures. Centralized shared architectures. 2nd ed. 1989 6. performance improvement with pipelines and effect of hazards on the performance. Stone. compiler effectiveness in vector processors. MISD. Single instruction multiple data stream (SIMD) architectures. message passing architectures. Taub H. MIMID Multiprocessors. 2nd Ed. L.. 4/e . memory access time. Reference: 1. effect of simplification on the performance. Examples of some pipeline in modern processors.. control hazards. 2/e. SPARC. 4. Interconnection networks. “An Introduction to Analog and Digital Communication Systems”. instructions formats. effect of bus-width.
Introductory lecture is to be given to the students so that they get a clear idea of the syllabus and understand the need for having such a practice lab in the first place (3 hours) 15 . Study of Amplitude modulation & Demodulation technique. Design an Adder/Subtracter composite unit . 5. 6. f)adder Truth Table verification and clarification from Data-book. Assignment . Review of the different logic design ckts. c) Encoder. Design a multiplex display unit using counter. 8.. decoder etc. Study of Frequency Shift Keying (FSK). Simplex) 1. b)Register. Design a carry-look ahead Adder. e)Shift-Register. 4. 8. Test a RAM chip and cascade two chips for vertical and horizontal expansion. T). JK. Design a ripple counter and carry-look ahead counter and assess the complexity of both the ckts. 7. TECHNICAL REPORT WRITING & / LANGUAGE PRACTICE LABORATORY Code: HU 481 Contact: 3 Credits: 2 Topics to be covered and number of hours required for it: 1. Study of Pulse Amplitude Modulation (PAM). e. e. Duality . a) Multiplexer .g. Use ALU chip for multibit arithmetic operation. Design a keyboard Encoder unit in 2 Dimension. 3. multiplexer. 7. Design a BCD adder. D. Study of Pulse Width Modulation (PWM).(4/8 bit Synchronized Data Transfer). 6. 2. Study of Double Side Band Suppressed Carrier (DSB-SC) & Demodulation technique. Floyd’s Algorithm) 2) Maximal Flow. Lab EC 481 Contacts: 3P Credits: 2 1. d) Counter. Computer Architecture & Organisation Lab Code: CS 493 Contacts: 3P Credits: 2 Linear Programming ( Tranportation . Study of Frequency Modulation & Demodulation. c)Tri-state logic Gates Familiarity with state of art IC-chips. a) Flip/Flop(RS. b) Decoder. 10. 9. 3. Use wired OR tri-state output interconnection. 4. 5.g. Study of Time Division Multiplexing (TDM) & Demultiplexing. 9. Use a multiplexer unit to design a composite ALU . Study of VCO (Voltage controlled oscillator) & PLL (Phase Locked Loop). 2.Computer Science & Engineering Syllabus 2) For C-Language: 1) Shortest Path( Dijkstra’s . 11. 3) PERT/CPM 4) Queueing Theory 5) Integer Programming Problem (Branch & Bound Problem) N:B:-Familiarization with any O. Communication Engg. Study of Single Side Band Suppressed Carrier (SSB-SC) & Demodulation technique.R package.
user and kernel threads. classical problems of synchronization. operations on processes.. 6. storage structure. segmentation. multi-programmed. by making the students listen to specially produced C. System Structure[3L] Computer system operation. deadlock avoidance.L. page replacement algorithms (FCFS. Threads [2L]: overview.O. Operating system functions. Different types of O. 16 . The students are also made to listen to pre-recorded cassettes produced by British Council and also by the Universities of Oxford and Cambridge (6 hours) Group Discussions:. process scheduling. operating system structure (simple. After wards the class is divided into groups and the students have to discuss on given topics on current socio-economic-political-educational importance(12 hours) Interview sessions-students are taught the do’s and don’ts of facing a successful interview. Deadlocks [4L]: system model. TMH 2. It is also helpful to use videocassettes produced by the U. Prasad—Group Discussion & Interview (With Audio Cassette) . Text: 1. storage hierarchy. demand paging. interprocess communication. physical address space. cassettes of such examinations (3 hours) The overall aim of this course is to inculcate a sense of confidence in the students and help them to become good communicators in their social as well as professional lives. synchronization hardware. contiguous memory allocation.S. Sharma—Business Correspondence & Report Writing. deadlock characterization. Sashi Kumar—Spoken English (with Cassette) . LRU). parallel. swapping. Process Synchronization [5L]: background.S. methods for handling deadlocks. evaluation of O. logical vs. benefits of threads.E. Then each and every student has to make lab presentations with the help of the Overhead projector/ using power point presentation and other audio-visual aids in the laboratory. allocation of frames.The students are made to understand the difference between the language of conversion and group discussion.D. Strategies of such discussions are to teach to them. There simulations of real life interview sessions where students have to face an interview panel(12 hours) Presentations: The secrets of an effective presentation are taught to the students. I/O structure. 3. priority). deadlock prevention.Computer Science & Engineering Syllabus 2. paging. Virtual Memory [3L]: background. segmentation with paging. critical region. performance. real-time. different types of protections. TMH Reference: 1. RR.C. system calls. They also have to face the question answer sessions at the end of their presentation (12 hours) Classes are also allotted to prepare the students for competitive examinations like the T. on topics like group-discussion. page replacement. Conversion practice is done on given situation topics. time-sharing. Storage Management [19L] Memory Management [5L]: background. CPU scheduling [3L]: scheduling criteria. thrashing. O/S services. SJF. distributed.: batch. TMH 4. deadlock detection. co-operating processes. scheduling algorithms (FCFS. semaphores.F. recovery from deadlock.G. Fifth Semester Operating System Code: CS 501 Contacts: 3L Credits: 3 Allotted Hrs: 47L Introduction [4L] Introduction to OS. critical section problem. Process Management [17L] Processes [3L]: Concept of processes. preemptive & non-preemptive scheduling. algorithm evaluation. multi-processor scheduling. They then have to face rigorous practices of mock-interviews. 5. layered. virtual machine).
Database security application development using SQL. disk reliability. Placing file records on Disk. Modifications Of the Database. disk formatting. Silbersehatz A. “An Introduction to Operating Systems”. Dynamic Multilevel Indexes using B tree and B+ tree . N. McGraw-Hill 17 . 2. Aggregate Functions. Henry F. one time password. system threats. Mc. Relational Algebra. kernel I/O subsystem (scheduling. Design Issues. linked. buffering. views. file system structure. authentication. “Operating Systems”. performance. Entity-Relationship Model [6L] Basic concepts.. SSTF. Different anamolies in designing a Database. Protection & Security [4L] Goals of protection. statistics and cost bas optimization. assertions. allocation methods (contiguous.Computer Science & Engineering Syllabus File Systems [4L]: file concept. program threats. Concurrency control and Recovery Management : transaction model properties. domain of protection. Text Books / References : 1. Database Management System Code: CS 502 Contacts: 3L Credits: 3 Allotted Hrs: 45L Introduction [4L] Concept & Overview of DBMS. efficiency & performance. Set operations. free-space management (bit vector. Database Languages. SQL and Integrity Constraints [8L] Concept of DDL. 2. Keys. Milenkovie M. clocks and timers. 4.C-SCAN) . Entity-Relationship Diagram. “Fundamentals of Database Systems”. Fixed and Variable sized Records. access methods. Disk Management [3L]: disk structure. Relational Model [5L] Structure of relational Databases. Text Books: 1. “Operating System Concepts”. spooling and device reservation. Null Values. Korth and Silberschatz Abraham. and Peterson J. “Database System Concepts”. SCAN. McGraw Hill. directory structure. Nested Subqueries. Weak Entity Sets.. hash table). secondary. Relational Database Design [9L] Functional Dependency. Multilevel Indexes. directory implementation (linear list.. Company. network devices. Relational Calculus. Dhamdhere: Operating System TMH Stalling. Query optimization : join algorithm. 1992. Maxwell McMillan International Editions. Database Administrator. Tanenbaum A. Extended E-R features. 5NF Internals of RDBMS [7L] Physical data structures. Normalization using funtional dependencies. DML. File Organization & Index Structures [6L] File & Record Concept. two phase locking. William. Three Schema architecture of DBMS. Ramakrishnan: Database Management System . clustering). Types of Single-Level Index (primary. Boyce-Codd Normal Form. threat monitoring. “Operating System : Concept & Design”. indexed). Addison Wesley. 3. Domain Constraints. Basic Structure.Graw Hill.. boot block.S. caching. lock base protocols. Elmasri Ramez and Novathe Shamkant. Extended Relational Algebra Operations. Stored procedures and triggers. application I/O interface (block and character devices. Mapping Constraints. 4NF. “Operating System Design & Implementation”. DMA. blocking and nonblocking I/O). Benjamin Cummings Publishing. interrupts. 5. Database Users. 3NF. L. bad blocks. DCL. I/O Management [4L]: I/O hardware. grouping). Dietel H. polling. Referential Integrity Constraints. linked list. Decomposition. Transaction processing. Practice Hall NJ. Data Models. state serializability. 3.. encryption. security problem. 6. Wiley. Views. error handling). Nomalization using multi-valued depedencies. disk scheduling (FCFS.
Galgottia Publication. Reference: 1. search algorithm etc. 3. J. Sahani Sartaz.2 Horowitz Ellis. DFT & FFT algorithm.. 1985. Examples: The 15-puzzle problem Backtracking [3L] Basic method. Polynomial time approximation schemes: 0/1 knapsack problem Text Books: 1. use. Hamiltonian problem Greedy Method [4L] Basic method. New Delhi “Fundamentals of Database Systems”.Definition.Navathe. 3. minimum spanning tree(Prim's and Kruskal's algorithms) Lower Bound Theory [2L] Bounds on sorting and sorting techniques using partial and total orders. Circuit Satisfiability problem. omega. use.. I & Vol. All pair shortest paths. time and space complexity Big-O. 2.Majumdar. James Martin. Addison Wesley. Disjoint Set Manipulation [2L] Set manipulation algorithm like UNION-FIND. J. Moragan Kauffman Publishers. Addison Wesley Publishing Edition “Database Management Systems”. 7. 4. Examples: matrix-chain multiplication. NP-hard class. Jain: Advanced Database Management System CyberTech Date C. Arun K. Examples: Knapsack problem. NP-complete class. single-source shortest path. Shamkant B. Clique Decision Problem. III. Limitations. finding time complexity of well known algorithms Algorithm Design techniques [2L] Recursion.E. use. Ramez Elmasri. Sanguthevar " Fundamentals of Computer Algorithms". Goodman: Introduction to Design and Analysis Of Algorithms TMH 18 . RAM. Ullman JD..TM etc. performance guarantee. Pritimay Bhattacharya. “Introduction to Database Management”. II.Hopcroft and J. Binary Search Dynamic Programming [4L] Basic method. use. “Principles of Database Management Systems”. use. Job sequencing with deadlines.Knuth “The Art of Computer Programming”. I. Properties of graphs and graph traversal algorithms [3L]: BFS and DFS Matrix manipulation algorithms [5L] Different types of algorithms and solution of simultaneous equations. Tail Recursion Divide and Conquer [3L] Basic method. Design & Analysis of Algorithm Code: CS 503 Contacts: 3L + 1T Credits: 4 Allotted Hrs: 45L Models of computation [4L]: Asymptotic Notation [3L] like. Examples: Merge sort.Computer Science & Engineering Syllabus 4.Ullman “The Design and Analysis of algorithms” D. Prentice Hall of India. A.heapsort. Quick Sort. Approximation algorithms [3L] Necessity of approximation scheme. Examples: Hanoi problem. “Principles of Database Systems”. “Transaction Processing : Concepts and Techniques”. Examples: Eight queens problem. Graph coloring problem. 2. 5. Vol. Use. Tata McGraw Hill Gray Jim and Reuter Address.Aho. union by rank. 6. Path compression. Vol. Travelling Salesman problem Branch and Bound [2L] : Basic method. integer multiplication schemes Notion of NP-completeness [5L] P class. theta etc. R.
and A. Block diagram representation of Control Systems. Khanna Pub.Nievergelt and N. Improvement of system performance through compensation. Mason’s gain formula.Deo. Block Diagram Algebra. K. Transfer Function. Nyquist criteria.: Modern Control System . density.“Combinational algorithms. New Age International Gopal: Digital Control Engineering. Instruction cycle. Construction of Root Loci for simple system. 8253. 7. 8259. Transient analysis of closed loop systems.Vol. potentiometer. Pin description and features.Munro.Reingold. 4. Nichols chart. Signal Flow Graph. temperature etc. A/D and D/A converters and interfacing of the same. tachometers. Stability of Control Systems : R-H criteria. Electrical analogy of physical system. Lock operation.Theory and Practice”. D. Prentice Hall . Peripherals: 8279. PHI Dorf R C & Bishop R. Polar Plots. 1997 A. J. Halt state.H. New Age International Pub. 8251. 4. Addressing modes and their features. 6. New Age International Sinha: Control Systems. wait state. 3. frequency.C. Software instruction set and Assembly Language Programming. current.Computer Science & Engineering Syllabus Reference: 1.C.Baase “Computer algorithms” E. addressing modes and their features. Bode Plots. I & Vol. Automatic Control System. read/write cycle in min/max mode.M. Control of liquid level. 9. Case studies on control voltage. 10. Timing diagram. P. Interrupts and DMA. Kuo B. 8237. 1. 8255.Horowitz and Shani “Fundamentals of Computer algorithms” E. segmented memory has cycles. 8. 5. Addison – Wisley Bolton: Industrial Control & Instrumentation. modulators and demodulators. machine cycle. Ogata K : Modern Control Engg. measures of relative stability. synchros.Borodin and I. Control system components : Error sensing devices. position and speed. flow. Reset operation. interrupt processing. Orient Longman Nakra: Theory & Applications of Automatic Control. 2 “ S. Nagrath I J & Gopal M : Control Systems Engineering. “The computational complexity of Algebraic and Numeric problems” CONTROL SYSTEM Code : EE 503 Contacts : 3L + 1T Credits :4 Concept of feedback and Automatic Control. New Age International Microprocessor and Microcontrollers Code: EI 502 Contacts: 3L + 1T Credits:4 Introduction to 8085A CPU architecture-register organization. 19 . New Age International Gopal: Modern Control System Theory. Typical applications of a microprocessor. steady state error and their minimisation. Transient errors and their minimisation. PI and P-I-D type controllers. error coefficients.Mehlhorn . BOOKS . Hold state.C. 3. PHI Das Gupta S : Control System Theory . effects of the movement of poles and zeros. Hardware Interfacing: Interfacing memory. 5. 16 bit processors: 8086 and architecture. “Data Structures and algorithms. 2. 2. servomotors. peripheral chips (IO mapped IO & Memory mapped IO).
4. duplicating a process image. 2. An introduction to micro computers Vol. repeat. named pipes(FIFOs. del_semvalue. Intel Corp: The 8085 / 8085A. TRUNCATE statements DROP. accessing FIFO) Database Management System Lab Code: CS 592 Contacts: 3P Credits: 2 Structured Query Language 1. 5. semop. 4. pthread_attr_init. replacing a process image. POSIX Threads [9P]: programming with pthread functions(viz. Process [6P]: starting new process. making a script executable. 5. 1987 The Intel Microprocessors: 8086/8088. functions. Miller. 6. waiting for a process. GROUP BY and HAVING Clause Using Aggregate Functions Combining Tables Using JOINS 20 . pthread_create. Wiley inter science publications. programming and applications with 8085/8085A. BETWEEN. 2 – some real Microprocessor – Galgotia Book Source.TMH Intel Corp. Brey. Retrieving Data from a Database The SELECT statement Using the WHERE clause Using Logical Operators in the WHERE clause Using IN. India 1996. McGraw Hill International Ed. New Delhi by Adam Osborne and J. Gaonkar. sending signals. Creating Database Creating a Database Creating a Table Specifying Relational Data Types Specifying Constraints Creating Indexes 2. semaphore_v). control structures. UPDATE. Shell programming [6P]: creating a script. Brief overview of some other microprocessors (eg. Signal [9P]: signal handling. commands). 3. 80286. ORDER BY. Semaphore [6P]: programming with semaphores (use functions semctl. segment override. 8. signal sets. set_semvalue. Kane Advanced Microprocessors by Ray and Bhurchandi . pthread_exit. shell syntax (variables. pclose). Table and Record Handling INSERT statement Using SELECT and INSERT together DELETE. pthread_cancel) Inter-process communication [9P]: pipes(use functions pipe. Microprocessor architecture. zombie process. 6. Prentice Hall. Subex Inc. 3. 80186. semaphore_p. Microprocessors and Interfacing by Douglas V. 6800 Microprocessor).Computer Science & Engineering Syllabus Software instruction set (including specific instructions like string instructions. pthread_join. lock prefizers and their use) and Assembly Language programming with the same. 1989 by Ramesh S. semget. Wiley eastern Ltd. 1992 Assembly Language Programming the IBM PC by Alan R. signal interface. Hall. 80386 & 80486. Micro Controller Handbook – Intel Publications. 2. ALTER statements 3. LIKE . References: 1. Operating System Lab Code: CS 591 Contacts: 3P Credits: 2 1. 1980. Microprocessor Book – Intel marketing communication. conditions. 7. popen. Bary B. 1994.
control system tool box. DETERMINATION OF PI.CONTROL SYSTEM TOOLBOX FOR 2ND ORDER SYSTEM & DETERMINATION OF DIFFERERNT CONTROL SYSTEM SPECIFICATIONS FROM THE PLOT. Load/Store. 3 3 Programming using kit/simulator for i) table look up ii) Copying a block of memory iii) Shifting a block of memory 9 21 . PERCENTAGE PEAK OVERSHOOT. GAIN MARGIN. 1. SETTING TIME. Arithmetic. Logical) Assignments based on above. PD. 3) 4) 5) 6) 7) 8) Microprocessor and Micro-controller Lab Code: EI 592 Contacts: 3P Credits: 2 Sl. BODE. hours of 3 2. SIMULATION OF STEP RESPONSE & IMPULSE RESPONSE FOR TYPE-0 . NYQUIST PLOT USING MATLAB.Computer Science & Engineering Syllabus Subqueries 4..PLOT. Arithmetic. STUDY OF A PRACTICAL POSITION CONTROL SYSTEM & DETERMINATION OF CONTROL SYSTEM SPECIFICATIONS FOR VARIATION OF SYSTEM PARAMETERS. Familiarization with 8085 simulator on PC. MAT –Lab. Study of prewritten programs on trainer kit using the basic instruction set ( data transfer. Study of prewritten programs using basic instruction set ( data transfer. SETTLING TIME ETC.Lab. EVALUATION OF STEADY STATE ERROR. Database Management Creating Views Creating Column Aliases Creating Database Users Using GRANT and REVOKE Cursors in Oracle PL / SQL Writing Oracle PL / SQL Stored Procedures CONTROL SYSTEM LAB (PSPICE & MAT LAB) Code : EE 593 Contacts : 3 P Credit : 2 List Of Experiments 1) 2) Familarisation with MAT. a) c) b) 4. No. including the memory map. DETERMINATION OF STEP RESPONSE FOR FIRST ORDER & SECOND ORDER SYSTEM WITH UNITY FEEDBACK ON CRO &CALCULATIONS OF CONTROL SYSTEM SPECIFICATIONS LIKE TIME CONSTANT . Familiarization with the process of storing and viewing the contents of memory as well as registers. Name of the Experiments Familiarization with 8085 register level architecture and trainer kit components. TYPE-1 & TYPE –2 SYSTEM WITH UNITY FEEDBACK USING MATLAB & PSPICE. a) b) 3. PHASE MARGIN WITH ADDITION OF LEAD COMPENSATOR & BY COMPENSATOR IN FORWARD PATH TRANSFER FUNCTION FOR UNITY FEED BACK CONTROL SYSTEM USING PSPICE OR OTHERWISE. DETERMINATION OF APPROXIMATE TRANSFER FUNCTION EXPERIMENTALLY FROM BODE PLOT.simulink tool box & PSPICE. Logical) on the simulator.PID CONTROLLER ACTION OF FIRST ORDER SIMULATED PROCESS. Load/Store. Assignments based on above No. DETERMINATION OF ROOT LOCUS. % PEAK OVERSHOOT. FROM THE RESPONSE.
reading switch state & glowing LEDs accordingly. TCP/IP reference model. 74LS373) with trainer kit as a peripheral mapped output port with absolute address decoding Interfacing with I/O modules: a) ADC b) Speed control of mini DC motor using DAC c) Keyboard d) Multi-digit Display with multiplexing e) Stepper motor Writing programs for ‘Wait Loop (busy waiting)’ and ISR for vectored interrupts (eg. HDLC. Module II Data link layer: [6L] Types of errors. TDM. Protocols and standards. WDM. framing(character and bit stuffing). Go-Back. network criteria. Data communications: components.Computer Science & Engineering Syllabus iv) v) vi) vii) viii) 5. counting number of pulses within specified time period) Study of 8051 Micro controller kit and writing programs for the following tasks using the kit a) Table look up b) Basic arithmetic and logical operations c) Interfacing of Keyboard and stepper motor Familiarization with EPROM programming and Erasing 6. half duplex.WAN). Circuit switching: time division & space division switch. Flow control. their comparative study. Telephone network.N ARQ. Protocols: Stop & wait ARQ. full duplex). MAN. TDM bus.ISO etc. Note II: Two questions are to be set from each module out of which five questions are to be answered taking at least one from each module. 6 10. 3 7. subroutine for delay.Internet: brief history. All questions carry equal marks. Packing and unpacking of BCD numbers Addition of BCD numbers Binary to ASCII conversion String Matching Multiplication using Booth’s Algorithm 3 Program using subroutine calls and IN/OUT instructions using 8255 PPI on the trainer kit eg. 3 9. finding out the frequency of a pulse train etc Interfacing any 8-bit Latch (eg. signal(analog & digital). internet today. physical structure (type of connection. topology). 22 .). error detection & correction methods. Reference models: OSI reference model.direction of data flow(simplex. Physical level: [5L] Overview of data(analog & digital). transmission (analog & digital)& transmission media ( guided & non-guided). FDM. Networks: distributed processing. 12 8. Selective repeat ARQ. 3 Sixth Semester Computer Network Code: CS 601 Contact: 3L + 1T Credits: 4 Allotted Hrs: 45L Note I: There will be one objective type question comprising 10 numbers spread over the entire syllabus and each carrying one mark. Module I Overview of data communication and Networking: [5L] Introduction. data representation(ASCII. categories of network (LAN.
Routing algorithms: shortest path algorithm. NCP. Process Organization & Interactions. LCP. Traditional Ethernet. SNMP. CSMA. System Development Life Cycle. token bus. Data & Computer Communication. Black. Zheng & Akhtar. static vs. Digital & Data Communication. Security: Cryptography. Miller. Widjaja – “Communication Networks” – TMH 3.)” – Pearson Education/PHI 3. Spiral Model. Module I Overview of System Analysis & Design . Reservation. Token bucket algorithm. RARP. routing table for classful address. Sonet. 1. UDP. Waterfall Model . IPV6. ICMP. Shay. Firewalls. Congestion control algorithm: Leaky bucket algorithm. Protocols: ARP. Walrand – “Communication Networks” – TMH. A. SMTP. Text Books: 1. Bridges.11. Transport layer: [6L] Process to process delivery.Benefit Analysis. polling. Module III Network layer: [8L] Internetworking & devices: Repeaters. Note II: Two questions are to be set from each module out of which five questions are to be answered taking at least one from each module. Hubs. Quality of service: techniques to improve Qos. Modern topics: [5L] ISDN services & ATM . concentration. Feasibility Analysis. Module IV Application layer: [5L] DNS. [10L] Module II System Requirement Specification – DFD. VLAN’s. A. Slotted ALOHA. 4. TDMA. Multiple access protocols: Pure ALOHA. Understanding Data Communication & Network.Computer Science & Engineering Syllabus Medium access sub layer: [5L] Point to point protocol. data Communication & Network. user authentication. ER diagram. Stallings – “Data and Computer Communications (5th Ed. Technical Feasibility. choke packets. Wireless LAN: IEEE 802. Unicast and multicast routing protocols. S. W. Addressing : Internet address. Garica. distance vector routing. link state routing. DSL technology. Cost. All questions carry equal marks. CDMA. dynamic routing . Router. OUP 5. FDDI. Data Dictionary. Cable modem. Tanenbaum – “Computer Networks (4th Ed. PHI 6. CSMA/CD. Gateway. [5L] 23 . 3(4th Ed.)” – Pearson Education/PHI Software Engineering Code: CS 602 Contact: 3L Credits: 3 Allotted Hrs: 45L Note I: There will be one objective type question comprising 10 numbers spread over the entire syllabus and each carrying one mark. classful address. subnetting. Introduction to blue-tooth.) “ – TMH 2. Kurose and Rose – “ Computer Networking -A top down approach featuring the internet” – Pearson Education 2. Switches. B. token ring. FTP. fast Ethernet. vol. Leon. FDMA. Forouzan – “Data Communications and Networking (3rd Ed. Miller. COCOMO model. security protocols in internet. TCP. IP. Business System Concept. Vikas 7. 2. HTTP & WWW. Network for Computer Scientists & Engineers. Comer – “Internetworking with TCP/IP. Cellular telephony & Satellite network. flooding. Jaico 8. Vikas Reference Books: 1.)” – PHI/ Pearson Education 4. Routing : techniques.
Light pens etc. OO Programming. Matrix representations & homogeneous coordinates. [5L] Books: Text: 1. IEEE Standards on Software Engineering. rotation. scaling . . flood fill algorithm. clipping operations . scan line polygon. preparing. Reliability Assessment . G. lookup table. Visualization & image processing. Note II: Two questions are to be set from each module out of which five questions are to be answered taking at least one from each module. [7L] CASE TOOLS : Concepts. Functional vs.Uma. Pressman – Software Engineering. parallel lines. 2. Module I Introduction to computer graphics & graphics systems [6L] Overview of computer graphics. intersecting lines. Computer graphics software. decision table and structured English.TMH 6. point clipping . Software Defect Prevention. Circle generation algorithm. digitizers. Ellipse generating algorithm. polygons & ellipse. clipping circles . boundary fill algorithm. Reuse. Software Quality. Bresenham’s line algorithm. Raster scan display. Ian – Software Engineering.Vans Vlet. line clipping. Pearson Education 9. Kane. Object. Monitoring & Control. [5L] Coding & Documentation Documentation. NAROSA. transformations between coordinate systems. use and application. Software Engineering Fundamentals. SCHACH. direct coding. Line drawing algorithms. Project Monitoring. Integration Testing. R. Plotters. 24 .. [8L] Module IV Software Project Management – Project Scheduling . storage tube graphics display. SPD Computer Graphics & Multimedia Code: CS 603 Contact: 3L Credits: 3 Allotted Hrs: 45L Note I: There will be one objective type question comprising 10 numbers spread over the entire syllabus and each carrying one mark. PHI 4. Vikas Reference: 1. 5. RGB color model. 3D viewing devices.Decision tree. Validation & Verification Metrics. Viewing pipeline. Essentials of Software Engineering. representing pictures. Staffing. Transformation of points. Jaico 8. [4L] Module III Structured Programming. presenting & interacting with pictures for presentations. DDA algorithm. System Testing – Levels of Testing.Sommerville.Benmenachen. Test case Specification. Scan conversion: [6L] Points & lines. reflection shear. Ghezzi. Active & Passive graphics devices.Behforooz.Computer Science & Engineering Syllabus System Design – Problem Partitioning.Object Oriented & Classical Software Engineering(Fifth Edition). fill algorithm.Pankaj Jalote – An Integrated Approach to Software Engineering. Window to viewport co-ordinate transformation . SPD 7. All questions carry equal marks. printers.Oriented approach. lines . Information Hiding. Top-Down And Bottop-Up design . Software Engineering.OUP 3. TMH 2. Software Configuration Management. Module II 2D transformation & viewing [8L] Basic transformations: translation . Quality Assurance. Software Engineering.
Z.) – Pearson Education. MIDI.)” – TMH 3. 3. Vandam. 25 . uses of multimedia. Text Books: 1. Sanhker. 2. Note II: Two questions are to be set from each module out of which five questions are to be answered taking at least one from each module. Plastock – “ Schaum’s outlines Computer Graphics (2nd Ed.)” – TMH 4. morphing. Back face detection. Hill. video and audio standards.. Texture. utility.geometry. PHI 5. surfaces . Hearn. Vikas 9. Pearson Education Reference Books: 1. Hidden surfaces [3L] Depth comparison. scaling & other transformations. interpolative shading model. R. J. Multimedia. Audio: digital audio. Sproull – “Principles of Interactive computer Graphics” – TMH. designs . clipping. Hidden line elimination. Foley. 3D viewing. BSP tree method. D. Baker – “ Computer Graphics ( C version 2nd Ed. Xiang. B-spline curves. Rogers. Module III Curves [3L] Curve representation.Computer Science & Engineering Syllabus 3D transformation & viewing [7L] 3D transformations: translation. Adams – “ Mathematical Elements for Computer Graphics (2nd Ed. Image. Buford J. compression through spatial and temporal redundancy. W. reflection through an arbitrary plane. F. K. Mukherjee Arup. wire frame methods . Rotation about an arbitrary axis in space. Introduction to Computer Graphics. hypertext and hypermedia. Elsom Cook – “Principles of Interactive Multimedia” – McGraw Hill System Software and Administration Code: CS 604 Contact: 3L + 1T Credits: 4 Allotted Hrs: 45L Note I: There will be one objective type question comprising 10 numbers spread over the entire syllabus and each carrying one mark. general parallel projection transformation.)” – Pearson education 2. Bezier curves . Color & shading models [2L] Light & color model. Mukherjee. rotation. Jaico 6. techniques. A. the Printer’s algorithm. Fundamentals of Computer graphics & Multimedia. Z-buffer algorithm. compression. Virtual Reality concepts. F. sampling. R. PHI 8. Andleigh & Thakrar. Animation: types. end conditions for periodic B-spline curves. All questions carry equal marks. Multimedia –A Practical Approach. key frame animation. Module IV Multimedia [10L] Introduction to Multimedia: Concepts. Newman. Video: MPEG compression standards. fractal . Hughes – “Computer Graphics principles (2nd Ed. viewport clipping. Feiner. M. rational B-spline curves. scan-line algorithm. – “Multimedia Systems” – Pearson Education 7.Computer Graphics using open GL. processing sound. inter-frame and intraframe compression .
Processes: Process status. Beck – “System Software “ (3rd Ed. process priority. Reallocation. absolute loaders. Direct linking loaders. System Backup & Recovery: [3L] Log files for system and applications. Configuring IP Accounting.L. Stevens – “Unix network programming. W. init and the inittab file. 1(4th Ed. Backup schedules and methods (manual and automated). setting passwords. Mounting filesystems. Running an NIS Server. Shadow file. Setting the Hostname. Configuring the Kernel for IP Masquerade. R. default files. What Is a Firewall? What Is IP Filtering? Setting Up Linux for Firewalling Testing a Firewall Configuration. Cross Assemblers. I-nodes. ifconfig. vol.).TMH 5. Console. Design of two pass assemblers. Interface Configuration for IP. Checking the ARP Tables. conditional macro expansion. 1(2nd Ed. Groups and the group file. Run level scripts. Name service and resolver configuration. Assigning IP Addresses. Using IP Accounting Results IP Masquerade and Network Address Translation : [4L] Side Effects and Fringe Benefits.static & dynamic linking. vol. The exports File. macro calls within macros). Writing hosts and networks Files. Abacus. dynamic binders. Kernel loading.(macro instruction arguments. The NFS Daemons. The scheduler. Text Books: 1. Removing users. Module III TCP/IP Firewall : [6L] Methods of Attack. Administration tools. password file. Mounting an NFS Volume. L. Implementation of a restricted facility : A two pass algorithm. Vikas Reference Books: 1. Boot disks Configuring the TCP/IP Networking : [4L] Kernel Configuration. Configuring the Kernel for IP Accounting. Run-levels. Macro Assemblers. Making filesystems.)” – Pearson Education/PHI 26 .)” – Pearson Education/PHI 2. 1” – PHI/Pearson Education 3. Filesystem checker. Starting up and Shut down: Peripherals. restricted shells. user management commands. Superblock. R. Kirch – “ Linux network Administrator’s guide (2nd Ed. Debuggers. Shells. Maxwell – “Unix system administration” . Killing processes. Installing the Binaries. Comer – “Internetworking with TCP/IP. Creating Subnets. Password security. W. Loader schemes: Compile and go loaders. Configuring IP Masquerade. Swap space. Network file system: [3L] Preparing NFS. Mounting the /proc Filesystem. Switching user. LINUX Installation & Administration. Overlays. NIS Server Security. netstat command. Stevens – “TCP/IP illustrated. Working principle of Editors. Binders. Macro Processors – Features of a macro facility. vol. System Administration Module II Introduction: [3L] Duties of the Administrator. Module IV The Network Information System : [3L] Getting Acquainted with NIS. Wells. Device files. homes and permissions. Limoncelli –“The Practice of System & Network Administration”-Pearson 6. locking accounts. Switching group. 3. Linking. relocating loader. Network Filesystems. Managing User Accounts: [2L] Principles.Pearson Education 2. profiles. Managing Unix File Systems: [2L] Partitions.)” – O’Rielly 4. A Sample Firewall Configuration: IP Accounting. NIS Versus NIS+ . Overview of permissions. Raw and Block files. The Client Side of NIS. Logical Volumes. Formatting disks.Computer Science & Engineering Syllabus Module I System Software  Assemblers: General design procedures. Michel Ticher – “PC System Programming” .
TMH Jana. C++ & Object Oriented Programming. aggregation. Computer network Lab Code: CS 691 Contact: 3P Credits: 2 • • IPC (Message queue) NIC Installation & Configuration (Windows/Linux) 27 . meta-class. 4. History and development of Object Oriented Programming language. Module III Basic concepts of object oriented programming using Java [15 L] Object. Object Oriented Analysis & Design Using UML. . message passing. links. instantiation. Shroff Publishers / Wrox Srimathi. Note. 3. Snyder. 2. PHI Alhir.model constraints and comments.association. 5. Text Books : 1. S. Herbert Schildt – “The complete reference-Java2” .TMH Priestley – “ Practical Object Oriented Design using UML” . Major and minor elements. relationships among classes. using. G. Rambaugh. encapsulation. 8. concepts of object oriented programming language. Module II Object oriented design [10 L] Relationships among objects. implementation diagram. 3. class.Computer Science & Engineering Syllabus 4. 6. aggregation.“Object –Oriented System Development” . 2. 4. Class. New Age International Mahapatra: Introduction to System Dynamic Modelling. Stereotype. learning UML. 7. Meiler . Ali Bahrami. James Michael. 5. Shroff / Wrox 1. Scitech Alhir : UML in a Nutshell. activity diagram. grouping constructs. SPD/O’Reily Reference Books: Page Jones. E. Shroff Publishers / O’reilly Olshevsky : Revolutionary guide to Object Oriented Programming using C++. Object.Mc Graw Hill. polymorphism. 6. threading. difference between OOP and other conventional programming-advantages and disadvantages. PHI Patrick Naughton. T. applet programming. aggregation. 7. UML diagrams: Class diagram. R. UML extensibility. Nemeth. Foundations of Object Oriented Languages. sequence diagram. Seebass.Prentice Hall India/ Pearson Education Bruce.“Fundamentals of object oriented design in UML” Roff: UML: A Beginner’s Guide TMH Rajaram: Object Oriented Programming and C++. why modeling. Module IV Fundamentals of Object Oriented design in UML [12 L] Static and dynamic models. statechart diagram. Hein – “ Unix system administration handbook” – Pearson Education Object Technology & UML Code: CS 605 Contact: 3L Credits: 3 Allotted Hrs: 45L Module I Introduction [6 L] Why object orientation.“Object Oriented Modelling and Design” . Universities Press Muller : Instant UML. Object oriented analysis [4L] Usecase diagram. Blaha . interaction diagram: collaboration diagram.
vectors. overriding Assignments on wrapper class. handling errors and exceptions. snort. T-connector) o Hubs. Language Processor Code: CS 701 Contact: 3L Credits: 3 Allotted Hrs: 45L Introduction to Compiling [3L] 28 . constructor. extending interfaces Assignments on creating and accessing packages Assignments on multithreaded programming. lines & polygons 2-D / 3-D transformations Simple fractals representation Filling algorithms Web document creation using Dreamweaver. Creating Animation using Flash. Nmap Server configuration (FTP. arrays Assignments on developing interfaces. UTP) o Connectors (RJ45. line & regular figure algorithms Raster scan line & circle drawing algorithms Clipping & Windowing algorithms for points. Go Back N) • • • • Computer Graphics Lab Code: CS 693 Contact: 3P Credits: 2 • • • • • • • • Point plotting.Computer Science & Engineering Syllabus • Familiarization with o Networking cables (CAT5. Finger. SMTP. Assignments on class. 3. Sliding Window) o Data Link Layer Error Detection Mechanism (Cyclic Redundancy Check) o Data Link Layer Error Control Mechanism (Selective Repeat. inheritance. applet programming and graphics programming Use of CASE tools Note: Use Java as programming language. SYSTEM SOFTWARE & ADMINISTRATION LAB Code: CS 694 Contact: 3P Credits: 2 Packet Monitoring software (tcpdump.multiple inheritance. ethereal) Trace route. 2. 5. Ping. DNS) NFS Configuration Firewall Configuration using iptables/ipchains (Linux only) Experiments using Turbo C Assembler Note: All the above experiments may be performed in both Unix /Linux & Windows Object Technology Lab Code: CS 695 Contacts: 3P Credits: 2 • • • • • • 1. 4. 6. Switches TCP/UDP Socket Programming Multicast & Broadcast Sockets Implementation of a Prototype Multithreaded Server Implementation of o Data Link Layer Flow Control Mechanism (Stop & Wait. overloading.
Viable prefixes.Pearson Education. Problem Space & search: Defining the problem as state space search.Toe problem. Intermediate code generation [4L] Intermediate languages. Type checking [4L] Type systems. Lexical Analysis [6L] The role of the lexical analyzer. issues in the design of search programs. LR parsers (SLR. Non-recursive Predictive parsing (LL). Lexemes. Control stack. Binding of names).Computer Science & Engineering Syllabus Compilers. goal based agents. production system. The phases of the compiler. Sethi. Code optimization [5L] Introduction. Equivalence of type expressions. Specifications of a token. Writing a grammar. Implementation of three address statements (Quadruples. dynamic storage allocation techniques. Top down Parsing. Intelligent Agents  Agents & environment. Tokens. Ullman . Storage organization (Subdivision of run-time memory. 2. Holub . scope of declaration. Design of a lexical analyzer generator (Lex). Text books: 1. Triples. Syntax Analysis [9L] The role of a parser. Loops in flow graph. Techniques and Tools” . Activation records). call by reference. Bottom-up evaluation of inherited attributes. Problem Solving  Problems.PHI. From a regular expression to NFA. copy restore. Construction of syntax trees. Error Recovery strategies for different parsing techniques. Storage allocation strategies. structure of agents. Tic . Analysis of the source program.“Compiler Principles. Three-address code. Graphical representation. L attributed definitions.Tac . Recognition of a tokens. a simple code generator. Handles. Bottom-up evaluation of S attributed definitions. AI technique.“Compiler Design in C” . Symbol tables. The principle sources of optimization. Transformation of basic blocks. Parameter passing (call by value. problem characteristics. From a regular expression to an NFA. LALR). Bottom up parsing.Problems of AI. Context free grammars. Patterns. call by name). learning agents. Type conversions Run time environments [5L] Source language issues (Activation trees. Basic blocks & flow graphs. Register allocation & assignment. Code generations [4L] Issues in the design of code generator. nature of environment. Specification of a simple type checker. Input buffering. Finite automata. From a regular expression to DFA. Aho. Syntax directed translation [5L] Syntax director definitions. utility based agents. Indirect triples). Dag representation of basic blocks. Cousins of the compiler. Artificial Intelligence Code: CS-702 Contact: 3L Credits: 3 Allotted Hrs: Introduction  Overview of Artificial intelligence. Parser generators (YACC). Search techniques  45L 29 . Operator precedence parsing. Peephole optimization.
Heuristic search strategies  Greedy best-first search. Probabilistic reasoning  Representing knowledge in an uncertain domain. Ritch & Knight. bidirectional search. optimal decisions & strategies in games. comparing uniform search strategies. searching for solutions. discourse & pragmatic processing. simulated annealing search. neural net learning & genetic learning. additional refinements. Fuzzy sets & fuzzy logics. Syntactic processing. matching. expert system shells. computable functions & predicates. local search for constraint satisfaction problems. representing instant & ISA relationship. other planning techniques. Adversarial search  Games. the minimax search procedure. logic programming. representation & mapping. Expert Systems  Representing and using domain knowledge. components of a planning system.Computer Science & Engineering Syllabus Solving problems by searching :problem solving agents. alpha-beta pruning. knowledge acquisition. control knowledge. TMH 30 . A* search. forward verses backward reasoning. learning decision trees. Planning  Overview. Using predicate logic  Representing simple fact in logic. Learning  Forms of learning. Goal stack planning. resolution. the semantics of Bayesian networks. explanation based learning.  Books: 1. Knowledge & reasoning  Knowledge representation issues. depth limited search. memory bounded heuristic search: local search algorithms & optimization problems: Hill climbing search. Artificial Intelligence. uniform search strategies: breadth first search. Hierarchical planning. issues in knowledge representation. inductive learning. semantic analysis. constraint satisfaction problems. Representing knowledge using rules  Procedural verses declarative knowledge. local beam search. Dempster-Shafer theory. Natural Language processing  Introduction. iterative deepening. depth first search. natural deduction. Basic knowledge of programming language like Prolog & Lisp. genetic algorithms. approaches to knowledge representation. learning using relevance information.
string object. buttons.Visual Basic 6. Artificial Intelligence.Visual Basic 6 from the Ground Up. Declaring variables. basics of Enterprise Java Beans. Artificial Intelligence A Modern Approach. understanding the layout in JSP. date object. prepared statement and callable statement. an overview of DHTML. Visual Basic 6. Concepts of X-Windows System & programming. java applet life cycle. Different type variables & their use in VB. Expert Systems.Computer Science & Engineering Syllabus 2. Patterson. Controls & Properties. PHI 4. JSP [15L] JSP architecture. TMH 5. variables.Learn Microsoft VB 6. Data form Wizard. Introduction to Artificial Intelligence & Expert Systems. taking control of windows. OUP 5. Text Boxes. Books: 1. ODBC data base connectivity. processing request from user and generating dynamic response for the user. Pearson 6. timer control. Saroj Kaushik. Krishnan. Poole. Win32 API Programming With VB . check boxes. Frames. J2EE[7L] An overview of J2EE web services. Making decisions. Graphics. introduction to JDBC. sub-functions & Procedure details. Combo Boxes. comparative studies of different technologies of dynamic page creation Active Web Pages [2L] Need of active web pages. cascading style sheet (css). Tools. JNI. adding multimedia and sound resources Writing windows applications. The servlet life cycle.Wright. inserting applets and java beans into JSP. Concept about form Project. Computational Intelligence. windows resources and functions.Beginning VB 6 . data Arrays. Cornell. conditional statements. List Box control. VIKAS 7. Special controls. CDG. Creating ODBC data source name. New Age International 6. basics of RMI. communication via messages. comparing JSP and ASP program. Scitech 7. Stuart Russel Peter Norvig Pearson 3. query. dialog boxes. Pearson Visual Programming & Web Technology Code: CS-703 Contact: 3L Credits: 3 Allotted Hrs: 45L Windows concepts and terminology. key elements  Creating the look. Application.Visual basic 6. HTML support. Toolbox. PHI/MSP 3. Data basics. EJB vs. Giarranto. Input box () & Msgbox ().SPD/O’REILLY 2. using include and forward action. comparing JSP and CGI program.SPD/WROX 31 . adding menus.TMH 4. Java Servlet [4L] Servlet environment and role. Programming with data.0 Now. Introduction to Visual Basic & difference with BASIC. Java Beans. looping List boxes & Data lists. Idea about Labels. methods in JSP. inserting java expression in JSP.Dietel. operators. built in functions.Halvorson. Russel. JSP servers. Roman. JSP tags. and menus in VB Applications. Dynamic Web Pages [2L] The need of dynamic web pages. Buttons. array object. Logic & Prolog Programming. Servlet API. Java Script [3L] Data types. Cookies and Sessions.0 in 30 days.
PHI 10. Budgeting Control Technique [5L] Concepts of Budget. Management of Working Capital [7L] Various concepts.Kulkarni & Satyaprasad. Functions. Financial Decision. Financial Planning and Capitalization. Volume graph profit. Chand 9. Cash flow determination.Scheifler & J. Limitations. Discounting Cash flow method. New Age Publication. Cost centers.Xavier C. S.Computer Science & Engineering Syllabus 8. R. PHI.Investment Criterion. Financing and importance of working capital. double entry bookkeeping. Volume ratios margin of Safety. The Capital. Capital Budgeting [7L] Nature of Investment decision. J2EE edition. Prasenjit Sinha. PHI. Cost analysis for managerial decisions. Financial Mgmt & Policy. 3. S. Chand & Co. K. Financial Management and Accounting . Classification. budgeting and budgetary control. Controlling other departments by Financial Accounting (A practical Approach). Objectives.Kaplan & Atkinson.definitions. Java Server Programming. I.R. Gettys.. Cost . Financial Mgmt Accounting.Profit Analysis [8L] Classification of costs. advantages. Financial Mgmt . introduction to Journal Accounting. Advanced Management Accounting . different types of Vouchers. Accounting. types of Accounting. Advantages. Van Horne. Master Budget and Report. different types of transactions related to Financial Accounting. (VOL I and VOL II). objectives.Web Technology & Design . Financial statements. WROX publishers 11. Allocation. Net .Volume . Himalaya 32 . uses. K.P. PE.M. cost of capital. Financial Mgmt. Books: 1. Objectives. OUP 9. Gupta. Fundamentals of Financial Management .Godbole A. S. Assumptions. capital budgeting methods. different costing systems.Even analysis. Sharma & Shashi Kumar Gupta. Management & Accounting: Principles and Practice . Uses. ROR (Rate of Return) Method. apportionment and absorption. Visual Basic Complete. 10. Mcmenamin. Financial Mgmt. important definitions. determining the Break-Even point profit. Khan & Jain. TMH. Jain. 4. Elements. Kalyani Publishers. Investment analysis.Van Home. Pandey. preparation of Balance Sheet and Profit and Loss Accounts. 2. 5. Pay-back period.W. Financial Mgmt. Web Technologies . X-Window System. & Kahate A.Pearson 6. Financial Control [7L] Posting of Ledgers and preparation of Trial Balance. Financial Management & Accounts Code: HU 701 Contact: 3L Credits: 3 Allotted Hrs: 45L Introduction [3L] Financial Management. Importance of Capital Budgeting.present value method. changing roles and functions.. 11. The benefit-Cost Ratio method. IRR (Internal Rate of Return) method. Meaning of Linear CVP analysis. Break . Introduction to Accounting [8L] Basic accounting concepts. TMH 8. Budgeting Process .. Vikas 7. limitations.
Module III  Partitioned networks. Module III: 11L 33 . Levels of distribution transparency. NBFR-PIR. Smith Waterman.protein Data Bank (PDB). M. FASTA algorithms to analyze sequence data: Sequence patterns motifs and profiles. Module V  Alternative architecture. Leon. Nucleic acid sequence data bank GenBank. Heterogeneous databases-federated database. Wiley Dreamtech Bio Informatics Code : CS 704B Credits: 3 Module I: 12L Introduction to Genomic data and Data Organization: Sequence Data Banks . Tamerozsu Patrick Valduriez. Management of distributed transactions. Database Management Systems. Query execution and access plan. Sudarshan. Distributed deadlocks.global task management. Constructing an application. Pearson 3. Pair wise alignment -NEEDLEMAN and Wunsch algorithm. Tannenbaum. Principles of Distributed Database Systems. / Global query optimisation. MH 4. Alexender Pachev. Module IV  Distributed data dictionary management. Silberschatz Korth. SWISSPROT. Virus Information System Cell line information system. allocation criteria. structural data banks . MH 2. Client server databases-SQL server.2 phase unit protocols. Distributed database design . AIDS virus sequence data bank. Hibridoma Data Bank Structure. Books: 1. Pearson 3.Computer Science & Engineering Syllabus Elective I Distributed Database Code :CS 704A Credits: 3 Module I  Distributed DBMS features and needs. The Cambridge Structural Database (CSD) : Genome data bank . replication. My SQL :Enterprise Solutions. loosely and tightly coupled. Beginning SQL Server 2000 programming. reference architecture. Database System Concepts. Module II: 12L Introduction to MSDN (Microbial Strain Data Network): Numerical Coding Systems of Microbes. Architectural aspects. open database connectivity. RRNA data bank. Comparison. Time based and quorum based protocols. Signal peptide data bank. EMBL nucleotide sequence data bank. Dewson. Node and link failure recoveries.fragmentation. Reference architecture.SPD/WROX 6.non-blocking commitment protocols.Metabolic pathway data : Microbial and Cellular Data Banks. Reliability. Checkpoints and cold starts. Distributed Database. Distributed database administration. Development tasks. VIKAS 7. Concurrency control .Ramakrishnan.2 phases locks. Module II  Storage mechanisms. Operation. BLAST. other important Data banks in the area of Biotechnology/life sciences/biodiversity. Database Management Systems. Translation of global queries.Introduction to sequence date banks protein sequence data bank. Sequence analysis: Analysis Tools for Sequence Data Banks.
Multiprocessors. Smith. Processor arrays. Basic parallel programming techniques.Introduction to Parallel Processing .Sashi Kumar.Elements of Parallel Computing. C*. travelling salesman problem. Baxevanis. Hidden-Markov model. PHI 6. Murty CSV.loop splitting. Molecular Modeling & Dynamics. Jordan. 2. D. FLYNN’s taxonomy. Processor organizations. 3. self and indirect scheduling. Drug Designing. OCCAM. spin locks. Chao-Fasman algorithm. Module II  Processes and processors. Parallel programming under Unix. effective use of cache. Pearson Education Developing Bioinformatics Computer Skills. Quinn. numerical integration. prediction algorithms.W. 5. Springer India Beginning Perl for Bio-informatics.Sequent C. Tisdall. 8. Discrete event time simulation. Multicomputers.D. Module III  Variations in splitting. Wilkinson. Quellette. Fold libraries. 6. Advanced topics: Protein folding. PRAM algorithms. mean squared deviation. Hwang. Atwood. Himalaya Parallel Programming Code: CS 704C Credits : 3 Module I  Introduction : Computational demands on modern science. Books: 1.Computer Science & Engineering Syllabus Secondary Structure predictions. Backward dependency. Module IV  Parallel programming examples: Average. parallel processing terminology. Data dependency-forward and backward block scheduling. Lesk. A. Academic Press. TMH 34 . Shared memory. Tertiary Structure predictions. Neural Networking. OUP Introduction to Bioinformatics. sorting. Matrix multiplication.. John Wiely & Sons.PHI 5. Hidden-Markov model. contention barriers and row conditions. prediction algorithms. SPD Biocomputing: Informatics and Genome Project.Linda. Join constructs.PHI 3.C. Parallel Programming Languages :Fortran 90.Fundamentals of Parallel Processing.. Rajaraman. Books: 1. Neural Networking. curve fitting. 7. Cynthia Gibas and Per Jambeck. Protein structure predictions : Comparative modeling (Homology). 1994. Fork.Parallel Programming. 2001 SPD Statistical Methods in Bioinformatics. NY Bioinformatics: A practical Guide to the Analysis of Genes and Proteins. Protein structure prediction: Fold recognition (threading). PRAM model of parallel computation.Parallel Computing. Linear recurrence relations.. advent of practical parallel processing. reducing the number of processors.F.TMH 2. Pearson 4. 4. Bioinfornmatics. Advanced Computer Architecture. PRAM algorithms : model of serial computation. Gaussian elimination. Chao-Fasman algorithm.F. Module IV: 10L Applications in Biotechnology: Protein classifications. Performance tuning overhead with number of processes. B. Introduction to Bio Informatics. Protein-ligand interactions.
Overview of different classical synchronization problems. Types.Basic concepts of Distributed deadlock detection. RISC & data flow  Introduction. Queing Theory.Basic concepts of Distributed Mutual Exclusion . Issues in Distributed operating systems. Deadlock handling strategies. Chandy-Lampert’s global state recording algorithm. Deitel. Naming.Computer Science & Engineering Syllabus Advanced Operating System Code: CS 704D Credits: 3 Process Synchronization  Concepts of processes. RISC. Analytic Modeling  Introductions. 3) Advanced Concepts in operating Systems . TMH Computational Geometry Code : CS 704E Credits: 3 Module I  Introduction • historical perspective • algorithmic background • geometric preliminaries • initial forays Convex hulls • problem statement and lower bounds • convex hull algorithms • convex hulls in >2 dimensions • extensions and applications • 35 . Cryptography. Protections & access control Formal models of protection.H. Bottlenecks & Saturation. Distributed File system. Multiprocessor Synchronization. Basic concepts of Distrubuted Scheduling. Multiprocessor Interconnections. Limitations of Distributed Systems. Books: 1) Operating Systems Concepts & design . Introduction to parallel programming. Necessity. Load sharing Distributed OS Implementation  Models. Monitors. Shivaratri. Communicating Sequential processes(CSP) Process deadlocks  Introduction. Pearsons . Models of deadlock Distributed operating system  Architectures. Design & Implementation Issue.Milan Milenkovic. Penetration attempts. Remote Procedure Calls. Design issues. Markov Process Security & Protection  Security-threats & goals. Multiprocessor System  Motivation. Feedback loops. Concurrent processes. Coprocessors. Techniques. Measures. Process migration. Classification. causes of deadlocks. worms & viruses. Lamport’s logical clock.Lamport’s Algorithm.M. Ricart -Agrawala Algorithm. Threads. Architecture. Multiprocessor OS functions & requirements. Global states. Coprocessors. Performance. Security Policies & mechanisms. Authentication. Load balancing. TMH 2) Operating System .Mukesh Singhal and Niranjan G. SUN Network File system Basic concepts of Distributed shared memory.
M/M/m. M/Er/1. Monte Carlo method. Steady-state queueing systems of types M/M/1. Simulation time. simulation. Computational Geometry-algorithms & applications. control of time advancement. 2. M/M/? . Event driven simulation algorithm. Classification of tasks solved within the modeling and simulation process. Precision. Pseudo-random generators. Description of discrete-event systems behaviour. Random numbers in simulation. Simulation project life cycle. model. storages. service facilities. Er/M/1 and their variants. Entities: queues. Kendall classification of queueing systems.Springer India Modeling & Simulation Code: CS 704F Credits: 3 Module I  The notion of system. Birth -Death processes. Simulation experiment. Detailed example: implementation of the database server as a queuing system. Module II  Testing of pseudo-random generators. Modeling of time. Verification and validation of models. Description of simulation models. Computational Geometry. Laszlo. activity. Detailed example introduction: database server as a typical queuing system. Properties of input and output stream. process and their interdependencies. event list. behaviour models. Object-oriented model design. PHI M. event. Queueing systems. Types of simulations. Conceptual and computer models. Illustrative examples. 36 . Entity behaviour and statistical data sampling during the simulation run.Computer Science & Engineering Syllabus Module II  Polygon approximation • triangular approximations • k-gonal approximations • restricted approximations • other criteria of approximation Geometric searching • point-location problems • range-searching problems • Module III  Proximity • Typical problems and lower bounds • Closest pair problem • Voronoi diagrams • Minimum spanning trees • Triangulations Miscellaneous problems • (More) Art gallery problems • Intersections • Pattern recognition • Parallel computational geometry Books: 1. Multiplicative and additive congruential method. Structure vs. Random variables with discrete and continuous probability distribution. The notion of status.de Berg. Nonuniform random numbers. Discrete and continuous Markov model.
Arithmetic/Logic Operations. behaviour.Image Acquisition.Basic Transformation (Translation. Kelton. 5. G/M/m. Englewood Cliffs. Models of components. Implementation of concurrent statements and processes in VHDL. Mean Filter.Hoover. Elements of Digital Image Processing . Addison . Mathematical Preliminaries [7L] Neighbour of pixels.F. SOL. Fundamental steps in Image Processing. Acceleration of simulation run. High pass filtering. Monte Carlo Simulation & Ques. GPSS. A. Malabar. Simulation languages of HDL type.: Simulation: a Problem-Solving Approach. Distance Measures. Display. Frequency Domain Method. Application in a simulation system. Flow of simulation time.V.Computer Science & Engineering Syllabus Module III  Module IV  Case study and comparison: Simula 67. Histograms.1976. Scaling.M. Basmadjian. High-boost Filtering. Springer Verlag 4. ISBN 0-07-100803-9. Image Enhancement [8L] Spatial Domain Method. Equivalence & Transitive Closure. Sampling & Quantization . Processing. McGraw-Hill. Vikas Image Processing Code: CS 704G Credits :3 Introduction [5L] Background. Wiley & Sons. Connectivity. 1975. Vol. 1990. Abstractions levels of digital system description. Simulation experiments. Simulation of digital systems. VHDL language and tools. High-pass Filtering. Communication.D. Time dependency of statistics.S. 1985. Textbooks: 1. Structure vs.I. Low-pass Filtering. Discrete Cosine & Sine Transform.: Theory of Modeling and Simulation.P. Smoothing . New York. Digital Image Representation. Statistical data collected during the simulation run. OUP 3. Digital systems simulators .: Simulation Model Design and Execution: Building Digital Worlds. Perspective Projection.. 2-nd edition. Persistence of objects in C++. Prentice Hall.. Relations. ISBN 0-201-16880-4. G/M/1.P.Zeigler. G/G/1. Geometric Model. G/D/1. London. With Gibbs Field . 8. Perry. Models of delays. Register-transfer level simulation. Brewmaud. Preparation and pre-processing of input data. M+D/D/1. John Wiley. Contrast Enhancement -Linear & Nonlinear Stretching.Kleinrock. First Course in Mathematical Modeling. 37 . Enhancement in the frequency domain Low pass filtering. Closed systems and queueing networks. Mathematical Modeling of Physical Systems. Case study and comparison: Simscript. Properties of The Two Dimensional Fourier Transform. Models M/G/1. Giordano.1995. Homomorphic Filtering. Image Sharpening.: Simulation Modeling and Analysis.: Queuing Systems Vol.Uniform & Non uniform. case studies.Image Averaging.Law. 6.. Object oriented design and implementation of simulation models. 7. Markov Chains.A. Rotation). Histogram Processing. Synchronous and asynchronous algorithm of digital systems simulation. Derivative Filtering.II. Digital Image Formation [6L] A Simple Image Model. Model validation and verification. Modeling of time and event list. New York. Storage. 2.Wesley. L.methods of implementation. W.Fishwick.B. Models of signals and functions. Discrete Fourier Transform. Re-published Krieger Publ. 1991. Evaluation and interpretation of results. Simulation languages for discrete-event systems. Fourier Transformation.R.
Digital Image Processing. Simple Global Thresholding. Algebraic Approach to Restoration . Human Operator in Engineering projects and industries. Yeung K.Lo C. Features & Functions. 7. GIS & Cartography. Restoration by Homomorphic Filtering. Constrained Least Square Restoration.PHI 4. Conflicts between business demands and professional ideals. Artificial Intelligence Lab CS-792 Programming Languages such as PROLOG & LISP Visual Programming and Web Technology Lab CS-793 Problems pertaining to CS-703 Values & Ethics in profession Code: HU 801 Contact: 3L Credits: 3 Allotted Hrs: 39L Science. Technology and Engineering as Knowledge and as Social and Professional Activities [2L Effects of Technological Growth: [15L Rapid Technological growth and depletion of resources. Region Growing by Pixel Aggregation.Computer Science & Engineering Syllabus Image Restoration [7L] Degradation Model. Problems of man machine interaction. Digital Image Processing. Region Oriented Segmentation .Chanda & Majumder. Books: 1. Region Splitting & Merging. Edge detection. Problems of Technology transfer. Codes of professional ethics. 38 .Clarke Keith. authorization versus democratic control of technology. GIS as an Information System. Springer India 3. Geometric Transformation . Environmental Ethics. Politics and technology.Image Processing. Environmental degradation and pollution. PHI 5.P. Gray Level Interpolation.Basic Formulation.Foundation. Impact of assembly line and automation. safety regulations safety engineering. Gonzalves. Line Detection. Edge Linking & Boundary Detection . Case studies. Jahne. Analysis & Machine Vision. Sonka. Industrial hazards and safety. Concepts & Techniques of GIS . Optimal Thresholding. Global Processing via The Hough Transform. Combined detection. Technology and developing nations. Appropriate Technology Movement of Schumacher: later developments. Jain. Technology assessment/ impact analysis.Local Processing. Reports of the Club of Rome. Renewable Energy Resources. An Overview of GIS [5L] Definition of GIS. Social and ethical Responsibilities of Technologists. Whistle blowing and beyond. Thresholding . Discrete Formulation. Image Segmentation [7L] Point Detection.W.Fundamentals of Digital Image Processing.Unconstrained & Constrained. Environmental Regulations. Getting Started with GIS. Historical development of GIS.Spatial Transformation. Human centred Technology Ethics of Profession: [8L Engineering profession: Ethical issues in engineering practice.PHI. VIKAS 6. Eco-friendly Technologies. C. sustainable development. GIS data feeds. Limits to growth.Pearson 2. Albert. PE. Energy Crisis.Digital Image Processing & Analysis.
Performance appraisal. 4. Societal values: The modern search for a ‘good’ society. Herzberg. professional ethics. Difference between Selling and Marketing.C. Phillip Kotler. Project). Productivity: Concept. Nature of values: Value Spectrum of a ‘good’ life Psychological values: Integrated personality. Functions of Production Management. rule of law. Stereotyping. clarity Moral and ethical values: Nature of moral judgments. Different Inputs and Productivity Measures.Business Ethics. EPH Industrial Relations. benefits. 2. Shortcuts for judging people. Criticism. 6. & Indian Ethos. Administrative Theory. Industrial Management. Quality Circles. simplicity.Indian Ethos & Mgmt. Robbins. Effeciency and Effectiveness. N. Productions Management: [5L Concept. 5. BCG Matrix.Wilson model. 3.EPH 4. Control Charts. Velasquez. ethics of responsibility. Books: 1.Ethics. Dr. Prentice Hall/Pearson Education.Raja. Marketing Environment: Mega Environment.P. ethics of duty. process. Factors influencing perception. Barriers to effective communication. Ethics of virtue. Vol. Internal Environment. S. model without shortage . Six Sigma. Collective Bargaining Organizational Behaviour: [8L Different Schools of Management Thought : Scientific Management. Chary. VIKAS 3. Perception: Process. Aesthetic values: Perception and enjoyment of beauty. canons of ethics. democracy. Micro Environment. Difference from Operations Management. values in Indian Constitution.Halo effect.1 L. Simple Marketing Strategies: SWOT Analysis. Projection. Batch. Human Relations Theory(Elton Mayo).TMH [8L [6L 39 . FSN analysis Books: 1. Guidelines to make communication effective. ) Communication: Purpose. Joseph Monks. Materials Management: [6L Concept.Ethics & Mgmt. Quality Management: Concept. secularism. Cost of Quality.Pherwani.Sinha. Pearson Education Asia Organizational Behaviour. Types of Production( Mass. Functions. Elements of Marketing Mix.. mental health.Blending the best of the East & West. Acceptance Sampling (single). Industry Matrix. Balachandran. Productions and Operations Management. Shroff Publishers 5. Motivation: Concept. New Quality Tools: Kaizen. Selective Inventory Control—ABC. Jhamb. TMH Marketing Management. Relevant Environment. model with shortage. Marketing Management: [6L Basic Concepts of Marketing. EXCEL 2. Work ethics. Pearson Industrial Management Code: HU 802 Contact: 3L Credits: 3 Allotted Hrs: 39L Human Resource Management: Recruitment and selection. Theory of Bureaucracy.Business Ethics: concept and cases. Dimensions for goods and services. Industrial Relations. Measures to increase Productivity. Trade Union. Total Quality Management: Concept. Trade Unions & Labour Legislation . justice. Statistical Quality Control. ERG. Ghosh. model with quantity discount. Prentice Hall Productions and Operations Management. Subir Chowdhury. EOQ Models. Different Theories (Maslow. Importance.the 4 P’s. VED.Nair. S.Computer Science & Engineering Syllabus Profession and Human Values [14L Value Crisis in contemporary society.
4.A. ANN architecture.M.Alberto Elefes-Autonomous Mobile Robots Control. Back Propagation Algorithm. [6L] Robot sensing-Range & Proximity & Higher-Level vision.Straugard-Robotics & AI. Fuzzy Equations. Operations on Fuzzy Sets: Compliment. Klir & B.D Alembert Equations of Motion.manipulations-trajectory planning. Lattice of Fuzzy Numbers. 40 .C.IEEE Computer Society Press Soft Computing Code: CS 801B Contact: 3L Credits: 3 Allotted Hrs: 39 L Introduction to artificial neural network [10L Neural Networks: History. Fuzzy rule generation. S. Ant colony based optimisation.Evolutionary programming(EP). Applications. Goldberg. Haykin. overview of biological Neuro-system. Linguistic Variables. Mizutani. Associative Memories. Training rules..Sensing. PHI.analysis of selection algorithms. Classical and Fuzzy Sets: Overview of Classical Sets.Fuzzy Logic: Classical Logic. 1999. Sun. Delta. Mathematical Models of Neurons. Fuzzy Arithmetic: Fuzzy Numbers. “Neuro-Fuzzy and Soft computing”.convergence. Anderson J. Yuan.Computer Science & Engineering Syllabus ELECTIVE II Robotic Control Code: CS 801A Contact: 3L Credits: 3 Allotted Hrs: 39L Robot Anatomy Arm Geometry-Direct & Inverse Kinematics Problem. etc. Synthesis of elements with movalulity constraints. CSG Lee-Robotics Control. Pearson “Neural networks: a comprehensive foundation”. Jang. Andrew C.R. Competitive learning networks. Aggregation Operations. 2.Selecting. Segmentation Recognition & Interpretation. Genetic algorithms(Gas).crossover. The boltzman machine.Planning & Achitecture.N.J. ANN training Algorithmsperceptions. Fuzzy Logic [12L Fuzzy Logic: Introduction to Fuzzy Logic. Hopfield Networks.PHI 4. [15L] Control of Robot Manipulation-computed torque technique sequencing & adaptive control.joint interpolated trajectories. G. resolved motion control Moluie Robots. M. Pearson “Fuzzy Sets & Fuzzy Logic”. PHI.S Fu R. Pearson “Genetic Algorithms”. Membership Function.N. Unions. Intersections.Arm Dynamics.Imaging Geometry. Arithmetic Operations on Intervals & Numbers.mutation.schema analysis. [10L] References: 1. Multilayer Perceptron Model. Nagel.Weins. 2. K.McGraw-Hill. illumination techniques. Text: 1. 3.P. [10L] Other Soft computing approaches [7L Simulated Annealing.Markov & other stochastic models. Combinations of Operations.Robot intelligence-State Space search. Kohonen self organizing networks. Unsupervised and reinforcement Learning. Tabu Search.Genetic Programming(GP). “An Introduction to Neural Networks”.C .Evolution strategies(Ess). Reference: 1. Groover. Learning rules. Learning Paradigms-Supervised. Hebbian learning. Sitharama Iyengar. Vision & Intelligence.Knowledge Engineering. [8L] Robot Programming Language Characteristics of Robot Level & Task Level languages.Robot Task Planning. Robot learning. Applications of Artificial Neural Networks.McGraw Hill 3. Odrey –Industrial Robotics.
Memory-Latches and Registers. Twin tub process. Ifeachor. J. “Introduction to the Theory of Neural Computation”. convergence and ROC. “Digital Signal Processing”. The Silicon Gate Process. Addison Wesley. TMH Reference: 1. basic properties. R.Mitra. Fast Fourier transform (FFT). PHI 5. CMOS Logic. Inverse Z-transform. butterflies. Palmer. Scitech 5. & D. Digital Signal Processing . structures of All-zero filters. Radix 2 algorithm. Pearson 3. Rabiner & B. Ingle. multiplication of DFT. Mass. MATLAB examples . inverse discrete Fourier transform (IDFT) Twiddle factor. 5. “Theory and Application of Digital Signal Processing”. Digital Signal Processing using MATLAB. Principles. (1992). Optimisation method of IIR filters. Chebyshev. Digital Signal Processing with FPGA. Jaico VLSI Design Code: CS 801D Contact: 3L Credits: 3 Note: Trace on Basic concepts only Allotted Hrs: 39L Introduction to CMOS circuits: MOS Transistors.Gold. linear transformation. overlap add and save method. Chirp z-transform algorithm. TMH 6.K. basic n-well CMOS process. relation between Z transform and Fourier transform of a sequence.Basic CMOS Technology. Spriger India 3. wafer processing. “Digital Signal Processing. OUP 2. Vikas 4. [4L] Review of :Mathematical operations on sequences: Convolution. overlap and add methods. linear filtering using DFT. 1998. stability. Silicon on insulator. epitaxy deposition. G. Difference equation. Multiplexers. Sequences. NAND gate. Computer aided filter design. R. “Neural Networks-A Comprehensive Foundations”. Hamming and Blackman. properties of Z transform. [6L] Processing Technology: Silicon Semiconductor Technology. Design of infinite impulse response filters (IIR) from analog filters. Chen. Hanning. Combinational Logic. matrix method. linear time invariant system. “Digital Signal Processing”. Xavier. Unit circle. S. New Jersey. Digital Signal Processing Code: CS 801C Contact: 3L Credits: 3 Allotted Hrs: 39L Introduction. S.G. Proakis & D. Freeman J. arbitrary sequences. Manolakis. 41 . Melanie Mitchell. 3. mapping between S-plane and Z-plane. Decimation-in-time and decimation-in. windows-rectangular. “Neural Networks: Algorithms. [12L Digital filter realization: Principle of digital filter realization. Algorithms and Applications”. Design of FIR (Finite impulse response) filters. circular convolution. Pradhan. Digital Signal Processing. MOS transistor switches. graphical and analytical techniques. California.G. “An Introduction to Genetic Algorithm”. Digital Signal Processing Applications.A. 4. signal flow graph.M.A Computer based approach. Krogh. recursive and non-recursive system. Reading. Skapura.Computer Science & Engineering Syllabus 2. Computation of DFT. some examples and solutions of LTI systems. Hertz J. causality. Butterworth.G. 1999. Berlitt. S.R. PHI. Ion-implantation and diffusion. Compound Gates. linear phase. Classifications of sequence. [2L] Z-transform: Definition. solution of difference equation using the one sided Z-transform MATLAB examples. The inverter. relation between continuous and discrete system. [12L Text: 1. Prentice-Hall International. MATLAB examples. Lyons. Meyer-Basse U. p-well CMOS process. Babu R. Chand 7. Elliptic filters. NOT Gate. oxidation. Digital Signal Processing. Salivahanan et al. Digital Signal Processing . Pearson 2. CMOS process enhancement-Interconnect. MATLAB examples. 1991.frequency algorithm. Overview of digital signal processing [2L Review of :Discrete – Time linear system. “Understanding Digital Signal Processing”. Addison-Wesley. Bilinear transformation. Some example of practical filter design. FFT algorithm. [7L Discrete Fourier transform: Definition. filtering of long data sequences. Applications and Programming Techniques”. L.An Overview. PHI 4.
Technologies : Relationship Between E – Commerce & Networking. Rules & Regulations For Controlling E – Commerce. Collaborative Computing. Authoring Tools & Content Management. Definitions. Infrastructure Requirement For E – Commerce . [ 3 L ] [5L] [ [ [ [ [ [ 42 . “CMOS Digital Integrated Circuit”. Strategic Methods for developing E – commerce. Convergence : Technological Advances in Convergence – Types. TMH 3. Customer Premises Equipment (CPE). “CMOS Circuit Design. Advantages & Disadvantages of E – Commerce.Sherwani.Computer Science & Engineering Syllabus circuit elements.”Modern VLSI Design” Wayne Wolf.M. Chandrasan. 3-D CMOS. PHI 4. [5L] Overview of VHDL Text Book: 1. PHI References: 1. Convergence & Electronic Commerce. Electronic Commerce : Overview. total power dissipation.E. Design Methods: Behavioural Synthesis. [2 L ] 4.Power Dissipation: Static dissipation. Routing: Segmented channel routing – maze routing – routability and routing resources – net delays. E – Governance. Layout Design Rule: Layer Representations. D. “Modern VLSI Design: system on silicon” Wayne Wolf. Convergence and its implications. Pearson 2.Baker.Kang & Y. J. Internet’s effect on Supply Chain Power. Programmable interconnect. RTL synthesis [8L] Placement: placement: Mincut based placement – Iterative improvement placement simulated annealing. Threats of E – Commerce.Lee. Model Based On Transaction Party . Programmable Logic structure. contract as per CAD. Content – partnership. convergence. Boyee.M. PHI E – Commerce & ERP Code: CS801E CONTACTS: 3L CREDITS: 3 1. Strength & Weaknesses of Call Center. Kluwer 5. [6 L] 7. [2 L ] 5. CMOS n-well Rules. and Reprogramable Gate Array: Xilinx Programmable Gate Array. Bhaskar. short-circuit dissipation. Content Management & Call Center ). Mode of Operation. Layout & Simulation”. SCE . Verification: logic simulation design validation – timing verification – Testing concepts: failures – mechanisms and faults – fault coverage – ATPG methods – types of tests – FPGAs – programmability failures – design for testability.J. “ Digital Integrated Circuits” Demassa & Ciccone.W. Cyber Laws. B2C. Need. Pucknell & Kamran Eshranghian. Internet. Supply Chain Portal. Web Traffic & Traffic Management . Content Management : Definition of content. [5 L] 3. Collaborative Computing : Collaborative product development. Supply Chain Planning Tools (SCP Tools). Simultaneous Collaboration. Security. Call Center : Definition.B2B. Business Models of e – commerce : Model Based On Transaction Type. Design Rule of background scribe line. C2B.Leblebici. Four C’s : ( Convergence. Equipment . Hand Held Devices. Programmable Logic. Tasks Handled. Intranet & Extranet.“Digital Integrated Circuit”. S. Nicolic. EDI Systems Wireless Application Protocol : Definition.Rabaey. providers. Supply Chain Management : E – logistics. Mobile Computing. Pearson 4. H.”VHDL”. repositories.“Algorithm for VLSI Design & Automation”.Framework. “Basic VLSI Design” Douglas A. Different Types of Networking For E – Commerce. E – strategy : Overview. Web Security. Layer Assignment. [3 L] 2. C2C. Addison Wesley Longman Publisher 3. [5L] Verification and Testing: Verification Versus Testing. N. R. Mobility & Commerce. SOI Rule [10L] . 2. Content Marketing. Wireless Web. Dynamic dissipation. Supply Chain Execution (SCE). Managerial Prospective. Willey Pub.
Error rate estimation. ERP and E-Commerce. E – Cash. Materials Management. Resampling methods. E – Payment Threats & Protections. Regularization. ERP and Internet. SAP AG. Comparing classifiers. Beginning E-Commerce. Loshin Pete. Sample error and true error. Data Encryption (DES / RSA). Model selection. Introduction (4L) 2. Business Modules: Finance. BAAN. regression and discriminant analysis. Flexible metrics.M. Christopher & T. Manufacturing (Production). Bayes Decision Theory (7L) 3. Bias and variance.A. Confidence intervals. Murphy P. Nonparametric Classification (4L) 43 . E-Commerce Mgmt. Oracle Corporation ERP-Present and Future: Enterprise Application Integration (EAI). University Press 8. General framework. [ [ 11. E-Marketing. E-Commerce. Shrinkage. The sub-problems of pattern recognition. 3. Whinston : Frontiers of Electronic Commerce . Tele-marketing [ 1L ] Electronic Data Interchange (EDI) : Meaning. Empirical error criteria. Human Resources. Password Systems. 10. Nearest neighbor methods. Benefits. Security Standards. Kernel approaches. Automatic kernels methods 1. Basic statistical issues.K. Vikas [ 9. capabilities and Overview of Commercial Software. Digital signatures.Parametric Approaches (4L) 4. Krishnamurthy. Key Management. Optimal decisions.Technologies & Applications. Error Correcting Codes. Reynolds. Murthy : E – Commerce . Jaico Publishing Housing. 12. PeopleSoft.M. Bhaskar Bharat : Electronic Commerce . Business Process Redesign. Concepts. Optimization methods. Knowledge engineering and data warehouse . EDI Model.Computer Science & Engineering Syllabus 8. Comparing classifiers Histograms rules. Application. J. Failure of MLE. Pearson Education. Tata McGraw Hill. Classification. JD Edwards. Error Assessment (4L) 6. SPD 9. Cryptography. Protocols (UN EDI FACT / GTDI. QualityManagement. E – Commerce : Strategy Technologies & Applications. Global E-Commerce. The basic structure of a pattern recognition system. Generalized linear classifiers. 7. ANSI X – 12). Three learning paradigms. [2 L ] Risk of E – Commerce : Overview. Local polynomial fitting.H. [ [ Pattern Recognition Code: CS 801F Contact: 3L Credits: 3 Allotted Hrs: 39L Topic Syllabus Examples. Sales&Distribution ERPPackage. E – Payment Mechanism : Payment through card system. Learning .TMH 4. Oka. Minimum description length. Plant Maintenance. EPH 2. Digital certificates. Firewall. The nature of statistical pattern recognition. re-engineering work processes for IT applications. Parametric Discriminant Functions (4L) 5. 6. Perceptrons. Linear and quadratic discriminants. [ 1 L ] E – Marketing :. E – Cheque. Sources of classification error. [4 L ] Enterprise Resource Planning (ERP) : Features. Maximum Margin. Simple performance bounds. : Electronic Commerce . Clerk. ERP Market: ERP Market Place. Home –shopping. Logistic classification. Three approaches to classification: density estimation. Kalakotia. Himalaya Publishing. Future Directions in ERP  Reference : 1. 5. Security for E – Commerce.
Pearson . 2. Reference : 1.Special Characteristics of real time systems. “Guide to Designing and Implementing wireless LANs”. Wireless Enterprise Networks: Introduction to Virtual Networks. Pervasive web application architecture. 3. Raj Pandya. 2001. wireless mark up Languages (WML). Thomson learning. Schiller. 4. 3. 4.Embedded Real Time Systems. “Pervasive Computing”. Mobile IP. Advanced algorithms based on the notions of margins and kernels Speech and speaker recognition. Mobility management.11 standard. “Third Generation Mobile Telecommunication systems”. case studies of the IRIDIUM and GLOBALSTAR systems. Sandeep Singhal. Margins and Kernel Based Algorithms (3L) 9. 2001 “Mobile and Personal Communication systems and services”. by P. GPRS Network Nodes.Stavronlakis. Network signalling. “Wireless Web Development”. Vikas Publishing House. Ray Rischpater. Networks signalling. Optimal linear transformations. Prentice Hall of India. Device independent example application [8L Text : 1. Unsupervised learning and clustering. Yi-Bing Lin & Imrich Chlamtac. Wideband Code Division Multiple Access (W-CDMA). 2. [7L Server-side programming in Java. Blue tooth technology. Mark Ciampa. Wireless Local Loop(WLL): Introduction to WLL Architecture. Syntactic pattern recognition. and CDMA 2000. J. John Wiley & Sons. Scene analysis. Real Time & Embedded System Code: CS 802B Contact: 3L Credits: 3 Allotted Hrs: 39L Introduction-defining Real time systems. Quality of services in 3G. “The Wireless Application Protocol”. Feature subset selection. Global System for Mobile Communication (GSM) system overview: GSM Architecture. Springer Publishers.Computer Science & Engineering Syllabus Optimal features. Pearson “Wireless and Mobile Networks Architectures”. Burkhardt. Mobile Data Communication: WLANs (Wireless LANs) IEEE 802. Fuzzy set Theoretic approach to PR.a brief evolutionary history. Mobility management. 7. Applications of PR (3L) Mobile Computing Code: CS 802A Contact: 3L Credits: 3 Allotted Hrs: 45L Introduction to Personal Communications Services (PCS): PCS Architecture. 2001. Feature Extraction and classification stages. WAP Gateway and Protocols. wireless Local Loop Technologies. Blue tooth Protocols. [7L Third Generation (3G) Mobile Services: Introduction to International Mobile Telecommunications 2000 (IMT 2000) vision. Linear and nonlinear principal components. Pearson “Mobile Communication”. Springer Publishing. Character recognition. [7L Global Mobile Satellite Systems. [5L Wireless Application Protocol (WAP): The Mobile Internet standard. [5L General Packet Radio Services (GPRS): GPRS Architecture. Feature Extraction (6L) 8. 44 .
Map Projections and Coordinate Systems [4L Maps and their characteristics (selection. desktop GIS. Daniel W.pseudo parallelism). data quality. [4L] System Development Methodologies.”Embedded System Computer Architecture” Graham Wilson. plotters and media. Shaw . Iyer and P. pilot projects. Pearson References: 45 . Data Input . contributing and allied disciplines. A. GIS data feeds. S. online and CD-ROM distribution. “Embedded System Design” Steve Heath. Remote sensing of water. Making Maps [6L Parts of a map. why GIS is important. historical development of GIS. Object-oriented concepts and GIS.). Addison-Wesley Pub 2.real time extensions of DFD[10L] Real time languages: overview of ADA/Java Extension [4L] Real time Operating Systems . privacy. 3.M. data management. embedded GIS. P. future software. precision and error. how GIS is applied. producing a map formats. relational database systems. 2. “Embedded System Design” Frank Vahid & Tony Givargis. Future data. vector analysis including topological overlay. etc. Database concepts and components. GIS & Remote Sensing Code: CS 802C Contact: 3L Credits: 3 Allotted Hrs: 39L Introduction and Overview of Geographic Information Systems [3L Definition of a GIS. education. selecting a GIS package. requirements.the implementation model. future hardware. user interfaces. data formats. map functions in GIS. databases and GIS. metadata. “An Embedded System Primer” David E. Butterworth-Heinemann Pub. urban landscape Text: 1. databases. case studies. interactive maps and the Web. “Real – Time Systems and software”Alan C. Mcdonnel. Thermal infrared remote sensing. GPS. Data Sources. case studies. Spatial Analysis [3L Questions a GIS can answer. 4. coordinate systems. raster analysis. costs and benefits. views of the database. J. Oxford. images. Jensen. Principle. R. Remote sensing of Vegetation. [12L] Software architectures(concepts of interrupt driven activation. 2. scale. John Wiley & Sons Inc “Fundamentals of embedded Software”. statistics. Burrough and R. professional GIS packages. Liu. Remote Sensing [8L Remote sensing of environment. J.the essential model step. Data Quality and Database Concepts [3L Major data feeds to GIS and their characteristics: maps. flat files.Computer Science & Engineering Syllabus Hardware Architectures of Real Time systems. GIS and Maps. Butterworth-Heinemann. map design and map elements. personnel and skill sets. data modeling. choosing a map type. locating and evaluating data. GIS as an Information System. GIS application areas and user segments. GIS and cartography. creating custom GIS software applications. TMH References: 1. Gupta. Implementing a GIS [4L Planning a GIS.[5L] Overview of WARD & MELLOR Methodology: Ward & Mellor Life Cycle. E.need for real time monitor. S. Pearson “Embedded Realtime System Programming”. Technology & Instruments involved in GIS & Remote Sensing [8L] GIS applications. features and functions. V. A. Simon. public domain and lowcost packages. Pearson “Real time Systems”. future issues – data ownership. “Remote sensing of the environment” . “Principles of geographical information systems”. GIS analytical functions. Inc. [4L] Text : 1. 3. commercial data. 5.meeting of dead lines & real time constraints. W. integrated spatial analysis. map projections. abstraction. GIS career options and how to pursue them. automated cartography versus GIS. normalization. Lewis. John Wiley & sons.
3. Digital Signatures. Gene Spafford. [4L] JSP: Introduction. Oreilly 1. “Network Security Essentials: Applications and Standards” by William Stallings. Overview of Secure Socket Layer and Transport Layer Security. Intrusion Techniques. Ian Heywood. JDO & RMI 46 . and Steve Carver. Firewall Configuration Text : 1.. Security Services. 2nd Edition. 2nd Edition. Kerberos Version 4. Different types of enterprise beans . Scripting elements. Drawbacks. Pearson Reference : 1. 4. William Stallings. Public-Key Cryptography Principles. Comparison of EJB & Java Beans . Advantages over CGI. Integration of EJB and JDO. Nicholas Chrismas. Accessing user information by means of Request & Response. J2EE WEB SERVICES. Mechanisms. John Wiley & Sons. Applications. PGP Notation. Merike Kaeo. Password Selection Strategies. Addison-Wesley Longman. MVC Architecture: Explanation. Password Protection. Simson Garfinkel. Model for Network Security Conventional Encryption and Message Confidentiality  Conventional Encryption Principles. Alan Schwartz. Conventional Encryption Algorithms. Kaufman.Services provided by EJB container. JSP tags . Network Security Code: CS 802D Contact: 3L Credits: 3 Allotted Hrs: 39L Introduction  Attacks. Overview of Secure Electronic Transaction Intruders and Viruses  Intruders.Directives. IP Security Architecture. “Network Security private communication in a public world”. Pearson 2. Security Attacks. Authentication Header Web Security  Web Security Threats. Comparison between JSP & servlet. “Cryptography and Network Security”.. Pearson Books “Building Internet Firewalls”. Servlet API (Different interfaces & classes of generic servlet & HTTP servlet).Keith Clarke. Web Traffic Security Approaches. “An Introduction to Geographical Information Systems”. Key Management Network Security Applications  Kerberos Motivation. JNDI: Introduction and applications. 3. Intrusion Detection. JSP implicit objects. 2-tier . Different components & containers. Services. PGP Operational Description IP Security  IP Security Overview. Nature of Viruses. Key Distribution Public Key Cryptography and Message Authentication  Approaches to Message Authentication. RSA. Enterprise architecture styles: Single tier . SHA-1. Comparison between LDAP and JNDI JDO (Java Data Objects): Introduction. Accessing user information using implicit objects. Elizabeth D. D. Different types of JSP architectures and relative comparison. [4L] Servlet: Introduction. n-tier. Sarah Cornelius. 3-tier. 2. Speciner. Brent Chapman. 2. Location of Encryption Devices. Oreilly “Practical Unix & Internet Security”. “Getting Started with Geographic Information Systems”. Need. Advanced Java Programming Code: CS 802E Contact: 3L Credits: 3 Allotted Hrs: 39L Client & server side programming. Antivirus Approaches Firewalls  Firewall Characteristics. Architecture . Drawbacks. 3rd Edition. Architecture/Life cycle. Servlet session management techniques and relative comparison. Relative comparison of the different layers of architectures. MD5. Actions.Computer Science & Engineering Syllabus “Exploring Geographic Information Systems”. Perlman and M. [5L] EJB :Introduction. 2nd Edition. Pearson Education Asia “Designing Network Security”. C. PHI. Types of Firewalls.Use of RMI Registry. Malicious Programs. Types of Viruses. [5L] RMI: Introduction and applications. Simon Cooper. Macro Viruses. How it works?. Zwicky. Servlet life cycle. R.
Word Classes [13L]: Review of Regular Expressions.. dicourse planning (text schemata. SAX parsers. – “Natural Language Understanding”. phonetic transcription.Different approaches to connect an application to a database server. polysemy. dialogue acts and structures 1L Natural Language Generation: Introduction to language generation. algorithm for HMM tagging. robustness 2L Lexical Semantics: Lexemes (homonymy. Written-Bell. meaning structure of language. allophonic. phonological aspects of prosody and speech synthesis.4” Ivor Horton. Manning. “Foundations of Statistical Natural Language Processing”. pronoun resolution algorithm. Bharathi. “Professional JAVA Server Programming”. 2ed. Database driver . JDBC data sources. Prentice Hll India. DOM parsers.Computer Science & Engineering Syllabus JINI :Introduction. application domain. canonical form. [8L] Text : 1. sub-categorization. basics of FOPC 2L Semantic Analysis: Syntax driven. expressiveness. MIT Press. Dom. Pearson Reference Books: 1. Good-Turing). Jurafsky & J. machine learning based and dictionary based approaches. syntactic and semantic constraints on Coreference. 4L Pronunciation. simple N-grams. discourse structure 4L Dialogues: Turns and utterances. optimality theory. counting words in Corpora. Linguistic organisation of NLP. Allamaraju and Buest . Martin – “Speech and Language Processing – An introduction to Language processing. James. JDBC prepared statements.. transformation based tagging 4L Sentence level construction & unification: Noun phrase. architecture. Christopher and Heinrich Schütze. phoneme and phonological rules. detection and elimination using probabilistic models. 3. “Advanced Programming for JAVA 2 Platform” Austin and Pawlan. Combinational Rules 3L Phonology: Speech sounds. 3. MIT Press. 47 . 5L Syntax [7L]: POS Tagging: Tagsets. metaphor and metonymy and their computational approaches 3L Word Sense Disambiguation: Selectional restriction based. 1995. smoothing (Add One. 1993. Pearson Education Reference Books: 1. A. D. N-grams for spelling and pronunciation. Internet & Java Programming by Krishnamoorthy & S. Computational Linguistics. 3L Semantics [9L]: Representing Meaning: Unambiguous representation. Parsers. attachment & integration. decision tree model. machine learning of phonological rules. Document type definition.SPD Publication “Beginning J2EE 1. text coherence. 2. Establishing a database connection and executing SQL statements. CFG and different parsing techniques 1L Morphology: Inflectional. 4. grounding. 1995. SAX vs. Eugene Cherniak: “Statistical Language Learning”. rhetorical relations). concept of HMM tagger. parsing and parsing with FST. Spelling and N-grams: Spelling errors. synonymy. tools for NLP. Natural Language Processing. dialect). XML syntax. 1999. concept of feature structure and unification. H. Benjamin/Cummings. and Speech Recognition”. 2L Pragmatics[8L]: Discourse: Reference resolution and phenomena. derivational. JAXP and JAXB. 3L Text Book: 1. pronunciation variation (lexical. 2. [5L] XML: Java & XML. WordNet. Applications [5L] JDBC: Introduction. NLP vs PLP. Prabhu(New Age Publication) Natural Language Processing: Code: CS 802F Contact: 3L Credits: 3 Allotted Hrs: 39L Introduction to NLP [2L]: Definition. SPD Publication. Vineet Chaitanya and Rajeev Sangal. rule based and stochastic POST.“A Pananian Perspective”. Allen. co-ordination. Eastern Economy Edition. internal structure of words. hyponymy). issues and strategies.
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue listening from where you left off, or restart the preview.