COPD

Unit 1 – Hypothetical
Machine
 Simple Computer
 Instruction Format
 Types of Instruction
 Addressing Modes
Unit 2 – CPU
 Fundamentals of CPU
 Fetching of Instruction
 I/O organization & devices
 Instruction Cycle
 Interrupts & Interrupt Handling
Unit 3 – Storage of Digital
Info
 Types of Storage devices
 Storage Hierarchy
 Different Access Method
Unit 4 – Memory
Organization
 RAM & ROM
 Main Memory
 Cache Memory
 Virtual Memory
 Read/Write Operation
Unit 5 – Memory Loaders
 Definition Functions
 General Loaders
 Absolute Loader
 Sub-routine Linkage
 Linkage Editor
 Concept of Reallocation
 Direct Linking Loader (DLL)
 Automatic Library Search
 Bootstrap Loader
 Concept of Linking
 ● Keyboard Switches
● Keyboard Org
Unit 6 – Peripheral Devices
● Keyboard ● The 3 types of Keyboards
● Types of Keys
● Mouse
● Types of Mouses
Unit 7 – Motherboard
Components
● CPU
● Co-Processor
● CMOS Memory
● BIOS
● DMA
● Timing Circuits
● Chipsets
● RAM & ROM
● Memory
Unit 8 – Image Formation
Method
● Fully Font Character
Printer
● Bit-Image Printer
● Impact Printer
● Non-Impact Printer
● Dot-Matrix Printer
● Inkjet Printer
● Laser Printer
● How do printer’s work?

Reference Books: M. Morris Mano – Computer System Architecture

DBMS
Unit 1 – Overview of DBMS Unit 4 – Types of
● DBMS Concepts Constraints
● Functions of DBMS ● Data Constraints
● Advantages of DBMS ● I/O Constraints
● Database Users ● Business Constraints
● Functions of DBA ● NULL values Concepts
● Architecture of DBMS ● Not NULL
● DBMS Instances ● Security
using SQLManagement
Unit 2 – Data Models
● Granting & Revoking
Permission
● Types of Data Models
Unit 5 – Operations &
● ER Relationship Models
Functions
● Network Models
● Computation
Data on Table to
● Structure of Relational
Databases ● Oracle Operation
● Keys ● Range Searching
● Sub Keys ● Pattern Matching
● Primary Keys & ● Predicates
Secondary Keys
● Oracle Functions
● DBMS vs RDBMS
● Dual Tables
● Normalization
Types & Its
Unit 6 – Interactive SQL
Unit 3 – SQL ● Group
Clause By & Having
● Advantages of SQL
● Sub Queries
● Tools for SQL
● Joints
● SQL Delimiters
● Types of Joints
● Components of SQL
● Index Views
● Data
(DDL)Definition Language ● Sequences
● Data Manipulation ● Transaction
Statements Control
Language (DML)
● Data
(DCL)Control Language
● Data
(DQL)Query Language
● Table Fundamentals
● Queries SQL

Reference Books: An Intro to Database System by C. J. Date

● Memory Allocation in C
● Algorithm
● DS Operations
Unit 2 – Stacks
● Introduction
● Stack Implementation
● Operation on Stack
● Stack Terminology
● Algorithm for PUSH/POP
● Applications of Stack
● Algorithm
Infix for Converting

Expression to Postfix
Form
● Algorithm
Infix for Converting

Expression to Prefix
Form
● Algorithm
Postfix to Evaluate a

Expression
Unit 3 – Queues
● Introduction
● Implementation of
Queue
● Operation on Queue
● Algorithms
and for Insertion

Deletion
Arrays) Queue (Using
● Limitations
Queues of Simple

● A Circular Queue
● Double
(deque)Ended Queues
● Priority Queues
● Applications of Queues
● Stacks vs Queues
 in 1D Array
Unit 4 – Trees
● Traversing of an array
● Introduction
● Library
string Functions for
● Tree
● Tree Terminology Manipulations
● Binary Tree Unit 6 – Linked List
● Binary Tree ● Types of Linked List
Representation
● Advantages of Linked List
● Creation of Binary Tree
● Operations on Linked List
● Operation on Binary Tree
Unit 7 – Searching, Sorting
● Techniques of converting
an & Hashing
Expression to binary tree ● Linear Search
● Binary Search Tree ● Binary Search
Unit 5 – Arrays & Strings ● Bubble Sort
● 1D Array ● Selection Sort
● Accessing 1D Array ● Insertion Sort
● Implementation
Array of 1D ● Quick Sort
● Bucket Sort
● Insertion/Deletion
elements of n
● Merge Sort
● Basic Intro to Hashing

Reference Books : Data Structure Through C (A Practical Approach) By G.S. Baluja

NM & GT
  Simpson’s 3/8th Rule
Unit 1.1 – Approximations
and Errors in Computation
Unit 2.1 – Intro to Graph
 Introduction
Theory
 Accuracy of numbers
 What is Graph?
 Errors
 Application of Graph
 Useful
errors rules for estimating  Finite & Infinite Graph
 Error propagation  Incidence & Degree
 Error in approximation of
function  Isolated Vertex, Pendent
Vertex, Null
 Error in a series approximation Graph
 Order of approximation  A brief history of Graph Theory
 Growth of error Unit 2.2 – Paths & Circuits
Unit 1.2 – Methods to Find  Isomorphism
Roots
 Sub-graph
 Bisection Method  Walks, Path & Circuits
 Regula-Falsi Method  Connected Graph,
Disconnected Graph
 Newton-Raphson Method
& Components
 Secant Method
Unit 1.3 – Solution of  Operation on Graphs
Simultaneous Algebraic  Euler Graphs
Equations  Hamilton Paths & Circuits
 Gauss Elimination Method Unit 2.3 – Cut sets & Cut-
Vertices
 Gauss-Jordan Method
 Jacobi’s iteration method  Cut sets
 Gauss-Seidal iteration method  Connectivity & Separability
Unit 1.4 – Interpolation  Definition of Blocks
Unit 2.4 – Cut sets & Cut-
 Newton’s Forward
Interpolation Vertices
Formula  Planar & Non-Planar Graph
 Newton’s Backward  Detection
Interpolation Eliminationof Planarity by
Formula  Kuratowski’s Two Graph
 Lagrange’s
Formula Interpolation Unit 2.5 – Miscellaneous
 Newton’s
Formula Divided Difference
Unit 1.5 – Numerical
Integration
 Trapezoidal Rule
 Simpson’s 1/3rd Rule
  Bipartite Graph
 Complete Bipartite Graph
 Matching
 Line Graph
 Chordal Graph
 Colouring
 Chromatic Number

Reference Books:
1. Numerical Methods in Engineering by B. S. Grewal
2. Numerical Methods By E. Bal Guruswamy
3. Intro To Methods of Numerical Analysis by S. S. Sastry
4. Graph Theory with Applications to Engineering & Computer Science by
Narsingh Deo
5. Graph Theory Notes (Incomplete)

C++
Unit 1 – Introduction to C++
Unit 2 – Function, Classes & Objects
Unit 3 – Constructor & Destructor
Unit 4 – Operator Overloading & Pointers
Unit 5 – Polymorphism & Inheritance
Unit 6 – Managing I/O Operator
Unit 7 – Working with File

Reference Book: Bal Guruswamy Object Oriented Programming with C++ 4E