10. Given is an ordered deck of n cards numbered 1 to n with card I at the top and card n at the bottom. The following operation is performed as long as there are at least two cards in the deck: Throw away the top card and move the card that is now on the top of the deck to the bottom of the deck. Your task is to find the sequence of discarded cards and the last, remaining card. Each line of input (except the last) contains a number 2 5ns 52. The last line contains 0 and this line should not be processed. Sample: Input: 7 19 2 Output: Discarded cards: 1, 3, 5, 7, 4, 2, Remaining card: 6 Discarded cards: 1,3, 5, 7,9, 11, 13, 15, 17, 19, 4, 8, 12, 16, 2, 10, 18, 14, Remaining card: 6 Discarded cards: 1, Remaining card: 2

10. Given is an ordered deck of n cards numbered 1 to n with card I at the top and card n at the bottom. The following operation is performed as long as there are at least two cards in the deck: Throw away the top card and move the card that is now on the top of the deck to the bottom of the deck. Your task is to find the sequence of discarded cards and the last, remaining card. Each line of input (except the last) contains a number 2 5ns 52. The last line contains 0 and this line should not be processed. Sample: Input: 7 19 2 Output: Discarded cards: 1, 3, 5, 7, 4, 2, Remaining card: 6 Discarded cards: 1,3, 5, 7,9, 11, 13, 15, 17, 19, 4, 8, 12, 16, 2, 10, 18, 14, Remaining card: 6 Discarded cards: 1, Remaining card: 2

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

Related questions

Q: Given a balanced expression that can contain opening and closing parenthesis, check if it contains…

A: #include <iostream>#include <stack>using namespace std; //function to find duplicate…

Q: Test the program using the following procedure (Use Linked List): Call enQueue(5) Call enQueue(2)…

A: Code: #include <bits/stdc++.h>using namespace std; struct QNode { int data; QNode*…

Q: Become familiar with the behavior of the stack in situations in which it is allowed to be itself.

A: A stack is a data structure used in computer science that adheres to the Last-In-First-Out (LIFO)…

Q: Please explain the functionality of Stack and Heap. Including data on the frame pointer, the stack…

A: Utilizing a stack and a heap Local variables and the chronological sequence of method execution are…

Q: write in c++ Given the class declaration (from a .h file) for a stack (or queue) implemented as a…

A: The program declares a class named queue. It has following data members and member functions: A…

Q: 1. Linked Lists, Stacks & Queues: a. What is the Big Oh for push and pop of one item from a stack…

A: Hi, since there are multiple subparts in this question, as per our policy, I'll answer the first…

Q: Suppose that you are using the class stackType and linkedQueue Type introduced in Chapters 7 and 8.…

A: Using a queue object, the reverseStack function can be used to change the order of the elements in a…

Q: Please explain the functionality of Stack and Heap. The stack pointer, the frame pointer, and other…

A: Solution for the given question: Introduction: A stack I'd a linear data structure in which…

Q: Define stack pointer.

A: Stack: A specialized buffer that saves data from bottom to top is called stack. It pushes down the…

Q: Help me in C++ please: Write a program (in main.cpp) to do the following: a. Build a binary…

A: write C++ code for binary search tree, do the following:Build a binary search tree T1.Do a postorder…

Q: Use the screenshot (alphabet) below to code a Breadth-first search (BFS) algorithm in C++. Please…

A: Use the screenshot (alphabet) below to code a Breadth-first search (BFS) algorithm in C++. Please…

Q: In a stack class implemented with a linked list, which operation(s) require O(n) time for their…

A: Stack and Queue are types of Data Structures. Stack is a Linked List that allows insertion or…

Q: C++ program to delete each alternate node of a singly linked list. For Example:…

A: Code: //Icluding Library#include <bits/stdc++.h>using namespace std; //Link list nodeclass…

Question

Use: You have to use C/C++ language Must

Try to use Matrix, queue,stack,linklist, graph, tree to solve the problem

10. Given is an ordered deck of n cards numbered 1 to n with card I at the top and card n at the
bottom. The following operation is performed as long as there are at least two cards in the deck:
Throw away the top card and move the card that is now on the top of the deck to the
bottom of the deck.
Your task is to find the sequence of discarded cards and the last, remaining card.
Each line of input (except the last) contains a number 2 <ns 52. The last line contains 0 and this line
should not be processed.
Sample:
Input:
7
19
2
Output:
Discarded cards: 1, 3, 5, 7, 4, 2,
Remaining card: 6
Discarded cards: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 4, 8, 12, 16, 2, 10, 18, 14,
Remaining card: 6
Discarded cards: 1,
Remaining card: 2

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

Step 2

Step 3

Step 4

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 4 images

SEE SOLUTION Check out a sample Q&A here

Similar questions

Stack ADT Implement a program in C++ that has the following three parts and each does the following: 1. Implements in C++, the specification of a Stack ADT with all the Main and Helper behaviors (save the file as StackADT.h) 2. Implements in C++, all the necessary methods (behavior) of the StackADT (save the file as StackADT.cpp) 3. Implements in C++, a main function (the client or application program) that creates and uses Stack objects (save the file as StackMain.cpp). This main function should be able to do the following: a. It should be able to read a given text file as input, b. It should be able to get each input value from the input file (one word at a time) and store it (push) on the StackADT object until it stores all the words from the input file. c. It should be able to retrieve an item from the stack and 1) display it on the screen, as well as 2) write it to an output file, and then delete (pop) that item from the stack, and repeat this process until it retrieves all the…
code in C++
Note: The STL (Standard Template Library) stack and queue classes - not Nyhoff's - must be used for this assignment. Write a program that queries the user for a string of characters, placing the characters on both a stack and a queue. Then use basic stack and queue operations to determine if the string is a palindrome and report the result.
Write a C code for the structure types of a dynamic linked list implementation of a stack. Each node of the stack will have the following members: Name: char type array ID: integer type number Grade: double type number Link: pointer/link to next nodeWrite functions to add and remove the nodes of the stack and use printf() to show that the code is working properly.
5. The creeping problem occurs when a queue is implemented as an array. (a) Define the creeping problem. (b) Describe how to implement a queue as an array in order to avoid the creeping problem. (c) Write the C++ method Join for the new type of Queue described in (b) above.
I need help with coding in C++ please: Write a program (in main.cpp) to do the following: a. Build a binary search tree T1. b. Do a postorder traversal of T1 and, while doing the postorder traversal, insert the nodes into a second binary search tree T2 . c. Do a preorder traversal of T2 and, while doing the preorder traversal, insert the node into a third binary search tree T3. d. Do an inorder traversal of T3. e. Output the heights and the number of leaves in each of the three binary search trees. The program should accept input and produce output similar to the example below: Enter numbers ending with -999: 10 5 7 -999 tree1 nodes in postorder: 7 5 10 tree2 nodes in preorder: 7 5 10 tree3 nodes in inorder: 5 7 10 tree1 height: 3 tree1 leaves: 1 tree2 height: 2 tree2 leaves: 2 tree3 height: 2 tree3 leaves: 2 The program has 3 tabs: main.cpp , binarysearchTree.h , and binaryTree.h
Simple JAVA linkedlist code implementation please help and complete any part you can - Without using the java collections interface (ie do not import java.util.List,LinkedList, Stack, Queue...)- Create an implementation of LinkedList interface- For the implementation create a tester to verify the implementation of thatdata structure performs as expected Build Bus Route – Linked List- Your task is to:o Implement the LinkedList interface (fill out the implementation shell)o Put your implementation through its paces by exercising each of themethods in the test harnesso Create a client (a class with a main) ‘BusClient’ which builds a busroute by performing the following operations on your linked list:o§ Create (insert) 4 stations§ List the stations§ Check if a station is in the list (print result)• Check for a station that exists, and onethat doesn’t§ Remove a station§ List the stations§ Add a station before another station§ List the stations§ Add a station after another station§ Print the…
Computer science JAVA programming language ques