C949 PRE-ASSESSMENT EXAMS WITH
CORRECT SOLUTIONS /GRADED A+
1. Which term refers to a template for creating an object? - ANSWER-
Class
2. Which characteristic of an algorithm is independent in nature? -
ANSWER-Uses an agnostic code repository
3. What is referred to as a data structure that stores subitems? -
ANSWER-Record
4. Which factor takes the ability to easily update an algorithm into
consideration? - ANSWER-Maintainability
5. What is a component of an algorithm that specifies a stopping point? -
ANSWER-Finiteness
6. Which term refers to a type of search algorithm? - ANSWER-Linear
7. What is a high-level consideration in an algorithm's design? - ANSWER-
Simplicity
8. What is the primary method used to search for an item in a sorted
array? - ANSWER-Binary Search
9. Which review of an algorithm happens after implementation? -
ANSWER-A posteriori analysis
, 10. Which factor helps measure the reusability of an algorithm? -
ANSWER-Extensibility
11. Which search algorithm utilizes the divide-and-conquer strategy?
- ANSWER-Binary search
12. Which algorithm requires data sorting as its first step? - ANSWER-
Binary
13. What does a time complexity analysis of an algorithm include? -
ANSWER-Worst case
14. Which data type do heap sorts work with? - ANSWER-Tree-based
data structure
15. Which function is used in conjunction with a merge sort
algorithm? - ANSWER-Recursive
16. Which attribute of a recursive function makes it unique? -
ANSWER-Calls itself
17. What is x in the following block of logic?
18. x = 28
19. if x >= 10 and x < 20
20. x = 20
21. elif x <= 30
22. x = 25
23. elif x >= 50
24. x = 100
25. else
26. x = 500 - ANSWER-25
CORRECT SOLUTIONS /GRADED A+
1. Which term refers to a template for creating an object? - ANSWER-
Class
2. Which characteristic of an algorithm is independent in nature? -
ANSWER-Uses an agnostic code repository
3. What is referred to as a data structure that stores subitems? -
ANSWER-Record
4. Which factor takes the ability to easily update an algorithm into
consideration? - ANSWER-Maintainability
5. What is a component of an algorithm that specifies a stopping point? -
ANSWER-Finiteness
6. Which term refers to a type of search algorithm? - ANSWER-Linear
7. What is a high-level consideration in an algorithm's design? - ANSWER-
Simplicity
8. What is the primary method used to search for an item in a sorted
array? - ANSWER-Binary Search
9. Which review of an algorithm happens after implementation? -
ANSWER-A posteriori analysis
, 10. Which factor helps measure the reusability of an algorithm? -
ANSWER-Extensibility
11. Which search algorithm utilizes the divide-and-conquer strategy?
- ANSWER-Binary search
12. Which algorithm requires data sorting as its first step? - ANSWER-
Binary
13. What does a time complexity analysis of an algorithm include? -
ANSWER-Worst case
14. Which data type do heap sorts work with? - ANSWER-Tree-based
data structure
15. Which function is used in conjunction with a merge sort
algorithm? - ANSWER-Recursive
16. Which attribute of a recursive function makes it unique? -
ANSWER-Calls itself
17. What is x in the following block of logic?
18. x = 28
19. if x >= 10 and x < 20
20. x = 20
21. elif x <= 30
22. x = 25
23. elif x >= 50
24. x = 100
25. else
26. x = 500 - ANSWER-25
