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