Write a "C" program, which inputs and then saves school numbers, names, and surnames (Figure 1) into the student automation system. Each record is stored by using a separate linked list, as shown in Figure 2. When a new school number is entered, a record is also added to the stack(s) to be able to sort the numbers by ID (the last four digits of the school numbers), student name, and faculty codes (Figure 2). You can use as many stacks as you want. Your code should (A) Display the student names in ascending order by their IDs. (B) Display the student names in ascending order by the first letter of their names. (C) Display the school numbers by the faculty codes in ascending order. (D) Delete a record by school number. (E) What is the Big-O annotation of each option above? (add the answer of this option as a comment at the beginning of your program code) Your data should be stored in sorted in the stack(s). It is predicted that a lot of sorting will be done by users while using this program. The minimum time cost is important. faculty code year 7 0 5 1 0 2 0 0 5 Figure 1. School number Head1 795100000 Head2 I Figure 2. Sample linked lists y I . S y NULL y NULL
Write a "C" program, which inputs and then saves school numbers, names, and surnames (Figure 1) into the student automation system. Each record is stored by using a separate linked list, as shown in Figure 2. When a new school number is entered, a record is also added to the stack(s) to be able to sort the numbers by ID (the last four digits of the school numbers), student name, and faculty codes (Figure 2). You can use as many stacks as you want. Your code should (A) Display the student names in ascending order by their IDs. (B) Display the student names in ascending order by the first letter of their names. (C) Display the school numbers by the faculty codes in ascending order. (D) Delete a record by school number. (E) What is the Big-O annotation of each option above? (add the answer of this option as a comment at the beginning of your program code) Your data should be stored in sorted in the stack(s). It is predicted that a lot of sorting will be done by users while using this program. The minimum time cost is important. faculty code year 7 0 5 1 0 2 0 0 5 Figure 1. School number Head1 795100000 Head2 I Figure 2. Sample linked lists y I . S y NULL y NULL
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter18: Stacks And Queues
Section: Chapter Questions
Problem 16PE:
The implementation of a queue in an array, as given in this chapter, uses the variable count to...
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 13 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning