What are the disadvantages of sequential storage?
- 1 Answers
- 1361 Views
- I also Faced
- E-Mail Answers
Answer / Vivek Gosain
1. Insertion and deletion operations can be slow, especially if the data is stored at the end of the sequence as it requires shifting all subsequent elements. 2. Accessing an element at a specific index can also be slow because the entire sequence may need to be scanned.
| Is This Answer Correct ? | 0 Yes | 0 No |
How many types of lists are there?
How can you insert a node in a random location of the linked list?
What is difference between set and map?
What is difference between list and set?
What is mergesort and hashtable?
How do you make a bubble chart with 3 variables?
Write the steps involved in the insertion and deletion of an element in the stack.
What are the tasks performed during preorder traversal?
How can we reverse the order in the treemap?
What is difference between hashmap and arraylist?
How does a hashtable work?
Does arraylist maintain order?
Windows 
