This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Rope”. 1. Which of the following is also known as Rope data structure? a) Cord b) String c) Array d) Linked List 2. Which type of data structure does rope represent? a) Array b) Linked List c) Queue d) Binary … Read more

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Tango Tree”. 1. Who developed the concept of tango tree? a) Erik Demaine b) Mihai Patrascu c) John Lacono d) All of the mentioned 2. Which type of tree is tango tree? a) Ternary Tree b) AVL Tree c) Binary … Read more

This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Threaded Binary Tree”. 1. What is a threaded binary tree traversal? a) a binary tree traversal using stacks b) a binary tree traversal using queues c) a binary tree traversal using stacks and queues d) a binary tree traversal without using stacks … Read more

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Treap”. 1. What is the space complexity of a treap algorithm? a) O(N) b) O(log N) c) O(log N) d) O(N2) 2. A treap is a combination of a tree and a heap. a) false b) true 3. Which is … Read more

This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Splay Tree”. 1. What are splay trees? a) self adjusting binary search trees b) self adjusting binary trees c) a tree with strings d) a tree with probability distributions 2. Which of the following property of splay tree is correct? a) it … Read more

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Top Tree”. 1. Which algorithm is used in the top tree data structure? a) Divide and Conquer b) Greedy c) Backtracking d) Branch 2. For how many vertices in a set, is top tree defined for underlying tree? a) 3 … Read more

This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Red Black Tree”. 1. What is the special property of red-black trees and what root should always be? a) a color which is either red or black and root should always be black color only b) height of the tree c) pointer … Read more

This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Weight Balanced Tree”. 1. What is a weight balanced tree? a) A binary tree that stores the sizes of subtrees in nodes b) A binary tree with an additional attribute of weight c) A height balanced binary tree d) A normal binary … Read more

This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Cartesian Tree”. 1. What is a Cartesian tree? a) a skip list in the form of tree b) a tree which obeys cartesian product c) a tree which obeys heap property and whose inorder traversal yields the given sequence d) a tree … Read more

This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “AVL Tree”. 1. What is an AVL tree? a) a tree which is balanced and is a height balanced tree b) a tree which is unbalanced and is a height balanced tree c) a tree with three children d) a tree with … Read more

advertisement

Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He is Linux Kernel Developer & SAN Architect and is passionate about competency developments in these areas. He lives in Bangalore and delivers focused training sessions to IT professionals in Linux Kernel, Linux Debugging, Linux Device Drivers, Linux Networking, Linux Storage, Advanced C Programming, SAN Storage Technologies, SCSI Internals & Storage Protocols such as iSCSI & Fiber Channel. Stay connected with him @
LinkedIn | Youtube | Instagram | Facebook | Twitter