Section: General Aptitude - Numerical ability
- Percentages
- Profit, Loss, and Discount
- Data interpretation
- Sentence completion
- Word analogies
| - Percentages
- Profit, Loss, and Discount
- Data interpretation
| - Sentence completion
- Word analogies
| - Profit, Loss, and Discount
- Data interpretation
|
Section: Engineering Mathematics - Matrix determinants and eigenvalues
- Limits, continuity and differentiability
- Mean value theorem
- Maxima and minima
- Poisson and binomial distributions
- Mean, median, mode and standard deviation
- Conditional probability and Bayes theorem
| - Limits, continuity and differentiability
- Poisson and binomial distributions
- Conditional probability and Bayes theorem
| - Linear algebra
- Graph theory
| - Probability
- Mean value theorem
- Maxima and minima
- Poisson and binomial distributions
|
Section: Discrete Mathematics - Sets, relations, functions
- Propositional logic and predicate logic
- Recurrence Relation
- Generating functions
- Graph connectivity
| - Predicate logic
- Recurrence Relation
- Graph Connectivity
| - Propositional logic
- Sets, relations
| - Functions
- Predicate logic
- Generating functions
|
Section: Programming and Data Structures - Array
- Recursive programs
- Linked List
- Stack & Queue
- Expression evaluation
- Trees and graphs
- Tree traversal methods
- Binary search tree
- AVL tree
- Hash functions
| - Array
- Stack and Queue
- Linked List
- Recursive Programs
| - Stacks and Queues
- ArrayLinked List
| - Recursive functions, and pointers
- Trees and Graph
- Binary search tree
- AVL tree
|
Section: Algorithms - Algorithm Analysis
- Asymptotic Notation
- Merge Sort, Quick Sort
- Huffman Coding
- Prims & Kruskal Method
- Dijkastra algorithm
- Bellman-Ford
- Longest comman subsequence
- Matrix Chain Multiplication
- Sum of Subsets
- DFS, BFS
- Heap trees
- Sorting Algorithm
- Graph Algorithms
| - Sorting algorithms
- Graph Algorithm
- Greedy Algorithm
| - Searching and sorting algorithms
- Asymptotic Notation
| - Merge Sort, Quick Short
- Divide and conquer
- Greedy algorithms
- Huffman Coding
- Prims & Kruskal Method
- Dijkastra algorithm
- Bellman-Ford
- Longest comman subsequence
|
Section: Operating Systems - CPU Scheduling Algorithms
- System Calls
- Process State transition Diagram
- Critical section Problem
- Deadlock
- Synchronization mechanism
- IPC Problems
- Paging
- Semaphores
- Page replacement algorithms
| - CPU Scheduling
- Deadlock
- Synchronization mechanism
- Page replacement algorithms
- Paging
| - CPU Scheduling
- Process State transition Diagram
- Page replacement
- System Calls
| - Critical section Problem
- Semaphore
- Paging and Segmentation
- Deadlock
- Synchronization mechanism
|
Section: Databases - ER Model
- Relational Model
- FD, Clouser of FD, Minimal cover
- Normalization
- Serializable Schedule
- 2 Phase Locking Protocol
- Relational Algebra
- SQL
| - FDs and Normalization
- Relational algebra
- SQL queries
| - Relational algebra
- Transactions
- SQL
- ER-diagrams
| - FD, Clouser of FD, Minimal Cover
- Normalization
|
Section: Computer Networks - OSI Model
- IP Addressing
- Subnetting and Supernetting
- Error Correction: CRC,Hamming Code
- Flow Control:Stop & Wait, GB-N, SR
- IPv4 Header
- TCP and UDP
- Congestion Control in TCP
- Alloha,CSMA/CD, TDMA
- Routing Protocol:DVR
- Switching
- Application protocols
| - IP Addressing
- Subnetting and Supernetting
- Error Control
- Flow Control
- Routing Protocol
- TCP
| - IP addressing
- Alloha,CSMA/CD, TDMA
- CRC,Hamming Code
| - Flow Control:Stop & Wait, GB-N, SR
- IPv4 Header
- TCP and UDP
- Routing Protocol:DVR
|
Section: Computer Organization and Architecture - Instruction Cycle
- System Bus
- Instruction Format
- Addressing modes
- Control Unit Design
- Memory Organization
- Cache organization
- Pipelining
| - Instruction Cycle
- Addressing Mode
- Memory Organization
- Cache organization
| - Instruction Cycle
- Addressing modes and Machine cycles
- Instruction Format
| - Cache organization
- Pipelining
- I/O Data transfer
- Control Unit Design
- Memory Organization
|
Section: Theory of Computation - DFA, NFA and Regular expression
- PDA
- Turing Machine
- Closure properties and Undecidability
- Problems related to language acceptance
| - Regular languages
- DFA & NFA
- Undecidability
| - Regular expressions
- DFA, NFA
- Closure properties
| - Undecidability
- PDA
- Turing Machine
|
Section: Compiler Design - Lexical Analysis
- Syntax Analysis
- types of Parser
- Parse trees.
- LL(1) and LR parsers
| - Lexical Analysis
- Syntax Analysis-Parsing
| - Lexical Analysis
- Intermediate code generation
- Syntax directed translations(SDTs)
| - Syntax Analysis
- LL(1) and LR parsers
|
Section: Digital Logic - Boolean Algebra
- K-Map
- SOP and POS form
- Combinational circuits: Multiplexer, decoder and demultiplexer
- Half adder,Full adder
- Minimization
- Counters
| - K-Map
- SOP and POS form
- Combinational circuits
| - Minimization
- K-Map
- Combinational circuits
| - Sequential circuits
- Half adder,Full adder
|