subject

Part 1: Plan and Write the Pseudocode Using pseudocode, write an algorithm that someone else can follow.

Decide on a question to ask the user. Some ideas include:
What grade are you in?
What sport do you play?
Where did you go on vacation?
Use one variable to store the response.
Use one if-else statement to make a decision based on the user's input.
Display two messages; one for each condition (True and False).
Insert your pseudocode here: (you only need to do one)
Flowchart Write it out

Flowchart: Input leads to if statment. If true print response. if false print different response. Program ends.

Part 2: Code the Program
Use the following guidelines to code your program.

Use the Python IDLE to write your program.
Using comments, type a heading that includes your name, today’s date, and a short description.
Set up your def main(): statement. (Don’t forget the parentheses and colon.)
Write one if-else statement using user input.
Include a print message for both conditions (True and False).
Conclude the program with the main() statement.
Follow the Python style conventions regarding indentation in your program.
Run your program to ensure it is working properly. Fix any errors you may observe.
When you've completed writing your program code, save your work by selecting 'Save' in the Python IDLE. When you submit your assignment, you will attach this Python file separately.

Part 3: Post Mortem Review (PMR)
Using complete sentences, respond to all the questions in the PMR chart.

Review Question Response
What was the purpose of your program?
How could your program be useful in the real world?
What is a problem you ran into, and how did you fix it?
Describe one thing you would do differently the next time you write a program.


Part 1: Plan and Write the Pseudocode

Using pseudocode, write an algorithm that someone else can

ansver
Answers: 2

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 05:20
Write a program called assignment3 (saved in a file assignment3.java) that computes the greatest common divisor of two given integers. one of the oldest numerical algorithms was described by the greek mathematician, euclid, in 300 b.c. it is a simple but very e↵ective algorithm that computes the greatest common divisor of two given integers. for instance, given integers 24 and 18, the greatest common divisor is 6, because 6 is the largest integer that divides evenly into both 24 and 18. we will denote the greatest common divisor of x and y as gcd(x, y). the algorithm is based on the clever idea that the gcd(x, y) = gcd(x ! y, y) if x > = y and gcd(x, y) = gcd(x, y ! x) if x < y. the algorithm consists of a series of steps (loop iterations) where the “larger” integer is replaced by the di↵erence of the larger and smaller integer. this continues until the two values are equal. that is then the gcd.
Answers: 3
question
Computers and Technology, 22.06.2019 17:30
How do you make a lenny face? plz, brailiest to who can answer first.
Answers: 1
question
Computers and Technology, 23.06.2019 20:00
Match the file formats with the types of multimedia they can store
Answers: 2
question
Computers and Technology, 24.06.2019 13:30
What is the most important for you to choose before you build a network?
Answers: 1
You know the right answer?
Part 1: Plan and Write the Pseudocode Using pseudocode, write an algorithm that someone else can fo...
Questions
question
Mathematics, 13.04.2021 21:10
question
Mathematics, 13.04.2021 21:10
question
Mathematics, 13.04.2021 21:10
question
Social Studies, 13.04.2021 21:10
question
Mathematics, 13.04.2021 21:10
question
Physics, 13.04.2021 21:10
question
Mathematics, 13.04.2021 21:10
Questions on the website: 13722361