CIT237

1. Among all elementary sorting methods, ___________ sorting is an inferior choice

2. The major standard integer data-types are real, single, double and _________

3. A data structure in which insertion and deletion can only be done at one end is called a ________

4. A Tree is a connected _________ graph.

5. Algorithms that do not recall back the same algorithm or function are referred to as being __________

6. Which of the following sorting algorithms has average-case and worst case running time of O (n log n) ?

7. Class NP is the class of decision problem that can be solved by ________ polynomial algorithms

8. __________ algorithms require dividing problems into sub-instances

9. Which of the following paradigms helps in the discovery of efficient algorithms?

10. A finite sequence of unambiguous instructions for solving a problem is called ________

11. The coded instruction given to the computer in a particular programming language in order to accomplish a given task is called _________

12. _________ (1823) proposed an algorithm that finds a path without any backtracking

13. A programming language must have language structure, which consists of ________, expressions and statements

14. Which of the following options is the major reason(s) for documentation?

15. Which sort is an O(n log n) comparison-based sorting algorithm

16. 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.

17. _________ attributes is used to analyse the performance of algorithm

18. _______programmers are those who design and maintain the basic software that runs the system

19. Decision problems that cannot be solved at all by any algorithm are called ________ problems

20. A procedure for solving computational problems is called an _________

21. The ________ function is used in most programming languages to get a remainder when a number is divided by another number

22. Which of the following options is the fastest sorting algorithm?

23. _______ system testing is  designed to ensure that the system requirements and specifications are achieved

24. A _________ is a partially ordered data structure that is used in implementing priority queues

25. __________ sort divide its elements according to their values

26. Which of the options is the standard number of rows and columns in a chess board?

27. ___________ is a fast and easy way to transverse an array of a given set of elements

28. _________ is the fifth stage of algorithm design

29. ________analysis is the first stage involved in developing an efficient program

30. Another name for nondeterministic stage is _______

31. The full meaning of the acronym ANSI is _________

32. The three popular methods used to develop a logic plan are flowcharts,_________ and a top-down chart

33. The two efficiency attributes used to analyze the performance of an algorithm are time and ________

34. Java is an example of a (an)

35. The following are advantages of Divide-and Conquer, except?

36. Which of the options is an example of divide-and conquer paradigm?

37. The object code is the result of the compilation process and it is also referred to as the ________ code

38. The search that is based on both a recursive and non-recursive algorithms is called ___________ search

39. Real numbers consist of values with _________ parts

40. Partition-Exchange Sort is also known as?

41. Which of the following options is not correct as for the feature(s) of programming languages?

42. Source code is the coded instruction given to the computer in a _________ language in order to accomplish a given task

43. Another name for assembly language is ________

44. The ideal sorting algorithm would have the following properties,except?

45. Which of the options has a time complexity of Θ(n log(n)) on the average?

46. COBOL, FORTRAN, C, C++ are examples of a (an) ___________

47. Which of the following stages of developing an efficient program is not correct?

48. Which of the following options is a recursive sort algorithm?

49. The __________ case efficiency seeks to provide information on random input

50. _______ is the path that starts and ends at the same vertex and passes through all the other vertices exactly once