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