Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
100%

Turn from pseudocode to Flow-chart 

//For function call Ascending (Name,Mark)
1. for (i=0;i<5;i++)
1a. for (j=0;j<5;j++)
1b. if(Mark[i]<Mark[j])
i. temp=Mark[i];
ii. tempn=Name[i];//bring the number forward to be compared on the next cycle
iii. Mark[i]=Mark[j];
iv. Name[i]=Name[j];
v. Mark[j]=temp;
vi. Name[j]=tempn;
2. cout<<"Marks in ascending order:";
3. for(i=0;i<5;i++)
3a. cout, Name[i],
3a. cout," ",Mark[i], endl
4. cout, endl
//For function call Descending(Name,Mark)
1. 1. for (i=0;i<5;i++)
1a. for (j=0;j<5;j++)
1b. if(Mark[i]>Mark[j])
i. temp=Mark[i);
ii. tempn=Name[i];//bring the number forward to be compared on the next cycle
iii. Mark[i]=Mark[j);
iv. Name[i]=Name[j];
v. Mark[j]=temp;
vi. Name[j]=tempn;
2. cout<<"Marks in ascending order:";
3. for(i=0;i<5;i++)
3a. cout, Name[i),
3a. cout," ",Mark[i], endl
4. cout, endl
Transcribed Image Text://For function call Ascending (Name,Mark) 1. for (i=0;i<5;i++) 1a. for (j=0;j<5;j++) 1b. if(Mark[i]<Mark[j]) i. temp=Mark[i]; ii. tempn=Name[i];//bring the number forward to be compared on the next cycle iii. Mark[i]=Mark[j]; iv. Name[i]=Name[j]; v. Mark[j]=temp; vi. Name[j]=tempn; 2. cout<<"Marks in ascending order:"; 3. for(i=0;i<5;i++) 3a. cout, Name[i], 3a. cout," ",Mark[i], endl 4. cout, endl //For function call Descending(Name,Mark) 1. 1. for (i=0;i<5;i++) 1a. for (j=0;j<5;j++) 1b. if(Mark[i]>Mark[j]) i. temp=Mark[i); ii. tempn=Name[i];//bring the number forward to be compared on the next cycle iii. Mark[i]=Mark[j); iv. Name[i]=Name[j]; v. Mark[j]=temp; vi. Name[j]=tempn; 2. cout<<"Marks in ascending order:"; 3. for(i=0;i<5;i++) 3a. cout, Name[i), 3a. cout," ",Mark[i], endl 4. cout, endl
//For function call Highest (Name, Mark)
1. for(i=0;i<5;i++)
1a. high=-99
1b. if (Mark[i]>high)
i. high=Mark[i]
ii. highN=Name[i]
2. cout, "The person with the highest mark is",
highN," ", high
/For function call Lowest (Name, Mark)
1. for(i=0;i<5;i++)
1a. low=99
1b. if (Mark[i]<low)
i. low=Mark[i]
ii. lowN=Name[li]
2. cout, "The person with the lowest mark is",
lowN," ", low
Transcribed Image Text://For function call Highest (Name, Mark) 1. for(i=0;i<5;i++) 1a. high=-99 1b. if (Mark[i]>high) i. high=Mark[i] ii. highN=Name[i] 2. cout, "The person with the highest mark is", highN," ", high /For function call Lowest (Name, Mark) 1. for(i=0;i<5;i++) 1a. low=99 1b. if (Mark[i]<low) i. low=Mark[i] ii. lowN=Name[li] 2. cout, "The person with the lowest mark is", lowN," ", low
Expert Solution
steps

Step by step

Solved in 2 steps with 4 images

Blurred answer
Knowledge Booster
Fundamentals of Boolean Algebra and Digital Logics
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.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education