Dancing Partner Matching(Queue)[Solution introduction: the second video in 3.6] [Problem description] In a ball, when gentlemen and ladies come, they form a queue of gentlemen and a queue of ladies, respectively. When the ball starts, the gentlemen and ladies who come first should get partners first. A gentleman should be matched with a lady. Similarly, a lady can only match with a gentleman. Write programs to simulate the process of dancing partner matching. The maximal number of coming gentlemen or ladies is 30. [Basic requirements] 1) Use queues to solve this problem. [Example]Problem: Match coming gentlemen and ladies. What you need to show in the terminal(the back part is outputted by you and the blue part is inputted by the user, i.e., teacher): Please input coming dancers: Mark, male, 19 Alice, female, 21 Jenny, female, 23 Bob, male, 20 Andrew,male, 19 Julian, female, 18 Ivan, male, 22 Jeff, male, 21 Dancer partners are: Mark, Alice Bob, Jenny Andrew, Julian The following dancers do not have partners: Ivan, male, 22 Jeff, male, 21

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

The requirements of reports:

1.The algorithm design idea

2.The source code with necessary comments

3.Test case and results (show the screenshot of your terminal);

4.Summary

4、Dancing Partner Matching(Queue)[Solution introduction: the second

video in 3.6]

[Problem description]

In a ball, when gentlemen and ladies come, they form a queue of gentlemen

and a queue of ladies, respectively. When the ball starts, the gentlemen and

ladies who come first should get partners first. A gentleman should be matched

with a lady. Similarly, a lady can only match with a gentleman. Write programs

to simulate the process of dancing partner matching.

The maximal number of coming gentlemen or ladies is 30.

[Basic requirements]

1) Use queues to solve this problem.

[Example]Problem: Match coming gentlemen and ladies.

What you need to show in the terminal(the back part is outputted by you

and the blue part is inputted by the user, i.e., teacher):

Please input coming dancers:

Mark, male, 19

Alice, female, 21

Jenny, female, 23

Bob, male, 20

Andrew,male, 19

Julian, female, 18

Ivan, male, 22

Jeff, male, 21

Dancer partners are:

Mark, Alice

Bob, Jenny

Andrew, Julian

The following dancers do not have partners:

Ivan, male, 22

Jeff, male, 21

 

 

Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY