Curriculum
- 11 Sections
- 18 Lessons
- 12 Weeks
Expand all sectionsCollapse all sections
- MODULE 01Stacks, Queues, Circular Queues, Double Ended Queues, Infix to Postfix and Postfix Evaluation1
- Stacks and QueuesStack Operations- PUSH and POP Algorithm , Queue Operations- Enqueue, Dequeue1
- Double Ended QueueInsertion at the Front, Insertion at the Rear, Deletion at the Rear, Deletion at the Front1
- Infix to Postfix Conversion StepsAlgorithm and Problems1
- Evaluating Postfix Expressions1
- MODULE 2Singly Linked List-Operations on Linked list, Stacks and Queues using Linked list, Polynomial representation using Linked list, Doubly linked list. Memory allocation-First fit, Best Fit and worst fit allocation5
- MODULE 30
- MODULE 3Trees: Representation of Trees; Binary Trees ; Binary Search Tree operations ; Binary Heaps; Graphs : BFS. DFS5
- Tree Traversals0
- Depth First Search0
- MODULE 4Sorting and Searching- Insertion sort, Quick Sort ,Merge Sort , Heap sort Radix sort. Searching Techniques: Linear Search , Binary Search3
