NIT Calicut CSE Syllabus

NIT Calicut CSE Syllabus Part II

 

CS4024 INFORMATION THEORY

Brief Syllabus:
Source coding theorem – Shannon Fano, Huffman and Lempel Ziv codes – channel coding theorem for BSC and BEC –
capacity achieving codes for BEC – Cryptography – Perfect Secrecy – Shannon’s theorem.
Total Hours: 56 Hrs
CS4025 GRAPH THEORY AND COMBINATORICS
Pre-requisite: Nil
L T P C
4 0 0 4
Brief Syllabus:
Generating functions and applications – Ramsey theory – Lovasz local lemma and applications – matching and
connectivity in graphs – graph coloring.
Total Hours: 56 Hrs
CS4026 COMBINATORIAL ALGORITHMS
Pre-requisite: Nil
L T P C
3 0 2 4
Brief Syllabus:
Primal dual theory and applications to algorithm design, Applications to network flow, matching and other graph
problems. Approximation algorithms based on primal dual theory.
Total Hours: 70 Hrs
CS4027 TOPICS IN ALGORITHMS
Pre-requisite: Nil
L T P C
4 0 0 4
Brief Syllabus:
Introduction to randomization – discrete probability and randomized algorithms, Derandomization, probabilistic proofs,
probabilistic complexity classes, Kolmogorov complexity, Godel’s theorem
Total Hours: 56 Hrs
CS4028 QUANTUM COMPUTATION
Pre-requisite: Nil
L T P C
4 0 0 4
Brief Syllabus:
Quantum mechanics fundamentals, Models for Quantum Computation, Quantum algorithms, Speeding up the solution
of NP Complete problems, Quantum error correcting codes , Quantum cryptography , Quantum fault tolerance
Total Hours: 56 Hrs
CS4029 TOPICS IN THEORY OF COMPUTATION
Pre-requisite: CS 3001 Theory of Computation
L T P C
4 0 0 4
Brief Syllabus:
Recursion, Turing machines, Arithmetization, Turing degrees, incomparability, Kolgomorov Complexity, Scheme,
Term Rewriting and substitution models of computation.
Total Hours: 56 Hrs
CS4030 COMPUTATIONAL COMPLEXITY
Pre-requisite: Nil
L T P C
4 0 0 4
Brief Syllabus:
Elementary space and time complexity classes, inclusion theorems, randomization, circuit complexity classes, counting
classes, sublinear space, interactive proof systems.
Total Hours: 56 Hrs
CS4031 COMPUTATIOAL ALGEBRA
Pre-requisite: Nil
L T P C
3 0 2 4
Brief Syllabus:
Introduction to modular arithmetic and finite fields. Algorithms for modular arithmetic, primality testing, factorization
of polynomials over finite fields, Fourier analysis over finite fields and applications of algebraic algorithms to coding
theory and cryptography.
Total Hours: 70 Hrs
CS4032 COMPUTER ARCHITECTURE
Pre-requisite: Nil
L T P C
3 0 2 4
Brief Syllabus:
Quantitative Principles, Instruction level parallelism, Limits of instruction Level parallelism, Multicore Architecture,
Multiprocessor design, Memory consistency, memory subsystem design, Storage and reliability.
Total Hours: 70 Hrs
CS4033 DISTRIBUTED COMPUTING
Pre-requisite: CS2005 Data Structures and Algorithms
L T P C
3 0 2 4
Brief Syllabus:
Introduction to distributed systems, Logical clocks, Direct dependency clocks, Distributed Mutual Exclusion( DME)
using timestamps, token and Quorums, Drinking philosophers problem, Dining philosophers problem under heavy and
light load conditions, Leader election algorithms, Global state detection, Global predicates, Termination Detection,
Control of distributed computation, Self stabilization, knowledge and common knowledge, Distributed consensus,
Check pointing for Recovery
Total Hours: 70 Hrs
CS4034 MIDDLEWARE TECHNOLOGIES
Pre-requisite: CS4033 Distributed Computing
L T P C
3 0 2 4
Brief Syllabus:
Publish/Subscribe matching algorithm, content based models and matching, matching algorithms, distributed hash
tables (DHT), content based routing algorithms, engineering event based systems, Accessing publish/subscribe
functionality using APIs, Composite event detection, Topic based systems, Overlays, P2P systems, overlay routing
Total Hours: 70 Hrs
CS4035 COMPUTER SECURITY
Pre-requisite: Nil
L T P C
3 0 2 4
Brief Syllabus:
Operating Systems security – Access control models – BLP, Biba etc. SELinux overview. Software vulnerabilities –
Buffer and Stack overflow. Network Security – Security at transport, network and application layers – Various attacks –
Intrusion Detection Systems. Security in wireless domains – mobile devices security. Security in recent applications like
online banking and web services.
Total Hours: 70 Hrs
CS4036 ADVANCED DATABASE MANAGEMENT SYSTEMS
Pre-requisite: CS3002 Data Base Management Systems
L T P C
3 0 2 4
Brief Syllabus:
Distributed databases, Concurrency Control, Heterogeneity issues, Clustering, Indexing, Client Server Object Bases,
Cache Coherence, Parallel Databases, Query processing- Index based, Query optimization: cost estimation, Query
optimization algorithms, Online query processing and optimization, Recovery: Multi-level recovery, Shared disk
systems, Distributed systems 2PC, 3PC, Multidimensional K- Anonymity, Logical data models for spatial databases:
raster model (map algebra), vector model, Spatial query languages
Total Hours: 70 Hrs
CS4037 CLOUD COMPUTING
Pre-requisite: CS4033 Distributed Computing
L T P C
3 0 2 4
Brief Syllabus:
New Computing Paradigms & Services, Parallelization in Cloud Computing, Security for Cloud Computing, Cloud
Economics, Cloud Architecture, Types of Virtualization, Case studies- Xen, VMware, Eucalyptus, Amazon EC2,
Information retrieval through Map Reduce, Hadoop File System, GFS, Page Ranking using Map Reduce, Security
threats and solutions in clouds, mobile cloud computing, Case studies- Ajax, Hadoop.

Leave a Comment