CIT237

Category: CIT237

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. ________analysis is the first stage involved in developing an efficient program

2 / 50

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

3 / 50

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

4 / 50

4. Real numbers consist of values with _________ parts

5 / 50

5. A Tree is a connected _________ graph.

6 / 50

6. __________ algorithms require dividing problems into sub-instances

7 / 50

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

8 / 50

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

A. Procedural Programming

B. Object-Oriented Programming

C. Event- Driven Programming

D. Functional Programming

9 / 50

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

10 / 50

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

A. divide and conquer

B. Mergesort

C. Binary

D. Quicksort

11 / 50

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

A. Otions B and D

B. Quick sort

C. Binary

D. Mergesort

12 / 50

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

A. User Friendly

B. Saves time

C. Specific to particular Machine

D. Portable

13 / 50

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

14 / 50

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

A. Binary

B. Quicksort

C. divide and conquer

D. Mergesort

15 / 50

15. Another name for nondeterministic stage is _______

16 / 50

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

17 / 50

17. The full meaning of the acronym ANSI is _________

18 / 50

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

19 / 50

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

20 / 50

20. _________ sort scan the entire given list to find its smallest element

21 / 50

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

A. Quick sort

B. Bubble sort

C. Merge sort

D. Insertion sort

22 / 50

22. Another name for assembly language is ________

23 / 50

23. Java is an example of a (an)

A. Object-Oriented Programming

B. Logic Programming

C. Functional Programming

D. Procedural programming

24 / 50

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

A. Quicksort

B. Binary

C. Mergesort

D. divide and conquer

25 / 50

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

26 / 50

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

27 / 50

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

A. Mergesort

B. Quicksort

C. Binary

D. All of the options

28 / 50

28. Partition-Exchange Sort is also known as?

A. Stable

B. None of the options is correct

C. Operate in place

D. Adaptive

29 / 50

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

30 / 50

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

31 / 50

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

32 / 50

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

A. Program Documentation

B. Program Testing

C. Program Checking

D. Program Coding

33 / 50

33. The two major reasons for documentation are clarity and _______.

A. Extensibility

B. history

C. records

D. continuity

34 / 50

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

35 / 50

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

A. Cbest (n) = 1

B. Cworst (n) E O (log n)

C. Cavg (n) = 1 (log2 n)

D. Cavg (n) = 1

36 / 50

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

A. character

B. OOP

C. algorithm

D. pseudo-code

37 / 50

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

38 / 50

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

A. Documentation and Design

B. Literature Review

C. Testing and Debugging

D. Coding and Problem analysis

39 / 50

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

40 / 50

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

A. Analyst

B. Special

C. System

D. Engineer

41 / 50

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

A. Binary

B. Quicksort

C. Options A and B

D. Mergesort

42 / 50

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

A. Character

B. Numeric

C. Memo

D. String

43 / 50

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

44 / 50

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

45 / 50

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

A. Heap

B. Tree

C. Stack

D. Queue

46 / 50

46. _________ is the fifth stage of algorithm design

47 / 50

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

A. Hamiltonian graph

B. Hamiltonian circuit

C. Hamiltonian diagram

D. Hamitonian circuit

48 / 50

48. __________ sort divide its elements according to their values

49 / 50

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

A. All of the options

B. Binary

C. Mergesort

D. Quicksort

50 / 50

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

A. Modular Code

B. Object Code

C. Source Code

D. Machine Code

Rate this quiz