Loading...




Category: CIT237

0

CIT237

1 / 50

_________ is the fifth stage of algorithm design

2 / 50

_________ attributes is used to analyse the performance of algorithm

3 / 50

Which of the following options is a recursive sort algorithm?

4 / 50

Another name for assembly language is ________

5 / 50

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

6 / 50

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

7 / 50

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.

8 / 50

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

9 / 50

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

10 / 50

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

11 / 50

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

12 / 50

Partition-Exchange Sort is also known as?

13 / 50

A procedure for solving computational problems is called an _________

14 / 50

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

15 / 50

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

16 / 50

A Tree is a connected _________ graph.

17 / 50

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

18 / 50

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

19 / 50

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

20 / 50

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

21 / 50

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

22 / 50

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

23 / 50

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

24 / 50

Which of the following options is the fastest sorting algorithm?

25 / 50

Java is an example of a (an)

26 / 50

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

27 / 50

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

28 / 50

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

29 / 50

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

30 / 50

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

31 / 50

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

32 / 50

Another name for nondeterministic stage is _______

33 / 50

Real numbers consist of values with _________ parts

34 / 50

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

35 / 50

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

36 / 50

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

37 / 50

__________ sort divide its elements according to their values

38 / 50

The two major reasons for documentation are clarity and _______.

39 / 50

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

40 / 50

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

41 / 50

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

42 / 50

The __________ case efficiency seeks to provide information on random input

43 / 50

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

44 / 50

________analysis is the first stage involved in developing an efficient program

45 / 50

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

46 / 50

__________ algorithms require dividing problems into sub-instances

47 / 50

_________ is the process of adding elements to the stack

48 / 50

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

49 / 50

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

50 / 50

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

Rate this quiz