750+ C Programming Interview Questions and Answers: MCQ Format Questions

750+ C Programming Interview Questions and Answers: MCQ Format Questions

A C/C++ library for decoding QR code 2D barcodes

A C/C++ library for decoding QR code 2D barcodes

Arrays in C [NEW]

Arrays in C

Bitwise Operators in C [NEW]

Bitwise Operators in C

C auto [NEW]

C auto

C Functions [NEW]

C Functions

C Operators [NEW]

C Operators

C Program Count the Number of Occurrences of an Element in the Linked List using Recursion
This C Program uses recursive function & finds the occurrence for an element in an unsorted list. The user enters the element need to be counted.

C Program Delete a specific Line from a Text File
This C Program delete a specific line from a text file.

C Program Find the Length of the Linked List using Recursion
This C Program uses recursive function & calculates the length of a string. The user enters a string to find it’s length.

C Program for Depth First Binary Tree Search using Recursion
The following C program, using recursion, performs a Depth First Search traversal. Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure or graph. The concept of backtracking is used in DFS. In this program we are performing DFS on a binary tree. In DFS, the deepest and univisited node is visited and backtracks to it’s parent node if no siblings of that node exists. Conditions: The DFS works on acyclic graph. DFS may fail if it enters a cycle. Care must be taken by not extending a path to a node if it already has.

C Program for Depth First Binary Tree Search using Recursion
The following C program, using recursion, performs a Depth First Search traversal. Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure or graph. The concept of backtracking is used in DFS. In this program we are performing DFS on a binary tree. In DFS, the deepest and univisited node is visited and backtracks to it’s parent node if no siblings of that node exists. Conditions: The DFS works on acyclic graph. DFS may fail if it enters a cycle. Care must be taken by not extending a path to a node if it already has. Here is the source code of the C program to apply DFS on a binary tree recursively. The C program is successfully compiled and run on a Linux system. The program output is also shown below.

C Program for Depth First Binary Tree Search without using Recursion
The following C program, using iteration, performs a Depth First Search traversal. Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure or graph. The concept of backtracking is used in DFS. In this program we are performing DFS on a binary tree. In DFS, the deepest and univisited node is visited and backtracks to it’s root if no siblings of that node exists. Conditions: The DFS works on acyclic graph. DFS may fail if it enters a cycle. Care must be taken by not extending a path to a node if it already has.

C Program that Merges Lines Alternatively from 2 Files & Print R
This C Program merges lines alternatively from 2 files & print result.

C Program to Append the Content of File at the end of Another
This C Program appends the content of file at the end of another.