→ Lecture 0 And 1 → Sāciet mācīties / Lejupielādēt MP3 flashcards

jautājums		atbilde
What are algorithms? sākt mācīties		Algorithms are some well-defined set of instructions, steps, or logic, written such that by following the steps, some specific task is accomplished.
The steps of algorithms design are: sākt mācīties		Obtain a description of the problem, Analyze the problem, Develop a high-level algorithm, Refine the algorithm by adding more detail, Review the algorithm
The major factor in speeding up your getting results is: sākt mācīties		The algorithm
Which is the most appropriate definition for recursion? sākt mācīties		A function that calls another execution instance of the same function.
Problems that can only be defined recursively can be solved using recursion. sākt mācīties		False
Which of the following statement is false? sākt mācīties		Every recursive function must have a return value.
Factorial function sākt mācīties		num * fact(num - 1)
Recursion is the process of describing an action in terms of itself. sākt mācīties		True
A recursive function may or may not have a recursive case. sākt mācīties		False
A factorial is the product of an integer and all the positive integers greater than it. sākt mācīties		False
Only problems that are recursively defined can be solved using recursion. sākt mācīties		False

Lecture 0 and 1