Identify the inputs of the algorithm. Identify the task of the algorithm. Identify the control instruction if exist. Specify the Boolean expression(s) in the given structure. Identify the number of loop iterations if exist. Draw the flowchart.

Programming Logic & Design Comprehensive
9th Edition
ISBN:9781337669405
Author:FARRELL
Publisher:FARRELL
Chapter12: Event-driven Gui Programming, Multithreading, And Animation
Section: Chapter Questions
Problem 17RQ
icon
Related questions
Topic Video
Question

For the algorithms below, answer the following questions: 

  1. Identify the inputs of the algorithm.
  2. Identify the task of the algorithm.
  3. Identify the control instruction if exist.
  4. Specify the Boolean expression(s) in the given structure.
  5. Identify the number of loop iterations if exist.
  6. Draw the flowchart.

 

Algorithm :

 

 Step 1: Input N, Current 

 Step 2:  Max = Current

 Step 3:  Counter =1

 Step 4:  While(Counter<N) 

         Repeat steps 4 through 7

 Step 5:   Counter = Counter + 1 

Step 6:   Input Next

 Step 7:   If (Next>Max)

     then  Max = Next

    end if

Step 8:  Print  Max

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Instruction Format
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Programming Logic & Design Comprehensive
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning