# Rope Multiple choice Questions and Answers (MCQs)

## Rope Multiple choice Questions and Answers (MCQs)

 Question 1
Which of the following is also known as Rope data structure?
 A Cord B String C Array D Linked List
Question 1 Explanation:
Array is a linear data structure. Strings are a collection and sequence of codes, alphabets or characters. Linked List is a linear data structure having a node containing data input and the address of the next node. The cord is also known as the rope data structure.

 Question 2
Which type of data structure does rope represent?
 A Array B Linked List C Queue D Binary Tree
Question 2 Explanation:
Rope is a special binary tree in which the end nodes contain the string and its length. The array is a linear data structure. Linked List is a linear data structure having a node containing data input and the address of the next node. The queue is a data structure working on the principle of FIFO.

 Question 3
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)
Question 3 Explanation:
In order to find the node at x position in a rope data structure where N is the length of the rope, we start a recursive search from the root node. So the time complexity for worst case is found to be O (log N).

 Question 4
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)