Category: CIT237 0 CIT237 1 / 50 _________ is the fifth stage of algorithm design Check 2 / 50 _________ attributes is used to analyse the performance of algorithm Check 3 / 50 Which of the following options is a recursive sort algorithm? Quicksort Mergesort All of the options Binary 4 / 50 Another name for assembly language is ________ Check 5 / 50 Which of the options is the standard number of rows and columns in a chess board? Cavg (n) = 1 (log2 n) Cbest (n) = 1 Cavg (n) = 1 Cworst (n) E O (log n) 6 / 50 _________ sort scan the entire given list to find its smallest element Check 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. Check 8 / 50 The ideal sorting algorithm would have the following properties,except? divide and conquer Binary Quicksort Mergesort 9 / 50 The following are advantages of Divide-and Conquer, except? Otions B and D Binary Quick sort Mergesort 10 / 50 A programming language must have language structure, which consists of ________, expressions and statements Check 11 / 50 ___________ is a fast and easy way to transverse an array of a given set of elements Check 12 / 50 Partition-Exchange Sort is also known as? Stable Adaptive Operate in place None of the options is correct 13 / 50 A procedure for solving computational problems is called an _________ Check 14 / 50 A finite sequence of unambiguous instructions for solving a problem is called ________ Modular Code Source Code Object Code Machine Code 15 / 50 Which of the following paradigms helps in the discovery of efficient algorithms? Quicksort Binary Mergesort All of the options 16 / 50 A Tree is a connected _________ graph. Check 17 / 50 _________ (1823) proposed an algorithm that finds a path without any backtracking Check 18 / 50 _______programmers are those who design and maintain the basic software that runs the system Engineer Analyst Special System 19 / 50 Among all elementary sorting methods, ___________ sorting is an inferior choice Check 20 / 50 _______ is the path that starts and ends at the same vertex and passes through all the other vertices exactly once Hamitonian circuit Hamiltonian circuit Hamiltonian graph Hamiltonian diagram 21 / 50 Decision problems that cannot be solved at all by any algorithm are called ________ problems Check 22 / 50 Which of the options has a time complexity of Î˜(n log(n)) on the average? Quicksort Options A and B Binary Mergesort 23 / 50 Class NP is the class of decision problem that can be solved by ________ polynomial algorithms Check 24 / 50 Which of the following options is the fastest sorting algorithm? Binary Mergesort divide and conquer Quicksort 25 / 50 Java is an example of a (an) Object-Oriented Programming Logic Programming Procedural programming Functional Programming 26 / 50 A data structure in which insertion and deletion can only be done at one end is called a ________ Character String Memo Numeric 27 / 50 A _________ is a partially ordered data structure that is used in implementing priority queues Check 28 / 50 Which of the options is an example of divide-and conquer paradigm? Queue Stack Heap Tree 29 / 50 The three popular methods used to develop a logic plan are flowcharts,_________ and a top-down chart pseudo-code character OOP algorithm 30 / 50 COBOL, FORTRAN, C, C++ are examples of a (an) ___________ Check 31 / 50 Which of the following options is the major reason(s) for documentation? Program Testing Program Documentation Program Coding Program Checking 32 / 50 Another name for nondeterministic stage is _______ Check 33 / 50 Real numbers consist of values with _________ parts Check 34 / 50 Which sort is an O(n log n) comparison-based sorting algorithm Bubble sort Quick sort Merge sort Insertion sort 35 / 50 The major standard integer data-types are real, single, double and _________ Check 36 / 50 _______ system testing isÂ designed to ensure that the system requirements and specifications are achieved Check 37 / 50 __________ sort divide its elements according to their values Check 38 / 50 The two major reasons for documentation are clarity and _______. records Extensibility history continuity 39 / 50 Which of the following options is not correct as for the feature(s) of programming languages? Saves time Portable Specific to particular Machine User Friendly 40 / 50 Which of the following sorting algorithms has average-case and worst case running time of O (n log n) ? Quicksort divide and conquer Binary Mergesort 41 / 50 The object code is the result of the compilation process and it is also referred to as the ________ code Check 42 / 50 The __________ case efficiency seeks to provide information on random input Check 43 / 50 The ________ function is used in most programming languages to get a remainder when a number is divided by another number Check 44 / 50 ________analysis is the first stage involved in developing an efficient program Check 45 / 50 The two efficiency attributes used to analyze the performance of an algorithm are time and ________ Check 46 / 50 __________ algorithms require dividing problems into sub-instances Check 47 / 50 _________ is the process of adding elements to the stack Check 48 / 50 Algorithms that do not recall back the same algorithm or function are referred to as being __________ Check 49 / 50 Which of the following stages of developing an efficient program is not correct? Event- Driven Programming Object-Oriented Programming Procedural Programming Functional Programming 50 / 50 The search that is based on both a recursive and non-recursive algorithms is called ___________ search Check Restart quiz Rate this quiz Send feedback