CIT237




Category: CIT237

0

CIT237

1 / 53

A. Another name for nondeterministic stage is _______

2 / 53

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

3 / 53

C. Java is an example of a (an)

4 / 53

D. Real numbers consist of values with _________ parts

5 / 53

E. Another name for assembly language is ________

6 / 53

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

7 / 53

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

8 / 53

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

9 / 53

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

10 / 53

J. A Tree is a connected _________ graph.

11 / 53

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

12 / 53

L. __________ algorithms require dividing problems into sub-instances

13 / 53

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

14 / 53

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

15 / 53

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

16 / 53

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

17 / 53

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

18 / 53

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

19 / 53

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

20 / 53

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

21 / 53

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

22 / 53

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

23 / 53

W. Partition-Exchange Sort is also known as?

24 / 53

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

25 / 53

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

26 / 53

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

27 / 53

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

28 / 53

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

29 / 53

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

30 / 53

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

31 / 53

AE. __________ sort divide its elements according to their values

32 / 53

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

33 / 53

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

34 / 53

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

35 / 53

AI. The full meaning of the acronym ANSI is _________

36 / 53

AJ. _________ is the fifth stage of algorithm design

37 / 53

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

38 / 53

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

39 / 53

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

40 / 53

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

41 / 53

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

42 / 53

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

43 / 53

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

44 / 53

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

45 / 53

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

46 / 53

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

47 / 53

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

48 / 53

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

49 / 53

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

50 / 53

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

51 / 53

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

52 / 53

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

53 / 53

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

Rate this quiz




Hello NOUNITES! Join other NOUNITES on Whatsapp and Telegram below, EXCLUSIVE UPDATES awaits you from various study centres and happenings in NOUN. Stay updated
 
Don't miss out, JOIN OVER 22,000 other students already following our platforms

FOLLOW WHATSAPP CHANNEL  FOLLOW TELEGRAM CHANNEL 
    
JOIN WHATSAPP GROUP   JOIN TELEGRAM GROUP
close-link