
(a)
To finds the correct values in the extracted array of sequence
(a)

Explanation of Solution
The EXTRACT-MIN
The INSERT algorithm is used to insert the value after the minimum value in the off-line minimum problem.
The algorithm takes the sequence of number and generates the corresponding values. The correct values in the extracted array are given in table below:
INDEX | VALUE |
1 | 4 |
2 | 3 |
3 | 2 |
4 | 6 |
5 | 8 |
6 | 1 |
The algorithm picks the minimum from the sequence by considering the sequence and then it remove that value then add to the extracted array and the remaining keys are added to the old sequence by using insert algorithm.
(b)
To argue the array extracted returned by OFF-LINE-MINIMUM is correct.
(b)

Explanation of Solution
The OFF-LINE-MINIMUM algorithm find the minimum number from the available sequence by using the extract min and then it add the remaining number to the sequence using insert operation.
The algorithm pick the smallest element from the available element then removed it from the sequence then it checks that the extracted value is minimum or not and combine the set of elements that needs to inserted in the sequence that is remaining elements other than min is combined to the original sequence.
Every iteration of the algorithm is extracted the minimum one by one and added to the extracted array until the last is extracted and stored to the array.
Therefore, the output returns from the algorithm is correct and have finite sequence.
(c)
To describe the implementation of OFF-LINE-MINIMUM algorithm for disjoint set data structure and also gives a tight bound of the implementation.
(c)

Explanation of Solution
The algorithm pick the smallest element from the available element then removed it from the sequence then it checks that the extracted value is minimum or not and combine the set of elements that needs to inserted in the sequence that is remaining elements other than min is combined to the original sequence.
The implementation of the disjoint set of data structure through OFF-LINE-MINIMUM algorithm is given below:
Step 1: Select the disjoint sets.
Step 2: Check that
Step 3: Then add all the values of
Step 4: Find the appropriate value of
Step 5: For every
After removing
For the every value of
Therefore, the total running time of the implementation of algorithm for disjoint set is
Want to see more full solutions like this?
- solve this questions for me .arrow_forwarda) first player is the minimizing player. What move should be chosen?b) What nodes would not need to be examined using the alpha-beta pruning procedure?arrow_forwardConsider the problem of finding a path in the grid shown below from the position S to theposition G. The agent can move on the grid horizontally and vertically, one square at atime (each step has a cost of one). No step may be made into a forbidden crossed area. Inthe case of ties, break it using up, left, right, and down.(a) Draw the search tree in a greedy search. Manhattan distance should be used as theheuristic function. That is, h(n) for any node n is the Manhattan distance from nto G. The Manhattan distance between two points is the distance in the x-directionplus the distance in the y-direction. It corresponds to the distance traveled along citystreets arranged in a grid. For example, the Manhattan distance between G and S is4. What is the path that is found by the greedy search?(b) Draw the search tree in an A∗search. Manhattan distance should be used as thearrow_forward
- whats for dinner? pleasearrow_forwardConsider the follow program that prints a page number on the left or right side of a page. Define and use a new function, isEven, that returns a Boolean to make the condition in the if statement easier to understand. ef main() : page = int(input("Enter page number: ")) if page % 2 == 0 : print(page) else : print("%60d" % page) main()arrow_forwardWhat is the correct python code for the function def countWords(string) that will return a count of all the words in the string string of workds that are separated by spaces.arrow_forward
- Consider the following program that counts the number of spaces in a user-supplied string. Modify the program to define and use a function, countSpaces, instead. def main() : userInput = input("Enter a string: ") spaces = 0 for char in userInput : if char == " " : spaces = spaces + 1 print(spaces) main()arrow_forwardWhat is the python code for the function def readFloat(prompt) that displays the prompt string, followed by a space, reads a floating-point number in, and returns it. Here is a typical usage: salary = readFloat("Please enter your salary:") percentageRaise = readFloat("What percentage raise would you like?")arrow_forwardassume python does not define count method that can be applied to a string to determine the number of occurances of a character within a string. Implement the function numChars that takes a string and a character as arguments and determined and returns how many occurances of the given character occur withing the given stringarrow_forward
- Consider the ER diagram of online sales system above. Based on the diagram answer the questions below, a) Based on the ER Diagram, determine the Foreign Key in the Product Table. Just mention the name of the attribute that could be the Foreign Key. b) Mention the relationship between the Order and Customer Entities. You can use the following: 1:1, 1:M, M:1, 0:1, 1:0, M:0, 0:M c) Is there a direct relationship that exists between Store and Customer entities? Answer Yes/No? d) Which of the 4 Entities mention in the diagram can have a recursive relationship? e) If a new entity Order_Details is introduced, will it be a strong entity or weak entity? If it is a weak entity, then mention its type?arrow_forwardNo aiarrow_forwardGiven the dependency diagram of attributes {C1,C2,C3,C4,C5) in a table shown in the following figure, (the primary key attributes are underlined)arrow_forward
- Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage LearningC++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage LearningProgramming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage
- C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology PtrOperations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks ColeCOMPREHENSIVE MICROSOFT OFFICE 365 EXCEComputer ScienceISBN:9780357392676Author:FREUND, StevenPublisher:CENGAGE L



