What will be the time complexity of insertion operation if all the candidates are evenly spaced so that each bin has constant no. of candidates? (m = number of bins intersecting candidate intersects)
A. O(1)
B. O(m)
C. O(m2 )
D. O(log m)
Select an option to see the answer and solution.
What is the worst case time complexity of insertion operation(n =no. of candidates)?
A. O(1)
B. O(n)
C. O(log n)
D. O(n log n)
Select an option to see the answer and solution.
What is the condition for an equivalence relation if two cities are related within a country?
A. the two cities should have a one-way connection
B. the two cities should have a two-way connection
C. the two cities should be in different countries
D. no equivalence relation will exist between two cities
Select an option to see the answer and solution.
When executing a sequence of Unions, a node of rank r must have at least 2r descendants.
Select an option to see the answer and solution.
In an abstract syntax tree, each internal node represents an operand and each leaf node represents an operator.
Select an option to see the answer and solution.
Parse tree is constructed from the tokens produced by lexical analyzer.
Select an option to see the answer and solution.
Which node is the child node of the Node D in the following ternary tree?
Select an option to see the answer and solution.
Which node is the child node of the Node B in the following K-ary tree?
Select an option to see the answer and solution.
While evaluating the parse tree, which traversal technique is used to give the original input string?
A. Pre-order traversal
B. In-order traversal
C. Post-order traversal
D. Breadth-first traversal
Select an option to see the answer and solution.
What is the definition for Ackermann's function?
A. A(1,i) = i+1 for i>=1
B. A(i,j) = i+j for i>=j
C. A(i,j) = i+j for i = j
D. A(1,i) = i+1 for i<1
Select an option to see the answer and solution.
What is the run time of finding the nearest neighbour in a k-d tree?
A. O(2+ log N)
B. O( log N)
C. O(2d log N)
D. O( N log N)
Select an option to see the answer and solution.
An expression tree is a kind of?
A. Binary search tree
B. Fibonacci tree
C. Binary tree
D. Treap
Select an option to see the answer and solution.
What will be the correct sequence of insertion for the following k-d tree?
A. (30,40),(5,25),(70,70),(10,12),(50,30),(35,45)
B. (40,30),(5,25),(12,10),(70,70),(30,50),(45,35)
C. (30,40),(5,25),(10,12),(70,70),(50,30),(35,45)
D. (40,30),(25,5),(12,10),(70,70),(50,30),(45,35)
Select an option to see the answer and solution.
Can leaf node be called child node in a ternary tree?
Select an option to see the answer and solution.
Which node is the root node of the following K-ary tree?
Select an option to see the answer and solution.
A node can have a minimum of one child.
Select an option to see the answer and solution.
Is parent node of Node 4 and root node of the given K-ary tree same?
Select an option to see the answer and solution.
How many strategies are followed to solve a dynamic equivalence problem?
Select an option to see the answer and solution.
Path Compression algorithm performs in which of the following operations?
A. Create operation
B. Insert operation
C. Find operation
D. Delete operation
Select an option to see the answer and solution.
Which node is the child node of Node C in the following K-ary tree?
Select an option to see the answer and solution.