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