Loading...




Category: CIT237

0

CIT237

1 / 50

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

2 / 50

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

3 / 50

The __________ case efficiency seeks to provide information on random input

4 / 50

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

5 / 50

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

6 / 50

Which of the following options is a recursive sort algorithm?

7 / 50

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

8 / 50

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

9 / 50

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

10 / 50

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

11 / 50

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

12 / 50

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

13 / 50

Another name for nondeterministic stage is _______

14 / 50

_________ is the process of adding elements to the stack

15 / 50

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

16 / 50

The two major reasons for documentation are clarity and _______.

17 / 50

________analysis is the first stage involved in developing an efficient program

18 / 50

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

19 / 50

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

20 / 50

Which of the following options is the fastest sorting algorithm?

21 / 50

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

22 / 50

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

23 / 50

Partition-Exchange Sort is also known as?

24 / 50

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

25 / 50

Java is an example of a (an)

26 / 50

_________ is the fifth stage of algorithm design

27 / 50

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

28 / 50

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

29 / 50

Another name for assembly language is ________

30 / 50

__________ algorithms require dividing problems into sub-instances

31 / 50

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

32 / 50

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

33 / 50

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

34 / 50

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

35 / 50

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

36 / 50

A Tree is a connected _________ graph.

37 / 50

_________ attributes is used to analyse the performance of algorithm

38 / 50

The full meaning of the acronym ANSI is _________

39 / 50

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

40 / 50

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

41 / 50

A procedure for solving computational problems is called an _________

42 / 50

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

43 / 50

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

44 / 50

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

45 / 50

__________ sort divide its elements according to their values

46 / 50

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

47 / 50

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

48 / 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.

49 / 50

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

50 / 50

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

Rate this quiz