Skip to content

Instantly share code, notes, and snippets.

@gcs-abdulwahab

gcs-abdulwahab/DSA Syllabus for Resit Exam on 10th October 2022

Created October 3, 2022 10:45
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save gcs-abdulwahab/90a79eccb5672d84d5ddb29b640088ae to your computer and use it in GitHub Desktop.
Save gcs-abdulwahab/90a79eccb5672d84d5ddb29b640088ae to your computer and use it in GitHub Desktop.
Download ZIP
DSA Syllabus for Resit Exam on 10th October 2022
Raw
DSA Syllabus for Resit Exam on 10th October 2022
Intro to DSA
Arrays : Sparse / Dense Array / Matrix
LinkedList : Singly , Variant , Doubly LinkedList
Stack : and its applications , PostFix / Infix / Prefix conversion and Evaluation using Stack
Queue and its Implementations
DEQUE
Algorithmic Analysis of algorithms : Best , Worst Case
Recursion Tree Analysis
Trees , Binary Tree , Implementation in Array and In LinkedList
Tree Methods , Tree Traversal ,
Binary Search trees and its Crud Operations
Balancing Trees : AVL Trees , Rotations
Sorting : Selection Sort , Bubble , Insertion Sort , Counting
MergeSort , QuickSort
Heap DataStructure : Heap , MaxHeap , Min Heap , its Implementation as complete Binary Tree
CRUD Operations and applications
HashTable DataStructure
Graph DataStructure: Adjacency matrix and Adjacency List
its implementation and Spanning tree and Graph Algorithm , DFS and BFS : Graph Traversal
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment