C program to Demonstrate the Recursive function.

Write a C program to demonstrate the recursive function.Recursion  is the programming technique that a process invoking itself again and again. In this program, We reverse the given number and checks it is a palindrome or not. Read more about C Programming Language . /************************************************************ You can use all the programs on www.c-program-example.com* for personal …

C program to count the leaves of the binary tree.

Write a C program to count the leaves of the binary tree.Binary tree is the ordered directed tree data structure, in which each node has at most two nodes.A node is called as a leaf node,  if it does not contains any child elements. In this program, We used the structures to create the binary …

C Program to implement hashing.

Write a C Program to implement hashing.Hashing is the function or routine used to assign the key values to the each entity in the database. Using hashing, We can easily access or search the values from database.In this program we used the open addressing hashing, also called as closed hashing.Read more about C Programming Language. …

C Program to Check File Size – fseek/ftell and stat()

There are two standard ways to check file size in C: the portable fseek()/ftell() method that works with any FILE pointer, and the POSIX stat() method that reads file metadata without opening the file. This page covers both, with complete working programs, a comparison table, and when to use each. Method 1 — fseek() and …

C Program to implement address calculation sort.

Write a C Program to implement address calculation sort.Address calculation sort is the sorting method which sorts the given array by using insertion method.In this algorithm, a hash function is used and applied to the each key. Result of hash function is placed in the linked lists. The hash function must be a order preserving …

C Program to solve Dining philosophers problem.

Write a C Program to solve Dining philosophers problem.Dining philosophers problem is a classic synchronization problem.A problem introduced by Dijkstra concerning resource allocation between processes. Five silent philosophers sit  around table with a bowl of spaghetti. A fork is placed between each pair of adjacent philosophers. Each philosopher must alternately think and eat.Eating is not …