Syllabus :
Introduction to Programming:
- Introduction
- Time complexity & Asymptotic notation
- Arrays
- Stacks
- Linear Queues
- Circular Queues
- Deques
- Infix To Postfix Conversion
- Evaluation of Postfix Expression
- Singly Linked Lists
- Circular Linked List
- Doubly Linked List
- Stack using linked list
- Queue using linked list
- Sequential Search
- Binary Search
- Bubble Sort
- Insertion Sort
- Selection Sort
- Quick Sort
- Heap Sort
- Merge Sort
- Trees
- Binary Trees
- Binary Search Trees
- AVL Trees
- B-Trees
- Graphs
- Huffman Coding
- Hashing
No comments:
Post a Comment