Who among the following is an Indian tabla virtuoso,

Which algorithm is used for computing Max-Flow in a network?

Given the following code snippet, which operation is performed on the binary tree to produce the output: 4, 2, 5, 1, 3 ?

Which data structure is most suitable for implementing a priority queue with logarithmic time complexity for insertion and deletion?

Tarjan’s algorithm is used to find:

In C++, which access specifier makes members accessible only from within the class itself and from friend functions/classes?

What is the worst-case time complexity for inserting an element into a hash table that uses separate chaining for collision resolution?

In a graph, what is the maximum number of edges in a simple undirected graph with 'n' vertices?

Time complexity of heap sort is:

Which of the following is true about triggers in a relational database?

What is the primary purpose of an abstract class?