Write a class Roster that is identified by the course name, course code, number of credits, instructor name, and contains a list of students stored in an array, For now you can use stack allocated array of MAX_CAPACITY=10 (define MAX__CAPACITY as a macro in the .h file). Later we will make this array dynamic to allow it to grow. Provide necessary constructors, accessor functions for each member, and mutator functions for each member. Provide a function to add a student to a Roster, delete student from a Roster, and search for a student. Provide a function to output all Students from a roster to console in a nice format. For now you should not worry about the order of Students in your Roster. They do not need to be sorted. Write a driver program to test your Roster class. Use declare/define/use approach

Write a class Roster that is identified by the course name, course code, number of credits, instructor name, and contains a list of students stored in an array, For now you can use stack allocated array of MAX_CAPACITY=10 (define MAX__CAPACITY as a macro in the .h file). Later we will make this array dynamic to allow it to grow. Provide necessary constructors, accessor functions for each member, and mutator functions for each member. Provide a function to add a student to a Roster, delete student from a Roster, and search for a student. Provide a function to output all Students from a roster to console in a nice format. For now you should not worry about the order of Students in your Roster. They do not need to be sorted. Write a driver program to test your Roster class. Use declare/define/use approach

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

we use this scheme of choosing the rightmost item in the array as the pivot, we’llneed to modify the partitionIt() member function to exclude this rightmost item fromthe partitioning process. After all, we already know where it should go after thepartitioning process is complete: at the partition, between the two groups. Also, once the partitioning process is completed, we need to swap the pivot from the right end into the partition’s location. shows the quickSort1.cpp program, which incorporates these features.
Write a program to create array of objects for the same to access these. Also, make use of member functions to accept values and print the name, age, designation and salary.
Which one of the following function prototype can possible do the following? A function with one reference parameter is a pointer to an integer. The function allocates a dynamic array of n integers, making the pointer point to this new array. It then fills the array with 0 through n - 1. Group of answer choices void exercise(int*& p, size_t n); void exercise(const int*& p, size_t n); void exercise(const int p, size_t n); void exercise(int& p, size_t n); void exercise( int p, size_t n);
Implement a main program that defines a dynamically created array, consisting of objects of class Candidate, and calls three functions: to. getVotesCandidate: Function that asks the user for the name and votes of the candidate. b. displayStatistics: function that prints the three columns the name of the candidate, the number of votes obtained and calculates the percentage it represents with respect to the total sum of the votes of the possible candidates. c.getHighestIndex: Function that returns the index where the highest number of votes obtained among the candidates is stored
Write a program that will sort a prmiitive array of data using the following guidelines - DO NOT USE VECTORS, COLLECTIONS, SETS or any other data structures from your programming language. The codes for both the money and currency should stay the same, the main focus should be on the main file code (Programming language Java) Create a helper function called 'RecurInsSort' such that: It is a standalone function not part of any class from the prior lab or any new class you feel like creating here, Takes in the same type of parameters as any standard Insertion Sort with recursion behavior, i.e. void RecurInsSort(Currency arr[], int size) Prints out how the array looks every time a recursive step returns back to its caller The objects in the array should be Money objects added or manipulated using Currency references/pointers. It is OK to print out the array partially when returning from a particular step as long as the process of sorting is clearly demonstrated in the output. In…
Write a maxConsecutiveDiff function which returns the maximum difference between any two consecutive values in the array.Consecutive values are next to each other in an array (+/- 1 index)This function should accept all required data as parameters.ExamplesIf the array is 17 15 16 11 14 the maximum consecutive difference is 5 which is the difference between 16 and 11.If the array is 10 13 11 12 19 the maximum consecutive difference is 7 which is the difference between 12 and 19.
Suppose we implement the += operator as shown in the following. What goes wrong with b += b ? void bag::operator +=(const bag& addend) // Library facilities used: cassert{ size_type i; // An array index assert(size( ) + addend.size( ) <= CAPACITY); for (i = 0; i < addend.used; ++i) { data[used] = addend.data[i]; ++used; }} Group of answer choices If we activate b += b, then the private member variable size is the same variable as addend.size. The size( ) + addend.size( ) is less than CAPACITY. So the program after the assert statement will be executed. If we activate b += b, then the private member variable size is the same variable as addend.size. The size( ) + addend.size( ) is larger than CAPACITY. So the program after the assert statement will not have chance to be executed. If we activate b += b, then the private member variable used is the same variable as addend.used. Each iteration of the loop adds 1 to used, and hence…
Suppose you want to maintain information on the location where a product is stored in awarehouse. Would you use a three-dimensional array such as location[i][j][k], where I is thewarehouse, j is the aisle number and k is the bin number? Or would you define three classesWarehouse, Aisle and Bin? Describe the alternatives and list their pro and cons
Write a function called remove_punct() that accepts an array of characters and the number of items in the array as parameters, removes the punctuation (',', '!', '.') characters from the array, and returns the number of punctuation characters removed. For example, if the array contains ['C', 'p', 't', 'S', ',', '1', '2', '1', '.', 'i', 's', 'f', 'u', 'n', '!'], then the function should remove the punctuation characters. The function must remove the characters by shifting all characters to the right of each punctuation character, left by one spot in the array. This will overwrite the punctuation characters, resulting in: ['C', 'p', 't', 'S', '1', '2', '1', 'i', 's', 'f', 'u', 'n']. In this case, the function returns 3. Note: if the array does not contain any punctuation characters, then the array is unchanged and the function returns 0.
Make a new DevC++ project named “yourID_InitialsofYourName_P9_Q2”. In thefile “main.c” under this project, use your function which manipulates an existing2D array dividing every element by 2. Use call by reference technique.Declare your function in h-file named“yourID_InitialsofYourName_P9_Q2_2DArrayDivision” and implement it in c-filenamed “yourID_InitialsofYourName_P9_Q2_2DArrayDivision”.
(This if for mindtap on cengage, if not possible, use devc++ 5.11 but mindtap is more accurate) Write a C++ function, smallestIndex, that takes as parameters an int array and its size and returns the index of the first occurrence of the smallest element in the array. To test your function, write a main that prompts a user for a list of 15 integers and outputs the index and value of the first occurrence of the smallest value. An example of the program is shown below: (look at picture) You can use the following integer lists to test your code: 56, 34, 67, 54, 56, 87, 66, 92, 15, 32, 55, 54, 88, 92, 30 79, 26, 97, 87, 73, 44, 67, 46, 55, 13, 20, 20, 33, 42, 60 63, 1, 40, 81, 30, 11, 26, 44, 98, 1, 80, 98, 15, 3, 42
Write a function named "getDynamicArrayOfPointersToDouble" that accepts an array of double and its size. The function will allocate an array of the same size of double pointers dynamically (using new operator) For each number in the given array, it will allocate memory for each double initialized it with that value and save the pointer in the new array.It then returns the pointer of the array of double pointers to the caller. In another words, it builds an array of double pointers from the given array of doubles. Here is an example of calling "getDynamicArrayOfPointersToDouble"with the array of 4 doubles of {10, 20, 30, 40}.It will allocate an array of 4 pointers each will point to double which contains 10, 20, 30 and 40 respectively. The caller should print out this array based on that description.