National Institute of Technology Calicut

Functional Paradigm

Module II (12 Hours)

Untyped arithmetic expressions: Syntax, Semantics, and evaluations strategies.Untyped lambda calculus: Abstract and concrete syntax, operational semantics, Programming in the lambda calculus.

Module III (10 Hours)
Typed arithmetic expressions: Types and typing relation. Simply typed lambda calculus: Function types, Typing relation, Safety.
Module IV (10 Hours)
Extensions to simply typed lambda calculus: Unit type, Let bindings, Pairs, Tuples, Records, Sums, Variants, and Recursion.

References:

1. Ravi Sethi. Programming Languages: Concepts and Constructs. Addison Wesley 1996.

2. Benjamin C Pierce. Types and Programming Languages, MIT Press, 2002

3. Michael L Scott Programming Language Pragmatics. Elsevier. 2004.

CSU 313 OPERATING SYSTEMS

Pre-requisite: CSU 203 Data Structures & Algorithms

L	T	P	Cr
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 396 PROGRAMMING LANGUAGES LAB
Pre-requisite: Knowledge of Programming Language concepts

L	T	P	Cr
0	0	3	2

Module I (12 Hours)

Write an interpreter for language of arithmetic expressions

Module II (12 Hours)

Write an interpreter for lambda-calculus

Module III (9 Hours)

Extend the interpreter with Unit type, Let binding, Pairs, and Tuple

Module IV (9 Hours)

Extend the interpreter with Records, Variants, and Lists.

Reference
1.Benjamin C Piece Types and Programming Languages. MIT Press, 2002.


CSU 397 OPERATING SYSTEMS LAB
Pre-requisite: Knowledge of Operating System concepts

L	T	P	Cr
0	0	5	3

1. Module I (25 Hours)

 Enhance the primitive NACHOS operating Systems with the following:

Load Module -Implementation of Read(), Write(), Open() and Close() system calls.

Multiprogramming- Implementation of Fork, Wait, Exec and Exit,

3. Module II (15 Hours)

 Implementation of Translation Look aside Buffer (TLB) in NACHOS.
Module III (10 Hours)

 Build File System in NACHOS.

Module IV (20 Hours)

 Implementation of Synchronization mechanisms -Semaphore, Locks and Conditional Variables

Build Networking facilities in NACHOS - Mailbox
 

References

1. 
   Gary J. Nutt, Operating Systems, Pearson Education, 3/e, 2004.
   
2. 
   http://www.cs.duke.edu/~narten/110/nachos/main/main.html
   
3. 
   http://www.ida.liu.se/~TDDB63/material/begguide/beginners-guide.html
   

CSU 398 MINI PROJECT
Pre-requisite: Knowledge of Software Engineering principles

L	T	P	Cr
0	0	3	1

Each student group (not more than 5 members in a group) is expected to develop a complete software product using software engineering techniques. A detailed report is also to be submitted. The students may be assessed individually and in groups.

CSU 399 INDUSTRIAL TRAINING
Pre-requisite: NIL

L	T	P	Cr
0	0	3	1

Each student is expected to undertake with help from the Department of Training and Placement, Internship in the field of Computer Science and Engineering by undergoing training of at least one-month duration in reputed industries/research centers in the country. The industrial training is expected to be undertaken during the semester recess. The student should write a final report on this training and should make an oral presentation before an evaluation committee.