C Developer Interview Questions

5,475 c developer interview questions shared by candidates

Questions / OR, AND, XOR : ==================== static bool Alpha { Console.WriteLine("alpha"); return true; } static bool Beta { Console.WriteLine("beta"); return true; } static void Main() { if (Alpha() && Beta()) { Console.WriteLine("gama"); } } => qu'est ce qui s'affiche? puis idem avec : - if (Alpha() || Beta()) - if (Alpha() ^ Beta()) Questions / Interface, Struct, Class : ========================== interface Point { int X { get; set; } int Y { get; set; } } on a ensuite une class et une struct qui implémentent cette interface dans la classe principale on crée un nouveau point à partir de la class ou de la struct, puis on passe l'objet à une méthode qui mets à jour les coordonnées il faut dire si les coordonnées ont bien été mises à jour ou non.
avatar

Développeur C#

Interviewed at Klee Group

3.4
May 22, 2018

Questions / OR, AND, XOR : ==================== static bool Alpha { Console.WriteLine("alpha"); return true; } static bool Beta { Console.WriteLine("beta"); return true; } static void Main() { if (Alpha() && Beta()) { Console.WriteLine("gama"); } } => qu'est ce qui s'affiche? puis idem avec : - if (Alpha() || Beta()) - if (Alpha() ^ Beta()) Questions / Interface, Struct, Class : ========================== interface Point { int X { get; set; } int Y { get; set; } } on a ensuite une class et une struct qui implémentent cette interface dans la classe principale on crée un nouveau point à partir de la class ou de la struct, puis on passe l'objet à une méthode qui mets à jour les coordonnées il faut dire si les coordonnées ont bien été mises à jour ou non.

Q) Given Singly linked list (1->2->3->4->5->6) , convert this list to (1->6->2->5->3->4). 1st's element next is nth element, 2nd's next is n-1th element and so on. --> I gave them one solution that uses stack, but no more extra space is expected, panel was very friendly and helpful they gave me time to time hint and finally I came up with below solution. Solution: 1) Split linked list into 2 halfs 2) Reverse the 2nd half. 3) Now merge 1st and 2nd half again. Q) Internal implementation of Malloc function Q) Move all the 10s at the end of the array, in O(N) Q) Some basic questions on Hashmap, vectors, set,list Q) Some question on OOPS, virtual functions, copy constructor, why & is used in definition of Copy Const etc. PS: I just added this review to admire the panel, they were very kind & friendly, supportive, and give you hints to arrive at the solution.
avatar

Software Developer C++

Interviewed at Synopsys

3.8
Jan 21, 2022

Q) Given Singly linked list (1->2->3->4->5->6) , convert this list to (1->6->2->5->3->4). 1st's element next is nth element, 2nd's next is n-1th element and so on. --> I gave them one solution that uses stack, but no more extra space is expected, panel was very friendly and helpful they gave me time to time hint and finally I came up with below solution. Solution: 1) Split linked list into 2 halfs 2) Reverse the 2nd half. 3) Now merge 1st and 2nd half again. Q) Internal implementation of Malloc function Q) Move all the 10s at the end of the array, in O(N) Q) Some basic questions on Hashmap, vectors, set,list Q) Some question on OOPS, virtual functions, copy constructor, why & is used in definition of Copy Const etc. PS: I just added this review to admire the panel, they were very kind & friendly, supportive, and give you hints to arrive at the solution.

Viewing 4421 - 4430 interview questions

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