2. Each student at Middlesex County College takes a different number of courses, so the registrar has decided to use linear linked lists to store each student's class schedule and an array to represent the entire student body. A portion of this data structure is shown below: ID link $|||||| 1/1234 Sec cr 3 CSC1621 →HISHO 24 2357 CSC2364 3/ 2 These data show that the first student (ID: 1111) is taking section 1 of CSC162 for 3 credits and section 2 of HIS101 for 4 credits; the second student is not enrolled; the third student is enrolled in CSC236 section 4 for 3 credits. Write a class for this data structure. Provide methods for creating the original array, inserting a student's initial class schedule, adding a course, and dropping a course. Include a menu-driven program that uses the class.

which index is also reffered to as a non-clustering index? a) Bidirectional Index b) Primary Index c) Hash Index d) Secondary Index

Define the function print_trophic_class_summary(tli3_values) that accepts a list of trophic level index values and prints a summary outlining the number of lakes in each trophic classification, in order from highest trophic classification to lowest. See the examples for the required format. Notes: Your function must print the summary, not return it. In each state line, the initial number should be formatted with width 3. (Hint: :3 will be helpful) All possible states must be included in the output, even states with zero lakes. The following list will be helpful:     ['Hypertrophic', 'Supertrophic', 'Eutrophic', 'Mesotrophic', 'Oligotrophic', 'Microtrophic', 'Ultra-microtrophic'] You must include and use one of your number_in_trophic_class functions (take your pick!), plus your trophic_class function. Basically, you can start with your answer to Question 5 or 6 and add your print_trophic_class_summary function definition after your previous definitions. For example: Test Result…

Integer num_rows is read from input, representing the number of rows of data remaining in the input. Two-dimensional list vals_2d consists of data read from the remaining input. Output each row of numbers in vals_2d on one line, ending each number with a space.

Python

Task 2: Understand How Bottom-Up Merge Sort Works 22. Create a table showing how the merge operations modify the array in sequential order (include the table in your PDF answer as text): 25, 16, 21, 14, 26, 18, 23, 11, 20, 15, 22, 13, 17, 24, 12, 19 23. Pick a random array of 10 elements and create a merge table (include the table in your PDF answer as text) - do not pick a trivial array (e.g. 1, 2, 3... or 9, 8, 7, ...) Task 3: Bottom-Up Merge Sort Method 31. In the sort.merge.bottomup package, create a public class named BottomUpMergeSort and a public class named BottomUpMergeSortTest 32. In the class BottomUpMergeSort create a publlic static method sort that receives the array to be sorted. It creates the auxiliary array to be used for merging and for each length of a subarray starting from 1 to n and doubling the length each time, merge the adjacent subarrays 2 by 2:.  Hint: See sort method in https://algs4.cs.princeton.edu/22mergesort/MergeBU.java.html 34. In the class…

Dictionary vegetables_info contains key-value pairs that represent the grade received by each vegetable item in an inspection. Dictionary grade_scale contains key-value pairs that represent the meaning of each grade. String vegetables_name is read from input. Complete the following tasks: Use pop() to remove vegetables_name from vegetables_info and assign vegetables_num with the value returned. Any string that is not a key in vegetables_info has the default value 0. Assign patient_grade with the value associated with key vegetables_num in grade_scale. Any number that is not a key in grade_scale has default value 'not reported'.

You are required to develop a data structure which keeps the record of the courses an ABCuniversity offers. A student shall only be enrolled in a course if its prerequisite is cleared.All the courses will have an address to its prerequisite course being offered and shall be calledits neighboring nodes. Course details should include course name and credit hours.A. Implement an insert function in a relevant data structure which store course details.Note: When a new course is inserted it must verify its previous course is a prerequisite ofthe inserted course.B. Implement a function which take user details and allocate him/her in Data structurecourse after verifying prerequisite courses.C. Implement a function in which we can check credit hours of any course.

Its a java data structures class. Lab directions is also given on second page thank you