CIT237

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

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

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

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

E. Real numbers consist of values with _________ parts

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

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

H. Another name for assembly language is ________

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

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

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

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

M. Partition-Exchange Sort is also known as?

N. Another name for nondeterministic stage is _______

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

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

Q. __________ algorithms require dividing problems into sub-instances

R. __________ sort divide its elements according to their values

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

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

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

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

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

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

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

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

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

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

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

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

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

AF. Java is an example of a (an)

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

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

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

AJ. _________ is the fifth stage of algorithm design

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

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

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

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

AO. A Tree is a connected _________ graph.

AP. The full meaning of the acronym ANSI is _________

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

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

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

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

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

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

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

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

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

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

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