Quiz 14 Algorithms

The sub routine calls itself within the algorithm

• Base Case

• Recursive Case

A recursive function is

• A function that calls other functions in a recursive way.

• Any function that calls itself is called recursive

• A function that has a base case or termination condition

• None of the above

Name the condition at which the recursive method will stop calling itself.

• Base case

• Worst Case

• Best Case

• None of the above

Which of the following condition is true?

• Recursion is always better than iteration.

• Recursion uses more memory as compared to iteration.

• Recursion uses less memory as compared to iteration.

• Iteration is always better and simpler than recursion.

Recursion is similar to which of the following?

• if-else

• switch-case

• loops

• none of the above

What is the returned value of recmethod(5)?

• 68

• 70

• 75

• 82

What is printed as a result of the call stri("COMPSCI")?

• COMPSCI

  COMPSC

  COMPS

  COMP

  COM

  CO

  C

• COMPSCI

  OMPSCI

  MPSCI

  PSCI

  SCI

  CI

  I

• CO

  COM

  COMP

  COMPS

  COMPSC

  COMPSCI

• C

  CO

  COM

  COMP

  COMPS

  COMPSC

  COMPSCI

Will rec(5) iterate infinitely?

• Yes

• No

What is the average number of items that you will need to look at when performing a linear search on a list with 550 items?

• 256

• 225

• 550

• 215

What is the easiest searching algorithm to program?

• Linear

• Bubble

• Binary

• Flowchart