logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

Noel is creating a music quiz game. The game stores a list of song names and their artist

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Noel is creating a music quiz game.

The game stores a list of song names and their artist (e.g. the band or solo artist name). The player needs to try and guess the song name.

The game is played as follows:

A random song name and artist are chosen.

The artist and the first letter of each word in the song title are displayed.

The user has two chances to guess the name of the song.

If the user guesses the answer correctly the first time, they score 3 points. If the user guesses the answer correctly the second time they score 1 point. The game repeats.

The game ends when a player guesses the song name incorrectly the second time.

Only authorised players are allowed to play the game. Where appropriate, input from the user should be validated.

Design, develop, test and evaluate a system that:

1. Allows a player to enter their details, which are then authenticated to ensure that they are an authorised player.

2. Stores a list of song names and artists in an external file.

3. Selects a song from the file, displaying the artist and the first letter of each word of the song title.

4. Allows the user up to two chances to guess the name of the song, stopping the game if they guess a song incorrectly on the second chance.

5. If the guess is correct, add the points to the player’s score depending on the number of guesses.

6. Displays the number of points the player has when the game ends.

7. Stores the name of the player and their score in an external file.

8. Displays the score and player name of the top 5 winning scores from the external file.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Louise is creating a card game for two players.

 

The game uses a deck of cards. There are 30 cards in a deck. Each card has one colour (red, black or yellow). Each card has a number (1, 2, 3, 4, 5, 6, 7, 8, 9, 10) for each colour. Each card is unique.

 

The 30 cards are shuffled and stored in the deck. The rules are:

Player 1 takes the top card from the deck.

Player 2 takes the next card from the deck.

If both players have a card of the same colour, the player with the highest number wins.

If both players have cards with different colours, the winning colour is shown in the table.

 

Card Card Winner

Red Black Red

Yellow Red Yellow

Black Yellow Black

 

The winner of each round keeps both cards.

The players keep playing until there are no cards left in the deck.

 

Only authorised players are allowed to play the game. Where appropriate, input from the user should be validated.

 

Design, develop, test and evaluate a program that:

 

1. Allows two players to enter their details, which are then authenticated, to ensure that they are authorised players.

2. Shuffles the 30 cards in the deck.

3. Allows each player to take a card from the top of the deck. Play continues until there are no cards left in the deck.

4. Calculates the winner and allocates both cards to the winner.

5. Displays which player wins (the player with the most cards).

6. Lists all of the cards held by the winning player.

7. Stores the name and quantity of cards of the winning player in an external file.

8. Displays the name and quantity of cards of the 5 players with the highest quantity of cards from the external file.

 

 

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

542 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

747 Answers

Hire Me
expert
Husnain SaeedComputer science

813 Answers

Hire Me
expert
Atharva PatilComputer science

779 Answers

Hire Me
March
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
23
24
25
26
27
28
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30