Grade 11 Quizzes , Questions & Answers

Recent Grade 11 Quizzes

This Memoization Basics Quiz tests your understanding of memoization, a key optimization technique in dynamic programming. You'll explore how memoization reduces redundant calculations by storing previously computed results....

Questions: 15 | Attempts: 10 | Last updated: Apr 30, 2026

Sample Question
What is memoization?

Storing previously computed results to avoid redundant calculations

Breaking a problem into smaller subproblems and solving them

Writing code comments to remember algorithm logic

Sorting data in memory before processing

Dynamic Programming Basics Quiz

This Dynamic Programming Basics Quiz evaluates your understanding of key concepts in dynamic programming, including memoization, overlapping subproblems, and optimal substructure. Designed for grade 11 students, it covers...

Questions: 15 | Attempts: 10 | Last updated: Apr 30, 2026

Sample Question
What is the primary goal of dynamic programming?

To break problems into smaller subproblems and store results

To use random algorithms for faster computation

To eliminate all loops in code

To maximize memory usage

Binary Search Algorithm Quiz

Test your understanding of the Binary Search Algorithm Quiz and core divide-and-conquer principles. This quiz evaluates your ability to analyze search efficiency, trace algorithm execution, and apply binary search to real-world...

Questions: 15 | Attempts: 18 | Last updated: Apr 30, 2026

Sample Question
What is the primary advantage of binary search over linear search on a sorted array?

It uses less memory

It reduces time complexity to O(log n)

It works on unsorted arrays

It is easier to implement

Merge Sort Algorithm Quiz

This quiz tests your understanding of the Merge Sort Algorithm Quiz, a fundamental divide-and-conquer sorting technique. You'll explore how merge sort divides arrays, merges subarrays, and achieves efficient O(n log n)...

Questions: 15 | Attempts: 16 | Last updated: Apr 30, 2026

Sample Question
What is the primary principle behind the merge sort algorithm?

Divide the array in half, sort each half, then merge them back together

Compare adjacent elements and swap them if out of order

Select a pivot and partition the array around it

Build a sorted array by inserting elements one at a time

Difference Between Directed and Undirected Graph Quiz

Test your understanding of graph theory fundamentals with this quiz on the difference between directed and undirected graphs. Learn to identify graph types, understand edge direction, and apply key concepts like vertices, edges,...

Questions: 15 | Attempts: 11 | Last updated: Apr 30, 2026

Sample Question
In an undirected graph, what does an edge represent?

A one-way connection between two vertices

A two-way connection between two vertices

A loop within a single vertex

A weighted path only

Depth First Search Quiz

This Depth First Search Quiz evaluates your understanding of DFS algorithms, tree traversal techniques, and graph exploration strategies. Perfect for Grade 11 students, it covers DFS implementation, stack-based approaches, and...

Questions: 15 | Attempts: 13 | Last updated: Apr 30, 2026

Sample Question
What data structure is primarily used in the iterative implementation of depth-first search?

Queue

Stack

Heap

Linked List

Breadth First Search Quiz

This Breadth First Search Quiz tests your understanding of BFS as a graph traversal algorithm. You'll explore how BFS explores vertices level by level, its applications in shortest-path finding, and how it differs from...

Questions: 15 | Attempts: 36 | Last updated: Apr 30, 2026

Sample Question
What data structure is primarily used in Breadth First Search?

Stack

Queue

Heap

Linked list

Difference Between Min Heap and Max Heap Quiz

Test your understanding of heap data structures with this medium-level quiz. This Difference Between Min Heap and Max Heap Quiz covers key concepts including heap properties, insertion, deletion, and practical applications....

Questions: 16 | Attempts: 10 | Last updated: Apr 30, 2026

Sample Question
In a min heap, how does the parent node compare to its children?

Parent is smaller than or equal to both children

Parent is larger than both children

Parent is equal to both children

There is no relationship between parent and children

Heap Operations Quiz

This Heap Operations Quiz evaluates your understanding of heap data structures and their core operations. Test your knowledge of min-heaps, max-heaps, insertion, deletion, and heapify processes. Designed for Grade 11 students,...

Questions: 15 | Attempts: 10 | Last updated: Apr 30, 2026

Sample Question
What is the primary property of a max-heap?

Parent node is greater than or equal to its children

Parent node is less than or equal to its children

All levels must be completely filled

Left child is always greater than right child

Max Heap Basics Quiz

This Max Heap Basics Quiz tests your understanding of heap data structures, focusing on properties, operations, and implementation. You'll explore max heap concepts including insertion, deletion, and array representation. Ideal...

Questions: 15 | Attempts: 11 | Last updated: Apr 30, 2026

Sample Question
In a max heap, what property must the parent node satisfy relative to its children?

Parent is less than both children

Parent is greater than or equal to both children

Parent equals the sum of children

Parent and children have no relationship

« Previous 1...101 102 103 104105106 107 108 109...474 Next »