Maximum

Easy Level
Section Regularly Covered Topics Weightage Difficult Level Topics
Topics
Topics

Numerical ability; Percentages; Percentages;

Sentence Profit, Loss, and
General Profit, Loss, and Discount; Profit, Loss, and
completion; Discount; Data
Aptitude Data interpretation; Sentence Discount; Data
Word analogies interpretation
completion; Word analogies interpretation

Matrix determinants and Limits, continuity

eigenvalues; Limits, continuity and
and differentiability; Mean differentiability; Probability; Mean
value theorem; Maxima and Poisson and value theorem;
Engineering Linear algebra;
minima; Poisson and binomial binomial Maxima and minima;
Mathematics Graph theory
distributions; Mean, median, distributions; Poisson and binomial
mode and standard deviation; Conditional distributions
Conditional probability and probability and
Bayes theorem Bayes theorem

Sets, relations, functions;

Predicate logic;
Propositional logic and Propositional Functions; Predicate
Discrete Recurrence
predicate logic; Recurrence logic; Sets, logic; Generating
Mathematics Relation; Graph
Relation; Generating functions; relations functions
Connectivity
Graph connectivity

Array; Recursive programs;

Linked List; Stack & Queue; Array; Stack and Recursive functions
Programming Stacks and
Expression evaluation; Trees Queue; Linked and pointers; Trees
and Data Queues; Array;
and graphs; Tree traversal List; Recursive and Graph; Binary
Structures Linked List
methods; Binary search tree; Programs search tree; AVL tree
AVL tree; Hash functions

Algorithm Analysis; Asymptotic

Notation; Merge Sort, Quick Merge Sort, Quick
Sort; Huffman Coding; Prims & Sort; Divide and
Kruskal Method; Dijkstra Searching and conquer; Greedy
Sorting
algorithm; Bellman-Ford; sorting algorithms; Huffman
algorithms;
Algorithms Longest common algorithms; Coding; Prims &
Graph Algorithm;
subsequence; Matrix Chain Asymptotic Kruskal Method;
Greedy Algorithm
Multiplication; Sum of Subsets; Notation Dijkstra algorithm;
DFS, BFS; Heap trees; Sorting Bellman-Ford; Longest
Algorithm; Graph Algo; Greedy common subsequence
Algorithm

CPU Scheduling Algorithms; CPU Scheduling;

CPU Critical section
System Calls; Process State Deadlock;
Scheduling; Problem; Semaphore;
transition Diagram; Critical Synchronization
Process State Paging and
Operating section Problem; Deadlock; mechanism;
transition Segmentation;
Systems Synchronization mechanism; Page
Diagram; Page Deadlock;
IPC Problems; Paging; replacement
replacement; Synchronization
Semaphores; Page algorithms;
System Calls mechanism
replacement algorithms Paging
 ER Model; Relational Model;
FDs and Relational
FD, Closure of FD, Minimal
Normalization; algebra; FD, Closure of FD,
cover; Normalization;
Databases Relational Transactions; Minimal Cover;
Serializable Schedule; 2 Phase
algebra; SQL SQL; ER- Normalization
Locking Protocol; Relational
queries diagrams
Algebra; SQL

OSI Model; IP Addressing;

Subnetting and Supernetting;
Error Correction: CRC, IP Addressing;
Hamming Code; Flow Control: Subnetting and IP addressing; Flow Control: Stop &
Stop & Wait, GB-N, SR; IPv4 supernetting; Aloha, Wait, GB-N, SR; IPv4
Computer
Header; TCP and UDP; Error Control; CSMA/CD, Header; TCP and
Networks
Congestion Control in TCP; Flow Control; TDMA; CRC, UDP; Routing
Aloha, CSMA/CD, TDMA; Routing Protocol; Hamming Code Protocol: DVR
Routing Protocol: DVR; TCP
Switching; Application
protocols
Instruction
Instruction Cycle; Cycle;
Instruction Cycle; System Bus; Cache organization;
Addressing Addressing
Computer Org. Instruction Format; Addressing Pipelining; I/O Data
Mode; Memory modes and
and modes; Control Unit Design; transfer; Control Unit
Organization; Machine
Architecture Memory Organization; Cache Design; Memory
Cache cycles;
organization; Pipelining Organization
organization Instruction
Format

DFA, NFA and Regular

Regular
expression; PDA; Turing Regular
expressions;
Theory of Machine; Closure properties languages; DFA Undecidability; PDA;
DFA, NFA;
Computation and Undecidability; Problems & NFA; Turing Machine
Closure
related to language Undecidability
properties
acceptance

Lexical
Analysis;
Lexical Analysis; Syntax Intermediate
Lexical Analysis;
Compiler Analysis; types of Parser; code Syntax Analysis; LL(1)
Syntax Analysis-
Design Parse trees; LL(1) and LR generation; and LR parsers
Parsing
parsers Syntax directed
translations
(SDTs)

Boolean Algebra; K-Map; SOP

and POS form; Combinational K-Map; SOP and Minimization;
circuits: Multiplexer, decoder POS form; K-Map; Sequential circuits;
Digital Logic
and demultiplexer; Half adder, Combinational Combinational Half adder, Full adder
Full adder; Minimization; circuits circuits
Counters