Foxoyo
Hey..!!
Data Structure
Practice
MCQs
Quizzes
About
Leaderboard
Amazon Books
25
MCQs
122
Attempts
60 %
Accuracy
share
Filter by
Type here
Apply
The complexity of Binary search algorithm is
O(log n)
O(n log n)
O(n)
O(n2)
The complexity of merge sort algorithm is
O(n2)
O(log n)
O(n log n)
O(n)
The complexity of Bubble sort algorithm is
O(n log n)
O(n2)
O(n)
O(log n)
Dijkstra's algorithm deals with
deadlock recovery
mutual exclusion
deadlock avoidance
cache coherence
Which of the following sorting algorithm is of divide-and-conquer type
bubble short
None
Insertion Sort
Quick Sort
Pushing an element into stack already having five element and stack size 5, then stack becomes
underflow
overflow
Crash
user flow
In a max-heap, element with the greatest key is always in the which node
First node of first right tree
Leaf node
Root node
First node of left sub tree
What is the time complexity to count the number of element in linked list
None
O(1)
O(n)
O(logn)
What is the worst case complexity of binary search using recursion
O(n)
O(n2)
O(logn)
O(nlogn)
The Data structure used in standard implementation of Breadth First Search
Queue
none of the mentioned
Linked List
Stack
With what data structure can a priority queue be implemented
All of the mentioned
Heap
List
Array
The situation when in a link list START = NULL is
overflow
underflow
saturated
housefull
The LRU algorithm
pages out pages that have been least used recently
pages out pages that have not been used recently
pages out the first page in a given area
pages out pages that have been used recently
…………… is not the component of data structure
Storage Structures
Operations
Algorithms
None of above
The algorithm which displays line-type attributes by plotting pixel spans is
Raster scan algorithm
Random line algorithm
Raster line algorithm
Random scan algorithm
In the ....... traversal we process all of a vertex’s descendants before we move to an adjacent vertex
Breadth First
Depth First
Depth Limited
With First
What is Average case Complexity of Bubble Sort
O(n)
O(n^3)
O(n^2)
O(log n)
To represent hierarchical relationship between elements, Which data structure is suitable
Priority
Graph
n2 spanning trees
Dequeue
What are the operations On a Stack
Size()
Dequeue()
clear()
Enqueue()
Which of the following follows Divide-N-Conquer Approach
Bubble Sort
Insertion Sort
Merge Sort
Greedy Algorithm
1
2
Next
take a quick Quiz
Practice mcqs on Data Structure
Let's start
pick difficulty level
all
1
2
3
4
5
25
Mcqs
122
attempts
6
followers
Related Topics
Data Structure Abstract Data Types
Data Structure
Data Structure Dynamic Programming
Data Structure Recursion
Data Structure Binary Trees
Data Structure Arrays Types
Data Structure Heap
Data Structure Searching
Data Structure Types of Lists
Data Structure Sorting
Suggested Books
Javascript is disabled
we serve best when javscript is enabled
Enable