Junior C Developer Interview Questions

172 junior c developer 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.4
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;

What was your Bachelor's thesis about? If I gave you 9 numbers, from 1 to 10 and no repeated, how would you find which number is missing checking each number only once and without keeping track of which numbers you have already seen?
avatar

Junior C++ Developer

Interviewed at Hatstand

3.3
Mar 20, 2017

What was your Bachelor's thesis about? If I gave you 9 numbers, from 1 to 10 and no repeated, how would you find which number is missing checking each number only once and without keeping track of which numbers you have already seen?

First: simple "logic" test that took less than 30 mins,contained a bunch of simple math problems. The second one took 4-8 hours. You had 3 problems: the first one asked you to create 5 classes that were derivated from a base, in the second one you had to debug some code and the third one asked you to upgrade that code in 4 steps
avatar

Junior C++ Developer

Interviewed at Software Business Partners

3.8
Dec 14, 2020

First: simple "logic" test that took less than 30 mins,contained a bunch of simple math problems. The second one took 4-8 hours. You had 3 problems: the first one asked you to create 5 classes that were derivated from a base, in the second one you had to debug some code and the third one asked you to upgrade that code in 4 steps

Viewing 111 - 120 interview questions

Glassdoor has 172 interview questions and reports from Junior c developer interviews. Prepare for your interview. Get hired. Love your job.