Arrays and Linked Lists MCQ Test: Arrays and Linked Lists MCQs - Practice Questions
1. What is the time complexity of finding the shortest path between two nodes in a graph using Dijkstra's algorithm?
2. In a doubly linked list, how do you delete a node if you only have access to that node (not the previous one)?
3. What is the primary advantage of using a Patricia trie over a standard trie?
4. How do you insert an element at the end of an array?
5. What is the key advantage of using a dynamic array over a static array?
6. In an array, what is the term for the difference between the highest and lowest values?
7. In a linked list, what is the term for the process of removing the last element?
8. What is the time complexity of finding the length of an array?
9. How does a hash collision impact the performance of a hash table?
10. What is the primary disadvantage of using a trie compared to a hash table for storing strings?
11. What is the key advantage of using a doubly linked list over a singly linked list?
12. What is the purpose of a sentinel node in a linked list?
13. In the context of arrays, what is the term for the process of rearranging elements in a specific order?
14. In a circular linked list, how do you determine the end of the list?
15. What is the time complexity of inserting an element in the middle of an array?
16. In a linked list, what is the term for a node that points to another node in the same linked list?
17. Discuss the advantages and disadvantages of using an AVL tree over a red-black tree.
18. In a linked list, how do you insert a new element at the beginning?
19. In an array, what is the term for the process of removing duplicate elements?
20. What is the time complexity of searching for an element in an unsorted array?