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