Filters
Question type
Study Flashcards

When,in a recursive algorithm,module A calls module B,module B calls module C,which calls module A,it is called ___________ recursion.

Correct Answer

verifed

verified

It is possible for a module to call itself.

A) True
B) False

Correct Answer

verifed

verified

When a recursive module calls only itself,it is called a ___________ recursion.

Correct Answer

verifed

verified

Showing 41 - 43 of 43

Related Exams

Exam 1

Introduction to Computers and Programming

48 Questions

Exam 2

Input, processing, and Output

48 Questions

Exam 3

Modules

48 Questions

Exam 4

Decision Structures and Boolean Logic

44 Questions

Exam 5

Repetition Structures

44 Questions

Exam 6

Functions

44 Questions

Exam 7

Input Validation

44 Questions

Exam 8

Arrays

46 Questions

Exam 9

Sorting and Searching Arrays

43 Questions

Exam 10

Files

43 Questions

Exam 11

Menu-Driven Programs

43 Questions

Exam 12

Text Processing

31 Questions

Exam 14

Object-Oriented Programming

43 Questions

Exam 15

Gui Applications and Event-Driven Programming

43 Questions

Show Answer