CIT237




Category: CIT237

0

ATTENTION:

Kindly note that you will be presented with 50 questions randomized from the NOUN question bank. Make sure to take the quiz multiple times so you can get familiar with the questions and answers, as new questions are randomized in each attempt.

Good luck!


CIT237

1 / 50

1. The full meaning of the acronym ANSI is _________

2 / 50

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

3 / 50

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

4 / 50

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

5 / 50

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

6 / 50

6. __________ algorithms require dividing problems into sub-instances

7 / 50

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

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

9 / 50

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

10 / 50

10. A Tree is a connected _________ graph.

11 / 50

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

12 / 50

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

13 / 50

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

14 / 50

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

15 / 50

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

16 / 50

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

17 / 50

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

18 / 50

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

19 / 50

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

20 / 50

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

21 / 50

21. Another name for nondeterministic stage is _______

22 / 50

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

23 / 50

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

24 / 50

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

25 / 50

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

26 / 50

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

27 / 50

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

28 / 50

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

29 / 50

29. Java is an example of a (an)

30 / 50

30. Another name for assembly language is ________

31 / 50

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

32 / 50

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

33 / 50

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

34 / 50

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

35 / 50

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

36 / 50

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

37 / 50

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

38 / 50

38. __________ sort divide its elements according to their values

39 / 50

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

40 / 50

40. Partition-Exchange Sort is also known as?

41 / 50

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

42 / 50

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

43 / 50

43. _________ is the fifth stage of algorithm design

44 / 50

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

45 / 50

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

46 / 50

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

47 / 50

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

48 / 50

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

49 / 50

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

50 / 50

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

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

COIN303

SLOT GACOR

JUDI BOLA ONLINE

COIN303

coin303

judi bola online

agen casino online

coin303

situs casino online

live casino online

link slot gacor

COIN303

slot mahjong

judi bola

live casino online

judi bola online

judi bola online

Angpao Imlek

COIN303

mix parlay

Microgaming

Togel Online

COIN303

COIN303

judi bola online

COIN303

COIN303

COIN303

COIN303

COIN303

slot online

judi bola online

jubol

slot mahjong

sbobet88

judi bola

slot pg

COIN303