100 C Programming Practice Questions

Welcome to the 100-day C programming practice challenge! These practice questions cover a wide range of topics and difficulty levels to help you become proficient in C programming. Feel free to use this list as a guide to enhance your coding skills.

Basics and Fundamentals (Day 1-10)

1. Print "Hello, World!".
2. Calculate and print the sum of two numbers.
3. Calculate the area of a rectangle.
4. Check if a number is even or odd.
5. Find the factorial of a positive integer.
6. Swap two numbers without using a temporary variable.
7. Generate and print the Fibonacci series.
8. Check if a year is a leap year.
9. Find the largest among three numbers.
10. Print the multiplication table of a given number.

Control Statements and Loops (Day 11-20)

11. Print prime numbers between two given numbers.
12. Create a basic calculator using switch-case.
13. Print a specific pattern.
14. Check if a string is a palindrome.
15. Find the Greatest Common Divisor (GCD) of two numbers.
16. Print a different pattern.
17. Implement a guessing game.
18. Reverse the digits of a number.
19. Calculate the sum of digits of a number.
20. Find the Least Common Multiple (LCM) of two numbers.

Arrays and Strings (Day 21-30)

21. Calculate the average of an array.
22. Find the smallest and largest elements in an array.
23. Check if an array is sorted.
24. Reverse the elements of an array.
25. Count vowels and consonants in a string.
26. Remove spaces from a string.
27. Implement Bubble Sort for array sorting.
28. Find the frequency of elements in an array.
29. Merge two sorted arrays.
30. Check if two strings are anagrams.

Functions and Pointers (Day 31-40)

31. Write a function to calculate the power of a number.
32. Calculate the factorial of a number using recursion.
33. Swap two numbers using pointers.
34. Implement a function to find the length of a string.
35. Calculate the sum of elements in a 2D array.
36. Check if a number is prime using a function.
37. Write a function to reverse a string.
38. Find the second largest element in an array.
39. Convert a decimal number to binary using a function.
40. Find the intersection of two arrays.

Structures and File Handling (Day 41-50)

41. Create a structure to represent a student with name, roll number, and marks.
42. Read and write data to a text file.
43. Copy the contents of one file to another.
44. Create a structure to represent a book with title, author, and ISBN.
45. Find the average marks of students using structures and arrays.
46. Count words, lines, and characters in a text file.
47. Create a program to manage a bank account using structures.
48. Read data from a CSV file and perform calculations.
49. Create a program to manage a library catalog.
50. Implement a basic text editor in C.

Advanced Concepts (Day 51-60)

51. Implement a stack data structure.
52. Implement a queue data structure.
53. Perform matrix multiplication.
54. Calculate factorial using memoization.
55. Implement binary search algorithm.
56. Implement a linked list data structure.
57. Implement a circular linked list.
58. Sort an array using the Quick Sort algorithm.
59. Calculate the nth Fibonacci number using memoization.
60. Implement a hash table.

More Practice (Day 61-70)

61. Solve a system of linear equations using Cramer's rule.
62. Implement a priority queue.
63. Implement graph data structure and perform DFS/BFS traversal.
64. Solve the Tower of Hanoi problem.
65. Implement a binary search tree (BST) data structure.
66. Perform matrix addition and subtraction.
67. Implement Dijkstra's algorithm for shortest paths.
68. Implement Knapsack problem using dynamic programming.
69. Implement a basic calculator with multiple operations.
70. Solve the Josephus problem using circular linked list.

Advanced Topics (Day 71-80)

71. Implement a red-black tree.
72. Implement graph traversal algorithm to detect strongly connected components.
73. Implement Floyd-Warshall algorithm for all pairs shortest paths.
74. Implement a heap data structure.
75. Solve N-Queens problem.
76. Implement Boyer-Moore string search algorithm.
77. Solve longest common subsequence problem using dynamic programming.
78. Implement trie data structure for efficient string operations.
79. Implement skip list data structure.
80. Solve traveling salesman problem using dynamic programming.

More Challenges (Day 81-90)

81. Implement graph traversal algorithm to find articulation points.
82. Solve coin change problem using dynamic programming.
83. Implement AVL tree.
84. Implement B-tree data structure.
85. Solve longest increasing subsequence problem.
86. Implement suffix array for string manipulation.
87. Implement A* search algorithm.
88. Solve maximum flow problem using Ford-Fulkerson algorithm.
89. Implement graph traversal algorithm to find shortest path in weighted graph.
90. Solve subset sum problem using dynamic programming.

Algorithmic Puzzles (Day 91-100)

91. Implement Water Jug Problem.
92. Solve Eight Puzzle using search algorithm.
93. Implement RSA encryption algorithm.
94. Solve Nim Game using optimal strategy.
95. Implement N-Queens problem using genetic algorithm.
96. Solve Tower of Hanoi iteratively.
97. Implement Sieve of Eratosthenes for prime number generation.
98. Solve Egg Dropping Problem using dynamic programming.
99. Implement TSP using genetic algorithms.
100. Solve Subset Sum Problem using backtracking.