Preparation-1
1. C Programming
Introduction
Flow Control
Functions
Arrays
Pointers
Structures and Unions
2. Data Structures
Stacks
Reverse polish using stack
Queues
Linked lists
Doubly linked list
Trees
Tree traversal(MAX, MIN, HEEP)
IN_ORDER, PRE_ORDER, POST_ORDER
Hashing
Heaps
Graphs
Binomial Heap
Fibonacci Heap
Skip List
Red-Black Trees
Tries
Ternary Search Trees
Segment Trees
Splay Trees
Interval Trees
Binary Indexed Trees
B-Tree
3. Algorithms
Analysis
Complexity analysis
Asynchronous notation
Sorting and Searching Techniques
Divide and conquer
Bubble sort
Greedy
Backtracking
Dynamic Programming
Complexity Classes
4. Problem Solving using Data Structure and Algorithm
Arrays
Linked Lists
Stacks
Queues
Trees
Heaps
Strings
Divide and Conquer
Backtracking
Greedy
Pattern Searching
Dynamic Programming
Bit Manipulation
Mathematical Algorithms
5. Operating System
Page fault
Dead lock
Race Condition
CPU scheduling
Knowledge: RAM, DRAM, SRAM, PRAM
Compiler VS Interpreter
Linux Commands
6. Object-oriented analysis and design
UML use case
SDLC
Black box and white box testing
Waterfall model and Spiral model
Comments
Post a Comment