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

Q. In what tree, for every node the height of its left subtree and right subtree differ at least by one:

View solution

Q. A hash function f defined as f(key) = key mod 7, with linear probing it is used to insert the key 37, 38, 72, 48, 98, 11, 56 into a table index from 0 to 6. What will be the locations of 11?

View solution

Q. The initial configuration of queue is a, b, c, d. ‘a’ is at the front. To get the configuration d, c, b, a how many deletions and additions required:

View solution