Q. Which of the following data structure is used to implement recursion?

View solution

Q. The height of a binary tree with ‘n’ nodes, in the worst case is:

View solution

Q. Given a parallel algorithm A with computation time t, if parallel algorithm A performs m computational operation, then p processors can execute algorithm A in time given by:

View solution

Q. With reference to implementation of different association mining algorithms, identify the correct statement:

View solution

Q. The maximum number of nodes in a binary tree of depth 10 is:

View solution

Q. The time required to find shortest path in a graph with n vertices and e edges is:

View solution

Q. Pre order is also known as:

View solution

Q. The equivalent post fix expression for d/(e+f) + b*c is:

View solution

Q. Which algorithm has same average, worst case and best case time?

View solution

Q. Application of data structure in queue is:

View solution

Q. The number of edges in a complete graph with N vertices is equal to:

View solution

Q. Which algorithm has same average, worst case and best case time?

View solution

Q. Binary search tree is an example of:

View solution

Q. What is the time required to insert an element in a stack with linked implementation?

View solution

Q. The equivalent postfix expression for d/(e+f) + b*c:

View solution

Q. Which one of the following is a physical data structure ?

View solution

Q. Which of the following statement is false ?

View solution

Q. If the postfix form of a string is ABC+-D*, the actual string is:

View solution

Q. Application of data structure queue is:

View solution

Q. T is a graph with n vertices. T is connected and has exactly n-1 edges, then:

View solution