Computer Fundamentals and C Programming

1. Introduction to C Programming:
   • History of C,
   • Structure of C programme.
   • The C character set, Contents, Variables and keywords,
   • Types of contents and variables.
2. C Instructions diocese
   • Type declaration and arithmetic instructions,
   • Integer and float conversions.
   • Type conversion in assignment,
   • Operators in C.
   • Hierarchy of operators,
   • control instructions,
   • Input-Output statements in C (Formatted and Unformatted)
3. Control Structures
   • Decision control structures,
   • Logical operators,
   • conditional opcrator and relational operators,
   • Loop control structures while, do-while, for loop, Break statement, Continue statement,
   • switch-case control structure,
   • go to statement.
4. Arrays
   • One dimensional and multidimensional array,
   • declaration, initialization and array manipulations,
   • sorting (Bubble sort)
   • Strings-Basic concepts,
   • Library functions.
5. Functions
   • Definition, function definition and prototyping,
   • types of functions,
   • types of arguments,
   • recursions,
   • passing arrays to functions,
   • storage class in C-automatic, register, external and static variables.
6. Pointers
   • Definition,
   • notation,
   • pointers and arrays,
   • arrays of pointers and functions – call by value and call by reference, pointers to pointers.
7. Structure and Unions
   • Definitions,
   • declaration,
   • accessing structure elements,
   • arrays of structure in a structure,
   • pointers and structures,
   • unions – definition, declaration,
   • accessing union elements,
   • typed of Enum Bit fields.
8. Bitwise Operators
   • Bitwise AND,
   • OR,
   • Exclusive OR,
   • Compliment,
   • right shift and left shift operators
9. C Preprocessor
   • Types of C Preprocessor directives,
   • macros,
   • file inclusion.
10. Files 
    • File operating modes,
    • Text and binary files,
    • High level and low level operations on file,
    • command line arguments

Data Structures

1. Introduction to data Structures
   • Definition. Classification of data structures.
   • Operations on data structures,
   • Introduction to Time and space Complexity.
2. Primitive Data Structures
   • Integer,
   • Character,
   • float,
   • strings – memory representation and primitive operations,
   • String manipulation using pointers.
3. Arrays
   • Storage Representation for ID and 2D arrays,
   • Insertion and deletion on ID arrays,
   • advantages and disadvantages of arrays.
4. Linked Lists
   • Pointers,
   • Dynamic Memory Allocation,
   • singly Linked Lists,
   • Operations on linked lists,
   • Insertion and deletion of a node,
   • Introduction to circularly linked lists and doubly linked lists.
5. Stacks
   • Concepts, Operations, sequential and linked implementation,
   • Application of stacks,
   • recursion,
   • tower of Hanoi,
   • infix to postix conversion,
   • Evaluation of Postfix Expressions.
6. Queues
   • Concepts, operations, sequential and linked implementation,
   • Circular queues, Priority queues and Dequeues (Introductory concepts),
   • Application of queues.
7. Trees
   • Definitions and concepts Binary trees,
   • Sequential and Linked Representation of Binary Trees,
   • Insertion and deletion on binary trees,
   • Binary Trees Traversal.
8. Graphs
   • Concepts, Sequential and linked representation of Graphs,
   • BFS and DFS Traversal.
9. Searching and Sorting
   • Linear and Binary search,
   • Selection sort,
   • Insertion sort,
   • Quick sort,
   • Merge sort.

Operating System

• History of Operating System,
• Simple Batch Systems, and multi programmed Batched Systems,
• Time Sharing Systems,
• Personal Computer Systems,
• Distributed Systems and Real Time Systems,
• Operating System Structures- Command Interpreter System,
• Operating System Services,
• System Calls,
• System Programs.

Process Management

• Process Concept,
• Process control Block,
• Process Scheduling,
• CPU Scheduling – Basic Concepts,
• Scheduling Algorithms FIFO, RR, SJF,
• Multi-level, Multi-level feedback.

Storage Management

• Basic Concepts,
• Logical and Physical Address Space,
• Swapping,
• Contiguous Allocation,
• Paging,
• Segmentation,
• Virtual Memory
• Demand Paging,
• Page Replacement,
• Page Replacement Algorithma,
• Allocation of Frames,
• Thrashing and Demand Segmentation.

File System

• File Concept,
• Access Methods,
• Directory Structure,
• Protection,
• File system Structure,
• Allocation Methods,
• Free-Space Management.

Input/Output System

• Overview of I/O systems,
• I/O interfaces,
• Secondary storage structure – Disk Structure, Disk Scheduling.
• OOPS using C++
• Data Base Management System
• Software Engineering,
• System Software Internet Technology
• Basic Java and UNIX Programming.
• Internet Lab
• Computer Graphics,
• Computer Networks.