CIT 237 Questions and Answers

1. The search that is based on both a recursive and non-recursive algorithms is called
___________ search
Answer: Binary

2. Decision problems that cannot be solved at all by any algorithm are called ________
problems
Answer: intractable

3. The ________ function is used in most programming languages to get a remainder when a
number is divided by another number
Answer: mod

4. The three popular methods used to develop a logic plan are flowcharts,_________ and a top-
down chart
Answer: pseudo-code

5. Another name for nondeterministic stage is _______

Answer: guessing

7. A procedure for solving computational problems is called _________

Answer: algorithm

8. 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
Answer: matrix order n

9. A Tree is a connected _________ graph

Answer: acyclic

10. A finite sequence of unambiguous instructions for solving a problem is called ________
Answer: algorithm
11. ___________ is a fast and easy way to transverse an array of a given set of elements
Answer: bubble sort

12. Source code is the coded instruction given to the computer in a _________ language in
order to accomplish a given task
Answer: programming

13. Among all elementary sorting methods, ___________ sorting is an inferior choice
Answer: bubble

14. _________ sort scan the entire given list to find its smallest element
Answer: Selection

15. The two efficiency attributes used to analyze the performance of an algorithm are time
and ________
Answer: space

16. _______programmers are those who design and maintain the basic software that runs the
system
Answer: System

17. _________ (1823) proposed an algorithm that finds a path without any backtracking
Answer: warnsdoff

18. Which of the following stages of developing an efficient program is not correct?
Answer: B. procedural programing

19. Class NP is the class of decision problem that can be solved by ________ polynomial
algorithms
Answer: Nondeterministic

20. Partition-Exchange Sort is also known as?

Answer: Heap

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

Answer: binary
22. Which of the following options is an example of divide-and conquer paradigm?
Answer: stack

23. The two major reasons for documentation are clarity and _______.
Answer: Extensibility

24. The full meaning of the acronym ANSI is _________

Answer: American National Standards Institute

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

26. __________ algorithms require dividing problems into sub-instances

Answer: divide-and-conquer

27. The process of adding elements to the stack

Answer: Push

28. Java is an example of a (an)

Answer: Object-Oriented Programming

29. Another name for assembly language is ________

Answer: low level languages

30. Which of the following options is not correct as for the feature(s) of programming
languages?
Answer: D. Specific to particular Machine

31. Algorithms that do not recall back the same algorithm or function are referred to as
being __________
Answer: non-recursive

32. ________ system testing is designed to ensure that the system requirements and
specifications are achieved
Answer: functtional
33. _________ is the fifth stage of algorithm design
Answer: Analysis

34. A programming language must have language structure, which consists of ________,
expressions and statements
Answer: keywords

35. The major standard integer data-types are real, single, double and _________
Answer: extended

36. Algorithms that do not recall back the same algorithm or function are referred to as
being __________
Answer: non-recursive

37. _________ is the process of adding elements to the stack

Answer: Push

38. The object code is the result of the compilation process and it is also referred to as the
________ code
Answer: target

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

Answer: Merge sort

41. Divide-and-conquer algorithms are typically recursive.

Answer: True

42. Which algorithm is known for its worst-case time complexity of O(n²)?
Answer: QuickSort

43. A key characteristic of a stable sorting algorithm is that it preserves the relative order of
records with equal keys.
Answer: True

44. What type of data structure is used in the implementation of a stack?

Answer: Array or Linked List
45. The time complexity of Binary Search is:
Answer: O(log n)

46. In which sorting algorithm is the pivot element used?

Answer: QuickSort

47. Which sorting algorithm is known to be slowest in the worst case?

Answer: Bubble Sort

48. Which of the following is a feature of the Mergesort algorithm?

Answer: It is stable and efficient for large datasets.