Question
I. aⁿ = O(n²) (small oh) a>0
II. an²=O(n²) (big oh) a>0
III. an² O(n²) (small oh) a>0
a.
Only I and II are correct
b.
Only I is correct
c.
I and III are correct
d.
All are correct
Posted under GATE cse question paper Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Which one of the following is true? I. aⁿ = O(n²) (small oh) a>0 II. an²=O(n²) (big oh) a>0 III. an² O(n²) (small oh) a>0
Similar Questions
Discover Related MCQs
Q. If the array is sorted the complexity is
View solution
Q. If the array is in reverse sorted order, then time complexities will be
View solution
Q. What be the time complexity for any typical array order?
View solution
Q. Quick sort gives O(n log n) worst case performances if the pivot is selected as
View solution
Q. T (n) = (2n/3)+1 then T(n) is equal to
View solution
Q. A language developed to assist children in learning geometric shapes and computing aspects is
View solution
Q. Search tables used by compilers for efficient searching generally use
View solution
Q. A complete binary tree with 10 leaves
View solution
Q. Which of the following is not correct?
View solution
Q. Maximum possible height of an AVL tree with 7 nodes is
View solution
Q. What is the minimal number of edges which must be removed from a complete bi partite graph of 6 nodes k(6) so that the remaining graph is planer?
View solution
Q. A strictly binary tree with n leave always contain nodes?
View solution
Q. The following sequence of the operations is performed on a stack PUSH(10), PUSH(20), POP, PUSH(10), PUSH(20), POP, POP, POP, PUSH(20), POP the sequence of values popped out is
View solution
Q. The time complexity of comparison based sorting algorithm is
View solution
Q. Adjacency matrix for a digraph is
View solution
Q. The time required to insert an element in a stack with linked list implementation is
View solution
Q. The time required to search an element in a binary search tree having n element is
View solution
Q. Merge sort uses
View solution
Q. For merging two sorted lists of sizes m and n to a sorted list of size m+n, we require Comparisons of
View solution
Q. The search concept used in associative memory is
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
