NIT Calicut MCA Syllabus

Hey , I am a student of the MCA course of the NIT Calicut , I requires syllabus of the course . will you please provide here brief syllabus of the MCA course of the NIT Calicut?

[Arun Vats]

As you want I am here providing you brief syllabus of the MCA course of the NIT Calicut.

Syllabus :

LOGIC DESIGN
Number systems and codes, Boolean algebra, K map: prime cubes, minimum sum of products and
product of sums, Quine-McClusky algorithm, prime implicant chart, cyclic prime implicant chart,
Petrick’s Method, Combinational Logic: analysis and design of combinational logic circuits, parallel
adders and look-ahead adders, comparators, decoders and encoders, code conversion, multiplexers
and demultiplexers, parity generators and checkers, Programmable Logic Devices, PLA folding,
design for testability. Introduction to sequential circuits, memory elements, latches, Flip-flops, analysis
and design of sequential circuits, Mealy and Moore models, registers, shift registers, counters.



INTRODUCTION TO PROGRAMMING
Data types, operators and expressions- Input output streams-Control statements.
Functions and program structures- Arrays- Pointers and strings -Structures, union and bit fields.
Classes and objects- Special member functions- Single and multiple inheritances - Overloading
functions and operators
Polymorphism and virtual functions- Templates, namespaces and exception handling- Data file
operations-Introduction of standard template library (STL)



DISCRETE MATHEMATICS
Total Hours: 42 hours
Propositional Calculus- logical equivalence, logical arguments, consistency completeness and
independence, Predicate Calculus- predicates, quantifiers, arguments, theory of inference, resolution
algorithm. Relations and functions, Boolean Algebra, Semi groups, monoids, groups and subgroups,
homomorphism, Rings, Integral domains, fields, ideals and quotient rings, Euclidian domain,
polynomial rings, division algorithm, field factorization, unique factorization, field extensions


PROFESSIONAL COMMUNICATION
The syllabus is divided into four modules. The first module is verbal communication which includes
topics like received pronunciation, presentation skills and conferences, soft skills, body language and
personal interviews. Reading comprehension is the second module, wherein prediction techniques,
inferential comprehension and uses and interpretation of visuals in technical writing will be dealt with.
In the third and fourth modules, the focus will be on written communication, where the students will
learn to prepare different types of reports, advertisement, agenda, resume letters, paragraphs, articles,
research papers and essays

CS2391 INTRODUCTORY PROGRAMMING LABORATORY

Programming assignments to emphasize the concepts and use- iterative constructs, subroutines, linked
list, pointers, structures, union, creation of objects, inheritance, polymorphism, templates etc..

CS2004 COMPUTER ORGANIZATION

Measuring performance-evaluating, comparing and summarizing performance, Computer arithmetic,
integer and floating point arithmetic, processor design, pipelined processors, memory hierarchy, caches
and virtual memory, Input/output design.

CS2005 DATA STRUCTURES AND ALGORITHMS

Searching and sorting algorithms, dynamic memory and recursion, lists, stacks and queues, binary
search trees, hashing, B Trees, Graph search, Minimum Spanning Tree and shortest path algorithms.

CS2094 DATA STRUCTURES LABORATORY

Implementation of standard searching, sorting algorithms, tree, expression evaluation and graph
algorithms.

CS3002 DATABASE MANAGEMENT SYSTEMS

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.

CS3003 OPERATING SYSTEMS

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

CS3004 SOFTWARE ENGINEERING

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.

CS3006 COMPUTER NETWORKS

Introduction- components and services, performance, layering. Application layer - protocols, pocket
programming. Transport layer – services, protocols. Network layer- services, routing, protocols, IPv6,
multicasting. Link Layer- services, error handling, protocols, devices, wireless networking. Multimedia
networking- applications, protocols, QoS. Security, Network management.

CS3301 OBJECT ORIENTED PROGRAMMING

Introduction to Object Oriented Paradigm – Concept of Abstraction – Classes as facilitating data and
procedural abstraction - Encapsulation. Concepts of Inheritance, Overloading, and Polymorphism.
Memory Management. Examples from any object oriented language. Object Oriented Design – UML.
Introduction to OCL. Implementation approaches.

ME4104 PRINCIPLES OF MANAGEMENT

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.

CS4021 NUMBER THEORY AND CRYPTOGRAPHY

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

CS4022 PRINCIPLES OF PROGRAMMING LANGUAGES

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.


CS4023 COMPUTATIONAL INTELLIGENCE

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.

CS4024 INFORMATION THEORY

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.

CS4025 GRAPH THEORY AND COMBINATORICS

Generating functions and applications - Ramsey theory - Lovasz local lemma and applications -
matching and connectivity in graphs - graph coloring.

CS4026 COMBINATORIAL ALGORITHMS

Primal dual theory and applications to algorithm design, Applications to network flow, matching and
other graph problems. Approximation algorithms based on primal dual theory.

CS4027 TOPICS IN ALGORITHMS

Introduction to randomization - discrete probability and randomized algorithms, Derandomization,
probabilistic proofs, probabilistic complexity classes, Kolmogorov complexity, Godel’s theorem

CS4028 QUANTUM COMPUTATION

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

CS4029 TOPICS IN THEORY OF COMPUTATION
Pre-requisite: CS 3001 Theory of Computation

Recursion, Turing machines, Arithmetization, Turing degrees, incomparability, Kolgomorov
Complexity, Scheme, Term Rewriting and substitution models of computation.

CS4030 COMPUTATIONAL COMPLEXITY

Elementary space and time complexity classes, inclusion theorems, randomization, circuit complexity
classes, counting classes, sublinear space, interactive proof systems.

CS4031 COMPUTATIONAL ALGEBRA

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.

CS4032 COMPUTER ARCHITECTURE

Quantitative Principles, Instruction level parallelism, Limits of instruction Level parallelism, Multicore
Architecture, Multiprocessor design, Memory consistency, memory subsystem design, Storage and
reliability.

CS4033 DISTRIBUTED COMPUTING
Pre-requisite: CS 2005 Data Structures and Algorithms

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, Checkpointing for Recovery.

here is the attachment .