The Course is meant for BCA and MCA students.
the course structure :
1. Concept of Structure , pointer and function
2. Link List ( single, double , circular ) includes creation , search, insert, update and delete operations. Concept of polynomial.
2. stack using array and Linked List. Post and prefix operation
3. Queue-using array and linked list . Circular and dequeue
4. Tree- traversal, BST, AVL , B tree. tree creation and sesrching .
5. sorring - bubble, heap, quick, insertion, selection, Radix and shell sort .
6. Time Complexity determination of algorithms using Big O notation
7. File structure and Hashing .
st
Students may bring their Laptop but it is optional.
View this Course
Certified
You have 
