NIT Calicut CSE Syllabus

NIT Calicut CSE Syllabus

 

CS3001 THEORY OF COMPUTATION

Pre-requisite: Nil
L T P C
4 0 0 4
Brief Syllabus:
Regular languages and finite automata, Context free languages, push down automata, Turing machines, Recursion
theorem, Undecidability, Complexity, Reductions and Completeness, Hierarchy theorems, Space Complexity, Logic.
Total Hours: 56 Hrs
CS3002 DATABASE MANAGEMENT SYSTEMS
Pre-requisite: Nil
L T P C
3 0 2 4
Brief Syllabus:
Database System Concepts and Architecture, Data Modeling using ER model, Relational data model, Relational algebra
and Relational calculus, SQL, Relational database design using ER to relational mapping, Database design theory and
Methodology, Functional Dependencies and Normal Forms, Relational Database Design algorithms, Data storage,
Indexing and physical design, Transaction processing concepts, Concurrency Control, Introduction to Database
Security.
Total Hours: 70 Hrs
CS3003 OPERATING SYSTEMS
Pre-requisite: Nil
L T P C
3 0 2 4
Brief Syllabus: Review of operating system strategies –processes and threads, Process management, inter-process
communication, deadlock, memory management- virtual memory, file systems protection and security, Virtual machine
monitor –issues and challenges
Total Hours: 70 Hrs
CS3004 SOFTWARE ENGINEERING
Pre-requisite: Nil
L T P C
3 0 2 4
Brief Syllabus:
Software Development Life Cycle – Detailed study of the phases involved – Requirements Engineering – formal
specification – Design – Abstraction, Partitioning and Patterns – Coding and Testing – Software Project Management –
Metrics for costing, scheduling and risk assessment.
Total Hours: 70 Hrs
CS3005 COMPILER DESIGN
Pre-requisite: CS2005 Data Structures and Algorithms
L T P C
3 0 2 4
Brief Syllabus:
Lexical analysis: Specification and recognition of tokens. Syntax analysis: Top-down parsing-Recursive descent and
Predictive Parsers. Bottom-up Parsing- LR (0), SLR, and LR (1) Parsers. Semantic analysis: Type systems, symbol
tables and type checking. Intermediate code generation: Intermediate representation-Three address code and
quadruples. Syntax-directed translation of declarations, assignments statements, conditional constructs and looping
constructs. Runtime Environments: Storage organization, activation records. Introduction to machine code generation
and code optimizations.
Total Hours: 70 Hrs
CS3006 COMPUTER NETWORKS
Pre-requisite: Nil
L T P C
3 0 2 4
Brief Syllabus:
Introduction- components and services, performance, layering. Application layer – protocols, pocket programming.
Transport layer – services, protocols. Network layer- services, routing, protocols, IPv6, multicasting. Link Layerservices,
error handling, protocols, devices, wireless networking. Multimedia networking- applications, protocols, QoS.
Security, Network management.
Total Hours: 70 Hrs
CS4001 ENVIRONMENTAL STUDIES
Pre-requisite: Nil
L T P C
3 0 0 3
Brief Syllabus:
Resources – conservation- ecosystems – biodiversity – pollution – population – human rights.
Total Hours: 42 Hrs
MS4003 ECONOMICS
Prerequisite: Nil
L T P C
3 0 0 3
Micro Economics, Demand and Supply Forces, Elasticity concepts, Short run and long run costs, Market Structure,
Pricing in different markets, Macro Economic AggregatesGross
Domestic Product, Inflation , Fiscal and Monetary
Policies ; Monetary system; Money Market, Capital market; Indian stock market; International trade Foreign
exchange marketBalance
of Payments (BOP) and Trade ,International Trade and development and role of international
institutions.
Total Hours: 42 hours
ME4104 PRINCIPLES OF MANAGEMENT
Prerequisite: Nil
Introduction to management theory, Characteristics, Systems approach, Task responsibilities and skill required, Process
of management, Planning, Organizing, Directing, Controlling, Decision making process, Project management,
Overview of operations management, Human resources management, Marketing management, Financial management.
Total Hours: 42 Hrs
CS4021 NUMBER THEORY AND CRYPTOGRAPHY
Pre-requisite: Nil
L T P C
3 0 2 4
Brief Syllabus:
Divisibility theory and congruence theory – Fermat’s little theorem, Euler’s generalization, Chinese remainder theorem
– Quadratic Reciprocity. Algorithmic number theory – Primality Testing.
Symmetric Key and Public Key cryptosystems – DES, D-H, and RSA. Protocols for authentication – Needham
Schroeder. Zero Knowledge Proof Systems – Fiat Shamir Identification Scheme.
Total Hours: 70 Hrs
CS4022 PRINCIPLES OF PROGRAMMING LANGUAGES
Pre-requisite: Nil
L T P C
3 0 2 4
Brief Syllabus:
Programming Languages: Concepts and Constructs. Untyped Arithmetic Expressions – Introduction, Semantics,
Evaluation. Untyped Lambda Calculus – Basics, Semantics. Programming in Lambda Calculus. Typed Arithmetic
Expressions – Types and Typing relations, Type Safety. Simply Typed Lambda Calculus – Function types, Typing
relations, Properties of typing. Extensions to Simply Typed Lambda Calculus.
Total Hours: 70 Hrs
CS4023 COMPUTATIONAL INETELLIGENCE
Pre-requisite: Nil
L T P C
3 0 2 4
Brief Syllabus:
Artificial Intelligence, Structures and Strategies for state space search, Knowledge representation, AI Representational
Schemes, Machine Learning, Planning, Genetic algorithm, Genetic Programming, Rule based Expert Systems,
Introduction to Natural Language Processing, Languages and Programming Techniques for AI.

Leave a Comment