You are on page 1of 82

SYLLABII

OF
B.TECH.
COMPUTER ENGINEERING
2002

B.Tech Computer Engg. 2002

-1-

L
2
1.

T
2/2

B.Tech I/II Semester
(Common to All branches)
Computer Engineering
COT-101
Theory : 75
Sessional: 25
Time :
3 hrs.

Introduction

Overview of a computer system, Block diagram and major parts of a computer, history of computer
development, introduction to binary, octal, & hexadecimal numbers, ASCII code, different levels of
programming languages – machine language, assembly language, high level language; need of
operating system, tree structure of storage, introduction to assembler, compiler and interpreter.
2.

Basics of C Language

C fundamentals; operators and expressions; i/p and o/p statements-getchar, putchar, scanf, printf;
control statements – if-else, while, do-while, for, switch, break, continue, comma operator, goto
statement.
3.

Functions and Arrays

Defining and accessing a function, function prototype, passing arguments to a function; defining and
processing an array, passing an array to functions, 2-d arrays, arrays and strings.
Note for Paper Setter:
There will be 8 questions in all. Students will be asked to attempt any 5 questions. Only 1 question will
be set from unit 1. Minimum 2 questions will be set from unit 2, and 3 questions will be set from unit
3.
BOOKS
1. A. S. Tanenbaum : Structured Computer Organization, PHI. (Unit 1)
2. V. Rajaraman : Fundamentals of Computers, 3rd edition, PHI. (Unit 1)
3. Byron S. Gottfried : Theory and Problems of Programming with C Language, Schaum Series,
TMH, 1998. (Unit 2, 3)
4. Kernighan and Richie : The C programming Language, 2nd Edition, PHI.(Ref. Book)

B.Tech Computer Engg. 2002

-2-

L
-

T
-

P
2/2

B.Tech I/II Semester
Computer Lab
COT-103
Sessional: 10
Practical : 40

1. Understand the concept of operating system and learn related commands
Write C programs for following :
2. Addition, subtraction, multiplication, division of 2 numbers
3. Find max and min of 3 numbers
4. Using while loop, find
S = 1 + 3 + 5 + … upto N
S = x + x2/2 + x3/3 … N terms
Repeat these exercises using do-while loop.
5. Using for loop, calculate
S = x – x3/3! + x5/5! … N terms
6. Using loops, print following design
(a)
1
(b)
*
12
***
123
*****
…N lines
... N lines
7. Read 2 numbers. Read the choice of operation. Add them if + is pressed. Subtract if – is pressed.
Similarly for multiplication(*) and division(/).
8. Repeat exercise 7 such that program gets repeated again and again until user wants to exit.
9. Using function, compute nCm.
10. Using 1-d array, read n numbers and find average. Also find the largest of these numbers. Use
functions to implement these operations.
Write modular programs for the following:
11. Implement following operations on matrices
(a) Addition of two matrices (b) Transpose of a matrix
(c) Multiplication of two matrices

B.Tech Computer Engg. 2002

-3-

Programming Methodology and File Structures
COT-201
L
3

T
1

P
-

Theory:
Sessional:

75
50

1.
Programming Methodology
Introduction to software development – Concept of professional programming and software
development, tools for software design and for algorithm specification; Problem solving – Steps of
developing any program, algorithm construction, patterns of logic; Use of sub-programs, Top-down
decomposition, principles for decomposition, Communication between procedures, iteration vs.
recursion; Program Documentation – Introduction, Documentation for programmers, operators, users,
interactive systems.
2.
Input/Output Devices
Characteristics and working of magnetic tapes, magnetic disks – hard-disk, floppy disk, Winchester
disks; optical disk, magnetic drum, magnetic bubble memory, charge-coupled device; overview of
working of printers – character, line, page printers, scanners, plotters, OMR, MICR and Barcode
Reader, Voice recognition and response devices.
3.
File Systems and Organizations
File organizations, file operations, file systems, file directories, device control, channel and buffer
management, Sequential File Organization – Creating, retrieving and updating sequential files & their
performance; merging – natural, balanced, polyphase, cascade and their performance; relative file
organization – definition, addressing techniques, problem of collision and its solutions, performance;
indexed sequential file organization – definition, application, B+ tree structure, physical layout
indexes, design; multi-key file organization – multi-key access, inverted file organization, multi-list
file organization;
Note: At least 1 question will be set each from Unit 1 and Unit 2 each, and 4 questions will be set
from unit 3.
BOOKS
1. P. Juliff: Program Design, PHI, 2000.
2. M.E. Loomis: Data Management and File Structures, 2nd Ed. PHI. 1997.
3. V. Rajaraman: Fundamentals of Computers, PHI
4. S.K. Chauhan: P.C. Organization,. Kataria & Sons, Delhi, 2001.
5. Alexis Leon and Mathews Leon: Introduction to Computers, Leon Press, Chennai, & Vikas
Publishing House, New Delhi, 2001.

B.Tech Computer Engg. 2002

-4-

header node. Sorting techniques: Selection. Gottfried : Theory and Problems of Programming with C Language. addition multiplication of sparse matrices. Kruse: Data Structures & Program Design in C. passing pointer to functions. Mergesort. Implementations in C language. Patel: Expert Data Structures in C. Knuth: The art of Computer Programming Vol 1. expression evaluation. Galgotia. sparse matrix. 4. inversion. Schaum Series. sequential allocation for stacks and queues. Examples for application of doubly linked lists. 1998. Khanna Publishers. Byron S. Graphs: Representation of graphs and their traverseral. pointer declaration. insertion and deletion. operation on pointers. 3. 5. characters. representation using doubly linked lists. Note: At least 1 question will be set from each of units 1. packed decimal. node structures. Searching and Sorting Techniques Efficiency of algorithms in terms of time and storage requirements. Implementations in C language. Binary tree representation of trees. generalized lists and recursive algorithms for copying and comparison of lists. data types and data object. integers. concatenation & copying of the lists. pointers and 2-d arrays. 2. examples of tree structures. routines for allocation and deallocation. PHI. At least 2 questions will be set from Unit 4 & 5 each. Files and related operations in C. examples for application of stacks. Insertion. Doubly Linked List: Definition of circular and doubly linked list. floating point numbers.Tech Computer Engg. Examples of linked lists. 1999 2. pointers and 1-d arrays.2 and 3. Quicksort and Radix sort 3. 5. Searching techniques: Linear and Binary. representation of array in storage. Advanced Data Structures Trees. Introduction: Introduction: Internal representation. sparse arrays. manipulation transpose. polynomial addition. 1985. allocation for stacks and queues. Sahni: Fundamentals of Data Structures. 4.F.B. D. Implementations in C language. TMH. B. BOOKS 1.L. Binary trees traversal. 2001. some more operations on binary trees. Linked Data Structures Linked Lists. Simple Data Structures Arrays: axiomatic definition of array. 2002 -5- . O-notation. Narosa Publications. address mapping function. Bubble. transformation of trees into binary trees. Basic concepts and definitions of a tree and binary tree and associated terminology.Data Structures COT-203 L 4 T 2 P - Theory: Sessional: 100 50 NOTE:All algorithms may be in algorithmic form and may be implemented in C language. access table method of storage of arrays. 1. comparison of sequential and linked allocation of storage. All implementations in C language. R. dynamic memory allocation. E Horowitz and S. mazing problem. dynamic storage management. R. multiple stacks and queues. Implementations in C language. definition. fundamentals of pointers in C.

M. J. Main Memory allocation & replacement policies.Tech Computer Engg. Information representation and Number format. 3. Introduction Basic Machine Principle. I/O processors & CPU – I/O interaction. Tanenbaum: Computer System Organization. 5. Structure and representation of real world data. 2. Bartee: Digital Computer Fundamental. TMH. Multiprocessor Introduction. Hardware Control design method. PHI.C. 4. subtraction. A. 1999. Multiplier control unit and CPU control unit.Computer Organization and Architecture COT-205 L 4 T 1 P - Theory: Sessional: 100 25 1. Addressing modes. Mano: Computer System Architecture. 5. TMH. Note:. DMA and interrupts. Hayes: Computer Architecture and Organization. Random access and serial access memories. BOOKS 1. Memory organization Memory device characteristic. B. Programmed I/O. pages and file organization. cache and associative memory. S. T. Von-Newman Model and stored program concept. multiplication and division. Processor Design Processor Organization. Microprogrammed computer. System Organization Local and long distance communication. Segments. C.P. Gear: Computer organization and Programming.At least one question will be set from each section. Minimizing Instruction Size. Subroutine. Arithmetic operation. Instruction cycle and Instruction format. timed point addition. 2. 3rd Ed. High speed memories – Interlocked. 3. TMH.W. Microprogrammed Control. M. Pipeline processor and Multiunit processor. Virtual memory – memory hierarchies. Parallel processing – Performance consideration. Branching & Macro facility. 4. 2002 -6- . PHI. ALU design and floating point arithmetic. Control Design Instruction sequencing and Interpretation.

C. Relation of Isomorphism in the set of rings. Commutative Ring. Permutations. Particular Solutions. Minimum Spanning Trees. Ring with Unity.. Uncountably Infinite Sets. Division Ring. Total Solutions. 3. Definition and Examples of Rings and Subrings. McGraw Hill. Partial Ordering Relations. Recurrence Relations. Trees. Generation of Permutations and Combinations. Types of Rings. Rooted Trees. Combination of sets. Path Lengths in Rooted Trees. Algebraic System Definitions and elementary properties of algebraic structures. Ring with or without Zero divisions. Addison Wesley Publishing Co. 1977. Functions and Pigeonhole Principle. Mathematical Induction. Semigroups. Multisets.. 4. Homomorphisms and Isomorphisms of Monoids and Groups. Properties of Binary Relations. Two questions will be set from each section.Y. Sets and Propositions Introduction. Equivalence Relations and Partitions. Paths and Circuits. Elements of Discrete Mathematics 2. 1986. B. monoids and submonoids. Eulerian Paths and Circuits. BOOKS 1. Kenneth Kalmanson: An Introduction to Discrete Mathematics and its Applications. Tremblay: Discrete Mathematical Structures with Applications to Computer Science. Liu. Linear Recurrence Relations with Constant Coefficients. Spanning Trees and Cut-sets. Hamiltonian Paths and Circuits. Propositions. Binary Search Trees. N. Multigraphs and Weighted Graphs. Principle of Inclusion and Exclusion. its characteristics and subfield. Note:.The question-paper will contain 8 questions in all. Field. Permutations. 2. Homogeneous Solutions. 2002 -7- . Shortest Paths in Weighted Graphs. Integral Domain. Solution by the Method of Generating Functions.Discrete Structures COT-207 L 3 T 2 P - Theory: Sessional: 75 50 1. 3. Planar Graphs.L. Basic Terminology.P. J. Graphs and Planar Graphs Introduction. Combinations and Recurrence Relations The Rules of Sum and Product. The student will be required to answer any five.Tech Computer Engg. Finite and Infinite sets. Groups and subgroups. Combinations.

Digital Electronics
COT-209
L
3

T
2

P
-

Theory:
Sessional:

100
50

1.
Number Systems and Codes
Introduction to positional number system, signed magnitude numbers, floating point
numbers, binary arithmetic: addition, subtraction, multiplication and division, Base
conversion, conversion formulas with examples, one’s and two’s compliment arithmetic,
Computer codes – BCD codes, gray codes, excess-3 codes, parity checks, Hamming and
alphanumeric codes.
2.
Digital Logic Families
Qualitative introduction to digital ICs, TTL, Schottky TTL, ECL, MOS Logic, CMOS
Logic, Tri-state logic: Characteristics and properties.
3.
Combinational Logic Design
Introduction, standard representations for logical functions, Karnaugh map
representation, simplification of logical functions using K-map, minimization of logical
functions specified in minterms/maxterms or Truth Table, minimization of logical
functions not specified in minterms/maxterms, Don’t care conditions, design examples,
Ex-or and Ex-nor simplification of K-maps, five and six-variable K-maps, QM method,
MEV method.
4.
Combinational Logic Design using MSI circuits
Introduction, multiplexers and their use in combinational logic design,
demultiplexers/decoders and their use in combinational logic design, adders and their use
as subtractors, digital comparators, parity generators/checkers, code converters, priority
encoders, 7-segment decoder/driver.
5.
Synchronous Sequential Circuits
Introduction, FSM model, memory elements and their excitation functions. Synthesis of
synchronous sequential circuits, capabilities and limitation of FSM, state equivalence and
minimization, simplification of incompletely specified machines.
6.
Asynchronous Sequential Circuits
Fundamental mode circuits synthesis, state assignment, pulse mode circuits.
7.
A to D and D to A Converters
Introduction, Study of different types of analog to digital and digital to analog converters,
their resolution, conversion time, sensitivity accuracy and other parameters. Study of
some commercially available ADC and DAC chips.
Note:- At most 1 question will be set from unit 1 and 2 each. At least one question each
will be set from rest of units.
BOOKS
1. R.P. Jain: Modern Digital Electronics, TMH.
2. Z Kohavi: Switching and Finite Automata Theory, TMH
3. M.M. Mano: Digital Logic Design, PHI.

B.Tech Computer Engg. 2002

-8-

Programming Methodology (Pr)
COT-211
L
-

T
-

P
2

Practical:
Sessional:

25
25

Note: Implement following programs in C language.
1.
2.
3.
4.
5.
6.

Modular program development of a simple text based calculator.
Modify above design to develop scientific calculator.
Computation of nCm using Recursion.
Generate Fibonacci series using recursion.
Implement natural merge and polyphase merge.
Implement a GUI/Mouse driven simple calculator.

B.Tech Computer Engg. 2002

-9-

Data Structures (Pr) (Using C language)
COT-213
L
-

T
-

P
3

Practical: 50
Sessional: 50

Note:- Write all programs in C language.
1. Define two strings as arrays. Read them using %s. Using pointers, concatenate them
without using string.h.
2. Define a pointer to an integer; read a list of n numbers using dynamic memory
allocation and find average of these numbers.
3. Create a file containing 26 alphabets(A to Z) in separate lines.
4. Copy a file to another. Source file name and destination file name are input from the
user.
5. Write a program for binary search (successful and unsuccessful both).
6. Sort n numbers using quick/merge/selection sort. Also count the number of
exchanges in each case.
7. Write a program for expression evaluation using stacks.
8. Write a program for infix to postfix conversion.
9. Create a singly linked list and reverse it in the same list.
10. Write a program for a doubly linked list giving following option, insertion, deletion,
retrieval,
11. Write a program to implement queues using linked list with option; list of elements in
queue, insertion, and deletion.
12. Write a program to implement stacks using linked list with options push and pop.
13. Write a program for multiplication of two polynomials using linked list.
14. Write a program to implement binary trees. Depending on the choice, inorder/
preorder/ postorder traversal is done.
15. Implement heap sort. Show the contents of heap after each adjustment of element i.e.
n outputs should be printed if list has n elements.

B.Tech Computer Engg. 2002

- 10 -

Digital System Design (Pr)
COT-215
L
-

T
-

P
2

Practical: 25
Sessional: 25

1. To study and verify the truth table of various logic gates (NOT, AND, OR, NAND,
NOR, EX-OR, & EX-NOR).
2. To design and verify a half and full adder circuits.
3. To design a 4 bit adder/subtract using IC 7483.
4. To design and implement a 4:1 multiplexer.
5. To design and implement a 1:4 demultiplexer.
6. Verify the truth table of a 4-bit comparator using IC 7485.
7. To design and verify a 2:4 decoder.
8. To design and implement a 2:4 encoder.
9. To verify the operation of a D and JK flip-flop using ICs 7474 AND 7473.
10. To design and verify the operation of RS, T, D, and JK flip-flops using logic gates.
11. To verify the operation of a Mod-10 counter.
12. To design and implement the operation of a Mod-16 counter using JK flip-flops
13. To design and implement a Mod-10 counter using JK flip flops and logic gates.
14. To verify the operation of a 4 bit shift register using IC 7495.
15. To design and verify the operation of a 4-bit shift left register using D flip-flops.
16. To design and verify the operation of a 4-bit shift right register using D flip-flops.

B.Tech Computer Engg. 2002

- 11 -

Encapsulation. Note:. Delhi 2. this pointer. Predefined functions. 3. Herb Schildt: C++ . 4. access control. 4. Object Oriented Design – Process. Strings. B. Arrays of strings. Local variables. 3. polymorphism. Delhi. Inheritance. U. Classes and dynamic arrays. 2002 . Joseph O’Neil and Herb Schildt: Teach Yourself JAVA. Flow of Control. Introduction to Classes. Use of Boolean expressions. C++ Programming Basics Fundamentals: Variables and assignments. Dastidar: Software and Systems . Dynamic arrays. Static. Horstmann: Computing Concepts with C++ Essentials. Defining classes and member functions. Exploration and Analysis. Multidimensional arrays.12 - . Operator overloading. Multiway branches. Constructors. Function Calling functions. Templates – generic classes and functions. Classes and Instances. Base classes. Character I/O. String and Characters. Loops. arrays as function arguments.Object Oriented Programming COT–202 L 3 T 1 P - Theory: 75 Sessional: 25 1. Objects and other basics. Method overriding. Method. namespaces. Use and design of loops. Methods. Signature. Information hiding. Recursive member function. Variables and Assignment. Public and private members. Object Oriented Software Engineering. Exceptions and Exception Handling with reference to object modeling. BOOKS 1. Flow of control. TMH. inheritance. Recursive function. Derived classes. Overloading function names. Parameter passing.At least one question will be set from each section.G. Friend functions. modifiers. Standard C++ classes. TMH. Method overloading.Tech Computer Engg. Operators. Constructors for initializations.K. C++ Object Oriented Concepts Objects and Classes: Use of file for I/O. Input and Output. Structures for diverse data. Arrays. Introduction to Java Data types. Destructors. Virtual functions. Procedural abstractions. Subprograms: Top down design. Inheritance. Overloading the assignment operator. arrays of classes. Polymorphism. Pointers. Object Oriented Programming and Design Review of Abstraction. 2. Coupling and Cohesion in object oriented software. 5. Delhi.An Introduction. Chakraborty and D. John Wiley.The Complete Reference. C++ Data Structures and Advanced Topics Arrays – Programming with arrays. Structures as function arguments. Data Types and Expressions. Formatting output with stream functions. Local and Instance variables. this keyword. Initializing structures. Programmer defined functions. subclasses. Copy constructors. Detailed Study of object oriented design with reference to interactive graphics editor. Control statements. Wheeler Publishing.

generic subprograms. and synchronization. 3. strong typing. and JAVA. scope-static and dynamic. Sebesta. 2. environment – local and non local parameter passing.13 - . type conversion. binding. PHI. CALL-RETURN structure. programmer and system controlled storage management. overloaded subprogram. heap storage management –fixed size and variable size. attribute grammar dynamic semantics. variables. R. 6.W. types of binding. 3rd Ed. control flow. Discuss with reference to C. and JAVA. type checking. 4. BOOKS 1. subprogram level concurrency. functions. Subprogram Fundamentals of subprogram. static storage management.Question paper will contain at least one question from each unit and two questions from unit 3. monitors and message passing.Tech Computer Engg. Discuss with reference to C. user defined data types. Functional Programming & Logical Programming Fundamentals of functional programming. C++. character string. 2. Pratt. C++. implementation of scopes. Programming Languages: Design & Implementation. Concurrency and Exception Handling Introduction. Horowitz. storage management phases. subprogram name as parameter. referencing. applications. through semaphores. W. T. recession. basic elements of Prolog. Concepts of Programming Languages (Addison-Wesley Pub). implementing non-local referencing environment. E. 2002 . Describing Syntax and Semantics Introduction. LISP: data types. deficiencies and application of Prolog. Fundamentals of Programming Languages. general problem of describing syntax. Introduction to Exception handling. formal methods of describing syntax. B.Programming Languages Concepts COT-204 L 3 T 1 P - Theory: Sessional: 75 25 1. C++. and JAVA. Storage Management Major routine storage elements. coroutine. principle data types. Discuss with reference to C. 5. stock based storage management. named constant. Data Types Name. Overview of logical programming. 3. pointer and reference. Note:.

2. logarithmic Poisson. 7.14 - . object oriented design. 5. Functional testing. reliability models – macro. types of maintenance. ER diagrams. maintenance process. Software Design What is design? Modularity. failures & faults. maintenance models.Aggarwal. testing tools. approaches to problems analysis.Tech Computer Engg. K. activities during testing. 5 th Ed. 3. New Age International Ltd. 6. debugging. waterfall prototype evolutionary.S. specifying behavioral & non-behavioral requirements. B. estimating number of residual errors. 4. information flow metrics. Narosa Publishing. Software Maintenance Introduction.There will be 8 question in all. Ian Sommerville.K.Software Engineering COT-206 L 3 T 1 P - Theory: Sessional: 75 25 1. metric analysis. Pankaj Jalote. R. size metrics. reliability concepts. 2001. Software Engineering. 2. Software reliability & Hardware reliability. Software Testing Introduction. Data dictionaries. An Integrated Approach to Software Engineering 2nd Ed. strategy of design. Software Reliability Importance. calendar time component. function oriented design. reverse engineering. structural testing. Software Engineering – A Practitioner’s Approach. BOOKS 1. TMH. entropy-based measures. Introduction Introduction to Software crisis & Software processes. Attempt any 5 questions. 4. Pressman. Yogesh Singh: Software Engineering. 2000. Requirement Analysis & Specifications Problem Analysis – DFD. Software life cycle models – Build & Fix. reliability allocation. re-engineering. spiral model. 4th Ed. Software Metrics Introduction. 3. basic. 2002 .. There will be max 1 question from unit 1 & unit 6 each and minimum 1 question from each of remaining units. data structure metrics. Addison Wesley. Note:. SRS. object diagrams. micro models.

2. Assembly Language Programming Assembler. DMA controllers. arithmetic instructions. 2002 .Tech Computer Engg. real and protected virtual addressing modes. internal operation. Note:. B. Parallel communication: 8255 A. Microprocessors and Interfacing.M. shift and rotate instruction. physical. instruction set features. macros – local labels and nested macros. K. Procedures. programmed I/O block transfer and DMA. BOOKS 1. flag manipulation instruction. 5. Hall. maximum mode. D. synchronous. 3. Bhurchandi. instruction format. TMH. logical instruction. TMH. branch instruction. protection. Ray & K. NOP & HLT instructions. 2. A. Interrupt and interrupt routines. Internal architecture.Microprocessors I COT-208 L 3 T 1 P - Theory: Sessional: 75 50 1. PHI. 3. instruction execution time. Modular Programming Stacks. Strings and I/O Programming String instruction. Microcomputer Systems: 8086/8088 family: Architecture. 80286 minimum system configuration. 16-bit bus interface. Programming and interfacing. Advanced Microprocessors and Peripherals: Architecture. asynchronous. 8086 Architecture CPU architecture.V. I/O Interface Serial communication. I/O consideration. directions and operators. 8251A. Programming and Design. data transfer instruction. 4. Liu and Gibson. 80286 Architecture Salient features of 80286.15 - .At least one question will be set from each unit. machine language instruction. 6.

Error function. Phase and frequency modulation. Pulse Modulation Sampling theorem for low pass and band pass signals.M.16 - . 2002 . FM Demodulation methods. Methods of generating SSB signals. Pre-envelope. M-ary FSK. Analog Modulation Techniques Introduction. direct sequence spread signals. Delta modulation and adaptive delta modulation. G. Properties of rectangular Gaussian. pulse code modulation. B. Computation of signals to noise ratio. Spectrum of AM signal.Analog and Digital Communication ECT-232 L 4 T 2 P - Theory: 100 Sessional: 50 1. signal bandwidth of FM signal. 2. CDMA system based on frequency hopped spread spectrum signal. generation of PN sequences. vertical side band modulation. 2. Ergodicity & Stationarity. Convolution. Narrow band noise and its representation. correlation between waveforms. spectral densities. ideal low pass filter. NBFM & WBFM FM generation methods. Average value of random variables. concept of pulse amplitude modulation and pulse width modulation. quadrature phase shift keying. frequency division multiplexing. Digital Modulation Techniques Binary phase shift keying. single side band modulation. Spread Spectrum Signals Spread spectrum model. Probability density function. Simon Haykin: Digital Communication. time division multiplexing. 6. TMH. Binomial Rayleigh & Poisson’s distribution. Noise and its sources. 4. Noise figure to noise temperature. Spectral Analysis Fourier series. Random Variables & Noise Probability. differential phase shift keying. 5. Random variables. Parseval’s Theorem. John Wiley. 3. QASK. Effect of modulation index on bandwidth. Covariance. BOOKS 1. Note:. Amplitude Modulation. M-ary PSK. 3. Random processes. Impulse Function. G. Minimum shift keying. Central Limit Theorem. Kennedy: Electronic Communication System. TMH. Double sideband suppressed carrier modulation. Transmission of noise through linear systems. Noise bandwidth. AM demodulators. Angle modulation. Noise computation in PCM systems. J. Binary FSK. Joint Probability. Fourier Transform. MGH.Tech Computer Engg.At least one question will be set from each unit. Hilbert transform. Cumulative distribution function. Response of linear system Power spectral density. spectrum of F. 4. Mathematical representation of random noise. Taub and Schilling: Principles of Communication System. demodulation of signals. Proakis: Digital Communications. Methods of noise calculation in network and interconnected networks.

public. * overload << operator to enable output through cout.Write programs first in C++ and later in Java. *PAYINGCAR( ) that increases the numbers of cars by one and increase the total amount by 2. Include the following member functions: * a constructor that sets both the data fields to zero.17 - . Write a main () to test all the functions in the class .BOOTH with the following data items unsigned int . * overload >> operator to enable input through cin. (a) Model a geometric point to find distance between two points. *NOPAYING( ) that increases the number of cars but keeps the total amount unchanged. Include the following public member functions: * constructor with no arguments (default) * constructor with two arguments. Write main( ) to test the class thoroughly. double . (b) Model complex numbers and their operations. 2002 . *DISPLAY( ) that displays both the total number of cars passing and the total number of amount collected. 2. * overload + operator to add two rational numbers. Create a class rational which represents a numerical value by two double values. 4. Describe a class called TOLL. * void reduce() that reduces the rational number by eliminating the highest common factor between the numerator and denominator.Object Oriented Programming (Pr) COT-212 L - T - P 2 Practical: Sessional: 25 50 Note:.to hold the total amount collected. father (int x){age =x.NUMERATOR and DENOMIATOR . Consider the following class definition class father { protected : int age.Tech Computer Engg. 3.50.to hold the number of cars passing through the booth. 1.} B.

Implement classes for temp. falls below 95% of the required temp. gauge and switch(multiple inheritance). The information to store include B. You should also define suitable constructors for these classes. it turns itself "on". 2002 . Write a program that creates a binary file by reading the data for the students from the terminal. Derive the two classes son and daughter from the above class and for each.. 9. Successively. Now. The thermostat monitors the temp. b) Develop a class called thermostat that inherits the data methods of temp. A hospital wants to create a database regarding its indoor patients.05 of the required temp. of the system by actually reading it from the keyboard. call iam() through the pointer to demonstrate polymorphism in action. Write main() to test all the features of above mentioned classes. The data of each student consist of roll no. name (a string of 30 or lesser no. On the other hand . gauge and switch(named switch) with suitable data and member functions. Using the file created in problem 6. implement thermostat class in both the following ways: a) Develop a class called thermostat that include objects of temp. if the current temp. of characters) and marks. Now. Declare pointer to father. .virtual void iam() {cout <<"I AM THE FATHER. 7. gauge class must have a member function get_temp() that will pretend to get the current temp. 5.18 - . assign addresses of objects of the two derived classes to this pointer and in each case. The temp.In all other cases . Each record relates to a historical event and the year in which the event took place Some examples are: India Wins Freedom 1947 Amartya Sen Gets Nobel 1998 First World War Begins 1914 The data should be read from terminal while creating the file. write a program to display the roll no. exceeds 1. gauge and switch as its member(aggregation). It is also a switch that can be turned "on" and "off". my age is :"<<age<<end1. 8. You are to create a file containing n records. and names of the students who have passed (has obtained 50 or more) .its on-off status remain un changed. 6. write a main () that creates objects of the three classes and then calls iam() for them. in the following manner : if the current temp.} }.. A thermostat is a device that keeps a system at a constants temperature. It behaves like a temperature gauge that is capable of getting the current temperature from the system. define iam() to write out similar but appropriate messages.it turns itself "off" .Tech Computer Engg.

Write a program to read a number and display its square. Make a class Employee with a name and salary. List the information about all the pediatric patients (less than twelve years in age). Supply a method to toString that prints the manager’s name. C++: The Complete Reference by Schildt. cube and cube root.Tech Computer Engg. TMH. The member functions should include functions for reading the time and displaying the same. Write a static method that uses polymorphism to compute the pay of any Worker. to store hours. Add a friend function to add two times. to read two times and add them.. Y and Z are matrices. Computing Concepts with Java 2 Essentials by Horstmann. Make a class Manager inherit from Employee. 14. Write a program to read two matrices and find their product. If the hourly worker worked more than 40 hours. 11. Supply a test program that tests these classes and methods. 3. Write a superclass Worker and subclass HourlyWorker and SalariedWorker. 5. Delhi.. 13. Supply a test program that tests these classes and methods. Every worker has a name and a salary rate. The data members should include hr. month and date as its members). Supply a method toString that prints the string “Executive” followed by the information stored in the Manager superclass object. Delhi. 4. using the above declaration. BOOKS 1. no matter what the actual number of hours is. the excess is paid at time and a half. named department. Define a class to store the time at a point. Java2: The Complete Reference by Schildt.(a) Name of the patient (b) Date of admission (c) Disease (d) Date of discharge Create a structure to store the date (year. Computing Concepts with C++ Essentials by Horstmann. John Wiley. TMH. 12. Write a method computePay(int hours) that computes the weekly pay for every worker. B. The member function should include functions to enter information and display a list of all the patients in the databases. Teach Yourself Java by Joseph O’Neil (TMH. Use operator overloading so that the statement for multiplying the matrices may be written as Z  X * Y where X . square root. John Wiley. and sec. 10. Delhi). Create a derived class to store the age of the patients. Use a virtual function to display any one of the above. of type String. 2002 . Add an instance variable. The salaried worker gets paid the hourly wage for 40 hours. department and salary. minutes and seconds.19 - . min. Make a class Executive inherit from Manager. Write a program. Create a base class to store the above information. 2. if hours is at most 40. An hourly worker gets paid the hourly wage for the actual number of hours worked.

8.Microprocessors – I (Pr. subtraction. Check whether a given string is palindrome or not. Sort n numbers using modular program. 12. Write modular program to perform addition. store that number in a register and display it digit by digit. Write a program to read a integer number of max (16 bit). Do these programs by defining different segments in different files and link all of them to get the desired output. which use multiple data segments and multiple code segments. Write a program to find factorial of a number.Tech Computer Engg. Merge two sorted list of integers 11. 10. 3. Reverse an input string. 9. 2002 . Using int 10h. 2. multiplication and division of two 16-bit numbers. Write some programs. Repeat exercise 5 for two 32-bit numbers 7.) COT-214 L - T - P 2 Practical: Sessional: 50 25 1. Repeat exercise 2 for 32 bit number. change the position of the cursor based on user’s choice. Use procedure to calculate factorial and pass parameters 5. Write a program to print the alphabets. where result does not exceed 32 bit. 4.20 - . change the size of cursor. B. 6.

. 2.Implement the following programs using C. effort and time in a program. 3. generate SRS document.Software Engineering (Pr) COT-216 L - T - P 3 Practical: Sessional: 50 50 Note:.Tech Computer Engg. Compute psychological complexity of a program. 6.21 - . test cases generation for result automation. 5. 2002 . Compute average life of variables in a program. Communication (Pr) ECT-234 L - T - P 2 Practical: 25 Sessional: 25 B. Use some CASE tool for identifying various phases of software engineering. 4. Compute average number of live variables per statement in a program. estimated program length. Implement Halstead’s equation to compute various science metrics like volume etc. Compute McCabe’s cyclomatic complexity of a program and generate its control graph. 1. language level. engineering admission automation (seat allocation during counseling). design document like DFD and ER diagram.

10. 2002 . Measurement of bit error rate BER of FSF.22 - . (Modulation/Demodulation). (Modulation/Demodulation).Tech Computer Engg. B. 9. 6. 7. Study of ADM. 5. (Modulation/Demodulation). Measurement of bit error rate BER of PSK. Measurement of noise variance using Kit. (Modulation/Demodulation). 8. (Modulation/Demodulation). Study of PWM. Study of PAM. 2. Study of PPM. 3. Study of PCM. (Modulation/Demodulation). Study of AM & FM.List of Experiments: 1. Study of DM. (Modulation/Demodulation). 4.

Galgotia Publications. B. 3. Priority queues. Binomial heaps. Sorting in linear time. Hash tables. Aho. Sartaj: Fundamentals of Computer Algorithms. All pairs shortest paths – shortest paths and matrix multiplication. Note:. PHI. Graph Algorithms Review of graph algorithms. Flow and Sorting Networks Flow networks. Bitonic sorting network. Johnson’s algorithm.23 - . The zero-one principle. Ellis and Sahni. task scheduling problem. optimal polygon triangulation. Floyd-Warshall algorithm. At least one question will be set from each unit and at most one from unit 1 and 4 each. data structures for disjoint sets.The question paper will contain 8 questions in all. topological sort. Addison Wesley. longest common subsequence. Quicksort. 3. Horowitz. 2002 . Ford-Fulkerson method. Maximum bipartite matching. Leiserson and Rivest: Introduction to Algorithms. recurrence relations.Tech Computer Engg. strongly connected components. 4. Advanced Design and Analysis Techniques Dynamic programming – Elements. asymptotic notation. medians and order statistics. 2. Fibonacci heaps. BOOKS 1. Binary search trees. Huffman codes. Dijkstra’s algorithm. Hopcroft. 5. Matrix-chain multiplication. strings. Advanced Data Structures Operations in B-Trees. difference constraints and shortest paths. merging network. Single source shortest paths. minimum spanning trees – Kruskal and Prim’s. dynamic order statistics. 2/e. Introduction Review of elementary data structures. 6. 2. activityselection problem. Comparison network. Sorting Networks. The student will be required to answer any five. Sorting and Order Statistics Heapsort. Greedy algorithms – Elements.Design and Analysis of Algorithms COT-301 L 4 T 1 P - Theory: Sessional: 100 25 1. and Ullman: The Design and Analysis of Computer Algorithms. relaxation. Bellman-Ford algorithm. Cormen. single source shortest paths for directed acyclic graphs. analyzing algorithms.

Note:. Date: An Introduction to Database systems 7th Ed. Integrity rules. Networks data model. other normal forms. base tables & views. TMH. organization of databases. H. 3NF. C. B. catalog management. components of DBMS.At least one question will be set from each unit and three from unit 2. Majumdar and Bhattacharyya: Database Management Systems. Problems of distributed processing-query processing. semantic data model.K. timestamp based protocols. 1996. Addison Wesley. alternate keys. Concurrency Transaction concept. updates propagation. serializability lock based protocols. JD & 5NF. domains.Database Systems COT-303 L 3 1. relations. foreign key. Distributed Data Bases Introduction. THM. 2. relational calculus.J. why database. Korth & S. objectives. Non-loss decomposition and functional dependencies. Hierarchical Model.Tech Computer Engg. transaction state. BCNF. DBMS. A. MVD & 4NF. Data Models. Data Base Design – Introduction. recovery control. Basic Definitions. mapping DBA. 2NF. 2. concurrent executions. 2000. BOOKS 1. Normalization procedure. internal level. Sudarshan: Data Base System Concepts. A Silberschatz. conceptual level.24 - . Data independence. Relational Model Introduction – Relational Model. 3. 2002 . Indian Edition. and concurrency control. fundamental principles. 4. deadlock handling. 3 levels of architecture. Relational Models. T 2 P - Theory: 75 Sessional: 50 Basic Concepts What is database system. 1NF. 3. relational Operators – relational algebra. external level. primary key. candidate keys.F. validation based protocols. 1997.

sed. creating command substitution. password administration. At least one question will be set from each of the units. John Goerzen: Linux Programming Bible. TMH. 2000. authentication. Linux I/O system NOTE: There will be eight questions in all. customizing environment 3. Shell as command processor. Regular Expressions and Filters Introducing regular expressions patterns. functions. loops. New Delhi. 2001. Sumitabha Das: Your Unix – The Ultimate Guide. character classes. starting and stopping processes. programming with awk and perl. Mathew: Professional Linux Programming. O’Reiley & Associates. 4. building and using static and dynamic libraries. scripts. use of makefiles. managing projects. memory management – dynamic and static memory. Processes in Linux Processes. Command line. 2002 . compiler options. quantifiers. network files. 2. introduction to egrep. Signals and signal handlers.Unix and Linux Programming COT-305 L 3 T 1 P - Theory: Sessional: 75 25 1. The C Environment The C compiler.Tech Computer Engg. time.25 - . 3. vi editor. security. debugging with gdb 5. Books 1. Shell Programming Unix file system: Linux/Unix files. dependency calculations. memory management. dynamic loader. inodes and structure and file system related commands. 2000. Welsh & Kaufmann: Running Linux. conditionals. accessing linux – starting and shutting processes. B. Logging in and Logging out. initialization processes. Wrox-Shroff. job control – at.1 & 2. IDG Books. simple commands 2. 2000. vol. using ldd. soname. shell variables. archiving. syntax. Linux Startup User accounts. batch. cron. privileges. rc and init files.

complexity Classes. 2. Introduction Introduction to Finite State Machine. Polynomial-Time. 1.E. Godel Numbering. B. Intersections and Complements. Post’s correspondence Problem. Recursively Enumerable and Recursive Languages. Context-Free Language Context – Free Grammars. Martin: Introduction to Languages and the Theory of Computation. Parsing. Finite automata. Minimal Finite Automata. Distinguishing one string from another. concatenations and closures of CFLs. problems. unions.The question paper will contain 8 questions in all. Push down automata. Criterion for Regularity. Chomsey Hierarchy. Ullman: Introduction to Automata Theory Languages and Computation. Isomorphism. PHI. J. The memory required to recognize a language. PDA to CFG and Vice Versa. Note:. context Sensitive grammars. Reductions and NPCompleteness.Automata Theory COT-307 L 4 T 2 P - Theory: Sessional: 100 50 1. Non-numeric-functions. Moore and Mealy FSMs. Cook’s Theorem. definition. Regular expressions. unambiguous CFG for algebraic expressions. Halting Problem. Primitive Recursive Predicates and some bounded operations. The students will be required to answer any five. Ambiguity. combining TM. Derivation Tree. Turing Machines Definition. Computability Primitive Recursive Functions. NFA with – transitions. The pumping lemma. Hopcroft and J. unions. Equivalence. 3. 4. Regular and Non-regular languages. MGH. Narosa. At least one question will be set from each section. P and NP. parity bit generator. BOOKS John C. example of familiar languages. 3. decision.A. computing Partial Function with TM. Daniel I. NFA. Regular Languages.Tech Computer Engg. 4. 2. Lewis & Papadimitriou: Elements of the Theory of Computation. Pumping lemma for CFG.D.26 - . Simplified forms and normal forms. 2002 . Reduction of States. Turing Machining as Language acceptors. Context Free and Non Context Free Languages. Binary counter. Time and space complexity of TM. Definition of CFG. unbounded minimization and recursive functions. Growth rates of functions. Intersection and complements of CFL. Cohen: Introduction to Computer Theory: John Wiley. deterministic PDA. Nondeterminism and Kleen’s Theorem. Regular Grammars.

A connected undirected graph G has an Euler circuit.j] and M[k.Tech Computer Engg. Consider some examples: Infix. The postfix representation of an infix arithmetic expression LDR is defined recursively to the postfix representation of L followed by the postfix representation of R followed by 0. or (b) I= k and j = l+_1 For ex.Algorithms Design (Pr) COT-311 L - T - P 3 Practical: Sessional: 25 50 1. 4. 9. 5. Give an algorithm to determine whether a directed graph with positive and negative cost edges has negative cost cycle. Write a complete LC branch and bound algorithm for the job sequencing with deadlines problem. Give an algorithm and implement to find the Euler Circuit in a graph with e edges provided one exists.1] and ending at M[1. An Euler circuit for an undirected graph is a path that starts and ends at the same vertex and uses each edge exactly once. 1 8 5 7 9 7 9 3 6 3 11 2 12 5 4 6 Matrix of Positive Integers. Sequence. L and R are respectively the left and right periods of 0. Assume E is presented as a string and that there exists an algorithm NEXT-TOKEN(E) that returns the next token B. 6. Postfix. Implement the minimum cost spanning tree algorithm. 2.12 is a solution. in the following fig. Implement the shortest path algorithm. 3.9. 2002 . 7. 8. Implement the algorithm to compute roots of optimal subtrees. If and only If energy vertex is of even degree. (i) a + b ab + (ii) (a+B) *C ab + * (iii) (a-b)/(c*d) ab-cd*/ (a) Write an algorithm to evaluate a postfix expression E.5. Use the fixed tuple size formulation. 7. Write a LC branch and bound algorithm for the knapsack problem using the fixed tuple size formulation.27 - . Two entries M[i.n] such that the sum of the absolute values of differences between adjacent entries is minimized. Write an algorithm in which given an n x n matrix M of positive integers is given and that finds a sequence of adjacent entries starting from M[n.7.6.8.l] are adjacent if (a) i= K+_ 1 and j = l.

Tech Computer Engg. Write an algorithm to obtain the postfix form of an infix expression E. When all tokens in E have been extracted. 10. * and /. the top two operands on the stack are its right and left operands). 2002 . Note that E may contain parenthesis. (Hint: Make a left to right scan of E using a stack to store operands and results.e.(i. When even an operator is run in E. B. Assume that the only operators in E are binary +. _.28 - . operator or operand) in E. NEXTTOKEN(E) returns. _. * and /. (Hint: Make a left to right scan of E using a stack to store operators until both the left and right operands of an operator have been output in postfix form). Again assume E has only the binary operators +.

6.Tech Computer Engg. Use various select queries to search the database for both the databases using different conditions. Write a program to delete the records of the students who are getting marks less than 40 %. 12. Write a program to modify the designation of all employees of database 2 for whom the date of joining is before Jan. 2. 11. Create a database (database 2) for the employees of an organization and edit it using various available options. Practice various prompt commands like create. Generate report for both the databases. Develop an MIS for an XYZ Paper Mill to automate its i) inventory ii) purchase iii) sales iv) payroll v) annual production report. 10. name. Index the database created in problem 3 using various conditions. Write a program to list out all the information about students getting marks than 70 % using loop structure. branch etc. 9. 10. 2002 . 2002..Database Systems COT-313 (Use Oracle or IBM DB/2) L - T - P 3 Practical: Sessional: 50 50 1. select etc. Create a database (database 1) for your class group containing information . Write a program to enter the data into database 2. 4. 5. about students. 3. 8. Application Programs: 7. B. Write a program to display 5th record from both the databases. group.roll no.29 - .

Unix and Linux Programming (Pr) COT-315 L - T - P 3 Practical: Sessional: 50 50 1. Develop advanced shell programs using awk and grep. 3. 8. As supervisor create and maintain user accounts. learn package installation.Tech Computer Engg.30 - . All OSs should be usable. Compile and debug various C programs using different options. 6. creation of startup and shutdown scripts using at. Using Bash shell develop simple shell programs. 7. 2002 . Learning of installation and upgradation of Linux operating system. Install Linux on a PC having some other previously installed operating system. Familiarize with vi editor and Linux GUIs. 4. 5. B. Familiarize with Unix/Linux logging/logout and simple commands. 2. cron etc. creation of scripts for file and user management. taking backups.

Interrupt mechanisms. Protection: Mechanisms and Policies. Paging. device management. P. Note:. concurrency control. Tanenbaum. Classical process coordination problems and their solutions. Deadlock prevention and avoidance.31 - . WesleyReading. Concurrent Processes: Critical section problem.Operating Systems COT-302 L 4 1. 3. 4. Prentice Hall of India. multiple contiguous allocation. Peterson. 2. A. CPU scheduling. Deadlocks & Concurrency Control Deadlock: Deadlock characterization. implementation issues. Hansen: Operating System Principles. Thrashing. UNIX : Study of UNIX with reference to storage management. BOOKS 1. hierarchy of file and device management.L. Deadlock detection and recovery. File access and allocation methods. A.Tech Computer Engg.: Operating System Concepts. Comparative study of scheduling algorithms.: Introduction to Operating System Design Galgotia Publication. T 2 P Theory: Sessional: 100 50 File & CPU management Operating system functions and characteristics.S. Semaphores. 2002 .: Architecture of Concurrent Programs. & Silberschatz. Distributed systems. Hansen. Shaw. historical evolution of operating systems.B. Storage & Device Management Storage Management: Storage allocation methods: Single contiguous allocation.: Logic Design of Operating Systems. Virtual memory concepts.: Operating Systems. directory and file protection mechanisms. Device Management: Hardware Organization. Segmentation combination of Paging and Segmentation. A. B. Demand Paging.Two questions will be set from each section. practical considerations. Real time systems. File Systems: Functions of the system. PHI. 6.C. Haberman. Implementation. Device scheduling policies & I/O management. Case Studies DOS: Study of DOS with reference to storage management. system programs. PHI. 2. file system. ND 4. multiple processor scheduling. Addison. 3.N. Directory Systems: Structured Organization. interrupt mechanism. J. Interprocess Communications. A. multithreading. Brinch. Page replacement Algorithms. concept of threading. file system. Methodologies for implementation of O/S service system calls. CPU Scheduling: Levels of Scheduling. 5.

3.The complete reference. IRQ. ROMBIOS. advanced memory technologies. data transfer mode. I/O bus system: ISA. DVD ROM drive. IDE interface: ATA standards. Memory Memory.K. keyboards. 4.32 - . VESA local bus. input-output ports. B. CMOS setup. 2. MCA. 2002 . UPS. Motherboard PC family tree. Note:. USB. Video adapters. 2. Craig Zacker & John Rourtre: PC Hardware. record able drives. troubleshooting Video adapters. parallel ports. motherboard controllers and system resources. Power Supply Power supply function and operation. 3.Computer Hardware Technologies COT-304 L 4 T 1 P - Theory: Sessional: 100 25 1. SCSI interface: SCSI bus. printers and monitor. backup power system. PCI. Chauhan: PC Upgrading. serial ports. troubleshooting memory. S. Mark Minosi: The complete PC Upgrade & Maintenance Guide 4/e. EISA. BPB publications. PCIX. mice.At least one question must be set from each unit. trouble shooting drives and peripherals. troubleshooting power supply. master-slave configuration. ROM POST. hard disk drive. TMH. SCSI standards. memory types. memory chips & modules. Interfaces and I/O Ports Floppy disk interface. power supply quality and specification. maintenance and troubleshooting guide.Tech Computer Engg. 5. AGP. on board I/O devices. BOOKS 1. power protection and back-up. CD ROM drive. which is better SCSI or IDE. Device drives and peripherals Floppy disk drive.

1999. Slotted-ALOHA. RTP. PPP protocols. Network Services. OSI Reference Model. Reliable stream service. operation. 6 TCP/IP Architecture. ARP. Socket system calls. TDMA. ATM Networks. Peer-to-Peer Protocols Protocols. 802. 4. SNMP. Transmission Control Protocol – TCP.3. CDMA. Subnet addressing. 5. 3. 1997. CSMA-CD. DHCP.4. multiplexing and signaling techniques. 802. 3.6. PHI. Service Models and End-to-End requirements. RARP. 2002 . CSMA. CIDR. Internet protocols – IP packet.11. TMH. Connectionless and Virtual Circuit packet Switching.25. Overview of TCP/IP architecture. Internet Routing protocols. X. Note:. ARQ. 2000.S. Electronic Mail. BOOKS 1. Tanenbaum: Computer Networks. Leon Garcia and Indra Widjaja: Communication Networks – Fundamental Concepts and Key Architectures. HDLC. Multicast Routing. B. Datagrams and Virtual Circuits – Structure of Switch / Router. Channelization in Cellular networks LAN Standards . Switching Approaches. protocol. MAC and LAN Protocols Multiple access communication. FDDI.Computer Networks COT-306 L 4 T 1 P - Theory: Sessional: 100 50 1. UDP. Mobile IP. 802. Routing Algorithms. Traffic management and QoS – FIFO. Channelization – FDMA.33 - . William Stallings: Data and Computer Communications 5/e. Reassembly.5. Statistical Multiplexing. IP routing. 4. ISDN and BISDN 2. Introduction Network Functions.There will be at least one question from each unit. ICMP. 3/e. Fair Queuing. Congestion Control techniques. Transmission media and systems. Sliding Window. Error detection and correction. TMH. Layered Architectures Examples. Addressing.Tech Computer Engg. Random Access-ALOHA. Forouzan. LAN Bridges. Coombs and Fegan: Introduction to Data Communications and Networks. Priority Queues. PHI. Packet Switching Networks Packet network topology. IPv6.802. 2. Network Topology. 802. A.

general approach. parallel sorting on Array Processors – SIMD Fast Fourier Transform. control store. principles of designing pipelined processor. Pearson Education. Addison Wesley Longman. processor characteristics for multiprocessing. Mesh-connected iliac Network. superscalar architecture. Time and Global States. Models of Distributed Systems. Clocks. cube interconnection networks. Appropriate Model. Interleaving Model. Examples. Synchronizing Physical Clocks. pipelining. crossbar switch and multi-port memories. The student will be required to answer any five. Masking and Data Routing mechanisms. At least two questions will be set from each section. Architectural Models. BOOKS 1.Tech Computer Engg. Array Processors SIMD Array Processors-SIMD Computer Organizations. branching and looping.34 - . Houring & Harry F.Advanced Computer Architecture COT-308 L 4 T 1 P - Theory: Sessional: 100 25 1. horizontal and vertical micro-code scheme with example. Parallel memory organizations. Jordan. Associative memory organizations. micro-code engine. alternative approach to micro-coding. basic assumptions. Tightly coupled multiprocessors. Fundamental Models. interleaved memory configuration. Computer Systems Design and Architecture. vector processing overview. forwarding. Shuffle exchange and Omega Networks. Partial Orders. Dynamic Networks. associative search algorithms. pipeline hazards and their detection. Architecture of Distributed Systems:Introduction. 2. Distributed Debugging 3. Partial Causality Model. 4. Distributed Systems versus Parallel Systems. Note:.The question-paper will contain 8 questions in all. general pipeline and reservation tables. Process States. performance of interconnection networks. propagating an instruction queue through the pipeline. Multiprocessor Architecture Functional structures. instruction level parallelism. multistage networks for multiprocessors. loosely coupled multiprocessors. Global States. Static Vs. time shared or common buses. Happened Before Model. Inter-PE Communications. Parallel Algorithms for array processors – SIMD Matrix multiplication. SIMD interconnection network. Associative processors. Models Based on states. micro-programming. Vector Clocks. designing pipelined data path. Barrel Shifter and data manipulator. Vincent P. B. performance tradeoffs in memory organizations. principles of linear pipelining. Instruction and arithmetic pipeline. 2002 . Introduction to Parallel Processing Parallelism in uniprocessor system. Logical Time and Logical Clocks. Inter-connection Networks. design techniques. Associative Array processing. multi-cache problems and solutions. Events. connection issues for SIMD Processing.

A. Colouris.G.Briggs: Computer Architecture and Parallel Processing.P. Computer Structures: Principles and Examples. Principals of Distributed Systems.2. C. 1996. A. T. 3. Newell. Mc Graw Hill. Distributed Systems: Concepts and Design. Kluwer Academic Publishers. Bell. Hwang and F. D. Dollimore.Tech Computer Engg. B. Siewiorek. G. McGraw Hill.35 - . 2002 .Garg. 2002 4. V. J.K. 5. Kindberg 3/e Pearson Ed.

P 3 Practical: Sessional: B.36 - .Tech Computer Engg. best & first fit for contiguous allocation assuming randomly generated free space list. Implementation of Compaction for the continually changing memory layout & calculate total movement of data. 8. 2. 10. 5. Study of H/W & S/W requirement of different operating system. Calculation of external & Internal fragmentation for different program & for different page size. 7. Implementation of “Semaphore” for concurrency. 9. Implementation of Banker’s algorithm. 4. Study of system calls and various OS management services in Unix/Linux OS and their implementation. 3. 11.Operating System (Pr) COT-312 L - T - 1. Conversion of response allocation graph to wait for graph. Implementation of Bernstein’s condition for concurrency. 2002 50 50 . linked and indirect allocation strategies assuming randomly generated free space list Implementation of worst. 6. Implementation of resource allocation graph. Implementation of contiguous. Implementation of Fork & Join Construct. 12.

2. TMH. PII. 5. PI. To observe various cables and connectors used in networking. 13. its circuitry and various presets and some elementary fault detection. To study monitor.37 - . To study parts of keyboard and mouse. 386. study and replace floppy disk drive. To make comparative study of motherboards. connections and parts used in computer communication.Computer Hardware& Troubleshooting Lab (Pr) COT-314 L - T - P 3 Practical: Sessional: 50 50 1. 4. To solder and desolder various components. 8. BPB publications. To remove. PIII. study and replace CD ROM drive. drives. To observe and study various cables. 9. Scott Mueller. 486. To assemble a PC. 2. and printers etc.Tech Computer Engg. Upgrading and Repairing PCs. To study printer assembly and elementary fault detection of DMP and laser printers. LAN card etc. 6. 1999 B. PHI. 11. 3. To remove. 7. display card. BOOKS 1. Craig Zacker & John Rouske. 12. To check and measure various supply voltages of PC. Troubleshooting exercises related to various components of computer like monitor. 2002 . PC Hardware: The Complete Reference. memory. 10. Mark Mines Complete PC upgrade & maintenance guide. To study various cards used in a system viz. 3. 14. To remove. study and replace hard disk.

use automatic name completion. BOOKS 1. Develop a servlet that gets invoked when a form on a Web page in HTML is submitted. You should be able to easily add new names to the database. make some different text appear in the text field. Add a check box to the applet created. When typing in the name to be looked up. Delhi. Delhi. B. using visual basic. Generate an editor screen containing menus. 2002 . TMH. 2. characters typed into it will appear in the TextField. 3. Delhi. 3.g.” Create a manifest file. Create your own Java Bean called Valve that contains two properties: a Boolean called “on” and an integer called “level. telephone numbers. and insert different text into the text field. Write a handleEvent( ) so that if the button has the focus. 2. then load it into the beanbox or into your own Beans-enabled program builder tool e. Java 2: The Complete Reference 4/e: Herb Schildt. addresses. etc. Using VB develop a front end for a contact management program using a flat-file database containing names. Java Servlets: Application development: Karl Moss. 6. 7.38 - . Create a Cookie object and enter/display value for that cookie. use jar to package your Bean. When you press each button.Tech Computer Engg. 5. Visual Basic: Complete Reference. 1999. TMH. dialog boxes etc. 4.Advanced Technologies (Pr) COT-316 L - T - P 3 Practical: Sessional: 50 50 Exercises 1. email addresses. JavaBeans Programming from the Ground Up: Joseph O’Neil. capture the event. 4. Create an applet with a text field and three buttons. BDK so that you can test it. Create an applet with a Button and a TextField. TMH. TMH. Learn Visual Basic environment and develop simple calculator.

Systems and signal processing. parallel form.Question paper will contain at least two questions from each unit. Analog to digital and digital to analog conversion. Discrete Fourier Transform(DFT). 2002 . frequency analysis of signals using the DFT. TMH. Matched Z transformation design of FIR filters with different methods. Bilinear transformation and impulse invariance method. Proakis and Dimitris G. Introduction Signals. 3. 3 T. properties of Z transform. 5. PHI 2. structures for IIR systems. PHI. Structures for FIR systems. A Vallavraj. Digital Signal Processing. - Theory: 100 Sessional: 50 1. TMH. Cascade form structure. direct form and parallel form structures. 4. direct form structure. Inversion of Z transform. Digital Signal Processing applications.Digital Signal Processing COT-340 (Departmental Elective I) L. B. S. C. Implementation of Discrete time systems. Z-transform and its Applications Z Transform. S. Gnanapriya. Discrete time systems. implementation of discrete time systems. applications of Z transform. Note:. Design of Digital Filters Design of IIR filters. Fast Fourier transform and its applications FFT algorithms (Radix 2 FFT) algorithm. concept of frequency in continuous time and discrete time signals. John G. Rabiner & Gold. Discrete time signals. cascade. Manolakis.39 - . 2 P. Digital Signal Processing. 2.K. 4. Salivayhan. Digital Signal Processing. Mitra. Linear filtering methods based on the DFT. Digital Signal Processing . Oppenheim & Schaffer. BOOKS 1. properties of DFT. 3.Tech Computer Engg. LTI systems. difference equations. classifications of signals.

PHI. color palettes. morphing . vector drawing. 3-D graphics programs. BOOKS 1. 5. DVI technology. digital video and image compression. VR operating System. Tay Vaughan. scanning images. JPEG predictive lossless coding. computer color models. Multimedia on the PC. JPEG statistical coding. time domain sampled representation. Framework for multimedia systems. transmission of digital sound. CD-ROM. manufacturing. Basics of multimedia technology Computers. 4. Multimedia : Production.distribution network-ATM & ADSL. 3-D drawing and rendering.CD-I. Communication and Entertainment. LANs & multimedia .Multimedia Techniques COT-342 (Departmental Elective I) L. Fourier method. method of encoding the analog signals. PHI. multimedia presentation and authoring. Virtual environment displays and orientation tracking. audio compression & decompression. editing and capturing images. 3 T. Audio & Video Digital representation of sound. Intelligent multimedia system. 4. JPEG-DCT encoding and quantization. Multimedia -An introduction. audio synthesis. Villamil & Molina. antialiasing.40 - . Entertainment. Sinclair. editing sampled sound. TMH B. MPEG motion video compression standard. 3. NOTE: There will be eight questions in all. vector graphics. BMP. shading. time-based media representation and delivery. 2. Desktop Virtual Reality (VR). Two questions will be set from each of the units. MPEG Audio. Overview of other image file formats as GIF. World Wide Web(World Wide Web) & multimedia . PHI. PNG etc. 2 P. presentation devices and the user interface. Applications of environments in various fields viz. 3. Multimedia :Making it work. JPEG performance. JPEG-objectives and architecture. stereophonic & quadraphonic signal processing. Planning and Delivery. 2002 . education. brief survey of speech recognition and generation. Musical Instrument Digital Interface (MIDI). Villamil & Molina. CD-Audio. - Theory: 100 Sessional: 50 1. multimedia devices.Internet. Image Compression & Standards Making still images.Tech Computer Engg.video on demand 2. professional development tools. visually coupled system requirements. TIFF. etc. animation techniques. Multimedia : Sound & Video. multimedia servers & databases. Multimedia : An Introduction. business. Lozano. subband coding. intelligent VR software systems. digital audio signal processing. Virtual Reality Applications of multimedia. BPB.

minimal spanning tree.Graph Theory and Combinatorics COT-344 (Departmental Elective I) L 3 T 2 P - Theory: 100 Sessional: 50 1. Polya’s theorem. directed graphs. 2002 . connectivity and separability. Graph Algorithms Computer representation of graph. isomorphism.Krishnamurthy: Combinatorics--Theory and Applications. generating functions. cut vertices and cut edges. performance of graph theoretic algorithms. Deo N. Affiliated East-West 5. directed circuits.: Graph Theory and Applications. max flow. counting principles. network flows.41 - . Prentice Hall 3. inclusion and exclusion principles. planar and non-planar graphs. fundamental circuit.B. matching perfect matching. Euler’s formula. Alan Tucker: Applied combinatorics. B. finite geometry. Polya’s counting theorem 3. Advanced Features Vertex coloring. walks. S. multinomial.At least two questions will be set from each unit. 4. cycles. planarity testing. Kuratowski’s theorem. connectivity. 2. tournaments. graph enumeration. block design and error correcting codes. D. BOOKS 1. MacMillan [India] 4. Prentice Hall 2.Choudum: A First Course in Graph Theory. circuits. Euler tours and Hamiltonian cycles. Introduction Basic concepts. 1-isomorphism and 2-isomorphism. Hadamard matrices. V. depth first search. spanning trees. trees. subgraphs.West: Introduction to Graph Theory. min cut theorems. Note:. networks.A. vertex. Combinatorics Basic combinatorial numbers. degrees.Tech Computer Engg. shortest path algorithms. recurrence relations. test for planarity. edge coloring. chromatic polynomial. paths. Wiley.

Data Mining Introduction. Silberschatz. OODBMS. 2002 . similarity search over sequences. storing data in a distributed DBMS. clustering. mobile databases main memory databases. International Ed. objects & reference types. 4. 3. Ramakrishnan & J.Tech Computer Engg. C. J. 3. distributed concurrency control. Gehrks Database Management Systems MGH.. Addison Wesley. 2001. design for an ORDBMS. inheritance. comparison of RDBMS with OODBMS & ORDBMS.. introduction to distributed transactions. parallel zing individual operations. counting co-occurrences. Sudershan: Data Base concepts. Introduction to distributed databases. Object Database Systems User defined ADT. mining for rules. integrated access to multiple data source. updating distributed data. challenges in implementing an ORDBMS. Date. Database Systems. 2. GIS. R. 2. distributed query processing. MGH.42 - . distributed catalog management. Parallel query evaluation. BOOKS 1. tree structured rules. 7th Ed. Pearson Education. distributed DBMS architectures. Parallel & Distributed Data bases Architecture for parallel databases. Advanced Topics Advanced transaction processing. temporal & sequence databases. Korth. structured types. parallel query optimization. multimedia databases. 2000. B. 2000. recovery.Advanced Database Systems COT-346 (Departmental Elective I) L 3 T 2 P - Theory: Sessional: 100 50 1.

Generator Induction. Generators. Axioms. Communicating Sequential Processes (CSP) Parallel commands. Essays in Computing Science. various commands. Interrupts. Subroutines and data representation. B. Dining Philosophers Problem. Design of Properly terminating constructs. TMH.Tech Computer Engg. The Science of Programming. 3. David Gries. Coroutines. Integer semaphore. Inference Rules.Logic of Programming COT-348 (Departmental Elective I) L 3 T 2 P - Theory: Sessional: 100 50 1. Precedence rules. Hoare and Jones. Formal Systems. Reasoning using Transformations.43 - . Two Theorems. A Discipline of Programming PHI 3. Quantification. Procedure call. Semantics Predicate Transformers. Note: At least two questions will be set from each unit.W. Monitors and scheduling. Predicates. spin locks. 2. 2002 . Free and bound identifiers. System definition. Alternative and Iterative commands. Dijkstra. The semantic characterization of programming language. Euclid’s Algorithms. Narosa Publishing House 2. Data Values & Types. BOOKS 1. Fundamentals Propositions. Tautologies. The characterization of semantics. E. definedness condition. semantic definitions of functions.

composite and other transformation.Tech Computer Engg. mouse. Case Study of Graphics. 2. Addison Wesley. view planes. 5. Graphics System design.44 - . Raster graphics systems. Folay: Fundamentals of Interactive Computer Graphics.Computer Graphics COT-350 (Departmental Elective I) L 3 1 2 3. Kernel System. light pen. Line drawing display. Positioning technique. Coordinate System. 3-D Graphics Curve and Surfaces. Hidden Surface elimination. polygon clipping. MGH 3.. 6. Computer Graphics Devices Point and positioning drive. and character recognition. B. Harrington: Computer Graphics – A Programming approach. priority algorithm. BOOKS 1. Graphics Systems Device Independent graphs system. Circle generators. Bezier and B-spline method. perspective depth. 7. PHI. Interactive Raster Graphics Raster graphics fundamental. storage tube display. scan line coherence and area coherence algorithm. tablet. text clipping. homogenous coordinate system. Rogers: Principles of Computer Graphics. solid area Scan Conversion. Interactive raster graphics. Point and line clipping. T 2 P - Theory: Sessional: 100 50 Basic Concept Introduction. Point Plotting technique. depth buffer algorithm. 4. 2002 . 8. refresh line drawing display. Hearn and Baker: Computer Graphics: 2nd Ed. Input technique. Newmann and Sproull: Introduction to Interactive Computer Graphics. Line drawing algorithm. 2-D and 3-D transformation Basic transformation.

scope and its relationship with software quality: software testing testing techniques: white box testing. .Software Reliability. reliability modeling-exponential failure time models (viz. software testing strategies – unit testing.Software Quality: Concepts and Plan. Musa’s basic executionj time model. Books 1.Concepts of Reliability. software quality factors.Software Quality and Reliability COT-352 L 3 T 2 P - Theory: Practical: 100 50 1. hyperexponential model). clean room software engineering. and black box testing etc. software quality metrics. control structure testing. Software Quality Meaning and scope . Prediction and application. ISO 9001 and SEI-CMM standards of software quality assurance 2 Software Reliability Meaning and its relation with software quality . 4. By Lohn D Musa. 7. 3 Software Testing Meaning. statistical quality assurance. relationship between quality factor and quality metrics. McGraw Hill 3.Software Reliability Engineering By Michele R Lyu. 6. integration testing. Weibull model and S-shaped reliability growth model) . quality management systems. By William E Perry.Effective Methods of Software Testing. 2002 . Wiley. By K K Aggarwal.45 - . B. Jelinski Morana model. Prentice Halll International. and infinite failure category models (viz. Weibull and Gamma failure time models ( viz. By H Koptez. basis path testing. By L Srinath. software reviews. 5. 2. Schneidiwind’s model. By Robert H Dunn. geometric model. At least two questions will be set from each unit. NOTE There will be 8 questions in all. validation testing and system testing etc. McGraw Hill. Musa – Okumto model).Software Reliability : Measurement.Software Reliability. Duane’s model. formal technical review.Tech Computer Engg. correctness proof.

Web-Server. 2. FTP. Firewall. Kerberos. Note:. protocol & application). Frontpage extensions support for Apache.Tech Computer Engg. O’Reilly. IP masquerading. Advanced routing techniques. Web Services The Apache Web Server.46 - . Intranet Technologies Internet Technologies integrated with LAN technologies. The Linux Private Groups for users on the system. Frontpage Extensions. Novell Directory Service. rsh. Charles Aulds. IP/IPv6 addressing. NIS+. IDG. Printing and file Services. 3. (Tech. Virtual Hosts.Internet and Intranet Engineering COT-401 L 4 T 1 P - Theory: Practical: 100 25 1. Network Address Translation. Security and Control TCP wrappers. NSAPI. 4. IP chains. Windows 2000 Complete Reference TMH. Microsoft Active Directory Service. LDAP. IP datagram Routing and Upper Layer Protocols: CIDR. TMH. Authentication. Java Servlets Support through Tomcat as DSO module of Apache. ARP Tables. Routing. BOOKS 1. Sybex. Introduction Introduction to Internet and Intranet. 6. Superserver xinetd. Netware. Distributed File Services (WinNT). Network Operating Systems: Introduction to Linux. Proxy Servers: Hardware and Software. Pluggable Authentication Module (PAM). IIS web server. Internet & Intranet Engg. Net-News. IPv6 Protocol. Fast-CGI. 4. Daniel J. Unix/Linux File Permissions Model. Windows NT/2000 service models. 2002 . MGH. rcp. UDP. Linux Apache WebServer Administration. Review of TCP/IP model. How DNS Works 2. 5. auth_ldap. SSH. Netware 5 Complete Reference. NFS.. rlogin. SSH. Application Support: CGI. Telnet Protocols.At least one question will be set from each unit. Barrett and Richard Silverman. IP datagram. The Secure Shell: The Definitive Guide. FTP. Mobile routing. B. IP/IPv6 addressing. mod_perl. Daniel Minoli. PHP4. The WindowsNT domain+user model of authentication. SMTP. 5. 3. Red Hat Linux Bible. Multicasting. HTTP. File and other Directory Services File Servers: SMB Protocol. Centralized Services Model. ISAPI. E-Mail.

Bhurchandi. A. concept of descriptor table.Tech Computer Engg. 80286. 2. 4.K. Advanced Microprocessors & peripheralsArchitecture. paging and its working. PHI. 2002 . Intel. Memory management models. Memory Management Modes of operation of P II/ P III – real. instruction set and prefixes. exception handling. 80186/80188. interrupt handling. Intel. 80486. 80386. Instruction Basic data types in P II/ P III. B. performance measurement.Microprocessors II COT-403 L 3 T 1 P - Theory: Sessional: 75 25 1. Advanced Concepts Branch prediction. Ray & K. protected and virtual. The 8086/8088. Pentium Processor Data Handbook.M.Architecture. 3. registers and flags. Pentium & Pentium Processor .Two questions will be set from each unit. 2. superscalar architecture. MMX – register and instruction set. 3. Programming and Interfacing.47 - . Intel Microprocessors. segmentation and its working. BOOKS 1. optimization. addressing modes. 1999. Programming & Interfacing: TMH. instruction format and types. Pentium Architecture Basic architecture of P II/ P III. Note:. Bray.

renewal model of program behaviour. Probability Generating Function. Statistics with Reliability. Poisson. Sample Space. Khanna Publishing. at least one question from units II. 1976. Probability mass function. Trivedi. Gamma. III and IV and at least two questions from unit V. Binomial. Some discrete distributions (Bernoulli. 4. Queuing Systems. Wiley Eastern. 3. Poisson. BOOKS 1.There will be at most one question from unit I. Distribution of times between state changes. Normal). Expectation Introduction. Discrete random vectors. 4. Note:. Kleinrock. Independence of Events. PHI. Hayes. John Wiley. Feller. Markov Chains Computation of n-step transition probabilities. graphical methods of representing events. Modeling of Computer Communication Networks. State classification and limiting distributions. Functions of random variables. their algebra. Hypergeometric and Uniform).Statistical Models for Computer Science COT-405 L 4 T 1 P - Theory: Sessional: 100 25 1. pdf and expectation. 5. Continuous random variables: some continuous distributions (Exponential. Expectation of functions of more than one random variable. B. The Poisson process. Erlang. Analysis of program execution time. and their event spaces.Tech Computer Engg. Introduction Probability Models. Conditional probability. Non-Birth-Death Processes. M/G/1 queuing system. W. An Introduction to Probability Theory and its applications. Stochastic Processes Classification of stochastic processes. The Bernoulli process. 2. Queuing and Computer Science Applications. Probability. Geometric. Discrete parameter Birth-Death processes. 2001. Events.48 - . Bayes’ Rule and Bernoulli Trials 2. 1975. Negative Binomial. jointly distributed random variables. J. Binomial. Normal). K. Delhi. Hyperexponential. Irreducible finite chains with aperiodic states. Continuous parameter Markov Chains. 2 vols.. Probability Axioms and their applications. Random Variables Random variables. Brief introduction to Conditional pmf. Moments. 3. Moments and transforms of some distributions (Uniform.F. Birth-Death process with special cases. Bernoulli. renewal process. L. Computation of mean time to failure. Gamma. 2 vols.S. 2002 . Exponential. Distribution functions. Geometric.

B. Layout of Installation of LAN with S/W & H/W requirement. 10 base 5. 5. 10. 2. 4.Computer Networks (Pr) COT-411 L - T - P 3 Practical: Sessional: 50 50 1. UTP OFC) 8. 3. Study of bridge. 10 base 2. Study of various topologies of Network RJ-45 connector and its circuit diagram BNC connector and its circuit diagram Thick & Thin coaxial cable. 9. CKT diagram of network interface card. 7.Tech Computer Engg.49 - . CKT diagram of terminator CKT diagram of T-connector Study pf different type of cable in designing (10 base 7. hub. gateways. router. 2002 . 6.

4. Write a program to find factorial of a number. Write a program that generates a large number of data cache misses and compare its results with a program having large number of hits. store that number in EAX register and display it digit by digit. 1. 5. where result does not exceed 64 bit. 6.Microprocessors II (Pr) COT-413 L - T - P 2 Practical: Sessional: 25 25 Note: Using 32-bit processor and assembler develop programs.50 - . Repeat exercise 2 for 64 bit number using two 32 bit registers.Tech Computer Engg. Write a program to read a 32-bit integer. Sort n 32-bit numbers using modular program. 3. 2. Write modular program to perform addition. Use procedure to calculate factorial and pass parameters. multiplication and division of two 32-bit numbers. Repeat exercise 6 for code cache. 2002 . B. subtraction. 7.

Tech Computer Engg.B. 2002 .51 - .

software processes. Artifacts of the process. Checkpoints of the process. NOTE There will be 8 questions in all. Process automation. 4. elaboration.Project management 2/e .Tech Computer Engg. Process discriminants. Conventional Software Management. management artifacts. Workflows of the process. Addison Wesley. Software Management Disciplines Iterative process planning. At least two questions will be set from each unit.: Life cycle phases. Books 1. management indicators. Maylor. 2. construction and training phase. team effectiveness. Project organisations and responsibilities. 3. Walker Royce.Software Project Management COT-441 L 3 T 1 P - Theory: Practical: 75 50 1. Software Management Process Framework.the artifact sets.Managing the Software Process.inception. B.2001. engineering artifacts. Model based software architectures. 2002 . pragmatics artifacts.core metrics. Project control And process instrumentation. TMH. life cycle expections. Improving software economics: reducing product size. Principles of modern software management. 2. automation through software environments. Evolution of software economics. 1998. Ramesh.52 - . Humphrey.Software Project management.Managing global software Projects. 3.

DSW Algorithm. Vertex Method. Equivalence and Logical Proofs. Classical predicate logic. Inductive Reasoning.Fuzzy Logic COT-443 (Departmental Elective II) L 3 T 1 P - Theory: Sessional: 75 50 1. Uncertainty and Information. other forms of the composition operation. Angular Fuzzy sets. Mapping and Relations. Klir and Yuan. 2. Uncertainty in Information. Fuzzy Sets. Deductive Inferences. Note:. Tautologies. Membership value assignments. Fuzzy Logic with Engineering Applications. uncertainty and impression. 2002 . Max-Min method. Approximate Methods of extension. Contradictions. properties. Restricted DSW Algorithms. Crisp Equivalence Relation. Value Assignments. Fuzzy sets and Membership. Lambda-Cuts for Fuzzy Sets. B. BOOKS 1. Fuzzyfication. 3. Equivalence. Comparisons. Klir & Folger. 3. other similarity methods. properties. Sets as points in Hypercubes.Tech Computer Engg. Fuzzy Numbers. Classical Sets – Operations. Functions of Fuzzy Sets. 2. Lambda-cuts for fuzzy relations. Arithmetic and Logic Extension Principle. Fuzzy Cartesian Product and Composition. Noninteractive Fuzzy Sets. Crisp functions. other forms of the implication operation. PHI. Tolerance and Equivalence Relations. Exclusive Oral Exclusive Logical proofs. Timothy J Ross. Standard forms and biyearlies. Fuzzy Transform Practical Considerations. Fuzzy Logic. Fuzzy Sets & Fuzzy Logic-Theory and Applications. Rank Ordering. Intuitions. Crisp relations – cardinality operations. Chance versus Ambiguity. Fuzzy Tautologies. Defuzzification Methods. Fuzzy Relations – Cardinality operations. Cosine amplitude.53 - . Genetic Algorithm. Statistics and Random Processes. Neural Networks. Introduction Background. PHI. Deductive Proofs. Fuzzy Tolerance and Equivalence Relations. Contradictions. Interval Analysis in Arithmetic. Inference. Approximate Reasoning. Membership Functions – Features. Relations and Functions Cartesian Product. mapping to classical sets to functions. MGH. Fuzzy Sets – Operations and Properties. Properties. Crisp Tolerance Relation. composition.Two questions will be set from the unit 1 and three questions will be set from unit 2 and 3 each. Fuzzy Vectors.

Tech Computer Engg. 2-D Mesh SIMD model. Elementary Parallel Algorithms Classifying MIMD algorithms. Language constructs. The Design and Analysis of Parallel Algorithms. Parallel Algorithms for irregular problems .At least one question will be set from each unit. Matrix Multiplication Sequential matrix multiplication. Control parallel approach. Merging two sorted lists. Brassard and Bratley. Bitonic merge. Programmers model. lower bound on parallel sorting. Pipelining Vs Data parallelism. Shuffle-Exchange SIMD model. Kluwer Academic Publishers. PH International. Afonso Ferreira and Jose’ D. Control parallelism. 4. Deadlock. OCCAM. Akl. C-LINDA. List ranking. Dynamic Load Balancing on multicomputers. Algorithms for multiprocessors. Fundamentals of Algorithms. Hypercube SIMD model.Parallel Computing COT-445 (Departmental Elective II) L 3 T 1 P - Theory: Sessional: 75 50 1. Language features. Static scheduling on UMA multiprocessors. Odd-even transposition sort. 2. programmer’s model. 3. Example and application. Rolin. MGH. Data parallel approach. UMA Multiprocessor model. Selim G. Random read and random write. Language constructs. Graph coloring. PHI. Introduction Parallel processing terminology. Sample program. Michael Quinn: Parallel Computing-Theory and Practice. Problems defying fast solutions on PRAMS 3. Mapping and Scheduling Mapping data to processors on processor arrays and multicomputers. Algorithms for multicomputers 7. Quick sort based algorithms. Algorithms for processor array.Prefix sums. Broadcast. Data parallel approach with I/O 2. BOOKS 1. Note:. Sorting Enumeration sort. Scalability. Parallel Programming Languages Programming parallel processes. P. PRAM Algorithm Parallel reduction . Reducing the number of processors. Sample program. Sample program 4. Ed.State of the art. Prefix sums 6. Preorder tree traversal. Reduction. 2002 . 5. C* programmers model. New Delhi B.54 - .

Image Observation Models. Sampling Aperture. Causality and stability. Transform Operations. Image Segmentation. Reconstruction from Projections. orthogonal and unitary Matrices and Kroenker product. Image Enhancement and Restoration Point Operation. Image Quantization Uniform Optimal Quantizer. Commander Design Visual Quantization 2. Spatial Operations. Image Transforms Two Dimensional Orthogonal and Unitary Transforms and their properties. One Dimensional Causal Models. Coding of Image. Transforms and their properties. Transform Coding Theory. Productive Techniques. Pixel Coding. Band Limited Image Sampling Versus Replication. Histogram Modeling. Inverse and Wiener filtering. Image sampling quantization. Properties of Mean Square Quantizer. Sampling Theorem for Random Fields. 3. BOOKS 1. Non Causal Representation Spectral factorization. Approximation to KI Transforms. Image Decomposition. FIR Wiener Filters. Note:. AR and ARMA models. region and moment representations structures. Sampling Optimal Sampling. Coding of two-tone image.Tech Computer Engg. Filtering using Image Transform Causal Models and recursive filtering Maximum entropy restoration. Gonzalez Woods: Image Processing B. Lang range Interpolation. Toeplit and Circulate Matrics.Question-paper will contain at least two questions from each unit. Extrapolation of band limited signal.55 - . Moire Effect. 2002 . IIARR and KI. Slant. Markov Processes KI Transform Mean square Estimates and Orthogonal Principles. Image representation by stochastic models. Introduction Image Processing Fourier Transform and Z-Transform. Display Aperture/ Interpolation Functions. 4. Reconstruction of Image from samples Sampling Theorem. Nonrectangular Grid Sampling. Edge detection and boundary extraction Boundary. One Dimensional and Two Dimensional DFT Cosine and Sine Transforms Iiadmard.Image Processing COT – 447 (Departmental Elective II) L 3 T 1 P - Theory: 75 Sessional: 50 1. Texture. Multispectral Image Enhancement. Image Analysis and Image Compression Spatial feature extraction. Anil Jain: Digital Image Processing 2.

design considerations. BOOKS 1. Plasma etching techniques and equipment. 6. Di-electric and Poly-Silicon Film Deposition: Deposition Processes for Poly. diffusion apparatus. Feature Size control and anisotropic etching. S. Sputtering.VLSI Technology COT-449 (Departmental Elective II) L 3 T 1 Theory : 75 Sessional: 50 1. SiO3N4. Mc Graw Hill (1988) 2. Oxide Properties. Czochralspi crystal Puller. Assembly & Packaging : Package Types. Crystal Growth MGS. Plasma assisted Depositions. X-ray Lithography. Silicon shaping.Tech Computer Engg. Physical Vapour Deposition. Oxidation Techniques. Choices. Lithography: Photolithography. Epitaxial Layer evaluation. n MOS IC fabrication Process Sequence.Sze VLSI Technology. E-beam lithography. Metallization Metallization applications. diffusion mechanisms. B. Range Theory. Oxidation induced Defects. Future trends. Ion Implantation: Introduction. Metallization Problems. Diffusion of Grp3 and 5 impurities in Silicon Impurity Sources. 4. Package fabrication technologies.Ghandhi VLSI Fabrication Principles. Diffusion A Qualitative view of atomic diffusion in Solids. Oxidation Thermal Oxidation Kinetics. Note:. 3. Molecular Beam Epitaxy. Wafer Preparation.M.K. Implantation Equipment Annealing. SiO2. Reactive Plasma Etching Plasma Properties. 2.At least one question must be from each unit. S. Characterization of diffused layers.Si.56 - . 2002 . Epitaxy: Vapour Phase Epitaxy. Fick’s one dimensional diffusion equation.EGS. 5. Isolation Techniques Bipolar IC fabrication Process Sequence. constant source and limited source diffusion.

Note:. S/W Testing Introduction. Ian Sommerville. Data dictionaries. Software Engineering – A Practitioner’s Approach. 4th Ed.Fundamentals of Software Engineering COT-471 (Open Elective I – For branches except CO.57 - . 6. approaches to problems analysis. 2. spiral model. Yogesh Singh: Software Engineering. 5. Tata-MGH. Pankaj Jalote. SRS. function oriented design. IT) L 3 T 1 P - Theory: Sessional: 75 50 1. 4. 7.Aggarwal. An Integrated Approach to Software Engineering 2nd Ed. object diagrams. specifying behavioral & non behavioral requirements. reverse engineering. maintenance process. Functional testing. activities during testing. R. S/W Design What is design? Modularity. strategy of design. structural testing. estimating number of residual errors. 2001.Tech Computer Engg. calendar time component. B. basic.There will be 8 question in all.K. 4. Pressman. S/W Reliability Importance. 5th Ed. object oriented design.. testing tools. size metrics. There will be max 1 question from unit 1 & unit 6 each and minimum 1 question from each of remaining units. reliability concepts. K. waterfall prototype evolutionary. data structure metrics. logarithmic Poisson. Narosa Publishing. S/W Metrics Introduction. micro models. New Age International Ltd. Introduction Introduction to S/W crisis & S/W processes. BOOKS 1. metric analysis. 3. Software Engineering. types of maintenance. re-engineering. information flow metrics. reliability models – macro. 2. entropy based measures. 2002 . S/W Maintenance Introduction.S. S/W reliability & H/W reliability. Addison Wesley. debugging. S/W life cycle models Build & Fix. ER diagrams. failures & faults. Attempt any 5 questions. 3. Requirement Analysis & Specifications Problem Analysis – DFD. reliability allocation. maintenance models. 2000.

Relational Model Introduction – Relational Model. Addison Wesley. 3. THM. Korth & S.Tech Computer Engg. tuple calculus. Problems of distributed processingquery processing. relational calculus. A Silberschatz. base tables & views. Indian Edition. components of DBMS.58 - . Date: An Introduction to Database Systems 7 th Ed. MVD & 4NF. Sudarshan: Data Base System Concepts. foreign key. BCNF. primary key. Data independence. 3NF. Majumdar and Bhattacharyya: Database Management Systems. 4. DBMS. Normalization procedure.At least one question will be set from each unit and three from unit 2. H. Note:. MHG. fundamental principles. internal level.L 3 T 1 P - Fundamentals of Database Systems COT-473 (Open Elective I – For branches except Co. A. concurrent executions. alternate keys.J. concurrency control. BOOKS 1. Data Base Design – Introduction. Concurrency Transaction concept. candidate keys. 3 levels of architecture.K. Relational Models. Basic Concepts What is database system. deadlock handling. Integrity rules. 2. Networks data model. mapping DBA. domain calculus. 2NF. Hierarchical Model. Non-loss decomposition and functional dependencies. 1977. semantic data model. recovery control. Basic Definitions. transaction state. C. 2002 . B. 1996. Distributed Data Bases Introduction. 1NF. Data Models. serializability lock based protocols. IT) Theory: 75 Sessional: 50 1. other normal forms. 3. JD & 5NF. relations. relational Operators – relational algebra. why database. external level. domains.F. catalog management. objectives. updates propagation. validation based protocols. conceptual level. 2. organization of databases. timestamp based protocols.

3. SCSI standards. maintenance and troubleshooting guide B.The complete reference. Memory Memory. power supply quality and specification.59 - . input-output ports. BPB publications. USB. motherboard controllers and system resources. troubleshooting Video adapters.K. 2. on board I/O devices. memory chips & modules. DVD ROM drive. 5. IDE interface: ATA standards. master-slave configuration. keyboards.At least one question must be set from each unit. power protection and backup. Craig Zacker & John Rourtre: PC Hardware. AGP. 2002 . trouble-shooting drives and peripherals. ROM POST. CD ROM drive. 2. 3. Motherboard PC family tree. PCI. which is better SCSI or IDE.Tech Computer Engg. hard disk drive. IRQ. Device drives and peripherals Floppy disk drive. serial ports. BOOKS 1. EISA. Power Supply Power supply function and operation. UPS. ROMBIOS. Chauhan: PC Upgrading. 4. record able drives. Dr. data transfer mode. Note:. parallel ports. CMOS setup. IT) L 3 T 1 P - Theory: Sessional: 75 50 1. MCA. backup power system. I/O bus system: ISA. troubleshooting memory. SCSI interface: SCSI bus. Video adapters.For branches except Co. mice. TMH. VESA local bus. troubleshooting power supply. S. Interfaces and I/O Ports Floppy disk interface.Fundamentals of Computer Hardware Technologies COT-475 (Open Elective I . memory types. Mark Minosi: The complete PC Upgrade & Maintenance Guide 4/e. printers and monitor. PCIX. advanced memory technologies.

application of cut-fail combination. logic family. 2002 . method of substitution. 3. Dempster-Shafer theory of uncertainty management. Certainty factor based reasoning. SLD resolution. Case study of Truth Maintenance System (TMS). specificity. conditional probability. Recognize-act cycle. Fuzzy post inverse. Fuzzy Inversion. SLD tree. unification of goals. Predicate Logic Alphabet of First order logic (FOL). resolution Robinson’s inference rule. Evolution of Computing. backward chaining.60 - . subject area. 5. well formed formula. 8. Romantic and Modern period. implementation of backtracking using stack. Unification of predicates. Default and Non monotonic Logic Axiomatic theory. forward chaining. Architecture of production system. flow of satisfaction. Classical. controlling back tracking using CUT. OR graph. clause form. risk of using cuts. reasoning with NML-II. 7. Propositional Logic Proposition. program for scene interpretation. Classification of logic. standard theorems. Scene interpretation using predicate logic. Probabilistic techniques.At least one question will be set from each unit. The working memory. Introduction Definition of AI. Horn clause. refractoriness. non-atomic reasoning using McDermott’s NML-I. Imprecision and Uncertainty Definition. Semantic method of theorem proving. B. theorem proving using Wang’s algorithm. problems with NML-I. 2. fail predicate.Artificial Intelligence COT-477 (Open Elective I – For all branches) L 3 T 1 P - Theory: Sessional: 75 50 1. unification algorithm. AND-OR graph. Intelligent Search Technique Heuristic function.Tech Computer Engg. 6. algorithm for writing sentence into clause form. Logic Programming with Prolog Logic program. Production System Production rules. A* algorithm and examples. Architecture of AI machines. inverse Fuzzy relations. belief interval. medical diagnosis problem. alternative approach for conflict resolution by meta rules. Bayesian belief network. 4. replacing cut-fail by not. Baye’s Theorem and its limitations. Neural network fundamentals. predicate. Monotonicity Vs Non-Monotonicity. conflict resolution strategies. common use of CUT. Heuristic search. History of AI. tautologies. Theorem proving. propagation of belief. Note:. Recency. Fuzzy relation.

USA. E. 2002 . 2. McDermott: Introduction to Artificial Intelligence. Rich and Knight: Artificial Intelligence. Elline and Rich: Artificial Intelligence. 4.Tech Computer Engg. B. 2/e 1992. Konar: Artificial Intelligence and Soft Computing--Behavioral and Cognitive Modeling of Human Brain. 3.61 - .BOOKS 1. CRC Press.Charniak and D. A. Addison Wesley Longman. 2/e 1992.

Basic XML. Positioning with Style sheets. The Common Gateway Interface. Organizational Challenges. Designing Elegant Navigation Systems. Process of Web Publishing. Images as Buttons. Retrieving the contents of a an HTML form. Embedding XML into HTML documents. Structure of HTML documents. Searching your Web Site. 2. Anchor Attributes. JSP Objects and Components. Other binary Formats. To Search or Not To Search. Coding Guidelines. B. Information Architecture The Role of the Information Architect. Grouping Content. XML for Data Files. Searching Systems. New and emerging Form Elements.62 - . Converting XML to HTML for DISPLAY. Dynamic HTML and Web Designing HTML Basic Concepts. Style Sheets. Basic Interactivity and HTML: FORMS. Architectural Guidelines. 3. HTML and other media types. Video Support. Using Application Objects and Events. Valid Documents. Ways to use XML. Cookies. Good Web Design. Alternative Technologies. Organizing Web Sites and Intranets. The future of XML. Advanced Layout: Frames and Layers. Creating Cohesive Organization Systems Designing Navigation Systems. CGI Output. Rewriting HTML as XML. HTML Elements – Core attributes. Layout with Tables. Phases of Web Site development. Fonts. Proxies. Retrieving a Query String. Form Control. Designing the Search Interface. Image Maps. The CGI Environment. HTTP. Browser Requests. Linking in HTML. Design Sketches. High-Level Architecture Blueprints. JSP: Request and response objects. Image Preliminaries. Note:. Core Events. Introduction to Layout: Backgrounds. Collaboration and Communication. Java Server Pages Basics. Audio Support in Browsers. Integrated Navigation Elements. Form Tags. Language attributes. configuring and troubleshooting. CGI using PERL Introduction to CGI. XML Relationship between HTML. 5. Decoding Form Input. Types of Navigation Systems. Architectural Page Mockups. 4.At least one question will be set from each unit. Forms and CGI. Conceptual Design. Integrating Scripts in JSPs. Indexing the Right Stuff. The Hypertext Transport Protocol. Semantic Linking Meta Information. SGML and XML. Working with Beans. Displaying XML using CSS and XSL.Tech Computer Engg. Image Download Issues. URLs. Efficiency and Optimization. Sending Data to the Server. Text Level Events. Block Level Events. Server Responses. Colors and Text. Remote Navigation Elements.Web Engineering COT 402 L 4 T 1 P - Theory: Sessional: 100 50 1. Images and Anchors. Environment Variables. Linking Basics. Creating and Reading Cookies. Content Negotiation. Organizing Information. 2002 .

2002 . PHI.Tech Computer Engg. Web Technology. XML in Action. Tata McGraw Hill Publications. James Snell. Scott Guelich. HTML The Complete Reference. Jeff Kaneshki. 6. 5. O’ Reilly 4. Kim Daniels. Techmedia Publications. B. Pardi. PHI. Yong. Shishir Gundavaram. Gunther Birzniek.63 - . Pavel Kulchenko. CGI Programming with Perl 2/e. Rebecca Taply. Doug Tidwell. Stuven Mulder. 2. XML Step by Step. O’Reilly 3. Programming Web Services with SOAP. Web Authoring Desk Reference.BOOKS 1. Aaron Weiss. Thomas A Powell.

Addison Wesley. Parsers. B. 5(ii). Lexical-phase errors.Tech Computer Engg. postfix notation. TMH. storage allocation in FORTRAN storage allocation in block structured language.R. representing scope information. J. and Ullman J. Error Detection And Recovery Error. peephole optimization. and triples.D. Introduction to System Software Introduction and types of assemblers. Run Time Storage Administration Implementation of a simple stack allocation scheme. different states in the construction of a compiler. a machine model. compilers and translators. implementation of L R Parsing tables. Aho A. 3(ii). BOOKS 1.64 - .phase errors. register allocation and assignment. syntactic. problems in code generation. Automatic Construction of Efficient Parsers L. predictive parsers. Principles of Compiler Design. global data-flow analysis. semantic errors.precedence parsing. loop optimization. quadruples.Compiler Design COT-404 L T P 4 1 - Theory: Sessionals : 100 25 1. implementation of block structured languages. 2. 5(i). three address code. top-down parsing. 4(ii). Constructing LALR parsing tables. Syntax-Directed Translation syntax-directed translation schemes. linkers. Note:. 6(ii).R. Donovan. implementation of syntax directed translators. Parsing tables. Introduction To Code Optimization The principle sources of optimization. the canonical collection of L R (O) items. 6(i). 2. code generation from DAGs. the structure of a compiler. 2002 .At least one question will be sent from each unit. a simple code generator. construction of SLR parsing tables. value number and algebraic laws. 4(i). operator. Boolean expressions. System Programming. Code Generation Object programs. shift-reduce parsing. data structures for symbol tables. 3(i). intermediate code.V. loaders. translation of assignment statements. Basic Parsing Techniques Parsers. the DAG representation of basic blocks. Lexical Analysis Design of lexical analyzer. parse trees and syntax trees. constructing canonical L. control statements. Symbol Tables The contents of a symbol table.

Create your own page with your favourite hobbies. Your storyboard should cover all the features that you plan to have on the site. D. 2.Tech Computer Engg.65 - . Chalk out the storyboard and design of Dairy Food Limited. 2002 .M. David Gries: Compiler Construction for Digital Computer. As the name reflects your site provides dairy products and aims at opening an online store. 4. Web Engineering (Pr) COT-412 L - T - P 3 Practical: Sessional: 50 50 1. B.3. Dhamdhere: Compiler Construction-Principles and Practice McMillan India.

 The middle section should be 70% of the browser window. Or section and so on. face and color.  Align Text. B.Tech Computer Engg. 4.3. 5. 7. 8. Each menu item or section of the table of content should load a different web page. Name this frame title. Create a web site for your College. type. Use Microsoft’s Personal Web Server to set up your website. For example.  Customize the message text as per your page requirement.  Remove underlines from hyperlinks. 2002 . Create pages for each section. 10.192. such that the respective HTML page of the city/state is displayed when the user selects an area. For the lowermost section. create page that loads the content into the middle section. Create a web page. The topmost section should contain a page describing the web page itself. Create a frameset that is divided into three sections. each city/state on the image using image map. Name this section as menu. Use Stylesheet to modify the following:  Change background to modify the following.171)  Experiment with changing the scrolling speed.66 - . Name this frame title. 6. Create a Menu or a Table of content web page.  Change font. The frameset should have three zones. if the user clicks on Menu one or section 1 then the link should take him to respective menu html.  the topmost section of the frameset should take up about just 15% of the browser window. Add the tickertape applet to your page by customizing it for the following settings:  Increase the count by one.  Change the text color to (237.  The lower most sections should also be about 15% of the browser window. 9. Incorporate a quest book into the Dairy Food Webpage and use Java Script to build validations into the form.  Accordingly update the message count. which displays the map of your Country Link.

2002 . system architecture type. motivation. log structured file system. 3. motivation. B.Galvin. selection of a suitable load sharing algorithm. Wiley. tree based algorithm.G. 5. 2. design issues. TMH 2001. P. Communication primitive. Mukesh Singhal & N. Note:..At least on question will be set from each unit BOOKS 1.S.. issues in load distribution. 4.S.67 - . A S Tanenbamn: Modern operating systems. A generalized non token based algorithm. Broad cast algorithm. issues in distributed O. Ricart algorithm. non token based algorithm. token based algorithm.Tech Computer Engg. Shivaratri: Advanced concepts in operating systems. Lamport algorithm. Architecture of distributed O. PHI. Control organization. Distributed dead lock detection Introduction. Distributed mutual Inclusion Introduction. dead lock handling strategies. Introduction. G. Distributed file system Introduction. comparative performance analysis. 2. 3. Mackawa’s algorithm. Silberschatz. stabilizing load distribution algorithm. distributed & hierarchical detection algorithm. issues in deadlock detection & resolution.Distributed Operating Systems COT-440 (Departmental Elective III) L 3 T 1 P - Theory: Sessional: 75 50 1. Distributed Scheduling Introduction. issues in task migration. requirement for load distribution. task migration.Gagne: Applied operating system concepts. classification preliminaries simple solution. centralized. A. performance comparison. component of load algorithm. Heuristic algorithm. architecture mechanism for building.

COCOMO model. 3. 2. Henderson Sellers: Object Oriented Metrics – Measures of Complexity. modularity and information flow attributes.Software Project Measurement COT-442 (Departmental Elective III) L 3 T 1 P - Theory: Sessional: 75 50 1. 2002. PH PTR. B. 2. 2001. length. S/W quality.K. 2002 . reuse. BOOKS 1. Yogesh Singh: Software Engineering. Object-Oriented Design Measurement Cohesion & Coupling Consideration. S. types of structural measures. functionality.E. K.Tech Computer Engg. Fenton. different types of each of these couplings & their measurements. object oriented metrics.method. Pfleeger: Software Metrics 2/e.Aggarwal. complexity. risk management. inheritances. measuring external product attributes. New Jersy.L. S/W configuration management.Atleast two questions will be set from each unit. data structure.68 - . types of each of these Cohesions & their measurements. Component. Cohesion. class. Delphi model. measuring aspects of quality. 1996. Coupling – interaction. Note:. COCOMO II model. Internal and External Attribute Management Size. inheritance. Software Project Planning Cost estimation models single use multi variable. Thomson Asia. N.modeling. 3. control flow structures. Putnam model. New Age International Ltd.

Tech Computer Engg. traversal. Question answering and Inference Question answering. classes and inheritance. implementing PATR in Prolog. active charts. top down and bottom up parsing. 7. role of knowledge. representation and traversal of FSTN in Prolog. plausible inference and defaults Note:. Gerald Gazdar and Chris Mellish: Natural Language Processing in Prolog. initialization. Benjamin Cummins B. BFS and DFS. representation. feature structures as graphs. implementation of top down and bottom up chart parsers. subcategorization. Finite State Transition Networks(FSTN). 3. storing intermediate results. transitive verbs and quantification. rule invocation. ambiguity. implementing flexible control. translation to a meaning representation language. determinism and lookahead. implementing a lexicon in Prolog. 4.Natural Language Processing COT-444 (Departmental Elective III) L 3 T 1 P - Theory: 75 Sessional: 50 1. the status o rules. standard logical inference. implementation in Prolog.69 - . alternative rule invocation. primitives and canonical forms. Features and the Lexicon Feature theoretic syntax. notation. representation. use of prolog for Natural Language Processing (NLP). Introduction Origin. chart parsing with feature-based grammars. Finite State Transducers(FST). BOOKS 1. preferences and timing. search strategy. computational semantics as feature instantiation. DAGs versus terms 6. imposition. Grammar and Parsing Grammar as knowledge representation. classes of grammars and languages. Recursive and Augmented Transition Networks (RTN) Modeling recursion.At least one question will be set from each unit. evaluating DBQ formulae. implementation. rules of chart parsing. building semantic checking in to the grammar. implementing forwards inference in Prolog. definite clause grammars. structures. implementation in Prolog. representation in Prolog. augmented transition networks. Semantics Compositionality. push down transducers. 5. Addison Wesley 2. the pathological nature of logical inference. meaning as reference. advantage and limitations of RTN. representation of lexical knowledge. limitation of SM. 2. feature structures in Prolog. Well formed Sub-string tables and Charts Well formed substring tables. comparison strategies. subsumption and unification. 2002 . efficiency. words. Allen James: Natural Language Understanding. ambiguity. rules. house keeping.

Winograd. 2002 . Boguraev and Branimir K. Schwartz. Terry: Understanding Natural Language. Briscoe.: Applied Natural Language Processing.Tech Computer Engg. Academic Press. Edward J.3. Petrocelli 5. B. Steven C. Longman/Wiley 4.: Computation Lexicography for Natural Language Processing..70 - .

different types of side chain: relevance to mutation. Genomics: Introduction.71 - .WWW. Computing Evolution: Phylogenetic Analysis Sequence-based taxonomy: Overview and Assumptions. disulphide bonds. Web-based tools for restriction mapping. practical and theoretical problems in sequencing. splicing translation: ribosomes. Computer Tools for patterns. David J. From Multiple Alignment to Phylogeny Neighbor. sequence-Function Relationships Sequence Homology and Conserved Regions. Mathematical tools of proteins and nucleic acids. nomenclature. primary structure: the 20 amino acids . To find sequences based on keywords & phrases. BOOKS 1. 2. outline of proteins. Molecular graphics software and other packages. genome scale sequencing. Genome databases. size. molecular graphics Structure evolution and mutation genetic information. A. pharmacogenomics. G. 1999. 0582327881. secondary sources. SEQNET. polarity. Richard Durbin: Biological sequence analysis: probabalistic models of proteins and nucleic acids. DNA structure Synthesis of proteins: cell biology background. new technologies and new bioinformatics tools. PCR and restriction mapping.Bioinformatics COT-446 (Departmental Elective III) L 3 T 1 P - Theory: Sessional: 75 50 1. Parry-Smith: Introduction to Bioinformatics. comparative and evolutionary genomics. Post-translational processing 2. Cambridge University Press. GenBank..the triplet code.Tech Computer Engg. Introduction to Bioinformatics: Introduction. charge. The challenges of whole genome sequencing. Attwood. NLM. cDNA EMBL database GenBank protein sequence. exons. Krogh. Joining Maximum Likelyhood vs. Bioinformatics tools: Networks . 0521629713 B. mapping and phylogenetic analysis. 3. to grab individual sequences or whole groups of sequences from a database 4. etc. The Molecular Clock. Eddy. CERN EMBnet. start/stop codons. Longman Higher Education. microarrays. Polypeptide geometry: the folding chain.chemical structure & properties: chirality. 2002 . Teresa K. Mitchison. S. Parsimony. introns. Sequence Databases and Sequence Analysis: genomic. proteomics. hydrophobicity. transcription: RNA polymerase. EMBL Database. Development using computer tools for eequencing projects. Conserved DNA sequences. 1999. pattern recognition tools Similarity searching. molecular models. aliphatic/aromatic.

084936664X. 4. Waterman: Mathematical methods for DNA sequences. Michael S. 0471191965. 0596000804. B. 2001.Tech Computer Engg.3. James D. John Wiley & Sons. 1998. 5.F. B.72 - . Tisdall: Beginning Perl for Bioinformatics. Inc. CRC Press.Francis Ouellette: Bioinformatics: a practical guide to the analysis of genes and proteins. 1989. Andreas Baxevanis. O'Reilly & Associates. 2002 .

Comparative study of scheduling algorithms. 5. Introductory Concepts Operating system functions and characteristics. Implementation.: Operating System. At the most one question will be set from section 1. 8. Note:. Director Systems: Structured Organization.S. 2. 2. Device Management Hardware Organization. Virtual memory concepts. Semaphores. File access and allocation methods. B. Wesley. A. Interprocess Communications.Tech Computer Engg.Fundamentals of Operating Systems COT-472 (Open Elective II – For branches except Co. system programs. A. 3.: Operating System Concepts. Prentice Hall of India. Real time systems. Paging. Tanenbaum. Classical process coordination problems and their solutions. Page replacement Algorithms. Distributed systems. multiple processor scheduling. Deadlock prevention and avoidance. directory and file protection mechanisms. Methodologies for implementation of O/S service system calls. CPU Scheduling Levels of Scheduling. Demand Paging. J. Haberman. Peterson. historical evolution of operating systems. Deadlocks Deadlock characterization.5. The student will be required to answer any five. implementation issues. Segmentation combination of Paging and Segmentation.73 - . and atleast one question each will be set from rest of units BOOKS 1.: Introduction to Operating System Design Galgotia Publication.N. Storage Management Storage allocation methods: Single contiguous allocation. Protection Mechanisms and Policies. Hansen: Operating System Principles. New Delhi. Addison. Deadlock detection and recovery. 3. Reading. 4. Multiple contiguous allocation. practical considerations.L.The question paper will contain 8 questions in all. IT) L 3 T 1 Theory: Sessional: 75 50 1. A. & Silberschatz. Device scheduling policies 6. 4. 2002 . Thrashing. File Systems Functions of the system.8. 7. hierarchy of file and device management. Interrupt mechanisms. Concurrent Processes Critical section problem. Brinch.

Layered Architectures Examples. 802. X. 3. BOOKS 1. HDLC. B. Network Topology. Switching Approaches. SNMP. Internet protocols – IP packet. MAC and LAN Protocols Multiple access communication. Service Models and End-to-End requirements.25. Congestion Control techniques. Tanenbaum: Computer Networks. 2002 . Fair Queuing. Subnet addressing. Slotted-ALOHA.4. LAN Bridges. Random Access-ALOHA. ISDN and BISDN 2. CSMA-CD. Transmission media and systems. CSMA.11. Note:. 2. 6. Transmission Control Protocol – TCP. multiplexing and signaling techniques. Traffic management and QoS – FIFO. UDP. 3. 802. TDMA. 802. EC) L 3 T 1 P - Theory: Sessional: 75 50 1. Addressing. Coombs and Fegan: Introduction to data Communications and Networks. Leon Garcia and Indra Widjaja: Communication Networks – Fundamental Concepts and Key Architectures. ARP.802. 3/e. Socket system calls. RTP.S. 1997. OSI Reference Model. TMH. 1999. IP routing.6. William Stallings: Data and Computer Communications 5/e. Overview of TCP/IP architecture. CDMA. Reliable stream service. Channelization – FDMA. IT. Introduction Network Functions. TMH. ARQ.There will be at least one question from each unit. Packet Switching Networks Packet network topology. Sliding Window. TCP/IP Architecture. Reassembly.74 - . Connectionless and Virtual Circuit packet Switching. Priority Queues.Fundamentals of Computer Networks COT-474 (Open Elective II – For branches except CO. Network Services. PHI. Statistical Multiplexing. Peer-to-Peer Protocols Protocols. A. operation. PHI. Channelization in Cellular networks LAN Standards .5. Forouzan. CIDR. protocol.3. 5. Electronic Mail. Routing Algorithms. Datagrams and Virtual Circuits – Structure of Switch / Router. RARP. Error detection and correction.Tech Computer Engg. 4. 2000. PPP protocols. 802. ICMP. 4. FDDI.

Class hierarchy. Use-Case Driven Object Oriented Analysis. Booch Methodology.75 - . Object Oriented Systems Development. A-Part of Relationships-Aggregation. inheritance. Designing Methods and Protocols.Tech Computer Engg. BOOKS 1. Super-sub Class Relationships. Class Visibility. Software development process Object Oriented systems development: a use-case driven approach. al. Class Responsibilities.Object Oriented Software Engineering (Open Elective II . Object Oriented Design Object oriented design process. aggregations and object containment. unified modeling language (UML). 4. object relationships and associations. Object Oriented Modeling and Design. Jacobson Methodology.. Responsibilities and Collaborators. Frameworks. 2002 . 2. 3. Use-Case Model. Patterns. Object Responsibilities. object oriented design philosophy. 1995. 1999. Designing Interface Objects.For all branches) COT-476 L 3 T 1 P - Theory: Sessional: 75 50 1. Addison-Wesley. 1997. Methodology for Object Oriented Design Object modeling technique as software engineering methodology. 3. Attributes and Methods. PHI. design axioms. 4. Designing Classes: The Process. Ali Bahrami. Rumbaugh methodology. Rumbaugh et. Note:. object persistence. polymorphism. Object Oriented Analysis Analysis Process. Object Oriented Software Engineering. Wirfs-Brock. 5.: McGraw Hill. B. Identifying Object Relationships. Refining Attributes. Grady Booch. UML Object Constraint Language. Classes. design patterns. PHI. Addison-Wesley. Different Approaches for identifying classes. Review of Object Oriented Systems Design Objects. View layer interface design. Object-oriented systems development life cycle. 2. Theory. corollaries. Designing Object-Oriented Software. Object Classification. the unified approach. meta-classes. 1997.Two questions will be set from each unit. 1995. Packages and Managing classes. Ivar Jacobson. Macro and Micro level interface design process. Object Oriented Analysis and Design.

Building process 4. Addison Wesley Longman 2. Building an Expert System Expert system development. knowledge engineering.At least one questions will be set from each unit. Case study of PROSPECTOR. System-building aids.Expert Systems COT-478 (Open Elective II – For all branches) L 3 T 1 Theory: Sessional: 75 50 1. Difficulties during development. Addison Wesley 3. stages in the development of expert systems.: A Guide to Expert Systems. and Kulikowski C. Acquiring knowledge. Problems with Expert Systems Difficulties.M. Lenat and Waterman: Building Expert Systems. support facilities. Weiss S. Selection of tool.A. common pitfalls in planning. Rowman & Allanheld.76 - . Representation and organization of knowledge. Dealing with domain expert. Expert System Tools Techniques of knowledge representation in expert systems.: A Practical Guide to Designing Expert Systems. Types of problems handled by expert systems. New Jersey B.A. Waterman D. 3. 2. Basic characteristics. Note:.Tech Computer Engg. Introduction to Expert System Features of expert system. Hayes-Roth. BOOKS 1. 2002 .

Prentice Hall International. Network Security. 4. Trojan horse and bombs with examples. C. Richard H. John Wiley New York. security functions.Tech Computer Engg. al. Kaufman et. 2002 . MD5 and secure hash algorithms 3. digital signatures – secret key and public key signatures. McGraw Hill International Ed. 1998. IDEA. Network Security.1996 2. levels of access control and authorization. interlock protocol. epidemic of viruses: types of viruses. Authentication protocols KDC protocol. Network Security Basics. Diffle-Hellman key exchange. Baker. message digest. Knapsack 2. preventing loss and damage. prevention from virus. B. securing local area network – authorization. EC) L 3 T 1 Theory: Sessionals: 75 50 1. security plan and policy. securing network components. immunization. securing enterprise network – setting priorities. study of different virus codes. 1996. BOOKS 1. Applied Cryptography. DSS. passwords – technology and administration. Breaking DES. hardware security. DES chaining. substitution and transposition ciphers. Traditional Cryptography Cryptoanalysis. Differential and Linear cryptoanalysis Public-key algorithms: RSA. means of spread. Cryptographic principles. Schneier. life cycle of a virus. using Kerberos. Needham-Schroeder protocol. Computer Security Mechanisms Role of different security mechanisms. writing antivirus/trojan codes.77 - . 3. shared secret key. B. principles of database system security. secretkey algorithms: DES. IT.Security and Cryptography COT-480 (Open Elective II – For branches Co. security plans.

Skills in English OR 2 2 4 100 50 150 ECT-103 2 1 3 100 100 Basic Electronics Eng. (COT-101 + COT-103) will be offered to second half of the students strength. 2002 Duration of Exam (Hours) 3 3 3 3 3 3 3 3 3 3 4 3 3 3 3 3 3 .Bachelor of Technology (Computer Engg) Scheme of Courses/Examination 1 Sl. No. (COT-101 + COT-103) will be offered to first half of students strength. (Pr)  Mathematics-I 3 Physics-I 3 Chemistry . Course No.I 3 Basic Electrical Engineering OR 2 Computer Engineering * 2 Engineering Graphics-I Physics-I (Pr) Chemistry-I (Pr) Basic Electrical Engineering. HUT-107 and MET-103 will be offered to second half of the students’ strength. B.(Pr) OR Computer (Pr) * Workshop-I (Pr) TOTAL 15/17 T 1 1 2 2/2 2 1 1 2/2 2/2 8/7 Examination Schedule (Marks) P/ Tot Th Sess P/VV D 4 75 25 4 75 25 4 100 50 3 75 25 2/2 1 10 40 5 100 25 4 100 25 4 75 25 3 75 25 3 75 25 3 3 75 25 2 2 10 40 2 2 10 40 2/2 1 10 40 2/2 1 10 40 3 3 10 40 12/11 35 575/600 225/240 200/160 Tot 100 100 150 100 50 125 125 100 100 100 100 50 50 50 50 50 1000 Duratio n of Exam (Hours) 3 3 3 3 3 3 3 3 3 3 4 3 3 3 3 3 HUT-109 and (ECT-103 +ECT-105) will be offered to first half of the students strength.78 - . (PHT-108+PHT-112) will be offered to (C+M) students and (PHT-106+PHT-110) will be offered to other students. Subject ( st SEMESTER) (Common to all Branches) Teaching Schedule L 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16     HUT-109 MET-103 HUT-107 ECT-103 ECT-105 MAT-103 PHT-105 CHT-105 ELT-105 COT-101 CET-103 PHT-107 CHT-107 ELT-107 COT-103 MET-105 Engineering Economics OR 3 Manufacturing Processes 3 Commun.Tech Computer Engg. Subject ( nd SEMESTER) (Common to all Branches) Teaching Schedule L 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18      T Examination Schedule (Marks) P/ Tot Th Sess P/VV Tot D MET-103 Manufacturing Processes OR 3 1 4 75 25 100 Engineering Economics HUT-109 3 1 4 75 25 100 HUT-107 Commn.(Pr)  MAT-104 Mathematics-II 3 1 4 75 25 100 PHT-106 Physics-II OR 3 2/2 4 75 25 100 Physics-II PHT-108 3 2/2 4 75 25 100 CHT-106 Chemistry-II 2 1 3 75 25 100 COT-101 Computer Engineering * OR 2 2/2 3 75 25 100 Basic Electrical Eng. * All engineering departments will share the teaching as well as the examinations. No. HUT-109 and (ECT-103 +ECT-105) will be offered to second half of the students strength. and ECT-105 2/2 1 10 40 50 Basic Electronics Eng.. Bachelor of Technology (Computer Engg) Scheme of Courses/Examination 2 Sl. Course No. (ELT-105 + ELT-107) will be offered to first half of the students strength. and Basic Electronics Eng. ELT-105 2 2/2 3 75 25 100 MET-104 Engineering Graphics-II 6 6 100 50 150 PHT-110 Physics-II (Pr) OR 2/2 1 25 25 50 Physics-II (Pr) PHT-112 2/2 1 25 25 50 CHT-108 Chemistry-II (Pr) 2 2 25 25 50 MET-106 Workshop-II (Pr) 3 3 25 25 50 COT-103 Computer (Pr) * OR 2/2 1 10 40 50 Basic Electrical Engineering (Pr) ELT-107 2/2 1 10 40 50 Total 14/15 7/7 14/13 35 575/575 270/310 155/115 1000 HUT-107 and MET-103 will be offered to first half of the students’ strength. (ELT-105 + ELT-107) will be offered to second half of students strength. Skills in English OR 2 2 Basic Electronics Eng.

Course No. Course No.) Scheme of Courses/Examination 3 rd ( Sl.79 - . B. No. 1 2 HUT-201 COT-201 3 4 COT-203 COT-205 5 6 7 8 9 COT-207 COT-209 COT-211 COT-213 COT-215 Subject Industrial Sociology Programming Methodology and File Structures Data Structures Computer Organization & Architecture Discrete Structures Digital Electronics Programming Methodology (Pr) Data Structures (Pr) Digital System Design (Pr) Total SEMESTER) Teaching Schedule Examination Schedule (Marks) Duration of Exam (Hours) L 2 3 T 1 1 P/D - Tot 3 4 Th 75 75 Sess 50 50 P/VV - Tot 125 125 4 4 2 1 - 6 5 100 100 50 25 - 150 125 3 3 3 3 19 2 2 9 2 3 2 7 5 5 2 3 2 35 75 100 - 50 50 25 50 25 25 50 25 125 150 50 100 50 1000 3 3 3 3 3 3 3 Bachelor of Technology (Computer Engineering) Scheme of Courses/Examination 4 th ( Sl. 2002 . 1 2 COT-202 COT-204 3 4 5 COT-206 COT-208 ECT-232 6 7 MAT-202 COT-212 8 9 10 COT-214 COT-216 ECT-234 NOTE: Subject SEMESTER) Teaching Schedule Object Oriented Programming Programming Languages Concepts Software Engineering Microprocessors I Analog and Digital Communication Mathematics III Object Oriented Programming (Pr) Microprocessors I (Pr) Software Engineering (Pr) Communication (Pr) Total Examination Schedule (Marks) Duration of Exam (Hours) L T P/D Tot Th Sess P/VV Tot 3 3 1 1 - 4 4 75 75 25 25 - 100 100 3 3 3 3 4 1 1 2 - 4 4 6 75 75 100 25 50 50 - 100 125 150 3 3 3 3 - 1 - 2 4 2 75 - 50 50 25 125 75 3 3 19 - 2 3 2 9 2 3 2 35 - 25 50 25 50 50 25 75 100 50 1000 3 3 3 7 Students of all branches will undergo a practical training of 6 weeks duration after the 4 th semester exam.* All engineering departments will share the teaching as well as the examinations. No.Tech Computer Engg. Bachelor of Technology (Computer Engineering.

. Course No.. Course No. 4. Departmental Elective I 1. 7. COT-340 COT-342 COT-344 COT-346 COT-348 COT-350 COT-352 Digital Signal Processing Multimedia Techniques Graph Theory & Combinatorics Advanced Database Systems Logic of Programming Computer Graphics Software Quality and Reliability B. 2002 . 6. 1 2 3 4 5 6 7 COT-302 COT-304 COT-306 COT-308 COT-312 COT-314 8 COT-316 6 th Subject SEMESTER) Teaching Schedule L Departmental Elective I 3 Operating Systems 4 Computer Hardware Technologies 4 Computer Networks 4 Advanced Computer Architecture 4 Operating Systems (Pr) Computer Hardware & Troubleshooting Lab (Pr) Advanced Technologies (Pr) Total 19 T 2 2 1 1 1 - P/D 3 3 7 3 9 Tot 5 6 5 5 5 3 3 3 35 Examination Schedule (Marks) Th 100 100 100 100 100 - Sess 50 50 25 50 25 50 50 P/VV 50 50 - 50 50 Tot 150 150 125 150 125 100 100 100 1000 Duration of Exam (Hours) 3 3 3 3 3 3 3 3 NOTE: Students of all branches will undergo a practical training of 6 weeks duration after the 6 th Semester exam..2 . 5 th Subject SEMESTER) Teaching Schedule L 1 2 3 4 5 6 7 8 9 10 HUT-301 COT-301 COT-303 COT-305 COT-307 COT-311 COT-313 COT-315 COT-317 COT-319 Business Management Design and Analysis of Algorithms Database Systems Unix and Linux Programming Automata Theory Algorithms Design (Pr) Database Systems (Pr) Unix and Linux Programming (Pr) Seminar Training Viva Total T 3 1 4 1 3 2 3 1 4 2 . No.17 9 P/D 3 3 3 9 Tot 4 5 5 4 6 3 3 3 2 35 Examination Schedule (Marks) Th Sess P/VV 75 100 75 75 100 - 25 25 50 25 50 50 50 50 50 75 25 50 50 - Tot 100 125 125 100 150 75 100 100 50 75 1000 Duration of Exam (Hours) 3 3 3 3 3 3 3 3 - Bachelor of Technology (Computer Engineering) Scheme of Courses/Examination ( Sl.Bachelor of Technology (Computer Engineering) Scheme of Courses/Examination ( Sl. 3. 2. No. 5.80 - .Tech Computer Engg.

Bachelor of Technology (Computer Engineering) Scheme of Courses/Examination ( Sl. Course No. IT) Fundamentals of Database Systems (for branches except Co. 2002 . 4.81 - . Subject 1 2 3 4 5 * ** COT-401 COT-403 COT-405 6 7 8 9 10 COT-411 COT-413 COT-415 COT-417 COT-419 Open elective I Departmental Elective II Internet and Intranet Engineering Microprocessors II Statistical Models for Computer Science Computer Networks Lab (Pr) Microprocessors II (Pr) Minor Project Seminar Training Viva Total * 1.Tech Computer Engg. 3. 3. 7 th SEMESTER) Teaching Schedule L 3 3 4 3 4 T 1 1 1 1 1 P - - - 17 2 7 3 2 6 11 Examination Schedule (Marks) Tot 4 4 5 4 5 Th 75 75 100 75 100 Sess 50 50 25 25 25 P/VV - Tot 125 125 125 100 125 3 2 6 2 35 - 50 25 50 50 75 50 25 75 - 100 50 125 50 75 1000 Duration of Exam (Hours) 3 3 3 3 3 3 3 3 - Open Elective-I COT-471 COT-473 COT-475 COT-477 Fundamentals of Software Engineering (for branches except Co. IT) Fundamentals of Computer Hardware Techniques (for branches except Co. IT) Artificial Intelligence (open to all branches) ** Departmental Elective II 1. 5. 2. 2. 4. No. COT-441 COT-443 COT-445 COT-447 COT-449 Software Project Management Fuzzy Logic Parallel Computing Image Processing VLSI Technology B.

No.82 - . Course No. EC) Object-Oriented Software Engineering (open to all branches) Expert Systems (open to all branches) Security & Cryptography (for branches Co. IT.Tech Computer Engg. Subject SEMESTER) Teaching Schedule Examination Schedule (Marks) Duration of Exam (Hours) Open Elective II L 3 T 1 P/D - Tot 4 Th 75 Sess 50 P/VV - Tot 125 Departmental Electives III 3 1 - 4 75 50 - 125 3 4 4 14 1 1 2 6 3 12 15 5 5 3 12 2 35 100 100 - 50 25 50 125 50 - 50 125 - 150 125 100 250 50 75 1000 3 3 3 3 - Web Engineering Compiler Design Web Engineering (Pr) Major Project Seminar General Fitness Total 3 Open Electives II COT-472 COT-474 COT-476 COT-478 COT-480 Fundamentals of Operating Systems (for branches except Co. 2002 . 4. 3. EC)  Departmental Elective III 1. COT-440 COT-442 COT-444 COT-446 Distributed Operating Systems Software Project Measurement Natural Language Processing BioInformatics B. IT. 5. 1   2 3 4 5 6 7 8 COT-402 COT-404 COT-412 COT-414 COT-416 COT-418  1. 4.Bachelor of Technology (Computer Engineering) Scheme of Courses/Examination 8 th ( Sl. 2. 3. 2. IT) Fundamentals of Computer Networks (for branches except Co.