Create a class for the following object. Deck - contaíns 52 cards initially. Each card is represented by an unchangeable suit and value. Suits - + (Club), (Spade), v (Heart), • (Diamond) Values - 1(A),2,3,4,5,6,7,8,9,10,11(J),12(Q),13(K) Actions 1. draw - retríeves the top most card on the deck. When called with number of desired cards, it will try to draw the N cards, if not enough, draw all cards. 2. shuffle - randomizes the location of all cards, excluding the drawn cards 3. restore - returns the last N cards drawn on the bottom of the deck, if no number is provided, return all drawn cards. Make sure that the class is encapsulated.

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
icon
Related questions
Question
Specific Instructions
Create a class for the following object.
Deck - contaíns 52 cards ínitially. Each card is represented by an unchangeable suit and value.
Suits - + (Club), + (Spade), v (Heart), + (Diamond)
Values - 1(A),2,3,4,5,6,7,8,9,10,11(J),12(Q),13(K)
Actions
1. draw - retrieves the top most card on the deck. When called with number of desired cards, it will try to draw the N cards, if not enough, draw all cards.
2. shuffle - randomizes the location of all cards, excluding the drawn cards
3. restore - returns the lastN cards drawn on the bottom of the deck, if no number is provided, return all drawn cards.
Make sure that the class is encapsulated.
Transcribed Image Text:Specific Instructions Create a class for the following object. Deck - contaíns 52 cards ínitially. Each card is represented by an unchangeable suit and value. Suits - + (Club), + (Spade), v (Heart), + (Diamond) Values - 1(A),2,3,4,5,6,7,8,9,10,11(J),12(Q),13(K) Actions 1. draw - retrieves the top most card on the deck. When called with number of desired cards, it will try to draw the N cards, if not enough, draw all cards. 2. shuffle - randomizes the location of all cards, excluding the drawn cards 3. restore - returns the lastN cards drawn on the bottom of the deck, if no number is provided, return all drawn cards. Make sure that the class is encapsulated.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Unreferenced Objects
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education