CIT237

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

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

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

D. __________ algorithms require dividing problems into sub-instances

E. Another name for nondeterministic stage is _______

F. Partition-Exchange Sort is also known as?

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

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

I. Another name for assembly language is ________

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

K. Java is an example of a (an)

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

M. __________ sort divide its elements according to their values

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

AG. _________ is the fifth stage of algorithm design

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

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

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

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

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

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

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

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

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

AQ. Real numbers consist of values with _________ parts

AR. A Tree is a connected _________ graph.

AS. The full meaning of the acronym ANSI is _________

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

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

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

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

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

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

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

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