Question
a.
Insertion in a sorted array takes constant time.
b.
Insertion in a sorted linear linked list takes constant time.
c.
Searching for a key in a sorted array can be done in O(log n) time.
d.
Searching for a key in a sorted linear linked list can be done in O(log n) time.
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Which of the following is true for a sorted list with ‘n’ elements?
Similar Questions
Discover Related MCQs
Q. Consider a rooted tree in which every node has at least three children. What is the minimum number of nodes at level i (i > 0) of the tree? Assume that the root is at level 0:
View solution
Q. Which of the following data structure is used to implement recursion?
View solution
Q. The height of a binary tree with ‘n’ nodes, in the worst case is:
View solution
Q. Given a parallel algorithm A with computation time t, if parallel algorithm A performs m computational operation, then p processors can execute algorithm A in time given by:
View solution
Q. With reference to implementation of different association mining algorithms, identify the correct statement:
View solution
Q. The maximum number of nodes in a binary tree of depth 10 is:
View solution
Q. The time required to find shortest path in a graph with n vertices and e edges is:
View solution
Q. Pre order is also known as:
View solution
Q. The equivalent post fix expression for d/(e+f) + b*c is:
View solution
Q. Which algorithm has same average, worst case and best case time?
View solution
Q. Application of data structure in queue is:
View solution
Q. The number of edges in a complete graph with N vertices is equal to:
View solution
Q. Which algorithm has same average, worst case and best case time?
View solution
Q. Binary search tree is an example of:
View solution
Q. What is the time required to insert an element in a stack with linked implementation?
View solution
Q. The equivalent postfix expression for d/(e+f) + b*c:
View solution
Q. Which one of the following is a physical data structure ?
View solution
Q. Which of the following statement is false ?
View solution
Q. If the postfix form of a string is ABC+-D*, the actual string is:
View solution
Q. Application of data structure queue 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!