COMPUTER

COMPUTER
Part1:
Use an array Data Structure to store data of 30 studnts in your college. Each student record consist of following 3 fields: Integer ID, String Name, and String Major
The final pogram must have following three functionalities (minimum):
a) Inserting a record
b) Searching a record
c) Updating a record

Part 2:
Discuss each of the following algorithms in 2-3 pages
1. Selection Sort
2. Insertion Sort
3. Merge Sort
4. Heap Sort
For each algorithm the discussion should include:
a) Outline the Algorithm.
b) Time and space requirement of the algorithm
c) Provide the dry run of the algorithm using some data.
At the end, compare all algorithms in terms of performance, time and space requirement.
FOR YOUR ASSIGNMENTS TO BE DONE AT A CHEAPER PRICE PLACE THIS ORDER OR A SIMILAR ORDER WITH US NOW