Table of Contents
- 1 Which data structure is used for insertion and deletion?
- 2 Which data structure has only one and two insert and delete the item?
- 3 What data structure do text editors use?
- 4 Which data structure allows insertion at one end only but deletion at both ends?
- 5 What data structure would you use for random data access?
- 6 Which of the following data structure can be used to build a search engine?
Which data structure is used for insertion and deletion?
Stack is a linear data structure in which the insertion and deletion operations are performed at only one end. In a stack, adding and removing of elements are performed at single position which is known as “top”.
Which data structure has only one and two insert and delete the item?
In a circular queue, the last element is connected to the first element; the value of rear is 4 so when we increment the value then it will point to the 0th position of the array.
What data structure do text editors use?
The gap buffer data structure is commonly used by text editors for storing the files that are currently being edited. The data structure is simply an array that stores the contents of a file plus some extra empty space. This empty space is called the gap.
What data structure will you use if you have to do a lot of search insertion and deletion operations?
To store huge data donot use arrays where implementation is easy but insertion and deletion is very difficult. Hence use dynamic like linked list where insertion and deletion is easy. Implement your problem using linked list where the members of linked list are arrays of 100 characters size.
In which data structure the insertions can be done only at one end while deletions can be done from both the ends?
A queue is a linear data structure where insertions are done at one end and deletions are done at the other end.
Which data structure allows insertion at one end only but deletion at both ends?
Discussion Forum
| Que. | Identify the data structure which allows deletions at both ends of the list but insertion at only one end. |
|---|---|
| b. | Output restricted qequeue |
| c. | Priority queues |
| d. | Stack |
| Answer:Input restricted dequeue |
What data structure would you use for random data access?
An array is a random access data structure, where each element can be accessed directly and in constant time. A typical illustration of random access is a book – each page of the book can be open independently of others.
Which of the following data structure can be used to build a search engine?
The data structure generally used for this is a hash table, hashmap or inverted index. The inverted index data structure is efficient in keyword-based queries and makes information retrieval convenient, much like the index found at the end of most textbooks.