Syllabus of CSE (SE,TE,BE)deptt.(2008-10)

Solapur University, Solapur

Revised Structure & Syllabi of S. E. (Computer Science & Engg.) Part – I & Part –II w.e.f. July 2008

Part – I

Sr. No

Name Of the Subject L T P Paper T/W OE POE Total

1 Applied Mathematics - I 4 1 - 100 25 - - 125

2 Discrete Mathematical Structure 3 1 - 100 25 - - 125

3 Data Structures- I 4 - 4 100 25 - 50 175

4 Switching Theory & Logic Design 4 - - 100 - - - 100

5 Computer Graphics 3 - 2 100 25 - - 125

6 Visual Basic 2 - 2 - - - 50 50

7. Environmental Science 2* - - 50* - - - 50*

Total 20 2 8 500 100 - 100 700

Part – II

Sr. No


1 Applied Mathematics – II 4 1 - 100 25 - - 125

2 Formal System & Automata 3 1 - 100 25 - - 125

3 Microprocessors 4 - 2 100 25 - 50 175

4 Computer Networks – I 4 - 2 100 25 - 50 175

5 Data Structures-II 3 - 2 100 25 - - 125

6 Object Oriented Design & Programming 2 - 2 -- 25 - 50 75

1

(C++)

7. Environmental Science 2* - - 50* 50* - - 100*

Total 20 2 8 500 150 - 150 800

* indicates marks not to be counted in total.

Note :

1. The laboratory term work as prescribed in the syllabus is to be periodically and jointly assessed by a team of teachers as appointed by Head of the Institution.

2. In case of tutorials, students of different batches be assigned problems of different types and be guided for the solution of the problem during tutorial session.

3. The assignments of Tutorial need to be submitted in a written journal. For practical work the algorithm or logic behind the experiment may be produced in written form in a journal and source code may be

submitted as a soft copy after the practical is performed.

4. For assigning term work marks the following criteria may be considered.a) Attendance at theory and practical sessions for the respective subject. b) Performance at tutorial / practical.c) Class test d) Internal oral.e) Some research or finding of student presented in the form of paper / project in the respective subject.

5. The batch strength for tutorial / practical should not exceed 20 students. If after forming the batches the

strength of the remaining students exceeds more than 50 % of the batch strength a new batch may be

formed in this case.

6. Set of problems for POE should be based on the list of term work assignments, however they should

preferably not be exactly the same.

2


S. E. (Computer Science and Engg.) Part – I

1. Discrete Mathematical Structures

Lectures :3 Hrs/week Theory :100 Marks

Tutorials :1 Hrs/week Term Work : 25 Marks

Section - I

1. Mathematical logic : (9)

Introduction, statements and Notation, Connectives - negation, conjunction, disjunction, conditional, biconditional, statement formulas and truth tables, well formed formulas, Tautologies, Equivalence of formulas, Duality law, Tautological implications, functionally complete sets of connectives, other connectives, Normal & Principle normal forms; Completely parenthesized infix & polish notations, Theory of inference for statement calculus.

2. Set theory : (6)

Basic concepts of set theory , types of operations on sets, Ordered pairs, Cartesian product, Representation of discrete structures, Relations, Properties of binary relations, Matrix and graph representation, Partition and covering of set, Equivalence relation, Composition, POSET and Hasse diagram.

3. Functions : (4) Function -types, Composition of functions, Inverse functions, Natural numbers.

Section - II

4. Algebraic systems, semigroups and monoids, properties and examples. (5)

5. Polish expressions and their compilation, Groups, group codes. (8)

6. Lattices and boolean algebra : (5)

3

Lattice as POSETs, definition, examples and Properties, Lattice as algebraic systems, Special lattices, Boolean algebra definition and examples, Boolean functions.

Text book :

1. Discrete mathematical structures with applications to computer science -- J. P. Tremblay & R. Manohar (MGH International)

Note : Scope of the articles mentioned in the syllabus is as per the text book.

References :

1. Discrete mathematics -- Liu (MGH)

2. Foundations of discrete mathematics - K.D.Joshi (WILEY EASTERN)

3. Theory and problems in Abstract algebra -- Schaums outline series (MGH)

Term work :

In tutorial session, students of different batches be assigned different exercise problems and be guided for the solution of the problems.

4


S.E. (Computer Science & Engg.) Part-II 2. Formal Systems & Automata

Lectures: 3 hrs/week Theory :100 Marks

Tutorials : 1 hr/week Term work : 25 Marks

Section -I

1. Mathematical induction and recursive definitions with examples. (2)

2. Regular expressions & corresponding regular languages, examples and applications, unions, intersection & complements of regular languges, Finite automata definition and representation, Non-deterministic F.A., NFA with ^ transitions, Equivalence of FAs, NFAs and NFA-^s. (6)

3. Kleene's theorem - part I & II statements & proofs, minimum state FA for a regular language, minimizing

number of states in an FA. (4)

4. Grammars & Languages - Definition and types of grammars and languages, derivation trees and

ambiguity, BNF and CNF notations,Union, Concatenation and *'s of CFLs, Eliminating ^ production and

unit productions from a CFG, Eliminating useless variables from a Context Free Grammer. (6)

Section - II

5. Push down Automata - Definition, deterministic PDA & types of acceptance, equivalence of CFGs &

PDAs. (6)

5

6. CFL's & Non CFL's - Pumping Lemma & examples, intersection and complements. (3)

7. Turing machines - models of computation, definition of TM as language Acceptors, Combining Turing machines, computing a function with a TM. (5)

8. Variations in TM - TMs with doubly-infinite tapes, more than one tape, Non-deterministic TM and universal TM. (4)

Books :

1. Introduction to languages & theory of computation -- John C. Martin (MGH)

1. Discrete mathematical structures with applications to Computer science -- J.P.Tremblay & R.Manohar (MGH)

References :

1. Introduction to Automata theory, languages and computations – John E. Hopcraft, Rajeev Motwani, Jeffrey D. Ullman (Pearson Edition).

2. Introduction to theory of computations – Michael Sipser (Thomson Brooks/Cole).

Termwork : Students of different batches be assigned problems of different types and exercise problems of the

books mentioned above and be guided for the solution of the problems during the tutorial session.

6


S.E. (Computer Science & Engg.) Part-II

3. Object Oriented Programming

Lectures : 2 hrs/week Term Work : 25 Marks

Practicals: 4 hrs/week P.O.E. : 50 Marks

1. OOP Concepts, C++ Programming basics, objects and classes, Array of objects, constructors & destructors, types of constructors . (2)

2. Functions : Reference arguments, overloaded functions, inline functions, default arguments, returning by reference, friend functions and static functions. (3)

3. Operator Overloading : Overloading unary and binary operators, Overloading extraction and insertion operators,data Conversion. (3)

4. Inheritance : Derived class and base class, derived class constructors, over riding member functions, public and private inheritance, multiple inheritance. (3)

5. Pointers : Memory management - new and delete operators, pointers to objects, pointers to pointers, this pointer. (2)

6. Virtual Functions : Accessing Normal and Virtual member functions, late binding, Pure virtual functions, Abstract classes, Virtual base classes. (3)

7. File & Streams : Streams, string I/O, character I/O, object I/O, I/O with multiple objects, file pointers and redirection. (3)

7

8. Advanced C++ features : Templates, Exception handling, Library organisation and containers. (3)

Books :

1. Object oriented programming in Turbo C++ -- Robert Lafore (Galgotia)

2. Object Oriented Programming with C++ - - E. Balgurusamy (McGrawHill)

References :

1. C++ programming language – Bjarne Stroustrup (AT & T)2. Programming with C++ -- D. Ravichandran (TMGH)

Term Work : It should comprise of minimum 12 experiments. Students of different batches should implement different programs based on the following guidelines preferably in Unix/Linux platform.

(A) 8-10 assignments should consist of implementing ALL following concepts –

Constructor, Destructor, Function overloading, Constructor overloading, Operator overloading, Multiple inheritance, Multilevel inheritance, Static variables, Function in class, Virtual function, Virtual class, Virtual destructor, Function template, Class template, Friend class and function, File handling.

(B) 4-5 assignments on implementing object oriented programs for the following

1. Evaluating polynomial expressions(PE) using linked list and performing operations on PE like –

Multiplication, addition, substraction, etc.

2. Implementing sorting/searching algorithms using function template and virtual function.3. Implementing stack/queue using class template.4. Create a linked list as a object. Perform merging of two objects (linked lists) and splitting of object. (Use

operator overloading).5. Implementing hashing and rehashing (considering occurrence of overflow).

8


S.E. (Computer Science & Engg.) Part-II

3. Microprocessor

Lectures :4 hrs/week Theory :100 Marks

Practical: 2 hrs/week T.W. : 25 Marks

P.O.E. : 50 Marks

Section - I1. 8085 Architecture : (6)

Introduction to microprocessor, Features of 8085, 8085 CPU architecture, Demultiplexing of address and data bus, 8085 clock circuit, Instruction fetching and execution operations of microprocessors.

2. 8085 Instruciton Set : (8) Instruction formats, Addressing modes, Opcode formats, Classification of instruction set, Programming

techniques, Instruction timings, Introducing WAIT state, Single step and single cycle execution.

3. Semiconductor Memory and I/O Operations : (5)

Memory organisations, Mapping of I/O devices, IN & OUT instructions with timing diagrams, Interfacing Keyboards, Interfacing Thumbwheel switches.

Section - II

4. Interrupt and DMA Transfer : (9)

8085 interrupts, RST 5.5, 6.5, 7.5, TRAP & INTR, Designing hardware for INTR, Interrupt priorities, Study of 8259 Interrupt controller ,Use of SIM and RIM instructions, DMA transfer, Use of HOLD and HLDA pins for DMA transfer.

5. Programmable Peripheral Devices : (6)

8255 Programmable peripheral interface - Use of 8255 for interfacing four digit MUXed display and four digit multiplxed thumbwheel switches. 8253 Programmable interval timer.

9

6. Data Converters and Interfacing : (3)

DAC weighted resistor and resistor lader DAC, ADC successive approximation and Dual slope ADC, ADC and DAC interfacing using 0808 and 0809.

7. Serial Data Comunication : (3)

Concepts in serial I/O, RIM and SIM instructions for serial interface, Study of 8251, Asynchronous and synchronous transmitter and receiver.

Text Books:

1.Microprocessor architecture programming and applications -- Gaonkar (WILEY EASTERN)

Reference :

1.Digital systems and microprocessors -- Douglas Hall (MGH)

Termwork: It should consist of minimum 8-10 experiments based on following guidelines :

1. Addition & Subtraction of 32 bit nos. (Numbers should be placed in memory)2. Subtraction of signed 16 bit nos.3. Multiplication and Division of 8 bit nos. using add and shift method.4. Arranging 10 nos. in ascending & descending order.5. Write a Assembly language program to handle RST 7.5 interrupt.6. Writing subroutine to perform delay operation of 10 ms.7. Bit manipulation and testing e.g. check status of D4 bit for 1.8. Implement a 4 digit BCD Up & Down counter.9. 4*4 keyboard interface using 825510. 7-segment display using 825511. Block transfer overlapping / overlapping

10



1. Data Structure -I

Lectures : 4 Hrs/week Theory :100 Marks

Practical : 4 Hrs/week Term Work : 25 Marks

POE : 50 Marks

1. Recursion : Definition and Processes, Recursion in C, How recursion works, Factorial, Fibonacci sequence,

Towers of Hanoi, Advantages and Disadvantages of recursive techniques, Guideline and conclusion.

2. String Processing :Declaration and initialization of strings , Display of strings with different formats, string library fuction.

3. Pointers : Introduction, Pointers of Arrays, Array of Pointer , Pointer to Pointer , Pointer and String, Pointer and Structures, Pointer to Functions in C, Pointers and Dynamic memory.

4. Files :Introduction, Streams and file types, File operations, File I/O, Structures of read and write, other file functions, command file arguments.

5. Stack :Definition representation, Operations, Implementation and their application.

6. Queues :Definition , representation, Operations, Implementation, Circular Queue, Priority Queue and applications of Queue .

7. Lists :11

Definition , representation, operations, Types of lists : Singly Linked list , Circular Linked List, Stack using Linked List, Queue using Linked List, Applications of Linked List.

Text Books :

1. Data Structures using C by Yedidyah Langsam, Moshe J. Augensteen, Aaron . M. Tanenbaum

2. Data Structure by Seymores Lipschutz

Reference Books:

1. Pointers in C by Yashwant Kanetkar

2. Data Structure and Programming Design by Robert Kruse / C.L. Tondo / Bruce Leung.

12

Assignment List :

Students should implement minimum of 12 experiments based on the following guidelines and preferably conducted on unix / linux platform

1. Represent Sparse Matrix using arrays and perform Matrix Operations such as Addition and Multiplication .

2. Write a program to implement Magic Square by taking the size from user.

3. Implement Fibonnoci Sequence , Tower of Hanoi using recursion.

4. Concatenate two strings into a third string using pointers.

5. Implement Stack operations using Arrays.

6. Use Stack to convert Polish Notations.

7. Represent circular Queue using Arrays and implement its operations.

8. Implement Singly Linked List and Stack using Singly Linked List.

9. Implement Doubly Linked List.

10. Implement Singly Circular and Doubly Circular Linked List.

11. Implement Priority Queue using Linked List .

13

12. Implement File commands using command Line Arguments.

13. Write a Menu Driven Program for Performing the following Operations on Files : Insert, Delete , Modify and Display.

14. Represent a Polynomial by Singly Linked List and Perform the following operations.Addition, Subtraction and Multiplication.

14



1. Data Structure -II

Lectures : 3 Hrs/week Theory :100 Marks

Practical : 2 Hrs/week Term Work : 25 Marks

1. Chapter1 :Algorithm Analysis : Introduction Asymptotics, Big –O notation, Omega Notation, Time complexity space complexity.

2. Chapter 2:Searching and Sorting :

Searching : Sequential search , Binary search, Analysis and comparison of these methods.

Sorting : Insertion sort, Deletion sort, Shell sort, Bubble sort, Merge sort, Quick sort, Heap sort analysis of all these sorting techniques.

3. Chapter 3 :Hashing : Sparse tables, choosing a hash function , Collision Resolution with Open Addressing, Collision Resolution by Chaining , Comparison of Methods.

4. Chapter 4 : Trees : Definition ,Transversal of Binary Trees , Linked Implementation of Binary Trees ,

Binary Search Trees, Threaded Binary Trees, Insertion in a Threaded Tree and

Transversal Techniques in a Threaded Tree.

Multiway Trees : Multiway Search Trees, Balanced Multiway Trres, Traversing a Multiway Tree,

Insertion in Multiway Tree, B - Trees, B + Trees

5. Chapter 5:Height Balance: AVL Trees. Definition Insertion and Deletion of Node in AVL Trees,

15

Single and Double Rotation of AVL Trees, Height of an AVL Tree.

6. Chapter 6 :Definition and Examples, Undirected and Directed Graphs, Computer Representation of Graphs,

Graphs Traversal Methods :- Depth First and Breadth first Algorithms.

Topological sort : Depth First and Breadth First.

Applications : Shortest path using Dijkstra’s Algorithm

Text Books :

1. Data Structure and Program design in C By Robert Kruse / C.L. Tondo / Bruce Leung Second edition on Chapters 1,2,3,4,5,6.

2. Data Structure using C and C++ second edition by Yedidyah Langram , Moshe J, Augensteen, Aason M. Tanenbaum

Reference Books :

1. Data Structure and Algorithms by Alfred V. Aho, John . E. Hopcroft, J.D. Ullman2. Theory and Problems of Data Structures – Lipschutz(MaH international)3. Data Structure and Algorithm Analysis – Mark Allah Weiss (Chapter 5)

16

Assignment List :

Students are expected to implement a minimum of 8 experiments

1. Implement Binary Search

2. Implement Merge Sort

3. Implement Quick Sort

4. Implement Heap Sort

5. Insertion Sort

6. Implement Hashing using Open Addressing and Chaining method for Collision Resolution

7. Create Binary Search Tree and Implement Insertion and Deletion of a node , Traversal Techniques

8. Implement B-Tree and its Operation

9. Represent Graph and Traverse it using DFS and BFS

17

10. Find Shortest Path in Graph using Digkstra’s Algorithm

18

Solapur University, SolapurStructure of T.E.(Computer Science and Engineering) Part I & II

w.e.f. Academic Year 2009-10.

T.E.(Computer Science and Engineering) Part -ISr. No

Subject Teaching Scheme Examination SchemeL T P Total TH TW POE OE Total

1 Computer Network - II 4 - 2 6 100 25 - - 125

2 Computer Organization 4 - - 4 100 - - - 1003 System Programming 3 - 2 5 100 25 50 - 1754 Operating System – I 3 - 2 5 100 25 - - 1255 Design & Analysis of Algorithm 4 - - 4 100 - - - 1006 Java Programming 2 - 4 6 - 25 50 - 75

Total 20 - 10 30 500 100 100 - 700

-----------------------------------------------------------------------------------------------------

T.E.(Computer Science and Engineering) Part – IISr. No

Subject Teaching Scheme Examination SchemeL T P Total TH T/W POE OE Total

1 Data Base Engineering 4 - 2 6 100 25 50 -- 1752 Compiler Construction 3 - 2 5 100 25 - -- 1253 Operating System – II 4 - 2 6 100 25 50 -- 1754 Software Engg. 4 - - 4 100 - - -- 1005 Artificial Intelligence 3 - - 3 100 - - -- 1006 Advanced Java 2 - 2 4 - 25 50 -- 757 Seminar - - 2 2 - 50 - -- 50

Total 20 - 10 30 500 150 150 -- 800

Note:-1. Vacational Training (to be evaluated at B.E. Part-I) of minimum 15 days should be completed in any

vacation after S.E.Part-II but before B.E. Part-I & the report should be submitted in B.E. Part- I.

2. The batch size for the practical/tutorials be of 15 students. On forming the batches, if the strength of remaining students exceeds 7 students, then a new batch may be formed.

19

Solapur University, Solapur T.E. (Computer Science & Engineering) Syllabus 1

20

T.E. (Computer Science & Engineering) Part – I1. Computer Network-II

Lecture: 4 hrs/week Theory: 100 MarksPractical: 2 hrs/week Term work : 25 Marks

------------------------------------------------------------------------------------------------------------

Section I1:Transport Layer – (10) Overview of IP Protocol ,UDP:process to process communication, user datagram, UDP operations Use of UDP ,TCP:Tcp services, TCP features, segment of TCP connection, flow control, error control, congestion control,TCP timers

2: Client server model & socket interface –. (5)Client server model, concurrency, processes, sockets, byte ordering, address transformation. Socket system calls, connectionless iterative server, UDP client server programs, and connection oriented concurrent server. TCP client server programs

3:Host configuration - (7) BOOTP:Operations and packet format,DHCP: Static and Dynamic addressing, allocation, manual and Automatic configuration, packet format,

Section II

4 : Domain Name System ( DNS) : (4) Name Space, Domain Name Space, distribution of name space, DNS in internet,Resolution, DNS massages, types of records, WINES.

5 : TELNET, FTP – (7) Concept, NVT, embedding, out of band signaling, escape character, mode of operations. FTP and TFTP .

6 :SMTP and WWW– (6)Architecture, user, agents, MTA,pop3, HTTP: Architecture , protocol.

7:Network OS : (5) Windows 2000 / NT:- System Overview,Windows Networking Architecture,File System – FAT16,FAT32,NTFS.

Text Book :1. TCP/IP Protocol Suite : Behroz A. Forozen (Second Edition) (Chapter 2)2. TCP/IP Protocol Suite : Behroz A. Forozen (Third Edition) (Chapter 1,3,4,5,6)3. Networking : The Complete Reference : Craig Zacker (Chapter 7) (Tata McGraw –Hill)

Ref Book : 1. TCP/IP Vol 3. : Client Server Programming & Application – Comer

21


22

Termwork : Minimum 8-10 Experiments based on following guidelines.

List of assignments:-

1. Configuration of network- Assigning IP Adress,Subnetmask,Default Gateway & Testing BasicConnectivity.

2. Implementing Client-Server program using Iterative UDP server.3. Implementing Client-Server program using Iterative TCP server.4. Implementing Client-Server program using Concurrent TCP server.5. Simulation of DHCP.6. Simulation of DNS.7. Simulation of FTP.8. Implementation of Chatting Application.9. Installation & Configuration of –Windows 2000/2003 or Linux.10. Study of existing network (e.g. college) and design of any new network.

23


24

T.E. (Computer Science & Engineering) Part – I2. COMPUTER ORGANISATION

Lectures: 4Hrs./Week Theory: 100--------------------------------------------------------------------------------------------------------

Section I1. Introduction to CO -- (02)

Generations of computers

2. Processor Level design -- (08) Instruction Sets-Instruction format, Instruction types; Bus-Hierarchical Architecture, RISC,CISC ;Fixed point Arithmetic: Addition, subtraction, multiplication(Booths Algorithms ), Division(Restoring & non restoring);Floating Point Arithmetic: Addition (Examples based on different Algorithms).

3. Control Unit Design -- (04) Hardwired Control Unit: Design Methods(Sequence counter);Multiplier Control Unit (Introduction), (Implementation of Multiplier in each case).

4. Memory Organization -- (06)Virtual memory: Memory Hierarchy, Main memory allocation, Segments & pages.

Section II5.Memory Design -- (08)

Replacement Policies; High Speed memories-Interleaved memories, Cache, Associative.

6. Parallel Processing -- (08) Uniprocessor and Multiprocessor parallelism; Types of uniprocessor parallelism; Basics of Pipelining & vector processing; Difference between pipelining and vector processors; Multiprocessor Architecture-tightly coupled & loosely coupled ,Examples of loosely coupled

7.Pipelined Architectures – (08)Linear, Nonlinear pipeline ,pipeline hazards, bubbles in pipeline;

Text Books:1.Computer Architecture & organisation – J.P.Hayes(MGH)2.Computer Organisation & Architecture Hanasey Paterson3. Advanced Computer Architecture Kai Hwang(MGH)

Reference Book1.Computer Organisation -Hamacher Zaky(MGH)2.Designing for Performance William Stallings

25


26

T.E. (Computer Science & Engineering) Part – I3. SYSTEM PROGRAMMING

Lecture : 3 Hrs/Week Theory : 100 marks Practicals : 2 hrs/week T/W : 25 marks

POE : 50 marks.--------------------------------------------------------------------------------------------------------

SECTION – I1.Language Processors: (7) Introduction, language processing activities, Fundamentals of language processing, Fundamentals of language, Specification, language Processor development tools.

2.Assemblers: (7) Elements of assembly language programming, A simple assembly scheme, Pass structure of assemblers, design of a two pass assembler, A single pass assembler for IBM PC.

3.Macros and Macro Processors: (4)Macro definition and call, Macro Expansion, Nested macro calls.

SECTION - II

4. Compilers and Interpreters: (7)Aspects of compilation, compilation of expressions, code optimization.

5. Linkers : (6)Relocation and linking concepts, design of a linker, Self-relocating programs, Linking for verlays.

6. Loaders: (5) Function of loader, general loader scheme, Absolute loader, Relocating loader, Direct linking loader, Dynamic loading, Design of direct linking loader.

Text books :1. System Programming and operating systems – 2

nd Edition D.M. Dhamdhere (TMGH) (unit-

1,2,3,4,5)2. System Programming -- J. J. Donovan (Mc-Graw Hill) (unit-6)

Reference books :1. System Software- An Introduction to Systems Programming- 3

rd Edition- Leland L. Beck

(Pearson Education)Termwork :Practicals : Minimum of 8-10 practical assignments should be carried on based on –

1. Implementation of Macros.2. Implementation of Nested macros.3. Design and implementation of 1 pass assemblers.4. Design and implementation of 2 pass assemblers.5. Symbol table generation for input *.c file.6. Design Lex specifications for the tokens – keywords, identifiers, numbers, operators, white

spaces.7. Implementation of Toy-code generator.8. Simulation of linkers.

27

9. Simulation of loaders.


28

T.E. (Computer Science & Engineering) Part – I4. OPERATING SYSTEM - I

Lectures: 3 Hrs/Week Theory: 100 MarksPractical: 2 Hr/week T/W: 25 marks

--------------------------------------------------------------------------------------------------------

SECTION – I

1.Introduction : (4)What is an operating system? , Simple Batch System, Multiprogrammed Batch System ,TimeSharing System, Personal Computer System, Parallel System, Real Time System, System Calls.

2.Process : (6)Process Concept ,Process Scheduling, Operation on process, Cooperating process, Threads , Interprocess Communication(Algorithms evaluation).

3.Process Scheduling: (4)Basic concept ,Scheduling Criteria , Scheduling Algorithms, Multiple processor scheduling , Real time scheduling.

4 Interprocess synchronization: (5) Background , Classical problems of synchronization , Critical Region , The critical section problem, Synchronization Hardware Monitors , Semaphores.

SECTION – II

5.Deadlocks: (7) System modes ,Deadlock characterization , Methods for handling deadlocks Deadlock prevention , Deadlock avoidance , Deadlock detection Recovery from deadlock , Combined approach to dead lock.

6. Memory management: (4) Background , Logical Versus Physical Address space , Swapping Contiguous Allocation , Paging, Segmentation , Segmentation with paging.

7. Virtual Memory: (5) Background , Demand paging , Page replacement , Page replacement algorithms , Allocation of frames ,Thrashing(Only concept), Demand segmentation.

8. I/O system : (4) Overview , I/O hardware ,Application I/O interface , Kernel I/O subsystem, Transforming I/O request to hardware operation.

Text Book :1. Operating System concepts – 5th Edition – Silberschatz Galvin (John Wiley).Reference:2. Operating Systems: Internals and Design Principles, 5th Edition by William Stallings (PHI)3. Operating system with case studies in Unix, Netware and Windows NT – Achyut S. Godbole(TMGH).

29


30

Termwork : Practical List

It should consist of the following practicals

Based on C and linux1. Study of Unix Operating System.2. Implementation of system calls : fork (), join(), abort (), suspend()3. Implementation of FCFS scheduling algorithm.4. Implementation of SJF (preemptive & non preemptive)5. Implementation of round robin (RR).6. Implementation of priority scheduling algorithm.

Based on Java Multithreading7. Implementation of Mutual Exclusion 1st algorithm.8. Implementation of Mutual Exclusion 2nd algorithm.9. Implementation of Mutual Exclusion 3rd algorithm.10. Implementation of Mutual Exclusion using semaphore (wait & signal)11. Implementation of producer consumer problem (Bounded buffer )12. Implementation of producer consumer problem (Unbounded buffer )

31


32

T.E. (Computer Science & Engineering) Part – I5. DESIGN & ANAYLISIS OF ALGORITHM

Lectures: 4 hrs/week Theory: 100 marks--------------------------------------------------------------------------------------------------------

SECTION – I

1. Introduction : (7)What is algorithm, Algorithm Specification, Recurrence relations, Performance Analysis?

2. Divide and Conquer : (9)The general method, Binary search, Finding the maximum and minimum, Merge sort, Quicksort, Selection sort and analysis of these algorithms.

3. The Greedy method : (9)The general method, , Knapsack problem, Job sequencing with deadlines, minimum-cost spanning trees – Prim’s and Kruskal’s Algorithms, Optimal storage on tapes , Optimal merge patterns, Single source shortest paths.

SECTION - II4. Dynamic Programming : (10)

The general method, Multistage graphs, All pair shortest paths, Optimal binary search trees,0/1 knapsack, Reliability design, Traveling Sales person problem. Flow shop scheduling.

5. Basic Traversal and Search Techniques : (8) Techniques for Binary Trees, Game Tree; Techniques for Graphs – Breadth First Search & Traversal, Depth First Search & Traversal, AND/OR graphs; Connected components and Spanning Trees; Bi-connected components and depth first search.

6. Backtracking : (9)The general method, 8-queen problem, sum of subsets, Knapsack Problem, Hamilton Cycle, Graph Coloring.

Text Book:1.Fundamentals of Computer Algorithms–Horowitz, Sahni & Rajasekaran (Galgotia Publications)

References:1. Fundamental of Algorithm. – Gilles Brassard, Paul Bratley (Pearson Publication)2. Introduction to Algorithms – Thomas Cormen (Pearson Publication)3. Introduction to Design and Analysis of Algorithm – By Goodman (McGrawhill)4. Design and analysis of algorithms - Aho, Hopfcraft and Ullman (Addison wesley)

33


34

T.E. (Computer Science & Engineering) Part – I6. Java Programming

Theory- 2 Hrs/Week POE: 50 MarksPractical-4 Hrs/Week T/W: 25 Marks

--------------------------------------------------------------------------------------------------------

1. Introduction to Java: (03) Overview of Java, Features of Java Language, Java Road Map, Data types and operators, Strings, Vectors. Type wrapper, classes in Java.

2. Object oriented programming with Java (04) Define class, method, properties, Understanding usage of packages, Creating user defined packages, Managing classes under packages, Access modifiers, this keyword, Working with Constructors

3. Inheritance and Polymorphism : (03) Types of inheritance in java, Multiple inheritance using interface, Method overriding, use of super final keywords, Creating abstract classes, Interfaces & methods, Finalization and Garbage collection

4. Exceptions and Error handling: (03) Introduction to Exception, Dealing with exceptions, try, catch blocks, finally block, throw and throws statement, Common Exceptions, The Throwable class, User defined Exception

5. I/O Programming: (03) Hierarchy of classes in I/O package, Streams: Character oriented and Byte oriented, reading basic data types from keyboard, File handling in Java.

6. Multithreading: (03)Java thread model, Thread creation using Thread class and Runnable Interface, Thread priorities , Thread Synchronization, Thread groups, deadlocks

7. GUI Design in Java and Event handling (06) Hierarchy of classes in AWT package, Applet programming, Event handling on TextField, Buttons, Checkboxes, Lists, Menus and MenuBar, Layout managers, Key and Mouse Events

8. Network programming with Java: (04) Networking fundamentals, Client server programming: InetAddress, URLS, Sockets, Datagram Socket, Introduction to RMI

9. Java Utilities and file compression: (02) Data structures using Java:Set,Map,List,Tree, Jar files, Data compression using Java.util. ZIP package

Text Books:-1. Programming with Java a primer – E. Balgurusamy (TMGH)

2. Object Oriented Programming through Java- E Radhakrishna ( University Press)

3. The Java Programming Language, 3rd Edition – Kea Arnold, David Holmes, James Gosling,

Prakash Goteti

Reference Books:-

1. The Java language specification

(E-Book: http:// Java-sun.com/docs/books/jeles/downloads/langspec 3.0 pdf

2. The complete Reference, Java2 (5th edition) – Herbert Schedt et. a (Osborn)

35

3. Java for Professionals – B.M. Harwani (SPD)


36

Termwork : Practicals :

1. Scope of Object in Program.2. Console I/O3. Recursion in JAVA4. Constructor5. Instance Variable6. Program on StringTokenizer7. Applet8. Multithreading9. File Copy program10. GUI and Event Handling11. Concurrency12. Socket based programs

37


38

T.E. (Computer Science & Engineering) Part – II1. DATABASE ENGINEERING

Lectures : 4 Hrs/Week Theory: 100 MarksPractical : 2 Hrs/Week T.W. : 25 Marks

POE : 50 Marks--------------------------------------------------------------------------------------------------------

SECTION – I1. Introduction: (06) Purpose of Database Systems, View of data, Database Languages, Database Architectures, Database users and administrators, Entity Relationship models, Constraints, E-R Diagram, E-R Design issue, Weak Entity sets, Extended E-R features, Database design for Banking Enterprise, Reduction to relation schemas.

2. Relational Model : (10)Basic Structure , Relational algebra Operations : Fundamental, Additional and Extended , Null values, Modification of Database, Structured Query Language(SQL) The Tuple Relational Calculus, The Domain Relational Calculus.

3. Relational Database Design : (08) Features of good Relational Designs, Atomic Domains and First Normal Form, Decomposition using Functional dependencies, Third Normal Form Functional-dependency theory, Decomposition using functional dependencies, Decomposing using Multi valued dependencies.

SECTION - II

4. Indexing and Hashing : (06) Basic Concepts, Ordered Indices, B+ Tree Index Files, B Tree Index Files, Static Hashing, Dynamic Hashing, Comparison of Indexing and Hashing, Multiple Key Access.

5. Transactions and Concurrency Control : (10) Transaction concepts, Transaction state, Implementation of Atomicity and Durability, Concurrent Executions, Serializability, Recoverability, Implementation of Isolation , Testing for Serializability ,Log based protocols, Time Stamp-based protocols, Validation based protocols.

6. Recovery System : (08)Failure Classification, The storage Structure, Recovery and Atomicity, Log-Based Recovery, Recovery with concurrent Transactions, Buffer Management, Shadow Paging, Failure with Loss of Non-Volatile Storage.

Text Book :1. Database System Concept by Henry F. Korth, Abraham Silberschatz, Sudarshan (McGraw Hill

Inc.) Fifth Edition2. Database System Concept by Henry F. Korth, Abraham Silberschatz, Third edition (McGraw

Hill Inc.)

Reference Books :1. Fundamentals of Database Systems – Ramez ElMasri and S B Navathe (Fifth Edition PearsonEducation ) .2. Database Management Systems- Ramkrishnan Gehreke (third edition, Tata McGraw Hill).

39

3. Principles of Database Systems by J.D. Ullman (Galgotia Publications)


40

Term Work : Practicals :1. It should consist of minimum 8-10 experiments based on above topics and practicals should be

implemented in C++/Java as listed below:1. Title : ER Diagrams.

Draw ER diagrams (around 5 in number) for any specific application & Convert them into tables.

2. Title : Data DictionaryWrite program to create tables, along with constraints and store them in a file, which will work as DD for later assignments.

3. Title : Insert DataWrite program to Insert data in tables created in assignment 2. Store data in separate File / Table. Implement insert operation as transaction.

4. Title : Modify DataWrite program to modify data in tables, which is inserted in assignment 3. Implement modify operation as transaction.

5. Title : View DataWrite program to view table data. Accept table attribute for ordering dynamically.

6. Title : B+ Tree Indexing TechniqueWrite program to implement B+ Tree Index ( n=3 or n = 5 ) on the data created until now.

7. Title : Dynamic Hashing TechniqueWrite program to implement Dynamic Hashing on the data created until now.

8. Title : Database LogsWrite program to simulate log based protocol using Immediate Database modification OR Deferred database modification.

9. Title : Concurrency ControlWrite program to simulate any one concurrency control Protocol.

10. Title : Canonical cover & ClosureGiven a set of functional dependencies Find canonical cover & closure.

11. Case Study of DB2 /SQL / OracleImplement also Assignment no. 2 to 5 using above mentioned RDBMS package

41


42

T.E. (Computer Science & Engineering) Part – II2. COMPILER CONSTRUCTION

Lectures : 3 hrs/week Theory : 100 marksPracticals : 2 hrs/week T/W : 25 marks

--------------------------------------------------------------------------------------------------------SECTION - I

1. Introduction to Compiling: (3)Compilers, Phases of a compiler, Compiler construction tools, A simple one pass compiler.

2. Lexical Analysis: (5)Role of a Lexical analyzer, input buffering, specification and recognition of tokens, finite automata implications, designing a lexical analyzer generator .

3. Syntax Analysis: . (6)Role of Parser, Writing grammars for context free environments, Top-down parsing, Recursive descent and predictive parsers (LL), Bottom-Up parsing, Operator precedence parsing, LR, SLR and LALR parsers

4. Syntax Directed Translation: (6)Syntax directed definitions, construction of syntax tree, Bottom-up evaluation of S-attributed definitions, L-attributed definitions, Top-down translation and Bottom-up evaluation of inherited attributes, analysis of syntax directed definitions.

SECTION - II

5. Run Time Environments : (3)Source language issues, storage organisation and allocation strategies, parameter passing, symbol table organisations and generations, dynamic storage allocations.

6. Intermediate Code Generation : (3) Intermediate languages, declarations, assignment statements and boolean expressions, case statements, back patching, procedure calls.

7. Code Generation : (5)Issues in design of a code generator and target machine, Run time storage management, Basic blocks and flow graphs, Next use information and simple code generator, Issues of register allocation, assignment and basic blocks, code generation from Dags and the dynamic code generation algorithm.

8. Code Optimization : (5)Sources of optimization, Peephole optimization and basic blocks, loops in flow graphs, Data flow analysis and equations, code improving transformation and aliases, Data flow analysis and algorithms, symbolic debugging of optimized code.

43


44

Text Book :

1. Compilers - Principles, Techniques and Tools - A.V. Aho, R. Shethi and J.D. Ullman( Pearson Education.)

References : -

1. Compiler Construction - Dhamdere (Mc-Millan)2. Compiler Construction – Principles & Practice – Ken Louden ( Cengage Learning)3. Compiler Design in C – Allen I. Holub (PHI / Pearson Education)4. Compiler Construction - Barret, Bates, Couch (Galgotia)5. Unix Programming - Pepkin Pike.6. Crafting a compiler with C – Charls Fischer, Richard LeBlane (Pearson Education)

Term Work : It should consist of minimum 8-10 experiments based on the above topics. Following experiments may be conducted for the term work.Practicals :

1. Generate a grammar for a language whose description is known.2. Design a lexical analyser for a language whose grammar is known.3. Implement a recognizer for the language in 2.4. Implement a parser for the language given in 2.5. Generate a symbol table for the language given in 2.6. Generate 3 address code for the language given in 2.7. Implement code optimization techniques on the code produced in 6.8. Generate target code for the code optimized in 4, considering the target machine to be X86.9. Use of LEX & YACC utilities.10. Case study of Fort Language (IIT Bombay).

45


46

T.E. (Computer Science & Engineering) Part – II3. OPERATING SYSTEM – II

Lectures : 4 Hrs/Week Theory : 100 MarksPractical : 2 Hrs/ Week Term work : 25 Marks

POE : 50 Marks--------------------------------------------------------------------------------------------------------

SECTION – I1. Introduction : (7)General Overview of the System - History, System Structure, User Perspective, Operating System Services, Assumption About Hardware. Introduction to the KERNEL - Architecture of UNIX OS, Introduction to system concepts, Kernel Data Structure, System Administration.

2. The Buffer Cache : (5) Buffer headers, structure of the buffer pool, scenarios for retrieval of a buffer, reading and writing disk blocks, advantages and disadvantages of cache.

3. Internal Representation of Files : (5) Inodes, structure of the regular file, directories, conversion of a pathname to inode, super block, inode assignment to a new file, allocation of disk blocks, other file types.

4. System calls for the file System : (5) Open, Read, write, File and Record Locking, Adjusting the position of FILE I/O-LSEEK, Close, File Creation, Creation of Special File, Change Directory and Change Root, Change Owner and Change Mode, Stat and Fstat, Pipes, Dup, Mounting and Unmounting file systems, Link, Unlink, File System Abstractions,File system maintenance.

SECTION – II

5. The Structure of process : (5) Process stages and transitions, layout of system memory, the context of a process, Saving context of a process, manipulation of the process address space.

6. Process Control : (5) Process creation, signals, process termination, awaiting process termination, invoking other programs, the user id of a process, the shell, system Boot and the Init process.

7. Process Scheduling and Time : (3)Process Scheduling, system call for time, clock.

8. Memory management policies : (4)Swapping, Demand passing, a hybrid system with demand paging and swapping

9. The I/O Subsystem : (5)Driver interfaces, disk drives, terminal drivers, Streams.

Text Book :1. The design of Unix Operating System - Maurice J. Bach (PHI)2. Unix Manuals.

Reference:1. Unix concepts and administration – 3

rd Edition – Sumitabha Das (TMGH).

Term Work : Practicals : It should consist of minimum 8-10 experiments based on topics of above syllabus.

47


48

T.E. (Computer Science & Engineering) Part – II4. Software Engineering

Lecture: 4 hrs/week Theory: 100 Marks--------------------------------------------------------------------------------------------------------

SECTION-I1. Intoduction to S/W Engineering. : (6)

SDLC Definition & Overview-Phase Development process, Software processes, Process, Characteristics of a software process, software development process, project management process, software configuration management process, process management process.

2. S/W Requirement Analysis and Specification : (4)Software requirements, problem analysis, Requirements specification, validation, Metrics.

3. Function Oriented Design (6) Design principles, Module level concepts, Design notation and specification, Structured Design Methodology, verification, Metrics.

4. The Project Planning (6)The project planning infrastructure-Process Database, process capability baseline, process asset and the body of knowledge system.Effort estimation and scheduling –Estimation and scheduling concepts, effort estimation schedulingQuality planning-Quality Concepts, Qualitative quality management planning, Defectprevention planningRisk Management – Concepts of risk and risk management assessment, risk control, the structure of the project management plan.

SECTION-II5. Object Oriented Design (6)

OO Analysis and OO design, Concepts, Design notation and specification, Design Methodology,UML Diagrams.

6. Managing S/W projects (4) Processes and project management and the CMM project management process, Training for project managers, SEPG support to projects.Configuration Measurement- Concept in Config management, The Config managementprocess.

7. Project Execution and closure (4)Review the Reviews, the review process, Data Collection, Monitoring controlProject Monitoring and control - Project Tracking, milestone analysis. Activity level analysis using SPC, Defect analysis and prevention, Process monitoring and Audit

8. Testing (6) Black box and White box testing , Object Oriented S/W testing methods, Testing for Quality, Functional testing, Unit testing, System testing, User satisfaction testing, Test cases and Test Plans

49


50

Text Books:1. An Integrated Approach to Software Engineering- 3

rd edition: Pankaj Jalote(Narosa

Publishers)2. Software Project management in practice-Pankaj Jalote

References:1. Software Engineering- Practioner Approach: Roger S. Pressman. 6

th edition.

2. Software Engineering Fundamentals –Ali Behforooz and Frederick j. Hudson(Oxford University Press)

51


52

T.E. (Computer Science & Engineering) Part – II5. ARTIFICIAL INTELLIGENCE

Lectures : 3 hrs/week Theory : 100 marks--------------------------------------------------------------------------------------------------------

SECTION – I1. Introduction : (3) Defination of AI, The AI problems, the understanding Assumption, AI Technique, The level of the model, criteria for success.

2. Problem spaces and Search : (6) Defination of a problem as a state space search, Production systems, Problem characteristics, Production system characteristics, Issues in the design of search programs

3. Heuristic Search Techniques : (6)Generate and Test, Hill climbing, Best first search, Problem reduction, Constraint satisfaction, Means – Ends analysis.

4. Knowledge Representation : (3) Representation and Mappings, Approaches to Knowledge representation, Issues in knowledge representation, The frame problem.

SECTION – II5. Knowledge Representation Techniques : (5) Representing simple facts in predicate logic, Representing instances and Isa Relationships, computable functions & Predicates, Resolution, Natural deduction, Procedural versus declarative knowledge, logic programming, Forward versus backward reasoning, matching, control knowledge.

6. Symbolic Reasoning under uncertainty and Statistical Reasoning : (5) Introduction to non monotonic reasoning, logic for non monotonic reasoning, implementation issues, probability and Baye’s Theorem in certainty factor and Rule – Based systems, Bayesian Networks, Demster Shafer Theory, Fuzzy logic.

7. Slot and Filter structures : (4)Semantic Nets, Frames, Conceptual dependency, Scripts, CYC.

8. Expert System : (4) Introduction, Rule Based System Architectures, Non production systems architectures, Dealing with uncertainty , Knowledge Acquisition and validation, Knowledge system building tools.

Text Book :1. Artificial Intelligence - Elaine Rich, Kevin Knight (Second Edition) (TMGH)

(For Chapter 1 to 7)2. Introduction to Artificial Intelligence & Expert systems – Dan. W. Patterson (Pearson Education) (For Chapter 8)

References : -1. AI : A modern approach - Stuart Russell and Peter Norvig (PHI)2. Introduction to Artificial Intelligence – Eugene Charnaik, Drew Mc Dermott (Pearson Education)

53


54

T.E. (Computer Science & Engineering) Part – II6. Advanced Java

Theory- 2 Hrs/Week POE: 50 MarksPractical-2 Hrs/Week T/W: 25 Marks

--------------------------------------------------------------------------------------------------------

1. The Java Collection Classes (04) Introduction, The Arrays Class, Searching and Sorting Arrays of Primitives, Sorting Arrays of Objects, The Comaparable and Comparator Interfaces, Sorting – Using Comparable, Sorting – Using Comparator, Collections, Lists and Sets, Iterators, Lists and Iterators Example, Maps, Maps and Iterators Example, The Collection Class

2. Advanced I/O (03) Introduction, Basic File I/O Example, Buffered I/O, The Console Class, Object Serialization, Serialization Issues, Writing your own I/O Classes, Property Files

3. Remote Method Invocation (RMI) (04) Introduction, RMI Architecture, The Remote Interface, The Remote Object, Writing the Server, The RMI Compiler, Writing the Client, Remote Method Arguments and Return Values, Dynamic Loading of Stub Classes, Exercises

4. Java Database Connectivity (JDBC) (04) Introduction, Relational Databases, Structured Query Language, A Sample Program, Transactions, Meta Data

5. Servlets (05) Definition, Basic Servlet Application Programming Interface (API), Servlet Architecture, Servlet Lifecycle, Creating Servlet Application file and Deploying application

6. JSP (05) Introduction to JSP, JSP vs. Servlet, JSP Architecture, Life cycle of JSP, JSP Elements, JSP Documents, Action Elements

7. Enterprize Java Beans (05) Introduction, Types of Enterprize Bean, Writing Enterprize Beans, Beginning with Enterprize Java Beans, Working with session beans, Working with entity beans

8. Struts (03) Struts Framework Basic, Understanding Stuts, MVC Architecture, Setting up Struts, Struts Flow Control

Text Books:-1. Java Server Programming for Professionals - Ivan Bayross, Sharanam Shah, Cynthia

Bayross and Vaishali Shah, 2nd Edition, Shroff Publishers Distributors Pvt. Ltd.2. Core Java, Volume II – Advanced Features - Cay S. Horstmann, Gary Cornel, 8th Edition3. Core Servlets and Java Server Pages, Volume 2, Advance Technology, 2nd Edition –

Marty Hall, Larary Brown, Yaakov ChaikinReference Books:-

1. Head First Sevlets and JSP – Bryan Bosham, Kathy Sierra, Bert Bates, O’ReilyPublication

Termwork : Practicals :Ten to Fifteen experiments at least one on each topic is expected, where students will be able

to use Eclipse, Net Beans and have hands on Strut Programming• Java SDK 6.0• Eclipse• Net Beans Platform

55

• Tomcat / Web Logic / Websphere


56

T.E. (Computer Science & Engineering) Part – II

7. SEMINAR

Practicals : 2hrs/week Term work : 50 marks--------------------------------------------------------------------------------------------------------

The groups of students of strength 4-6 should be formed by the end of T.E.-I. The project areas for the

group should be finalized by the end of 1st month of T.E.-II. Seminar should consist of a

presentation of about 30-40 minutes by every individual student. The seminar should be based on topics

in the area in which the students have carried on the literature survey and will work for their selected

project (whose title is finalized in TE Part – II) in the final year. A report on the seminar should be

submitted to the department. Assessment should be jointly done by panel of teachers

consisting of respective guide and other teachers from the department.


57


Revised Structure of B. E. (Computer Science & Engg.) Part – I & Part –II w.e.f. July 2010

Part – I

Sr.No


1 Advanced Computer Architecture 4 - - 100 - - - 100

2 Network Security 4 - 2 100 25 - - 1253 Distributed System 4 - 2 100 25 - 50 1754 Elective – I 4 - - 100 - - - 1005 VC ++ 2 - 4 - 25 - 50 756 Project – I - - 4 - 25 75 - 1007 Industry Institute Interaction - - - - 25 - - 25

Total 18 - 12 400 125 75 100 700

Part – II

Sr.No


1 Advanced Data Base System 4 - 2 100 25 - 50 1752 Mobile Computing 4 - - 100 - - - 1003 Principles of Mgmt. &

Engineering Economics3 - - 100 - - - 100

4 Elective – II 4 - - 100 - - - 1005 Web Technology 3 - 4 - 25 - 50 756 Project – II - - 6 - 50 - 100 150

Total 18 - 12 400 100 - 150 700

Elective – I Elective – II

1. Artificial Neural Network 1. Data Mining2. Object Oriented Modeling & Design 2. Software Testing & Quality Assurance3 Expert Systems 3. Bioinformatics.4. Digital Signal Processing 4. Image processing5. Information Retrieval 5. Pattern Recognition6. Embedded Systems 6. VLSI Technology7. Human Computer Interface

Note :

1. Minimum strength of the Students for Electives be 15.

2. The batch size for the practical/tutorials be of 15 students. On forming the batches,if the strength of remaining students exceeds 7 students, then a new batch may be formed. For Project the group shall be about 4 students.

58

B.E. (Computer Science & Engg. ) Part-I1. Advanced Computer Architecture

Lectures: 4 Hours / week Theory: 100 marksSection – I

1. Advanced Pipelining: (7) Instruction Level Parallelism: Concepts and Challenges, overcoming data hazards with dynamic scheduling, reducing branch penalties with dynamic hardware prediction.

2. Instruction Level Parallelism: ( 6 ) Taking advantages of more ILP with multiple issue, compiler support for exploring ILP, Hardware support for extracting more parallelism, studies of ILP.

3. Vector Processing: ( 7 ) Why Vector processor? , Basic vector architecture, two real world issues: Vector length and stride, effectiveness of compiler vectorization, enhancing vector performance.

Section – II

4. Interconnection Networks : (7) Tightly and loosely coupled architectures, cluster computing as an application of loosely coupled architecture, various topologies, Static and dynamic types of networks with examples.

5. Dataflow Architecture: ( 6 ) Concepts of dataflow computing, static and dynamic architectures, dataflow operators, dataflow language properties, advantages and potential problems.

6. Multiprocessors: (7) Introduction, characteristics of application domains centralized shared memory architecture, distributed shared memory architecture, synchronization, models of memory consistency

Text Books:1. Computer Architecture A Quantitative Approach – John L. Hennessy and David A. Patterrson.2. Advanced Computer Architecture – Kai Hwang.3. Advanced Computer Architecture and Parallel Processing - Kai Hwang and Briggs.

Reference Books:1. Computer organization – Hamacher Zaky – MGH2. Advanced Computer Architectures A design space approach – Sima, Fountain, Kacsuk- Pearson3. Computer Organization and Architecture-An Integrated Approach – Miles Murdocca, Vincent

Heuring – Wiley India (For Multiple Choice Questions)

Course Objective :• To impart good theoretical knowledge of advanced systems that will prepare them to learn all

system level subjects that will be useful in developing system level design for optimum performance.

• To make students aware with new technologies used in current architectures to meet the challenges of changing scenario in IT Sector at national & international level.

59

B.E. (Computer Science & Engg. ) Part-II2. Advanced Database System

Lectures: 4 Hrs. /Week Theory: 100 MarksPracticals : 2 Hrs./Week T/W : 25 Marks

POE : 50 Marks

Section I

1. Database Systems architectures (10 )Centralized & C/S architectures, Server systems, Distributed systems, Distributed databases – Homogeneous & heterogeneous databases, Distributed data storage, Distributed transactions, Commit protocols, Concurrency control in distributed databases, Availability, Distributed query processing, Heterogeneous distributed databases .

2. Parallel Databases (6)Integrated, I/O parallelism, Interquery parallelism, Intraquery parallelism, Intraoperation parallelism, Interoperation parallelism, Design of parallel systems.

3. Object Database System (6 )Overview, Complex Data Types, Structured Types and Inheritance in SQL, Table inheritance, Array and Multisets Types in SQL, Object Identity and Reference Types in SQL, Implementing O-R features, Persistent Programming Languages, Object Oriented versus Object Relational

Section II

4. Data Analysis and Mining (6) Decision Support Systems, Spatial databases, Temporal Databases, Data analysis and OLAP, Data Warehousing, Data Mining

5. Query Processing and Optimization: (6)Overview of Query Processing, Measures of query coat, Selection operation, join operation, Other operation, Overview of Query optimization, Introduction to Transformation of Relational Expressions, choice of evaluation plans, Materialized views.

6. Advanced Application Development (6) Performance Tuning, Performance Benchmark, Standardization, Application Migration

7. Advanced Transaction Processing (4) Transaction processing monitors, Transactional Workflows, E-commerce, Main Memory Databases, Real Time Transaction Systems, Long Duration Transactions, Transaction Management in Multidatabases

60

Text Book :

1. Database System Concepts – Abrham Silbertschatz, Henry F. Korth, S. Sudarshan, McGraw-Hill

Reference Book :

Practicals:

Minimum 8 assignments based on above topics.

Course Objective

Having introduced to databases, it is necessary to have a deeper approach in to databases, advanced techniques and tools. This course covers the state-of-the-art techniques to be made known to the students of final year.

61

B.E. (Computer Science & Engg. ) Part-I3. Distributed Systems

Lectures : 4 Hrs/Week Theory : 100 MarksPracticals : 2 Hrs/Week Term Work : 25 Marks

POE : 50 Marks.Section – I

1. Fundamentals : (6) Distributed Computing System, its models,Popularity,Distributed operating System,Issues in Designing Distributed Operating system

2. 2. Message Passing:Introduction,Desirable features,Synchronization,Buffering,Multidatagram Messages,Encoding & Decoding of Message data, Failure handling, Group communication:one to Many, many to one

(7)

3. 3 Remote Procedure CallsIntroduction,RPC Model,RPC mechanism,Stub generation,RPC messages,

(6) Marshaling

arguments & results,communication Protocols for RPCs client server binding , ExceptionHandling

Section-II

4. Process Management: (6) Introduction, Process migration, its desirable features, Process migration mechanisms, advantages of process migration, Threads, models for thread organization, Thread synchronization & scheduling.

4. Synchronization in distributed Systems : (7) Clock Synchronization, Event ordering,Mutual Exclusion,Deadlock,Election Algorithms

5. Distributed File Systems :Introduction,Desirable features of DFS,File models,File accessing models,File-Sharing semantics,File-caching schemes,File replication,Fault Tolerance.(7)

6. Distributed Operating Systems : ( 8 ) Case studies – Mach, Chorus , Unix emulation in Mach & Chorus.

Books :1. Distributed Operating Systems – concepts & design – P.K. Sinha(PHI)

Reference:1. Distributed Systems – Principles & Paradigms… A.S. Tanenbaum & Maarten Van Steen

(PHI)

Term Work : It should consist of 8-10 experiments based on the above topics.

Course Objective: This course is designed to provide the fundamental concepts of Distributed operating systems, its design issues, its various communication techniques, process management, message passing for IPC, synchronization techniques, distributed file systems &case studies ofsome Distributed Operating systems.

62

B.E. (Computer Science & Engg. ) Part-I4. Elective I

1. Artificial Neural Networks

Lectures: 4 Hours/week Theory: 100 Marks

Section – I

1) Introduction : 4 hrs. Biological neuron, Models of artificial neural networks, neural processing, neural network learning rules,

2) Learning & adaptation : 5 hrs. Classification Neural learning rules-Hebbian, perceptron, Delta, Widrow Hoof, Winner take all outstar learning rule.

3) Perceptron : 4 hrs. Discrete perception as a classifier, Decision and discrimenant functions, Linearly non separable patterns. Perceptron training for two class and multiclass dichotomizer.

4) Multilayer networks : 4 hrs. Delta learning rule for multiperceptron layer, Generalized Delta learning rule,

Feed forward recall and error back-propagation, Training algorithm.

5) Performance : 4 hrs. Madeline, Network pruning, Marchands, Neural tree and filing algorithm, Prediction

network.

Section – II

6) Unsupervised learning : 5 hrs. Winner take all networks, Hamming networks, Max net, competitive learning K-means clustering and LVQ algorithms, Adaptive resonance theory, ARTI,ALGORITHM, SELF ORGANIZING Kohanens map, Naocognitron.

7) Associative memories : 5 hrs. Non iterative procedures for association hop field networks, Discrete Hop field Networks storage capacity of Hop field networks. Continuous Hop field networks. Brain state in a box (B B networks Boltzmann machines Hetero associations.

8) Optimization techniques: 5 hrs. Optimization using Hop field networks. Traveling salesperson problem, Iterated gradient descent techniques. Simulated annealing technique, Random search technique genetic algorithm for optimization problems.

9) Application of ANN : 4 hrs. Character recognition, Speech recognition, Signature verification application, Human

face recognition.

63

Text Books : -

1 Introduction to Artificial Neural Systems – Zurada (JAICO)2 Elements of Artificial Neural Networks – Mehrotra, Hohan, Ranka (PENRAM)3 Introduction to Artificial Neural Networks – B. Yegnanarayana (PHI)

Ref. Books :1. An introduction to ANN by Anderson (PHI)2. Neural Networks a comprehensive foundation by Haykin (PHI)3. Elements of ANN by Mohan Ranka (Pearam Internatiional)

Course Objectives:This preliminary course of Artificial Neural Network enables a student to understand basic elements of Artificial Neural Network and make him use the same to develop higher level strategies for the betterment of the output established through this network. It helps a student to design and develop real world problems using neural computations.

64


2. Object Oriented Modeling And Design

Lectures: 4 hrs/week Theory: 100 MarksSection-I

1. Introduction: 4 hrs Object Oriented development and themes, evidence for usefulness, modeling as a Design Technique.

2. Object Modeling: 6 hrs Objects, classes, links and associations, generalization and inheritance, grouping constructs, aggregation, abstract classes, generalization as extension and restriction, multiple inheritance, metadata, candidate keys and inheritance.

3. Dynamic and Functional Modeling: 6 hrs Events, states, operations, concurrency, nested state diagrams, advanced dynamic modeling concepts, relation of object and dynamic models, DFD, relation offunctional to object and dynamic models

4. Implementation of OMT 6 hrs Use of programming language and database system, Object oriented style, feature of object-oriented languages, Applications of OMT like object diagram compiler, Computer animation

Section-II

5. Structural Modeling using UML: 6 hrsClasses, Relationships, Common mechanisms. Diagrams, Class Diagrams, Interfaces, Types and Roles, Packages, Instances and Object Diagram

6. Behavioral Modeling using UML: 6 hrsInteractions, Use cases, Use case diagram, Interaction Diagrams and Activity diagrams, Events and signals, State Machines, Processes and Threads, Time and space, State chart diagrams.

7. Architectural Modeling using UML: 6 hrs Components, Deployment, Collaboration, Patterns and Frame works, Component diagrams and Deployment Diagrams

Text Books:1. Object oriented Modeling and Design: Rambaugh, Premerlani, Eddy, Lorenson (PHI )2. The Unified Modeling Language User Guide: Grady Booch, Jeams Rambaugh, Ivar Jacotson(Addison Wesley)

Reference:Practical Object Oriented Design with UML – Mark Priestley.

1. UML-In a Nut Shell – Sinon Alhair

Course Objectives : To introduce a student with two base methodologies of modeling design in an object oriented scenario namely Object Modeling Technique and Unified modeling language. It enables a student to model and design real world problems.

65


3) Expert systemsLectures : 4 Hrs Theory : 100 Marks

Section – I1) Basics of expert systems : 8 hrs.Concepts and Definitions of Artificial Intelligence, Artificial Intelligence Versus Natural Intelligence, Types of Knowledge-Based Decision Support Systems, Basic Concepts of Expert Systems, Structure of Expert Systems, The Human element in Expert System, How Expert Systems Work, Benefits of Expert Systems, Types of Expert Systems, Expert Systems and the Internet/Intranets/Web.

2) Knowledge Acquisition and validation. 8 hrs. Knowledge Engineering, Scope of Knowledge, Difficulties in Knowledge Acquisition, Methods of Knowledge Acquisition : An overview ,Tracking Methods , Expert Driven Methods, Machine Learning: Rule Induction, Case-Based Reasoning, Neural Computing&Intelligent Agents, Knowledge Acquisition from Multiple Experts, Analyzing, Coding, Documenting and Diagramming, Knowledge Acquisition and the Internet/Intranets.

3) Knowledge Representation. 8 hrs. Introduction, Representation in Logic and other Schemas , Semantic Networks, Production Rules, Frames, Multiple Knowledge Representation, Experimental Knowledge Representations , Representing Uncertainty: An overview STRIPS planner, operator tables and means-end analysis,study of sub goaling, knowledge base, control structure and evaluationw.r.t. MYCIN.

Section – II

4) Inference Techniques. 8 hrs. Reasoning in Artificial Intelligence, Inferencing with Rules: Forward and Backward Chaining, The inference Tree, Inferencing with frames, Model-Based Reasoning, Case-Based Reasoning, Inferencing with Uncertainty, Representing Uncertainty, Probabilities and Related Approaches, Theory of Certainty (Certainty Factors ), Approximate Reasoning Using fuzzy Logic.

5) Intelligent S/W Agents and Creativity. 8 hrs.Intelligent Agents: An overview, Characteristics of Agents, Single Task, Why Intelligent Agents?, Classification and Types of Agents, Internet-Based Software Agents, Electronic CommerceAgents.

6) Tools for building expert systems. 8 hrs. Overview, shells, shells to tasks, inflexibility, constraints of production rule languages, multiple paradigm programming environments, software tools, the blackboard environment, tracing dependencies using TMS, Non monotonic justification brief functions, concept only of case based reasoning and hybrid systems.

66

Text books :1. Decision support & Intelligent systems 6th Edition by Efram Turban, Jay E. Aronson(Pearson Education)2. Introduction to Expert Systems- Peter Jackson (Addison Wesley)(Pearson Education)Asia

Ref. Books :1.. Artificial Intelligent by Patric H. Winston2. Expert Systems- Principles and Practice A Bonnet,JP Haton, J-M Troung NGOC (PrenticeHall)3. Decision support and Expert Systems- Management Support Systems Efrain Turban(MacmillanPublishing Company)4. A practical Guide to Designing Expert Systems-Sholon M. Weiss and casimir A Kulikowski(Rowmann Allanheld)

Course Objectives : This course aims at Introducing a student to expert systems . It revisits knowledge ,acquisition, validation, representation and inferencing techniques. A student is made acquainted with the tools for building expert systems to be used in real world application

67


4. Digital Signal Processing

Lectures : 4 Hrs/ Week Theory: 100 Marks

SECTION - I1: Discrete time signals & system: 6 Hrs Discrete time signal: sequences; discrete time system, classification; linear time invariant Systems, its properties; frequency domain representation of discrete time signals and systems; symmetry properties of the fourier transform, fourier transform theorems.

2: Z TRANSFORM : 5 Hrs Defintion and properties, the region of convergence; bilateral Z transform, inverse Z transform; Z transform properties.

3: DISCRETE FOURIER TRANSFORM: 8 Hrs Representation of periodic sequence: the discrete fourier series- properties; sampling in time and frequency domain; fourier representation of finite duration sequences; the discrete fourier transform-properties; linear convolution usinf the DFT; 2 dimensional DFT; discrete time fourier transform.

4: REALISATION OF DIGITAL LINEAR SYSTEMS: 5 Hrs Introduction, basic realization, block diagram & the signal flow graph; basic structures For IIR & FIR systems.

SECTION - II

5: DIGITAL FILTER DESIGN TECHNIQUES: 7 Hrs Design of IIR digital filters from analogue filters; properties of FIR digital filters; Design of FIR filters using windows; comparison of IIR and FIR filters, linear phase Filters.

6: COMPUTATION OF THE DISCRETE FOURIER TRANSFORMS: 7 Hrs Decimation in time algorithms; decimation in frequency Algorithms; FFT algorithms for an N composite number ; General computational Considerations in FFT algorithms; chirps Z transform algorithm.

7: DISCRETE HILBERT TRANSFORM: 5 Hrs Real and imaginary part sufficiency for casual sequences; minimum phase condition; Hilbert transform relations for the DFT and the complex sequences.

8: DSP PROCESSORS 3 HrsTMS 320 Architecture, Applications

BOOKS:TEXT BOOKS:1: Oppenhiem Schaffer,” DISCRETE TIME SIGNAL PROCESSING “(PHI),20012: Proakis J.G ,” INTRODUCTION TO DIGITAL SIGNAL PROCESSING” (PHI),19973. TMS 320 Data sheet and Manual

Course Objectives : To introduce a student to analyses Digitals inn time and frequency domains and to use. Digital Signal Processors to create applications where signal transformations are required.

68


5. Information Retrieval

Lectures: 4 Hrs/week Theory : 100 MarksSection – I

1. Information Retrieval & IR Models : (6) Information retrieval and data retrieval, Information retrieval process, A Formal Characterization of IR Models, Classic Information Retrieval, Structured Text Retrieval Models, Models For Browsing, Retrieval Performance Evaluation-Recall and Precision

2. Query Languages: (4) Keyword based querying, Pattern Matching, Structural Queries.

3. Text and Multimedia Languages and Properties : (4) Text data & formats, Multimedia Data & formats.

4. Indexing and Searching : (5) Inverted Files and Indices for text search, Boolean Queries, Sequential searching, Pattern Matching, Structural Queries.

Section – II

5. Multimedia IR - Models and Languages : (4) Data Modeling & Query Languages.

6. Multimedia IR - Indexing and Searching : (5) A generic multimedia indexing approaches, One dimensional time series, Two Dimensional color images, Automatic Feature Extraction.

7. Searching the Web: (6) Search Engines ,Browsing, Metasearchers, Searching using Hyperlinks

8. Digital Libraries : (4) Architectural issues of Digital Libraries, Document models, Representation, and Access.

Text Book -1. Modern Information Retrieval - Ricardo Baeza-Yates and Berthier Ribeiro- Neto - Pearson Education (Low Price Edition)Reference :1 www.dcc.ufmg.br/irbook or sunsite.dcc.uchile.cl/irbook2 http://nlp.stanford.edu/IR-book/information-retrieval-book.html3 Information Storage and Retrieval- Robert R Korthage, WILEY-INDIA

Course Objectives : This course introduces students with the principles of information retrieval from text, multimedia and web . During the course students has to undergo different mathematical models and algorithms for the same.

69


6. Embedded Systems

Lectures: 4 Hrs / Week Theory: 100 Marks

Objective: Embedded system tools and products are evolving rapidly. This course deals with various approaches to building embedded systems. It introduces unified view of hardware and software. The aim of this course is to make the students aware of the various applications of embedded systems.

Pre-requisites: Microprocessors, Microcontrollers and C Programming

Section – I

1. An overview of embedded systems: (8) Introduction to embedded systems, Categories and requirements of embedded systems, Challenges and issues related to embedded software development, Hardware/Software co-design, Introduction to IC technology, Introduction to design technology

2. Embedded Software development: (8) Concepts of concurrency, processes, threads, mutual exclusion and inter-process communication, Models and languages for embedded software, Synchronous approach to embedded system design, Scheduling paradigms, Scheduling algorithms

3. Real Time Operating System: Introduction to RTOS, Basic design using RTOS (4)

SECTION-II

4. Parallel Interface Standards: (8) Various methods of interfacing, Parallel I/O interface, IEEE 1284, ISA, PCI, Parallel Prot interface with keyboard, switches and display units.

5. Serial Interface Standards: IEEE 1394, USB, I2C, SPI, UART. (8)

6. Case studies and Applications of embedded systems: (4) Case Studies of: Digital Camera, Coffee wending machine, Network Router

Text Books:1. Raj Kamal, “Embedded Systems”, TMH2. Vahid ,”Embedded System” WILLY INDIA3. Muhammad Ali Mazidi and Janice Gillispie Mazidi, “The 8051Microcontroller and EmbeddedSystems", Pearson Education

Referance:1. K.V.K.Prasad, ”Embedded Real time systems” Willy India2. David E. Simon, “An Embedded Software Primer ", Pearson Education

70


7. Human Computer Interface

Lectures :4 Hours/week Theory: 100 Marks

Section I

1. Human Computer Interface : Introduction , Brief History . (4)

2. User Interface Design : Models , Principles, Practices (4)

3. Direct Manipulation : Overview, Scope, Application (4)

4. Cognitive Framework of HCI : Perception & Representation, Attention and InterfaceDesign, Memory in Interface Design, Knowledge Representation (12)

Section II

5. User Modelling : Interaction with Natural Languages, Next Generation Interface (4)

6. Evaluation: UI Evaluation : Introduction, Cognitive Walkthrough (20)

Heuristic Evaluation

Evaluation with Cognitive Models

Evaluation with Users

Model-based Evaluation

Textbooks :

1. Human-Computer Interaction, 3rd edition, by Dix, Finlay, Abowd and Beale, PrenticeHall, 2003.

Course Objectives : To introduce a student to human computer interfaces, their designs , applications, cognitive frame work and to use them in modeling and interaction with natural languages to develop next generation interfaces for real world problems .

71

B.E. (Computer Science & Engg. ) Part-I5. Visual C++

Lectures : 2 Hrs/Week T/W : 25 MarksPractical : 4 Hrs /Week POE : 50 Marks.

1. Introduction to Windows Operating system. Developing window application in SDK. Detail study of Windows messages. (2)

2. Introduction to GDI –understanding DC, scrollbars, drawing lines, dots, GDI mapping modes, drawing filled areas. (4)

3. Working with keyboard & mouse – understanding keyboard &mouse basics, keyboard messages, mouse messages, capturing mouse (2)

4. Working with Window controls – study of various buttons, study of controls, edit box, scrollbars list box etc. (2)

5. Working with menus – adding icons, cursor, custom resources, adding menus to application, enabling disabling menu items. (2)

6. Working with Dialog boxes – modal dialog box ,modeless dialog box, common dialog box(3)

7. Working with clip board – standard data formats, memory allocation, transferring data to the clip board, getting data from clipboard. (2)

8. Developing Multiple Document Interface (MDI ) & Dynamic Linked Libraries (DLL) (2)

9. Introduction to MFC. Creating SDI application. (1)

10. Implementation of View and Documents. (2) Defining and initializing view class data members, Storing and deleting the document data, scrolling and splitting views.

11. Study of Documents & Views (2) Understanding document template, using documents & views together

Text Books :1. Programming Windows fifth edition by Charles Petzold Microsoft press2. Mastering Visual C++ 6.0 –Michael J. Young – Techmedia

Reference Books :1. Programming Visual C++ by david Kruglinski,shepherd,Wingo Microsoft press2. Complete Reference VC++ 6 – Pappas Murray (TMGH).3. MFC Programming from the ground up by Herbert Schildt (TMH )4. Visual C++ Programming vol – I by Yashwant kanetkar

15

72

Course Objective:There are two objective of the course1. It helps to focus on totally new and different software development ie. Windows GUI

Programming.2. To get acquainted with core working of Window Message Processing and Window API

List of Practical

1. Study of Different Windows Operating System2. Write a skeleton program for creating any application window.3. Study and Implementation of various GDI functions.4. Implementation of Keyboard and mouse messages5. Implementation of Shopping cart using child window controls.6. Study and implementation of resources : cursors, icon and string table7. Implementation of menus and dialog boxes and implement its messages.8. Create a DLL for matrix addition , multiplication and substraction.9. Create a window using MFC10. Create a MDI application.

73

B.E. (Computer Science & Engg. ) Part-I6. Project -I

Practical : 4Hrs/Week Term Work : 25

Oral : 75

1. A project group shall be about 4 students.

2. Students have to study existing system, problems in existing system, proposed system, its

definition, scope, design, introduction to programming tools, hardware and software

platforms, planning, activity charts, planning for testing, test case design etc.

3. Project leader should maintain the progress register in which each members weekly

contribution should be written and the guide will countersign the same.

4. A project design report will be submitted as a term work document at the end of semester.

74

B.E. (Computer Science & Engg. ) Part-I

7. Industry Institute Interaction

Term Work : 25

The student should attend an industrial training arranged at Industry or Institute and should

complete a mini project on the technology on which training was given. A report regarding

satisfactory completion of the training should be submitted to the college by competent authority

from Industry / Institute. The evaluation of Term Work will be carried out by a panel of

Examiners decided by the institute.

75

B.E. (Computer Science & Engg. ) Part-II1. Network security

Lectures: 4 Hrs/Week Theory: 100 MarksPractical 2 Hrs/Week Term Work : 25 Marks

Section – I1) Symmetric Ciphers: 6 hrs. Overview – Services, Mechanism and Attacks, the SI Security. Architecture, A model for network security Classical Encryption techniques – Symmetric Cipher model, Substitution. Techniques, Transposition techniques, Rotor Machines, Steganography.

2) Block Cipher and Data Encryption Standard: 6 hrs. Simplified DES, Block. Chiper principles, The Data Encryption Standard, The strengthof DES,Differential and Linear Cryptanalysis, Block Cipher design principles, Block Cipher mode of Operation.

3) Public Key Cryptography: 5 hrs. Public Key Cryptography and RSA – Principles of Public Key Cryptosystems, The RSA Algorithm Key management; other public key cryptosystems – Key Management,Diffe-Hellman Key Exchange, Elliptical Curve Arithmetic, Elliptical curve Cryptography

4) Message Authentication and HASH Functions: 6 hrs. Authentication requirements, Authentication Functions, Message Authentication Codes, Hash Functions,security of Hash Functions and MACS Digital Signatures and Authentication Protocols–Digital Signatures, Authentication Protocols, Digital Signature Standard.

Section – II

5) Authentication Applications and Electronic Mail Security: 6 hrs. Authentication Applications – Kerberos, X.500 Authentication Service Electronic Mail Security – Pretty Good Privacy, S/MIME

6) IP Security: 6 hrs.IP Security Overview, IP Security Architecture, Authentication Header, Encapsulating security payload, Combining Security Associations, Key Management ,Secure Socket Layer and Transport Layer Security, Secure Electronic Transaction.

7) Web Security: 6 hrs. Privacy on internet, Privacy consideration in web services, Privacy in semantic Web, Privacy consideration in the use of Context-Sensitive Technologies, Security and privacy aspect of service oriented architectures.

8) System Security: 4 hrs. Intruders – Intruders, Intruder detection, Password Management, Malicious Software – Viruses and Related Threats, Virus Countermeasures, Firewall design principles, Trusted system.

76

Text Book:

1.Williams Stallings–Cryptography and Network security principles and practices. Pearson Education (LPE)2.Nina Godbbole --Information systems security-Security management, metrics, frameworks and best practices(WILEY)

Reference Books:

1 Menezes, A.J., P.C.Van Oorschot, and S.A.Vanstone, “Handbook of Applied Cryptography”2 Schneir, Bruce, “Applied Cryptography: Protocols and Algorithms”

Course Objectives:This preliminary course of Network security enables a student to understand basic elements ofsecurity in the network, internet and web technology .Keeping data, information and, knowledge secure from intruders and competitors. To achieve this understanding information and communication systems from a security viewpoint. It has provided aspects of information systems, their corresponding security risks and how to embark on a strategic approach to reducing and preferably, eliminating those risks. This is relevant to industry practice helps a student to design and develop real world problems.

77

B.E. (Computer Science & Engg. ) Part-II2. Mobile Computing

Lectures: 4 Hrs/Week Theory: 100 Marks

Section – I

1. Introduction to wireless communication: (2) Introduction, Need and Applications of wireless communication, Mobile and wireless devices.

2. Wireless transmission : (5) Frequencies for radio transmission, signals, antennas, signal propagation, Multiplexing, Modulation, Spread spectrum and Cellular systems.

3. Medium Access Control : (5) Specialized MAC, SDMA, FDMA, TDMA and CDMA.

4. Telecommunication Systems : (10) GSM– Mobile services, System architecture, Radio interface, Protocols, Localization and calling, Handover, Security, New data services

Section – II

5. Wireless LAN : (10) Introduction, Infrared v/s Radio transmission, Infrastructure and ad-hoc networks, IEEE802.11, HIPERLAN, Blue Tooth.

6. Mobile Network Layer : (5) Mobile IP, DHCP.

7. Mobile Transport Layer : (6) Traditional TCP, Indirect TCP, Snooping TCP, Mobile TCP, Fast and selective retransmission& recovery, Transaction oriented TCP.

Books :1. Mobile Communications – Jochen Schiller-II Edition (Addison-Wesley).2. Wireless LAN – Peter T. Davis, Craig R. Mc Guffin (MGH International Edn).3. The Wireless Application Protocol – Sandeep Singhal, Jari Alvinen and Group

(Addison-Wesley).

Term Work : It should consist of 8-10 assignments on above topics with emphasis on designing & solving problems on above mentioned topics.

Course Objective of Mobile Computing

• To give good theoretical background that will prepare them to learn the state-of-the-art technology of mobile communication that will be useful in developing a successful professional career.

• To introduce students with new technology used in Mobile Communication to meet thechallenges of changing scenario in IT Sector at national & international level

78

B.E. (Comp. Science & Engineering) Part II3. PRINCIPLES OF MANAGEMENT & ENGGINEERING ECONOMICS

Theory : 100 Marks Lectures : 3 Hr./WeekSECTION I : Principles of Management

1. Forms of business organizationIntroduction, Types of Business Organisations, Private companies, Partnership organization, joint stock companies, private and public Ltd. Companies, Co operative‐ society, Govt. Department organization, public corporation, Government Corporation

2. Functions of ManagementPlanning, Types of planning, strategic planning, organizing, stuffing, directing leadership, communication, motivation, supervision, controlling, coordinating

3. Organisation StructureIntroduction, Characteristic, departmentalism, Authority,span of control, matching of job, direction of labour, lateral relationship, delegation, policies, objectives, goals & mission ,chain of command, types of organization structure, line or scalar, staff & functions, committee organization, organization chart.

4. Organisation BehaviourMotivation, types of motives, work motivation approaches, the content theory of work motivation, process theory of work motivation, contemptory theory of work motivation

5. Group DynamicsDefinition, classification of groups, nature of work group, stages of group development, group cohesiveness, Group performance, group norms, work teams, types of teams

SECTION II : Engineering Economics1. Terminology & Basic concepts technology :

Terminology : Microeconomics, macroeconomics, wealth, goods, wants, value, value ahead price, capital money income, margin, utility etc.Basic concepts: Demand & supply, Theory of demand and supply, price mechanism, production,factors of production, land, labour, capital and organisation.

2. Break even AnalysisFixed & variable cost,Break even point : Theory , mathematical & graphical method, non linear‐ break even analysis, numerical problems, Method of lowering break even point.Applications of break even analysis & numerical problems based on above.

3. Indian financial systemBanking : Duties & commercial bank systems, public sector bank, clearing flowers, finance from bank.

Text Books :1. Industrial Engineering & Management – O.P. Khanna2. Industrial Organisation & Management – Benga & Sharma3. Organisational Behaviour 10th edition – Fred Luthans4. Organisational Behaviour, 9th Edition – Stephen P. Robbins

79

B.E. (Computer Science & Engg. ) Part-II4. Elective – II

1) DATA MINING

Lectures : 4 Hrs. /Week Theory :100 MarksSection I

1.INTRODUCTION :What is data mining, Data mining-On what kind of data, data mining functionalities, data mining applications, classification, major issues in data mining, data mining tools, KDD.

2.DATA PRE-PROCESSING :Need of pre-processing, Data cleaning, Data integration &transformation, data reduction, Discretization & concept hierarchy generation

3.Clasification – Introduction, stastical Based algorithms,Distance based algorithms,Distance based algorithms, rule based algorithms

4.Clustering :

Introduction, Similarity and Distance meaures, Outliers, Hierarchical algorithms, partionalAlgorithms, Clustering large Databases. Partitonal Algorithms,

5. Association Rules, Introduction, Large Item sets and basic algorithms.

6. Advanced Topics :

Web Mining, Introduction, Web content Mining, Web structure Mining, Web Usage Mining Spatial Mining, Introduction ,Spatial Data Overview, primities, Rules, Classification Temporal Mining-Introduction, Modelling Temporal events, Pattern detection, Sequence, Temporal association rules.

7. RECENT TRENDSApplication , System Product and research prototypes, Multimedia data Mining Indexing of multimedia material , compression, space modelling

BOOKS :1. J. Han, M. Kamber, “Data Mining: Concepts and Techniques”, Harcourt India / MorganKauffman, 2001.2. Margaret H.Dunham, “Data Mining: Introductory and Advanced Topics”, Pearson Education2004.3. Sam Anahory, Dennis Murry, “Data Warehousing in the real world”, Pearson Education 2003.4. David Hand, Heikki Manila, Padhraic Symth, “Principles of Data Mining”, PHI 2004.4. W.H.Inmon, “Building the Data Warehouse”, 3rd Edition, Wiley, 2003.

Course Objectives : This course introduces a student with the basic techniques of mining data and how it can be used to develop application and analyse real world problems.

80

B.E. (Computer Science & Engg. ) Part-II4. Elective-II

2) Software Testing & Quality Assurance

Lectures : 4 Hrs./Week Theory: 100 Marks

Section-I1) Basic Concepts and Preliminaries 6 hrs.

Quality Revolution, Software Quality, Role of Testing, Verification and Validation, Failure, Error, Fault, and Defect, Notion of Software Reliability, Objectives of Testing, What is a Test Case? , Expected outcome, Concept of Complete Testing, Central Issues in Testing, Testing Activities, Test Levels, White-Box and Black-Box Testing, Test Planning and Design Test tools and Automation

2) Software measurement & metrics data collection 6 hrs. Measurement in software engineering, classifying software measures, applying the framework, software measurement validation. Definition, storing, extraction and collection of data, analyzing software measurement data analyzing results of experiments, simple analysis techniques, more advanced methods, Overview of statistical test.

3) Software Engineering Measurement 4 hrs. Size: software size, length, reuse, functionality, complexity. Structure: Types of structure measure, control flow structure, Modularity and information flow attributes, Object oriented metrics, Data structures.

Section-II

4) Software Testing Techniques: 8hrs Unit Testing, Control Flow Testing, Data Flow Testing, Domain Testing, System Integration, System test Categories, Functional Testing, System Test Design, System Test Planning and Automation, System Test Execution, Acceptance Testing

5) Software Reliability 8 hrs. Definitions of Software Reliability, Factors Influencing Software Reliability Applications of software Reliability, operational Profiles, Reliability Models Test Groups, Software Quality Assurance Groups, Effective Staffing of Test Engineers, Recruiting Test Engineers, Retaining Test Engineers, Team Building

6) Software Quality 4 hrs.Five Views of Software Quality, McCalls Quality Factors and Criteria,ISO 9126 Quality Characteristics, ISO 9000:2000 Software Quality Standard.

81

Text Books:

1) Software Testing and Quality Assurance: Theory and Practice, Sagar Naik, Piyu TripathyISBN:978-0-471-78911-6, Wiley publications

2) Software Metrics – A rigorous & practical approach- Norman Fenton, Shari Lawrence Pfleeger (THOMSON – BROOKS)

Reference Books:

1) Software Testing – A practical approach, Er.Rajiv Chopra (S.K.KATARIA & SONS)2) Software Requirement & Estimation – Swapna Kishore, Rajesh Naik.3) Stephen H. Kan, “Metrics & Models in Software Quality Engineering”, Pearson

Education, ISBN 81-297-0175-8.4) Ramesh, Bhattiprolu, “Software Maintenance”, Tata McGraw Hill, ISBN 0-07-

048345-0

Course Objectives for Software Testing & Quality Assurance

This course should result inUnderstanding the principles of development of software required to build applications. Demonstrate the features of software used at system level.Create software that are interface between Hardware & User.

82


3. BioinformaticsLectures: 4 Hrs/week Marks:100

Section I

1. Introduction to Bioinformatics (4) Introduction, Historical overview, Bioinformatics Applications, Tools for web search, Basic concepts- Protein and amino acid, DNA and RNA, Data mining of biological databases.

2. Bioinformatics Databases: (10) Introduction, Primary & Secondary database, GenBank Flat File dissection, GCG, ACDEB Introduction to structures, PDB, MMDB, Structure file formats, Visualizing structural information, Database structure viewers.

1. The Biological Databases and NCBI Database: (05) Integrated information retrieval: The entrez system, sequence databases beyond NCBI, Medical Databases, SeqIDS, Bioseq: Sequences, Bioseqsets: Collections of sequences, Seq. Annot: Annotating the sequence, Seqdiscr: Describing the sequence

3. Sequence and Multiple Alignment and Database Searching: (05) Introduction, Evolutionary basis of sequence alignment, Optimal alignment methods, Substitution scores & gap penalties, Statistical significance of alignments, Progressive alignment methods, Motifs and patterns, Hocks, MOST, Probe, Presentation methods, Abscript,Database similarity searching, FASTA, BLAST, Low complexity regions, Repetitive elements

4. Phylogenetics: (05) Why phylogenectics, Elements of phylogenetic models, data analysis: Alignment, substitution model building, tree building and tree evaluation, building methods, searching for trees, hooting trees, Evaluating trees and data, Computer tools for phylogenetic analysis-Distances, Growtree,Paup,Phylip.

SECTION II

5. Predictive Methods Using Nucleotide Sequence: (06)Framework, marking repetitiveDNA, Database search, Codon bias detection, Detecting function sites in the DM, Integrated gene passing, Finding tRMA genes

6. Predictive methods Using Protein Sequences: (08) Protein identity based on composition, Propsearch, Physical properties based on sequences, secondary structure and folding classes, Sspread sopma, Specialized structures of features, Tertiary structure,

7. Genome Mapping: (05) Different types of maps: physical, genetical, etc. Synteny, Human genome project, Application of genome mapping, Chromosome maps.

8. Submitting DNA Sequences to the Databases: (05) Introduction, Where to submit, What to submit, How to submit on the world wide web, How to submit with sequin.

83

Text Book :

1. Bioinformatics: A practical guide to the analysis of genes and proteins A.D. Baxevanis andB.F.F. Ouellette (Eds). 2002 John Wiley and Sons.2. Bioinformatics: Sequence and Genome Analysis by D.W. Mount, 2001, Cold Spring HarborLaboratory Press.3. S.C. Rastogi, Namita Mendirata, Parag Rastogi ‘’Bioinformatics concepts Skills and application, CBSpublisher

Reference Book:

1. Introduction to bioinformatics: a theoretical and practical approach ,By Stephen A. Krawetz, David D. Womble

2. Discovering Genomics proteomics and Bioinformatics by A. Malcolm Campbell and L.J. Heyer

Objective:To have a basic understanding of how the collection of individual nucleotide bases drives the engine of life, large amounts of sequence data must be collected and stored in a way that these data can be searched and analyzed easily by the bioinformatics

84


4. Image ProcessingLectures: 4 Hrs / Week Theory: 100 Marks

Section – I

1. Image , digitized image & it’s properties : 8Elements of visual perception & its attributes,Digitised Image - image function, mathematical representation. Image digitization - Sampling & Quantization,Properties - distance , pixel adjacency, region, background, holes, brightness, segmentation, border, edge , convex hull , histograms, color, Noise.Image analysis - Level of image data Representation Traditional & hierarchial data structure.

2) Image pre – processing : 6Brightness transformation, geometric transformation, Local Processing, Image smoothing and edge detection, Introduction to Image restoration.

3) Image enhancement in special domain : 6Threshold, Edge-based segmentation, Edge relaxation, Border tracing, Hough transform. Region-based segmentation, Region merging, Region splitting, Split & Merge.

Section – II

4) Image Enhancement in frequency domain : 7Fourier Transform,1-D & 2-D, DFT, Handmard Transform , Discrete CosineTransforms, Introduction to Wavelet Transform, Application of Image transform.

5) Space reorientation and Detection: 7Region Identification, Contour-based representation. Chain codes, B-Splinereorientation, Region –based representation, moments, Convex Hull.

6) Image Compression : 6Redundancy & fidelity criteria , Error free compression, Methods of compression,standards, Binary , continuous tone still, Video.

Text Book :1) Computer vision & Image processing - by Milan Sonaka.2) Digital Image Processing - by Gonzalez ( Addision Wesley)

Reference:3) Elements of Digital Image Processing & Computer Vision – by Andrew

Low(MGH)4) Digital Image Processing - Pratt.5) Fundamentals of digital Image Processing – by A. K. Jain

Objective: This syllabus is designed to explore several image processing techniques, and learn to improve images with them. Extract quantitative data from images.

85


5) Pattern RecognitionLectures : 4 Hrs/week Theory :100 Marks

Section - I1.Introduction : (6)The Information-Handling Problem , Basic Concepts of Pattern Recognition, Fundamental Problems in Pattern Recognition System Design, Design Concepts and Methodologies ,Examples of Automatic Pattern Recognition Systems, A Simple Automatic Pattern Recognition , Model

2.Decision Functions : (6) Introduction ,Linear Decision Functions Generalized Decision Functions ,Pattern Space and Weight Space, Geometrical Properties Implementation of Decision Functions, Functions of several variables.

3.Pattern Classification by Distance Functions (6) Introduction , Minimum-Distance Pattern Classification, Cluster Seeking, Unsupervised Pattern Recognition.

4.Pattern Classification by Likelihood Functions (6) Introduction, Pattern Classification as a Statistical. Decision Problem. Bayes Classifier for Normal Patterns , Error Probabilities, A Family of Important Probability Density Functions, Estimation of Probability Density Functions.

Section - II

5. Trainable Pattern Classifiers-The Deterministic Approach (6) Introduction, The Perceptron Approach, Derivation of Pattern Classification Algorithms, Multicategory Classification,, Learning and Generalization, The Potential Function Approach.

6. Trainable Pattern Classifiers-The Statistical Approach . (6) Introduction, Stochastic Approximation Methods ,Derivation of Pattern Classification Algorithms, The method of Potential Functions.

7.PatternPreprocessing and Feature Selection (6) Introduction, Distance Measures ,Clustering Transformations and Feature Ordering Clustering in Feature Selection, Feature Selection Through Entropy Minimization Feature Selection Through Orthogonal Expansions Feature Selection Through functional Approximation, Divergence Concept, Feature Selection Through Divergence Maximization, Binary Feature Selection.

8. Syntactic Pattern Recognition (6) Introduction, Concepts From Formal Language Theory, Formulation of the Syntactic Pattern Recognition Problem , Syntactic Pattern Description, Recognition Grammars, Statistical Considerations, Learning and Grammatical inference, Automata as Pattern Recognizers.

86

Text Book : Pattern Recognition Principles by Julius T. Tou, Rafael C. Gonzalez(Addison Wesley Publishing Company)

Ref. Book : 1. Pattern Recognition & Image Analysis by Earl Gose & Richard Johnson BaughSteve Jost (PHI)

2. Syntactic Pattern Recognition & Applications by K. S. FU (PHI)3. Pattern Recognition - Statistical Structural & Neural Approaches by Robert

Schalkoff ( Wiley India Edition)

Course Objectives :This course introduces students with the principles of pattern recognition required for identifying and analyzing patterns from the real world data . It involves techniquesfor pattern classification, preprocessing feature selection and syntactic pattern recognition.

87

B.E. (Computer Science & Engg. ) Part-II

4. Elective-II

6 ) VLSI TECHNOLOGYLectures : 4 hrs / week Theory : 100 Marks

1.Digital Design:Section – I

Characteristics (Power dissipation ,Noise margin ,Fan in, Fan out) , Single channel MOS inverter, CMOS inverters, CMOS gates, Transmission gates , Delays and loading consideration.

2.Finite State Machines:(6)

Sequential and combitional circuit design , Moore and Mealy machine, Design examples using PLD’s- Barrel shifter ,Synchronous controllers, Timing considerations. (8)

3.Architecture of VLSI processors:CPLD and FPGA, ARM/SPARTAN, The architecture of above in Xilinx and Altera with specifications, block diagram and their comparison. Multiplex & demultiplex keyboard and display interface. (9)

Section-II4.VHDL: (9)Introduction, entity, architecture , configuration/behavior, package declaration, dataobjects, data types, operators, attributes. Statements: process, variable ,signal ,wait ,if then, when, null next, exit. Overloading , VHDL code for various sequential , combinational circuit , state machines. Multiplexed and non multiplexed keyboard and display interface.

5.EDA Tools: (8) Information on a complete tool from design entry to place and route with optimization considerations, Information to EDA tools for simulation and synthesis, Design of Test bench.

Text book:1.VLSI Design Techniques for analog and digital circuitsRandall L. Geiger ,Phillip E. Allen, Noel R.Strader2.VHDL primer ,J.Bhasker.3.Digital Design- principles and practices ,Wakerly .4.VHDL Analysis and Modeling of digital systems , Navabi.5.Xilinx manual

Course Objective : To introduce students with the basic architecture of VLSI processors. To use VHLD to analyze and model digital systems and to use EDA tools for simulation, synthesis and Design of applications.

88

B.E. (Computer Science & Engg. ) Part-II5. Web Technology

Lectures: 3Hrs / Week Term Work: 25 MarksPractical : 4 Hrs/Week POE : 50 Marks

1. HTML, CSS and XHTML (3 hrs) HTML features, syntax , Lists, Links, Tables, Frames, Forms , Colour and images, multimedia,scripts and DHTML, Css basics,style definations, CSS values and Units, CSS inheritance and Cascade, layouts , connectivity with database .

2.XML Primer: (3 hrs) Introduction, Benefits, components of XML, XML schemas DTD, Parsing XML, Parsing methodologies, X Link, X pointer, X Include, XBase, XML Technologies & applications viz. E- Commerce, XLS: Overview, applications and programming with XLS.

3.JSP ( 4 Hrs)JSP overview, JSP language basics, JSP translation and compilationDirectives, Standard java objects from JSP, JSP configuration and deployment, Actions and tags of JSP; Java servlets – Arch, servlets interface, applications of Servlets.

4.ASP and ASP.NET: ( 4 Hrs) Overview of ASP, features, Database, Relational Database model – Overview, SQL – ASP – Working of ASP – Objects – File System Objects – Session tracking and cookies – ADO – Access a Database from ASP – Server side Active-X ComponentsASP.NETOverview of ASP.NET- ASP.NET IDE, Features, ASP vs. ASP.NET, Developing Web Application-creating web application, executing web application, ASP.NET execution model, and Web form attributes. Standard controls- Label, Textbox, Button, and List box, Radio button, Image Button.Navigation Controls-Sitemap Path, Tree view, Menu. Validation and login controls.

5.Web services: (4 Hrs)

Introduction to web services, , service oriented architecture and web services, web services application scenario.Simple object access protocol (SOAP) SOAP introduction, interaction, SOAP modeling SOAP Encoding, SOAP binding.) Web services description language What is WSDL, Web services invocation & WSDL, Web services Description details, Service Description through WSDL. Registers: Universal description, Discovery and Inteqratron, What is UDDI, UDDI nomenclature, care UDDI, Services publication, services discovery.

6.PHPandMySQL (6hrs) Introduction to PHP, variables and constants, program flow, functions, arrays and files and directories,Forms and Databases, integration with Mysql .applications on Php .

89

7.RubyonRails (6hrs) Introduction , rails in depth using active record,Controller in depth abd view in depth, Devloping applications on ruby on rails.

Practicals :10-15 Practicals on each Topics of the above

Reference & Textbooks: 1. Web Technologies – Black Book – Dreamtech Willey Publications2. HTML, XHTML, CSS – Stevan Schafer Wiley india3. Web Design Technology- D.P. Nagpal, S.Chand3. Head First Servlets and JSP Bryan Bashan, Kathy Sierra and Bert Bates – O’reilly4. Web Engineering – Gerti Kappel, Birgit Proll, Siegfried Reich – John Wiley & Sons Ltd5. Web Services – An Introduction – By B.V. Kumar, S.V. Subrahmanya Tata McGraw HillPublication6. Ruby on Rails – Timothy Fisher – Wiley India7. Php and Mysql - Steve Suehring – Wiley India

References :

1. Head First HTML with CSS and XHTML, Elizabeth Freeman and Eric Freeman –O’reilley2. Head First Servlets and JSP Bryan Bashan, Kathy Sierra and Bert

Course Objective : To introduce student with technologies required to build and engineer web sites and to evaluate the performance of websites . These technologies can also we use for developing applications using websites and portals.

90

B.E. (Computer Science & Engg. ) Part-II6. Project -

II

Lectures: 6 Hrs / Week Term Work : 50 MarksPOE : 100 Marks

1. Project –II should contain the work like Design review, Implementation details,

coding, Technologies used, Testing, Task distribution. Project leader should maintain

the progress register in which each members weekly contribution should be written

and the guide will countersign the same.

2. A project report will be submitted as a term work document at the end of semester.

Report must include References, Appendix, User manual / Technical reference

manual, CD containing Project documentation, implementation, code, required

utilities, Software and Manuals.

3. Every student must prepare well formatted, printed and hard bound report.

91

92

Syllabus of CSE (SE,TE,BE)deptt.(2008-10)

Documents

marks term work

practical work

hrsweek theory

computer science engg

tutorial practical

laboratory term work

theory of inference

hrweek theory