Develop a Student Information System. The system need to implement the insertNode(), deleteNode() and displayList() functions. The insertNode() function is used to insert a new node of student record to the linked list. Assume that the input id is always unique, thus the linked list shall contain the student records with their respective id numbers are in ascending order. The displayList() function is used to display the list after inserting new node and/or after deleting a node. Please refer to the given structure definition shown in Figure 1 Your system interface should consider a few element such as user friendly, attractive and appropriate word. You may add more suitable data in the structure but limited to not more than 3. The deleteNode() function is used to remove a record of the targeted id from the linked list. The deleteNode() function shall return the target id if the record to be deleted exists, otherwise return o. struct student{ int id; char name[20]; double cpa; struct student *nextPtr3B }3;

Develop a Student Information System. The system need to implement the insertNode(), deleteNode() and displayList() functions. The insertNode() function is used to insert a new node of student record to the linked list. Assume that the input id is always unique, thus the linked list shall contain the student records with their respective id numbers are in ascending order. The displayList() function is used to display the list after inserting new node and/or after deleting a node. Please refer to the given structure definition shown in Figure 1 Your system interface should consider a few element such as user friendly, attractive and appropriate word. You may add more suitable data in the structure but limited to not more than 3. The deleteNode() function is used to remove a record of the targeted id from the linked list. The deleteNode() function shall return the target id if the record to be deleted exists, otherwise return o. struct student{ int id; char name[20]; double cpa; struct student *nextPtr3B }3;

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

Implement the algorithms in C++ program. Algorithm 1: (Traversing a Linked List) Let LIST be a linked list in memory. This algorithm traverses LIST, applying an operation PROCESS to each Node/element of the LIST. HEAD points to the first node of the LIST. Pointer variable CURR points to the node currently being processed. Step 1. Set CURR = HEAD. [Initializes pointer CURR.] Step 2. Repeat Steps 3 and 4 while CURR ≠ NULL. Step 3. Apply PROCESS to CURR -> INFO. Step 4. Set CURR = CURR -> NEXT [CURR now points to the next node.] [End of Step-2 loop.] Step 5. End Algorithm2: INSERT( ITEM) NOTE: Here it is needed that all the time, LIST should remains in the sorted order using Info part of the Node. To Insert / Enqueue a new node in the LIST, first LIST will be searched (using Info of Nodes) to find its LOCATION ( where to insert new Node). This exercise makes it possible that every new node has the probability to insert at the beginning, in the middle or at the end of LIST. CURR is…
Write a C program that reads the dimensions of a 2D array and its contents from a file calledmatrix.txt. The program should construct an array of linked lists where the array represents the rowsand the linked lists represent the elements in a row. The building block of the linked lists will be astruct
using c++ plz ............... You build the index by reading through the database account by account, inserting successive (account ID, record number) pairs into the tree as you progress through the file.Given an account ID, retrieval of the corresponding account record is a two-step process. First, you retrieve the data item from the index tree that has the specified account ID. Then, using the record number stored in the index data item, you read the corresponding account record from the database file. The result is an efficient retrieval process that is based on account ID.* Create a program that builds an index tree for the accounts database( Accountants database shown below should be saved in the file accounts.dat). Once the index is built, your program should• Output the account IDs in ascending order• Read an account ID from the keyboard and output the corresponding account recordRecord # Account ID First name Last name Balance0…
Explain the concept of a dynamic array and contrast its resizing mechanism with that of a linked list.
d. In implementing a Queue using an array, a problem might arise if the Queue is implemented in such a way that items in the Queue are inserted at the next available location and removed from the next leading position, but such that, once deleted, the emptied space is unused. The problem that arises is one where there is free space still in the array, but it is not usable because it is not at the end. Demonstrate this problem with a Queue that is stored in an array of size 5 for the following instructions. Next, explain how you might resolve this problem. Queue q constructor takes 5 as the size of the array = new Queue(5); // assume the Queue q.enqueue(3); q.enqueue(4); q.enqueue(1); q.dequeue( ); q.dequeue( ); q.enqueue(6); q.enqueue(5); q.dequeue( ); // at this point, // there are only 2 item2 in the queue q.enqueue(7); // this enqueue can not occur, why??
In this project you are to design a process queue that is responsible for handling the process requests coming from different users. You have to take into consideration that users have different levels of privileges and priorities. Each user has an identification number and a password, in addition to process priorities. One good idea is to design the queue using an array or pointers while preserving the first-in first-out concept of the queue. For every process request received, the program should check the privileges of that request and whether it can be moved forward in the queue to be served by the operating system prior to serving the other requests. Using the programming language of your choice (preferably C+), write the process queue that would handle the user request. The program must allow for requests coming from different users or from one user.
An actual working program in C that transfers contents of a file into a linked list and then performs insertion, updation, deletion and search operation on the contents of the file through a linked list. The contents of the file should be treated as a string. And all operations performed on the linked list should reflect on the file. The format of the file is: 112.22.33.44 Baker 101.32.11.23 Parson and so on.. and each line in the file should be treated as a string.
Imagine that you are in charge of arranging the information taken from books. Either more volumes should be added to the shelf, or present books should be removed from only one side of the shelf. Determine and define the data structure that is the best suited for this case. You need to come up with a dynamic approach of adding books to the shelf. What also takes place when fresh data has to be inserted into a data structure but there isn't enough capacity for it?
Imagine that you are in charge of arranging the information taken from books. Either more volumes should be added to the shelf, or present books should be removed from only one side of the shelf. Determine and define the data structure that is the best suited for this case. You need to come up with a dynamic approach of adding books to the shelf. What also takes place when fresh data has to be inserted into a data structure but there isn't enough capacity for it?
A. Suppose that q1 is a class CircularQueue object that is using circular queue concept and the maximum size of the array implementing q1 is 10. The current index value of front is 5 while the current index value of rear is 9. i. What are the index values of front and rear after adding TWO (2) elements into q1? Draw the circular queue diagram to show the addition process. ii. After implementing the process in Question 2A (i), what are the index values of front and rear after removing FIVE (5) elements from q1? Draw the circular queue diagram to show the removing process. iii. What are the current number of elements after implementing the process in Question 2A (i) and Question 2A (ii)? =======================
The most common implementation technique for regex is backtracking, a common algorithm design technique. Assuming that the implementation is simulating an NFA, and that a stack is used to store the backtracking data, give an example data structure for an entry in that stack. I.e. what fields are in this data structure, and why are they needed? An example sketch may be useful.
The map-reduce framework is quite useful for creating inverted indices on a setof documents. An inverted index stores for each word a list of all documentIDs that it appears in (offsets in the documents are also normally stored, butwe shall ignore them in this question).For example, if the input document IDs and contents are as follows:1: data clean2: data base3: clean basethen the inverted lists woulddata: 1, 2clean: 1, 3base: 2, 3Give pseudocode for map and reduce functions to create inverted indices on agiven set of files (each file is a document).Assume the document IDis availableusing a function context.getDocumentID(), and the map function is invokedonce per line of the document. The output inverted list for each word should bea list of document IDs separated by commas. The document IDs are normallysorted, but for the purpose of this question you do not need to bother to sortthem.