Question 1: Input: arr[] = {20, 10, 100, 20, 4); using algorithm finding max element (pseudocode) show every step of finding max value of given array list. Draw a flowchart.

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
Homework for Exempted Students:
Question 1:
Input: arr[] = {20, 10, 100, 20, 4}; using algorithm finding max element (pseudocode) show
every step of finding max value of given array list. Draw a flowchart.
Question 2:
20, 11, 5, 6, 7, 3, 9, 1
Using linear search algorithm find the location of x = 9 and x = 12 (show every step using
pseudocode). Create a flowchart of your program.
Question 3:
20, 11, 5, 6, 7, 3, 9, 1
Using binary search algorithm find the location of x = 9 and x = 12 (show every step using
pseudocode). Create a flowchart of your program.
Question 4:
3,2,4, 1,5
c) Using bubble sort algorithm sort given array list in decreasing order (show every step using
pseudocode).
d) Using insertion sort algorithm sort given array list in decreasing order (show every step
using pseudocode).
Question 5:
a) Use the greedy optimization algorithm to make change using quarters, dimes, nickels, and
pennies for:
i.
51 cents
ii.
69 cents
b) Explain all possible algorithms for greedy optimization algorithm for scheduling and which
one is the most optimal?
Transcribed Image Text:Homework for Exempted Students: Question 1: Input: arr[] = {20, 10, 100, 20, 4}; using algorithm finding max element (pseudocode) show every step of finding max value of given array list. Draw a flowchart. Question 2: 20, 11, 5, 6, 7, 3, 9, 1 Using linear search algorithm find the location of x = 9 and x = 12 (show every step using pseudocode). Create a flowchart of your program. Question 3: 20, 11, 5, 6, 7, 3, 9, 1 Using binary search algorithm find the location of x = 9 and x = 12 (show every step using pseudocode). Create a flowchart of your program. Question 4: 3,2,4, 1,5 c) Using bubble sort algorithm sort given array list in decreasing order (show every step using pseudocode). d) Using insertion sort algorithm sort given array list in decreasing order (show every step using pseudocode). Question 5: a) Use the greedy optimization algorithm to make change using quarters, dimes, nickels, and pennies for: i. 51 cents ii. 69 cents b) Explain all possible algorithms for greedy optimization algorithm for scheduling and which one is the most optimal?
Expert Solution
steps

Step by step

Solved in 4 steps with 1 images

Blurred answer
Knowledge Booster
Array
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
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