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