C Tier 3

Tier 3: Intermediate Coding Questions for C

1. Write a program to implement a circular queue using an array.
2. Write a program to implement a priority queue using a binary heap.
3. Write a program to implement the quicksort algorithm.
4. Write a program to implement the merge sort algorithm.
5. Write a program to implement the radix sort algorithm.
6. Write a program to implement the shell sort algorithm.
7. Write a program to implement the AVL tree data structure.
8. Write a program to implement the red-black tree data structure.
9. Write a program to implement the Floyd's cycle detection algorithm for linked lists.
10. Write a program to implement the Ford-Fulkerson algorithm for maximum flow in a network.
11. Write a program to implement the Edmonds-Karp algorithm for maximum flow in a network.
12. Write a program to implement the Dijkstra's algorithm using a min-priority queue.
13. Write a program to implement the A* search algorithm.
14. Write a program to implement the Kruskal's algorithm using disjoint-set data structure.
15. Write a program to implement the Prim's algorithm using a min-priority queue.
16. Write a program to implement the Bellman-Ford algorithm using dynamic programming.
17. Write a program to implement the topological sort of a directed graph using DFS.
18. Write a program to implement the Tarjan's algorithm for strongly connected components.
19. Write a program to implement the Kosaraju's algorithm for strongly connected components.
20. Write a program to implement the Dijkstra's algorithm for shortest path in a graph with negative weights.
21. Write a program to implement the Johnson's algorithm for all pairs shortest path in a graph.
22. Write a program to implement the Bellman-Ford algorithm for all pairs shortest path in a graph.
23. Write a program to implement the Floyd-Warshall algorithm using dynamic programming.
24. Write a program to implement the B-tree data structure.
25. Write a program to implement the B+ tree data structure.
26. Write a program to implement the R-tree data structure.
27. Write a program to implement the kd-tree data structure.
28. Write a program to implement the quadtree data structure.
29. Write a program to implement the k-means clustering algorithm.
30. Write a program to implement the hierarchical clustering algorithm.
31. Write a program to implement the expectation-maximization algorithm.
32. Write a program to implement the Floyd's algorithm for cycle finding in a linked list.
33. Write a program to implement the Boyer-Moore string searching algorithm.
34. Write a program to implement the Rabin-Karp string searching algorithm.
35. Write a program to implement the Karp-Rabin string searching algorithm.
36. Write a program to implement the Aho-Corasick string searching algorithm.
37. Write a program to implement the Burrows-Wheeler transform.
38. Write a program to implement the move-to-front transform.
39. Write a program to implement the run-length encoding algorithm.
40. Write a program to implement Huffman coding.
41. Write a program to implement the LZ77 compression algorithm.
42. Write a program to implement the LZW compression algorithm.
43. Write a program to implement the JPEG compression algorithm.
44. Write a program to implement the RSA encryption algorithm.
45. Write a program to implement the AES encryption algorithm.
46. Write a program to implement the Diffie-Hellman key exchange algorithm.
47. Write a program to implement the SHA-256 hashing algorithm.
48. Write a program to implement the MD5 hashing algorithm.
49. Write a program to implement the Bloom filter data structure.