For the purposes of deciding which card is the higher card, cards are ranked in the normal way (with the Ace being the card of highest rank) : 2, 3, 4, 5, 6, 7, 8, 9, T, J, Q, K, A. Whoever flipped over the higher ranked card takes both cards in the center and adds them to the bottom of their packet in the same order they were revealed. Player 2 does the same with the top card from his or her pile. Instead, player 1 removes the top card of his or her pile and places it face-up in the center of the table. Niether player looks at his or her cards. One wins the game by taking all of one's opponent's cards. In the card game War, a standard 52-card deck is dealt to two players so that each player ends up with a pile of 26 cards. Here are the people killed, in the order they died: Of course, if a person in the circle is killed - that's more like removing them without adding them back.Įnter the total number of people in a circle:Įvery nth person will be killed. Hints: Note how similar moving through a circle is to moving someone from the front of a line to its end. Use the QueueArray implementation of the Queue interface to accomplish this task. Write a class Josephus that prompts the user for a number of people in a circle, and a value $n$, where every $n^$ person will be killed, and then finds (using a queue) and displays the positions of those people killed, in the order they died, in a manner similar to the one shown in the sample run below. The precise mechanism for choosing the order of the executions was not completely described in Josephus' account, however in 1612 Claude Gaspar Bachet (the writer of books on mathematical puzzles and tricks that formed the basis for almost all later books on mathematical recreations) suggested that the men arranged themselves in a circle, and then started counting by threes from a randomly selected man. Josephus states that by luck or possibly the hand of God, he and another man remained until the end and surrendered to the Romans rather than killing themselves.
#List stack queue exercises serial#
Choosing suicide over capture, they settled on a serial method of committing suicide where each person to die would be killed by the next person to die. Suppose a tree has four nodes A, B, C, and D.A Jewish historian living in the 1st century named Flavius Josephus gave an account of the siege of Yodfat, where he and his 40 soldiers were trapped in a cave by Roman soldiers. If a letter is now removed from the queue, which letter will it be? 5. List the letters that would be in the queue in the order they would appear from head to tail. Then suppose that a letter is removed from the queue and the letters D and E are inserted. Suppose the letter A is placed in an empty queue, followed by the letters B and C, in that order. If a let- ter is popped off the stack, which letter will be retrieved? 4. List the letters that would be on the stack in the order they would appear from top to bottom. Then suppose that a letter is popped off the stack and the letters D and E are pushed on. Suppose the letter A is pushed onto an empty stack, followed by the let ters B and C, in that order. Summarize the distinction between lists, stacks, and queues. Give examples (outside of computer science) of each of the following structures: list, stack, queue, and tree 2.
Transcribed image text: Questions & Exercises 1.
0 kommentar(er)
