National Institute of Technology Calicut

Module I (20 Hours)

Stack and Queue: Implementation using arrays and Linked lists

Searching Methods: Binary search and Hashing

Sorting: Recursive implementation of Quick Sort and Merge Sort

Module II (15 Hours)

Binary Search Tree: Implementation with insertion, deletion and traversal

Infix Expression Evaluation: Using expression tree

Module II (20 Hours)

Graph Search Algorithms: DFS and BFS on a connected directed graph

Minimal Spanning Tree: Implementation of Kruskal’s and Prim’s Algorithms

Shortest Path Algorithms: Dijkstra and Floyd Warshall Algorithms

Module II (15 Hours)

Disjoint Set operations: Union and Find using rank and path compression.

Applications of Heap: Priority Queue and Heap Sort.

 

References:

1. 
   T. H. Cormen, C. E. Lieserson, R. L. Rivest, Introduction to Algorithms, PHI, 1998
   
2. 
   S. Sahni, Data structures, Algorithms, and Applications in C++, McGraw Hill, 1998
   

 

CSU 313 OPERATING SYSTEMS
Pre-requisite: CSU 203 Data Structures and Algorithms

L	T	P	C
3	0	0	3

Module I (10 Hours)

Review of operating system strategies - resources - processes - threads - objects - operating system organization - design factors - functions and implementation considerations - devices - characteristics - controllers - drivers - device management - approaches - buffering - device drivers - typical scenarios such as serial communications - storage devices etc

 

Module II (12 Hours)

Process management - system view - process address space - process and resource abstraction - process hierarchy - scheduling mechanisms - various strategies - synchronization - interacting & coordinating processes - semaphores - deadlock - prevention - avoidance - detection and recovery

 

Module III (10 Hours)

Memory management - issues - memory allocation - dynamic relocation - various management strategies - virtual memory - paging - issues and algorithms - segmentation - typical implementations of paging & segmentation systems

 

Module IV (10 Hours)

File management - files - implementations - storage abstractions - memory mapped files - directories and their implementation - protection and security - policy and mechanism - authentication - authorization - case study of unix kernel and microsoft windows NT (concepts only)

 

References

1. 
   Silberschatz, Galvin, Gagne, Operating System Principless, 7/e, 2006, John Wiley
   
2. 
   William Stallings, Operating Systems, 5/e, Pearson Education
   
3. 
   Crowley C., Operating Systems- A Design Oriented Approach, Tata McGraw Hill, New Delhi
   
4. 
   Tanenbaum A. S., Modern Operating Systems, Prentice Hall, Pearson Education
   
5. 
   Gary J. Nutt, Operating Systems - A Modern Perspective, Addison Wesley
   

 

CSU 303 COMPILER CONSTRUCTION

Pre-requisites: CSU 203 Data Structures and Algorithms

CSU 211 Formal Languages and Automata

L	T	P	C
3	0	0	3

Module I (6 hours)

Introduction to Programming language translation. Lexical analysis: Specification and recognition of tokens.

 

Module II (12 hours)

Syntax analysis: Top-down parsing-Recursive descent and Predictive Parsers. Bottom-up Parsing- LR (0), SLR, and LR (1) Parsers.

Module III (16 hours)

Semantic analysis: Type expression, type systems, type checking, and symbol tables.

Intermediate code generation: Intermediate languages. Intermediate representation-Three address code and quadruples. Syntax-directed translation of declarations, assignments statements, conditional constructs, and loops constructs.
Module IV (8 hours)

Runtime Environments: Storage Organization, activation records. Introduction to machine code generations and code optimizations.

 

References:

1. Aho A.V., Sethi R, and Ullman J.D. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986.

2. Appel A.W, and Palsberg J. Modern Compiler Implementation in Java. Cambridge University Press, 2002.

CSU 321 SOFTWARE ENGINEERING
Pre-requisite: CSU 203 Data Structures & Algorithms

L	T	P	C
3	0	0	3

Module I (8 Hours)

Introduction: Software process and the role of modeling and analysis, software architecture, and software design.

Module II (11 Hours)

Software Modelling and Analysis: Analysis modeling and best practices, traditional best practice diagrams such as DFDs and ERDs, UML diagrams and UML analysis modeling, analysis case studies, analysis tools, analysis patterns.

Module III (11 Hours)

Software Architecture: Architectural styles, architectural patterns, analysis of architectures, formal descriptions of software architectures, architectural description languages and tools, scalability and interoperability issues, web application architectures, case studies.

Module IV (12 Hours)

Software Design : Design best practices, design patterns, design case studies, object oriented frameworks, distributed objects, object request brokers, case studies.

 

References:

1. 
   1. G. Booch, J. Rumbaugh, and I. Jacobson, I. The Unified Modeling Language User Guide. Addison-Wesley, 1999 .
   
2. 
   2. E. Gamma, R. Helm,  R. Johnson, and J. Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, 1995 .
   
3. 
   3. F. Buschmann et al. Pattern Oriented Software Architecture, Volume 1: A System of Patterns. John Wiley and Sons, 1996.
   
4. 
   4. M. Shaw and D. Garlan. Software Architecture: Perspectives on an Emerging Discipline. Prentice-Hall, 1996
   

CSU 392 COMPILER LAB
Pre-requisite: Knowledge of Compiler Design and Implementation

L	T	P	C
0	0	5	3