I need help planning my vegetable garden for next year. I have a number of varieties of tomatoes, eggplants, and peppers, but only so much room. You are given: plant_names, a string array with the names of the varieties plant_nums, a numerical array with the number of seeds there are for each variety max_plants, a randomized integer with the number of spaces available in the garden. You will create a string array, plant_choices, that contains the names of the varieties that are going to be planted. Decide what to plant based on the following algorithm: Establish initial conditions: start at the index of the first plant and first position of plant_choices Check: have you reached the total number of allowable seeds planted (max_plants) and do you have seeds (of any plant type) remaining? If yes: Check: Do you have any more seeds for the selected plant type? If yes: Add the name of the plant type to plant_choices, remove 1 seed from plant_nums for that specific plant type, remove 1 from max_plants, and index the position of plant_choices by 1. If no: Check: Have you reached the end of the list of plants? If yes: Reset the index of the plant type to 1 If no: Add 1 to index of the type of plant If no: end the loop

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
I need help planning my vegetable garden for next year. I have a number of varieties of tomatoes, eggplants, and peppers, but only so much room. You are given: plant_names, a string array with the names of the varieties plant_nums, a numerical array with the number of seeds there are for each variety max_plants, a randomized integer with the number of spaces available in the garden. You will create a string array, plant_choices, that contains the names of the varieties that are going to be planted. Decide what to plant based on the following algorithm: Establish initial conditions: start at the index of the first plant and first position of plant_choices Check: have you reached the total number of allowable seeds planted (max_plants) and do you have seeds (of any plant type) remaining? If yes: Check: Do you have any more seeds for the selected plant type? If yes: Add the name of the plant type to plant_choices, remove 1 seed from plant_nums for that specific plant type, remove 1 from max_plants, and index the position of plant_choices by 1. If no: Check: Have you reached the end of the list of plants? If yes: Reset the index of the plant type to 1 If no: Add 1 to index of the type of plant If no: end the loop
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

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