C Software Interview Questions

5,483 c software interview questions shared by candidates

Shortest path in graph: /// /// graph is a function that accepts the node name, and int*. It returns the /// neighbors of the node and the length of the neighbors in the int* /// /// Name of start node /// Name of goal node /// /// The shortest path with format start->...->goal char *shortestPath(Inner *(*graph)(const char *, int *), const char *start, const char *goal) { // int neighborsLength; // Inner *neighbors = graph(start, &neighborsLength); // std::cout << "name: " << neighbors[0].name << neighbors[0].cost << " // length: " << neighborsLength << std::endl; std::cout << "name: " << // neighbors[1].name << neighbors[1].cost << " length: " << neighborsLength // << std::endl; // neighbors = graph(neighbors[0].name.c_str(), &neighborsLength); // std::cout << "name: " << neighbors[0].name << neighbors[0].cost << " // length: " << neighborsLength << std::endl; std::cout << "name: " << // neighbors[1].name << neighbors[1].cost << " length: " << neighborsLength // << std::endl;
avatar

Junior Software Developer (C++)

Interviewed at Accelya Group

3.3
Aug 15, 2024

Shortest path in graph: /// /// graph is a function that accepts the node name, and int*. It returns the /// neighbors of the node and the length of the neighbors in the int* /// /// Name of start node /// Name of goal node /// /// The shortest path with format start->...->goal char *shortestPath(Inner *(*graph)(const char *, int *), const char *start, const char *goal) { // int neighborsLength; // Inner *neighbors = graph(start, &neighborsLength); // std::cout << "name: " << neighbors[0].name << neighbors[0].cost << " // length: " << neighborsLength << std::endl; std::cout << "name: " << // neighbors[1].name << neighbors[1].cost << " length: " << neighborsLength // << std::endl; // neighbors = graph(neighbors[0].name.c_str(), &neighborsLength); // std::cout << "name: " << neighbors[0].name << neighbors[0].cost << " // length: " << neighborsLength << std::endl; std::cout << "name: " << // neighbors[1].name << neighbors[1].cost << " length: " << neighborsLength // << std::endl;

General object oriented programming questions, such as as “what’s encapsulation, function overloading”. Some questions pertaining to C, such as “what’s the difference between structs and unions”, “where does execution start in a C program”. Then finally some basic Linux command line questions, “how to create files”, “how to check system resources”, “difference between grep and egrep”. If you use Linux and know C/C++ you will cruise through the first 2 rounds.
avatar

C/C++ Software Developer

Interviewed at Cognizant

3.6
Dec 2, 2020

General object oriented programming questions, such as as “what’s encapsulation, function overloading”. Some questions pertaining to C, such as “what’s the difference between structs and unions”, “where does execution start in a C program”. Then finally some basic Linux command line questions, “how to create files”, “how to check system resources”, “difference between grep and egrep”. If you use Linux and know C/C++ you will cruise through the first 2 rounds.

In the programming round, I encountered a question that required me to join three SQL tables and use a GROUP BY clause. This was followed by a programming question that involved data structures like matrices and arrays. Finally, there was a question that tested my knowledge of front-end web technologies, specifically HTML, CSS, and JavaScript.
avatar

Gen C

Interviewed at Cognizant

3.6
Oct 13, 2025

In the programming round, I encountered a question that required me to join three SQL tables and use a GROUP BY clause. This was followed by a programming question that involved data structures like matrices and arrays. Finally, there was a question that tested my knowledge of front-end web technologies, specifically HTML, CSS, and JavaScript.

Viewing 3581 - 3590 interview questions

Glassdoor has 5,483 interview questions and reports from C software interviews. Prepare for your interview. Get hired. Love your job.