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