Exercise 5 The towers of Hanoi problem consists of three pegs A, B, and C, and n squares of varying sizes. Initially the squares are stacked on peg A in order of decreasing size, the largest square on the bottom. The problem is to move the squares from peg A to peg B one at a time in such a way that no square is ever placed on a smaller square. Peg C may be used for temporary storage of squares. A. Write a recursive algorithm to solve this problem. Answer here:

Exercise 5 The towers of Hanoi problem consists of three pegs A, B, and C, and n squares of varying sizes. Initially the squares are stacked on peg A in order of decreasing size, the largest square on the bottom. The problem is to move the squares from peg A to peg B one at a time in such a way that no square is ever placed on a smaller square. Peg C may be used for temporary storage of squares. A. Write a recursive algorithm to solve this problem. Answer here:

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

Devise an efficient divide-and-conquer algorithm for the Towers of Hanoi problem when the disks are colored alternately red and blue, and we add the extra rule that no disk may be placed on any other disk of the same color.
Suppose you’re consulting for a bank that’s concerned about fraud detection, and they come to youwith the following problem. They have a collection of n bank cards that they’ve confiscated, suspectingthem of being used in fraud. Each bank card is a small plastic object, containing a magnetic stripe withsome encrypted data, and it corresponds to a unique account in the bank. Each account can have manybank cards corresponding to it, and we’ll say that two bank cards are equivalent if they correspond to thesame account.It’s very difficult to read the account number off a bank card directly, but the bank has a high-tech “equivalence tester” that takes two bank cards and, after performing some computations, determines whether theyare equivalent.Their question is the following: among the collection of n cards, is there a set of more than n/2 of themthat are all equivalent to one another? Assume that the only feasible operations you can do with the cardsare to pick two of them and plug them…
Answer in C++, show example output please There are three buckets size X, Y, M (1<=X<=Y<=M). All three buckets are initiallyempty. Using these three buckets, we can perform any number of the following twotypes of operations. We can fill the smallest bucket (of size X) completely to the top with X units of water andpour it into the size-M bucket, as long as this will not cause the size-M bucket tooverflow. We can fill the medium bucket (of size Y) completely to the top with Y units of water andpour it into the size-M bucket, as long as this will not cause the size-M bucket tooverflow. Although we may not be able to completely fill the size-M bucket, but we can stilldetermine the maximum amount of milk we can possibly add to largest bucket. Sample input:17 25 77 Sample output:76 In this example, we fill the bucket of size 17 three times and then bucket of size 25once, accumulating a total of 76 units of water. You could use additional test case to test your program:Input: 52 791…
Let's consider two files named File1 and File2. Inside these files, there are only four symbols, the symbols A, C, G and T, mixed and repetitive. We know how many times each of these symbols occurs. We want to use Huffman encoding to compress these files. a) Huffman encoding fails to do any compression for File1. In this case, what would be the frequency of occurrence of symbols A, C, G and T in File1? (You can give any frequency distribution that results in zero compression.) In the example you gave, apply Huffman coding and show that there is no compression at all. b) Is it possible to compress more than 50% with Huffman encoding for a file containing only 4 different symbols? Why? Briefly explain your answer.
Use C, C++, python or matlab to develop a program whose main routine accepts two parameters n and k, i.e. when you invoke your program from the shell, you pass it two parameters, n and k, where n >=16 and k >=3 and is in powers of 2 (e.g. 2, 4, 8, 16, etc.). Your main routine shall generate a random page trace of size n, where the page numbers have values ranging from 0 to ? − 1. Develop a subroutine within your program that implements the LRU page replacement algorithm (as a separate function within your program). Your algorithm shall use the doubly linked list stack implementation as outlined in slide 29 of lecture 10). The function shall accept a page trace and a parameter f for the number of frames allocated. Your main routine shall then apply the random page trace to the subroutine implementing the page replacement algorithm, multiple times (using only one trace, randomly generated), passing a parameter f (number of page frames used) that ranges from 4 to k. Your main…
Write the program tail, which prints the last n lines of itsinput. By default, n is 10, let us say, but it can be changed by an optionalargument, so thattail -n prints the last n lines. The program should behave rationally no matter howunreasonable the input or the value of n. Write the program so it makes thebest use of available storage; lines should be stored as in the sorting program of, not in a two-dimensional array of fixed size
Matlab: How do I plot semilogx() multiple times? The program reads an uploaded file and then plots column 1 on the log axis and column 3 on the linear axis, but only when it sees "Day= " data.csv: Bacterial Data Day= 1 1e-16 14.32 99.23 90.323e-19 9.23 89.23 9.454e-21 12.45 9.74 1.22 Bacterial Data Day= 2 2e-17 19.32 29.23 3.325e-18 56.23 9.23 7.453e-21 92.45 19.74 14.45 Bacterial Data Day= 3 1.5e-15 89.23 90.31 89.122.e-19 14.55 17.89 78.133.9e-21 2.33 11.23 9.32
What does the following program do, assuming a set of integers are stored starting at location x4000 and MASK is used to force the program to branch somewhere?.ORIG x3000LD R0, NUMSLD R2, MASKLOOP LDR R1, R0, #0BRz DONEAND R5, R1, R2BRz LP1BRnzp NEXTLP1 ADD R1, R1, R1STR R1, R0, #0NEXT ADD R0, R0, #1BRnzp LOOPDONE HALTNUMS .FILL x4000MASK .FILL x8000.ENDa. add only positive integers.b. add only negative integers.c. doubles only the positive integers.d. doubles only the negative integers.e. None of the above.
Implement a system of three concurrent processes which read and write sequence numbers to a file. Each of the three processes must obtain 200 integers from the file. The file only holds one integer at a given time. Given a file, F, containing a single integer, each process must perform the following steps: Please show steps and answer.
Write a program in C++ that reads data from a file. Create dynamic memory according to the data. Now your task is to perform the following task. Row wise Sum Column wise Sum Diagonal wise Sum Example data.txt 4 5 1.6 10.2 33.7 99 20.5 3 44 50 96.1 2 8 9 4 74 50 99 19.1 Output: Sum row wise: 165, 191, 17, 242.1 Sum col wise: 127.6, 120.1, 228.8, 118.1, 20.5 Sum diagonal wise: Not Possible Note: You are restricted to use pointers and your function should be generic as we discussed in class. Avoid memory wastage, memory leakage, dangling pointer. Use regrow or shrink concepts if required.
Solve the following problem using python and jupyter notebook, plus matplotlib. Here have two datasets regarding information on each cup soccer team in the World Cups: Year 2002: Position,Team,Games Played,Win,Draw,Loss,Goals For,Goals Against,Goal Difference,Points.1,Brazil,7,7,0,0,18,4,14,212,Germany,7,5,1,1,14,3,11,163,Turkey,7,4,1,2,10,6,4,134,South Korea,7,3,3,2,2,2,8,6,2,115,Spain,5,3,2,0,10,5,5,116,England,5,2,2,1,6,3,3,87,Senegal,5,2,2,1,7,6,1,88,United States,5,2,1,2,7,7,0,79,Japan,4,2,1,1,5,3,2,710,Denmark,4,2,1,1,5,5,0,7 Year 2022: Position,Team,Games Played,Win,Draw,Loss,Goals For,Goals Against,Goal Difference,Points.1,Argentina,7,6,0,1,15,8,7,182,France,7,5,0,2,16,8,8,153,Croatia,7,4,2,1,8,7,1,144,Morocco,7,4,1,2,6,5,1,135,England,5,3,1,1,13,4,9,106,Netherlands,5,3,1,1,10,4,6,107,Portugal,5,3,0,2,12,6,6,98,Brazil,5,3,0,2,8,3,5,99,Japan,4,2,0,2,5,4,1,610,Senegal,4,2,0,2,5,7,-2,6 You are requested to perform: A) Remove rows with null data from both datasets.B) Apply a…
Use C, C++, python or matlab to develop a program whose main routine accepts two parameters n and k, i.e. when you invoke your program from the shell, you pass it two parameters, n and k, where n >=16 and k >=8and is in powers of 2 (e.g. 8, 16, 32, etc.). Your main routine shall generate a random page trace of length n, where the page numbers have values ranging from 0 to ? − 1. Develop a subroutine within your program that implements the FIFO page replacement algorithm (as a separate function within your program). The function shall accept a page trace and a parameter f for the number of frames allocated. Your main routine shall then apply the random page trace to the subroutine implementing the page replacement algorithm, multiple times (using only one trace, randomly generated), passing a parameter f (number of page frames used) that ranges from 4 to k. Your main routine shall then record the number of page faults for each run (i.e. for each f).Run your program using a page…