![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Question
thumb_up100%
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](https://content.bartleby.com/qna-images/question/1fa0dc14-3e84-4604-99ad-3f936ffb156e/9a227e52-07b5-4ac2-938a-797f0ad71ca3/smj4lw_thumbnail.jpeg)
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](https://content.bartleby.com/qna-images/question/1fa0dc14-3e84-4604-99ad-3f936ffb156e/9a227e52-07b5-4ac2-938a-797f0ad71ca3/dhgl3pq_thumbnail.jpeg)
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
![Check Mark](/static/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by stepSolved in 2 steps with 4 images
![Blurred answer](/static/blurred-answer.jpg)
Knowledge Booster
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
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
![Text book image](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
![Text book image](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
![Text book image](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
![Text book image](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
![Text book image](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
![Text book image](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education