Programme guide distance Education Programmes

MCA 4 - Operating System

Evolution of Operating Systems: Serial processing, batch processing, multiprogramming, types of operating systems, batchmultiprogramming, time sharing, real time and distributed operating systems.

File Management: File structure, file types, file access, file attributes, file operations, directories, flat directory systems, hierarchical directory systems, file system implementation-allocation methods-contiguous allocation, linked allocation, indexed allocation.

Processor Management: Job and process concept, concurrent processes, operating system view of processes, process-state transition diagram, PCB (Process control block), threads, process scheduling, operations on processes, operating system services.

Process Scheduling: Types of schedulers, scheduling and performance criteria, scheduling algorithms, multiple processor scheduling

Inter-process Synchronization and Communication: Concurrent processes, precedence graph-hierarchy of process, need for inter process synchronization, critical section problem, mutual exclusionmutual exclusion algorithms, semaphores-definition busy wait implementation, hardware implementation of semaphores-test and set instruction, monitors, inter process communication using messages.

Memory Management: Preliminaries, address binding, dynamic linking and loading, overlays, logical versus physical address space, swapping, contiguous allocation paging-principles of page allocation, structure of page table- hardware support, multi level paging, hierarchical paging, inverted page table, shared pages.

Segmentation: Principles of operation, hardware, implementation of segment table, protection and sharing, fragmentation, segmentation with paging.

Virtual Memory: Demand paging, performance, page replacementpage replacement algorithms, thrashing, segmentation and paging implementation of virtual memory, hierarchical address translation tables and MMUS.

Deadlocks: Definition, deadlock characterization, resource allocation graph, methods for handling deadlocks, deadlock prevention, deadlock avoidance, safe state, resource allocation graph algorithm, Banker’s algorithm, deadlock detection, recovery from deadlock, combined approach to deadlock handling.

Device Management: Disk structure, Disk scheduling-FCFSSSTF- C-Scan-Look, Disk management, Swap space management, Disk Reliability, Protection-Goals of Protection, Policies and Mechanisms-Access Matrix and its Implementations, Dynamic Protection-Language base Protection. Security-Security. .

MCA 5 - Accounting and Financial Management

Accounting: Meaning and definition, Accounting concepts and conventions, Basic accounting terms, Rules for debit and credit, Recording of transactions- Journal, Ledger, Trial balance, Preparation of final accounts, Trading and profit and loss accounts, Balance sheet, Classification of assets and liabilities, Final accounts with adjustments, Outstanding expenses, Prepaid expenses, Income received in advance and accrued incomes, Depreciation, Bad debts and provision for bad and doubtful debts, Interest on capital, Interest on drawings and closing stock.

Analysis to financial statements, Ratio analysis, Advantages and limitations of ratio analysis, Liquidity ratios. Long term solvency ratios, Profitability ratios, Activity ratios.

Capital Budgeting: Need for capital resources allocation, Investment criteria decisions, Pay back period method, Average rate of return method, Internal rate of return method, Net present value method and profitability index.

Budgetary Control: Meaning and need for budgets, Budgetary control, Objectives of budgetary control, Advantages and limitations of budgetary control system, Different types of budgets, Sales budget, Production budget, Cash budget, Fixed budget and flexible budgets only.

Computer Based Accounting Package: TALLY, Company information, Accounts information, Ledger, Account Group, Voucher entry, Profit and loss account, Balance sheet, Ratio analysis, Cash and fund flow.

SEMESTER - II

MCA 6 - System Analysis and Design

Overview of system analysis and design. Business systems concepts, system development life cycle, project selection, feasibility, analysis,design, implementation, testing and evaluation.

Project Selection: Source of Project requests, managing project review and selection, preliminary investigation.

Feasibility Study: Technical and economical feasibility, cost and benefit analysis System requirement specification and Analysis: Fact finding techniques, Data flow diagrams, data dictionaries, process organisation and interactions, Decision analysis, decision trees and tables.

Detailed design modularisation, modula specification, file design, system development involving data bases.

System Control and Quality: Assurance4-Design objectives reliability and maintenance, software design and documentation tools top down , bottom up and variants, UNITs and intergration testing, testing practices and plans. System Controls, Audit trails.

System Administration and Training: conversion, and operation plans.

Hardware and Software Selection: Hardware acquisition, memory process, peripherals, bench marking, vendor selection, software selectionoperating system languages, language process, performance and acceptance criteria.

MCA 7 - Data Structure and Application

Introduction to Data structure, Primitive and composite data types, Abstract Data Type Time and space complexity of algorithms,

Concept of , Big-O, Small-o and Big-Omega notations.

Linear List, Arrays, Stacks, Queue, Circular Queue, Priority Queue. Singly Linked List, Doubly Linked and Circular Linked List.

Introduction to Trees, Properties of Trees, Binary Trees, Extended binary trees, Complete binary trees, Binary search trees, Weight balanced and Height balanced trees, AVL trees, Threaded Binary trees, B-Trees, Heap.

Introduction to graph, properties of graphs, connected graph, Sequential Representation of Graphs: Adjacency Matrix, Path matrix, Warshall’s algorithm, Linked Representation of Graphs: Adjacency list, Graph Traversal: Depth-first and Breadth-first. Spanning trees, Minimum Spanning tree, Prim's and Kruskal's algorithms.

Selection sort, Insertion sort, Bubble sort, Radix sort, Quick sort, heap sort, merge sort. Searching Techniques: Binary search, Linear search, Hashing.