
FUNDAMENTALS OF ALGORITHMS - UNIT 3 MCQS

Quiz
•
Computers
•
12th Grade
•
Hard
MS.SHYAMALADEVI C
Used 1+ times
FREE Resource
15 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is a priority queue and how does it differ from a regular queue?
A priority queue serves elements in LIFO order.
A priority queue is a type of stack that serves elements based on their size.
A priority queue serves elements based on priority, while a regular queue serves elements in FIFO order.
A priority queue does not have any specific order for serving elements.
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Explain the structure of a binary heap.
A binary heap is a type of graph that can have cycles.
A binary heap is an unordered collection of elements stored in a list.
A binary heap is a complete binary tree that satisfies the heap property, either as a max-heap or min-heap.
A binary heap is a linear data structure that allows for efficient searching.
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the time complexity of heap sort in the average case?
O(log n)
O(n log n)
O(n)
O(n^2)
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Describe the merge sort algorithm and its time complexity.
Merge sort requires more space than quicksort.
The time complexity of merge sort is O(n^2).
Merge sort is a linear sorting algorithm.
The time complexity of merge sort is O(n log n), where n is the number of elements in the array.
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
How does quick sort choose a pivot element?
Quick sort chooses a pivot element by selecting the first, last, random, or median element.
Quick sort always picks the middle element as the pivot.
Quick sort selects the pivot as the average of all elements.
Quick sort chooses a pivot element based on the largest element in the array.
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
What is the worst-case time complexity of quick sort?
O(log n)
O(n log n)
O(n)
O(n^2)
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Explain how binary search works and its time complexity.
Binary search works by checking every element in the array sequentially.
The time complexity of binary search is O(log n).
The time complexity of binary search is O(n).
Binary search can only be applied to unsorted arrays.
Create a free account and access millions of resources
Similar Resources on Wayground
20 questions
Principles of Computer Science

Quiz
•
10th - 12th Grade
20 questions
2.1 Algorithms

Quiz
•
10th - 12th Grade
16 questions
Searching & Sorting Algorithms

Quiz
•
10th Grade - University
15 questions
AS Computing: Data Structures

Quiz
•
10th Grade - University
20 questions
19.1 Algorithms Cambridge iA 9618

Quiz
•
12th Grade
10 questions
Heap Sort in Java

Quiz
•
12th Grade
20 questions
Algorithm questions

Quiz
•
12th Grade - University
12 questions
Big O Notation Revision

Quiz
•
12th Grade
Popular Resources on Wayground
15 questions
Hersheys' Travels Quiz (AM)

Quiz
•
6th - 8th Grade
20 questions
PBIS-HGMS

Quiz
•
6th - 8th Grade
30 questions
Lufkin Road Middle School Student Handbook & Policies Assessment

Quiz
•
7th Grade
20 questions
Multiplication Facts

Quiz
•
3rd Grade
17 questions
MIXED Factoring Review

Quiz
•
KG - University
10 questions
Laws of Exponents

Quiz
•
9th Grade
10 questions
Characterization

Quiz
•
3rd - 7th Grade
10 questions
Multiply Fractions

Quiz
•
6th Grade