What is the total number of binary search trees with 5 nodes?

In a Directed Acyclic Graph, which operation can be performed?

What problem does the Gale-Shapley algorithm solve?

Which of the following is an example of an algorithmic paradigm?

What is the maximum difference in heights between the leaves of an AVL tree?

You have a set of date intervals represented by StartDate and EndDate. What is the time complexity of finding the maximum timespan among these intervals?

Let A1, A2, A3, and A4 be four matrices of dimensions 10 x 5, 5 x 20, 20 x 10, and 10 x 5, respectively. The minimum number of scalar multiplications required to find the product A1A2A3A4 using the basic matrix multiplication method is

Checking for the presence of a subset that has the sum of its elements equal to a given number and printing true or false based on the result is called the

A complete binary min-heap is made by including each integer in [1, 1023] exactly once. The depth of a node in the heap is the length of the path from the root of the heap to that node. Thus, the root is at depth 0. The maximum depth at which integer 9 can appear is

Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE ?

I. Quicksort runs in Θ(n²) time

II. Bubblesort runs in Θ(n²) time

III. Mergesort runs in Θ(n) time

IV. Insertion sort runs in Θ(n) time