7, 8, 12, 21, 37,

In a binary tree, if the number of leaf nodes is L, what is the number of nodes with two children?

The time complexity of the best case for QuickSort is:

Which of the following is considered the strongest type of encryption method in modern cyber security practices?      

In dynamic programming, overlapping subproblems and _________ are key properties.

Which algorithm finds the shortest paths between all pairs of vertices in a weighted graph?

Which data structure supports extraction of both min and max in O(1) time and insertion in O(log n)?

What is the primary goal of Cyber Security?

What is the time complexity of inserting an element in a heap?

Which algorithm is best suited for finding a Hamiltonian cycle in an undirected graph?       

Which of the following is shared by the thread of the same process.