Q1. What are null nodes filled with in a threaded binary tree?.
A. inorder predecessor for left node and inorder successor for right node information.
B. right node with inorder predecessor and left node with inorder successor information.
C. they remain null.
D. some other values randomly.
Answer= inorder predecessor for left node and inorder successor for right node information
Q2. The null left pointer pointing to predecessor and null right pointer pointing to successor. how many types of threaded tree are possible with this convention?.
A. inorder, postorder, preorder traversals.
B. inorder.
C. postorder.
D. preorder.
Answer= inorder, postorder, preorder traversals
Q3. What are double and single threaded trees?.
A. when both left, right nodes are having null pointers and only right node is null pointer respectively.
B. having 2 and 1 node.
C. using single and double linked lists.
D. using heaps and priority queues.
Answer= when both left, right nodes are having null pointers and only right node is null pointer respectively
Q4. Who developed the concept of tango tree?.
A. Erik Demaine.
B. Mihai Patrascu.
C. John Lacono.
D. All of the mentioned.
Answer= All of the mentioned
Q5. Which type of tree is tango tree?.
A. Ternary Tree.
B. AVL Tree.
C. Binary Search Tree.
D. K-ary Tree.
Answer= Binary Search Tree
Q6. After which city is tango tree named?.
A. Vatican City.
B. Buenos Aires.
C. New York.
D. California.
Answer= Buenos Aires
Q7. Which type of binary search tree or algorithm does tango tree use?.
A. Online.
B. Offline.
C. Static.
D. Dynamic.
Answer= Dynamic
Q8. What is the time complexity of for achieving competitive ratio by tango tree?.
A. O (log n).
B. O (n2).
C. O (n!).
D. O (log (log n)).
Answer= O (log (log n))
Q9. Which type of binary search tree is imitated for construction of tango tree?.
A. Complete Binary Search Tree.
B. Perfect Binary Search Tree.
C. Balanced Binary Search Tree.
D. Degenerate Binary Search Tree.
Answer= Complete Binary Search Tree
Q10. Which special balanced binary search tree is used to store the nodes of auxiliary tree?.
A. Red - Black Tree.
B. Red - Brown Tree.
C. Red - Yellow Tree.
D. Red - Tango Tree.
Answer= Red - Black Tree
Q11. Is tango tree represented as a tree of trees..
A. TRUE.
B. FALSE.
C. Nothing can be said.
D. None of the mentioned.
Answer= TRUE
Q12. Which operation is used to combine two auxiliary trees?.
A. Join.
B. Combinatorial.
C. Add.
D. Concatenation.
Answer= Join
Q13. Is partitioning method used by Tango Tree..
A. TRUE.
B. FALSE.
C. Nothing can be said.
D. None of the mentioned.
Answer= TRUE
Q14. Which operation is used to break a preferred path into two sets of parts at a particular node?.
A. Differentiate.
B. Cut.
C. Integrate.
D. Join.
Answer= Cut
Q15. What is the upper bound for a tango tree if k is a number of interleaves?.
A. k+2 O (log (log n)).
B. k O (log n).
C. K2 O (log n).
D. k+1 O (log (log n)).
Answer= k+1 O (log (log n))
Q16. What is the time complexity for searching k+1 auxiliary trees?.
A. k+2 O (log (log n)).
B. k+1 O (log n).
C. K+2 O (log n).
D. k+1 O (log (log n)).
Answer= k+1 O (log (log n))
Q17. What is the time complexity for the update cost on auxiliary trees?.
A. O (log (log n)).
B. k-1 O (log n).
C. K2 O (log n).
D. k+1 O (log (log n)).
Answer= k+1 O (log (log n))
Q18. Which of the following is the self-adjusting binary search tree?.
A. AVL Tree.
B. Splay Tree.
C. Top Tree.
D. Ternary Tree.
Answer= Splay Tree
Q19. Which of the following is also known as Rope data structure?.
A. Cord.
B. String.
C. Array.
D. Linked List.
Answer= Cord
Q20. Which type of data structure does rope represent?.
A. Array.
B. Linked List.
C.
Que.
D. Binary Tree.
Answer= Binary Tree
Q21. What is the time complexity for finding the node at x position where n is the length of the rope?.
A. O (log n).
B. O (n!).
C. O (n2).
D. O (1).
Answer= O (log n)
Q22. What is the time complexity for creating a new node and then performing concatenation in the rope data structure?.
A. O (log n).
B. O (n!).
C. O (n2).
D. O (1).
Answer= O (1)
Q23. What is the time complexity for splitting the string into two new string in the rope data structure?.
A. O (n2).
B. O (n!).
C. O (log n).
D. O (1).
Answer= O (log n)
Q24. Which type of binary tree does rope require to perform basic operations?.
A. Unbalanced.
B. Balanced.
C. Complete.
D. Full.
Answer= Balanced
Q25. What is the time complexity for inserting the string and forming a new string in the rope data structure?.
A. O (log n).
B. O (n!).
C. O (n2).
D. O (1).
Answer= O (log n)
Q26. Is insertion and deletion operation faster in rope than an array?.
A. TRUE.
B. FALSE.
C. Nothing Can be said.
D. None of the mentioned.
Answer= TRUE
Q27. What is the time complexity for deleting the string to form a new string in the rope data structure?.
A. O (n2).
B. O (n!).
C. O (log n).
D. O (1).
Answer= O (log n)
Q28. Which of the following is the most widely used external memory data structure?.
A. AVL tree.
B. B-tree.
C. Red-black tree.
D. Both AVL tree and Red-black tree.
Answer= B-tree
Q29. B-tree of order n is a order-n multiway tree in which each non-root node contains __________.
A. at most (n - 1)/2 keys.
B. exact (n - 1)/2 keys.
C. at least 2n keys.
D. at least (n - 1)/2 keys.
Answer= at least (n - 1)/2 keys
Q30. A B-tree of order 4 and of height 3 will have a maximum of _______ keys..
A. 255.
B. 63.
C. 127.
D. 188.
Answer= 255