COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
To implement file systems
|
|
|
For separate chaining in hash-tables
|
|
|
To implement non-binary trees
|
|
|
Random Access of elements
|
Detailed explanation-1: -Which of these is not an application of a linked list? Explanation: To implement file system, for separate chaining in hash-tables and to implement non-binary trees linked lists are used. Elements are accessed sequentially in linked list. Random access of elements is not an applications of linked list.
Detailed explanation-2: -Implementation of graphs: Adjacency list representation of graphs is the most popular which uses a linked list to store adjacent vertices. Dynamic memory allocation: We use a linked list of free blocks. Maintaining a directory of names. Performing arithmetic operations on long integers.
Detailed explanation-3: -Sequential Access: Because a linked list is not contiguous, it does not support random access. In order to access a particular node within the linked list, the entire linked list must be traversed until the node is found.