(A) n
(B) n-1
(C) (n+1)/2
(D) n/2
Category: Fundamentals of Algorithms Mcqs
Fundamentals of Algorithms Mcqs for Screening tests, Interviews, Viva and Other competitive exams. Algorithms Mcqs section will help users to prepare mcqs of Computer Algorithms for various exams. Aspirants of Lecturer Computer Science, SST Computer Science, Subject Specialist Computer Science, Data Entry operator, Computer Programmer, Computer Operator, System administrator and all other Exams can prepare their Algorithms portion from here.
Given a set A of n distinct numbers and an integer k, 1 ≤ k ≤ n, output the element of A of rank k.This problem is of type?
(A) Merge Sort
(B) Selection Sort
(C) Maximal
(D) none
The rank of an element is its final position if the set is sorted__.
(A) true
(B) false
(C) NA
(D) NA
Define the __ of an element to be one plus the number of elements that are smaller.
(A) degree
(B) rank
(C) frequency
(D) weight
Merge of two lists of size m/2 to a list of size m takes Θ(m) time, which we will just write as m?
(A) True
(B) False
(C) NA
(D) NA
Iteration __ powerful technique for solving recurrences.
(A) is a not a
(B) might be
(C) is a very
(D) none
Floor and ceilings __ a pain to deal with.
(A) are not
(B) are
(C) sometime
(D) none
The minimum is of rank __ and the maximum is of rank __.
(A) 0 , 1
(B) 0 , n
(C) 1 , n
(D) none