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