The file data.txt contains numbers representing priorities. Priorities range from 1 to 99, and higher numbers indicate higher priority. Write code that reads the numbers one by one, creates a priority queue using a max heap, and pops data when the number is O. Each time data is popped from the priority queue, print the contents of the priority queue. data.txt 43 30 15 22 55 27 0 32 0 0 48 0 77 78 0 0 56 0 This is the output for the first problem Enter filename: data.txt 55 popped 43 30 27 22 15 43 popped 32 30 27 22 15 32 popped 30 22 27 15 48 popped 30 22 27 15 78 popped 77 30 27 15 22 77 popped 30 22 27 15 56 popped 30 22 27 15

The file data.txt contains numbers representing priorities. Priorities range from 1 to 99, and higher numbers indicate higher priority. Write code that reads the numbers one by one, creates a priority queue using a max heap, and pops data when the number is O. Each time data is popped from the priority queue, print the contents of the priority queue. data.txt 43 30 15 22 55 27 0 32 0 0 48 0 77 78 0 0 56 0 This is the output for the first problem Enter filename: data.txt 55 popped 43 30 27 22 15 43 popped 32 30 27 22 15 32 popped 30 22 27 15 48 popped 30 22 27 15 78 popped 77 30 27 15 22 77 popped 30 22 27 15 56 popped 30 22 27 15

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

CS Principles Unit 6 Assessment (page 3 of 3) 11. A group of students writes their names and unique student ID numbers on sheets of paper. The sheets are then randomly placed in a stack. Their teacher is looking to see if a specific ID number is included in the stack. Which of the following best describes whether their teacher should use a linear or a binary search? A. The teacher could use either type of search though the linear search is likely to be faster B. The teacher could use either type of search though the binary search is likely to be faster C. Neither type of search will work since the data is numeric D. Only the linear search will work since the data has not been sorted 0000
JAVA CODE PLEASE 2. Linked List Quiz by CodeChum Admin Write a function printNodes that takes in the head of a linked list and prints all the values of that linked list using a while loop. Print the values separated by a [space]->[space] Create a program that accepts 10 integer inputs. Assign each input into a node and link them in ascending order then print the linked list. Create another two linked lists: One for nodes with even numbers and the other one for odd numbers. Print them respectively using the printNodes function. Input 1. One line containing an integer 2. One line containing an integer 3. One line containing an integer 4. One line containing an integer 5. One line containing an integer 6. One line containing an integer 7. One line containing an integer 8. One line containing an integer 9. One line containing an integer 10. One line containing an integer Output Enter·number·1:·1 Enter·number·2:·2 Enter·number·3:·3 Enter·number·4:·4…
8)A college has 5 departments, the total intake of each departments are 60, 76, 45, 80, 62 Use a sort technique that works by repeatedly stepping through the above intake values, and then enqueue the elements in a queue, one after another and display them.
3- Write a program that randomly generates 10 numbers (between 1 and 8), inserts into queue and then finds how many distinct elements exist in the queue. Example 1: Example 2: Queue: 2 40 3 3 2 18 4 18 18 3 Queue: 1 1 4 33 16 16 4 16 4 Output: 5 Output: 4 Notes: • You must use ONLY queue data structure. Don't use other different data structures like string or normal (pure) array or stack or array list. • Don't write any other method in the Qeueu class. All methods must be written in the main program.
Radix Sorting Algorithm In C++, implement the radix sorting algorithm using a queue class.Steps: Create a queue filled with 10 random integers between 1000 and 9999. Next, create a list of 10 empty queues (0-9 digit bins), then dequeue each number from the main queue and enqueue them into the correct digit bin. Dequeue the numbers from each digit bin in order and enqueue them back into the main queue. Repeat the process for every digit (tens, hundreds, thousands, etc.) Finally, print the sorted list.
Queues array allows the .... memory allocation of its data elements. Select one: a. state b. static c. dynamic
Lab Tasks # 1: Write a program which should implement a linear linked list. Elements of this linked list should be of integer type, user will provide values as input for elements of this linked list. Your program should allow searching of a value specified by user in linked list and it will also allow deletion of a value specified by user. Lab Tasks # 2: Write a program which should implement a linear linked list. Elements of this linked list should be of integer type, user will provide values as input for elements of this linked list. Your program should allow searching of a value specified by user in linked list and display also it index. Lab Tasks # 3: Write a program which should implement a linear linked list. Elements of this linked list should be of float type, user will provide values as input for elements of this linked list. Your program should allow deletion of a value of fist and last node of link list.
python programming Write a function that will insert a new value into the middle of a Linked List. INPUT: The head of the Linked List, the value to insert OUTPUT: Nothing is output RETURNED: Nothing is returned
6. Recall that in the ArrayBoundedStack the items in the stack are stored in the array called elements. The toplndex field holds the index where the current top of stack is stored. If a stack is full, then its toplndex variable is: А. DEFCAP - 1 C. elements.length - 1 E. DEFCAP B. elements.length D. 0
In this assignment you are going to create an application that reverses a text file and saves it. This application is a single file application so you do not need to think about additional classes; you will simply have a main.cpp file. Your application should accomplish: In main, create a stack. Then, open a text file and read its contents into a stack of characters.. The program should then pop the characters from the stack and save them in another text file. As this is a stack, (LIFO, so last item you put into the stack gets the first one to come out), the new file will be the reverse of the other. So if the text file at first said KHAS, the new file must have SAHK.
You have a sorted linked list. Fill in the missing code in the following function. SortedType::DeleteItem(Item Type item) // pointer delete //trailing pointer // traveling pointer void { NodePtr tempPtr; NodePtr predLoc; NodePtr location: bool found false; // Find item to delete: Put your code below //delete item: Put your code below
P5:Given the following singly linked list: s->m->h->t->y->h->r If you run the following function, then print out the linked list, what do you get? void SLL::f3() ( SNode *tmp; SNode *tmp2 - first; // holds the address of "s" while (tmp2->next !- NULL) { tmp = tmp2->next; tmp2->next = tmp2->next->next; tmp->next = first; first = tmp; last = tmp2;