UGSyllabus_CSE

1

UG Syllabus BE- Comp Sc

I & II SEMESTER COMP SCIENCE (MAY 09)

CSE-101/102 PROBLEM SOLVING USING COMPUTERS

[3 0 0 3] 1. INTRODUCTION TO COMPUTERS:

Block diagram of a computer, computer memories, operating system basics, working

with MS-Windows environment. (2hrs)

2. ALGORITHMS AND FLOWCHARTS – Definitions, Symbols of Flowcharts,

Examples of Flowcharts and algorithms for a variety of problems ranging from the

reasonably simple ones such as finding the largest of 3 nos., largest of “n” numbers to

relatively complicated problems such as Matrix operations including matrix.

(4 hrs.)

3. C++ FUNDAMENTALS-

The C++ character set, identifiers and keywords, data types, variables, declarations,

statements, C++ program structure. Simple I/O operations. (3 hrs.)

4.OPERATORS AND EXPRESSIONS-

Operator precedence and associativity, arithmetic operators, relational operators, logical

operators, increment and decrement operators, bitwise operators, assignment operators,

type conversions. (4 hrs.)

5.FLOW OF CONTROL-

Statements and blocks, branching control, repetition control, break and continue

statements. (6 hrs.)

6.DERIVED DATA TYPES-

1-D arrays, 2-D arrays, strings, structures, pointers( pointers to simple variables, pointers

to arrays, basic operation on pointers, pointers to strings), Structures & Unions, pointers

to structures and their use. (8 hrs)

7. FUNCTIONS-

Modular programming, library functions and user- defined functions, function

declaration, definition and call, parameter passing techniques, function overloading,

default arguments, inline functions. I/O format specifications

(7 hrs.)

8. INTRODUCTION TO OBJECT ORIENTED PROGRAMMING-

2

Procedure oriented programming versus object oriented programming, basic concepts of

object oriented programming, benefits of object oriented programming, C++ as object

oriented programming language. (2 hrs.)

References:

1. E.Balaguruswamy, Programming in ANSI C, 2

nd Edition, - TataMcGraw Hill.

2. E. Balaguruswamy Object Oriented Programming with C++: - 2nd

edition -

Tata McGraw Hill.

3. Herbert Schildt, C++ : The Complete Reference 4th edition - Tata McGrawHill.

4. Robert LaFore, Galgotia Object Oriented Programming with Turbo C++ -

Publications, 2002.

CSE 111/112 PROBLEM SOLVING USING COMPUTERS LAB. 3 1 0 4

--13 weeks

1. Familiarization with PC and MS Window basic operations.

2. Flowcharting exercises.

3. Simple C++ Programs (expression oriented operations)

4. Experiments using Control Structures

5. Experiments on Arrays (1 and 2D)

6. Experiments on Structures and use of Pointers

7. Test 1

8. Experiments using built-in-functions.

9. Experiments using user defined functions..

10. Experiments using class declarations and operations on objects.

11. Experiments using MS-Word and PowerPoint.

12. Experiments in the use of Excel.

3

13. Test-2.

References:

1. E.Balaguruswamy, Programming in ANSI C, 2nd

Edition, - TataMcGraw Hill.

2. E. Balaguruswamy Object Oriented Programming with C++: - 2nd

edition -

Tata McGraw Hill.

III SEMESTER COMP SCIENCE

MAT –CSE-201 : DISCRETE MATHEMATICAL STRUCTURES

[3 1 0 4]

1 Formal Language syntax, semantics and Grammar.

Boolean Algebra: Lattices and Algebraic systems, Principle of Duality, Basic

Properties of Algebraic Systems defined by Lattices. Distributive and

complemented lattices, Boolean lattices and Boolean Algebra, Uniqueness of

Finite Boolean Algebras, Boolean Functions and Boolean Expressions

2. Predicate Calculus:

Definition of well formed formula, connectives, quantifications, Examples and

properties of well formed formula into clausal form. Resolution by refutation.

Answer extraction, simple examples.

3. Elementary configuration:

Permutations and Combinations, Generating function, Principle of inclusion and

exclusion (statement only). Partitions, compositions. Lexicographical and Fikes

ordering of permutations, Algorithms for Generating Functions.

4. Graph theory:

Representation of graphs, adjacency and incidence Matrices, Algorithms: for

finding shortest path. Dijkstraa's Algorithms.

5. Group theory :

Cosets, normal groups and subgroups.

4

Codes and Group codes.

Text Books: 1. C.L.Liu : Elements of Discrete Mathematics, 1986, Mc Graw Hill.

2. J.P.Trembaly and R.Manohar: Discrete Mathematics Structures with application to

computer science, edn., 1987, Mc Graw Hill.

3. E.S.Page and L.B.Wilson : An introduction to computational combinatroics, edn.,

1979, Cambridge Univ. Press.

4. Narasingh Deo : Graph theory with Applications to computer science, PHI, 1987

edn.

CSE-203 COMPUTER ORGANIZATION AND DESIGN [3 1 0 4]

1.Basic structure of Computers:

Computer types, Functional units, Basic operational concepts, Bus structures,

Software.

(1.1,1.2, 1.2.1 to 1.2.5,1.3,1.4, 1.5 of text 1) (2 hrs)

2. Machine instructions and programs:

Numbers, arithmetic operations and characters, Memory locations and addresses,

Memory operations, Addressing modes.

(2.1 to 2.5.5 of text 1) (3 hrs)

3. Execution unit:

Introduction, Register section, Addition and subtraction of signed numbers,

Adders, ALU design, Bit slice processor, Multiplication of positive numbers

Signed operand multiplication, Fast multiplication, Integer division, Floating

point numbers and operations

(3.1 of text 2) (3.2, 3.2.1, 3.2.2 6.1, 6.1,. 3.3 of text 2 and 6.2 of text 1, 3.4 , 3.5 of

Text 2, 6.3 6.4, 6.4.1, 6.5, 6.5.1, 6.5. 6.6 6.7, 6.7.1, 6.7.2, 6.7.3, 6.7.4 of text 1)

(14 hrs)

4. Control unit:

Introduction, Basic concepts, Design methods,

(4.1 to 4.3.2 of text 2) (11 hrs)

5. Memory systems:

5

Basic concepts, RAM memories, Read only memories, Speed size and cost,

Cache memories, Performance considerations, Virtual memories, Memory

management requirements, Secondary storage

(5.1 ,5.2, 5.2.1, 5.2.2, 5.2.5, 5.2.6, 5.3, 5.3.1 to 5.3.5, 5.4, 5.5, 5.5.1 to 5.5.3, 5.6,

5.6.2 to 5.6.3, 5.7, 5.7.1,5.9, 5.9.1 to 5.9.2 of text 1) (10 hrs)

6. Input/output organization:

Accessing I/O devices, Interrupts, Direct memory access, Buses, Interface

circuits

(4.1, 4.2, 4.2.1 to 4.2.5 ,4.4, 4.4.1, 4.5, 4.5.1 to 4.5.2,4.6, 4.6.1, 4.6.2 of text 1)

(8 hrs)

Textbooks: 1. Carl Hamacher, Zvonko Vranesic and Safwat Zaky, (2002) “Computer

Organization”, Fifth edition, McGraw Hill International Edition .

2. Mahammed Rafiquzzaman and Rajan Chandra, (2004) “Modern Computer

Architecture”, Galgotia Publications pvt. Ltd.

References: 1. John P. Hayes, (December 1, 1997) “Computer Architecture and Organization” ,

McGraw-Hill Companies; 3rd edition.

6

CSE- 205 SWITCHING THEORY & LOGIC DESIGN

[3 1 0 4]

1. Introduction to Logic Circuits:

Variables and functions, Inversion, Truth tables, Logic gates and networks,

Boolean algebra, Introduction to VHDL, Synthesis using AND OR and NOT

gates,

(Chapter 2 (except 2.5.1,2.5.2,& 2.5.3,2.7,2.8) and appendix A of text1, ref:

Chapter 2, 3 and 4 of reference) (8 hrs)

2. Optimized Implementation of Logic Functions:

Karnaugh map, Strategy for minimization, Minimization of POS forms,

Incompletely Specified Functions, Multiple output circuits NAND and NOR

logic networks, multilevel NAND and NOR circuits, Analysis of multilevel

circuits

(Chapter 4 of textbook1 up to 4.8 (except 4.7, 4.7.1, 4.7.2)) (8 hrs)

3. Arithmetic circuits:

Positional number representation, Addition of unsigned numbers, Signed

numbers, Fast adders, Design of arithmetic circuits using VHDL, BCD

representation,

(Chapter 5 (5.1 to 5.5 (except 5.5.1),5.7.3) of textbook1, ref: Chapter 6 of

reference ) (10 hrs)

4. Combinational Circuit Building Blocks:

Multiplexer, Decoder, Encoder, Code converter, Arithmetic comparison

circuits, VHDL for Combinational Circuits

7

(Chapter 6 of textbook1) (8hrs)

5. Flip Flops, Registers ,Counters

(Chapter 7 (up to and including 7.13)(except 7.12.1 and 7.13.1) of textbook1 )

(10 hrs)

6. Synchronous Sequential Circuits:

Basic Design Steps

(Chapter 8(only 8.1) of textbook1) (2hrs)

7. Overview of Digital Integrated Circuits:

Overview of semiconductor diode, BJT, MOSFET, TTL – standard, High

speed, low-power, low-power schotky, CMOS logic-NAND,NOR.

(Only specified topics from chapter 14 of text book 2) (2 hrs)

Text books:

1. Stephen Brown and Zvonko Vranesic, (2000 ),“Fundamentals of digital logic

with VHDL design” Tata McGraw Hill Publishing Co. Ltd..

2. Donald P. Leach, Albert Paul Malvino, Goutam Saha,(2006), “Digital

Principles and Applications”, 6th

Edition, Tata McGrawHill Publishing Co.

Ltd.

References: 1. J. Bhasker, (2005),“A VHDL Primer” , 3

rd Edition, PHI Pvt. Ltd.

8

CSE-207 DATA STRUCTURES USING C [3 1 0 4]

1. Pointers :

Concepts, Pointer variables, accessing variables through pointers, pointer

declaration and definition, initialization of pointer variables, pointers and

functions, pointers to pointers compatibility, LVALUE and RVALUE.

( 9-1 to 9-9 of text 2) (4 hrs)

2. Pointer Applications:

Arrays and pointers, pointer arithmetic and arrays, passing an array to a function

understanding complex declarations, memory allocation functions, array of

pointers.

(10.1 – 10.6 of text 2) (4 hrs)

3. Strings :

String concepts, C strings, string input/output functions, array of strings, string

manipulation functions, memory formatting.

(11.1 – 11.6 of text 2) (4 hrs)

4. Derived types :

The type definition, enumerated types, structures, accessing structures,

complex structures, arrays of structures, structures and functions, unions.

(12.1 – 12.8 of text 2) (4 hrs)

5. Binary files :

Classification of files, using binary files, standard library functions for files

9

(13.1 – 13.3 of text 2) (4 hrs)

6. The stack :

Definition and examples, Representing stacks in C, An example : infix,

postfix and prefix

(2.1 – 2.3 of text 1) (4 hrs)

7. Recursion :

Recursive definition & processes, Recursion in C, writing recursive programs

Simulating recursion, efficiency of recursion

(3.1 – 3.5 of text 1) (3 hrs)

8. Queues and lists:

The queue and its sequential representation, linked lists, lists in C simulation

using linked lists other list structures

(4.1 – 4.5 of text 1) (10 hrs)

9.Trees :

Binary trees, binary tree representation, The Huffman Algorithm, representing

lists as binary trees, trees and their applications, game trees.

(5.1 – 5.6 of text 1) (8 hrs)

10.Graphs and their applications:

Graphs, a flow problem, A linked representation of graph, Graph traversal &

spanning forests

(8.1 – 8.4 of text 1) (3 hrs)

Text Books:

1. Aaron M. Tenenbaum,Yedidyah Langsam,Moshe J. Augeustein,(2006),”Data

structures using C”, PEARSON Education.

2. Behrouz A. Forouzan, Richard F. Gilberg ,(2003), “A structured programming

Approach using C”,Thomson, 2nd

Edition.

References : 1. Richard F. Gilberg, Behrouz A. Forouzan,(2005), “Data structures, A

pseudocode Approach with C”, Thomson.

2. Robert Kruc & Bruce Lening, (2007), “ Data structures & program design in

C”, Pearson Education.

10

CSE- 209 OBJECT ORIENTED PROGRAMMING USING C++

[3 1 0 4]

1. Introduction to C++:

Object-Oriented Programming Systems, Comparison of C++ with C, Reference

Variables in C++, Function Prototyping, Function Overloading, Default Values

for Formal Arguments of Functions, Inline Functions.

( Selected topics from text 1) (3 hrs)

2. Class and Objects:

Introduction to Classes and Objects


3. Class and Objects contd:

Member Functions and Member Data, Objects and Functions, Objects and Arrays,

Namespaces, Nested classes.


4. Dynamic Memory Management:

Introduction, Dynamic Memory Allocation, Dynamic Memory Deallocation, The

set_new_handler( ) function. (3hrs)

( Selected topics from text 1)

5. Constructors and Destructors:

Constructors, Destructors, the Philosophy of OOPS.


11

6. Inheritance:

Introduction to Inheritance, Base Class and Derived Class Pointers, Function

Overriding, Base Class Initialization, The Protected Access Specifier, Deriving by

Different Access Specifiers, Different Kinds of Inheritance, Order of Invocation

of Constructors and Destructors.


7. Virtual Functions and Dynamic Polymorphism:

The Need for Virtual Functions, Virtual Functions, The mechanism of virtual

functions, Pure virtual functions, Virtual destructors and Virtual constructors.

( Selected topics from text 1) (4hrs)

8. Stream Handling:

Streams, The class hierarchy of handling streams, Text and Binary Input/Output,

Text Versus Binary Files, Text Input/Output, Binary Input/Output.


9. Stream Handling contd.:

Opening and Closing Files, Files as Objects of the fstream class, File Pointer,

Random Access to Files, Object Input/Output through Member functions, Error

Handling, Manipulators.


10. Operator Overloading:

Operator Overloading, Overloading the various operators- Overloading the

Increment and the Decrement Operators (Prefix and Postfix), Overloading the

Unary Minus and the Unary Plus Operator, Overloading the Arithmetic

Operators.( Selected topics from text 1) (5hrs)

11. Operator Overloading contd;: :

Overloading the Relational Operators, Overloading the Assignment Operator,

Overloading the Insertion and Extraction Operators, Overloading the new and the

delete Operators, Overloading the subscript operator, Overloading the Pointer-to-

member(->) Operator (Smart Pointer)


12. Templates:

Introduction, Function Templates, Class Templates, The standard Template

Library (STL)


13. Exception Handling:

12

Introduction, C-Style handling of error generating codes, C++ Style solution – the

try/throw/catch construct, Limitation of exception handling.


Text Book: 1. Sourav Sahay,(2006), “Object-Oriented Programming with C++”, Oxford

University Press.

References: 1. Stanley B. Lippman, Josee Lajoie, Barbara E. Moo, (2005), “C++ Primer”, 4

th

Edition, Addison Wesley.

2. Herbert Schildt, (2005), “The Complete Reference C++”, 4th Edition, TMH.

CSE-211 SWITCHING THEORY & LOGIC DESIGN LAB USING

VHDL.

[0 1 2 2]

Simulation of the following logic circuits using VHDL code

1, Introduction to MAXPlussII and Verification of logic gates

(Refer Appendix B of text book1)

Behavioural model (usage of sequential assignment statements)

2. Simplification of Boolean algebra

3. Simplification of expressions using Kmap.

4. Experiments on multilevel NAND, NOR circuits.

5. Experiments on arithmetic circuits.

6. Experiments on multiplexers

7. Experiments on decoders and encoders

8. Experiments on code converters and comparator.

9. Experiments on FFs, registers.

13

10. Experiments on counters

Structural model (usage of concurrent signal assignment statements)

11. Writing VHDL code using structural model for some basic circuits-1.

12. Writing VHDL code using structural model for some basic circuits-2.

Additional experiments: Exercises on application specific design examples

References:

1. Stephen Brown and Zvonko Vranesic, “Fundamentals of digital logic with VHDL

design”, Tata MGH 2000

2. J. Bhasker, “A VHDL Primer” , 3rd

Edition, PHI Pvt. Ltd. 2005

CSE-213 DATA STRUCTURES USING C LAB

[ 0 1 2 2 ] 1. Review of C

2. Review of C

3. Recursion

4. Stacks 1

5. Stacks 2

6. Queues 1

7. Queues 2

8. Lists 1

9. Lists 2

10. Trees 1

11.Trees 2

12. Graphs

14

References:

1. Aaron M. Tenenbaum, Yedidyah Langsam, Moshe J. Augeustein, Data

structures using C, PEARSON Education | PHI 2006

2. Behrouz A. Forouzan, Richard F. Gilberg, A structured programming,

Approach using C 2nd

Edition, Thomsan 2003.

CSE-215 OBJECT ORIENTED PROGRAMMING USING C++ LAB

[0 1 2 2]

1. Review of functions, structures

2. Structures, character pointers

3. Character pointers contd.

4. Classes, friend functions

5. Templates, overloaded functions

6. Constructors, static members

7. Dynamic alloc, destructors, operator overloading

8. Same as above

9. Matrix, stack classes

10. Single, doubly lists

11. Inheritance

12. Files

References: 1. Stanley B. Lippman, Josee Lajoie, Barbara E. Moo, (2005), “C++ Primer”, 4

th

Edition, Addison Wesley.

2. Herbert Schildt, (2005), “The Complete Reference C++”, 4th Edition, TMH.

IV SEMESTER COMP SCIENCE

15

MAT-CSE- 202: PROBABILITY, STATISTICS AND STOCHASTIC

PROCESS

[3 1 0 4]

1. Axioms, Definition of probability, conditional probability total probability theorem,

Baye’s theorem, applications.

2. One dimensional random variables, mean and variance, Chebyschev’s inequality.

3. Two dimensional random variables, mean, variance, covariance, correlation

coefficient, Distributions, Binomial, Poisson, Normal and Chisquare.

4. Moment generating functions, functions of random variables F & T distributions,

Sampling theory : distribution, Central limit theorem. Point estimation, MLE, Interval

estimation. Test of Hypothesis : significance level, certain best tests.

5. Stochastic Process: Classification statistics of stochastic process, stationary and

Ergodic Process.

Text Books:

1. P.L.Meyer : Introduction to probability and Statistical Applications.

2. K.S.Trivedi : Probablity, Statistics with Reliability, Queuing and computer science

applications. PHI, 1988.

3. Miller, Freund and Johnson, Probability and Statistics for Engineers, 4th

Edn, PHI,

1990.

16

CSE-204: FORMAL LANGUAGES AND AUTOMATA THEORY [3 1 0 4]

1. INTRODUCTION TO THE THEORY OF COMPUTATION AND FINITE

AUTOMATA :

Mathematical Preliminaries and Notation, Three basic concepts, Some

Applications, Deterministic Finite Accepters, Nondeterministic Finite Accepters,

Equivalence of Deterministic and Nondeterministic Finite Accepters,

Reduction

of the Number of States in Finite Automata.

(Chapter 1.1 - 1.3, 2.1 - 2.4 of Text 1) (8 hrs)

2. REGULAR LANGUAGES, REGULAR GRAMMARS AND PROPERTIES OF

REGULAR LANGUAGES:

Regular Expressions, Connection between Regular Expressions and Regular

Languages, Regular Grammars, Closure Properties of Regular Languages,

Elementary Questions About Regular Languages, Identifying Nonregular

Languages.

(Chapter 3.1 - 3.3, 4.1 - 4.3 of Text 1) (8 hrs)

3. CONTEXT-FREE LANGUAGES AND SIMPLIFICATION OF CONTEXT-FREE

GRAMMARS AND NORMAL FORMS

Context-Free grammars, Parsing and Ambiguity, Context-Free Grammars and

Programming Languages, Methods for Transforming Grammars, Two important

Normal Forms.

(Chapter 5.1-5.3, 6.1-6.2 of Text 1) (8 hrs)

4. PUSHDOWN AUTOMATA AND PROPERTIES OF CONTEXT-FREE

LANGUAGES

Nondeterministic Pushdown Automata, Pushdown Automata and Context–Free

Languages, Deterministic Pushdown Automata and Deterministic Context-Free

Languages, Two Pumping Lemmas, Closure Properties and Decision Algorithms

for Context-Free Languages.

(Chapter 7.1-7.3, 8.1.-8.2 of Text 1) (8 hrs)

5. TURING MACHINES AND OTHER MODELS OF TURING MACHINES:

17

The Standard Turing Machine, Combining Turing Machines for Complicated

Tasks, Turing’s Thesis, Minor Variation on the Turing machine Theme, Turing

Machine with more Complex Storage, Nondeterministic Turing Machine, A

Universal Turing Machine, Linear Bounded Automata.

(Chapter 9.1-9.3, 10.1-10.5 of Text 1) (8 hrs)

6. A HIERARCHY OF FORMAL LANGUAGES & AUTOMATA AND LIMITS OF

ALGORITHMIC COMPUTATION:

Recursive and Recursively Enumerable Languages, Unrestricted Grammars,

Context Sensitive grammars and Languages, The Chomsky Hierarchy, Some

Problems that cannot be Solved By Turing Machines, Undecidable Problems for

recursively Enumerable Languages, The Post Correspondance Problem,

Undecidable Problems for Context-Free Languages.

(Chapter 11.1- 11.4, 12.1-12.4 of Text 1) (8 hrs)

Text Book:

1. Peter Linz, (2006), “ An Introduction To Formal Languages and Automata”,

Fourth Edition, Narosa Publishing House.

References: 1. John C Martin, (2002), “ Introduction to Languages and the Theory of

Computation” , Third Edition, McGraw Hill.

2. J E Hopcroft, Rajeev Motwani & Jeffrey D Ullman ,(2006), “ Introduction to

Automata Theory, Languages and Computation”, 3rd

Edn. Pearson Education .

3. Raymons Greenlaw, H. James Hoover, (1998), “ Fundamentals of the theory of

Computations – Principles and Practice “, Morgan Kaufmann Publishers .

18

CSE -206 RELATIONAL DATABASE MANAGEMENT SYSTEMS

[3 1 0 4]3 1 0 4]3 1 0 4]3 1 0 4]

1.Introduction :

Database-System Applications, Purpose of Database Systems, View of Data,

Database Languages, Relational Databases, Database Design, Data Storage and

Querying, Transaction Management, Database Architecture, Database Users and

Administrators, Oracle: System Architecture.

(Chapter 1 Sections 1.1-1.6,1.8,1.9,1.11-1.12; Chapter 27: Section 27.6 of Text 1)

(3 hrs)

2.Relational Model:

Structure of Relational Databases, Fundamental Relational-Algebra

Operations, Additional Relational-Algebra Operations, Extended Relational-

Algebra Operations, Null Values, Modification of the Database

(Chapter 2 Sections 2.1 – 2.6 of text 1) (5 hrs)

3. SQL

Data Definition, SQL Data Types and Schemas, Integrity Constraints, Basic

Structure of SQL Queries, Set Operations, Aggregate Functions, Null Values,

Nested Subqueries, Complex Queries, Views, Modification of the Database,

Joined Relations, Authorization, Authentication, Oracle: SQL Variations and

Extensions

(Chapter 3 Sections 3.2 – 3.11; Chapter 4 Sections 4.1 – 4.3; Chapter 8: Section

8.7;Chapter27:Section 27.2 of Text 1) (8 hrs)

4. Database Design and the E-R Model

Overview of the Design Process, The Entity-Relationship Model, Constraints,

Entity- Relationship Diagrams, Entity-Relationship Design Issues, Weak Entity

Sets,Extended E-R Features, Reduction to Relational Schemas, Other Aspects of

DatabaseDesign

(Chapter 6 Sections 6.1– 6.10 of Text 1) (6 hrs)

19

5. Relational Database Design

Informal Design Guidelines for Relation Schemas, Functional Dependencies

Normal Forms Based on Primary Keys, General Normal Form Definitions,

Boyce-Codd Normal Form, Properties of Relational Decompositions, Algorithms

for Relational Database Schema Design, Multivalued Dependences and Fourth

Normal Form, Join Dependencies and Fifth Normal Form

(Chapter 8 Sections 8.1 – .9 of Text 2) (7 hrs)

6. Storage and File Structure

Overview of Physical Storage Media, Magnetic Disks, RAID, Storage Access,

File Organization, Organization of Records in Files, Data-Dictionary Storage

(Chapter 11.1 – 11.3; 11.5 – 11.8 of Text 1) (4 hrs)

7. Indexing and Hashing

Basic Concepts, Ordered Indices, B+ -Tree Index Files, B-Tree Index Files,

Multiple-Key Access, Static Hashing, Dynamic Hashing, Comparison of Ordered

Indexing and Hashing, Bitmap Indices, Index Definition in SQL, Oracle: Storage

andIndexing

(Chapter 12 Sections 12.1 – 12.10; Chapter 27: Section 27.3 of Text 1) (8 hrs)

8. Transaction Management

Transaction Concept, Transaction State, Implementation of Atomicity and

Durability,Concurrent Executions, Serializability, Recoverability, Implementation

of Isolation, Testing for Serializability, Lock-Based Protocols, Log-Based

Recovery, Oracle: Concurrency Control and Recovery

(Chapter 15 Sections 15.1 – 15.8; Chapter 16 Section 16.1; Chapter 17: 17.1 –

17.5;Chapter27:Section27.5ofText1) (7 hrs)

Text Books:

1. Silberschatz, Korth, Sudarshan, (2006) “Database System Concepts”,

McGrawHill, 5th

Edition .

2. Ramez Elmasri and Shamkant Navathe, Durvasula V L N Somayajulu, Shyam K

Gupta,(2006) “Fundamentals of Database Systems”, Pearson Education.

References:

1. Thomas Connolly, Carolyn Begg, (2002) “Database Systems – A Practical

Approach to Design, Implementation and Management”, Pearson Education, 3rd

Edition.

2. Peter Rob, Carlos Coronel, (2007) “Database Systems – Design, Implementation

and Management”, Thompson Course Technology, 7th Edition.

20

3. Ivan Bayross, (2005) “SQL, PL/SQL”, BPB Publications, 3rd

Revised Edition.

CSE-208 MICROPROCESSORS [3 1 0 4]

1. Microprocessors and its architecture:

Internal microprocessor architecture, Real mode memory addressing , Protected

Mode, Memory addressing, Memory paging.

(2.1-2.4 of Text 2) (4 hrs)

2. 8086 family assembly language programming:

8086 internal architecture, Introduction to programming the 8086, assembler and

Assembler directives, Simple sequence programs, Jumps, Flags, and conditional

jumps, Loop instructions, Instruction timing and delay loops.

(3.1,3.19,4.1-4.8,4.22-4.33 of Text1) (8 hrs)

3. Strings, Procedures, and Macros:

The 8086 String instructions, Writing and Using Procedures and Macros.

(5.1-5.39 of Text1) (6 hrs)

4. 8086 Interrupts and Interrupt Applications:

8086 Interrupts and Interrupt Responses, 8259 Priority Interrupt Controller, 8254

Software-Programmable Timer/counter, Software interrupts: DOS 21h functions,

BIOS INT 10h display and input functions and Programming examples.

(8.1-8.11, 8.17-8.40 of Text1 & 7.2,7.4.7.5 of Text2) (5 hrs)

5. 8086 System connections Timing:

Functional diagram, reset and wait state, Min and Max mode operation, Min

and max mode input, output timing diagrams.

(7.12-7.41, 11.1-11.4 of Text1) (4 hrs)

6. Digital Interfacing:

Programmable Parallel ports and Handshake Input/ Output, Direct memory

Access (DMA) data transfer, A coprocessor- The 8087 Math Coprocessor, ISA

Bus, PCI Bus, USB Bus, Accelerates graphics port (AGP)

(9.1-9.23,11.5-11.9,11.23-11.38,14.48 of Text1 & 15.1, 15.5 0f Text2) (8 hrs)

7. The 80286, 80486, and Pentium Processors:

21

Architecture, Real address and PVAM mode, Task protection and Task

Switching, Paging.

(15.11-15.41, 16.2 of Text1) (8 hrs)

8. 68000Microprocessor:

Architecture, addressing modes, Instruction set, Simple assembly language

programs.

(2.1-2.6 of Text3) (5 hrs)

Textbooks: 1. Douglas V. Hall, (2006) “Microprocessors and Interfacing ”, Revised Second

Edition Tata McGraw Hill Publications Ltd.

2. Barry B. Brey, (2005) “The Intel Microprocessors”, Seventh Edition, Prentice

Hall India.

3. Alan Clements, (1997) “Microprocessor system design 68000 Hardware ,

Software, and Interfacing” Third Edition, PWS Publishing company.

22

CSE -210 EVENT-DRIVEN PROGRAMMING USING JAVA

[3 1 0 4] 1. Overview Of Java

Object Oriented Programming Byte Code Concept, Java Buzzwords,

A First Simple Program, Data Types, Variables And Arrays, Primitive wrapper

classes, Operators For Self Study, Control Statements, Classes And Methods,

Inheritance

(Chapters 1-8, And 16 For 1.4 of Text 1) (13 hrs)

2. Packages And Interface

Packages, Access Protection, Importing Packages, Interface

(Chapter 9 of Text 1) (4 hrs)

3. Exception Handling

Exception Handling Fundamentals, Exception Types, Using Try And Catch,

Multiple Catch Clauses, Nested Try Statements, Throw, Throws, Finally

Creating Own Exception Subclass.


4. Multithreaded Programming

The Java Thread Model, Creating Thread, Creating Multiple Threads,

Synchronization, Interthread Communication

( Chapter 11 of Text 1) (4 hrs)

5. Input/Output

The Java I/O Classes And Interface, File, Standard Streams – System.In,

System.Out, System.Err - Their Purpose And Usage, The Byte Streams - Input

Stream, Output Stream, File Input Stream, File Output Stream, Print Stream,

The Character Streams – Reader, Writer, File Reader, File Writer, Buffered

Reader, Buffered Writer, Printwriter, Serialization – Use Of Object Input

Stream And Object Output Stream.

(Chapter 13 & 19 Only Above Mentioned Classes of Text 1) (3 hrs)

6.The Applet Class

23

Applet Fundamentals, Applet Basics, Applet Architecture, An Applet Skeleton,

Simple Applet Display Methods, Requesting Repainting, Passing Parameters

To Applets

( Chapter 13 And 21 of Text 1) (3 hrs)

7. Event Handling

Two Event Handling Mechanisms, The Event Delegation Modes, Event

Classes (ActionEvent, AdjustmentEvent, MouseEvent, WindowEvent,

KeyEvent, TextEvent) Sources Of Events, Event Listener Interface

(ActionListener,AdjustmentListener,MouseListener,MouseMotionListener,

Keylistener, WindowListener,TextListener), Adapter Classes, Inner Classes


8.Introduction The Awt: Working With Windows , Controls , Layout Managers

Awt Classes, Window Fundamentals, Working With Frame Windows,

Creating a Frame window From Applet, Controls, Labels, Using Buttons,

Understanding Layout Managers, Menu Bars And Menus, Dialog Boxes, File

Dialog

(Chapter 23 And 24 of Text1: Only Above Mentioned Topics) (5 hrs)

9. Data Bases

Data Bases Introduced, Jdbc: The Java Database Connectivity, Jdbc Explored

(Reference Book 2) (2 hrs)

10. Swings

Japplet, Icons And Labels, Text Fields, Buttons , Combo Boxes, Tabbed

Panes, Scroll Panes,Trees, Tables,


11. Servlets

Background, The Life Cycle Of The Servlet, The Java Servlet Development

Kit – Bin, Lib, Examples Directories, Their Purpose And Usage, The Simple

Servlet, The Servlet Api, The Javax.Servlet Package – Servlet Interface With

Init( ) And Service ( ); Servlet Config Interface With Get Initparameter ( );

Servlet Request Interface With Get Reader( ),Get Parameter Values( ), Get

Inputstream ( );Servlet Response Interface With Get Output Stream ( ),

Setcontent Type ( ), Reading Servlets Parameters, Reading Initialization

Parameters, Usage Of Servlet Properties File, The Javax.Servlet.Http Package,

Handling Http Requests And Responses.

(Chapter 31 of Text 1 ) (4 hrs)

Textbook:

24

1. Herbert Schildt, (reprint: 2007 ) “The Complete Reference JAVA ”, Seventh

Edition, TMH, New Delhi.

References:

1. Steven Holzner, “Java 2 programming black book ( reprint: 2005)” , DreamTech,

New Delhi.

2. PratikPatel & KarlMoss , (reprint:2005 ), ”Java database programming with

JDBC” (2000), second edition, DreamTech, NewDelhi.

3. .E. Balaguruswami, (2007),”Programming with Java Primer “,3rd

edition, TMH

NewDelhi.

CSE -212 RELATIONAL DATABASE MANAGEMENT SYSTEMS

LAB [ 0 1 2 2 ]

1. A small DB application development with MS Access

2. Experiments on DDL and Basic SQL

3. Experiments on Advanced SQL

4. Experiments on Data Integrity Constraints and Built-in Functions

5. Design and Implement the data requirements of a simple DB application

6. Experiments on Basic PL/SQL

7. Experiments on PL/SQL Exceptions and Transactions

8. Experiments on PL/SQL Cursors

9. Experiments on PL/SQL Procedures, Functions and Packages

10. Interfacing Database with a front end: ODBC/JDBC

11. A small DB application development with VB as front end.

12. A small DB application development with Java as front end.

References:

1. Thomas Connolly, Carolyn Begg, (2002) “Database Systems – A Practical

Approach to Design, Implementation and Management”, Pearson Education, 3rd

Edition.

2. Peter Rob, Carlos Coronel, (2007) “Database Systems – Design, Implementation

and Management”, Thompson Course Technology, 7th Edition.

3. Ivan Bayross, (2005) “SQL, PL/SQL”, BPB Publications, 3rd

Revised Edition.

25

CSE- 214 MICROPROCESSORS LAB

[ 0 1 2 2 ]

1. Simple Programs using 8086

2. Number Crunching

3. Array Handling

4. String Manipulation

5. Programs using DOS Interrupt

6. Programs using BIOS Interrupts

7. Logic Controller Interfacing & Programming

8. Seven Segment Display Interfacing & Programming

9. Programming for Elevator Interfacing & Keypad Interfacing

10. DAC Interfacing & Programming

11. A/D Interfacing & Programming

12. Stepper motor Interfacing

References:

1. Barry B. Brey, “The Intel Microprocessors”, Fourth Edition, Prentice Hall

India, 1997.

2. Steven Armbrust and Ted Forgeron, “Programmer’s Manual for IBM Personal

Computers”. Intel Hand book, Galgotia Publications (P) Ltd., 1992.

3. B. Govinda Rajulu, “IBM PC and -Hardware, Trouble shooting and

Maintenance”, Tata McGraw Hill Publications Limited, 1991.

4. Douglas V. Hall, “Microprocessors and Interfacing Programming and

Hardware”, Tata McGraw Hill Publications Ltd.

26

CSE -216 : JAVA PROGRAMMING LAB

[ 0 1 2 2 ]

1. Control statements and arrays

2. Stacks and Lists

3. Strings ,Classes and methods

4. Inheritance and Packages

5. Interfaces, Exception Handling.

6. Threads and Input/Output

7. Applets and Event Handling

8. Programs involving AWT and Swings

9. Programs involving AWT and Swings

10. Implementation of JDBC

11. Implementing simple Servlets

12. Implementation of Servlets

References:

1. Herbert Schildt , “The Complete Reference Java ”, Seventh Edition

2. E. Balaguruswamy, “Java Programming Language”, Second Edition

3. Art Gittleman, “Ultimate Java Programming”, Second Edition, Dreamtech

V SEMESTER COMP SCIENCE

CSE-301 DESIGN & ANALYSIS OF ALGORITHMS

[3 1 0 4]

1.Introduction:

27

What is an Algorithm ?, Fundamentals of Algorithmic ‘Problem Solving,

Important Problem Types, Fundamental Data Structures

(Chapter 1.1 – 1.4 of Text 1) (4hrs)

2. Fundamentals of the Analysis of Algorithm Efficiency:

Analysis Framewor, Asymptotic Notations and Basic Efficiency Classes,

Mathematical Analysis of Nonrecursive and Recursive Algorithms, Example –

Fibonacci Numbers.

(Chapter 2.1 – 2.5 of Text 1) (4 hrs)

3.Brute Force:

Selection Sort and Bubble Sort, Sequential Search and Brute-Force String

Matching, Exhasustive Search

(Chapter 3.1-3.2, 3.4 of Text 1) (4 hrs)

4.Divide and Conquer: Mergesort, Quicksort, Binary Search

Binary tree traversals and related properties, Multiplication of large integers and

Stressen’s Matrix Multiplication.

(Chapter 4.1, 4.2,4.3, 4.4, 4.5 of Text 1) (5 hrs)

5.Decrease and Conquer:

Insertion Sort, Depth First Search, Breadth First Search, Topological Sorting,

(Chapter 5.1-5.4 of Text 1) (5 hrs)

6.Transform and Conquer:

Presorting, Balanced Search Trees, Heaps and Heapsort, Problem Reduction

(Chapter 6.1, 6.3, 6.4, 6.6 of Text 1) (5 hrs)

7.Space and Time Tradeoffs:

Sorting by Counting, Input Enhancement in String Matching.

(Chapter 7.1, 7.2, 7.3 of Text 1) (4 hrs)

8.Dynamic Programming:

Computing a Binomial Coefficient, Warshall’s and Floyd’s Algorithms, The

Knapsack Problem and Memory Functions.

(Chapter 8.1, 8.2, 8.4 of Text 1) (4 Hrs)

9.Greedy Technique:

Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm, Huffman Trees

(Selected topics from Text 1)

(4 hrs)

28

10.Limitations of Algorithm Power, Lower-Bound Arguments, Decision Trees P, NP

and NP Complete Problems

(Chapter 10.1-10.2, 10.3 of Text 1) (4 hrs)

11. Coping with the Limitations of Algorithm Power:

Backtracking, Branch-and-Bound, Approximation Algorithms for NP-Hard

Problems

(Chapter 11.1-11.3 of Text 1) (5 hrs)

Text Book: 1. Anany Levitin, Introduction to The Design and Analysis of Algorithms, 2

nd

Edition, Pearson Education, 2007.

References 1. Thomas H. Cormen, Charles E. Leiserson, Ronal L, Rivest, Clifford Stein,

Introduction to Algorithms, 2nd

Edition, PHI, 2006.

2. Horowitz E., Sahni S., Rajasekaran S.,Computer Algorithms by Galgotia

Publications, 2001.

CSE – 303: SOFTWARE ENGINEERING

[3 1 0 4]

29

1.INTRODUCTION:

The software Engineering Discipline-Evolution and Impact, Programs Vs

Software Products, Why Study Software Engineering?, Emergence of Software

Engineering. Notable Changes in Software Development Practices, Computer

Systems Engineering

( Chapter 1.1 to 1.6 of Text 1) (4 hrs)

2. SOFTWARE LIFE CYCLE MODELS

Why Use a Life Cycle Model?, Classical Waterfall Model, Iterative Waterfall

Model, Prototyping Model, Evolutionary Model, Spiral Model, Comparison of

Different Life Cycle Model

(Chapter 2.1 to 2.7 of Text 1) (5 hrs)

3. SOFTWARE PROJECT MANAGEMENT

Responsibilities of a Software Project Manager, Project Planning, Metrics

Project Size Estimation, Project Estimation Techniques, Empirical Estimation

Techniques, COCOMO – A Heuristic Estimation Technique, Halstead’s Software

Science – An Analytical Technique, Staffing Level Estimation, Scheduling,

Organization and Team Structures, Staffing, Software Configuration Management

Miscellaneous Plans

(Chapter 3.1 to 3.14 of text1) (8 hrs)

4. REQUIREMENTS ANALYSIS AND SPECIFICATION

Requirements Gathering and Analysis, Software Requirements Specification

(SRS), Formal System Development Techniques, Axiomatic Specification,

Algebraic Specification, Executable Specification and 4GLs

(Chapter 4.1 to 4.6 of Text 1) (6 hrs)

5. SOFTWARE DESIGN

What Is A Good Software Design?, Cohesion And Coupling, Neat Arrangement

Software Design And Approaches, Object-Oriented Vs Function-Oriented Design

(Chapter 5.1 to 5.5 of text 1) (3 hrs)

6.FUNCTION-ORIENTED SOFTWARE DESIGN

Overview of SA/SD Methodology, Structured Analysis, Data Flow Diagrams

(DFDs), Extending DFD Technique to Real –Time Systems, Structured Design,

Detailed Design, Design Review


7. CODING AND TESTING

Coding, Code Review, Testing, Testing in The Large Vs Testing in The Small,

Unit Testing, Black-Box Testing, White-Box Testing, Debugging, Program

30

Analysis Tools, Integration Testing, System Testing, Some General Issues

Associated With Testing

(Chapter 10.1 to 10.12 of text 1) (8hrs)

8.SOFTWARE RELIABILITY AND QUALITY MANAGEMENT

Software Reliability, Statistical Testing, Software Quality, Software Quality

Management System, ISO 9000, SEI Capability Maturity Model


Text Book:

1. Rajib Mall, “Fundamentals of Software Engineering’, 2nd

Edition, (2005) Prentice

Hall India.

References:

1. Pressman R. S., Software Engineering: A Practitioners Approach (6th

Edition),

McGraw Hill, 2005.

2. Shari Lawrence Pfleeger, Joanne M. Atlee, Software Engineering, (3rd

Edition),

Prentice Hall, 2005.

CSE-305 COMPUTER GRAPHICS AND MULTIMEDIA

[3 1 0 4]

31

1. Graphics Hardware:

Hardcopy technologies, Display technologies, Raster scan display systems, The

video controller, Random scan display processor, Input Devices.


(4 hrs)

2. Basic Raster Graphics Algorithms for drawing 2D primitives:

Scan converting lines, Scan converting circles and ellipses, Polygon Filling,

Clipping in a raster world.


(8 hrs)

3. Geometrical Transformations:

2D transformations, Composition of 2D transformations, 3D transformations,

Window to view port transformation, Problems on 2D and 3D transformations.


(8 hrs)

4. 3D Viewing:

Viewing Pipeline, Viewing coordinates, Projections, View volumes and general

projection transformations, Problems on projections.


(6 hrs)

5. Hidden line removal algorithms:

Depth buffer algorithm, Scan line coherence algorithm, Area Coherence algorithm,

Back face algorithm.

(Selected topics from Text 1) (4 hrs)

6. Curves and Surfaces:

Shape description and requirements, Bezier Methods, B-spline Methods.


(4 hrs)

7. Achromatic and colored light:

Achromatic and Chromatic color, Color models for Raster Graphics.


(3 hrs)

8. Animation

Definition, Types, Manipulation techniques, File formats.


(3 hrs)

9. Multimedia Introduction :

32

Overview of multimedia, Various types of multimedia information, Digital

representation, Hypertext and hypermedia.


(4 hrs)

10. Multimedia Technology :

Audio & video technology – basics, Digital Audio representation and processing, Digital

video, Image compression.


(4 hrs)

Text books: 1. Foley Vandam, Feiner Hughes, “Computer Graphics, Principles and Practice”

2nd

edition, in C, 1996.

2. John F Koegel Buford, “Multimedia Systems”, ACM press/Addison – Wesley,

1994.

References: 1. Roy A.Plastock and Gardon Kalley “Schaum’s Outline of Theory and Problems

of Computer Graphics” - 2nd

printing 1987, 1988 , McGraw Hill.

2. David F. Rogers, “Procedural Elements for Computer Graphics” McGraw Hill

International Edition,1998.

3. Steven Harrington, “Computer Graphics – A Programming Approach” – 2nd

Edition –1987.

4. Donald Hearn and Pauline Baker “Computer Graphics”, Prentice Hall of India,

1996, Second Edition.

5. Newman and Sproull, “Principles of Interactive Computer Graphics” McGraw

Hill International Edition,1979, 2nd

Edition.

CSE -307 OPERATING SYSTEM AND LINUX

33

[3 1 0 4]

1.INTRODUCTION

What Operating Systems Do, Operating System Structure, Operating System

Operations, Process Management, Memory Management, Storage Management,

Protection and Security, Special Purpose Systems


(3 hrs)

2.SYSTEM STRUCTURE

Operating System Services, User Operating System Interfaces, System Calls,

Types of System Calls, System Programs, Operating System Structure, Virtual

Machines, System Boot


(3 hrs)

3.PROCESS CONCEPT

Overview, Process Scheduling, Operations on Processes, Interprocess

Communication


4.MULTITHREADED PROGRAMMING

Overview, Multithreaded Models, Thread Libraries, Threading Issues, Linux

Threads


5.PROCESS SCHEDULING

Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Thread Scheduling,

Linux Scheduling


6.SYNCHRONIZATION

Background, Critical Section Problem, Peterson’s Solution, Synchronization

Hardware, Semaphores, Classical Problems of Synchronization, Monitors,

Synchronization in Linux


7.DEADLOCKS

System Model, Deadlock Characterization, Methods for handling deadlocks,

Deadlock prevention, Deadlock Avoidance, Recovery from Deadlock.


(4 hrs)

8.MEMORY MANAGEMENT STRATEGIES

34

Logical Versus Physical Address Space, Swapping, Contiguous Memory

Allocation, Paging, Page Table Structure, Segmentation, Pentium Segmentation

and Linux on Pentium System


9.VIRTUAL MEMORY MANAGEMENT

Background, Demand Paging, Copy-On-Write, Page Replacement, Allocation of

Frames, Thrashing, Allocation Kernel Memory, Other Consideration


10.FILE SYSTEM

File Concept, Access Methods, Directory Structure, File System Mounting, File

Sharing, Protection


11.SECONDARY STORAGE

Disk Structure, Disk Scheduling, Disk Management, Swap-Space Management


12.PROTECTION AND SECURITY

Goals of Protection, Principles of Protection, Domain of Protection, Access

Matrix, Implementation of Access Matrix, The Security Problem, Program

Threats, System and Network threats, User Authentication


13.LINUX SYSTEM

Design Principles, Kernel Modules, Process Management, Scheduling, Memory

Management, File System, Interprocess Communication, Security


Textbooks:

1. A. Silberschatz, P. B. Galvin and G. Gagne, Operating System Principles, Seventh

Edition, Wiley and Sons(Asia) Pte Ltd, 2006.

References:

1. Mclen Milenkovic, Operating systems: Concepts and Design, McGraw Hill, New

York, 1987.

2. H. M. Dietel, An Introduction to Operating Systems, Addison Wesley, 1990.

3. Andrew S. Tannebaum, Operating System: Design and Implementation, Prentice

Hall of India, 1991.

4. Maurice J Bach, Design of Unix Operating System, Prentce Hall of India, 1988

CSE- 309 COMPUTER COMMUNICATION AND NETWORKS

35

[3 1 0 4]

1. Introduction:

Uses of Computer Networks, Network Hardware, Network Software, Reference

Models.

(Sections 1.1 to 1.4 of Text 1, excluding 1.3.4 and 1.3.5) (4 hrs)

2. Data Transmission:

Concepts and Terminology, Analog and Digital Data Transmission, Transmission

Impairments, Channel Capacity, Decibels and Signal Strength.


3. Guided and Wireless Transmission:

Guided Transmission Media, Wireless Transmission.

(Sections 4.1, 4.2 of Text 2) (3 hrs)

4. Signal Encoding Techniques:

Digital Data, Digital Signals, Digital Data, Analog Signals.

(Sections 5.1, 5.2 of Text 2) (6 hrs)

5. Digital Data Communication Techniques:

Asynchronous and Synchronous Transmission, Types of errors, Error Detection.

(Sections 6.1, 6.2, 6.3 of Text 2) (4 hrs)

6. Data Link Control:

Flow Control, Error Control, Performance Issues.

(Sections 7.1, 7.2 , 7.3 Appendix 7A of Text 2) (6 hrs)

7. Multiplexing:

Frequency Division Multiplexing – Characteristics only Wavelength Division

Multiplexing, Synchronous Time Division Multiplexing- Characteristics only,

Statistical Time Division Multiplexing – Characteristics only.

(Sections 8.1, 8.2, 8.3 of Text 2) (3 hrs)

8. The Medium Access Control Sublayer:

The Channel Allocation Problem, Multiple Access Protocols, Ethernet, Wireless

LANs.

(Sections 4.1, 4.2.1, 4.2.2, 4.2.3, 4.2.6, 4.3.1 to 4.3.7, 4.4. of Text 1) (8 hrs)

9. The Network Layer:

Network Layer Design Issues, Routing Algorithms, Congestion Control

algorithms.

(Sections 5.1, 5.2.1 to 5.2.9, 5.3.1 to 5.3.5 of Text 1) (6 hrs)

36

Text Books:

1. Andrew S. Tanenbaum – Computer Networks, 4th Edition, 2005 Prentice Hall of

India Pvt. Ltd.

2. William Stallings – Data and Computer Communications, 7th

Edition, 2004

Prentice Hall of India Pvt. Ltd.

References: 1. Behrouz A. Forouzan , Data Communications and Networking, Tata

McGraw-Hill 4th Edition .2006

2. Godbole, Data Communications and Networks, Tata McGraw-Hill

2002.

3. Micael A. Gallo & William M. Handcock, Computer Communications

and

Networking Technologies, 2003 Edition, Thomson.

37

CSE-311 DESIGN AND ANALYSIS OF ALGORITHMS LAB

[ 0 1 2 2 ]

Week 1 :

Write C++ program & analyze the time complexity for the following searching

techniques over a list of integers.

a) Linear search

b) Binary search

Week 2 :

Write C++ program

a) To construct a binary search tree of integers

b) To traverse the tree using all the methods i.e. inorder, preorder & postorder to

display the elements in the tree

Week 3:

a) Write a C++ program & analyze their efficiency to sort a list of N integers

using the quick sort algorithm.

b) Write a C++ program & analyze their efficiency to sort a list of N strings using

the insertion sort algorithm.

c) Write a C++ program & analyze their efficiency to sort a list of N integers

using Heap sort algorithm.

Week 4:

a) Write C++ program to apply Kruskals algorithm to find a minimum spanning

tree

Week 5:

a) Write C++ program to implement quick kill algorithm

Week 6:

Write C++ program to find Sum of subset of a given set using

a) bottom up minimal change algorithm

b) the Johnson trotter algorithm

c) The lexiceo graphic order algorithm ?Analyze their relative performance.

Week 7:

Write C++ program to

a) solve the shortest path problem for directed acyclic graphs

b) for finding the length of longest path in a directed acyclic graphs

38

Week 8 :

Write a C++ program to implement the

a) Hamiltonian circuit problem

b) the m coloring problem

Week 9:

a) Write a program to implement a key insertion algorithm in a B tree

b) Write a program to visualize a key insertion algorithm in a B tree

Week 10:

a) Write a C++ program to implement the n Queens problem using different

techniques.

Week 11:

a) Write a C++ program to implement the knapsack problem using different

methods & analyze their performance .

Week 12:

a) Write a C++ program solve the game of tic –tac toe with the user by storing all

possible combination in a 3*3 board .

Reference:

1. Annay Levtin Introduction to the design and analysis of algorithms, 2nd edition ,Pearson Education ,2007.

39

CSE-313 COMPUTER GRAPHICS AND MULTIMEDIA LAB

[ 0 1 2 2 ]

Week 1: Drawing of lines

Week 2: Drawing of Circles and Ellipses

Week 3: Area Filling

Week 4: Polygon Filling

Week 5: Clipping of Lines

Week 6: Clipping of Polygons

Week 7 : 2-D Transformations

Week 8: Curve Drawing

Week 9: Transformations and Projections.

Week 10: Multimedia Basics

Week 11: Multimedia technology

Week 12 : Multimedia technology

References:

1. D. Hearn and M. P. Baker “Computer Graphics” Second Edition, PHI Ltd – 2000

2. Foley Vandam, Feiner Hughes, “ Computer Graphics Principles and Practice”,

Second Edition in C, 1996.

3. Practice on Audio and Video capturing and editing softwares, downloaded notes.

40

CSE-315 OPERATING SYSTEM AND LINUX LAB

[ 0 1 2 2 ] PART I

Objectives: To learn LINUX commands, shell functionality and LINUX system call

shell programming and usage of vi editor.

WEEK 1: LINUX for non-programmers

WEEK 2: LINUX shell

WEEK 3 and 4 Shell programming: Write shell scripts with the help of variables, loops

(for, while), and conditional statements (if else, case). Shell variables, arguments to shell

procedure, test command, arithmetic with EXPR command, interactive shell procedures

with read.

WEEK 5 : LINUX system calls

PART II

Objectives: Simulation of OS Algorithms

WEEK 6 AND 7: CPU scheduling algorithms:

WEEK 8 : Deadlock detection and avoidance algorithms:

Note: Week 7 to week11 programs have to be implemented on LINUX platform

WEEK 9 and 10: Page Replacement and allocation algorithms:

WEEK 11 : Disk scheduling algorithms:

WEEK 12: IPC (Inter Process Communication System LINUX System V IPC (Inter Process

Communication)

References :

1) Unix for Programmers and Users – A Complete Guide By Graham glass

2) Design of Unix Operating System by Morris bach

3) Operating System Concepts – Silberschatz & Galvin

41

4) Unix System V – Rachel Morgan

5) UNIX made easy second edition(2002) by Muster.

VI SEMESTER COMP SCIENCE

CSE- 302 LANGUAGE PROCESSORS (3 1 0 4)

1. Introduction: Why Compilers? A Brief History, Programs Related to Compilers, The

Translation Process (Chapter 1 Sections 1.1, 1.2, 1.3 of text 1) (2 hrs)

2. Scanning: The Scanning Process, Regular Expressions, Finite Automata, From Regular

Expressions to DFAs, Use of Lex to Generate a Scanner Automatically

(Chapter 2 Sections 2.1, 2.2, 2.3, 2.4, 2.6 of text 1) (4 hrs)

3. Context-Free Grammars and Parsing:

The Parsing Process, Context-Free Grammars, Parse Trees and Abstract Syntax

Trees, Ambiguity, EBNF Notation

(Chapter 3 Sections 3.1, 3.2, 3.3, 3.4, 3.5.1 of text 1) (6 hrs)

4. Top-Down Parsing: Top-Down Parsing by Recursive-Descent, LL(1) Parsing, First and Follow Sets,

Error Recovery in Top-Down Parsers

(Chapter 4 Sections 4.1, 4.2, 4.3, 4.5) (8 hrs)

5. Bottom-Up Parsing: Overview of Bottom-Up Parsing, Finite Automata of LR(0) Items and LR(0)

Parsing, SLR(1) Parsing, General LR(1) and LALR(1) Parsing, Yacc: An

LALR(1) Parser Generator, Error-Recovery in Bottom-Up Parsers

(Chapter 5 Sections 5.1, 5.2, 5.3, 5.4, 5.5, 5.7 of text 1) (12 hrs)

6. Semantic analysis: Attributes and Attribute Grammars, The Symbol Table, Data Types and Type

Checking

(Chapter 6 Sections 6.1, 6.3, 6.4 of text 1) (6 hrs)

42

7. Code Generation: Intermediate Code and Data Structures for Code Generation, Basic Code

Generation Techniques, A Survey of Code Optimization Techniques

(Chapter 8 Sections 8.1, 8.2, 8.9 of text 1) (6 hrs)

8. Assemblers: Elements of Assembly Language Programming, A Simple Assembly Scheme,

Pass Structure of Assemblers, Design of Two Pass Assemblers

(Chapter 4 Sections 4.1, 4.2, 4.3, 4.4 of text 2) (3 hrs)

9. Linkers and Loaders: Relocation and Linking Concepts, Loaders

(Chapter 7 Sections 7.1, 7.6 of text 2) (1 hr)

Textbooks: 1. Kenneth C. Louden, “Compiler Construction - Principles and Practice”,

Thomson, India Edition (2007)

2. D M Dhamdhere, “Systems Programming and Operating Systems”, 2nd

Revised Edition, Tata McGraw Hill, 2001.

Reference: A. V. Aho, R. Sethi and J. D. Ullman, “Compilers - Principles, Techniques and

Tools”, Pearson Education

.

43

HUM-304 FINANCIAL MANAGEMENT

(3 1 0 4)

Introduction to Financial Management:

Evolution of Financial Management, Goals and key activities of financial management

(Chapter 1, Sections 1.1-1.3, Text Book 1) (1 hr.)

Time Value of money:

Time Value of Money, Interest, Meaning & Types, Equivalence, Interest Factors for

Discrete Compounding, Nominal & Effective Interest Rates, Present and future worth

of single, uniform , gradient and geometric cash flow.

(Chapter 1, Sections 1.1-1.6, Chapter 2, Sections 2.1-2.12, Chapter 3, Sections 3.1-3.3,

3.5,3.6, Text Book 2) (7 hrs.)

Sources of Long Term Finance:

Characteristics of Equity capital, Preference Capital, Debenture Capital & Term Loans.

(Chapter 15, Sections 15.1-15.6, Text Book 1) (3 hrs.)

Valuation of Securities :

Concept of Valuation, Bond Valuation and Bond Valuation Models, Bond Value

Theorems, Yield to Maturity. Equity Valuation; Dividend Capitalization Approach,

Ratio Approach.

(Chapter 5, Sections 5.1- 5.4, Text Book 1) (5 hrs.)

Principles of Accountancy:

Single & Double Entry Book Keeping, Types of Accounts, Golden rules of accounting,

44

Journal, Ledger and Trial Balance (4 hrs.)

(Chapter 1, Sections 1.5- 1.11, Chapter 2, Sections 2.1,2.4,2.5 , Chapter 4, Sections

4.1-4.6, Chapter 10, Sections 10.1-10.3, Text Book 3)

Financial Statements & Analysis:

Balance Sheet and Profit & Loss Account or Income Statement, Meaning & Contents.

Ratio Analysis, Financial Ratios such as Liquidity Ratios, Leverage Ratios, Turn over

Ratios, and Profitability Ratios, Time Series Analysis, Common Size analysis, Du

Pont Analysis, Drawbacks of Financial Statement Analysis.

(7 hrs.)

(Chapter 23, Sections 23.2 - 23.10, Chapter 24, Sections 24.1- 24.17,Text Book 1)

Funds Flow Analysis:

Total Resources Basis, Working Capital Basis and Cash Basis

(Chapter 25, Sections 25.1- 25.7, Text Book 1) (3hrs.)

Cost Volume Profit Analysis and Leverage:

Cost-Volume Profit Analysis for Single Product and Multi Product Firms, Problems.

Concept of Leverage, Operating Leverage, Financial Leverage, Total leverage,

Problems.


Working Capital Management:

Meaning & Objective of Working Capital Management. Factors Influencing Working

Capital Requirements, Operating Cycle Approach to Working Capital Management.


Capital Budgeting:

Principles and Estimation of cost & Benefits. Appraisal Criteria such as Pay Back

Period, Average Rate of Return, Net Present Value, Benefit Cost Ratio and Internal

45

Rate of Return.

(Chapter 6, Sections 6.1-6.9, Text Book 1) (5hrs.)

Cost of Capital:

Meaning, Cost of Debt Capital, Preference Capital and Equity Capital, Weighted

Average Cost of Capital, Determination of Proportions.

(Chapter 7, Sections 7.1-7.5, Text Book 1) (2hrs.)

Text Books :

1. Prasanna Chandra (2005) “Fundamentals of Financial Management” 4th edition,

Tata McGraw Hill Publishing Co. Ltd., Delhi.

2. Leland T, Blank, Anthony J. Tarquein (1989) “Engineering Economy” Mc Graw

Hill Book Company, New Delhi

3. Raman B.S (1995) “Accountancy Volume I”, 24th edition, United publications,

Bangalore.

References:

1. Pandey I M (2007) “Financial Management” Vikas Publishing House, Delhi

2. Subir Kumar Banerjee (1989) “Financial Management” Sultan Chand & Co.,

Delhi

3. Maheshwari S.N (2002) “ Financial Management” Sultan Chand & Co., Delhi

46

CSE-306 NETWORK PROTOCOLS

(3 1 0 4)

1. IP addresses: Introduction Classful addressing, other issues, Subnetting

(Chapters 4.1 - 4.4 of Text book ) (4 hrs)

2. IP addresses: Classless addressing , variable length blocks, Subnetting, address

allocation.

(Chapters 5.1 – 5.3 of Text book) (4 hrs)

3. ARP- Introduction, Encapsulation, operation ARP package &

RARP- Introduction, packet format Encapsulation, RARP server

(Chapters 7.1, 7.2, 7.3 of Text book) (4 hrs)

4. IP: Introduction, datagram , fragmentation , options, checksum, IP Package

(Chapters 8.1, 8.2, 8.3, 8.4, 8.5 of Text book) (4 hrs)

5. ICMP: Types of messages, message format, error reporting, Query, Checksum,

Debugging tools.


6. IPV6 Introduction, address space assignment, Packet format, comparison between

IPv4 & IPv6. ICMPV6: - Introduction, error reporting, Query, Transition from IPv4 to

IPv6.

(Chapters 27.1, 27.2, 27.3of Text book) (4 hrs)

7. UDP: Process to process communication, User datagram, checksum, UDP operation

,UDP package


8. TCP: Introduction, TCP services, TCP features, segment, TCPconnection, State

transition diagram, Flow control, Error control, Congestion control, TCP timers, options,

TCP package

47

(Chapters 12.1 – 12.10 of Textbook) (5 hrs)

9. SCTP: SCTP services, SCTP features, packet format, association, state transition

diagram, flow control, error control, congestion control.

(Chapters 13.1- 13.8 of text book) (6 hrs)

10. DNS: Name space, domain name space, distribution of name space, DNS in the

internet, resolution, DNS messages, types of records, compression, DDNS,

encapsulation.


11. Telnet: - Concept, NVT, NVT characterset, Embedding, options, Option negotiation,

sub option negotiation, controlling the server, out of band signaling, escape character,

mode of operation, user interface, security issues.


12. FTP & TFTP -

(Chapters 19.1 & 19.2 of Text book) (4 hrs)

13. HTTP: Transaction, persistent versus non persistent connection, proxy server.

( Chapters 22.3 of Text book) (1 hr)

14. Mobile IP: Addressing, agents, three phases, inefficiency in mobile IP

(Chapters 24.1 – 24.4 of Text Book) (2 hrs)

Text Books:

1. Behrouz A. Forouzan “TCP/IP Protocol Suite”, 3rd

Edition, TMH 2005.

References: 1. W.R Stevens, TCP/IP Illustrated, Volume 1: The Protocols, Addison Wesley,

1994.

2. Peter Loshin, IPV6 Clearly Explained, Morgan Kauffman, 1999.

3. C.E. Perkins, Mobile IP Design Principles and Practices, Addison Wesley

Wireless Communications Series, 1998

48

CSE-308 OBJECT ORIENTED ANALYSIS AND DESIGN

USING UML (3 1 0 4)

1. Object Oriented Design and Modelling:

Object Oriented Fundamentals, Objects and object classes, object oriented design

process,importance of modelling, principles of modelling, object oriented

modelling.

(Chapter 1 of Text) (4 hrs)

2. Introduction to UML:

Conceptual model of UML, building blocks of UML, Mechanisms in UML,

architecture, software development life cycle.

(Chapter 2 of Text) (4 hrs)

3. Basic Structural Modelling

Classes, relationships, common mechanisms, class and object diagrams.

( Chapter 3- 8 of Text) (4 hrs)

4. Advanced structural Modelling

Advanced classes, advanced relationships, Interfaces types and roles, packages,

instances and object diagrams.

(Chapter 9-14 of Text) (4 hrs)

5. Collaboration Diagrams and Sequence Diagrams

Terms, concepts and depicting a message in collaboration diagrams. Terms and

concepts in sequence diagrams. Difference between collaboration and sequence.

diagram. Depicting synchronous messages with/without priority call back

mechanism.

49

( Chapter 15) (6 hrs)

6. Basic behavioral modeling

Interactions, use cases, Use Case Diagrams, Interaction Diagrams and activity

diagrams.

(Chapter 16-19 of Text) (10 hrs)

7. Architectural Modelling:

Terms, Concepts, examples, Modelling techniques for component diagrams and

deployment diagrams.

(Chapter 25,26 of Text) (4 hrs)

8. Advanced Dynamic modeling: Real Time Systems

Real Time Concepts, Real Time modeling in UML, Adapting to Real Time

systems

(Chapter 6 of Reference Text) (4 hrs)

9. Design Patterns for Using UML

The Gang of Four Patterns, The Proxy Pattern, Modeling Patterns in UML

(Chapter 9 of Reference Text) (4 hrs)

10.. CASE studies

Library management system

Online Reservation system

Interactive college admission process

Web based Warehouse Design (4 hrs)

Text Book: 1. Grady Booch, James Rumbough, Ivar Jacobson. ‘ The Unified Modelling

Language User Guide. Pearson Education 2002.

Reference:

1. Hans-Erik Eriksson , Magnus Penker ‘UML Toolkit’ John Wiley and SONS,

INC, 1998 Edition.

50

CSE 310.1 DIGITAL IMAGE ANALYSIS (ELECTIVE)

[ 3 0 0 3 ]

1. Digital Image Fundamentals

Fundamental Steps in Digital Image Processing, Components of an Image

Processing System, Elements of Visual Perception, Image Sampling and

Quantization, Some Basic Relationships Between Pixels, Linear and Nonlinear

Operations

(Sections 1.4, 1.5, 2.1, 2.4, 2.5 and 2.6 of Text Book 1) (6 hrs)

2. Image Enhancement in the Spatial Domain Gray Level Transformations, Histogram Processing, Enhancement Using

Arithmetic/Logic Operations, Basics of Spatial Filtering, Smoothing Spatial Filters,

Sharpening Spatial Filters, Combining Spatial Enhancement Methods

(Sections 3.2, 3.3, 3.4, 3.5, 3.6, 3.7 and 3.8 of Text Book 1) (6 hrs)

3. Image Enhancement in the Frequency Domain

Introduction to the Fourier Transform and the Frequency Domain, Smoothing

Frequency-Domain Filters, Sharpening Frequency Domain Filters, Homomorphic

Filtering

(Sections 4.2, 4.3, 4.4 and 4.5 of Text Book 1) (5 hrs)

4. Image Restoration

A model of the image degradation / restoration process, Noise models, Restoration

in the presence of noise only spatial filtering, Periodic noise reduction by frequency

domain filtering

(Sections 5.1, 5.2, 5.3 and 5.4 of Text Book 1) (5 hrs)

5. Morphological Image Processing

51

Preliminaries, Dilation and Erosion, Opening and Closing, The hit-or-miss

transformation, Some basic Morphological algorithms, Extension to Gray-Scale

Images (Sections 9.1, 9.2, 9.3, 9.4, 9.5 and 9.6 of Text Book 1) (5 hrs)

6. Image Segmentation Detection of Discontinuities, Edge Linking and Boundary Detection, Thresholding

Region-Based Segmentation, Segmentation by Morphological Watersheds

(Sections 10.1, 10.2, 10.3, 10.4 and 10.5 of Text Book 1) (6 hrs)

7. Representation and Description

Representation

Boundary Descriptors

Regional Descriptors (3 hrs)

(Sections 11.1, 11.2 and 11.3 of Text Book 1)

Text Books:

1. Rafael C. Gonzalez, Richard E. Woods, “Digital Image Processing”, Second

Edition, Pearson education, 2004.

2. E. R. Davies “Machine Vision”, third edition Margan Kaufmann Publishers,

2006.

References: 1. Dana Ballard and Chris Brown, “Computer Vision”, Prentice Hall- Inc., 2000.

2. Joseph V. Hajnal, Derek L.G. Hill, David J. Hawkes “Medical Image

Registration”, CRC Press.

3. Rick S. Blum, Zhaeng Liu, “ Multi-Sensor Image Fusion and Its Application”,

CRC Press.

4. G. W. Awcock and R. Thomas, “Applied image processing”, McGraw hill

international edition.

5. Relevant research papers from the journals.

52

CSE- 310.2 ADVANCED DATABASE SYSTEMS (ELECTIVE)

[ 3 0 0 3] 1. Query Processing

Overview, Measures of Query Cost, Selection Operation, Sorting Join Operation,

Other Operations, Evaluation of Expressions

[ Chapter 13 of the Text Book] (5hrs)

2. Query Optimization

Overview, Estimating Statistics of Expression Results, Transformation of Relational

Expressions, Choice of Evaluation Plans

[Chapter 14 of the Text Book] (5hrs)

3. Transactions

Transaction concept, State, Implementation of atomicity and durability, Concurrent

executions, Serializability, Recoverability.


4. Concurrency Control

Lock-Based Protocols, Timestamp-Based Protocols, Validation –Based Protocols,

Multiple Granularity, Multiversion Handling, Deadlock Handling, Insert and Delete

Operations, Weak Levels of Consistency.


5. Recovery System

Failure Classification, Storage Structure, Recovery and Atomicity, Log-Based

Recovery, Shadow Paging, Recovery with Concurrent Transactions, Buffer

Management, Failure with Loss of Nonvolatile Storage.


6. Object-Oriented Databases

OODB model, Languages, Persistent Languages, Persistent C++ and Java systems.


7. Object-Relational Databases

Nested Relations, Complex Types, Inheritance, Reference Types, Querying with

Complex Types, Functions and Procedures.


53

8.Distributed Databases

Distributed data storage, Distributed transactions, Commit protocols, Concurrency

control, Availability, Query processing.


Text Book: Silberschatz, Korth and Sudarshan, “Database System Concepts”,

4th

Edition, McGrawHill.

References:

1. Elmasri and Navathe, “Fundamentals of Database Systems”, 3rd

Edition,

Addison-Wesley

2. C.J.Date, “An Introduction to Database Systems”, 7th Edition, Pearson M

Education Asia.

3. Willian G. Page, Jr., “Using Oracle 8/8I, 1999,PHI

54

CSE-310.3 CAD FOR VLSI (ELECTIVE) [ 3 0 0 3 ]

1. Introduction to design automation of digital systems

Levels of abstraction, y-chart, system synthesis, design styles and technologies,

issues in system synthesis

(Chapter 1 of Text 1) (2hrs)

2. Integrated system fabrication

Semiconductor device fabrication techniques, basic cmos transistors, cmos basic

logic gates, memory elements, stick diagrams.

(Chapter1of text 4, Selected topics of Text 6) (4hrs)

3. Hardware modeling

Introduction to high level synthesis and hardware description language.

(HDL) Hardware description and design using VHDL:

(Selected topics from Text 3) (10hrs)

4. Architecture level synthesis

Introduction, circuit specifications for architectural synthesis, the fundamental

architectural synthesis problems, area and performance estimation. Scheduling

algorithm- Introduction, model for the scheduling problems, scheduling with and

without resource constraints.

(Selected topics from Text2 and Text 1) (8hrs)

5. Resource sharing and binding

55

Introduction, sharing and binding for general circuit, sharing and binding for

resource dominated circuits, concurrent binding and scheduling, resource sharing

and binding for pipelined circuits.

(Selected topics from Text 2) (5hrs)

6.Partitioning

Basic partitioning methods: random selection, cluster growth, min cut

partitioning, simulated annealing.

(Chapter 4 of Text 1) (5hrs)

7.Digital systems design using programmable logic devices

Introduction to Plds, Field programmable gate arrays, classification of FPGAs,

technology mapping for FPGAs, some case studies.

(Selected topics from from Text 6) (2hrs)

Text books:

1. Deniel D. Gajski, Nikil D. Dutt,Allen C-H Wu and Steve Y- L Lin.- High level

Synthesis – Introduction To Chip And System Design

2. Givoanni de Micheli - Synthesis And Optimization Of Digital Circuits.

3. Allen . M. Dewey - Analysis And Design Of Digital Systems With VHDL

4. Neil Weste And Kamran Esh Raghian - Second Edn CMOS VLSI Design –

System’s Perspective

5. Andrew Brown- VLSI Cicuits & Systems In Silicon.

6.Eugene D. Fabricius. - Introduction To VLSI Design

References:

1. C.Mead And L. Conway -Introduction To VLSI System

2. Z. Navabi – VHDL

3. N. Sherwani.- Algorithms For Physical Design Automation

56

MAT-301 GRAPH THEORY (ELECTIVE) [ 3 0 0 3 ]

Graphs and subgraphs, walks, paths and connectedness, distance as a metric, degrees,

regular graphs, cubic graphs, bipartite graphs, self complementary graphs, operations on

graphs, External graphs, degree and sequence, applications of the theorems due to (a)

Havel and Hakimi, (b) Erdos and Gallai.

Cut points, bridges and blocks, block graphs and cut point graphs.

Trees and their characterizations, centre and centriods, block – cut points trees, spanning

trees, independent cycles and cocycles, connectivity and line connectivity, Whitney’s

theorem.

Traversibility – Eulerian, Hamiltonian, line graphs and total graphs. Traversibility,

coverings and independence, theorem of Gullai, critical points and lines.

Planarity, genus, thickness, crossing number. Colorability, chromatic number and its

bounds, Nordhaus Gaddem theorems, the four and five colour theorems, The chromatic

polynomial.

Matrix Representation of graphs – Incident matrix, Adjacency matrix, cycle matrix,

cutset matrix, path matrix, Digraphs D, Matrix - tree theorem on number of spanning

trees. Tournament.

Graph Theoretic Algorithms

Computer representation of graphs – Input and output, Algorithms for connectedness,

Spanning Tree, Fundamental Circuits, Directed Circuits and Shortest paths.

References : 1. F. Harary, Graph theory, Narosa Publishers, 1988.

57

2. Narsingh Deo, Graph theory with applications to Engineering and Computer Sc,


3. Robin J.Wilson, Introduction to Graph theory, Logman, 1985.

CSE-312 LANGUAGE PROCESSORS LAB

( 0 1 2 2 )

Week 1: Preliminary Scanning Applications

Week 2, 3 & 4: Design & Implementation of Lexical Analyzer

Week 5, 6 & 7: Design & Implementation of Parser

Week 8, 9 & 10: Implementation of Code Generator

Week 11: Programs using LEX

Week 12: Programs using YACC

Reference: A. V. Aho, R. Sethi and J. D. Ullman, “Compilers - Principles, Techniques and

Tools”, Pearson Education

58

CSE- 314 COMPUTER NETWORKS LAB

( 0 1 2 2 )

1. Write programs to illustrate UNIX system calls

2. Stream server and client on UNIX using C

3. IP checksum calculation, fragmentation and Reassembly

4. Applications based on stream sockets

5. Datagram server and client on UNIX using C

Applications based on Datagram sockets

6. Remote execution

7. Synchronous I/O Multiplexing

8. Development of a simple application level protocol

9. Write Java programs to illustrate the use of various

Network library functions.

10. UDP client/server applications using JAVA

59

11. TCP client/server applications using JAVA

12. TCP client/server applications using JAVA

References:

1. UNIX Network programming, W. Richard Stevens, Vol1, PE.

2. Web sites related to C Socket Programming, Network Programming, Java

Network Programming.

CSE-316 OBJECT ORIENTED ANALYSIS & DESIGN USING UML

LAB ( 0 0 3 1 )

Lab work involves forming a batch of two members in a group and Mini projects in the

following areas can be specified for each group.

i) Database intensive problem

ii) UserInterface intensive problem

iii) Realtime (Critical problem)

iv) Internet based problem

Week 1, Week 2 : Requirement elicitation for the given problem.

Week 3: Create a Use Case Diagrams of the given system.

Week 4 : Create Class Diagrams of the given system.

Week 5: Create sequence Diagrams of the given system.

Week 6: Create collaboration Diagrams of the given system.

60

Week 7: Create activity Diagram of the given system.

Week 8: Create interaction Diagram of the given system.

Week 9-12: Generate the skeleton code of the system using Rational Rose in C++/Java. Add

necessary code to the generated code to make the system working.

Week 13: Demonstration of the complete project.

References: 1. “Object oriented programming with C++” - Balaguruswamy, McGrawHill

Publications.

2. “Mastering UML with Rational Rose” – Wendy Boggs, Michael Boggs,

BPB, 1999 Edition.

3. “Fundamentals of Software Engineering”- Rajib Mall PHI publication, Second

Edition

VII SEMESTER COMP SCIENCE

CSE- 401 DISTRIBUTED SYSTEMS [3 1 0 4]

61

1. Distributed System Models:

Introduction , Examples , Architecture models , Fundamental models

(1.1,1.2,1.4, 2.1-2.3 of Text1 ) ..2hrs

2. Interprocess Communication, Distributed Objects and Remote Invocation:

Introduction , External data representation and marshalling,

Communication models, Communication between distributed objects ,

Remote procedure call Case study: Interprocess communication in UNIX,

Java RMI .

(4.1-4.6, 5.1-5.5 of Text1)

..6hrs

3. Operating System

Introduction , Operating system layer, Processes and threads, Communication and

invocation, Architecture

(6.1-6.6 of Text1) ..4hrs.

4. Distributed File Systems and Name Services:

Introduction , File service architecture, Name services, Domain Name System,

Directory and directory services. Case study: Sun network file system, Global

name service.

(8.1-8.3, 9.1-9.4 of Text1) …6hrs

5. Synchronization:

Clock Synchronization, Physical clocks, Logical clocks, Global state

(5.1-5.3 of Text2) ..5hrs

6. Transactions& concurrency control:

Transactions, nested transactions, locks, optimistic concurrency control,

time stamp ordering

(12.1-12.7 of Text1) ..8hrs

7. Distributed Transactions:

Introduction, Flat and nested distributed transactions, Atomic Commit

protocols, Concurrency control in distributed Transactions, Distributed

deadlocks, Transaction recovery.

(13.1-13.5 of Text1) ..6hrs

8.Consistency and Replication:

Introduction, Data centric consistency models, Client- centric consistency

Models, Distributed protocols, Consistency protocols.

(6.1-6.5 of Text2) ..6 hrs

62

9. Fault Tolerance:

Introduction to fault tolerance, Process Resilience, Reliable Client server

Communication, Reliable group communication, Recovery.

(7.1-7.6 of Text2) ….. 5hrs.

References:

1. George Coulouris Jean Domllimore Tim Kindberg (2006) ; Distributed

Systems concept and design. Third Edn Pearson Education Asia

2. Andrew S. Tanenbaum, Maarten Van Steen; (2005) Distributed Systems:

Principles and Paradigms, I edition, Pearson Education Asia

63

CSE 403.1 ELECTRONIC COMMERCE (ELECTIVE) [ 3 0 0 3]

1. History of e-commerce, definition, benefits and limitations, the driving forces of e

commerce

(Text : chapter 1 : Sections 1.2, 1.3, 1.4) (4hrs)

2. Business models for e-commerce : The birth of portals, e=business models based

on the relationship of transaction parties, e-business models based on the

relationship of transaction types.

(Texts : chapter 2) (8hrs)

3. Enabling technologies of the world wide web: internet client, server applications,

networks and internets, software agents, internet standards and specifications,

internet service provider, broadband technologies, hypertext, java script, XML.

(8hrs)

4. Advertisement in electronic commerce: web advertisement, advertisement

methods, advertisement strategies, push technology and intelligent agents,

economics and effectiveness of advertisement. (5hrs)

(Text 1 : chapter 4, sections 4.2, 4.3, 4.4,4.5, & 4.6)

5. E-security : security on the internet, e-business risk management issues, E-

payment systems, digital token based systems, designing e-payment systems,

digital signature

(Text 2 : chapter 5, chapter 6) (6hrs)

6. Business to business electronic commerce : characteristics of B2B, models of

B2B, procurement management using the buyers internal market place: suppliers

oriented, buyers-oriented and intermediary – oriented marketplace, B2B models.

(Text 1 : chapter 6 : sections : 6.2, 6.3, 6.4, 6.5, 6.6, 6.7& 6.9) (5hrs)

Text books : 1. Erfan Turban et, al, (2006), Electronic Commerce- a managerial prospective,

Pearson Education.

64

2. P. T. Joseph, S.J.(2006), E-Commerce : An Indian Perspective, 2nd

edition, PHI

References:

1. Gary P. Schneider (2006), Electronic commerce, 4th edition, Thomson.

2. Daniel C. Lynch, Leslie Lundquist (2006), Digital Money : the new era of internet

commerce, wiley.

CSE- 403.2 STORAGE DEVICES TECHNOLOGY (ELECTIVE) [3 0 0 3]

1. Storage devices & I/O Subsystems

Traditional Backup devices, Disk arrays, Disk physical structure- components, properties,

performance, and specifications. Tape drives.

(Chapter 4 of text 1) (3 hrs)

JBODs, RAIDs, Hot spares. Storage I/O & Storage system connectivity protocols.

(Chapter 9, chapter 5, and chapter 3 of text 1) (3 hrs)

Device interconnect technology for storage Networks.(Serial & parallel channels, ATA.


2. Introduction to Networked Storage

Network back up & storage management issues.

Discussion of Direct Attached Storage (DAS), Storage Area Networks (SAN), Network

Attached Storage (NAS) and Content Addressable Storage (CAS)

(Chapter 1 need for storage networks of text 2). (3 hrs)

Fiber Channel Basics.

(Chapter 3 of text 2) (2hrs)

3. Introduction to Information availability

Business Continuity and Disaster Recovery Basics, Local business continuity techniques,

Remote business continuity techniques, Disaster Recovery principles & techniques.

(Material from EMC) (4 hrs)

4. EMC Products& tools – A Case study

65

Discussion of CLARiiON Architecture, Snap view, Mirror view, Power path and

SANCOPY. (all chapters of text 3) (10 hrs)

5. Storage Area Networks (SAN) .

SAN components & Building blocks, SAN software, data access over SAN. Fiber

channel basics, protocols & connectivity.

(Chapter 2 of text 2.) (3 hrs)

SAN topologies.

(Chapter 6 of text 2). (2 hrs)

Elements of SAN design, scalability, availability, performance, security, capacity, and

manageability issues. Studies and critiques of existing SAN design scenarios (partial

mesh, full mesh, core/edge, & tiered designs).


Text Books:

1. Marc Farley, “Storage Networking Fundamentals”, Cisco Systems, 2004.

2. Meeta Gupta,”Storage Area Network Fundamentals” Cisco Systems, 2002.

3. EMC Technology Foundations student guide.

References:

1. Relevant research papers from the journals.

66

CSE-403.3 ARTIFICIAL INTELLIGENCE ( ELECTIVE) [ 3 0 0 3 ]

1.The Artificial Intelligence

(AI) problems- AI techniques- Problems, Problem spaces and search: Defining

the problem as a state space search, production systems, problem characteristics,

Production System characteristics – Heuristic search techniques.

(Chapters 1.1, 1.3, 2.1, 2.2, 2.3, 3 of text 1) (10 hrs)

2.Knowledge Representation Issues:

Representations and Mappings, Approaches to knowledge representation – using

predicate logic – Representing simple facts inlogic, Computable functions and

predicates. Representing knowledge using rules: Procedural versus declarative

knowledge, logic programming, Forward versus Backward reasoning.

(Chapters 4.1., 4.2, 5.1, 5.3, 6.1, 6.3 of text 1) (8 hrs)

3.Symbolic Reasoning under uncertainty:

Introduction to nonmonotinic reasoning, logics for nonmonotonic reasoning.

Statistical Reasoning: Probability and Bayes” theorem, Bayesian networks,

Dampster-Shafer theory.

(Chapters 7.1,7.2, 8.1, 8.3 of text 1) (5 hrs)

4.Knowledge representational Structures:

Semantic networks, frames, Conceptual dependency scripts and CYC.

(Chapters 9 and 10 of text 1) (10 hrs)

67

5.Game Playing:

Minmax Search Procedure, Adding alpha-beta cutoffs, Iterative Deepening.

Understanding: What is understanding? What makes understanding hard?

Natural language Processing: Syntactic Processing.

(Chapters 12.2, 12.3, 12.5, 14.1, 14.2, 15.2 of text 1) (3 hrs)

Text Book: 1. Elaine Rich & Kevin Knight (2007): Artificial Intelligence, Second Edition, Tata

McGraw Hill.

References: 1. Nils J. Nilsson (2002): Artificial Intelligence: A New Synthesis, Morgan

Kaufmann.

2. Patterson W. Dan , Introduction to Artificial Intelligence and Expert System,

Prentice Hall.

3. David W. Rolston (1998): Principles of Artificial Intelligence and Expert System

Development, Tata McGraw Hill.

MAT 401 OPERATIONS RESEARCH (ELECTIVE)

[ 3 0 0 3 ]

Formulation, Linear programming - simplex method, 2-phase method. Duality theory

Transportation problem - Volgel's approximation method, MODI method, Assignment

problem- Hungarian method.

Project Management - Networks, Project planning and control using PERT and CPM.

Game theory - 2persons zero sum games, Minimax principle, games with mixed

strategies. Dominance theory, solution using Linear programming.

Dynamic programming - Deterministic Dynamic programming, Search Techniques -

Golden mean search, Three point - Intervals search, Fibonacci search.

Text books:

68

1. Bronson Richard - theory and Problems of Operations Research - Schaum series-

MGH, 1983.

2. P.K.Gupta & Man Mohan - Operations Research (Ed.4) - Sultan Chand & Sons,

1980.

3. Hamdy A.Taha - operations Research (Ed.5) PHI, 1995

69

CSE- 405.1 NEURAL NETWORKS AND FUZZY SYSTEMS

(ELECTIVE)

[3 0 0 3 ]

1. Introduction to Neural Networks.

Introduction, Biological Neural Networks, Conventional computers versus neural

computers, Neuron model and activation functions, Network architectures

(Text book 1) (5 hrs)

2: Learning Processes

Introduction, Error-Correction learning, Memory-Based Learning, Hebbian

Learning, Competitive Learning, Boltzmann Learning, Learning with and

without a teacher, Learning tasks.


3: Single and Multi-Layer Perceptrons.

Perceptron Model, Perceptron convergence theorem, Limitation of perceptron

model, Multilayer perceptron model, XOR problem, Back-propagation

algorithm, Generalization, Virtues and limitations of back-propagation learning.


4: Recurrent Neural Networks.

Introduction, Layer level feedback, Non-linear autoregressive exogeneous

network, Simple recurrent network, Second order recurrent network, Learning

algorithm, Neuronal level feedback architecture, Hop field network,

Bidirectional associative memory .


5: Self-Organizing Maps.

Two-basic feature mapping models, Self-organizing map, Learning algorithm,

Properties of the feature map, Learning vector quantization


6: Introduction to Fuzzy Systems

Partial truth and Fuzziness, Fuzzy systems at work, Fuzzy systems as inference

engines and function approximators, Classical logic versus fuzzy logic


7: Fuzzy sets

Crisp versus fuzzy sets, Properties and operations, Fuzzification techniques,

Membership functions, Fuzzy rule generation, The basic fuzzy inference

algorithm. .


70

Text book:

1. Simon Haykin, Neural Networks: A comprehensive Foundation, 2nd

Edition

(L.P.E.), Pearson Education, Inc. 1999.

2. Zurada, Jackck M. Introduction to Artificial Neural Systems, Jaico Publishing

House, 1997.

3. R.C. Berkan, S.L. Trubatch, Fuzzy Systems Design Principles, IEEE Press,

Standard Publishers Distributors, 1997.

References:

1. N.K. Bose and P. Liang, “ Neural Network Fundamentals with Graphs,

Algorithms and Applications”, TMH, 1998.

2. Bart Kosko, “Neural Networks and Fuzzy Systems”, EEE, PHI, 2001.

3. Junhong Nie and Derek A. Linkens, “Fuzzy Neural Control: Principles,

Algorithms and Applications”, PHI, 1998.

71

CSE 405.2 DATA WAREHOUSING AND DATA MINING

[3 0 0 3]

1. Data Warehousing:

Introduction, Definition, Multidimensional data model, OLAP operations,

Warehouse schema, Data Warehousing Architecture, Warehouse server,metadata,

OLAP engine, Data Warehouse Backend process.

(Chapter 2 Sections 2.1-2.11 of Text book 2) (4 hrs)

2. The Data warehouse and Design:

The Data Warehouse and Data Models,The Data Model and iterative

development, Normalization and de-normalization.

(Chapter 3 of Textbook 3) (4 hrs)

3. Granularity in the Data Warehouse:

Raw Estimates, Input to Planning process, Over flow storage, Levels of

Granularity-Banking Environment.

(Chapter 4 of Textbook 3) (3hrs)

4. The Data Warehouse and Technology:

72

Managing large Amounts of Data, Managing Multiple Media, Index/monitor

Data, Language Interface, Efficient loading of Data, Efficient Index Utilization,

Compaction of Data, Changing DBMS Technology, Multidimensional DBMS and

Data Warehouse, Data Warehousing across Multiple Storage Media, Meta data in

the Data Warehouse Environment, Context and Content, Refreshing the Data

Warehouse, Testing.

(Chapter 5 of Textbook 3) (9 hrs)

5. Data Mining:

Introduction, definition, KDD vs DM, DBMS vs DM, DM techniques, Issues and

challenges in DM, DM applications.

(Chapter 3 Sections 3.1-3.11 of text book 2) (3 hrs)

6. Association Rule Mining:

Introduction, Definition, Methods to Discover Association Rules, A Priori

Algorithm, Partition Algorithm, Pincer-Search Algorithm, Dynamic Itemset

Counting Algorithm, FP-tree Growth Algorithm.

(Chapter 4 Sections 4.1-4.8of text book 2) (8 hrs)

7.Classification and Prediction

Introduction, Issues regarding classification and prediction, classification by

decision tree induction, Pruning Technique, Bayesian classification, Rule-Based

classification, classification by backpropagation, support vector machines, other

classification methods, predication, Accuracy and error measures, evaluating the

accuracy of a classifier or predictor

(Chapter 6: sections 6.1 to 6.7 & 6.10 to 6.13 of Textbook 1) (5 hrs)

Text Books: 1. Jiawei Han and Micheline Kamber, (2007)“Data Mining- Concepts and

Techniques”, Morgan Kaufmann Publishers.

2. Arun K. Pujari,(2006)”Data Mining Techniques”, University press.

3. W.H.Inmon “Building the Data Ware House”,3rd

Edition 2002

References:

1. M. H. Dunham, (2006) “Data Mining: Introductory and Advanced Topics”,

Pearson Education.. 2. I. H. Witten and E. Frank, (2000), ” Data Mining: Practical Machine

Learning Tools and Techniques”, Morgan Kaufmann.

73

3. D. Hand, H. Mannila and P. Smyth, (2001) ” Principles of Data Mining”, Prentice-Hall.

74

CSE-405.3 MULTIMEDIA APPLICATIONS (ELECTIVE) [ 3 0 0 3]

1.Overview: Uses of multimedia; convergence of computers, communications and entertainment products; distributed multimedia systems. (Selected topics from Text book 1) (4

hrs) 2. Digital Audio Representation and Processing:

Psychoacoustics; representation, transmission and processing of digital audio signals; digital music making; speech recognition and generation. (Selected topics from Text book 1) (5

hrs) 3. Video Technology: Scanners; TV cameras; colour and video, TV standards. (Selected topics from Text book 1) (5

hrs) 4. Digital video and image compression: Evaluating a compression system; compression techniques; JPEG and MPEG standards, wavelet techniques. (Selected topics from Text book 1) (10

hrs) 5. Time based media representation and delivery:

Models of time; time and multimedia requirements; support for system timing enforcement – delivery.

75

(Selected topics from Text book 1) (5

hrs) 6. Multimedia Information Systems:

Operating system requirements; multimedia devices, presentation tools, user interface; multimedia file systems and information models, multimedia presentation and authoring. (Selected topics from Text book 1) (4 hrs)

7. Multimedia Communications: Requirements, architecture, protocols. (Selected topics from Text book 1) (3 hrs) Text book:

1. J.F.K. Bulford, Multimedia Systems , Addison Wesley Publication Co., 1994.

References:

1. Tay Vaughan, Multimedia Making it Work (5th Edition), TMH Edition, 2001. 2. F.F. KUO W. Effelsberg , Multimedia Communications,


MAT 402 MATHEMATICAL MODELLING (ELECTIVE) [ 3 0 0 3 ]

76

Introduction, Techniques, classification and characteristics of mathematical models,

mathematical modeling through geometry, ordinary differential equations of first order.

Mathematical modeling through systems of ordinary differential equations of first order,

linear growth and decay models, modeling of population dynamics and modeling of

epidemics through systems of ordinary differential equations, modeling in medicine, arms

race battles.

Mathematical modeling through difference equations, some simple models. Modelling of

economics and finance through difference equations, population dynamics and generation

of models through difference equations, modeling in probability theory, examples.

Optimization models: Mathematical modeling through linear programming, Dynamic

programming and Game theory.

Mathematical modelling through graphs: elements of graphs, digraphs, shortest path

problems, Bellman’s optimality principle, Dijkstra’s algorithm, spanning trees, Prim’s

algorithm. Networks, Flow augmenting paths, Ford Fulkerson algorithm.

References :

1. Mathematical Modelling, Edn. 1988, Wiley Eastern by J.N.Kapoor.

2. Advanced Engineering mathematics, 7th

edn., 1993 John Wiley & sons by Erwin

Kreyszig.

77

CSE-407.1 EMBEDDED SYSTEMS (ELECTIVE) [ 3 0 0 3 ]

1. Introduction to Embedded Systems-Hardware and Software Architecture.

(Chapter 1 Sections 1.1-1.6, Chapter 2 Sections 2.1-2.5 Textbook 1) (2 hrs)

2. 8051 Microcontrollers and Assembly language programming, I/O port programming

8051 Addressing Modes, Jump, Loop and Call Instructions, Arithmetic and logic

instructions, 8051 Programming in C

(Chapter 1 Sections 1.1,1.2, Chapter 2 Sections 2.1-2.7, Chapter 3 Sections 3.1-

3.3, Chapter 4 Sections 4.1,4.2, Chapter 5 Sections 5.1-5.4, Chapter 6 Sections

6.1-6.5, Chapter 7 Sections 7.1,7.6 Textbook 2) (10 hrs)

3. 8051 Timer/Counter programming in Assembly and C, 8051Serial Port programming

in Assembly and C, Interrupts programming in Assembly and C, I/O port

programming

(Chapter 9 Sections 9.1-9.3, Chapter 10 Sections 10.2,10.3, Chapter 11 Sections

11.1-11.6 Textbook 2) (9hrs)

4. LCD and Keyboard Interfacing , ADC, DAC and Sensor Interfacing, 8051 Interfacing

to external memory, 8051 interfacing with the 8255

(Chapter 12 Sections 12.1,12.2, Chapter 13 Sections 13.1-13.3, Chapter 14

Sections 14.2-14.4, Chapter 15 Sections 15.1 Textbook 2) (7 hrs)

5. Real time operating system concepts-Real time kernels, Theoretical Foundations of

RTOS , Intertask Communications and Synchronization, Memory management

(Chapter 3 Sections 3.1-3.4 Textbook 3) (8 hrs)

Text Books: 1. Dr. K.V.K.K.Prasad(2003), “Embedded/Real –Time Systems: Concepts,

Design and Programming”, Dreamtech Press

78

2. Muhammed Ali Mazidi, J.C. Mazidi and Rolin D. McKinlay(2007),” The

8051 Microcontroller & Embedded Systems Using Assembly and C”, Prentice

Hall of India Private Limited , 2nd

edition.

3. Phillip A. Laplante (2006),Real -Time Systems Design and Analysis , Wiley

India Edition, 3rd

edition.

4. C.M. Krishna & Kang G. Shin(1997), Real time Systems, McGraw Hill

International Edition,1997.

CSE –407.2 DEVELOPMENT OF UNIX OPERATING SYSTEM

(ELECTIVE) [ 3 0 0 3 ]

1. GENERAL OVERVIEW OF THE SYSTEM (1 Hr.)

System structure, User perspective, Operating system services, Introduction to

hardware

2. INTRODUCTION TO KERNAL (2 Hrs)

Architecture of unix operating system, Introduction to system concepts, Kernel data

structures, System administration

3. BUFFER CACHE (2 Hrs)

Buffer headers, Structure of the buffer pool, Scenarios for retrieval of a buffer,

Reading and writing disk blocks, Advantages and disadvantages of disk blocks

4. INTERNAL REPRESENTATION OF FILES (3 Hrs)

Inodes, Structure of a regular file, Directories, Conversion of a path name to an inode,

Super block, Inode assignment to a new file, Allocation of disk blocks, Otherfile

types

5. SYSTEM CALLS FOR THE FILE SYSTEM (6 Hrs)

Open, read, write, file and record locking, adjusting the position of file i/o- lseek,

close, file creation, creation of special files, 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.

6 PROCESSES (5 Hrs)

Process states and transitions, Layout of system memory, The context of a process,

Saving the context of a process, Manipulation of the process address space, Sleep

79

7 PROCESS CONTROL (5 Hrs)

Process creation, Signals, Process termination, Awaiting process termination,

Invoking other programs, The user id of a process, Changing the size of process, The

shell, System boot and the Init process

8 PROCESS SCHEDULING AND TIME (3 Hrs)

Process scheduling, System calls for time, Clock

9 MEMORY MANAGEMENT (4 Hrs)

Swapping, Demand paging, A hybrid system with swapping and demand paging

10 I/O SUBSYSTEM (3 Hrs)

Driver interfaces, Disk drivers, Terminal drivers, Streams

11 INTERPROCESS COMMUNICATION (2 Hrs)

Process tracing, System V IPC, Network communications, Sockets

Text Books: 1. Maurice J. Bach, The Design Of Unix Operating System, Prentice Hall Of

India, 1988, (Chapters 1 To 11).

2. Rachel Morgan & Henry Mcgilton, Introducing Unix System V, Mcgraw-Hill

International Editions, 1987, (Chapter 13).

References:

1. Stephen G Kochan & Patrick H Wood, Exploring The Unix System, Cbs

Publishers & Distributers, 1984.

2. Abdul Mohammad, Unix Step By Step, Narosa Publications.

3. Karee Christian, The Unix Operating System (Second Edition), John Wiley

& Sons, 1989.

80

CSE -407.3 PATTERN RECOGNITION (ELECTIVE) [ 3 0 0 3 ]

81

1. Introduction: Applications of pattern recognition, statistical decision theory,

image processing and analysis.

(Text1: Chapter 1) (3 hrs)

2. Probability: Introduction, probability of events, random variables, joint

distributions and densities, moments of random variables, estimation of

parameters from samples, minimum risk estimators.


3. Statistical Decision Making: Introduction, Bayes’ theorem, multiple features,

conditionally independent features, decision boundaries, unequal costs of error,

estimation of error rates, the leaving-one-out technique, characteristic curves,

estimating the composition of populations.


4. Nonparametric Decision Making: Introduction, histograms, kernel and window

estimators, nearest neighbor classification techniques, adaptive decision

boundaries, adaptive discreminant functions, minimum squared error discriminant

functions, choosing a decision making technique.

(Text1 : Chapter 4) (10 hrs)

5. Unsupervised learning and clustering: Mixture densities and identifiability,

maximum-likelihood estimates, application to normal mixtures, unsupervised

Bayesian learning, data decryption and clustering, criterion functions and

clustering, hierarchical clustering, on-line clustering, Component analysis, low-

dimensional representations and multidimensional scaling.

(Text 2: Chapter 10) (5 hrs)

Text Books: 1. Earl Gose, Richard Johnsonbaugh and Steve Jost,( 2003) “ Pattern Recognition

and Image Analysis”, Prentice Hall of India,

2. R.D. Duda, P.E. Hart and D.G. Stork (2001) Pattern Classificaiton, 2nd

Edition,

John Wiley Inc.

Reference Book: 1. Robert Schalkoff (1992) pattern Recognition, Statistical, Structural and Neural

Approaches, John Wiley Inc.

2. Robert Schalkoff, (1992) Pattern Recognition: Statistical, Structural and Neural

Approaches, John Wiley & Sons Inc.

.

82

CSE407.4 ADVANCED SOFTWARE ENGINEERING (ELECTIVE)

[ 3 0 0 3]

1. Software Architecture :

What is software architecture and why need it? Software Architectures,

Architectural Styles, Design Patterns. Verification & Validation of design.

(Ch.10.1, Text1 Ch.10.1-10.4 of Text2) (6 hrs)

2. Formal Methods & Specifications :

Basic concepts, Mathematical preliminaries, Applying mathematics to formal

specifications, Formal specification language, Model oriented specification

Algebraic specifications, Specification by pre and post conditions, Ten

Commandments of formal methods.

(Ch.15.2-15.4, Text2 Ch 28.1-28.3, 28.6-28.7 of Text1) (6 hrs)

3. Clean Room Software Engineering :

Clean room approach, Functional specifications, Clean room design, Clean room

testing.

(Ch.29.1- 29.4 of Text2) (4 hrs)

4. Components based development :

Component based system engineering, CBSE Process, Domain Engineering,

Component based development, Classifying and retrieving components, Cost

efficiencies of CBSE.

(Ch.30.1- 30.6 of Text2) (8 hrs)

5. User Interface design :

Where & What of User Interface?, Human factors in Human computer interface,

Role models in HCI, Design of interactive systems, Task analysis, Specification

of UI detail Evaluation of analysis, specification & prototype.

(Ch.16.1-16.7 of Text1) (8 hrs)

6. Software Reliability :

Example of software reliability, Estimation of software reliability, Exercises.

(Ch.18.1- 18.4 of Text1) (4 hrs)

Text Books:

3. Software Engineering Principles & Practice, Hans Van Vliet, Second Edition,

2004, John Wiley & Sons.

4. Software Engineering : A practitioner’s approach, Roger Pressman Edition 5th

2005.

References:

1. Shari Lawrence Pfleeger, Joanne M. Atlee, Software Engineering, (3rd

Edition),


83

2. Software Engineering Principles & Practice, Hans Van Vliet, Second Edition,

2004, John Wiley & Sons.

3. Somerville I. S., Software Engineering (7th Edition), Pearson Education, 2004.

CSE-407.5 LINUX INTERNALS (ELECTIVE)

[ 3 0 0 3 ]

1. Linux — the Operating System

Main Characteristics

( Textbook-Chapter 1-1.1) (2hrs)

2. Introduction to the Kernel.

Important Data Structures, The Task Structure, The Process Table, Files and I-

nodes, Dynamic Memory Management, Queues and Semaphores, System Time

and Timers, Main Algorithms, Signals, Hardware Interrupts. Software Interrupts.

Booting the System, Timer Interrupts, The Scheduler. Implementation of System

Calls. Working of System Calls, Examples of Simple System Calls

(Textbook-Chapter 3-3.1 to 3.3) (8hrs)

3. Memory Management.

The Architecture-Independent Memory Model. Pages of Memory, Virtual

Address Space, Converting the Linear Address, Page Directories, The Page Table,

The Virtual Address Space of a Process\, The User Segment, Virtual Memory

Areas, The System Call BRK, Mapping Functions, The Kernel Segment, Memory

Allocation in the Kernel Segment During Booting, Dynamic

Memory,Management in the Kernel Segment, Block Device Caching, Block

Buffering, Bdflush and Kupdate, List Structures for the Buffer Cache, Using the

Buffer Cache, Paging Under Linux, Memory Management and the Memory

Cache, Reserving a Page of Memory, Optimization of Memory Page Management

Via Kernel Threads, Page Errors and Reloading a Page.

( Textbook-Chapter 4-4.1 to 4.4) (8hrs)

4. Interprocess Communication.

Synchronization in the Kernel, Communication via Files, Locking Entire Files,

Locking File Areas, Pipes, Debugging Using Ptrace, System V IPC, Access

Rights, Numbers, and Keys, Semaphores, Message Queues, Shared Memory, IPC

with Sockets

(Textbook-Chapter 5-5.1 to 5.6.1) (10hrs)

5. The Linux File System.

Basic Principles, The Representation of File Systems in the Kernel, Mounting,

The Superblock, Superblock Operations, The Directory Cache, DEntry perations,

The Inode, Inode Operations, The File Structure, File Operations, Opening a File,

84

The Ext2 File System, The Structure of the Ext2 File System, Directories in the

Ext2 File System, Block Allocation in the Ext2 File System, Extensions of the

Ext2 File System.

(Textbook-Chapter 6-6.1 to 6.3.4) (8hrs)

Textbook:

Linux Kernel Programming –Third Edition-M Beck, H Bohme, M Dziadzka-Pearson

Education Asia-2002

References: 1. Daniel P. Bovet, marco Cesati, “Understanding the Kernel”, 3rd Edition, O’Reilly

Publishers

2. Maurice J Bach, “Design of Operating Systems

3. Richard Stevens, “Advanced Programming in Unix”

4. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System

Principle,7th

Edition( For conceptual Understanding)

Websites:

1. http://en.tldp.org/LDP/tlk/tlk.html

(For simpler explanation on- Memory Management, Processes, Interprocess

Communication Mechanisms, Interrupts and Interrupt Handling, Device Drivers, The

File System, Networks, Kernel Mechanisms, Modules, Processors , The Linux Kernel

Sources, Linux Data Structures , Useful Web and FTP Sites, The LPD Manifesto)

2. http://learnlinux.tsf.org.za/courses/build/internals/

3. http://www.faqs.org/docs/kernel_2_4/lki.html

85

CSE-409 ADVANCED INTERNET TECHNOLOGY

[ 3 1 0 4 ]

ASP.NET Introduction:

The .NET Framework , (Learning the Visual Basic .NET Language Types,

Objects and Namespaces

(Selected topics from Text book 1) (5 hrs)

ASP.NET Applications

Web Form Fundamentals, Web Controls, Using Visual Studio .NET, Validation

and Rich Controls, State Management Tracing, Logging, and Error Handling

Deploying ASP.NET


Overview of ADO.NET

ADO.NET Data Access, Data Binding, The DataList, DataGrid, and Repeater,

Files, Streams, and Email, Using XML


Web Services Architecture

Creating Web Services, Using Web Services.

(Selected topics from Text book 1) (5 hrs.)

Component-Based Programming

Custom Controls, Caching and Performance Tuning, Implementing Security.

(Selected topics from Text book 1) (6 hrs.)

Prerequisites:

86

SQL, HTML, ASP (8hrs)

Text Book:

1. Beginning ASP.NET in VB .NET: From Novice to Professional, Matthew

MacDonald, Apress, Berkely, 2004

Reference Books:

1. ASP.NET & VB.NET Web programming, Matt J. Crouch, Pearson Education

Inc., 2002

2. ASP.NET Solutions-23 case studies, Rick Leinecker, Pearson Education Inc.,

2004

3. XML In a nutshell, Elliotte Rusty Harold & W. Scott Means, O'Reilly 3rd

edition,

2005

4. Beginning XML, David Hunter, Wrox Press Ltd, 2000

CSE-411 COMPUTER ARCHITECTURE AND PARALLEL

PROCESSING (3 1 0 4)

1.Introduction to parallel processing:

Trends towards parallel processing, Parallelism in uniprocessor systems, Parallel

computer structures, Architectural classification schemes, Parallel processing

applications

(Chapter 1.2.1, 1.2.2, 1.2.3, 1.2.4, 1.3.1, 1.3.2, 1.3.3, 1.3.5,1.4.1, 1.4.2, 1.4.3,

1.5.1, 1.5.2, 1.5.3, 1.5.4 of Text 1) (7 hrs)

2.Principles of pipelining and vector processing:

Pipelining: An overlapped parallelism, Instruction and arithmetic pipelines

Principles of designing pipeline processors, vector Processing requirements

(Chapter 3.1, 3.1.1, 3.1.2, 3.1.3, 3.1.4 upto page no.162, 3.2, 3.2.1, 3.2.2 upto

page no.174, 3.2.3, 3.3, 3.3.1, 3.3.2 (fig 3.33 excluded), 3.3.3, 3.3.4, 3.3.5, 3.4,

3.4.1, 3.4.3 (excluding vector looping method) of Text 1) (13 hrs)

3.Structures and algorithms for Array Processors:

SIMD array processors, SIMD interconnection networks, Parallel algorithms for

array processors

(Chapter 5.1, 5.1.1, 5.1.2, 5.1.3, 5.2, 5.2.1, 5.2.2, 5.2.3, 5.2.4 ( data manipulator

excluded), 5.2.5, 5.3, 5.3.1, 5.3.2 of Text 1) (9 hrs)

4.Multiprocessor architecture and programming:

87

Functional structures, Interconnection networks, Parallel memory organization,

Exploiting concurrency for multiprocessing

(Chapters 7.1, 7.1.1(upto page 462), 7.1.2(upto page 472), 7.1.3, 7.2, 7.2.1, 7.2.2,

7.2.3,7.3, 7.3.3 excluding figs.7.48 and 7.49), 7.5, 7.5.1 of Text 1)

(8 hrs)

5.Data flow computers:

Data driven computing and languages, Data flow computer architecture.

(Chapter 10.1, 10.1.1, 10.1.2, 10.1.3, 10.2, 10.2.1, 10.2.2 of Text 1) (6 hrs)

6.I/O subsystems:

Characteristics of I/O subsystems, I/O processors and I/O channels, Disk arrays

I/O strategy, Shadowing, Striping, RAIDS

(Chapters 2.5.1, 2.5.3 of Text 1) (5 hrs)

Textbooks: 1. Kai Hwang and Faye A. Briggs, “Computer Architecture and Parallel

Processing”, McGraw Hill Publication, 1984.

References: 1. John L. Hennessy and David A. Patterson, “Computer Architecture: A

quantitative Approach”, 3rd

Edition, Morgan Kaufmann Publishers, Reprinted

2005.

2. Kai Hwang, “Advanced Computer Architecture- Parallelism, Scalability and

Programmability”, McGraw-Hill publications, 1993.

.

88

CSE-413 MINI PROJECT

[ 0 0 3 1 ]

The students are supposed to carry out a mini project in the area of their interest, using

software engg. technologies, in a group of two. This could be considered as a foundation

for the major project to be carried in the eighth semester.

CSE -415 ADVANCED INTERNET TECHNOLOGY LAB

(Week wise programming topics) [ 0 1 2 2 ]

1. Review of VB Script and ASP

89

2. Simple ASP.NET Applications

3. Server-Side web controls

4. Web controls-1

5. Web controls-2

6. Simple Visual Studio.Net projects

7. Calendar and AdRotator controls

8. Validation controls and State Management

9. Database Programming for ASP.NET: ADO.NET -1

10. Database Programming for ASP.NET: ADO.NET -2

11. Files and Streams

12. Using XML in ASP.NET

References:

1. Beginning ASP.NET in VB .NET: From Novice to Professional, Matthew

MacDonald, Apress, Berkely, 2004

2.Web Resources

CSE-402 SEMINAR

[ 0 0 3 1]

Each student has to present a seminar individually, on any technical topic related to the

subject, but not covered in the syllabus. The time duration for presentation is 45 minutes

and 15 minutes is devoted for question and answer session. Slides have to be prepared

for the presentation. A seminar report has to be submitted on the day of the presentation.

Reference Materials : IEEE transactions, Technical journals, Proceedings of National

and International Conferences, Web sites.

90

CSE-404 INDUSTRIAL TRAINING

[0 0 3 1]

The Students are supposed to take up either industrial training or an industrial tour

during the vacations after 2nd

semester and before the beginning of the 7th

semester. The

evaluation is carried out in 7th

semester and the obtained grade included in 7th

semester

grade sheet.

CSE- 499 PROJECT

[0 0 -- 20]

The final project gives an opportunity to the students to use the

methodologies/techniques taught in several courses over a period of 7 semesters. Projects

will be done using software engineering approach. This course provides the students with

the opportunity to work on a project from conception through implementation and testing

of a prototype. The emphasis in this course is the analysis, design and implementation as

per software engg. guidelines. It is expected that each project group will have a working

prototype to demonstrate by the end of this course. The students can carry out the project

either in an industry or in the college.

B.E. COMPUTER SCIENCE AND ENGINEERING

Y

r

Sub

Code

FIRST SEMESTER Sub.

Code

SECOND SEMESTER

Sub. Name L T P C Sub. Name

2

MAT-

CSE- 201

CSE- 203

CSE- 205

DISCRETE MATHEMATICAL

STRUCTURES

COMPUTER ORGANIZATION &

DESIGN

SWITCHING THEORY & LOGIC DESIGN

3

3

3

1

1

1

0

0

0

4

4

4

MAT-CSE-202

CSE- 204

CSE -206

PROBABILITY STATISTICS &

STOCHASTIC PROCESS

FORMAL LANGUAGES &

AUTOMATA THEORY

RELATIONAL DATABASE MGT. SYSTEMS

91

CSE-207

CSE -209

CSE -211

CSE -213

CSE -215

DATA STRUCTURES USING C

OBJECT ORIENTED PROGRAMMING

USING C++

SWITCHING THEORY & LOGIC

DESIGN LAB. USING VHDL

DATA STRUCTURES USING C LAB.

OBJECT ORIENTED PROGRAMMING USING C++ LAB

3

3

0

0

0

1

1

1

1

1

0

0

2

2

2

4

4

2

2

2

CSE -208

CSE -210

CSE -212

CSE -214

CSE -216

MICROPROCESSORS

EVENT DRIVEN PROGRAMMING

USING JAVA

RELATIONAL DATABASE MGT.

SYSTEMS LAB.

MICROPROCESSORS LAB.

JAVA PROGRAMMING LAB.

15 8 6 26

3

CSE- 301

CSE -303

CSE -305

CSE -307

CSE -309

CSE -311

CSE -313

CSE -315

DESIGN & ANALYSIS OF

ALGORITHMS

SOFTWARE ENGINEERING

COMPUTER GRAPHICS &

MULTIMEDIA

OPERATING SYSTEM & LINUX

COMPUTER COMMUNICATION & NETWORKS

DESIGN & ANALYSIS OF

ALGORITHMS LAB.

COMPUTER GRAPHICS & MULTI-

MEDIA LAB

OPERATING SYSTEM & LINUX LAB.

3

3

3

3

3

0

0

0

1

1

1

1

1

1

1

1

0

0

0

0

0

2

2

2

4

4

4

4

4

2

2

2

CSE- 302

HUM- 304

CSE- 306

CSE- 308

CSE- 310

CSE- 312 CSE- 314

CSE- 316

LANGUAGE PROCESSORS

FINANCIAL MANAGEMENT

NETWORK PROTOCOLS

OBJECT ORIENTED ANALYSIS &

DESIGN USING UML

ELECTIVE -I

LANGUAGE PROCESSORS LAB.COMPUTER NETWORK S LAB.

OBJECT ORIENTED ANALYSIS &

DESIGN USING UML LAB.

.

TOTAL 15 8 6 26 TOTAL

4

CSE-401

CSE- 403

CSE- 405

CSE- 407

CSE- 409

CSE- 411

CSE- 413

CSE-415

DISTRIBUTED SYSTEMS

ELECTIVE II

ELECTIVE-III

ELECTIVE-IV

ADVANCED INTERNET

TECHNOLOGY

COMPUTER ARCHITECTURE &

PARALLEL PROCESSING

MINI PROJECT ADVANCED INTERNET

TECHNOLOGY LAB

3

3

3

3

3

3

0

0

1

0

0

0

1

1

0

1

0

0

0

0

0

0

3

2

4

3

3

3

4

4

1

2

CSE 402 (*)

CSE 404 (*)

CSE 499

SEMINAR INDUSTRIAL TRAINING

PROJECT

TOTAL 18 3 5 24 TOTAL

Note: (*) Evaluation is carried out in 7th

semester and grade is included in 8th

semester grade sheet.

2 :-

CSE 310 ELECTIVE I:

CSE 310.1 Digital Image Analysis

CSE 310.2 Advanced Database Systems

CSE 310.3 CAD for VLSI

92

MAT 301 Graph Theory

CSE- 403 ELECTIVE II:

CSE 403.1 Electronic Commerce

CSE 403.2 Storage Devices Technology

CSE 403.3 Artificial Intelligence

MAT 401 Operations Research

CSE- 405 ELECTIVE III:

CSE 405.1 Neural Networks and Fuzzy Systems

CSE 405.2 Data Warehousing and Data Mining CSE 405.3 Multimedia Applications

MAT 402 Mathematical Modelling

CSE- 407 ELECTIVE IV:

CSE 407.1 Embedded Systems

CSE 407.2 Development of UNIX Operating System

CSE 407.3 Pattern Recognition

CSE 407.4 Advanced Software Engineering

CSE 407.5 Linux Internals

Note: Few Electives from the above list will be offered depending on the availability

of Faculty.

93

UGSyllabus_CSE

Documents

shari lawrence

ordinary differential

nondeterministic

relevant research

hans van vliet

mc graw hill

fiber channel

recursively