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

The questions and answers are in a file. The file is provided as a command line argument to the application.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Quiz Night Game Engine

 

Details

  1. The questions and answers are in a file. The file is provided as a command line argument to the application.

  2. In the question and answer file each line has a question and its answer. The answers are always one word.

  3. The question always ends in ‘?’ then there is a space and following that the answer. For example:

What is the capital of France? Paris

  1. The application takes a second command line argument, a number <10 that represents the difficulty level.

    The program should:

  • at the start

    • load the questions and answers from the file

    • print out the number of questions in the quiz

 

  • start asking questions

  • for each question, display a clue (if available, see below); the user has one attempt only, and the program is case insensitive (accepts both lower and upper case answers)

  • after each question display the number of questions asked and the number of correctly answered

   questions so far. Example:   

      Score: 5/7

 

  • at the end store the results in a file quiz_history.txt by appending to the file one line containing:

  • name of the quiz file

  • number of questions answered correctly

  • total number of questions

  • difficulty level

 

Questions and clues

The following difficulty levels should be supported:

  1. No clue is given and only a ‘?’ is shown. Example:

What is the capital of France?

  1. A set of blank dashes separated by spaces is displayed, one for every letter in the answer. Example:

What is the capital of France?

  1. A The first and the last letters are shown. Example:

What is the capital of France?

P - - - S

  1. Two random letters from the answer are shown in their correct position. Example

What is the capital of France?

P - R - -

  1. All letters are shown but in random order. Example:

What is the capital of France?

R S I P A

Observations

  • you do not know in advance how many questions are in the file; it is recommended to use a dynamic data structure to store questions as they are read

Basic Functionality Marking                     70%

  • processing command line parameters (5)

  • file name

  • difficulty level

  • reading questions from file

  • opening the file and reading from the file (5)

  • separating questions from answers (5)

  • storing a question and its answer (5)

  • storing all the questions in a list (10)

  • print out number of questions in the quiz             (3)

  • display a question (3)

  • take in the user’s word and compare it with the question answer

  • reading word from the user (3)

  • case insensitive comparison (2)

  • display a clue based on the difficulty level:

  • level 1, 2, 3, 4             (4 * 5 marks) 

  • write the results to file (6)

  • keep track of the number of correctly answered questions (3)

Advanced marking                                         (30%)

  • The questions are asked in random order             (10)

  • Display a clue based on the difficulty level 5            (10)

  • Difficulty level 6. The type of clue is randomly selected from the 5 types listed above. (5)

  • Store the status (correct/incorrect) of all the questions. When the quiz is complete the user is asked if

they want to view the correct answers to the questions that were wrong.                         (5)

(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

660 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

632 Answers

Hire Me
expert
Husnain SaeedComputer science

649 Answers

Hire Me
expert
Atharva PatilComputer science

808 Answers

Hire Me
July
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
29
30
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
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