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.

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.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

how to answer the following question screen shot show figure 6.3 The figure 6.3 represents storage of a linked list in an array. The stored list is: A. B – A – D – C. B. 1 – 6 – 4 – -1. C. A – B – C – D. D. A1 – B6 – C4 – D(-1). The order in which we add information to a list has no effect on when we can retrieve it. True or False
3) L is a data element linear list. Implement the list as follows: I a linear open addressed hash table with your preferred hash function; and ii) a sorted list.Using a) hashing and b) searching, find a list of keys on the representations I and ii). b) binary search, and so on. Compare the performance of the two methods across the entire list L.
Which of the following statements regarding linked lists and arrays is correct? Group of answer choices: a. A dynamically resizable array makes insertions at the beginning of an array very efficient. b. Using a doubly linked list is more efficient than an array when accessing the ith element of a structure. c. A dynamically resizable array is another name for a linked list. d. Any type of list tends to be better than an array when there are a set number of maximum items known beforehand. e. If many deletions at any place in the structure were common, a linked list implementation would likely be preferable to an array
TOKEN is a priority queue for organizing n data items with m priority numbers.TOKEN is implemented as a two-dimensional array TOKEN[1:m, 1:p], where p isthe maximum number of elements with a given priority. Execute the followingoperations on TOKEN [1:3, 1:2]. Here, INSERT(“xxx”, m) indicates the insertion ofitem “xxx” with priority number m, and DELETE() indicates the deletion of the firstamong the high priority items.i) INSERT(“not”, 1)ii) INSERT(“and”, 2)iii) INSERT(“or”, 2)iv) DELETE()v) INSERT (“equ”, 3)
In this exercise we will be processing some data stored as a list of dictionaries in order to be able to answer queries on the data. In our case we simply have a list of student records, where each record is a dictionary that has the student's name and their GPA. An example of the data set is below: students = [{'name': 'Alice', 'gpa': 4.0}, {'name': 'Bob', 'gpa': 3.5}, {'name': 'Cody', 'gpa': 3.75}, {'name': 'David', 'gpa': 3.65}] Your task is to create a function called topStudent which takes in a list of students of the form shown above and finds the name of the student with the highest GPA. For this assignment you can assume that no two students will have the same GPA. where you'll find a class roster of 100 students. Below that is the topStudent function, which you need to complete. roster = [{'name': 'Archy', 'gpa': 3.39}, {'name': 'Nadia', 'gpa': 2.39}, {'name': 'Cesya', 'gpa': 3.34}, {'name': 'Kellie', 'gpa': 2.32}, {'name': 'Jordana', 'gpa': 3.64}, {'name': 'Wilton',…
In this exercise we will be processing some data stored as a list of dictionaries in order to be able to answer queries on the data. In our case we simply have a list of student records, where each record is a dictionary that has the student's name and their GPA. An example of the data set is below: roster = [{'name': 'Alice', 'gpa': 4.0}, {'name': 'Bob', 'gpa': 3.5}, {'name': 'Cody', 'gpa': 3.75}, {'name': 'David', 'gpa': 3.65} {'name': 'Archy', 'gpa': 3.39}, {'name': 'Nadia', 'gpa': 2.39}, {'name': 'Cesya', 'gpa': 3.34}, {'name': 'Kellie', 'gpa': 2.32}, {'name': 'Jordana', 'gpa': 3.64}, {'name': 'Wilton', 'gpa': 2.59}, {'name': 'Meagan', 'gpa': 3.45}, {'name': 'Leela', 'gpa': 2.66}, {'name': 'Kaela', 'gpa': 2.71}, {'name': 'Isabelita', 'gpa': 3.47}, {'name': 'Phillipe', 'gpa': 2.95}, {'name': 'Eula', 'gpa': 3.46}, {'name': 'Odetta', 'gpa': 3.56}, {'name': 'Christian', 'gpa': 3.4}, {'name': 'Zared', 'gpa': 2.84}, {'name': 'Devondra', 'gpa': 2.02}, {'name': 'Scarface', 'gpa':…
4) Given that a queue is being represented by the following circular representation in an array (front is currently 4 and back is currently 7): array component: 0 1 2 4 5 6 7 8 | | | | 37 | 41 | 12 | 34 | | a) Show what this representation would like after the following sequence of operations are performed: deq(q, i); deq(q, j); enq(q, 81); enq(q, 72); enq(q, 38); deq(q, k); (indicate the current position of front and back for each operation) b) What is an advantage of this implementation of a queue? c) What is a disadvantage of this implementation of a queue?
Implement the function below void swap(int pos1, int pos2) {} For LinkedList, to maintain integrity of data in the structure, you are not to swap directly the element, nor remove a node. Instead, you are to only change the nodes' next pointers. Inital code to be completed: class LinkedList : public List { node* head; node* tail; int index; node* create_node(int num) { node* n = (node*) malloc(sizeof(node)); n->element = num; n->next = NULL; return n; } public: LinkedList() { index = 0; head = NULL; tail = NULL; } int add(int num) { addTail(num); return index; } int get(int pos) { node* currnode = head; int count =0; while (currnode != NULL){ count++; if (count == pos){ return currnode -> element; }else{ currnode = currnode -> next; } }…
We learnt this week that lists can be multi-dimensional. For e.g., the following is another example of 2-D multidimensional list. Each row contains student name followed by their grades in 5 subjects: students = [ ['Anna', 98.5, 77.5, 89, 93.5, 85.5], ['Bob', 77, 66.5, 54, 90, 85.5], ['Sam', 98, 97, 89.5, 92.5, 96.5] ] To access, a specific row, you would use students[row_number][column_number]. students[0][0] would print 'Anna' students[0][1] would print 98.5 and so on.. Write a program that defines a function that takes a list as an argument, adds the scores of each student, calculate average for each student (append them to a separate list) and display them. Your program should: Define a function display_average(students) that takes in a 2-D list as an argument. Display the original list using for/while loop. Calculate and display the average of each student. You do not need to ask user for input. You can use your own 2-D lists with at-least 2-rows.
Assume that we are utilizing a doubly linked list of unsorted data. What would be the asymptotic running time of the data structure for the following functions? Search() Insert() Delete() Minimum() Maximum() Successor() Predecessor()
Suppose that queue is implemented as an array with the special reserved slot, Suppose that the size of the array implementing queue is 100. Also, suppose that the value of queueFront is 74 and the value of queueRear is 99. a. What are the values of queueFront and queueRear after adding an element to queue?b. What are the values of queueFront and queueRear after removing an element from queue? Also, what is the position of the removed queue element?
Utilising the simulated link technique, create an array version of a binary search tree based on an array implementation of a binary tree. Each element of the array must keep track of the array locations of the left child and the right child as well as a reference to the data element that is placed there. In order to reuse such slots, you must also keep track of the accessible array positions where items have been deleted.