{"id":1050,"date":"2024-10-19T12:35:37","date_gmt":"2024-10-19T07:05:37","guid":{"rendered":"https:\/\/codexplained.in\/?page_id=1050"},"modified":"2024-11-11T01:08:28","modified_gmt":"2024-11-10T19:38:28","slug":"c-programs","status":"publish","type":"page","link":"https:\/\/codexplained.in\/?page_id=1050","title":{"rendered":"C Programs"},"content":{"rendered":"\n
Sr#<\/th>Program<\/th><\/tr><\/thead>
1<\/td>Hello World Program<\/td><\/tr>
2<\/td>Add Two Numbers<\/td><\/tr>
3<\/td>Find Maximum of Two Numbers<\/td><\/tr>
4<\/td>Swap Two Numbers<\/td><\/tr>
5<\/td>Check Even or Odd<\/td><\/tr>
6<\/td>Check Prime Number<\/td><\/tr>
7<\/td>Check Leap Year<\/td><\/tr>
8<\/td>Find Factorial of a Number<\/td><\/tr>
9<\/td>Print Fibonacci Series<\/td><\/tr>
10<\/td>Reverse a Number<\/td><\/tr>
11<\/td>Check Palindrome Number<\/td><\/tr>
12<\/td>Check Armstrong Number<\/td><\/tr>
13<\/td>Sum of Digits of a Number<\/td><\/tr>
14<\/td>Count Number of Digits<\/td><\/tr>
15<\/td>Find Largest of Three Numbers<\/td><\/tr>
16<\/td>Simple Calculator using Switch Case<\/td><\/tr>
17<\/td>Print ASCII Value of a Character<\/td><\/tr>
18<\/td>Find GCD (Greatest Common Divisor)<\/td><\/tr>
19<\/td>Find LCM (Least Common Multiple)<\/td><\/tr>
20<\/td>Convert Decimal to Binary<\/td><\/tr>
21<\/td>Convert Binary to Decimal<\/td><\/tr>
22<\/td>Convert Decimal to Octal<\/td><\/tr>
23<\/td>Convert Octal to Decimal<\/td><\/tr>
24<\/td>Convert Decimal to Hexadecimal<\/td><\/tr>
25<\/td>Convert Hexadecimal to Decimal<\/td><\/tr>
26<\/td>Check Vowel or Consonant<\/td><\/tr>
27<\/td>Sum of n Natural Numbers<\/td><\/tr>
28<\/td>Print Multiplication Table<\/td><\/tr>
29<\/td>Count Even and Odd Digits<\/td><\/tr>
30<\/td>Power of a Number<\/td><\/tr>
31<\/td>Find Square Root (without using sqrt)<\/td><\/tr>
32<\/td>Find Prime Numbers in a Range<\/td><\/tr>
33<\/td>Check Perfect Number<\/td><\/tr>
34<\/td>Print Star Pyramid Pattern<\/td><\/tr>
35<\/td>Print Inverted Pyramid Pattern<\/td><\/tr>
36<\/td>Floyd\u2019s Triangle<\/td><\/tr>
37<\/td>Pascal\u2019s Triangle<\/td><\/tr>
38<\/td>Armstrong Numbers between Two Intervals<\/td><\/tr>
39<\/td>Print All Factors of a Number<\/td><\/tr>
40<\/td>Check Automorphic Number<\/td><\/tr>
41<\/td>Check Harshad Number<\/td><\/tr>
42<\/td>Find Sum of Array Elements<\/td><\/tr>
43<\/td>Find Maximum and Minimum in an Array<\/td><\/tr>
44<\/td>Reverse an Array<\/td><\/tr>
45<\/td>Find Second Largest Element in an Array<\/td><\/tr>
46<\/td>Count Frequency of Elements in an Array<\/td><\/tr>
47<\/td>Merge Two Arrays<\/td><\/tr>
48<\/td>Sort Array using Bubble Sort<\/td><\/tr>
49<\/td>Sort Array using Insertion Sort<\/td><\/tr>
50<\/td>Sort Array using Selection Sort<\/td><\/tr>
51<\/td>Search an Element in an Array (Linear Search)<\/td><\/tr>
52<\/td>Binary Search<\/td><\/tr>
53<\/td>Matrix Addition<\/td><\/tr>
54<\/td>Matrix Subtraction<\/td><\/tr>
55<\/td>Matrix Multiplication<\/td><\/tr>
56<\/td>Transpose of a Matrix<\/td><\/tr>
57<\/td>Check Symmetric Matrix<\/td><\/tr>
58<\/td>Upper and Lower Triangular Matrix<\/td><\/tr>
59<\/td>Find Sum of Diagonal Elements in a Matrix<\/td><\/tr>
60<\/td>Reverse a String<\/td><\/tr>
61<\/td>Check Palindrome String<\/td><\/tr>
62<\/td>Count Vowels and Consonants in a String<\/td><\/tr>
63<\/td>Concatenate Two Strings<\/td><\/tr>
64<\/td>Compare Two Strings<\/td><\/tr>
65<\/td>Convert Lowercase to Uppercase and Vice Versa<\/td><\/tr>
66<\/td>Find Length of a String (without strlen)<\/td><\/tr>
67<\/td>Remove Duplicates from String<\/td><\/tr>
68<\/td>Sort a String Alphabetically<\/td><\/tr>
69<\/td>Reverse Words in a String<\/td><\/tr>
70<\/td>Find Frequency of a Character in a String<\/td><\/tr>
71<\/td>Convert Roman Numerals to Decimal<\/td><\/tr>
72<\/td>Find Power using Recursion<\/td><\/tr>
73<\/td>Find Factorial using Recursion<\/td><\/tr>
74<\/td>Find GCD using Recursion<\/td><\/tr>
75<\/td>Fibonacci Series using Recursion<\/td><\/tr>
76<\/td>Tower of Hanoi<\/td><\/tr>
77<\/td>Decimal to Binary using Recursion<\/td><\/tr>
78<\/td>Binary to Decimal using Recursion<\/td><\/tr>
79<\/td>Find Sum of Digits using Recursion<\/td><\/tr>
80<\/td>Reverse a Number using Recursion<\/td><\/tr>
81<\/td>Check Prime using Recursion<\/td><\/tr>
82<\/td>Generate Permutations of a String<\/td><\/tr>
83<\/td>Merge Sort using Recursion<\/td><\/tr>
84<\/td>Quick Sort using Recursion<\/td><\/tr>
85<\/td>Count Words in a Sentence<\/td><\/tr>
86<\/td>Find Sum of Series (e.g., 1\/1! + 2\/2! + \u2026)<\/td><\/tr>
87<\/td>Simulate Basic Banking System (Deposit, Withdraw)<\/td><\/tr>
88<\/td>Convert Infix Expression to Postfix<\/td><\/tr>
89<\/td>Evaluate Postfix Expression<\/td><\/tr>
90<\/td>Convert Infix Expression to Prefix<\/td><\/tr>
91<\/td>Evaluate Prefix Expression<\/td><\/tr>
92<\/td>Implement Stack using Arrays<\/td><\/tr>
93<\/td>Implement Queue using Arrays<\/td><\/tr>
94<\/td>Implement Circular Queue using Arrays<\/td><\/tr>
95<\/td>Implement Linked List (Singly Linked List)<\/td><\/tr>
96<\/td>Implement Linked List (Doubly Linked List)<\/td><\/tr>
97<\/td>Insert and Delete Node in Linked List<\/td><\/tr>
98<\/td>Reverse a Linked List<\/td><\/tr>
99<\/td>Find Middle of Linked List<\/td><\/tr>
100<\/td>Detect Cycle in a Linked List<\/td><\/tr>
101<\/td>Implement Stack using Linked List<\/td><\/tr>
102<\/td>Implement Queue using Linked List<\/td><\/tr>
103<\/td>Implement Circular Queue using Linked List<\/td><\/tr>
104<\/td>Implement Binary Search Tree<\/td><\/tr>
105<\/td>Inorder Traversal of Binary Tree<\/td><\/tr>
106<\/td>Preorder Traversal of Binary Tree<\/td><\/tr>
107<\/td>Postorder Traversal of Binary Tree<\/td><\/tr>
108<\/td>Level Order Traversal of Binary Tree<\/td><\/tr>
109<\/td>Insert Node in Binary Search Tree<\/td><\/tr>
110<\/td>Delete Node in Binary Search Tree<\/td><\/tr>
111<\/td>Find Height of Binary Tree<\/td><\/tr>
112<\/td>Count Nodes in Binary Tree<\/td><\/tr>
113<\/td>Check if Binary Tree is Balanced<\/td><\/tr>
114<\/td>Check if Binary Tree is Symmetric<\/td><\/tr>
115<\/td>Find Lowest Common Ancestor in Binary Tree<\/td><\/tr>
116<\/td>Implement Hash Table using Arrays<\/td><\/tr>
117<\/td>Implement Hash Table using Chaining<\/td><\/tr>
118<\/td>Implement Binary Heap<\/td><\/tr>
119<\/td>Find Shortest Path using Dijkstra\u2019s Algorithm<\/td><\/tr>
120<\/td>Implement Depth First Search (DFS)<\/td><\/tr>
121<\/td>Implement Breadth First Search (BFS)<\/td><\/tr>
122<\/td>Check Bipartite Graph<\/td><\/tr>
123<\/td>Find Connected Components in Graph<\/td><\/tr>
124<\/td>Implement Kruskal\u2019s Algorithm<\/td><\/tr>
125<\/td>Implement Prim\u2019s Algorithm<\/td><\/tr>
126<\/td>Find Strongly Connected Components (Kosaraju\u2019s Algorithm)<\/td><\/tr>
127<\/td>Detect Cycle in Graph<\/td><\/tr>
128<\/td>Find Topological Sort using DFS<\/td><\/tr>
129<\/td>Find Topological Sort using Kahn\u2019s Algorithm<\/td><\/tr>
130<\/td>Implement Trie Data Structure<\/td><\/tr>
131<\/td>Find Longest Common Subsequence<\/td><\/tr>
132<\/td>Find Longest Increasing Subsequence<\/td><\/tr>
133<\/td>0\/1 Knapsack Problem using Dynamic Programming<\/td><\/tr>
134<\/td>Find Minimum Coin Change<\/td><\/tr>
135<\/td>Find Minimum Edit Distance (Levenshtein Distance)<\/td><\/tr>
136<\/td>Implement Huffman Coding<\/td><\/tr>
137<\/td>Find Maximum Subarray Sum (Kadane\u2019s Algorithm)<\/td><\/tr>
138<\/td>Implement AVL Tree (Balanced Binary Search Tree)<\/td><\/tr>
139<\/td>Solve N-Queens Problem using Backtracking<\/td><\/tr>
140<\/td>Implement LRU Cache<\/td><\/tr>
141<\/td>How To Use C Programming To Make A Spiral Matrix<\/a><\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

<\/p>\n","protected":false},"excerpt":{"rendered":"

Sr# Program 1 Hello World Program 2 Add Two Numbers 3 Find Maximum of Two Numbers 4 Swap Two Numbers 5 Check Even or Odd 6 Check Prime Number 7 Check Leap Year 8 Find Factorial of a Number 9 Print Fibonacci Series 10 Reverse a Number 11 Check Palindrome Number 12 Check Armstrong Number […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"_uf_show_specific_survey":0,"_uf_disable_surveys":false,"footnotes":""},"class_list":["post-1050","page","type-page","status-publish","hentry"],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/pages\/1050","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1050"}],"version-history":[{"count":6,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/pages\/1050\/revisions"}],"predecessor-version":[{"id":1169,"href":"https:\/\/codexplained.in\/index.php?rest_route=\/wp\/v2\/pages\/1050\/revisions\/1169"}],"wp:attachment":[{"href":"https:\/\/codexplained.in\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1050"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}