Here is an outline of a project that deals with nested data structures and has the characteristics and requirements you described:

Part 1: The preselection process

Create a company structure with the members name and an array of structures of type applicant. The applicant structure will consist of the members: name, CGPA, and date of application.

Create a text file named "Internships_Applicants.txt" and fill it with information of each applicant, per line. Each line will contain the name of the applicant, his CGPA and the company that he applied for.

Declare n head pointers to n linked lists for the n companies in the bookData.

Open the file for reading to scan the CGPA of each applicant. The preselection is about taking at most 5 applicants with the highest CGPAs per company.

Part 2: The technical interviews

The remaining applicants, stored in the linked lists are to go through a technical interview.

The technical interview is a data structure problem itself. The user will choose the company he wants and play the role of the applicants.

We will have 5 data structures sub-problems: The first one about (Sorting algos/Big O), the second one--(stacks & queues), the third one--trees and heaps, the fourth one--graphs, and the fifth one about hashmaps.

At first, whether we have 5 applicants or less, all of them will have the same first DS problem (Sorting algos/Big O), the ones who got it wrong will be removed. Then display the second problem for remaining ones (stacks & queues), again whoever got it wrong will be removed, and so on for the third, fourth and fifth problems, we stop when only one applicant is left. This process is to be repeated for each linked list/company until only one node/applicant is left in each one.

The remaining one is the one.

C programming pls