→ Lecture 0 And 1 → Začněte se učit / Stáhněte si MP3 karty

otázka		odpověď
What are algorithms? začněte se učit		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: začněte se učit		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: začněte se učit		The algorithm
Which is the most appropriate definition for recursion? začněte se učit		A function that calls another execution instance of the same function.
Problems that can only be defined recursively can be solved using recursion. začněte se učit		False
Which of the following statement is false? začněte se učit		Every recursive function must have a return value.
Factorial function začněte se učit		num * fact(num - 1)
Recursion is the process of describing an action in terms of itself. začněte se učit		True
A recursive function may or may not have a recursive case. začněte se učit		False
A factorial is the product of an integer and all the positive integers greater than it. začněte se učit		False
Only problems that are recursively defined can be solved using recursion. začněte se učit		False

Lecture 0 and 1