1) Write a program that creates and manages Fibonacci heaps. The program must implement the following operations: creation, insertion, find min, extract min, decrease key, and deletion. The program should present a menu where user may choose from implemented options. minH) min|H) 18 0-0-0-0 23 24 23 21 39 18 52 38 30 26 46 26 46 30 52 41 35 After extract min Decreasekey(52, 1) Delete 24

1) Write a program that creates and manages Fibonacci heaps. The program must implement the following operations: creation, insertion, find min, extract min, decrease key, and deletion. The program should present a menu where user may choose from implemented options. minH) min|H) 18 0-0-0-0 23 24 23 21 39 18 52 38 30 26 46 26 46 30 52 41 35 After extract min Decreasekey(52, 1) Delete 24

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 5PE

See similar textbooks

Similar questions

Programming language : Java Write the program the should determine if there exists a 3 partition of the given list, P1, P2, and P3 such that the sum of the elements in P1 minus the sum of the elements in P2 are exactly k and the sum of the elements in P2 minus the sum of the elements in P3 are also exactly k. k is a positive integer, or zero. P1, P2, and P3 are the partitions such that |sum(P1) - sum(P2)| = k and |sum(P2) - sum(P3)| = k. For example if list is given below: 1. List = [3 1 3 2 1] k = 4 Output: True The 3 partition form above list which satifies the condition is: P1 = {2}, P2 = {3, 3}, P3 = {1, 1} Sum(P1) = 2 Sum(P2) = 6 Sum(P3) = 1 + 1 = 2 |Sum(P1) - Sum(P2)| = 4 |Sum(P2) - Sum(P3)| = 4 2. List = [49 49 36 44 43 49 48 36 32 26 38] k = 88 Output: True A 3 partition that works is…
6.Need ri Write a JAVA program that will maintain a phone directory using a Linked-List. The program should be able to perform the following operations: Add persons details (first name, last name, phone number, city, address, sex and email) to the phone directory, where phone numbers in the directory have to be unique. (Note: each person record will store in one node in the linked-list and insert each person to the last) Delete any person details by a given phone number. Update telephone number by providing person first name. Display all details of persons from a phone directory. Search telephone number based on person first name. (Note: use sequential search to find all telephones for the given first name) Sort all persons in the phone directory ascending based on person first name. (Note: use bubble or selection sort to arrange the entire phone directory.
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.
Need this code in java with output Write a Menu Driven program to ask user for actions: Press ‘1’ for Enqueue Press ‘2’ for Dequeue Press ‘3’ for Displaying contents of Queue Press ‘4’for exist: Sample output: Queue using array Insertion Deletion Display Exit Enter ur choice 1 Enter no1: 22 Enter ur choice 1 Enter no1: 33 Enter ur choice 1 Enter no1: 11 Enter ur choice 3Queue elements 22 33 11 Enter ur choice 2 Deleted elements is 11Enter ur choice 2Queue is empty Enter ur choice 3 Queue elements Queue is empty Enter ur choice 4 Ur on exit
Write a python hangman program Modify your program so that the following functionality is added:1. Instead of selecting the word from a hard coded list, incorporate problem2 so that thelist is read from a file, then a word is randomly selected from this list.2. when the game ends, the following information should be outputted to a new file:● the word● the state of the hangman● if the user won or lostExample outputs:quokkaO\||You won!kangarooO\|/|/ \You lost
• Description o Please simulate a Best Fit memory block allocation algorithm. • Your program runs without command line arguments. For example, your program may run like "./P5.exe". • At the beginning, we have a linked list of 1024 nodes, each contains a free memory block of 1024 Bytes. The linked list node should contains both block id and free memory size. For Best Fit policy, your linked list needs to be sorted in the ascending order of the memory block size. Your program starts by reading a list of memory requests from a file named "requests.txt", which consists of a list with two types of requests: • A: Allocation of a memory region of a particular size. For example, "A 1 512" specifies a request with id of 1 for an allocation of 512 Bytes memory block. Request Id starts from 1 and increases incrementally. o R: Release of the memory requests by a particular request id. For example, "R 1" releases the memory allocated back to the identified memory block. • When processing each…
In c++ please explain the code Q1. Given a 'key', delete the first occurrence of this key in the linked list. Iterative Method: To delete a node from the linked list, we need to do the following steps. 1) Find the previous node of the node to be deleted. 2) Change the next of the previous node. 3) Free memory for the node to be deleted.
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
True or False For each statement below, indicate whether you think it is True or False. If you like, you can provide a description of your answer for partial credit in case you are incorrect. Given a stack implemented as an array, and the following functions performed: Push(A), Push (B), Push(C), Pop(), Push(D), Push(E), Pop(), Push(F) The array will be [A][B][D][F] and the “top” of the stack will be at index 3 where [F] is The next element that will be removed when Pop is called will be A If we Push(G), [G] will be inserted at index 0 Given a queue implemented as an array with a maximum capacity of 5 elements and O(1) insert and remove, and the following functions are performed: Insert(7), Insert(6), Insert(5), Insert(4), Remove(), Remove(), Insert(3), Insert(2), Insert(1), Remove() The removeIndex value will be index 4 The array will be [2][1][ ][4][3] The insertIndex value will be index 2 Given a priority queue implemented as a standard linked list with only a…
Problem 3 In HW6, you wrote a C program that performs state-space search for the 15-Puzzle similar in principle to those used in game engines. This search consists of a main loop that operates on two major lists open and closed and a small list, successors. Write a C program that performs A* search using open, closed, succ, expand(node), filter(succ, list), merge(lst1,lst2). Write the main loop and merge(). DO NOT write filter() and expand(). Again, use the same structure used in the homework. Assume the values used for node selection are computed and insertion functions listed below are available:struct node *insert_by_h(node,lst),*insert_by_g(node,lst),*insert_by_f(node,lst); /* insert a node to list */struct node { int loc[N+1][N]; /* the last row holds the three values used for node selection */ struct node *next;} *start,*goal;struct node *initialize(),*expand(),*merge(),*filter();int main(int argc,char **argv) {struct node…
In C++, Write a program that will inputstudent’s information (i.e. name, id, cgpa) who have enrolled forCSE-207 course in Spring 2022. You have to declare a pointer variable to inputthe information and dynamically allocate memory for storing information of eachstudents. You have to implement the following operation.i) Create a list with the given studentsinformationii) Delete a student of a given idiii) Print the student having highest CGPAiv) Sort and print the student id and namedescending order based on the CGPA.
Prob 5 Given a list of x objects, create a program that performs the following operation: -Get the first and last object and place them both at the end of the list. Example: QWERT becomes WERQT Find the worst case time complexity if the solution will be implemented using a dequeue. Give both the EQUATION AND THE BIG-O NOTATION.