IV- CMSC

[coatk1]

• [ ] 1. DFS and 2. BFS: https://techdifferences.com/difference-between-bfs-and-dfs.html | https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/ | https://www.geeksforgeeks.org/breadth-first-search-or-bfs-for-a-graph/

• [x] 3. Matching Parenthesis problem: https://www.geeksforgeeks.org/check-for-balanced-parentheses-in-an-expression/

• [ ] 4. Using Hash Tables: https://www.geeksforgeeks.org/hashing-data-structure/ | https://www.geeksforgeeks.org/python-3-6-dictionary-implementation-using-hash-tables/

• [ ] 5. Variables/Pointers manipulation

• [ ] 6. Reverse linked list (duplicates , removing duplicates): https://www.geeksforgeeks.org/reverse-a-linked-list/

• [ ] 7. Sorting fundamentals (quicksort, mergesort,bubblesort techniques, runtime of a sort,time space complexity)

• [ ] 8. Recursion: https://www.geeksforgeeks.org/recursion-in-python/

• [ ] 9. Custom data structures (object oriented programming)

• [ ] 10. Binary search: https://www.geeksforgeeks.org/binary-search-tree-set-1-search-and-insertion/