Computer Science Hard

Algorithms

Practice Algorithms MCQs as part of Computer Science.

20 MCQs
Hard difficulty

Questions in this Topic

What is an algorithm?
Easy
Which sorting algorithm repeatedly swaps adjacent elements if they are in the wrong order?
Medium
What is the time complexity of binary search on a sorted array?
Hard
Binary search requires the data to be:
Medium
What does "Big O notation" describe?
Medium
Which algorithmic technique solves a problem by breaking it into smaller subproblems an...
Hard
Which searching algorithm checks each element one by one?
Easy
A recursive function is one that:
Medium
What is the worst-case time complexity of linear search on n elements?
Medium
What is the worst-case time complexity of bubble sort?
Medium
What is the time complexity of merge sort?
Hard
Merge sort follows which algorithmic technique?
Medium
In a recursive function, the condition that stops further recursive calls is called the:
Medium
Which data structure is used by Breadth-First Search (BFS) to visit nodes level by level?
Medium
Which algorithm finds the shortest path from a source node in a weighted graph with non...
Hard
A greedy algorithm works by:
Medium
What does the space complexity of an algorithm measure?
Easy
Which sorting algorithm repeatedly selects the smallest remaining element and places it...
Medium
Which of the following operations has O(1) (constant) time complexity?
Medium
In quick sort, the element around which the array is partitioned is called the:
Easy
Topic Info
SubjectComputer Science
TopicAlgorithms
Total MCQs20
DifficultyHard
Start Practice