Answered: Create a minheap birthday reminder…

Create a minheap birthday reminder system where the heap is ordered daily according to the number of days till the person's birthday. Remember that the heap must be rearranged after each birthday.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

You recently got a job as a library assistant. You are assigned to sort an archive of files. Files are marked by how old they are by years and you need to put the most recent files on the left.Here’s the stack of files- file5, file20, file9, file15, file13 Name which sorting algorithm you will use to sort the lab files (Heap, Merge or Quick). The Head librarian handed you a file labeled as File30. He told you, “I don’t care where other files are, just put this file in its place.”Use an algorithm to insert the file in the right place.
The array below is used to store the values from a Heap. What would be the content of the array after we remove the maximum value ? Index 1 2 3. 4 6. 7 8. 9. 10 11 12 13 Value 79 77 57 38 59 22 32 1 12 41 26
You are the manager of the train depot. One of your tasks is to efficiently order the train cars so that it is easy to attach and detach them. In this assignment, you will implement Train Cars program that reads car details from the file called car.txt (given) and stores them in a LinkedList data structure. Cars in the train are linked in a specific order. Each car in the train contains various materials that must be attached and detached in the most efficient manner possible. Each car ( node of type Car) has a stop number, factory name, material name. Stop number – determines which stop the car must be detached, use this to order the train cars. They should be ordered either in increasing or decreasing stop numbers. Factory Name – name of the factory at which the car must be detached Material Name – name of the material being transported in the car. For example, the Jiffy Mix plant at stop 2 needs sugar, flour, cornmeal, etc. Write the program to perform each operation…
Task 07: The concept of Tower of Hanoi discusses a mathematical puzzle where we have three rods and n disks. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: 1. Only one disk can be moved at a time. 2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack. 3. No disk may be placed on top of a smaller disk. Write a program that takes number of disks as input and prints a sequence of steps to solve Tower of Hanoi problem. hint: If number of disks are 3, the program prints following sequence: Move disk I from rod A to rod C Move disk 2 from rod A to rod B Move disk I from rod C to rod B Move disk 3 from rod A to rod C Move disk 1 from rod B to rod A Move disk 2 from rod B to rod C Move disk I from rod A to rod C
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
Project 2 Use Netbeans, to write a simple java program using the following data structures: 1. Stack by Linked List2. Circular Queue by Array The program should implement the following functions: 1. Insert2. Read/Print3. Remove an item4. Delete (the entire list) On the initial start of the program, users should be prompted for at least five elements into the list. After which they should be presented with options that will allow them to perform the functions defined above. Note that exception handling must be implemented. Screenshots of the cods as proof of its implementation should be included
Given the list of integers 2,-10, 12, 25, -32, 22, 56, 5, you are required to find the element whose rank is 4. This is the element whose index is 4, when the list is sorted in increasing order and indexed from 1 to 8. You are not allowed to sort the entire list; instead, you must use the PARTITION procedure discussed in class for QuickSort to partition the above list, determine which list contains the element you are looking for and recursively continue with this abbreviated list. Make a table with two columns: the first column enumerates the list in which the element lies and the second column states its rank in this list. Thus the first (and trivial) row entry would have the above list in the first column and 4 in the second column.
Assume you have a folders of (images and videos) in your computer which contain some random mix numerical values. Your task is to separate images (e.g odd values) and videos (e.g Even values). So that all the images and videos are stored in separate folders (lists). While separating make sure that any of the folder (lists) should not contain any duplicate file or duplicate value. In this task images and videos odd & even numbers and folder means a single list of mix value. e.g: linkedlists (odd, even). Design a method for above task which will create two separate linked lists and write main method to test your program. FOLDER (VIDEO AND IMAGES:ODD AND EVEN VALUES) LIST 0: [2, 44 , 24 , 82 , 33 , 44 , 55 , 11 , 2 , 44 , 55]: EVEN VALUES_LIST 1: [2, 44 , 24 , 82]: A=2, B=44, C=24, D=82 ODD VALUES:_LIST 2: [33 , 44 , 55 , 11]: A=33, B=45, C=55, D=11
CODE IN JAVA You have probably heard about the deque (double-ended queue) data structure, which allows for efficient pushing and popping of elements from both the front and back of the queue. Depending on the implementation, it also allows for efficient random access to any index element of the queue as well. Now, we want you to bring this data structure up to the next level, the teque (triple-ended queue)!
Instructions: Implement a merge sort in Java, creating a class to hold the main method as well as the mergesort method (which should be a static method). The mergesort method should be able to use any Collection object and it should return a Collection that contains the contents of the original Collection, but in sorted order. The program must ask the user for the data to sort, using numeric data in this case, but your mergesort method must be capable of working with any Collection of Comparable objects. Use recursion.
You are working for GreatDataStructures Inc. You have to pick a data structure for a problem that requires accessing all the stored elements quickly as well as adding elements to and removing elements from the end of the list of elements. The number of elements in the list is not known. The best data structure to choose is a linked list with no tail reference a linked list with a tail reference a doubly-linked list an array list O an array stack
2.