ATTENTION:
Kindly note that you will be presented with 50 questions randomized from the NOUN question bank. Make sure to take the quiz multiple times so you can get familiar with the questions and answers, as new questions are randomized in each attempt.
Good luck!
CIT237
1 / 50
1. The object code is the result of the compilation process and it is also referred to as the ________ code
2 / 50
2. The ideal sorting algorithm would have the following properties,except?
3 / 50
3. __________ sort divide its elements according to their values
4 / 50
4. The two efficiency attributes used to analyze the performance of an algorithm are time and ________
5 / 50
5. Which of the following options is a recursive sort algorithm?
6 / 50
6. Real numbers consist of values with _________ parts
7 / 50
7. The coded instruction given to the computer in a particular programming language in order to accomplish a given task is called _________
8 / 50
8. ___________ is a fast and easy way to transverse an array of a given set of elements
9 / 50
9. _________ attributes is used to analyse the performance of algorithm
10 / 50
10. Decision problems that cannot be solved at all by any algorithm are called ________ problems
11 / 50
11. The three popular methods used to develop a logic plan are flowcharts,_________ and a top-down chart
12 / 50
12. The ________ function is used in most programming languages to get a remainder when a number is divided by another number
13 / 50
13. _________ sort scan the entire given list to find its smallest element
14 / 50
14. _______programmers are those who design and maintain the basic software that runs the system
15 / 50
15. __________ algorithms require dividing problems into sub-instances
16 / 50
16. The __________ case efficiency seeks to provide information on random input
17 / 50
17. ________analysis is the first stage involved in developing an efficient program
18 / 50
18. Another name for nondeterministic stage is _______
19 / 50
19. Which of the following options is the fastest sorting algorithm?
20 / 50
20. Java is an example of a (an)
21 / 50
21. Which of the following paradigms helps in the discovery of efficient algorithms?
22 / 50
22. Which of the following options is not correct as for the feature(s) of programming languages?
23 / 50
23. Another name for assembly language is ________
24 / 50
24. _________ is the fifth stage of algorithm design
25 / 50
25. Partition-Exchange Sort is also known as?
26 / 50
26. Class NP is the class of decision problem that can be solved by ________ polynomial algorithms
27 / 50
27. Which sort is an O(n log n) comparison-based sorting algorithm
28 / 50
28. A data structure in which insertion and deletion can only be done at one end is called a ________
29 / 50
29. A _________ is a partially ordered data structure that is used in implementing priority queues
30 / 50
30. Among all elementary sorting methods, ___________ sorting is an inferior choice
31 / 50
31. Which of the options is an example of divide-and conquer paradigm?
32 / 50
32. Which of the options is the standard number of rows and columns in a chess board?
33 / 50
33. _______ system testing is designed to ensure that the system requirements and specifications are achieved
34 / 50
34. Which of the following options is the major reason(s) for documentation?
35 / 50
35. _______ is the path that starts and ends at the same vertex and passes through all the other vertices exactly once
36 / 50
36. Which of the options has a time complexity of Θ(n log(n)) on the average?
37 / 50
37. The two major reasons for documentation are clarity and _______.
38 / 50
38. A programming language must have language structure, which consists of ________, expressions and statements
39 / 50
39. A procedure for solving computational problems is called an _________
40 / 50
40. A Tree is a connected _________ graph.
41 / 50
41. Which of the following stages of developing an efficient program is not correct?
42 / 50
42. Which of the following sorting algorithms has average-case and worst case running time of O (n log n) ?
43 / 50
43. _________ (1823) proposed an algorithm that finds a path without any backtracking
44 / 50
44. COBOL, FORTRAN, C, C++ are examples of a (an) ___________
45 / 50
45. The following are advantages of Divide-and Conquer, except?
46 / 50
46. The more frequently used natural measures of size for a situation where the choice of a parameter indicating an input size is not really a factor is called ________ order n.
47 / 50
47. A finite sequence of unambiguous instructions for solving a problem is called ________
48 / 50
48. The search that is based on both a recursive and non-recursive algorithms is called ___________ search
49 / 50
49. The full meaning of the acronym ANSI is _________
50 / 50
50. Algorithms that do not recall back the same algorithm or function are referred to as being __________
Restart quiz
Rate this quiz
