Review Test Submission_ Chapter Thirteen Quiz - Recursion &

.pdf

School

Lanier Technical College *

*We aren’t endorsed by this school

Course

1305

Subject

Computer Science

Date

Feb 20, 2024

Type

pdf

Pages

8

Uploaded by HighnessFlowerCat77

Report
4/18/22, 10:38 PM Review Test Submission: Chapter Thirteen Quiz - Recursion &... https://laniertech.blackboard.com/webapps/assessment/review/review.jsp?attempt_id=_3892446_1&course_id=_19073_1&content_id=_2492975_1&r… 1/8 Review Test Submission: Chapter Thirteen Quiz - Recursion CIST1305: Program Design & Development (ON-LINE COURSE) 40403 Module 14-Chapter 13 Activities & Assignments (one week to complete) Review Test Submission: Chapter Thirteen Quiz - Recursion User Francisco Oviedo-Mancilla Course CIST1305: Program Design & Development (ON-LINE COURSE) 40403 Test Chapter Thirteen Quiz - Recursion Started 4/18/22 10:08 PM Submitted 4/18/22 10:38 PM Due Date 4/18/22 11:59 PM Status Completed Attempt Score 96 out of 100 points Time Elapsed 29 minutes out of 1 hour Results Displayed All Answers, Submitted Answers, Correct Answers, Incorrectly Answered Questions Question 1 Selected Answer: Answers: The process of calling a module requires several actions to be performed by the computer and is referred to as ________. Overhead Overhead Maintenance memory intensive Inefficiency None of these Question 2 Selected Answer: The ±rst step in setting up a recursive module is to ________. Identify at least one case in which the problem can be solved without recursion Lanier Tech Noti±cations Online Resources 4 out of 4 points 4 out of 4 points Francisco Oviedo-Mancilla 15
4/18/22, 10:38 PM Review Test Submission: Chapter Thirteen Quiz - Recursion &... https://laniertech.blackboard.com/webapps/assessment/review/review.jsp?attempt_id=_3892446_1&course_id=_19073_1&content_id=_2492975_1&r… 2/8 Answers: Identify at least one case in which the problem can be solved with recursion Identify at least one case in which the problem can be solved without recursion Identify the case with the repetitive block Identify the case without the repetitive block None of these Question 3 Selected Answer: Answers: When the recursive module makes the last call to itself, the If-Then statements condition expression is ________. false True 0 false Unpredictable 1 Question 4 Selected Answer: Answers: Recursion can be a powerful tool for solving ________ problems. Repetitive Complex decision Repetitive Multiple selections Mathematical None of these Question 5 A problem can be solved with recursion if it can be broken down into ________ that are identical to the overall problem. 4 out of 4 points 4 out of 4 points 4 out of 4 points
4/18/22, 10:38 PM Review Test Submission: Chapter Thirteen Quiz - Recursion &... https://laniertech.blackboard.com/webapps/assessment/review/review.jsp?attempt_id=_3892446_1&course_id=_19073_1&content_id=_2492975_1&r… 3/8 Selected Answer: Answers: Successive smaller problems Successive smaller problems Successive smaller modules Smaller problems Smaller modules None of these Question 6 Selected Answer: False Answers: True False The depth of recursion refers to the length and complexity of the recursive algorithm. Question 7 Selected Answer: Answers: When module A is calling module B and module B calls module A, it is called ________ recursion. Indirect B to A and A to B call A to B and B to A call Loop Indirect None of these Question 8 Selected Answer: Answers: In the ________ case the problem is reduced to a smaller version of the original problem. Recursive Base Recursive Loop 4 out of 4 points 4 out of 4 points 4 out of 4 points
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help