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