09ZS01 DISCRETE
MATHEMATICAL STRUCTURES
MATHEMATICAL
LOGIC:
Prepositions-Logical operator-Equivalence and implication-Laws of logic- Normal
forms-prepositional calculus-Quantifiers. (5)
RELATIONS:
Binary
relations-Relation matrix and graph of relation-Partition,covering a
set-Equivalence relation-Partial ordering-Hasse diagram. (5)
COMBINATORICS:
Counting
methods for arrangement and selections-Two basic counting principles-Arrangements
and selections with repetition -Generating functions.
(6)
RECURRENCE
RELATIONS: Recurrence
relation models-Solution of linear recurrence relations-Solution of
non-homogeneous linear relations.
(5)
GRAPH
THEORY: Representation
of graphs-Connectivity-Eulerian and Hamiltonian graphs-Trees-Binary tree
traversal –Expression. (6)
GROUP
THEORY: Group
axioms-Semi groups-Monoids-Applications to generation of codes using parity
checks-Error recovery in group codes. (5)
FORMAL
LANGUAGES:
Four classes of grammars-Definitions-Context free grammar-Derivation tree-Ambiguity. (4)
FINITE
AUTOMATA: Definition
of deterministic finite state automaton(DFA),Non deterministic finite state
automaton(NFA)- Equivalence of DFA and NFA. (6)
Total
42
REFERENCES:
1.
Bernard
Kolman, Robert C Busby and Sharan Ross,”Discrete Mathematical Structures”,
Pearson Education/Prentice Hall of India, NewDelhi, 2008.
2.
Kenneth
H Rosen,”Discrete Mathematics and its Applications”, Mcgraw Hill Inc, USA, 2007.
3.
Alan
Tucker,”Applied Combinatorics”, John Wiley and Sons, USA, 2007.
4.
Doerr
Alan and Levasseur Kenneth, ”Applied Discrete Structures for Computer Science”,
Galgotia Publication (P) Ltd, New
Delhi, 2000.
09ZS02 SOFTWARE
ENGINEERING METHODOLOGIES
3 0 0 3
INTRODUCTION: Definitions, Characteristics of Software -
Software Engineering vs other engineering disciplines – Software Myths –
Software Life Cycle Models – Selection of Software Process models. (8)
Requirement Analysis: Prototyping – Specification – Analysis modeling. (8)
Software Design: Software design – Abstraction – Modularity – Software
architecture – Effective modular design – Cohesion and Coupling – Architectural
design and procedural design – Data flow oriented design. (8)
User Interface Design: User Interface design – Human factors – Human computer
interaction – Human – Computer interface design – Interface design – Interface
standards. Programming languages and coding – Language classes – Code
documentation – Code efficiency – Software configuration management.
(6)
PROGRAMMING STANDARDS: Need for structured programming – Coding
standards – Maintainability of programs.
(3)
Testing TECHNIQUES: Software testing – Path testing – Control
structures testing – Black Box testing – Unit, Integration, Validation and
system testing – Software Maintenance. (6)
TRENDS IN SOFTWARE ENGINEERING: Reverse Engineering and Re-engineering –
wrappers – Case Study of CASE tools. (3)
Total 42
REFERENCES:
1.
Roger
S Pressman,” Software Engineering – A Practitioner’s Approach”, McGraw Hill, USA, 2007.
2.
Sommerville
I, “Software Engineering”, Pearson Education India,
New Delhi, 2006.
3.
Pfleeger,
”Software Engineering”, Pearson Education India,
New Delhi, 1999.
4.
Carlo
Ghezzi, Mehdi Jazayari and Dino Mandrioli, “Fundamentals of Software
Engineering”, Prentice Hall of India,
New Delhi,
1991.
09ZS03 FOUNDATIONS
OF OBJECT ORIENTED SYSTEMS
3 0 0 3
INTRODUCTION: Overview of System Analysis,
Structured System Analysis- Object Oriented Analysis- Comparison of SSA and
OOA. (3)
OBJECT MODELING: Evolution of object models- Object
modeling- Major and Minor elements of object models- Object Classifications-
Objects and their relationships- Classes- Class relationships – Association-
Aggregation- Inheritance- Instantiation- Using.
(6)
UML AND USE CASE
MODELING : UML: an
Introduction- Views and Diagrams- extended UML - Modeling requirements using
use case diagrams – Components of use case model- Components of a use case diagram-
steps in processing requirements specifications to construct use case diagram-
Use case identification and description. (7)
WORKFLOW AND
BEHAVIORAL MODELING: Modeling
workflows using Activity diagrams: Components of activity diagrams- Steps in
construction – Examples - Modeling behavior with state diagrams: Notations- Nesting
of states- steps in construction – Examples. UML Interaction diagrams:
Interaction diagrams – Components- steps in construction- examples. Collaboration
diagrams- Timing diagrams- Interaction overview diagrams. (8)
STRUCTURAL
MODELING: Class
diagrams- Object diagrams- Component diagrams- Deployment diagrams- Package
diagrams- Composite structure diagrams.
(6)
OTHER OBJECT
ORIENTED METHODOLOGIES:
Booch methodology- OMT- Coad/Yourdon approach- Shalear/ Mellor’s approach-
OOSE- Comparative study.
(8)
CASE STUDIES: Patterns and frameworks- Modeling
ATM, e-shop, Cruise Control System, cellular network. (4)
Total 42
REFERENCES:
1.
Grady
Booch, James Rumbaugh and Ivar Jacobson, “The Unified Modeling Language User
Guide”, Addison-Wesley Longman, USA,
2005.
2.
Ali
Bahrami, “Object Oriented System Development”, McGraw Hill International
Edition, Singapore,
1999.
3.
Fowler,
“Analysis Patterns”, Addison Wesley, USA, 1996.
4.
Erich
Gamna, “ Design Patterns”, Addison Wesley, USA, 1994.
09ZS04 DATA
STRUCTURES
3 0 0 3
Introduction to Data
Structures: Problem Solving using
Computers – Abstraction - Abstract data types- Data Representation - Elementary
Data types - Basic Concepts of Data Structures - Mathematical Preliminaries –
Efficiency of algorithms - Time and space complexity – Asymptotic Notation - Performance
measures for data structures- Examples and real life applications.
(4)
STACK: Definition- Array
based implementation of stacks- Linked List based implementation of stacks-
Introduction to Recursion.
Applications: Infix, postfix, prefix representation,
Conversions (5)
Queues and Lists: Definition- Array based implementation
of Queues / Lists- Linked List implementation of Queues / Lists- Circular
implementation of Queues and Singly linked Lists- Linear / circular
implementation of doubly linked Queues / Lists-Priority Queues - Applications. (6)
Trees: Definition of trees
and Binary trees- Properties of Binary trees- Binary Traversal pre-order, post
order, Inorder traversal- Applications of binary trees – Huffmann coding -
Binary Search Trees (recursive & non–recursive Algorithms)- Threaded trees-
Balanced multi way search trees-AVL Trees - Implementations - Applications of
Search trees – TRIE, 2-3 tree, 2-3-4 tree, Red-Black trees. (7)
Graphs: Undirected and Directed Graphs and Networks-
Array based implementation of graphs- Adjacency matrix- Path matrix
implementation- Linked list representation of graphs - Graph Traversal –
Breadth first Traversal, Depth first Traversal- Tables: Definition, Hash
function, Implementations and Applications.
(7)
SORTING
ALGORITHMS:
Introduction- Sorting Techniques : Bubble sort, Straight selection sort- Shell sort,
Performance of shell sort- Heap sort : Heap Construction, Heap sort –
complexity analysis of all sorting techniques . (6)
ALGORITHM
DESIGN PARADIGMS: Divide
and Conquer: Merge Sort, Quick Sort, Greedy: Shortest path, MST, Dynamic
programming: Multistage, optimal binary search tree, Backtracking: graph coloring,
sum of subset problem – Complexity analysis.
(7)
Total
42
REFERENCES:
1.
Mark
Allen Weiss, “Data Structures and Algorithm Analysis in C”, Pearson Education, New Delhi, 2006.
2.
Chitra
A and Rajan P T, “Data Structures”,
Vijay Nicole Imprints Private Limited, Chennai, 2006.
3.
Yedidyah
Langsam, Moshe J Augenstein and Aaron M Tanenbaum, "Data Structures using
C and C++", Prentice Hall of India, New Delhi, 2000.
4.
Robert Sedgewick,
"Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures,
Sorting, Searching, and Graph Algorithms", Addison Wesley, USA, 2001.
5.
Tremblay,Sorenson
J P and Paul G, "An Introduction to Data Structures with Applications",
Tata McGraw Hill, New Delhi,
2008.
6.
Sara
Baase and Allen Van Gelder, "Computer Algorithms – Introduction to Design
and Analysis", Pearson Education, New
Delhi, 2002.
7.
Richard
F Gilberg and Behrouz A Forouzan, "Data Structures – A Pseudocode Approach
with C++", Thomson Brooks/Cole, Singapore, 2002.
8.
Thomas
H Cormen, Charles E Leiserson, Ronald L Rivest and Clifford Stein,
"Introduction to Algorithms", MIT Press, Cambridge, 2001.
09ZS06 DATABASE
SYSTEMS
3 0 2 4
Database System CONCEPT: File system – Storage structures - Database systems – Database systems
architecture – Data models – Relational model, Hierarchical model, Network
model, Object relational model, Object Oriented model– Data Dictionary –
Database Administration. Relational database concepts: Codd’s rule – Base
tables – Views - Domains and Key concept – Integrity rules – Relational
Algebra. (8)
SOFTWARE DEVELOPMENT
LIFECYCLE: Introduction to SDLC – Database development
Lifecycle. (4)
DESIGN:
Logical Database
Design: ER model: Entity
Relationship diagram - Extended ER diagram – Mapping ER diagram to relations. Normalization: 1NF
to 5NF- Domain Key Normal Form –
Denormalization. (6)
Physical Database Design: Commercial query languages – SQL,
Options for SQL Extensions, Embedded SQL, Call Level Interface. (5)
QUERY PROCESSING AND
OPTIMIZATION: Query Processing -
Heuristics Query Optimization - Cost
Based Query Optimization. (5)
DATABASE SYSTEM IMPLEMENTATION ISSUES:
Transaction
processing: Introduction - Properties of Transaction – Serializability-
Concurrency Control – Locking Mechanisms- Two Phase Commit Protocol-Dead lock.
Indexing and Hashing – Backup and recovery – Security and Integrity – Database
Tuning.
(6)
TRENDS IN DBMS: Client-Server
computing and Distributed Databases - Web Databases – Mobile Databases – Active
Databases – Temporal Databases – Spatial and Multimedia Databases – Statistical
Databases – Deductive databases. OLTP and OLAP. (8)
Total 42
Lab components:
1.
Study
of DDL and DML commands
2.
Study
of DCL and TCL commands
3.
Study
of Transact SQL
4.
Study
of MySQL
REFERENCES:
1.
Ramez
Elmasri and Shamkant B Navathe, “Fundamentals of Database Systems”, Addison
Wesley, USA,
2007.
2.
Raghu
Ramakrishnan and Johannes Gehrke, “Database Management Systems”, McGraw-Hill, USA, 2008.
3.
Abraham
Silberchatz, Henry F Korth and S Sudarshan, “Database System Concepts”, McGraw-Hill, USA,
2008.
4.
Atul Kahate, “Introduction to Database Management Systems”,
Pearson Education, New Delhi,
2004.
09ZS09 OPERATING SYSTEMS
INTRODUCTION: Operating Systems-Objectives
and Functions-Evolution of Operating Systems-Structure of Operating
System-Components of Computers.
(2)
MEMORY
MANAGEMENT:
Memory hierarchy-Partitioning-Buddy Systems-Paging-Segmentation-Virtual Memory. (8)
PROCESS
MANAGEMENT:
Process Creation-Process states-Threads-Synchronization-Process Scheduling
Algorithms-Concurrent Process –Deadlock. (6)
FILE AND
I/O MANAGEMENT:
I/O functions-I/O devices-Disk Scheduling Algorithms, File Management
Systems-File System Architecture-Functions of File Management-File
Directories-Secondary Storage Management-File Allocation. (8)
INTRODUCTION
TO LINUX:
History- Architecture and Structure-Process Management-Inter Process
Communication-Memory Management-I/O and File Management. (6)
LINUX
ADMINISTRATION:
Basic Commands-Installing and Configuring Linux-Shell Scripting-Users and
Groups-Package installation-Network Configuration-Backup and
archives-Configuring and using X Windows. (8)
VMWARE: Introduction-
Virtualization- Virtual Data Center Operating System- Storage Virtualization
-Virtual Networking- Virtual Security. (4)
Total 42
REFERENCES:
1.
Silberschatz
A, Galvin P and Gagne G, “Operating System Concepts” John Wiley and Sons, Singapore, 2007.
2.
Dhamdhere
D M, “Operating Systems- A Concept based Approach”, Tata McGraw Hill, New Delhi, 2006.
3.
Daniel
P Bovet and Macro Cesati, “Understanding the Linux Kernel”, O’reilly
publications, USA,
2006.
4.
William
Stallings, “Operating Systems”, Prentice Hall, New Delhi, 2004.
5.
William
J Lowe, “VMware Infrastructure 3 for dummies”, John Wiley and Sons, USA, 2008.
09ZS55
OBJECT COMPUTING AND DATA STRUCTURES LABORATORY
0 0 3 2
1.
Construct
the Following UML diagrams for any one application (like ATM, Online Shopping,
Lift operation)
Activity diagram, Use
Case diagram, State diagram, Sequence diagram, Collaboration diagram, Class
diagram, Deployment diagram, Package diagram and Code generation.
2.
Sieve
of Eratosthenes (Lists)
3.
Long
Integer Arithmetic (Lists)
4.
Conversion
and Evaluation of Expressions (Stack)
5.
Scheduling
Algorithms Simulation (Queues)
6.
Huffmann
Coding (Binary tree + Heaps)
7.
Shortest
path related applications – Traveling Salesman Problem
No comments:
Post a Comment