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

Uploaded by HighnessFlowerCat77

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

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… 4/8 Return None of these Question 9 Selected Answer: True Answers: True False A recursive algorithm is never required to solve a problem. Question 10 Selected Answer: False Answers: True False When creating a recursive algorithm it is optional to identify the base case and the recursive case of the algorithm. Question 11 Selected Answer: Answers: In the following example, how many times does the module calls itself? 6 5 6 7 8 0 Question 12 4 out of 4 points 4 out of 4 points 0 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… 5/8 Selected Answer: Answers: Which of the following can be solved with recursion? All of these Finding the greatest common divisor Binary search The Fibonacci Series None of these All of these Question 13 Selected Answer: True Answers: True False There can be several modules involved in a recursive algorithm. Question 14 Selected Answer: True Answers: True False Comparing the recursive algorithm of a binary search with its counterpart, without recursion, it is much more elegant and easier to understand. Question 15 Selected Answer: Answers: The majority of repetitive programming tasks are best done with which of the following? Loops Loops Decision structures Recursion Sequence structures All of these 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… 6/8 Question 16 Selected Answer: Answers: Each time a recursive module calls itself, it creates a new ________ of the parameters of the modules. Instance Object Instance Events Memory location(s) None of these Question 17 Selected Answer: True Answers: True False It is possible for a module to call itself. Question 18 Selected Answer: False Answers: True False In a recursive algorithm, the computer completes the base case ±rst and then works on the recursive cases. Question 19 Selected Answer: Answers: If a recursive module has no code to stop it from repeating then it is like a ________ loop. In±nite Do-While Infinite While Iterative Do-Until 4 out of 4 points 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

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… 7/8 Question 20 Selected Answer: False Answers: True False One of the advantages of a recursive algorithm is that it does not matter how many recursive calls are made to a module; only one instance of the parameters are needed. Question 21 Selected Answer: False Answers: True False Recursive algorithms are more e²cient that iterative algorithms. Question 22 Selected Answer: False Answers: True False It is not necessary to have a conditional expression to terminate the recursive calls. Question 23 Selected Answer: False Answers: True False The term "callback potential" refers to number of times a module calls itself. Question 24 Selected Answer: Answers: If a recursive module calls itself ten times, after the tenth call it returns to the ________. ninth call End of the module ninth call first call 4 out of 4 points 4 out of 4 points 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… 8/8 Monday, April 18, 2022 10:38:22 PM EDT End of the program None of these Question 25 Selected Answer: Answers: A ________ module is a type of module that calls itself. Recursive Numeric String Recursive Library None of these ← OK 4 out of 4 points

Related Documents

Palermo_Chapter 4 Assignment.docx

Palermo_Chapter 3 Assignment.docx

CPT 310 HW 5-2.pdf

Assignment3-MongoDB.docx

Review Test Submission_ Chapter Ten Quiz - Working with Files-.._.pdf

CIS305 1.3 Linux Kernel Modules.docx

CIS305 3.2.docx

CIS305_GP1.7.docx

Assingnment # 8 - Professional Pathway Exploration Reflection - 2022.docx

Chapter 3 Assignments.doc

1307831761-CSE565_lab2_template_Koushik_Kumar_Selvakumar.pdf

gp-2603-l03-measurements.pdf

Recommended textbooks for you

Programming Logic & Design Comprehensive

Computer Science

ISBN:9781337669405

Author:FARRELL

Publisher:Cengage

Np Ms Office 365/Excel 2016 I Ntermed

Computer Science

ISBN:9781337508841

Author:Carey

Publisher:Cengage

Systems Architecture

Computer Science

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Cengage Learning

COMPREHENSIVE MICROSOFT OFFICE 365 EXCE

Computer Science

ISBN:9780357392676

Author:FREUND, Steven

Publisher:CENGAGE L

Microsoft Visual C#

Computer Science

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Cengage Learning,

Fundamentals of Information Systems

Computer Science

ISBN:9781305082168

Author:Ralph Stair, George Reynolds

Publisher:Cengage Learning

SEE MORE TEXTBOOKS

Recommended textbooks for you

Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:9780357392676
Author:FREUND, Steven
Publisher:CENGAGE L
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Fundamentals of Information Systems
Computer Science
ISBN:9781305082168
Author:Ralph Stair, George Reynolds
Publisher:Cengage Learning