The number of possible binary trees with 5 nodes is:

Which function is used to return the number of characters in a string?

Which technique does merge sort use to implement sorting?

For parameters a and b, both of which are ω(1), T(n)=T(n1/a)+1, and T(b)=1. Then T(n) is

Why do we need a binary tree that is height-balanced?

In which of the following ciphers does the plaintext and ciphertext have a different number of letters?

The longest palindromic subsequence problem is used to solve which of the following?

What is the predefined Java method to convert a decimal number to its binary string representation?

Which of the following is not an advantage of a bit array?

When will the quick sort algorithm be preferred?