Programme guide distance Education Programmes

Evaluation Scheme

1. 
   36% in each theory, practical, project, dissertation & internal assessment
   
2. 
   40% Aggregate marks to pass
   

Detailed Syllabus

SEMESTER - I

MCA1 - Computer Organisation and Architecture

Introduction: Basic structure of computers-Machine Instructions and Programs: Memory Locations and Addresses, Memory Operations, Instructions and Instruction Sequencing, Addressing Modes, Basic Input Output Operations, Subroutines.

Input/Output Organization: Accessing I/O Devices, Interrupts: Interrupt Handling, Handling Multiple Devices, Vectored Interrupts, Interrupt Nesting, Daisy Chaining, Direct Memory Access (DMA), Buses, Introduction to I/O Interfaces

The Main Memory: Memory Hierarchy, Main Memory, RAMROM, Cache Memory, Performance Considerations, Virtual Memory, Memory Management Requirements, Secondary Storage.

Central Processing - Arithmetic & Logic

Number Representation, Addition of Positive Numbers, Fast Adders, Signed Addition and Subtraction, Multiplication of Positive Numbers, Multiplication using Booth's Algorithm, Fast Multiplication, Floating Point Numbers and Operations.

The Processing

Basic Concepts, Instruction Execution Cycle, Sequencing of Control Signals, Hardwired Control, PLAs, Microprogrammed Control, Control Signals, Microinstructions, Microprogram Sequencing, Branch Address Modification, Pre Fetching of Microinstructions

Introduction to Parallel Processing: Parallel Processing, Principles and Classification, Pipelining, Arithmetic Pipeline, Instruction Pipeline, Vector Processing, Array Processors, Multiprocessors- Comparison of RISC and CISC.

MCA 2 - Mathematical Foundation

Sets: Basic Concepts. Relations: Binary relations, Equivalence relations and partition.

Functions: Different types of functions, Composition and inverse, Recursive functions, Mathematical induction.

Partial Ordering Relations Partially Ordered Set: Representation of Poset, Hasse diagram, LUB, GLB, Well ordered set, Meet and join of elements.

Lattices as Partially Ordered Sets: Definition and basic properties, Distributive lattices and complimented lattices.

Boolean Algebra: Definitions, Basic theorems and postulates.

Basic Concepts of Automata Theory: Alphabets, strings, power of , languages, DFA, NFA and their representations.

Logic: Mathematical logic, Logical operators, Conjunction, Disjunction, Negation, Conditional and biconditional, Truth tables, Equivalence formula, tautology, Inference theory, Validity by truth table, Rules of inference, Predicate calculus.

Graph Theory: Basic terminology, Different types of graphs – directed and undirected, Simple, Multi, Pseudo, Complete, Regular, Bipartite, incidence and degree, Pendant and isolated vertex and Null graph, isomorphism, Sub graphs, Walk, Path and circuit, Connected and disconnected graphs and components, Euler graphs, Fleury’s algorithm, Hamiltonian circuits and paths, Travelling salesman problem, Matrix representation of graphs, Incidence and adjacency matrices.

Trees and Planar Graph Trees: Basic properties, Rooted and binary trees, Path length, Spanning trees, Prims and Kurskals algorithm.

Planar Graphs: Kuratowski’s two graphs and Euler’s formula – Statement and corollary, Detection of planarity.

MCA 3 - Programming in C

Introduction to programming: Programming languages, Compiler, interpreter, loader and linker, program execution, fourth generation language, fifth generation language, structured programming concept, algorithm and flowchart.

Introduction to C Language: The C character set, identifiers and keywords, data types, how floats and doubles are stored, constants, variables and arrays, declarations, expressions, statements, Lvalues and Rvalues, type conversion, symbolic constants.

Operators and expressions: Arithmetic operators, unary operator, relational and logical operator, assignment operators, the conditional operator, , type conversion, Library function.

Data input and output: Single character input, single character output, scanf, printf, puts gets functions, interactive programming.

Control statement: Branching: if else statement, Looping, nested control structure, switch statement, break statement, continue statement, comma operator, goto statement.

Functions: Overview, function prototypes, passing arguments to a function, recursion.

Program structure: Storage classes, automatic variables, external variables, static variables, multifile program,

Arrays: Defining an array, passing array to functions, multidimensional arrays, strings: one dimensional character array, array of strings.

Pointers: Fundamentals, void pointer, null pointer, passing pointers to a function, pointers and one dimensional arrays, dynamic memory allocation, operation on pointers, pointers and multidimensional arrays, array of pointers, pointer to an array, pointers and strings, structure pointer, pointers to function, pointers and variable length arguments list, passing functions to other functions, offsetting a pointer.

Structures and unions: Defining a structure, processing a structure, user defined data types, structure and pointers, passing structure tofunction, self-referential structures, and union.

Data files: Why files, opening and closing a data file, reading and writing a data file, processing a data file, unformatted data file, concept of binary file.

Low level programming: Register variable, bitwise operations, bit fields.

Addition a features of C: Enumeration, Command line parameters, macros, the c Preprocessor.