Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
You are going to write an ARM assembly program that allows a human to play of game of Hangman. In this game, the player is attempting to guess a hidden word, one letter at a time. You are given a text file with 10 words for the game: TESTS CHALLENGE UNIVERSITY STUDENTS BALANCE FEEDBACK BINARY INTELLIGENCE CARTOGRAPHERS CHARACTERISTICALLY 1. A random secret word is read from the text file. Alternatively, you can list the 10 words in an array in the program (slightly less marks are given for this option) and choose a random word from the array. 2. The player has six chances to guess the letters for each game. 3. Valid inputs of the game are from A-Z or a-z (convert the letter into a capital if a small letter is input). 4. For each correct letter guessed, the letter is revealed at its correct location or locations in the word. 5. For each incorrect letter guessed, an additional segment of the stick figure "hangman" is displayed. 6. The stick figure has 6 segments in total: head, body, left and right arms, and left and right legs. 7. The game is won when the entire word is guessed. 8. The game is lost when the entire hangman is displayed. 9. The game is exited upon winning, losing, or the player entering the 0 (zero) character. 10. When the game is finished, the player can choose to have another round. You should not allow the player to make an illegal move, or to enter invalid characters. For example, a player can't guess the same letter twice, or enter a number (except 0 for exiting the game), or enter a non-printable character.

You are going to write an ARM assembly program that allows a human to play of game of Hangman. In this game, the player is attempting to guess a hidden word, one letter at a time. You are given a text file with 10 words for the game: TESTS CHALLENGE UNIVERSITY STUDENTS BALANCE FEEDBACK BINARY INTELLIGENCE CARTOGRAPHERS CHARACTERISTICALLY 1. A random secret word is read from the text file. Alternatively, you can list the 10 words in an array in the program (slightly less marks are given for this option) and choose a random word from the array. 2. The player has six chances to guess the letters for each game. 3. Valid inputs of the game are from A-Z or a-z (convert the letter into a capital if a small letter is input). 4. For each correct letter guessed, the letter is revealed at its correct location or locations in the word. 5. For each incorrect letter guessed, an additional segment of the stick figure "hangman" is displayed. 6. The stick figure has 6 segments in total: head, body, left and right arms, and left and right legs. 7. The game is won when the entire word is guessed. 8. The game is lost when the entire hangman is displayed. 9. The game is exited upon winning, losing, or the player entering the 0 (zero) character. 10. When the game is finished, the player can choose to have another round. You should not allow the player to make an illegal move, or to enter invalid characters. For example, a player can't guess the same letter twice, or enter a number (except 0 for exiting the game), or enter a non-printable character.

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question

pls help

 

NOTE! it must be in ARM assembly language 

You are going to write an ARM assembly program that allows a human to play of game of Hangman. In this game, the player is attempting to guess a hidden word, one letter at a time. You are given a text file with 10 words for the game: • TESTS • CHALLENGE UNIVERSITY STUDENTS BALANCE FEEDBACK BINARY INTELLIGENCE CARTOGRAPHERS CHARACTERISTICALLY 1. A random secret word is read from the text file. Alternatively, you can list the 10 words in an array in the program (slightly less marks are given for this option) and choose a random word from the array. 2. The player has six chances to guess the letters for each game. 3. Valid inputs of the game are from A-Z or a-z (convert the letter into a capital if a small letter is input). 4. For each correct letter guessed, the letter is revealed at its correct location or locations in the word. 5. For each incorrect letter guessed, an additional segment of the stick figure "hangman" is displayed. 6. The stick figure has 6 segments in total: head, body, left and right arms, and left and right legs. 7. The game is won when the entire word is guessed. 8. The game is lost when the entire hangman is displayed. 9. The game is exited upon winning, losing, or the player entering the 0 (zero) character. 10. When the game is finished, the player can choose to have another round. You should not allow the player to make an illegal move, or to enter invalid characters. For example, a player can't guess the same letter twice, or enter a number (except 0 for exiting the game), or enter a non-printable character.
Transcribed Image Text:You are going to write an ARM assembly program that allows a human to play of game of Hangman. In this game, the player is attempting to guess a hidden word, one letter at a time. You are given a text file with 10 words for the game: • TESTS • CHALLENGE UNIVERSITY STUDENTS BALANCE FEEDBACK BINARY INTELLIGENCE CARTOGRAPHERS CHARACTERISTICALLY 1. A random secret word is read from the text file. Alternatively, you can list the 10 words in an array in the program (slightly less marks are given for this option) and choose a random word from the array. 2. The player has six chances to guess the letters for each game. 3. Valid inputs of the game are from A-Z or a-z (convert the letter into a capital if a small letter is input). 4. For each correct letter guessed, the letter is revealed at its correct location or locations in the word. 5. For each incorrect letter guessed, an additional segment of the stick figure "hangman" is displayed. 6. The stick figure has 6 segments in total: head, body, left and right arms, and left and right legs. 7. The game is won when the entire word is guessed. 8. The game is lost when the entire hangman is displayed. 9. The game is exited upon winning, losing, or the player entering the 0 (zero) character. 10. When the game is finished, the player can choose to have another round. You should not allow the player to make an illegal move, or to enter invalid characters. For example, a player can't guess the same letter twice, or enter a number (except 0 for exiting the game), or enter a non-printable character.
Expert Solution
steps

Step by step

Solved in 7 steps

SEE SOLUTIONCheck out a sample Q&A here
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
SEE MORE TEXTBOOKS