MIT Manipal CSE 07-11 Course Plan

BE COMPUTER SCIENCE AND ENGINEERING
SE COND YEAR TO FOUR TH YEA R

Sub. FIRST SEMESTER Sub. SECOND SEMESTER
Code Sub. Name L T P C Code Sub. Name
MAT-CSE- 201 PROBABILITY STATISTICS & 3 1 0 4 MAT-CSE-202 DISCRETE MATHEMATICAL
STOCHASTIC PROCESS STRUCTURES
CSE- 203 COMPUTER ORGN. & ARCHITECTURE 3 1 0 4 CSE 204
DESIGN & ANALYSIS OF ALGORITHMS
CSE 205 LOGIC DESIGN 3 1 0 4 CSE 206
2 CSE 207 DATA STRUCTURES 3 1 0 4 CSE 208 DATABASE MGT. SYSTEMS
CSE 209 OBJECT ORIENTED PROGRAMMING 3 1 0 4 CSE 210 P.C. SYSTEMS
WITH C++ EVENT DRIVEN PROGRAMMING WITH
CSE 211 LOGIC DESIGN LAB. 0 0 3 1 CSE 212 JAVA
CSE 213 DATA STRUCTURES LAB. 0 0 3 1 CSE 214 DATABASE MGT. SYSTEMS LAB.
CSE 215 OBJECT ORIENTED PROGRAMMING 0 0 3 1 CSE 216 P.C. SYSTEMS LAB.
WITH C++ LAB. JAVA PROGRAMMING LAB.
TOTAL 15 5 9 23 TOTAL
CSE 301 THEORY OF COMPUTATION 3 1 0 4 CSE 302 SOFTWARE ENGINEERING
CSE 303 PRINCIPLES OF PROGRAMMING HUM 304 FINANCIAL MANAGEMENT
LANGUAGES 3 1 0 4 CSE 306 COMPILER CONSTRUCTION
CSE 305 SYSTEMS PROGRAMMING 3 1 0 4 CSE 308 TCP/IP & INTERNET TECHNOLOGY
3 CSE 307 OPERATING SYSTEMS & UNIX 3 1 0 4 CSE 310 COMPUTER GRAPHICS
CSE 309 COMPUTER COMMUNICATION & 3 1 0 4 CSE 312 COMPILER LAB.
NETWORKS CSE 314 INTERNET TECHNOLOGY LAB.
CSE 311 SYSTEMS PROGRAMMING LAB. 0 1 2 2 CSE 316 COMPUTER GRAPHICS LAB.
CSE 313 OPERATING SYSTEMS & UNIX LAB. 0 1 2 2
CSE 315 COMPUTER COMMUNICATION & 0 1 2 2
NETWORKS LAB.
CSE-401 DISTRIBUTED SYSTEMS 3 1 0 4 CSE 402 (*) SEMINAR
CSE 403 ELECTIVE-I 4 0 0 4 CSE 404 (*) INDUSTRIAL TRAINING/TOUR
CSE 405 ELECTIVE-II 4 0 0 4 CSE 499 PROJECT WORK
CSE 407 ELECTIVE-III 4 0 0 4
4 CSE 409 3 1 0 4
DEVELOPMENT OF WINDOWS
APPLICATIONS(VC++)
CSE 411 0 0 6 2
CSE 413 MINI PROJECT 0 1 2 2
VC++ LAB.
No te : (*) Evaluation is carried out in 7th semester and grade is included in 8th semester grade sheet.
G.
Ma t-Cse 201 Probabil ity , Sta tis tics And Stochast ic Proces s [3 1 0 4 ]
Axioms, Definition Of Probability, Conditional Probability, Total Probability Theorem, Baye’s Theorem,
Applications.
One Dimensional Random Variables, Mean And Variance, Chebyschev’s Inequality.
Two Dimensional Random Variables, Mean, Variance, Covariance, Correlation Coefficient,
Distributions, Binomial, Poisson, Normal And Chisquare.
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.
Stochastic Process: Classification Statistics Of Stochastic Process, Stationary And Ergodic Process.
Textb ooks :
1. P . L. Meye r : Introduction To Probability And Statistical Applications.
2. K. S. Triv edi : Probablity, Statistics With Reliability, Queuing And Computer Science Applications. Phi,
1988.
3. Mil ler , Fre und An d John son, Probability And Statistics For Engineers, 4th Edn, Phi, 1990.
Cse 203 Co mputer Organizat ion And Archi tecture [3 1 0 4 ]

Introduction To Computers: Von Neumann Architecture, Hardware, Software And Firmware, Basics Of
Computer Architecture, Computer Structures. (3 Hrs.)
(Chapter 1 Of Text 1)
Computer Instruction Set: Opcode Encoding, Addressing Modes, Instruction Types.

(Chapter 2 Of Text 1) (4 Hrs.)
Computer Arithmetic: Integer Representation, Integer Arithmetic, Floating Point Representation, Floating
Point Arithmetic.
Execution Unit: Register Section, Adders, Alu Design, Bit Sliced Processor.
Control Unit: Basic Concepts, Bus Structures, Hardwired Control Unit, Microprogrammed Control Design,
Hardwired Versus Microprogrammed.
Memory Organization: Characteristics Of Memory System, Main Memory Design, Memory Hierarchy,
Cache Memories, Associative Memory, Virtual Memory And Memory Management Concepts.
Input-Output System:- Basic Concepts, Programmed I/O, Interrupt I/O, Direct Memory Access.
Textb ooks :
1. Mo ham med Ra fiqu zza man An d Ra jan Cha ndr a – “Modem Computer Architecture”, Galgotia
Publications Pvt. Ltd., 1995.
2. Wil liam St allin gs – “Computer Organization And Architecture”, Maxwell Macmillan International
Editions, Second Edition.
Re fere nce :
1. Jo hn P. Hay es, “Computer Architecture And Organization”, Mcgraw Hill International Editions, 3rd
Edition.
2. Ha mac her , Vrane sic And Za ky – “Computer Organization”, Mcgraw Hill International Editions, 4th
Edition.
Cse 205 Logic Des ign [3 1 0 4 ]

1. Binary Codes And Boolean Algebra: Signed Binary Numbers - Signed Magnitude, 1’s Complement, 2’s
Complement , Offset Binary, Subtraction With 1’s Complement And 2’s Complement, Introduction To
Binary Codes, Introduction To Boolean Algebra, K-Map, Tabulation Method. (8 Hrs.)
(Sections 1.6 And 1.7, Chapters 2 And 3 Of Textbook 1)
2. Combinational Logic: Design Procedure, Design Of Adders, Subtractors, Code Converters, Analysis
Procedure, Multilevel Nand And Nor Circuits. Ex-Or And Equivalence Functions.
(Chapter 4 Of Textbook 1). (7
Hrs.)
3. Combinational Logic With Msi And Lsi: Binary Parallel Adder (74283), Carry Look Ahead Adder (74182),
Comparator(7485), Decoders(74138,7442), Encoder(74148), Multiplexer (74157, 74151)
(8 Hrs.)
(Chapter 5 Of Textbook 1) (For Ic Details Refer Textbook 2 And Ttl Manual)
4. Sequential Logic : Nand /Nor Gate Latch, Clocked S-R, ‘J-K,D, T, J-K Master Slave Flip Flops. Design
Of Synchronous Counters, Asynchronous Counters, Shift Registers- Siso, Sipo, Piso, Pipo, Ring
Counter, Johnson Counter, Bidirectional Shift Registers. (Basic Principles Only).
(13 Hrs.)
(Chapter 6 (Except Section 6.5) Of Textbook 1. Section 7.4 Of Textbook 1, Sections 7.20, 7.22, 7.21,
7.19, 7.15 Of Textbook 2 And 7.3 Of Textbook 1).
5. Schmitt Trigger (Using Ic 7414), Astable And Monostable Multivibrator (Using Ic 555), D/A And A/D
Converters. (9 Hrs.)
(Section 5.24 Of Textbook 2, Sections 1.1, 1.2, 2.1, 3.1.1, 3.3 4.1, 4.2, 4.3, 5.1, 5.2 And 5.3 Of
Textbook 3, Sections 10.1 To 10.4, 10.8, 10.9, 10.11, 10.12, 10.13 (Ic’s Are Not Included) Of Textbook 2.
6. Introduction To Ram, Rom, Pla (3 Hrs.)

(Sections 11.2 To 11.4, 11.11 To 11.14 Of Text Book 2).
Textb ooks
1. M. Mor ris Man o, “Digital Design” 2nd Edition, Prentice Hall Of India Pvt. Ltd., 1999.
2. Ro nal d J. Tocci, “ Digital Systems Design, Principles And Applications” 6th Edition, Prentice Hall Of
India Pvt. Ltd., 1999.
3. Wal ter G. Jung ,“ Ic Timer Cook Book” 2ndEdition. Howard W. Sams & Co. Inc.
Re fere nce s:
1. Taub And Sc hilli ng – “Digital Integrated Electronics”.
2. Mil lma n, Jaco b An d Grab el Arvin ,– “Micro Electronics”, New-York Mcgraw Hill 1987.
Cse 207 Da ta S tructures [3 1 0 4]

1. Overview Of C++:
Structures, Classes, Pointers, Inheritance, Templates. (5 Hrs.)
2. Algorithm Analysis. (2 Hrs.)
3. Recursion
- Definition And Examples.
- Complexity Analysis Of Recursive Programs. (2 Hrs.)
4. Stacks And Queues:

Fundamentals
Evaluation Of Expressions
Multiple Stacks & Queues
(Chapter 3 – 3.1,3.2,3.3,3.6,3.7 Of Text) (8 Hrs.)
5. Linked List:
Singly Linked List
Linked Stacks And Queues
Polynomial Addition & Evaluation
More On Linked Lists.
Doubly Linked Lists
(Chapter 4 – 4.1,4.2,4.3,4.4,4.5,4.6.1, 4.6.2,4.6.4.,4, 4.9 Of Text). (8 Hrs.)
6. Trees
Basic Terminology
Binary Trees
Binary Tree Specification
Binary Tree Traversal (Both Recursive And Nonrecursive)
Binary Tree Representation Of Trees
Application Of Trees –
Expression Trees
Set Representation, Union, Intersection, Difference
Binary Search Trees And Operations
Balanced Trees
(Chapter 5 – 5.1,5.2,5.3,5.4,5.7,5.10,10.2 Of Text) (10 Hrs.)
7. Sorting:
Insertion Sort With Analysis
Quick Sort With Analysis
Merge Sort With Analysis (Iterative And Recursive)
Heap Sort With Analysis
(Chapter 7 – 7.2, 7.3, 7.4, 7.5, 7.6 Of Text). (4 Hrs.)
8. Searching:
Sequential Search And Binary Search With Analysis. (2 Hrs.)
9. Graphs:
Terminology And Representation
Traversals
Shortest Paths And Transitive Closure
(Chapter 6 – 6.1,6.2,6.4 Of Text) (4 Hrs.)
10.Symbol Tables:
Hash Tables
Hashing Functions, Overflow Handling.
(Chapter 8 – 8.1, 8.2 Of Text)
Note: C++ Language Is To Be Used For All Implementation Examples And The Lab. Exercises.
Textb ooks :
1. Ell is Horow itz & S aha ni Sarta j – Fundamentals Of Data Structures In C++, Galgotia Book Source.
Re fere nce s:
1. Tanne nba um & Augu stin e – Data Structures Using C++, Prentice Hall.
2. Ell is Horow itz & S arta j Sa han i – Fundamentals Of Data Structures In C.
3. Da ta Stru ctur e, – “A Pseudo Approach Using C”, Richard F Billbug And Behrouz A.Forouzan.
4. Tre mble y And Sore nso n – Data Structures, Mcgraw Hill.
Cse 209 Ob ject-Oriented Prog ram ming W it h C ++ [3 1 0 4]
1. Lval And Rval Of A Variable, Pointer Types, Reference Types, Const Qualifiers.
(S ecti ons 3.2 .1, 3.3 , 3. 5, 3.6 Of Textbo ok 2 ) (2 Hrs.)
2. Principles Of Object Oriented Programming

(C hapt er 1 Of Text boo k 1) (2 Hrs.)
3. Classes And Objects.

4. Constructors And Destructors.
( Ch apt er 6 Of Textb ook 1) (2 Hrs.)
5. Class Scope, Name Resolution In Class Scope , Nested Classes, Name Resolution In Nested Class
Scope
(S ecti ons 13. 9, 13.9 .1, 13. 10, 13 .10. 1 Of Tex tbo ok 2 ) (2 Hrs.)
6. Class Initialization, Assignement And Destruction – A Revisit:
The Class Constructor, The Copy Constructor, The Class Destructor, Class Object Arrays, The
Member Initialization List, Memberwise Initialization, Memberwise Assignement, Efficiency
Considerations.
(S ecti ons 14. 1, 14.2 , 14.2. 1, 14. 2.3, 14 .3, 14. 4, 14.5 , 14.6, 14 .6.1 , 14.7, 14 .8 Of
Text- Book 2 ) (5 Hrs.)
7. Operator Overloading And Overloading << And >>
8. Templates
9. Inheritance
(C hapt er 8 And 9 Of Textb ook 1 ) (7 Hrs.)
10.Managing Console I/O Operations And Working With Files.
(C hapt er 10 And 11 Of Textb ook 1) (7 Hrs.)
11.Exception Handling
12.Functions
(S ecti ons 7.1 To 7. 3.3 , 7. 3.5 , 7. 2, 7.3, 7. 4, 7.6, 7.9 To 7 .9.3 O f Textb ook 2) (3 Hrs.)
13.Scope And Lifetime
(S ecti ons 8.1 To 8. 4.1 , 8. 4.3 To 8. 4.4 Of Text boo k 2) (2 Hrs.)
14.Overloaded Functions
(S ecti ons 9.1 To 9.1. 3, 9.1. 6, 9.1. 7, 9.2 And 9. 3 Of Text boo k 2) (3 Hrs.)
Textb ooks
1. E. Bal agu rusw am y, Obje ct Orie nted Pr ogra mmi ng With C++, Tmh Second Edition 2001.
(Textbook 1)
2. St ane ly B. Li ppm an And Jos ee Laj oie, C++ Pri mer , Addison Wesley 3rdEdition 1999. (Text
Book 2)
3. He rber t Sc hild t, Th e Co mpl ete Ref eren ce C++, Tmh 3rd Edition 1999. (Textbook 3)
Re fere nce s:
1. H. M. Diet el And P. J. Diet el, C++ How To Program, Pearson Education Asia Third Edition.
2. Tony Gad dis, Starting Out With C++, Dreamtech Press 3rd Edition.
3. Dr . N.V . S ubb ared dy , Object Oriented Programming With C++ And Vc++, Rajeshwary
Publications, First Edition.
Cse 211 Logic Design Lab. [0 0 3 1]

1. Verification Of Logic Gates
2. Simplification Of Boolean Algebra And Code Converter Using Gates
3. Full Adder/ Subtractor, Code Converter Using 74283.
4. Verification Using Mux, Decoder
5. Basic Logic Gates ,Flip Flop (T,D,S-R,J-K), Adders/Subtractor, Multiplexer, Decoder, Shift Register,
Counters, Shift Registers, Simple Arithmetic Unit Implementation (Include Addition, Subtraction,
Multiplication, Division), 4 Bit Full Adder (Using Component), Comparator.
6. Counter – – Synchronous, Asynchronous And Shift Registers Using J-K Flip Flops.
Cse 213 Da ta S tructure s Lab . [0 0 3 1 ]

Programming Exercises Should Be For The Theory Topics Covered In Cse-207.
These Exercises Have To Be Carried Out Using C
Experiments Should Include But Not Limited To:
1. Implementation Of Array Operations And Recursion:

Stacks And Queues: Adding, Deleting Elements
Circular Queue: Adding And Deleting Elements
Evaluation Of Expression
Operations On Multiple Stacks And Queues
2. Implementation Of Linked Lists; Inserting, Deleting, Inverting A
Linked List. Implementation Of Stacks And Queues Using Linked Lists
Polynomial Addition, Reading And Erasing Of Doubly Linked Lists, String Operations Using Linked Lists.
3. Recursive And Non- Recursive Traversal Of Trees.
Application Of Trees. Implementation Of Binary Search Tree.
4. Graphs. Hash Tables Implementation; Searching, Inserting And Deleting
5. Searching And Sorting Techniques.
Cse 215 Ob ject-Oriented Prog ram ming W it h C ++ Lab. [0 0 3 1]

1. Programs To Illustrate Overloaded Functions.
2. Programs To Illustrate Function Templates.
3. Programs To Illustrate The Definition And Usage Of Classes. This Involves Defining Data Members,
Member Functions, Constructors And Destructors.
4. Programs To Illustrate Operator Overloading Concept.
5. Programs To Illustrate Definition And Use Of Class Templates.
6. Programs To Illustrate Inheritance And Polymorphism.
7. Programs To Illustrate The Use Of Iostream Library.
Mat –Cse 202 Discrete Ma themat ical Structures [3 1 0 4 ]
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.
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.
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.
Graph Theory: Representation Of Graphs, Adjacency And Incidence Matrices, Algorithms: For Finding
Shortest Path. Dijkstraa’s Algorithms.
Group Theory : Cosets, Normal Groups And Subgroups.

Codes And Group Codes.
Textb ooks :
1. C. L. Liu : Elements Of Discrete Mathematics, 1986, Mcgraw Hill.
2. J. P. Tremb aly And R. Mano har: Discrete Mathematics Structures With Application To Computer
Science, Edn., 1987, Mcgraw Hill.
3. E. S. Pag e And L. B. Wilso n : An Introduction To Computational Combinatorics, Edn., 1979,
Cambridge Univ. Press.
4. Na rasi ngh De o : Graph Theory With Applications To Computer Science, Phi, 1987 Edn.
Cse 204 Des ign And Ana lysis O f Algorithms [3 1 0 4]
1. Analysing Algorithms And Problems:- Java As An Algorithmic Language, Analyzing Algorithms And
Problems, Classifying Functions By Their Asymptotic Growth Rates, Searching An Ordered Array. (8
Hrs.)
2. Recursion And Induction:- Recurrence Equations, Recursion Trees. (4 Hrs.)
3. Sorting: Insertion Sort, Divide And Conquer, Quicksort, Merging Sorted Sequences, Mergesort, Lower
Bounds For Sorting, Heapsort, Comparison Of Sorting Algorithms. (8 Hrs.)
4. Selection And Adversary Arguments: Finding Max & Min, Finding The Second Largest Key, The
Selection Problem. (4 Hrs.)
5. Graphs And Graph Traversals: Definition And Representation, Traversing Graphs, Depth-First Search
On Directed Graphs, Depth-First Search On Undirected Graphs, Biconnected Components Of An
Undirected Graph. (10 Hrs.)
6. Graph Optimization Problems And Greedy Algorithms: Prim’s Minimum Spanning Tree Algorithm,
Single-Source Shortest Paths, Kruskal’s Minimum Spanning Tree Algorithm.
(4 Hrs.)
7. Dynamic Programming: Subproblem Graphs And Their Traversal, Multiplying A Sequence Of Matrices,
Constructing Optimal Binary Search Trees. (4 Hrs.)
8. Np-Complete Problems: P And Np, Np-Complete Problems, Approximation Algorithms, Bin Packing ,
The Knapsack And Subset Sum Problems, The Traveling Salesperson Problem.
(8 Hrs.)
Textb ooks :
Sa ra Baas e And Alle n Van Ge lder – Computer Algorithms, Pearson Education Asia Pte. Ltd., 3rd
Edition, 2000.
Re fere nce s:
1. Co rme n, Leise rso n & Rive st – Introduction To Algorithms, Prentice-Hall Of India Pvt. Ltd., 2000.
2. Ho rowi tz, Sah ni & Raj ase kara m – Computer Algorithms, Galgotia Publications Pvt. Ltd., 2000.
3. Ah o, Hopc roft & Ullm an – The Design And Analysis Of Computer Algorithms, Addison Wesley
Longman Singapore Pte. Ltd., 1999.
Cse 206 Database M anagement Sys tems [3 1 0 4 ]
1. In trod ucti on
Database System Applications, Database Systemes Vs File Systems, View Of Data - Data Models,
Database Languages, Dba, Database Users. 1.1, 1.2, 1.3, 1.4, 1.5, 1.6 Of Chapter 1 Of Textbook. (3
Hrs.)
2. Er Mo del
-Basic Concepts, Constraints, Keys, Design Issues, Er Diagrams, Weak Entity Sets, Generalization,
Design And Reduction Of An Er Schema, 2.1, 2.2, 2.3, 2.4, 2.5, 2.6, 2.7, 2.8, 2.9 (6 Hrs.)
Chapter 2 Of Textbook
3. Relational Model – Structure Of Relational Databases, Relational Algebra, Extended Relational –

Algebra Operation, Modification Of The Database Tuple And Domain Relational Calculus, Views. 3.1,
3.2, 3.3, 3.4, 3.5, 3.6, 3.7 (7 Hrs.)
4. Sql - Set Operations, Aggregate Functions, Nested Subqueries, Views, Complex Queries, Modification
Of The Database Joins, Ddl. 4.1, 4.2, 4.3, 4.4, 4.6, 4.7, 4.8, 4.9, 4.10, 4.11
Chapter 4 Of Textbook. (8 Hrs.)
5. In tegr ity An d S ecur ity

Domain Constraints, Referential Integrity, Assertions, Triggers, Functional Dependencies. 6.1, 6.2, 6.3,
6.4 (4 Hrs.)
6. Re lati onal Da tab ase Desi gn

Pitfalls, Functional Dependencies, Decomposition, Desirable Properties Of Decomposition,
Normalization Using Functional Multivalues And Join Dependencies. 7.1, 7.2, 7.3, 7.4, 7.5, 7.6, 7.7, 7.8
(7 Hrs.)
7. St ora ge And File Str uct ures

Overview Of Physical Storage Media, Magnetic Disks, Storage Access, File Organization, Organization
Of Records In Files.
11.1, 11.2, 11.5, 11.6, 11.7, 11.8 Of Chapter 11 (4 Hrs.)
8. In dexi ng And Ha shin g

Basic Concepts, Ordered Indices, B Tree Index Files, Static And Dynamic Hashing, Comparison Of
Ordered Indexing And Hashing, Index Definition In Sql, Multiple Key Access. (6 Hrs.)
Chapter 12 Ot Text Book 12,1, 12.2, 12.4, 12.5, 12.6, 12.7, 12.8, 12.9
9. Pl /Sql
Introduction, Exceptions, Cursors, Triggers, Procedures And Functions Of Reference Book 3
(3 Hrs.)
Textb ook:
1. Sil ber scha tz, Kor th, Sud arsh an, “Database System Concepts”, 4th Edition, Mcgraw Hill.
Re fere nce Bo ok:

1. C. J. Date , “An Introduction To Database Systems”, 7th Edition, Addison Wesley.
2. Ra ghu Ra makri shn an, “Database Management Systems”, Mcgraw Hill Series.
3. Iv an Bayr oss, “Sql,Pl/Sql” 2nd Revised Edition, Bpb Publications.
Cse 208 P.C. Systems [3 1 0 4]

1. In trod ucti on:
Introduction To Microprocessors, Microprocessor-Based System (An Example). Architecture Of 8086.
Segmentation And Memory Addressing In 8086. (6 Hrs.)
2. As sem bly Lan gua ge Prog ram ming – I:
Assembly Language, Assemblers For The Pc, Addressing Modes Of 8086, Data Movement Instructions
Excluding String Instructions, Instruction Encoding, Assembling, Linking And Executing Programs,
Arithmetic And Logical Instructions. (6 Hrs.)
3. As sem bly Lan gua ge Prog ram ming – Ii:
String Instructions, Debugging Programs, Programming Examples, Program Flow Control Instructions.
(6 Hrs.)
4. As sem bly Lan gua ge Prog ram ming – Iii:
Machine Control And Miscellaneous Instructions, Modular Programming -Use Of Linker, Library, Macros
And Procedures. (6 Hrs.)
5. Ha rdwa re Feat ures Of 80 86:
Functional Block Diagram, Ready And Wait State, Min/Max. Modes Of Operation. Timing Diagram And
Latching, Bus Buffering. (6 Hrs.)
For Topics – 1 To 5 Refer Text 1
6. I/ O S ervic es: Bios, Dos. Use Of Bios And Dos Interrupts. (2 Hrs.)
Topic – 6 Refer Text 2
7. Vl si Sup por t Devi ces: Dma Controller 8257, Timer 8253, Ppi 8255, Interrupt Controller 8259, Clock
Generator 8284. Numeric Coprocessor 8087. (12 Hrs.)
Topic –7 Refer Text 4
8. I/ O Co ntr oller s: Keyboard, Fdd, Architecture Of 80286.
Topic – 8 Refer Text 3, Text 4.
Re fere nce Bo oks:

1. Text 1 : Ba rry B. Brey , “The Intel Microprocessors”, Fourth Edition, Prentice Hall India, 1997.
2. Text 2: St eve n Ar mbr ust And Ted Forg ero n, “Programmer’s Manual For Ibm Personal
Computers”. Intel Hand Book, Galgotia Publications (P) Ltd., 1992.
3. Text 3: B. Go vind a Rajul u, “Ibm Pc And -Hardware, Trouble Shooting And Maintenance”, Tata
Mcgraw Hill Publications Limited, 1991.
4. Text 4: Dou glas V. Hall, “Microprocessors And Interfacing Programming And Hardware”, Tata
Mcgraw Hill Publications Ltd.
5. Text 5: Gi bso n.
Cse 210 Event-Driven Programming With Java [3 1 0 4]

1. Ov ervi ew Of J ava
1.1 Object Oriented Programming Byte Code Concept
1.2 A First Simple Program
1.3 Data Types, Variables And Arrays
1.4 Operators For Self Study
1.5 Control Statements
1.6 Classes And Methods
1.7 Inheritance (10 Hrs.)
2. Pa cka ges An d In terf ace
2.1 Packages
2.2 Access Protection
2.3 Importing Packages
2.4 Interface (3 Hrs.)
3. Ex cep tion Ha ndli ng

3.1 Exception Handling Fundamentals
3.2 Exception Types
3.3 Using Try And Catch 3.4
Mutliple Catch Clauses
3.5 Nested Try Statements
3.6 Throw
3.7 Throws
3.8 Finally
3.9 Creating Own Exception Subclass. (3 Hrs.)
4. Mu ltit hrea ded Pr ogra mmi ng
4.1 The Java Thread Model
4.2 Creating Thread
4.3 Creating Multiple Threads
4.4 Synchronization
4.5 Interthread Communication (3 Hrs.)
5. In put /Out put
5.1 The Java I/O Classes And Interface
5.2 File, Standard Streams – System.In, System.Out, System.Err - Their Purpose And Usage.
5.3 The Byte Streams - Input Stream, Output Stream, File Input Stream, File Output Stream,
Buffered Byte-Streams, Print Stream, Random Access File.
5.4 The Byte Streams
5.5 The Character Streams – Reader, Writer, File Reader, File Writer, Buffered Reader, Buffered
Writer, Printwriter.
5.6 Serialization – Use Of Object Input Stream And Object Output Stream. (3 Hrs.)
(Chapter 12 & 17 Only Above Mentioned Classes)
6. Th e Appl et Class
6.1 Appalet Fundamentals
6.2 Applet Basics
6.3 Applet Architecture
6.4 An Applet Skeleton
6.5 Simple Applet Display Methods
6.6 Requesting Repainting
6.7 Passing Parameters To Applets (3 Hrs.)
7. Ev ent Han dlin g
7.1 Two Event Handling Mechanisms
7.2 The Event Delegation Modes
7.3 Event Classes
7.4 Sources Of Events
7.5 Event Listener Interface
7.6 Adapter Classes
7.7 Inner Classes (3 Hrs.)
8. In trod ucti on The Awt : Workin g With Wind ows Gr aph ics, Contr ols , Layo ut Ma nag ers
An d Tex t
8.1 Awt Classes
8.2 Window Fundamentals
8.3 Working With Frame Windows
8.4 Creating A Frame Window In An Applet
8.5 Working With Graphics, Fonts
8.6 Exploring Text And Graphics
8.7 Control Statements
8.8 Labels
8.9 Using Buttons
8.10 Applying Checkboxes
8.11 Choice Controls
8.12 Using Lists
8.13 Understanding Layout Managers
8.14 Menu Bars And Menus
8.15 Dialog Boxes
8.16 File Dialog
8.17 Handling Events By Extending Awt Components (5 Hrs.)
9. Da ta Base s
9.1 Data Bases Introduced
9.2 Jdbc: The Java Database Connectivity
9.3 Jdbc Explored (2 Hrs.)
(Reference Book 2)
10.Ja va Bea ns
10.1 What Is A Java Bean?
10.2 Advantages Of Java Beans
10.3 Application Builder Tools
10.4 The Bean Development Kit
10.5 Jar Files
10.6 Introspection
10.7 Developing A Simple Bean
10.8 Usage Of The Example Beans In Bdk (5 Hrs.)
11.Swin gs
11.1 Japplet
11.2 Icons And Labels
11.3 Text Fields
11.4 Buttons
11.5 Combo Boxes
11.6 Tabbed Panes
11.7 Scroll Panes
11.8 Trees
11.9 Tables (3 Hrs.)
12.Se rvle ts
12.1 Background
12.2 The Life Cycle Of The Servlet
12.3 The Java Servlet Development Kit – Bin, Lib, Examples Directories, Their Purpose And Usage
12.4 The Simple Servlet
12.5 The Servlet Api
12.6 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 ( ).
12.7 Reading Servlets Parameters
12.8 Reading Initialization Parameters, Usage Of Servlet Properties File.
12.9 The Javax.Servlet.Http Package
12.10 Handling Http Requests And Responses
Note: All The Above-Mentioned Topics Are To Be Covered, Mainly From Textbook “Complete
Reference”, Except Where Mentioned.
Textb ook:
Pa tric k Na ugh ton An d He rber t S chil dt, “Complete Reference”, Third Edition, Tmh, New Delhi.
Re fere nce Bo ok:

1. Jo sep h L. W ebe r, “Special Edition Using Java2 Platform”, Phi, New Delhi.
2. Jo e Wig gles wort h, Pa ula Lamb y,“Java Programming – Advanced Topics” For Separate Topics
Like Jdbc, Beans Etc.
3. E. J. Frie dma n –Hill “Java (Read Less, Learn More)”, Hungry Minds/Idg Books India (P) Ltd. For
Java Labs.
Cse 212 Database M anagement Sys tems Lab . [0 1 2 2 ]
1. File Structure And Organization

Hashing, Indexing And B-Trees.
2. Sql .
3. Pl/Sql And Cursors.
4. Triggers, Procedures And Functions.
5. Visual Databases.
Cse 214 Pc Systems Lab . [0 0 3 1 ]
1. Experiments Based On 8086 Microprocessor -Programming 8086. (Various Numeric Exercises)

2. Experiments Using Bios And Dos Services With Pc Using Assembly Language
Cse 216 Java Programm ing Lab. [0 1 2 2]
Program Exercises For The Topics Listed In Cse 210.

These Exercises Have To Be Carried Out Using Java Language
Experiments Should Include But Not Limited To:
1. Problems On Basic Constructs Of Java
2. Problems On Arrays, Inheritance, Packages And Interfaces
3. Problems On Exception Handling
4. Implementation Of Threads, Synchronization, Producer- Consumer Problem
5. Problem On Applets
6. Problems On Event Handling Using Awt Objects
7. Problems On Database Using Jdbc-Odbc
8. Exploring The Bdk, Implementing A Simple Bean
9. Problems On The Swing Classes
10.Problems On Servlets
Cse 301 Theory Of Co mputat ion [3 1 0 4 ]
1. In trod ucti on To The Th eory Of Com utat ion An d Fi nite Au tom ata:
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& 2) (8 Hrs.)
2. Re gul ar L ang uag es, Reg ular Gra mma rs And Pro perti es Of Regu lar Lan gua ges:
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 & 4) (8 Hrs.)
3. Co nte xt-Fr ee La ngu age s An d Simp lific ati on Of Conte xt- Free Gr amm ars And No rmal
Fo rms:
Context-Free Grammars, Parsing And Ambiguity, Context-Free Grammars And Programming
Languages, Methods For Transforming Grammars, Two Important Normal Forms.
4. Pu shd own Au tom ata And Pr oper ties Of Con text -Fre e L ang uag es:
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.
5. Turi ng Mac hine s And Oth er M odel s O f Turin g Ma chi nes:

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.
6. A Hier arch y Of Fo rmal La ngu age s & Aut oma ta And Lim its Of Algo rith mic
Co mpu tati on:
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 & 12) (8 Hrs.)
Textb ook:
1. Peter Linz, An Intoduction To Formal Languages And Automata, 3rd Edition, Narosa Publishing House.
Re fere nce Bo oks:

1. Jo hn C. Marti n, Introduction To Languages And The Theory Of Computation, Second Edition,
Mcgraw Hill.
2. J. E. Hop crof t & J. D. Ull man , Introduction To Automata Theory, Languages And Computation,
Narosa Publishing House.
3. K. L. P. Mishr a & N. Cha ndr ash ekar an , Theory Of Computer Science (Automata, Language And
Computation), Second Edition, Prentice Hall.
Cse 303 Princ iples O f Prog ramm ing Languages [3 1 0 4]
1. In trod ucti on:

1.1 What Is A Programming Language?
1.2 Abstractions In Programming Languages
1.3 Computational Paradigms
1.4 Language Definition
1.5 Language Translation
1.6 Language Design.
(Chapter 1 Sections 1.1-1.6 Textbook 1) (2 Hrs.)
2. La ngu age De sign Pri ncip les:
2.1 History And Design Criteria
2.2 Efficiency
2.3 Regularity
2.4 Further Language Design Principles.
3. Sy nta x:
3.1 Lexical Structure Of Programming Languages
3.2 Context Free Grammars And Bnfs
3.3 Parse Trees And Abstract Syntax Trees
3.4 Ambiguity, Associativity And Precedence
3.5 Ebnfs And Syntax Diagrams
4. Ba sic Sem anti cs:
4.1 Attributes, Binding And Semantic Functions
4.2 Declarations, Blocks And Scope
4.3 The Symbol Table
4.4 Name Resolution And Overloading
4.5 Allocation, Lifetimes And The Environment
4.6 Variables And Constants
4.7 Aliases, Dangling References And Garbage
5. Da ta Types:
5.1 Properties Of Types And Objects
5.2 Elementary Data Types
5.3 Structured Data Types
5.4 Type Definitions
(Chapter 4 Sections 4.1-4.3, Chapter 5 Section 5.3 Textbook 2) (8 Hrs.)
6. Co ntro l:
6.1 Guarded Commands And Conditionals
6.2 Loops And Variations On While
6.3 The Go To Controversy
6.4 Procedures And Parameters
6.5 Procedure Environments, Activations And Allocation
6.6 Exception Handling
7. Ab stra ct Data Type s (A dt):

7.1 The Algebraic Specification Of Adts
7.2 Adt Mechanisms And Modules
7.3 Separate Compilation In C, C++ Namespaces And Java Packages
7.4 Problems With Adt Mechanisms
(Chapter 9 Sections 9.1-9.3, 9.7, 9.8 Textbook 1) (5 Hrs.)
8. Ob ject -Ori ent ed Progr amm ing An d Ja va:

8.1 Java Objects, Classes And Methods
8.2 Inheritance
8.3 Dynamic Binding
8.4 Design Issues In Object Oriented Languages
8.5 Implementation Issues In Object Oriented Languages
8.6 Features Of Java
8.7 Classes Objects And Methods
8.8 Arrays Strings And Vectors
8.9 Inheritance And Interfaces
(Chapter 10 Sections 10.1-10.4, 10.7, 10.8 Textbook 1, Relevant Sections From Reference Book)
(6 Hrs.)
9. Functional Programming:
9.1 Programs As Functions
9.2 Functional Programming In An Imperative Language.
9.3 Scheme: A Dialect Of Lisp
(Chapter 11 Sections 11.1-11.3, 11.7,11.8 Textbook 1) (6 Hrs.)
10. Logic Programming:

10.1 Logic And Logic Programs
10.2 Horn Clauses
10.3 Resolution And Unification
10.4 The Language Prolog
10.5 Problems With Logic Programming
(Chapter 12 Sections 12.1-12.5 Text Book 1) (5 Hrs.)
Textb ooks :
1. Lo ude n Ke nnet h C.: Programming Languages Principles And Practice: Second Edition: Thomson
Brooks/Cole
2. Pr att Terren ce W. And Zelk owit z Marvi n V.: Programming Languages Design And
Implementation: Third Edition: Phi.
Re fere nce :
Ba lag urus wam y: Programming In Java.
Cse 305 Systems Programming [3 1 0 4]

1. Sy ste m So ftw are:
Systems And Applications Software, Types Of Systems Software.
(Chapter 1 Of Textbook 1) (2 Hrs.)
2. La ngu age Pr oces sors :

Language Processing Activities, Fundamentals Of Language Processing.
3. In trod ucti on To Pd p-1 1:

Basic Pdp-11 Architecture.
(Chapter 10 Of Textbook 3). (2 Hrs.)
4. Ad dre ssin g M odes :

Register, Deferred, Auto Increment, Immediate, Autodecrement, Index, Relative Addressing Modes.
5. Ba sic Com man ds:

Data Transfer Operations, Arithmetic Instructions, .Word, Byte Pseudo-Operations.
6. Co mpa re And Bra nch Ins truc tion s:

Test, Compare Instructions, Direct Setting And Clearing Of The Condition Codes.
Branch Instructions, Additional Pseudo Operations, Example Programs.
7. Lo gic al And Shif t Co mma nds :

Logical Instructions, Shift Instructions, Example Programs, Additional Pseudo-Operations.
(Chapter 14 Of Textbook 3) (5 Hrs.) )
8. Su bro utin es:

Stacks, Subroutine Linkage, Parameters, Recursion And External Subroutines.
9. Ma cros An d Condi tio nal Ass embl y:

Macro Processing, Use Of Macros, System Macros, Conditional Assembly.
10.Th e Asse mbly Pro cess :

An Assembler-One And A Half Pass And Two-Pass Assemblers.
11.Link ing An d Lo adi ng:

Loaders, Linkers.
Textb ooks :
1. Systems Software – An Introduction To Language Processors And Operating Systems By Fran k
Ma ddi x And Gar eth Mor gan , Halsted Press, 1989.
2. Systems – Programming And Operating Systems, 2nd Revised Edition By D.M. Dha dher e.
3. The Principles Of Computer Organization By G. Mich ael Sch neid er .
Cse 307 Operat ing Syste ms And Un ix [3 1 0 4 ]

1. In trod ucti on: (3 Hrs.)
1.1 Simple Batch Systems
1.2 Multiprogrammed Batched Systems
1.3 Time Sharing Systems
1.4 Parallel Systems
1.5 Distributed Systems
1.6 Real-Time Systems
(Chapter 1 Of Textbook 1)
2. Pr oces ses : (3 Hrs.)

2.1 Process Concept
2.2 Process Scheduling
2.3 Operation On Processes
2.4 Cooperating Processes
2.5 Threads
2.6 Interprocesses Communication
3. Cp u S che duli ng: (4 Hrs.)
3.1 Basic Concept
3.2 Scheduling Criteria
3.3 Scheduling Algorithms
3.3.1 Fcfs Scheduling
3.3.2 Sjf Scheduling
3.3.3 Priority Scheduling
3.3.4 Round Robin Scheduling
3.3.5 Multiple Processor Scheduling
3.3.6 Real Time Scheduling
3.4 Algorithm Evaluation.
4. Co ncur ren t Pr oces ses : (4 Hrs.)

4.1 The Critical Section Problem
4.2 Synchronization Hardware
4.3 Semaphores
4.4 Classical Problems Of Synchronization
4.5 Critical Regions
4.6 Monitors
5. De ad Lock s: (4 Hrs.)
5.1 System Model
5.2 Dead Lock Characterization
5.3 Methods For Handling Deadlocks
5.4 Dead Lock Prevention
5.5 Dead Lock Avoidance
5.6 Dead Lock Detection
5.7 Recovery From Dead Lock
6. Me mor y Ma nag eme nt: (4 Hrs.)
6.1 Logical Versus Physical Address Space
6.2 Swapping
6.3 Contiguous Allocation
6.4 Paging
6.5 Segmentation
6.6 Segmentation With Paging
(Chapter 8 Of Text Book 1)
7. Virtu al Mem ory: (5 Hrs.)

7.1 Demand Paging
7.2 Performance Of Demand Paging
7.3 Page Replacement
7.4 Page Replacement Algorithms
7.4.1 Fifo Algorithms
7.4.2 Optimal Algorithms
7.4.3 Lru Algorithms
7.4.4 Lru Approximation Algorithms
7.4.5 Lfu Algorithms
7.4.6 Mfu Algorithms
7.5 Allocation Of Frames
7.6 Thrashing
7.7 Other Considerations
7.8 Demand Segmentation
8. Fil e S yste ms: (4 Hrs.)

8.1 File Concept
8.2 Access Methods
8.3 Directory Structure
8.4 Protection
9. Dis k S che duli ng: (4 Hrs.)

9.1 Disk Structure
9.2 Disk Scheduling Algorithms
9.2.1 Fcfs Scheduling
9.2.2 Sstf Scheduling
9.2.3 Scan Scheduling
9.2.4 C-Scan Scheduling
9.2.5 Look Scheduling
9.3 Disk Management
9.4 Swap Space Management
9.5 Disk Reliability
9.6 Stable-Storage Implementation
10.Pe rfor man ce Eval uati on: (3 Hrs.)

10.1 Different Performance Measures
10.2 Various Performance Evaluation Techniques
10.3 Application Of Queuing Theory For Performance
(Chapter 14 Of Reference Book 1)
11.Prot ecti on And Se curit y: (5 Hrs.)

11.1 Goals Of Protection
11.2 Domain Of Protection
11.3 Access Matrix
11.4 Implementation Of Access Matrix
11.5 Revocation Of Access Rights
11.6 Capability - Based Systems
11.7 Language Based Protection
11.8 The Security Problem
11.9 Authentication
11.10 One-Time Passwords
11.11 Program And System Threats
11.12 Threat Monitoring
11.13 Encryption
11.14 Computer Security Classifications.
(Chapter 19 & 20 Of Textbook 1)
12.Th e U nix Oper atin g Syste m: (5 Hrs.)

12.1 Design Principles
12.2 Programming And User Interface
12.3 File System
12.4 Process Management
12.5 Memory Management
12.6 I/O System
12.7 Interprocess Communication
Textb ooks :
1. Sil ber scha rtz & Ga lvin , Operating System Concepts, Addison Wesley Pub., Fifth Edition, 1997.
2. Mc len Mile nko vic, Operating Systems; Concepts And Design, Mcgraw Hill, New York, 1987.
Re fere nce s:
1. H. M. Deita l, “An Introduction To Operating Systems”, Addison Wesley, 1990.
2. Ma uric e J. Ba ch, “Design Of Unix Operating System”, Prentice Hall Of India, 1988.
3. An dre w S. Tann enb aum ,“Operating System: Design & Implementation”, Prentice Hall Of India,
1991.
4. St uart E. Ma dnic k, John J. Don ovan , “Operating Systems” , Mcgraw Hill.
Cse 309 Co mputer Co mmunica tion And Net wor ks [3 1 0 4 ]

1. In trod ucti on To Co mput er Netw orks
Uses Of Computer Networks. Network Hardware. Network Software. Reference Models: Osi And Tcp/Ip
Reference Models. (4 Hrs.)
(Chapter 1 Of Text 1, Except Sections 1.2.4, 1.3.5, 1.3.6, 1.5, 1.6, 1.7 And 1.8)
2. Data Communication And Physical Layer
Data Transmission Basics: Time Domain And Frequency Domain Concepts. Fourier Series And Fourier
Transforms. Signal Bandwidths. Db Notations For Signal Strengths. Analog And Digital Transmission.
Transmission Impairments: Attenuation And Attenuation Distortion. Delay Distortion. Various Forms Of
Noise.
Effect Of Noise On Digital Signals.
Channel Capacity: Nyquist Formula. Shannon’s Theorem. Applications Of These Theorems For
Analysis And Design Verification.
Transmission Media. Data Encoding: Digital Data – Digital Signals, Digital Data – Analog Signals,
Modems And Their Bandwidth Characteristics.
Asynchronous And Synchronous Data Transmission. Error Detecting Techniques.
Multiplexing: Frequency Division Multiplexing, Time Division Multiplexing And Statistical Time Division
Multiplexing.
Data Switching: Circuit Switching, Message Switching And Packet Switching And Their Performance
Comparison. (8 Hrs.)
(Relevant Sections Of Chapters 2, 3 And 4 Of Text 2)
3. Da ta Link Con trol An d D ata Link La yer

Design Issues. Line Configurations. Flow Control. Error Control. Data Link Control Protocols: Stop And
Wait Protocols And Sliding Window Protocols. Line Utilization Characteristics Without And With Error
Control.
(Section 3.1 Of Text 1 And Chapter 5 Of Text 2) (8 Hrs.)
4. Me diu m Acces s S ub- Layer An d Local Ar ea Netw orks

Channel Allocation Problem In Shared Medium Networks. Multiple Access Protocols: Aloha, Slotted
Aloha, Csma, Csma/Cd. Ieee Standards For Lans. High Speed Lans: Fddi, Fast Ethernet.
(Sections 4.1, 4.2.1, 4.2.2, 4.3.1 To 4.3.4, 4.5.1 And 4.5.2 Of Text 1) (8 Hrs.)
5. Network Layer
Design Issues. Routing Algorithms. Congestion Control Algorithms. (8 Hrs.)
(Sections 5.1, 5.2 And 5.3 Of Text 1)
6. Introduction To Internet
Connecting Devices: Repeaters, Bridges, Routers And Gateways. Internet Standards. Internet
Administration. A Brief History Of The Internet. Addressing: Physical, Internet (Ip) And
Ports.
Ip Addressing: Decimal Notation, Classes. Special Addresses. A Sample Internet. Unicast,
Multicast And Broadcast Addresses. Subnetting And Masking.
Delivery And Routing Of Ip Packets. Direct And Indirect Delivery. Routing Methods.
Routing Module And Routing Table Design.
(Sections 3.5, 1.3, 1.4, 1.5, 2.4, 4.1, 4.2, 4.3, 4.5, 5.1, 5.2, 6.2, 6.3, And 6.5 Of Text 3)(8 Hrs.)
7. Transport Layer In Osi Model

The Transport Service. Elements Of Transport Protocols. A Simple Transport Protocol.
(6 Hrs.)
(Sections 6.1, 6.2 And 6.3 Of Text 1)
8. Introduction To Session Layer, Presentation Layer, Application Layer (Only Brief

Explanation, Selected Topics From Chapter 23 Of Text 4).
Textbooks:
1. Tanenbaum A. S., “Computer Networks”, 3rd Edition, Prentice Hall Of India Pvt. Ltd. (Eee),
New Delhi, 1996.
2. Stallings, William, “Data And Computer Communications”, 4th Edition, , Prentice Hall Of
India Pvt. Ltd. (Eee), New Delhi, 1996.
3. Forouzan, Behrouz A.,“Tcp/Ip Protocol Suite”, Tata Mcgraw Hill Publishing Co. Ltd., New
Delhi, 2000.
4. Fourouzan, Behrouz A., “Data Communications And Networking”, 2nd Edition, Tata Mcgraw
Hill Publishing Co. Ltd., New Delhi, 2000.
Cse 31 1 System Prog ram ming Lab . [0 1 2 2 ]
1. Design Of A Text Editor With Following Features:

- File Commands Cursor Movements Commands, Screen Scrolling Commands Deleting And
Inserting Commands
- Undelete Command
- Block And Save Commands
- Find And Replace Commands
- Text Formatting Commands
- Formatting Printed Pages
2. Design Of Assembler And Simulator For Pdp-11 Instruction Set.
Cse 313 Operat ing Syste ms And Un ix Lab. [0 1 2 2 ]
Following Algorithms Have To Be Implemented In The Lab. Under Unix Environment Using Unix System
Calls. Cpu Scheduling, Process Synchronization, Memory Management, Disk Scheduling Etc.
Cse 315 Co mputer Commun icat ion & N etworks Lab. [0 1 2 2 ]
Experiments Covering Client-Side And Server Side Networking.
A. Networking With Java.
1. Simple Client-Side And Server-Side Programming Examples.
2. A Simple Chat System, 3-Tier Database Browser, A Simple Router And Proxy Server.
B. Networking With Linux.

1. A Client For Daytime Service, And Echo Service.
2. A Daytime Server, Echo Server.
3. A Concurrent Echo Server.
4. Multiprotocol Daytime Server.
5. Multiservice Server.
Re fere nce s:
1. Me rlin e & Con rad Hug hes ,1997, “Java Network Programming”, Manning Pub. Co.
2. Do ugl as E. Come r, “Internetworking With Tcp/Ip”, Vol. 3, Phi.
3. W. Ric har d St eve ns, “ Unix Network Programming”, Vol. 1, Addison Wesley.
Cse 302 Sof tware Engineering [3 1 0 4]

1.0 In trod ucti on:
1.1 What Is Software Engineering
1.2 A Systems Approach
1.3 An Engineering Approach
Chapter 1 Of Textbook 1, Sections 1.1 To 1.8. (3 Hrs.)
2.0 Modeling Process Life Cycle:

2.1 Meaning Of Software Process
2.2 Software Life Cycle Models
2.2.1 Waterfall Model
2.2.2 Waterfall With Prototyping
2.2.3 Prototype Model
2.2.4 V Model
2.2.5 Transformational Model
2.2.6 Phased Development Model
2.2.7 Spiral Model
2.3 Process Improvement Models
2.3.1 The Capability Maturity Model (Cmm)
Chapter 2 Of Textbook 1, Sections 2.1, 2.2, Chapter 12 Of Textbook 1, Section 12.5 (8 Hrs.)
3.0 Requirement Analysis:

3.1 Requirement Analysis And Specification
3.2 Structured Analysis Techniques
3.2.1 Data Flow Diagrams
3.2.2 Data Definitions
3.2.3 Process Descriptions
3.3 Structure Of A Requirement Document
3.4 Requirement Validation And Measurement
Chapter 4 Of Textbook 1, Sections 4.1 To 4.3, 4.9 To 4.11, Chapters 7, 8 And 10 Of Textbook 2 For 3.2
(8 Hrs.)
4.0 Software Design And Detailed Design:

4.1 Conceptual And Technical Designs
4.2 Decomposition And Modularity
4.3 Issues In Design Creation
4.4 Characteristics Of Good Design
4.5 Design Evaluation And Validation
4.6 Design Documentation
Chapter 5 Of Textbook 1 Excluding Sections 5.3, 5.6, 5.9, 5.10. (12 Hrs.)
5.0 Coding And Testing

5.1 Coding
5.1.1 Standards For Programming
5.1.2 Guidelines For Programming
5.1.3 Documentation
5.2 Testing
5.2.1 Software Faults And Failures
5.2.2 Testing Issues
5.2.3 Unit Testing
5.2.4 Integration Testing
5.2.5 Test Planning
Chapter 8 Of Textbook 1 Excluding Sections 8.5, 8.7-8.10 (10 Hrs.)
6.0 Planning And Managing Software Project:

6.1 Tracking Progress
6.2 Project Personnel
6.3 Effort Estimation
6.4 Risk Management
6.5 The Project Plan
Chapter 3 Of Textbook 1 Sections 3.1-3.5 (9 Hrs.)
Textb ook 1:
Pf lee ger Lawr enc e Shari: “Software Engineering, Theory And Practice”: 2nd Edition. Pearson
Education Asia (Lpe) 2001.
Textb ook 2:
Ha wrys zkie wycz I. T.: “ Introduction To System Analysis And Design”: 3rd Edition Prentice Hall India
1994.
Hu m 304 Financia l Managemen t [3 1 0 4 ]
In trod ucti on To Fina nci al Man age men t: Objectives Of Financial Management, Evolution Of
Corporate Finance, Responsibilities For Financial Management In The Firm.
So urc es Of Long Term Fina nce: Characteristics Of Equity Capital, Preference Capital, Debenture
Capital & Term Loans. (3 Hrs.)
Time Val ue Of Mone y: Interest, Meaning & Types, Equivalence, Interest Factors For Discrete
Compounding, Nominal And Effective Interest Rates, Problems. (8 Hrs.)
Valu atio n Of S ecuri ties : Concept Of Valuation.

Bo nd Valua tion : Bond Valuation Models, Bond Value Theorems, Yield To Maturity.
Eq uity V alu atio n: Dividend Capitalization Approach, Ratio Approach. (8 Hrs.)
Pri nci ples Of Acc oun tanc y: Meaning: Book Keeping – Single And Double Entry Book Keeping System,
Journal & Ledger, Its Differences. Debit, Credit, Asset, Capital And Liability.
Brief Explanation On Types Of Accounts. Journalizing Rules, Trial Balance, Rules Of Trial Balance,
Problems On Journal, Ledger & Trial Balance. (5 Hrs.)
Fi nanc ial St ate men ts & An alys is: Balance Sheet And Profit And Loss Statement, Meaning And
Contents.
Ra tio Ana lysi s: Financial Ratios Such As Liquidity Ratios, Leverage Ratios, Turnover Ratios, Profitability
Ratios And Valuation Ratios.
Time Series Analysis, Common Size Analysis, Du Pont Analysis , Problems, Drawbacks Of Financial
Statement Analysis. (7 Hrs.)
Fu nds Flo w Analy sis: Total Resources Basis, Working Capital Basis And Cash Basis.(3 Hrs.)
Co st Volu me Prof it Anal ysis An d Le ver age: Cost-Volume Profit Analysis For Single Product And
Multi Product Firms, Problems.
Le ver age: Concept Of Leverage, Operating Leverage Financial Leverage And Total Leverage, Problems,
Ebit-Eps And Indifference Analysis. (7 Hrs.)
Worki ng Capi tal Man age men t: Meaning And Objective Of Working Capital Management, Factors
Influencing Working Capital Requirements, Operating Cycle Approach To Working Capital Management.
(4 Hrs.)
Ca pita l B udg etin g: Introduction, Principles Of Estimation Of Cost And Benefits. Appraisal Criteria Such
As Pay Back Period, Average Rate Of Return, Net Present Value, Benefit Cost Ratio And Internal Rate Of
Return, Problems. (5 Hrs.)
Co st Of Capit al: Meaning, Cost Of Debt Capital, Preference Capital And Equity Capital, Weighted
Average Cost Of Capital, Determination Of Proportions, Problems. (3 Hrs.)
Re fere nce Bo oks:

1. Fundamentals Of Financial Management – Pr asa nna Cha ndr a.
2. Financial Management – I. M. Pa nde y.
3. Financial Management – Su bir Kum ar Bane rjee .
4. Engineering Economy – Le lan d T. Blank An d Anth ony J. Tar qui m.
5. Principles Of Accountancy – B. S. Ram an.
Cse 306 Co mpi ler Construct ion [3 1 0 4]
1. Introduction To Compiling, Compilers, Phases Of A Compiler, Compiler Construction Tools.

Chapter 1 Of Text Book 1. (3 Hrs.)
2. Le xica l Analy sis:

Role Of Lexical Analyser, Input Buffering, Specification And Recognition Of Tokens Of Language For
Specifying Lexical Analysers, Finite Automata, Regular Expression To An Nfa, Design Of A Lexical
Analyser Generator, Optimisation Of Dfa Based Pattern Matchers.
Chapter 3 Of Textbook 1. (7 Hrs.)
3. Sy nta x Analy sis:

Role Of The Parser, Cfg’s, Writing A Grammar, Top Down And Bottom Up Parsing, Operator Prudence
Parsing, Lr Parsers, Ambiguous Grammars, Parser Generators.
4. Sy nta x Dir ect ed Tran slat ion:

Definition, Construction Of Syntax Trees.
Chapter 5.1-5.2 Of Textbook 1. (2 Hrs.)
5. Type Chec kin g:

Type Systems, Specifications Of A Simple Type Checker, Equivalence Of Type Expressions, Type
Conversions.
Chapter 6.1-6.4 Of Textbook 1 (4 Hrs.)
6. Ru n Time En viro nme nt:

Source Language Issues, Storage Organization, Storage Allocation Strategies, Symbol Tables,
Language Facilities For Dynamic Storage Allocation, Dynamic Storage Allocation Techniques.
Chapter 7 Except 7.4 And 7.5 Of Textbook 1 (4 Hrs.)
7. In term edi ate Cod e G ener ati on:

Intermediate Languages, Declarations, Assignment Statements, Boolean Expressions, Case
Statements, Book Patching, Procedure Calls.
8. Co de Gen erat ion:

Code Generator Issues, Target Machine, Run Time Storage Management, Basic Blocks And Flow
Graphs, Next Use Information And Simple Code Generator, Register Allocation And Assignment, The
Dag Representation Of Basic Blocks, Peep Hole Optimisation, Generating Code From Dag’s, Dynamic
Programming Code Generation Algorithm Code Generators.
Chapter 9 Of Textbook 1 (6 Hrs.)
9. Co de Opti miza tio n:

Introduction, The Principle Sources Of Optimisation, Optimisation Of Basic Blocks, Loose In Flow
Graphs.
Chapter 10.1 –10.4 Of Textbook 1. (3 Hrs.)
Textbooks:
1. Compilers Principles, Techniques And Tools By Alfred V. Aho, Ravi Sethi, Jeffrey D. Ulman.
2. Principles Of Compiler Design By Alfred V. Aho And Jeffrey D. Ullman.
Re fere nce Bo oks:

1. Introduction To Compiler Construction By Thomas W. Parsons.
2. Compiler Design In C By Holub A.I.
Cse 306 Co mpi ler Construct ion [3 1 0 4]
1. Introduction To Compiling, Compilers, Phases Of A Compiler, Compiler Construction Tools.

Chapter 1 Of Text Book 1. (3 Hrs.)
2. Le xica l Analy sis:

Role Of Lexical Analyser, Input Buffering, Specification And Recognition Of Tokens Of Language For
Specifying Lexical Analysers, Finite Automata, Regular Expression To An Nfa, Design Of A Lexical
Analyser Generator, Optimisation Of Dfa Based Pattern Matchers.
3. Sy nta x Analy sis:

Role Of The Parser, Cfg’s, Writing A Grammar, Top Down And Bottom Up Parsing, Operator Prudence
Parsing, Lr Parsers, Ambiguous Grammars, Parser Generators.
4. Sy nta x Dir ect ed Tran slat ion:

Definition, Construction Of Syntax Trees.
Chapter 5.1-5.2 Of Textbook 1. (2 Hrs.)
5. Type Chec kin g:

Type Systems, Specifications Of A Simple Type Checker, Equivalence Of Type Expressions, Type
Conversions.
Chapter 6.1-6.4 Of Textbook 1 (4 Hrs.)
6. Ru n Time En viro nme nt:

Source Language Issues, Storage Organization, Storage Allocation Strategies, Symbol Tables,
Language Facilities For Dynamic Storage Allocation, Dynamic Storage Allocation Techniques.
Chapter 7 Except 7.4 And 7.5 Of Textbook 1 (4 Hrs.)
7. In term edi ate Cod e G ener ati on:

Intermediate Languages, Declarations, Assignment Statements, Boolean Expressions, Case
Statements, Book Patching, Procedure Calls.
8. Co de Gen erat ion:

Code Generator Issues, Target Machine, Run Time Storage Management, Basic Blocks And Flow
Graphs, Next Use Information And Simple Code Generator, Register Allocation And Assignment, The
Dag Representation Of Basic Blocks, Peep Hole Optimisation, Generating Code From Dag’s, Dynamic
Programming Code Generation Algorithm Code Generators.
Chapter 9 Of Textbook 1 (6 Hrs.)
9. Co de Opti miza tio n:

Introduction, The Principle Sources Of Optimisation, Optimisation Of Basic Blocks, Loose In Flow
Graphs.
Chapter 10.1 –10.4 Of Textbook 1. (3 Hrs.)
Textbooks:
1. Compilers Principles, Techniques And Tools By Alfred V. Aho, Ravi Sethi, Jeffrey D. Ulman.
2. Principles Of Compiler Design By Alfred V. Aho And Jeffrey D. Ullman.
Re fere nce Bo oks:

1. Introduction To Compiler Construction By Thomas W. Parsons.
2. Compiler Design In C By Holub A.I.
Cse 308 Tcp/ Ip And I nternet Techn olog ies [3 1 0 4 ]
1. In tern et Prot ocol (Ip ) And Rela ted Pro toco ls:
Ip (Version 4) Datagram Structure, Addressing, Fragmentation, Options, Checksum, Ip Design. (Chapter
7 Of Text 1)
Ipv6 Addresses, Packet Format, Transition From Ipv4 To Ipv6.
Arp, Rarp, Icmp (Ch. 8 And 9 Of Text 1) (10 Hrs.)
2. Us er Data gram Pro toc ol (Udp) :

Process To Process Communication, User Datagram, Checksum, Options, Use Of Udp, Udp Design.
3. Tra nsmi ssio n C ontr ol Proto col (T cp ):
4. Ap plic atio ns Of Tcp /Ip:

Client_Server Model, Dns, Telnet, Ftp, Tftp, Smtp, Snmp, Http.
(Chapter 14,16,17,18,19,20,21,22 Of Text 1) (10 Hrs.)
5. Ov ervi ew Of Ht ml 4.0:
Use Of Various Html Tags, Links, Tables, Frames, Forms, Image Maps.
(Text 2) (2 Hrs.)
6. Ja va Scrip t:
Java Script Objects And Language Reference.
(Part Iii Of Text 3) (9 Hrs.)
7. Ac tive Ser ver Pag es (Asp ):

Server Side Objects, Client Connection, Database Access
(Chapter 5,6,7 Of Text 4) (8 Hrs.)
8. Xm l
Introduction To Xml, Dtds, Introduction To Css.
(Text 5) (5 Hrs.)
Textb ooks :
1. Fo rouz an Beh rouz A. , Tcp/Ip Protocol Suite, Tata Mcgraw Hill Publishing Co. Ltd., New Delhi, 2000.
2. Eri c L add An d Ji m O’ don nell , Et Al, Using Html 4, Xml, And Java 1.2, Phi 2000.
3. Do nna y G ood man, Java Script Bible, 3rd Edition, Idg Books India, 2000.
4. Ai Will iams , Ki m Barb er , Et Al, Active Server Pages Solutions, Idg Books India, 2000.
5. Ell iott e Rusty Har old, Xml In A Nutshel, 1st Edition, O’reilly, Spd, 2001.
Cse 310 Co mputer Graphics [3 1 0 4 ]

1. Dis pla y De vice s:
1.1 Line & Point Plotting Systems
1.2 Raster
1.3 Vector
1.4 Pixel And Point Plotters
1.5 Continual Refresh And Storage Displays
1.6 Digital Frame Buffer
1.7 Plasma Panel Displays
1.8 Character Generators
1.9 Color Display Techniques (4 Hrs.)
Main Reference: Chapters 2 & 3 Of Textbook 1
Auxiliary Reference: Chapters 1 & 2 Of Textbook 2 .
2. In tera ctiv e Gr aph ics:

2.1 Pointing And Positioning Devices
2.2 Cursor
2.3 Light Pen
2.4 Tablet
2.5 Mouse
2.6 Joystick
2.7 Track Ball
2.8 Digitizer
2.9 Interactive Graphical Techniques
2.9.1 Positioning
2.9.2 Zooming
2.9.3 Rubber-Band Techniques
2.9.4 Sketching Dragging (6 Hrs.)
Main Reference: Chapters 2,3 & 8 Of Textbook 1
Auxiliary Reference: Chapters 11,12,14, 19 Of Textbook 2.
3. 2- D Gr aphi cs:
3.1 Line Drawing Techniques
3.2 Fast Drawing Circles And Ellipes Algorithms
3.3 Transformations
3.4 Polygon Filling (10 Hrs.)
Main Reference: Chapters 3 & 5 Of Textbook 1 And Chapters 2.5 Of Textbook 2.
4. Wi ndo wing & Clipp ing :

4.1 Windowing Concepts
4.2 Clipping Algorithms
4.3 Line Clipping (Cohen – Sutherland And Liang – Barsky)
4.4 Area Clipping
4.5 Text Clipping
4.6 Exterior Clipping
4.7 Window To View Port Transformations (4 Hrs.)
Main Reference: Chapter 6 Of Textbook 1
5. 3- D Gr aphi cs:
5.1 Transformations
5.2 Perspective And Parallel Projections (6 Hrs.)
Main Reference: Chapter 11 And 12.1 To12.4 Of Textbook 1
6. Hi dde n Li ne Remo val Alg orit hms:

6.1 Depth Buffer Algorithm
6.2 Scan Line Coherence Algorithm
6.3 Area Coherence Algorithm
6.4 Back Face Algorithm (4 Hrs.)
Main Reference: Chapter 13.1 To 13.6 Of Textbook 1
Auxiliary Reference: Chapter 24 Of Textbook 2.
7. Cu rves An d S urfa ces:
7.1 Shape Description And Requirements
7.2 Bezier Methods
7.3 B-Spline Methods (4 Hrs.)
Main Reference: Chapter 21 Of Textbook 2
Auxiliary Reference: Chapter 10 Of Textbook 1
8. Gr aphi cs Woth Open gl:

Introduction; Working And Terminology, Primitives Transformations Structures. (6 Hrs.)
Main Reference: Chapter 1, 2, 3, 4, 5 Of Textbook 3.
Textb ook:
1. Do nal d Hear n And Paul ine Bake r, “Computer Graphics”, Prentice Hall Of India, 1996, Second
Edition.
2. Ne wma n And Sp roul l, “Principles Of Interactive Computer Graphics” , Mcgraw Hill International
Edition, 2nd Edition.
3. Ro n F osne r, – “Opengl Programming For Windows Nt” Addison-Wesley.
Re fere nce Bo ok:

“Schaum’s Outline Of Theory And Problems Of Computer Graphics” – Ro y A . Pl asto ck And Gar don
Ka lley - 2nd Printing 1987, 1988 , Mcgraw Hill.
“Procedural Elements For Computer Graphics” Davi d F . Ro gers , Mcgraw Hill International Edition.
“Computer Graphics, Principles And Practice” – Fo ley Van dam , Fein er Hu ghes – 2ndEdition, In C,
1996.
“Device – Independent Graphics” – Robert F. Sp roul l/W .R. Su the rlan d/Mi cha el Kul lne r, Mcgraw
Hill.
“Computer Graphics – A Programming Approach” – 2nd Edition - St eve n Ha rrin gto n.
Cse 312 Co mpi ler Lab. [0 1 2 2 ]
To Im plem ent A Com piler For A Sub set Of C La ngu age :

• C Language Constructs May Include Datatypes – Int And Char, Int Arrays, Assignment Statements
Loops – If And For Loops And Functions.
• Target Machine Language - 80 X 86 Based .
1. Defining The Structure Of A Language Using Bnf Notation.
2. Building Of Lexical Analyser And Symbol Table Construction.
3. Parsing And Error Handling Using Any Suitable Parsing Method.
4. Code Generation In The Target Machine Language.
Usage Of Compiler Utility Tools – Lex And Yacc Of Unix.

1. Running A Simple Scanner Using Lex.
2. Usage Of Yacc Utility And Yacc Grammar.
Textb ooks :
1. All en I. Holu b, Compiler Design In C, Phi Edition.
2. Ch arle s N. Fis cher And Rich ard J. Leb lanc , Crafting A Compiler With C.
Cse 314 Internet Technology Lab . [0 1 2 2 ]
Program Exercises For The Topics Listed In Cse-308. Experiments Should Include But Not Limited To:
1. Development Of Html Pages Covering The Various Features.
2. Developing Html Pages With Tables, Frames And Static Forms.
3. Use Of Style Sheets For Html Pages.
4. Simple Asp Pages For Server Side Programming.

5. Creating Asp Pages Using Vb Scripts.
6. Creating Asp Pages Using Java Scripts.
7. Creating Dynamic Web Pages Using Perl Under Cgi.
8. Mini Project For Developing Web Site For A Given Requirement
Cse 316 Compu ter Graphics Lab. [0 1 2 2]
1. Implementation Of Following Algorithms:

- Lines, Circles, Ellipses
- Polygon Filling
- Line And Polygon Clipping
2. Exercises On 2d Transformations.
3. Drawing Of Bezier And B Spline Curves.
4. Implementation Of Simple 3d Transformations.
Cse 401 Distribu ted Systems [3 1 1 4 ]

1. Ch arac teri zati on Of Distri but ed Syst ems:
1.1 Introduction To Distributed Systems
1.2 Examples Of Distributed Systems
1.3 Resource Sharing And The Web
2. Sy ste m Mo del s:
2.1 Architectural Models
2.3 Fundamental Models
3. In terp roc ess Com muni cati on:

3.1 Api For Internet Protocol
3.2 External Data Representation And Marshalling
3.3 Client Server Communication
3.4 Group Communication
3.5 Case Study: Ipc In Unix
4. Dis trib ute d O bjec ts And Rem ote Inv ocat ion :
4.1 Communication Between Distributed Objects
4.2 Remote Procedure Call
4.3 Events And Notifications
4.4 Case Study: Java Rmi
5. Op era ting Sys tem Su ppor t:

5.1 The Operating System Layer
5.2 Protection
5.3 Processes And Threads
5.4 Communication And Invocation
5.5 Operating System Architecture
6. Se curi ty And Nam e S ervic es:

6.1 Overview Of Security Techniques.
6.2 Naming
6.2.1 Name Services And The Dns
6.2.2 Directory And Discovery Services
6.2.3 Case Study: Global Name Service
(Chapter 7 Of Textbook 1, Sections 7.1, 7.2, Chapter 9 Of Textbook 1 Sections 9.1 To 9.4 )
(6 Hrs.)
7. Dis trib ute d Fil e Syste ms:

7.1 File Service Architecture
7.2 Case Study: Network File System
(Chapter 8 Of Textbook 1, Sections 8.1 To 8.3) (4 Hrs.)
8. Tra nsac tio ns And Con curr ency Co ntrol :

8.1 Transactions And Nested Transactions
8.2 Locks
8.3 Optimistic Concurrency Control
8.4 Timestamp Ordering
9. Dis trib ute d Da tab ase s:

Overview
Levels Of Distributions Transparency
(Chapter 1, 2 And 3 Of Textbook 3) (4 Hrs.)
10.Dis trib ute d Trans acti ons :

Management Of Distributed Transactions
Concurrency Control
(Chapter 7 And 8 Of Textbook 3) (6 Hrs.)
Textb ook :
1. Co ulo uris Georg e, Dol limo re Je an, Ki ndb erg Tim: “Distributed Systems, Concepts And
Design”: Pearson Education Asia (Lpe), 3’rd Edition 2001.
2. Si nha Prad eep K.: “ Distributed Operating Systems, Concepts And Design”: Prentice Hall India:
(Eastern Economy Edition) 1997
3. St efa no Ceri Gius epp e Pela gatt i: “Distributed Databases: Principles And Systems”, Mcgraw Hill
1985.
Cse 403.1 Image Processing (Elec tive) [4 0 0 4 ]
1. Introduction To Image Processing.

Digital Image Representation
Fundamental Steps In Image Processing
Elements Of Digital Image Processing Systems
Elements Of Visual Perception
Simple Image Model
Sampling And Quantization
Some Basic Relationships Between Pixels
Imaging Geometry
Photographic Film (6 Hrs.)
2. Image Transforms
Introduction To Fourier Transform
Discrete Fourier Transform
Properties Of 2d Fourier Transform
Fast Fourier Transform
Other Separable Image Transforms
-Cosine, Sine, Hadamard, Haar, Slant, Hotelling Transforms. (6 Hrs.)
3. Image Enhancement
Spatial And Frequency Domain Methods
Enhancement By Point Processing
Spatial Filtering
Enhancement In Frequency Domain
Color Models And Pseudo Color Image Processing (6 Hrs.)
4. Image Restoration
Degradation Model
Algebraic Approach To Restoration (4 Hrs.)
5. Image Compression
Fundamentals
Image Compression Models
Error Free Compression
Lossy Compression
Image Compression Standards (8 Hrs.)
6. Image Segmentation
Detection Of Discontinuities
Edge Linking And Boundary Detection
Thresholding
Region Oriented Segmentation
Use Of Motion In Segmentation (6 Hrs.)
7. Representation And Description

Representation Schemes
Boundary Descriptors
8. Regional Descriptors
Morphology
Relational Descriptors (8 Hrs.)
9. Recognition And Interpretation

Elements Of Image Analysis
Patterns And Pattern Classes
Decision Theoretic Methods-Matching, Optimum Statistical Classifiers (4 Hrs.)
Textb ook:
Ra fel C. Gonz alez An d Richa rd E.W ood s, “Digital Image Processing”, Addison Wesley.
Re fere nce Bo ok:

An il K. Ja in, Fundamentals Of Digital Image Processing, Phi.
Cse 403.2 Art if icia l I nte ll igence (Elect ive ) [4 0 0 4 ]

1. In trod ucti on :
1.1 A Definition
1.2 The Underlying Assumption
1.3 Ai Model
1.4 Applications Of Ai
(Chapter 1 (1.1 To 1.3) Of Text 1)
(Chapter 1 Of R3) – 2 Hrs.)
2. Pr oble ms And Pro ble m S pace s:

2.1 Defining The Problem
2.2 Problem Characteristics
2.3 Production Systems Characteristics
(Chapter 2 (2.1 To 2.3) Of Text 1) (2 Hrs.)
3. Pr oble m-S olvi ng Meth ods :

3.1 Forward Versus Backward Reasoning
3.2 Problem Trees Versus Problem Graphs
3.3 Matching
3.4 Heuristic Functions
3.5 Weak Methods
(Chapter 3 (3.1, 3.2, 3.4 To 3.6) Of Text 1) (4 Hrs.)
4. Ga me Play ing :
4.1 Minimax Search Procedure
4.2 Adding Alpha-Beta Cutoffs
(Chapter 4 (4.2,4.3) Of Text 1) (3 Hrs.)
5. Kn owl edg e Re pres ent atio n:

5.1 Introduction To Representation
5.2 Representing Simple Facts In Logic
5.3 Augmenting The Representation
5.4 Resolution Refutation – Various Strategies.
(Chapter 5 (5.1 To 5.4) Of Text 1) (8 Hrs.)
Other Models: Scripts, Frames, Semantic Networks,
Associative Networks And Conceptual Dependency.
(Text Book 1)
6. Kn owl edg e Re pres ent atio n Using Ot her Logi cs:
6.1 Introduction
6.2 Monotonic Reasoning And Nonmonotonic Reasoning
6.3 Default, Statistical And Probabilistic Reasoning
(Chapter 6 (6.1 To 6.3 (6.3.1) Of Text 1) (6 Hrs.)
7. St ruct ure d Re pres ent atio n Of K nowl edg e:

7.1 Introduction
7.2 Declarative Representations
(Chapter 7 (7.1, 7.2 (7.2.1 To 7.2.4) Of Text 1) (5 Hrs.)
8. Ad van ced Pro ble m-So lvin g Sy ste ms:

8.1 Planning
8.2 System Organization
8.3 Introduction To Natural Language Understanding
8.4 Understanding Single Sentences
8.5 Understanding Multiple Sentences
8.6 Why Is Perception Hard?
8.7 Techniques Used In Solving Perceptual Problems
8.8 Constraint Satisfaction -The Waltz Algorithm
8.9 Rote Learning
8.10 Learning By Parameter Adjustment
8.11 Concept Learning
(Chapter 8 (8.1, 8.2 (8.2.1 To 8.2.3)), Chapter 9 (9.1 To 9.3), Chapter 10 (10.1 To 10.3), Chapter 11
(11.3, 11.4, 11.6) Of Text 1) (10 Hrs.)
9. Ex pert Sy stem s
Components Of An Expert System And Database System. Inference Engine, Search Engine,
Knowledgebase And Database, User Interface. Forward Backward Chaining Mechanisms.
(Text Book 1) (4 Hrs.)
10.Le arni ng:

Introduction To Learning, Learning Mechanisms, Neural Net Learning And Genetic Learning.
(2 Hrs.)
11.Perc epti on And Ac tion :

Real Time Search, Perception, Action, Robot Architectures. (2 Hrs.)
Text Book s:
1. Elaine Rich, - Artificial Intelligence, Mcgraw Hill.
Re fere nce s:
Don W. Patterson, Introduction To Artificial Intelligence And Expert Systems.
Hayes Roth, - Building Expert Systems - Addison Wesley, 1983.
Nils J. Nilsson - Principles Of Artificial Intelligence - Springer Verlag.
Richard Forsyth, Chapman And Hall Computing, - Expert System - Principles And Case Studies.
Patrick Henry Winston, - Artificial Intelligence, Addison Wesley, 1984.
Elaine Rich, Kevin Knight, Artificial Intelligence, Tata Mcgraw Hill Edition, Chapter 17, Chapter 21.
Cse 403.3 Advanced Da tabase System Concepts [4 0 0 4 ]

1. Query Processing
Overview, Measures Of Query Cost, Selection Operation, Sorting Join
Operation, Other Operations, Evaluation Of Expressions
[Chapter 13 Of The Text Book] (5 Hrs.)
2. Query Optimization
Overview, Estimating Statistics Of Expression Results, Transformation Of
Relational Expressions, Choice Of Evaluation Plans
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.
8. Distributed Databases
Distributed Data Storage, Distributed Transactions, Commit Protocols,
Concurrency Control, Availability, Query Processing.
9. Advanced Querying And Information Retrieval
Decision-Support Systems, Data Analysis And Olap, Data Mining,
Data Warehousing, Information-Retrieval Systems
10.Application Development And Administration

Web Interfaces To Databases, Performance Evaluation
[Chapter 21, Sections 21.1 And 21.2 Of The Text Book] (2 Hrs.)
11.Advanced Data Type And New Applications
Time In Databases, Spatial And Geographic
Data, Multimedia Databases, Mobility And Personal Databases, Genome
Databases
[Chapter 21, Section 21.1 And Chapter 22 Of The Text Book] (4 Hrs.)
Text Book :
Silberschatz, Korth And Sudarshan, “Database System Concepts”, 4th Edition, Mcgrawhill.
Re fere nce s:
1. Elmasri And Navathe, “Fundamentals Of Database Systems”, 3rd Edition, Addison-Wesley
2. C.J.Date, “An Introduction To Database Systems”, 7th Edition, Pearson Education Asia.
3. Willian G. Page, Jr., “Using Oracle 8/8i, 1999,Phi
Cse 403.4 Des ign O f Ob ject Oriented Syste ms W it h U ml

(Elec tive) [4 0 0 4 ]
1. An Overview Of Object-Oriented Systems Development

1.1 Introduction
1.2 Two Orthogonal Views Of The Software
1.3 Object-Oriented Systems Development Methodology
1.4 Why An Object Orientation?
1.5 Overview Of The Unified Approach (5 Hrs.)
2. Object Basics
2.1 Introduction
2.2 An Object-Oriented Philosophy
2.3 Objects
2.4 Objects Are Grouped In Classes
2.5 Attributes: Object State And Properties
2.6 Object Behaviour And Methods
2.7 Objects Respond To Messages
2.8 Encapsulation And Information Hiding.
2.9 Class Hierarchy
2.10 Polymorphism
2.11 Object Relationships And Associations
2.12 Aggregations And Object Containment
2.13 Case Study: A Payroll Program (7 Hrs.)
3. Object-Oriented Systems Development Life Cycle

3.1 Introduction
3.2 The Software Development Process
3.3 Building High-Quality Software
3.4 Object-Oriented Systems Development: A Use Case Driven Approach.
3.5 Reusability ( 4 Hrs.)
4. Ob ject Ori ent ed Meth odo logi es:

4.1 Introduction: Toward Unification – Too Many Methodologies
4.2 Survey Of Some Of The Object-Oriented Methodologies
4.3 Rumbaugh Et Al.’S Object Modelling Techniques
4.4 The Booch Methodology
4.5 The Jacobson Et Al. Methodologies
4.6 Patterns
4.7 Frameworks
4.8 The Unified Approach (6 Hrs.)
5. Un ifie d M odel ing Lan gua ge

5.1 Introduction
5.2 Static And Dynamic Models
5.3 Why Modeling?
5.4 Introduction To The Unified Modelling Language
5.5 Uml Diagrams
5.6 Uml Class Diagram
5.7 Use-Case Diagram
5.8 Uml Dynamic Modeling
5.9 Model Management : Packages And Model Organization
5.10 Uml Extensibility
5.11 Uml Meta-Model (6 Hrs.)
6. Object-Oriented Analysis Process: Identifying Use Cases:

6.1 Introduction
6.2 Why Analysis Is A Difficult Activity
6.3 Business Object Analysis: Understanding The Business Layer
6.4 Use-Case Driven Object-Oriented Analysis: The Unified Approach.
6.5 Business Process Modeling
6.6 Use-Case Model.
6.7 Developing Effective Documentation
6.8 Case Study: Analyzing The Vianet Bank Atm- The Use-Case Driven Process (4 Hrs.)
7. Object Analysis: Classification

7.1 Introduction
7.2 Classification Theory
7.3 Approaches For Identifying Classes
7.4 Noun Phrase Approach
7.5 Common Class Pattern Approach
7.6 Use-Case Driven Approach Identifying Classes And Their Behaviours Through Sequential
Collaboration Modelling
7.7 Classes, Responsibilities And Collaborators
7.8 Naming Classes (5 Hrs.)
8. Identifying Object Relationships, Attributes And Methods.

8.1 Introduction
8.2 Associations
8.3 Super-Sub Class Relationships
8.4 A Part Of Relationships Aggregation
8.5 Case Study: Relationship Analysis For The Vianet Bank Atm System
8.6 Class Responsibility: Identifying Attributes And Methods
8.7 Class Responsibility: Defining Attributed By Analysing Use Cases And Other Uml Diagrams
8.8 Defining Attributes For Vianet Bank Objects
8.9 Object Responsibility: Methods And Messages
8.10 Defining Methods For Vianet Bank Objects (6 Hrs.)
9. The Object-Oriented Design Process And Design Axioms

9.1 Introduction
9.2 The Object-Oriented Design Process
9.3 Object-Oriented Design Axioms
9.4 Corollaries
9.5 Design Patterns (5 Hrs.)
Text Book s:
1. Ali Bahrami, “Object Oriented Systems Development Using The Unified Modelling Language, Mcgraw
Hill International Edition.
Re fere nce Bo oks:

1. Perdita Stevens With Rob Pooley, Using Uml Software Engineering With Objects And Components,
Pearson Education Asia.
2. Graig Larman, “Applying Uml And Patterns”, The Addison-Wesley Object Technology Series, 2002.
3. Grady Booch, “Object Oriented Analysis And Design”, Addison-Wesley 2nd Edition.
4. Herbert Schildt, “Java”: The Complete Reference”, 3rd Edition, Osborne Mcgraw Hill.
5. Kayshav Dattatri “C++: Effective Object Oriented Software Construction”., Prentice Hall 1997.
6. Herbert Schildt, “C++: The Complete Reference”, 2nd Edition, Osborne Mcgraw Hill.
7. David S. Krunglinski “Inside Vc++”, Microsoft Press.
Ma t 402 Operat ions Research [4 0 0 4]
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:
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
Cse 405.1 Cad For V lsi (E lective) [4 0 0 4 ]
1. In trod ucti on To De sig n Auto mati on Of Digit al Syst ems:
Levels Of Abstraction, Y-Chart, System Synthesis, Design Styles And Technologies, Issues In System
Synthesis. (2 Hrs.)
2. In tegr ate d Syst em Fabri cati on:

Semiconductor Device Fabrication Techniques, Basic Cmos Transistors, Cmos Basic Logicgates,
Memory Elements, Stick Diagrams. (4 Hrs.)
(Chapter 1 Of Text 4, Selected Topics Of Text 6)
3. Ha rdwa re Mod ellin g:

Introduction To High Level Synthesis And Hardware Description Language. (Hdl)
Hardware Description And Design Using Vhdl: (10 Hrs.)
(Selected Topics From Text 3)
4. Ar chit ectu re Leve l Sy nth esis :

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. (8 Hrs.)
(Selected Topics From Text 2 And Text 1)
5. Re sour ce Shar ing An d Bi ndi ng:

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. (5
Hrs.)
(Selected Topics From Text 2)
6. Pa rtiti oni ng:

Basic Partitioning Methods: Random Selection, Cluster Growth, Min Cut Partitioning, Simulated
Annealing. (5 Hrs.)
7. Di gital Sy stem s D esig n Us ing Pro gram mab le Logi c De vice s:

Introduction To Plds, Field Programmable Gate Arrays, Classification Of Fpgas, Technology Mapping For
Fpgas, Some Case Studies. (4 Hrs.)
(Selected Topics From From Text 6)
8. Lo gic Sy nth esis:

Two Level Logic Synthesis And Optimization, Pla Reduction And Folding. Multilevel Logic Synthesis
And Optimization: Algorithms, Implementation, Algebraic Decomposition, Kernel Determination,
Algebraic And Boolean Resubstitution, Tree Mapping By Shannons Theorem, Binary Decision Diagrams
And Directed Acyclic Graphs, If Then Else Operators. (7 Hrs.)
(Selected Topics From Text 6 )
9. Si mula tio n & Testin g:

Introduction To High Level Simulation, Logic Simulation, Circuit Simulation, Silicon Compilation.
Introduction To Testing, Test Pattern Generation, Fault Models, Test Generation Methodology.
(Selected Topics From Text 4) (5 Hrs.)
Textb ooks :
1. De niel D. Gajsk i, Niki l D. Dut t, All en C- H Wu And St eve Y- L Lin. - High Level Synthesis –
Introduction To Chip And System Design.
2. Gi voa nni De Mich eli - Synthesis And Optimization Of Digital Circuits.
3. All en M. Dewe y - Analysis And Design Of Digital Systems With Vhdl.
4. Ne il W es te And Kamr an Es h Ra ghi an - Second Edn Cmos Vlsi Design – System’s Perspective.
5. An dre w Brown - Vlsi Cicuits & Systems In Silicon.
6. Eu gen e D. Fa brici us - Introduction To Vlsi Design.
Re fere nce s:
1. C. Me ad And L. Co nway -Introduction To Vlsi System.
2. Z. Na vabi – Vhdl.
3. N. Sh erwa ni – Algorithms For Physical Design Automation.
Cse 405.2 Neural Ne tworks And Fuzzy Systems

(Elec tive) [4 0 0 4 ]
In trod ucti on To Ne ural Net work s:
1.1 Introduction
1.2 Biological Neural Networks
1.3 Conventional Computers Versus Neural Computers
1.4 Neuron Model And Activation Functions
1.5 Network Architectures (5 Hrs.)
(Text Book 1)
Le arni ng Proc ess es:

2.1 Introduction
2.2 Error-Correction Learning
2.3 Memory-Based Learning
2.4 Hebbian Learning
2.5 Competitive Learning
2.6 Boltzmann Learning
2.7 Learning With And Without A Teacher
2.8 Learning Tasks. (4 Hrs.)
(Text Book 1)
Si ngle An d Multi- Lay er Perc eptr ons:

3.1 Perceptron Model
3.2 Perceptron Convergence Theorem
3.3 Limitation Of Perceptron Model
3.4 Multilayer Perceptron Model
3.5 Xor Problem
3.6 Back-Propagation Algorithm
3.7 Generalization
3.8 Virtues And Limitations Of Back-Propagation Learning. (6 Hrs.)
(Text Book 1)
Re curr ent Neu ral Netw orks :

4.1 Introduction
4.2 Layer Level Feedback
4.3 Non-Linear Autoregressive Exogeneous Network
4.4 Simple Recurrent Network
4.5 Second Order Recurrent Network
4.6 Learning Algorithm
4.7 Neuronal Level Feedback Architecture
4.8 Hop Field Network
4.9 Bidirectional Associative Memory (10 Hrs.)
(Text Book 2)
Se lf- Orga nizin g Maps :

5.1 Two-Basic Feature Mapping Models
5.2 Self-Organizing Map
5.3 Learning Algorithm
5.4 Properties Of The Feature Map
5.5 Learning Vector Quantization (5 Hrs.)
(Text Book 1)
In trod ucti on To Fuz zy Syst ems:

6.1 Partial Truth And Fuzziness
6.2 Fuzzy Systems At Work
6.3 Fuzzy Systems As Inference Engines And Function Approximators
6.4 Classical Logic Versus Fuzzy Logic (3 Hrs.)
(Text Book 3)
Fu zzy Set s:
7.1 Crisp Versus Fuzzy Sets
7.2 Properties And Operations
7.3 Fuzzification Techniques
7.4 Membership Functions
7.5 Fuzzy Rule Generation
7.6 The Basic Fuzzy Inference Algorithm. (8 Hrs.)
(Text Book 3)
Ap plic atio ns:
8.1 Neural Networks Versus Fuzzy Systems
8.2 Fuzzy-Neuron Control
8.3 Applications Of Neural Networks
8.4 Fuzzy System Applications
8.5 Neuro-Fuzzy Applications (6 Hrs.)
(Text Book 3)
Text Book :
1. Simon Haykin, Neural Networks: A Comprehensive Foundation, 2nd Edition (L.P.E.), Pearson Education,
Inc.
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.
Re fere nce s:
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.
Cse 405.3 Da ta W areho use And Da ta M ining [4 0 0 4]

1. Da ta Wareh ous ing:
Introduction, Definition, Multidimensional Data Model, Olap Operations, Warehouse Schema, Server,
Architecture, Metadata, Olap Engine, Backend Process, Other Features. (4 Hrs.)
2. Da ta Mini ng:
Introduction, Definition, Kddvs.Dm, Dbms Vs Dm, Dm Techniques, Issues And Challenges In Dm, Dm
Applications. (5 Hrs.)
3. As soci atio n Rules :

Introduciton, Definition, A Priori Algorithm For Finding Frequent Item Sets, Generating Association Rules
From Frequent Item Sets, Partition, Pincer-Search, Incremental, Border, Fp-Tree Growth Algorithms,
Generalized Association Rules, Constraint Based Association Rules. (12 Hrs.)
4. Cl assif icat ion An d Pr edic tio n:

Introduction, Definition, Bayesian Classification, Two Class And Generalized Class Classification,
Classification Error, Decision Boundary, Discriminant Functions, Non-Parametric Methods For
Classification. (9 Hrs.)
5. Cl uste r Analy sis:

Introduction, Definition, Types Of Data In Cluster Analysis, Categorization Of Major Clustering Methods,
Partitioning Methods, Hierarchical Methods. (7 Hrs.)
6. De cisi on Tree s:
Tree Construction Principle, Decision Tree Construction Algorithms With Presorting Pruning Technique.
(5 Hrs.)
7. Ot her Techn iqu es:
Introduction, Learning, Neural Networks, Data Mining Using Neural Networks, Genetic Algorithms,
Rough Sets. (3 Hrs.)
8. Web Mini ng:

Introduction, Web Mining, Web Content Mining, Web Structure Mining, Web Usage Mining, Text Mining.
(3 Hrs.)
Text Book s:
1. Jiawei Han, Michaline Kamber, “Data Mining – Concepts And Techniques”.
2. Arun K. Pujari, “Data Mining Techniques”.
Re fere nce s:
1. Richard O. Duda, Peter E. Hart, “Pattern Recognition And Scene Analysis”.
2. Alex Berson, Stephen J. Smith, “Data Warehousing, Data Mining And Olap.
Cse 405.4 Mul ti media Appl icat ions [4 0 0 4]
1. Ov ervi ew:
Uses Of Multimedia; Convergence Of Computers, Communications And Entertainment Products;
Distributed Multimedia Systems. (5 Hrs.)
2. Di gital Au dio Rep res enta tio n And Proc essi ng:
Psychoacoustics; Representation, Transmission And Processing Of Digital Audio Signals; Digital Music
Making; Speech Recognition And Generation. ( 6 Hrs.)
3. Vide o Tec hnol ogy :

Scanners; Tv Cameras; Colour And Video, Tv Standards. (5 Hrs.)
4. Di gital V ide o And Imag e Compr essi on:

Evaluating A Compression System; Compression Techniques; Jpeg And Mpeg Standards, Wavelet
Techniques. (14 Hrs.)
5. Time Base d M edia Re pres ent atio n And Deliv ery:

Models Of Time; Time And Multimedia Requirements; Support For System Timing Enforcement –
Delivery. (5 Hrs.)
6. Mu ltim edi a In form ati on Syst ems:

Operating System Requirements; Multimedia Devices, Presentation Tools, User Interface; Multimedia
File Systems And Information Models, Multimedia Presentation And Authoring.
(10 Hrs.)
7. Mu ltim edi a Co mmu nica tio ns:

Requirements, Architecture, Protocols. (2 Hrs.)
8. Mu ltim edi a Co nfer enc ing:

Systems And Architectures. (4 Hrs.)
Text Book :
1. J.F.K. Bulford, Multimedia Systems , Addison Wesley Publication Co., 1994.
Re fere nce s:
1. Tay Vaughan, Multimedia Making It Work (5th Edition), Tmh Edition, 2001.
2. F.F. Kuo W. Effelsberg , Multimedia Communications, Prentice Hall, 1998.
Ma t 401 Ma thema tical Model ling (Elect ive) [4 0 0 4]

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.
Bo oks For Ref ere nce :

1. Mathematical Modelling, Edn. 1988, Wiley Eastern By J. N. Kapoor.
2. Advanced Engineering Mathematics, 7th Edn., 1993 John Wiley & Sons By Erwin Kreyszig.
Cse 407.1 Embedded Systems [4 0 0 4]
1. Introduction To Embedded Systems. –1
2. 8051 Microcotnrollers And Assembly Language Programming. – 10

- Data Types And Directives, Register Bank, Addressing Modes, Jump, Loop And Call Instructions.
Arithmetic Instructions, Logic Instructions, Single Bit Instruction And Programming.
3. Timer/Counter Programming In 8051, I/O Port Programming – 10

Serial Communication And Interrupt Programming.
4. Real World Interfacing – Stepper Motor, Keyboard And Dac. –5

- 8255 Interfaced With 8051.
5. Real Time Operating System Concepts – 15

- Real Time Kernels
- Inter Task Communications And Synchronization
- Real Time Memory Management
- Scheduling
6. Real Time Communication Protocol –8

- Introduction
- Contention Based Protocol
- Window Protocol
- Token Based Protocol
- Stop And Go Multihop Protocol
- Cold Bus Protocol
Re fere nce s:
1. The 8051 Microcontroller & Embedded Systems By Muhammed Ali Mazidi, J.C. Mazidi, Pearson
Education, 2000.
2. Real Time System Design And Analysis By Phillip A. Laplante, Phi, 2002.
3. Real Time Systems By C.M. Krishna & Kong G. Shin, Mcgraw Hill Ed. 1992.
4. 8051 Microcontroller By Ayalle, Phi Publication.
Cse 407.2 Design Of Unix Operating System (Elect ive)
1. Ge ner al Overv iew Of Th e Sy ste m (1 Hr.)

1.1 System Structure
1.2 User Perspective
1.3 Operating System Services
1.4 Introduction To Hardware
2. In trod ucti on To Ker nal (2 Hrs.)

2.1 Architecture Of Unix Operating System
2.2 Introduction To System Concepts
2.3 Kernel Data Structures
2.4 System Administration
3. Bu ffer Cach e (2 Hrs.)

3.1 Buffer Headers
3.2 Structure Of The Buffer Pool
3.3 Scenarios For Retrieval Of A Buffer
3.4 Reading And Writing Disk Blocks
3.5 Advantages And Disadvantages Of Disk Blocks
4. In tern al Repr ese ntat ion Of Files (3 Hrs.)

4.1 Inodes
4.2 Structure Of A Regular File
4.3 Directories
4.4 Conversion Of A Path Name To An Inode
4.5 Super Block
4.6 Inode Assignment To A New File
4.7 Allocation Of Disk Blocks
4.8 Otherfile Types
5. Sy ste m Ca lls For Th e Fil e S yste m (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. Pr oces s (5 Hrs.)
6.1 Process States And Transitions
6.2 Layout Of System Memory
6.3 The Context Of A Process
6.4 Saving The Context Of A Process
6.5 Manipulation Of The Process Address Space
6.6 Sleep
7. Pr oces s C ontr ol (5 Hrs.)

7.1 Process Creation
7.2 Signals
7.3 Process Termination
7.4 Awaiting Process Termination
7.5 Invoking Other Programs
7.6 The User Id Of A Process
7.7 Changing The Size Of Process
7.8 The Shell
7.9 System Boot And The Init Process
8. Pr oces s S che duli ng And Time (3 Hrs.)

8.1 Process Scheduling
8.2 System Calls For Time
8.3 Clock
9. Me mor y Ma nag eme nt (4 Hrs.)

9.1 Swapping
9.2 Demand Paging
9.3 A Hybrid System With Swapping And Demand Paging
10.I/ O S ubsy ste m (6 Hrs.)

10.1 Driver Interfaces
10.2 Disk Drivers
10.3 Terminal Drivers
10.4 Streams
11.Inte rpro ces s Co mmu nica tio n (5 Hrs.)

11.1 Process Tracing
11.2 System V Ipc
11.3 Network Communications
11.4 Sockets
12.Sh ell Pro gram min g (5 Hrs.)
Text Book s
1. Maurice J. Bach, Th e D esig n Of Uni x O pera tin g Sy ste m, Prentice Hall Of India, 1988, (Chapters
1 To 11).
2. Rachel Morgan & Henry Mcgilton, In trod uci ng Unix Syst em V, Mcgraw-Hill International Editions,
1987, (Chapter 13).
Re fere nce s
1. Stephen G Kochan & Patrick H Wood, Expl orin g Th e Uni x Syst em, Cbs Publishers & Distributers,
1984.
2. Abdul Mohammad, Unix Ste p By St ep , Narosa Publications.
3. Karee Christian, The Unix Op erat ing Sys tem (Second Edition), John Wiley &
Sons, 1989.
Cse 407.3 Objec t Orien ted Da tabase [4 0 0 4]

1. Introduction And Object Oriented Concepts. (Text 1) (4 Hrs.)
2. Modeling And Design For Object Oriented Databases (Text 1) (3 Hrs.)
3. Persistence (Text 1) (3 Hrs.)
4. Transaction, Concurrency, Recovery And Versioning In Object Oriented Databases (Text 1).
(3 Hrs.)
5. Client/Server Architecture And Object Oriented Databases (Text 1) (3 Hrs.)
6. Introduction To Object Oriented Database Management And Systems Design Methodology For Object
Oriented Systems. (Text 2) (8 Hrs.)
7. Object Oriented Design. (Text 2) (3 Hrs.)
Object Oriented Design Example (Text 2)
- Designing A Financial Application.
- Data Modelling And Design (12 Hrs.)
8. Object-Oriented Databases And Object Relational Databases. (Korth) (6 Hrs.)
Text Book s:
1. Setrag Khoshafian, Object Oriented Databases, John Wiley And Sons., Inc. 1993.
2. Prabhat K. Andleigh, Michael R. Gretzinger, Distributed Object Oriented Data Systems Design, Prentice
Hall.
Re fere nce s:
1. Silber Schhatz, Korth, Sudarshan, Database System Concepts, 4th Edition, Tata Mcgraw Hill.
2. Alfons Kemper, Guido Moerkohe, Object Oriented Database Management.
3. Brown A., Object Oriented Database, London, Mcgraw Hill, 1991.
4. Brathwaite And Kehmore S. , Object Oriented Database Design, Newyork, Academic Press, 1993.
5. Object Oriented Modelling And Design For Database Applications, New Jersey, Prentice Hall, 1998.
6. Bindu R. Rao, Object-Oriented Database Technology, Applications And Products, Mcgraw Hill, 1995.
7. R.G.G. Cattell, Object Data Management, Sun Micro Systems Inc., 1992.
Cse 407.4 Advanced Co mputer Architec ture [4 0 0 4]

In trod ucti on To Par alle l Pr oce ssin g:
Performance Evaluation, Trends Towards Parallel Processing, Parallelism In Uniprocessor Systems, Parallel
Computer Structures, Architectural Classification Schemes, Parallel Processing Applications.
Pi peli ning :
Principles Of Linear And Nonlinear Pipelining, Classification Of Pipeline Processors, General Pipelines And
Reservation Tables, Design Of Instruction And Arithmetic Pipelines, Principles Of Designing Pipelined
Processors, Interrupts In Pipeline Processors. (10 Hrs.)
(Chapter 3 Of Text 1 And Chapter 6 Of Text 2)
St ruct ures An d Algor ith ms For Array Pro ces sors :

Simd Array Processors, Simd Interconnection Networks, Associative Array Processing, Parallel Algorithm
For Array Processors - Matrix Multiplication, Parallel Sorting. (8 Hrs.)
Vector Processing, Vector Processing Principles, Characteristics Of Vector Processing, Multiple Vector Task
Dispatching, Pipelined Vector Processing Methods, Compound Vector Processing.
(6 Hrs.)
(Chapter 3 Of Text 1, 4.4 Of Chapter 4, 5.3 Of Chapter 5 And Chapter 8 Of Text 2)
Mu ltip roce ssor Sy stem :

Functional Structures, Interconnection Networks, Maintaining Memory Consistency, Cache Coherence
Problems, Virtual Address Cache And Physical Address Cache, Cache Coherence Protocols, Shared
Memory Multiprocessors. Exploiting Concurrency For Multiprocessing. 7 Hrs.)
Introduction To Multithreaded Architecture, Dataflow Computers - Data Driven Computing And Languages,
Data Flow Computer Architectures. (6 Hrs.)
I/O Subsystems:
I/O Processors, Disk Arrays I/O Strategy And Intelligence, Improving Data Rate By Software, Improving
Data Rate By Hardware, Shadowing, Stripping And Raids. (6 Hrs.)
Text Book s:
Kai Hwang And Faye A. Briggs -Computer Architecture And Parallel Processing - Mcgraw Hill Publication.
Kai Hwang - Advanced Computer Architecture - Parallelism, Scalability And Programmability, 1993 Edition.
Re fere nce :
Hennesy And Patterson - Computer Architecture: A Quantitative Approach (1993 Edition)
Mat 403 Graph Theor y [4 0 0 4 ]

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 Centroids, 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.
Gr aph Theor etic Al gorit hms

Computer Representation Of Graphs – Input And Output, Algorithms For Connectedness, Spanning Tree,
Fundamental Circuits, Directed Circuits And Shortest Paths.
Bo oks For Ref ere nces :

1. F. Harary, Graph Theory, Narosa Publishers, 1988.
2. Narsingh Deo, Graph Theory With Applications To Engineering And Computer Sc, Prentice Hall, 1987.
3. Robin J. Wilson, Introduction To Graph Theory, Logman, 1985.
Cse 409 Developmen t O f W indows Applica tions (Vc++) [3 1 0 4]
1. Microsoft Windows And Visual C+

The Windows Programming Model
The Visual C++ Components (5 Hrs.)
2. The Microsoft Foundation Class Library Application Framework

Why Use The Application Framework?
What’s An Application Framework?
Mfc Library Message Mapping
Documents And Views. (3 Hrs.)
3. Getting Started With Appwizard - “Hello World” (2 Hrs.)
4. Basic Event Handling, Mapping Models, And A Scrolling View.

Getting User, Input-Message Map Functions.
Mapping Modes
A Scrolling View Window
Other Windows Messages (3 Hrs.)
5. The Graphics Device Interface, Colors, And Fonts

The Device Content Classes
Gdi Objects
Windows Color Mapping
Fonts (4 Hrs.)
6. The Modal Dialog And Windows Common Controls (5 Hrs.)
7. The Modeless Dialog And Windows Common Dialogs Modeless Dialogs

The Cformview Class - A Modeless Dialog Alternative
The Windows Common Dialogs (2 Hrs.)
8. Using Activex Controls

Activex Controls Vs. Ordinary Windows Controls
Installing Activex Controls
The Calendar Control
Activex Control Container Programming
The Example - An Activex Control Dialog
Container
Activex Controls In Html Files (3 Hrs.)
9. Win32 Memory Management (2 Hrs.)

10.Windows Message Processing And Multithreaded Programming
Windows Message Processing
On -Idle Processing
Multithreaded Programming (3 Hrs.)
11.Menus, Keyboard Accelerators, The Rich Edit Control And Property Sheets. (5 Hrs.)
12.Tool Bars And Status Bars

Control Bars And The Application Framework
The Toolbar
Tooltips
Locating The Main Frame Window
The Toolbar Example
The Status Bar
The Status Bar Example. (2 Hrs.)
13.Reading And Writing Documents -Sdi Applications

Serialization - What Is It ?
The Sdi Application
The Example For Sdi With Serialization
Explorer Launch And Drag And Drop (4 Hrs.)
14.Database Management With Microsoft Odbc

The Advantages Of Database Management
Structured Query Language
The Odbc Standard
The Mfc Odbc Classes - Crecordset And Cdatabase
The Student Registration Database
Filter And Sort Strings
Joining Two Database Tables
The Mfc Crecordview Class
Multiple Recordsets
Odbc Multithreading
Bulk Row Fetches
Using Recordsets Without Binding. (5 Hrs.)
Text Book :
1. “Programming Microsoft Visual C++ Fifth Edition “ By David J. Kruglinski.
Re fere nce Bo ok:

1. “Programming Windows 95” By Charles Pitzold Microsoft Press.
2. “Visual C++ 6.0 In Record Time” By Steven Holzner Bpb Publications.
3. “Teach Yourself Visual C++ 6.0 In 21 Days” – Davis Chapman, Bpb Publications.
4. “Visual C++ 6.0 In Record Time” - Steven Holzner, Bpb Publications.
5. “Teach Yourself Visual C++ 6.0 In 21 Days” – Davis Chapman, Bpb Publications.
Cse 41 1 Mini Project [0 0 6 2]
The Students Are Supposed To Carry Out A Mini Project On 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 On The Eighth Semester.
Cse 413 Deve lopment Of Wi ndows Appl icat ion (Vc++) Lab.
[0 0 2 2 ]
1. Create A Project Using Mfc

2. Create A Project On Event Handling
3. Create A Project On Colors & Fonts
4. Create An Application On Model Dialog & Windows Common Controls
5. Create An Application On Modelless Dialog
6. Create A Project Using Activex Control S
7. Create An Application On Multithreaded Programming
8. Create A Project On Menus, Keyboard Accelerators, The Rich Edit Box.
9. Create An Application Tool Bars And Status Bars
10.Create A Project For Reading And Writing Single Document Interface
11.Create A Project On Data Base Management With Odbc
12.Create A Project On Data Base Management With Ado
Cse 402 Se minar [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.
Ref: Materials : Ieee Transactions, Technical Journals, Proceedings Of National And

International Conferences, Web Sites.
Note: The Seminar Evaluation Is Carried Out In 7th Semester And Grade Is Included In 8th
Semester Grade Sheet.
Cse 404 Industrial Training/T our [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 8th Semester Grade Sheet.
Cse 499 Project [0 0 36 12]
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
Over The Project Either In An Industry Or In The College.
Home About MIT Director Message Courses Rules & Regulation Contact

MIT Manipal CSE 07-11 Course Plan

Încărcat de

Informații document

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

MIT Manipal CSE 07-11 Course Plan

Încărcat de

Drepturi de autor:

Formate disponibile

BE COMPUTER SCIENCE AND ENGINEERING

SE COND YEAR TO FOUR TH YEA R

Cse 203 Co mputer Organizat ion And Archi tecture [3 1 0 4 ]

Computer Instruction Set: Opcode Encoding, Addressing Modes, Instruction Types.

Cse 205 Logic Des ign [3 1 0 4 ]

6. Introduction To Ram, Rom, Pla (3 Hrs.)

Cse 207 Da ta S tructures [3 1 0 4]

4. Stacks And Queues:

Cse 209 Ob ject-Oriented Prog ram ming W it h C ++ [3 1 0 4]

2. Principles Of Object Oriented Programming

3. Classes And Objects.

Cse 211 Logic Design Lab. [0 0 3 1]

Cse 213 Da ta S tructure s Lab . [0 0 3 1 ]

1. Implementation Of Array Operations And Recursion:

Cse 215 Ob ject-Oriented Prog ram ming W it h C ++ Lab. [0 0 3 1]

Mat –Cse 202 Discrete Ma themat ical Structures [3 1 0 4 ]

Formal Language Syntax, Semantics And Grammar.

Group Theory : Cosets, Normal Groups And Subgroups.

Cse 204 Des ign And Ana lysis O f Algorithms [3 1 0 4]

Cse 206 Database M anagement Sys tems [3 1 0 4 ]

3. Relational Model – Structure Of Relational Databases, Relational Algebra, Extended Relational –

5. In tegr ity An d S ecur ity

6. Re lati onal Da tab ase Desi gn

7. St ora ge And File Str uct ures

8. In dexi ng And Ha shin g

Re fere nce Bo ok:

Cse 208 P.C. Systems [3 1 0 4]

Re fere nce Bo oks:

Cse 210 Event-Driven Programming With Java [3 1 0 4]

3. Ex cep tion Ha ndli ng

Re fere nce Bo ok:

Cse 212 Database M anagement Sys tems Lab . [0 1 2 2 ]

1. File Structure And Organization

Cse 214 Pc Systems Lab . [0 0 3 1 ]

1. Experiments Based On 8086 Microprocessor -Programming 8086. (Various Numeric Exercises)

Cse 216 Java Programm ing Lab. [0 1 2 2]

Program Exercises For The Topics Listed In Cse 210.

Cse 301 Theory Of Co mputat ion [3 1 0 4 ]

5. Turi ng Mac hine s And Oth er M odel s O f Turin g Ma chi nes:

Re fere nce Bo oks:

Cse 303 Princ iples O f Prog ramm ing Languages [3 1 0 4]

1. In trod ucti on:

7. Ab stra ct Data Type s (A dt):

8. Ob ject -Ori ent ed Progr amm ing An d Ja va:

10. Logic Programming:

Cse 305 Systems Programming [3 1 0 4]

2. La ngu age Pr oces sors :

3. In trod ucti on To Pd p-1 1:

4. Ad dre ssin g M odes :

5. Ba sic Com man ds:

6. Co mpa re And Bra nch Ins truc tion s:

7. Lo gic al And Shif t Co mma nds :

8. Su bro utin es:

9. Ma cros An d Condi tio nal Ass embl y:

10.Th e Asse mbly Pro cess :

11.Link ing An d Lo adi ng:

Cse 307 Operat ing Syste ms And Un ix [3 1 0 4 ]

2. Pr oces ses : (3 Hrs.)

4. Co ncur ren t Pr oces ses : (4 Hrs.)

7. Virtu al Mem ory: (5 Hrs.)

8. Fil e S yste ms: (4 Hrs.)

9. Dis k S che duli ng: (4 Hrs.)

10.Pe rfor man ce Eval uati on: (3 Hrs.)