This media is not supported in your browser
VIEW IN TELEGRAM
This media is not supported in your browser
VIEW IN TELEGRAM
This media is not supported in your browser
VIEW IN TELEGRAM
In tree terminology, two or more nodes are referred to as 'siblings' if they share which common attribute?
Anonymous Quiz
9%
A. The same degree.
74%
B. The same parent.
12%
C. The same set of ancestors.
5%
D. The same level
A node with a degree of 0 has a specific name. What is it?
Anonymous Quiz
15%
A. A root node.
74%
B. A leaf node.
0%
C. An ancestor node.
10%
D. A parent node.
❤2
What is a key property of a 'Complete Binary Tree'?
Anonymous Quiz
17%
A. Every internal node must have exactly two children
3%
B. The right subtree is always a mirror image of the left subtree.
33%
C. All leaf nodes must be at the same level.
47%
D. The tree is filled level by level, with the last level populated from left to right.
What is considered a significant disadvantage of using an array to represent a binary tree?
Anonymous Quiz
79%
A. Significant memory may be wasted for skewed or sparse trees.
12%
B. It cannot represent a full binary tree efficiently.
9%
C. Direct access to nodes is slow.
Which of the following is a primary advantage of using a linked representation for a binary tree?
Anonymous Quiz
9%
A. It provides fast, direct access to any node.
66%
B. Insertion and deletion of nodes is flexible and does not waste memory.
26%
C. the height of the tree must be known
Which binary tree traversal algorithm always visits the root node last?
Anonymous Quiz
5%
A. Preorder
62%
B. Postorder
16%
C. Level order
16%
D. Inorder
If a traversal's output order is 'Left subtree, Right subtree, Root', what is its name?
Anonymous Quiz
8%
A. Inorder
14%
B. Preorder
70%
C. Postorder
8%
D. Level Order
Which of the following sorting algorithms exhibits a time complexity of O(nlogn) in all scenarios (best, average, and worst)?
Anonymous Quiz
16%
A. Insertion Sort
6%
B. Selection Sort
22%
C. Quick Sort
56%
D. Merge Sort
Timesort is mentioned as a hybrid sorting algorithm. Which two algorithms does it combine?
Anonymous Quiz
32%
A. Heap Sort and Merge Sort
56%
B. Merge Sort and Insertion Sort
12%
C. Bubble Sort and Selection Sort
Which algorithm is based on the 'divide and conquer' paradigm of splitting a list, recursively sorting the halves, and then combining them?
Anonymous Quiz
15%
A. Insertion Sort
63%
B. Merge Sort
15%
C. Selection Sort
7%
D. Bubble Sort
Which sorting algorithm's time complexity is listed as O(n2) for the worst, average, and best cases?
Anonymous Quiz
66%
A. Selection Sort
10%
B. Quick Sort
14%
C. Insertion Sort
10%
D. Merge Sort
In the context of a linear search on a list containing n elements, which scenario represents the worst-case time complexity?
Anonymous Quiz
25%
A. The target element is the first item in the list.
46%
B. The target element is not present in the list.
13%
C. The target element is located in the middle of the list.
17%
D. The list of elements is unsorted
What is the most critical prerequisite that must be met before a binary search can be performed effectively?.
Anonymous Quiz
13%
A. The elements in the list must be uniformly distributed.
17%
B. The list must not contain any duplicate values.
22%
C. The list must contain a small number of elements
48%
D. The list must be sorted