- Algorithm
- Ambiguity/Non-Ambiguity
- Smart Algorithm
- Pseudo code
- Flowcharts
- Data Structure
- Types of Data Structure with Examples
- Features of Data Structures
- Design Phase
- Analyze Phase
- Worst Case, Best Case, Average Case Complexity
- Linear Search Algorithm
- Two Cases Complexities with Conclusion
- Classification of design Paradigm (Divide And Conquer, Dynamic Programing, Greedy Algorithm)
- Search and Enumerated Algorithm
- Probabilistic And Genetic Algorithm
- Difference Between Random and Pseudo Random
- Tree Algorithm
- Terminologies of Tree (Left Successor , Right Successor Terminal)
- Traversing of Binary Tree
- Algorithm of Pre Order With Example
- Algorithm of Post Order With Example
- Algorithm of In Order With Example
- Pre Order Traversing
- In Order Traversing
- Post Order Traversing
- Stack and Ques
- Procedure of Push And Pop
- Back Tracking Algorithm
- Big Oh Notations Example
IT Expert and Consultant