Question 1 True/False 10 Marks 1.1 A heuristic and an algorithmic solution require the same type of problem solving to develop a step-by-step solution to a problem. 1.2 Numerical data includes all integer numbers and all real numbers. 1.3 UML (Unified Modelling Language) is a basic tool when using Object Oriented Programming structure. 1.4 Identifying the problem is the first step in problem solving. 1.5 A function is a set of instructions to input data into the computer. 1.6 Debugging refers to the process of finding and correcting the errors in a solution. 1.7 Problems that require a heuristic solution cannot be solved through a set of step-by- step instructions. 1.8 A parameter is the data required to process an assignment statement. 1.9 The Control Module is a subtask of the Print Module. 1.10 A module is a set of instructions that processes a subtask of a solution. End of Question 1 [10 Marks]
Added by Juan H.
Close
Step 1
1 True. Both heuristic and algorithmic solutions require problem-solving skills to develop a step-by-step solution to a problem. Show more…
Show all steps
Your feedback will help us improve your experience
Donna Densmore and 87 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
(1) The discovery of the simplex method in 1947 was the beginning of management science as a discipline. (2) When formulating a linear programming problem on a spreadsheet, the Excel equation for each output cell can typically be expressed as a SUMPRODUCT function. (3) It is the nature of the application that determines the classification of the resulting linear programming formulation. (4) When dealing with huge real problems, there is no such thing as the perfectly correct linear programming model for the problem. (5) The purpose of a linear programming study is to help guide management's final decision by providing insights. (6) Changing the objective function coefficients may or may not change the optimal solution, but it will always change the value of the objective function. (7) It is possible to have a constraint in a BIP that excludes the possibility of choosing none of the alternatives available. (8) The constraint x1 ≤ x2 in a BIP problem means that alternative 2 cannot be selected unless alternative 1 is also selected. (9) The goal of queuing analysis is to minimize customer waiting lines. (10) Multiple-server queuing systems can perform satisfactorily with somewhat higher utilization factors than can single-server queuing systems.
Sri K.
Circle True or False for each of the following statements. 1) True False A greedy algorithm always makes the choice that looks best at the moment. 2) True False A greedy algorithm makes a globally optimal choice in the hope that this choice will lead to a locally optimal solution. 3) True False Greedy algorithms always yield optimal solutions. 4) True False GREEDY-ACTIVITY-SELECTOR sometimes finds an optimal solution to an instance of the activity-selection problem. 5) True False Two ingredients that are exhibited by most problems that lend themselves to a greedy strategy: the overlapping subproblems and optimal substructure. 6) True False Greedy-choice property: a globally optimal solution can be arrived at by making a locally optimal (greedy) choice. 7) True False A problem exhibits optimal substructure if an optimal solution to the problem contains within it optimal solutions to subproblems. 8) True False The 0-1 knapsack problem is solvable by a greedy strategy, whereas the fractional knapsack problem is not.
Akash M.
5. (10 points) Decide whether the following statements are true or false. a) The Dual Simplex algorithm results in an optimal solution or the conclusion that the problem being solved is unbounded. b) If a linear problem has no finite optimal objective value then its dual is feasible. c) In the Dual Simplex algorithm, the pivot element is always negative. d) In the standard dual pair, if one problem has an optimal solution, then so does the other and the optimal objective values may not be equal. e) An optimal solution to the dual problem to the resource allocation problem has components that are the shadow prices of the resources. f) In the standard dual pair, if both problems have feasible solutions, then both problems have optimal solutions. g) At optimality of the standard dual pair, if a slack variable is positive in one problem then the dual variable associated with this slack variable's constraint is zero. h) Solving a linear program with the Dual Simplex algorithm is equivalent to solving its dual problem with the Primal Simplex algorithm. i) At optimality of the standard dual pair, if a constraint is inactive in one problem then the dual variable associated with this constraint is positive. j) Not every linear program has a dual problem.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Watch the video solution with this free unlock.
EMAIL
PASSWORD