Users Online
· Guests Online: 158
· Members Online: 0
· Total Members: 188
· Newest Member: meenachowdary055
· Members Online: 0
· Total Members: 188
· Newest Member: meenachowdary055
Forum Threads
Newest Threads
No Threads created
Hottest Threads
No Threads created
Latest Articles
Articles Hierarchy
Articles: C Language
C Program to Print Environment Variables
This C Program prints environment variables.Environment variables are a set of dynamic named values that can affect the way running processes will behave on a computer.
This C Program prints environment variables.Environment variables are a set of dynamic named values that can affect the way running processes will behave on a computer.
C Program to Print the Alternate Nodes in a Linked List using Recursion
This C program, using recursion, displays the alternate nodes in a linked list.A linked list is an ordered set of data elements, each containing a link to its successor.
This C program, using recursion, displays the alternate nodes in a linked list.A linked list is an ordered set of data elements, each containing a link to its successor.
C Program to Replace a specified Line in a Text File
This C Program replace a specified line in a text file.
This C Program replace a specified line in a text file.
C Program to Represent Linear Equations in Matrix Form
This is a C Program to represent a set of linear equations in matrix form. This is c program to convert the system of linear equations to matrix form. The input is the coefficient of each variable and constant. Program rearranges them and converts them into matrix form, which aids solving them. Here is source code of the C Program to Represent Linear Equations in Matrix Form. The C program is successfully compiled and run on a Linux system. The program output is also shown below.
This is a C Program to represent a set of linear equations in matrix form. This is c program to convert the system of linear equations to matrix form. The input is the coefficient of each variable and constant. Program rearranges them and converts them into matrix form, which aids solving them. Here is source code of the C Program to Represent Linear Equations in Matrix Form. The C program is successfully compiled and run on a Linux system. The program output is also shown below.
C Program to Reverse a Stack using Recursion
This C program, using recursion, reverses a stack content. Stack here is represented using a linked list. A linked list is an ordered set of data elements, each containing a link to its successor.
This C program, using recursion, reverses a stack content. Stack here is represented using a linked list. A linked list is an ordered set of data elements, each containing a link to its successor.
C Program to Reverse the Contents of a File and Print it
This C Program reverses the contents of a file and print it.
This C Program reverses the contents of a file and print it.
C Program to Reverse the String using Recursion
This C Program uses recursive function & reverses the string entered by user in the same memory location. Eg: “program” will be reversed to “margorp”
This C Program uses recursive function & reverses the string entered by user in the same memory location. Eg: “program” will be reversed to “margorp”
C Program to Search an Element in a Tree Recursively
The following C program, using recursion, searches for a given node in a tree. The tree we have used is the binary search tree. A binary search tree follows a concept of the nodes whose numbers are lesser than the parent/pointed node are linked to the left and the nodes whose are greater than the parent/pointed node are linked to the right.
The following C program, using recursion, searches for a given node in a tree. The tree we have used is the binary search tree. A binary search tree follows a concept of the nodes whose numbers are lesser than the parent/pointed node are linked to the left and the nodes whose are greater than the parent/pointed node are linked to the right.
C Program to Search for an Element in the Linked List using Recursion
This C Program uses recursive function & search for an element in a linked list. A linked list is an ordered set of data elements, each containing a link to its successor.
C Program to Search for an Element in the Linked List without using Recursion
This C program, using iteration, searches for an element in a linked list. A linked list is an ordered set of data elements, each containing a link to its successor.
C Program to Solve any Linear Equation in One Variable
This C program solves linear equation in one variable. Here is the source code of the C program to solve any linear equation in one variable. The C program is successfully compiled and run on a Linux system. The program output is also shown below.
This C program solves linear equation in one variable. Here is the source code of the C program to solve any linear equation in one variable. The C program is successfully compiled and run on a Linux system. The program output is also shown below.
C Program to Solve Tower-of-Hanoi Problem using Recursion
This C Program uses recursive function & solves the tower of hanoi. The tower of hanoi is a mathematical puzzle. It consists of threerods, and a number of disks of different sizes which can slideonto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top. We have to obtain the same stack on the third rod.
This C Program uses recursive function & solves the tower of hanoi. The tower of hanoi is a mathematical puzzle. It consists of threerods, and a number of disks of different sizes which can slideonto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top. We have to obtain the same stack on the third rod.
C Program to Traverse the Tree Non-Recursively
The following C program, using iteration, searches for a given node in a tree. The tree we have used is the binary search tree. A binary search tree follows a concept of the nodes whose numbers are lesser than the parent/pointed node are linked to the left and the nodes whose are greater than the parent/pointed node are linked to the right.
The following C program, using iteration, searches for a given node in a tree. The tree we have used is the binary search tree. A binary search tree follows a concept of the nodes whose numbers are lesser than the parent/pointed node are linked to the left and the nodes whose are greater than the parent/pointed node are linked to the right.
C Program to Traverse the Tree Non-Recursively
The following C program, using iteration, searches for a given node in a tree. The tree we have used is the binary search tree. A binary search tree follows a concept of the nodes whose numbers are lesser than the parent/pointed node are linked to the left and the nodes whose are greater than the parent/pointed node are linked to the right.
The following C program, using iteration, searches for a given node in a tree. The tree we have used is the binary search tree. A binary search tree follows a concept of the nodes whose numbers are lesser than the parent/pointed node are linked to the left and the nodes whose are greater than the parent/pointed node are linked to the right.
C Program to Traverse the Tree Recursively
The following C program, using recursion, performs traversal operation across the nodes in a tree. The tree we have used is the binary search tree. The user generates a tree by inserting integers. The user is also asked to select one of the three modes of traversal, ie, infix, prefix and postfix. The user can use any of the three options to see the result. A binary search tree follows a concept of the nodes whose numbers are lesser than the parent/pointed node are linked to the left and the nodes whose number are greater than the parent/pointed node are linked to the right.
The following C program, using recursion, performs traversal operation across the nodes in a tree. The tree we have used is the binary search tree. The user generates a tree by inserting integers. The user is also asked to select one of the three modes of traversal, ie, infix, prefix and postfix. The user can use any of the three options to see the result. A binary search tree follows a concept of the nodes whose numbers are lesser than the parent/pointed node are linked to the left and the nodes whose number are greater than the parent/pointed node are linked to the right.