COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
it is possible to get into infinite loop
|
|
|
last node points to fist node.
|
|
|
time consuming
|
|
|
requires more memory space.
|
Detailed explanation-1: -The disadvantages in using a circular linked list are below: Circular lists are complex as compared to singly linked lists. Reverse of circular list is a complex as compared to singly or doubly lists. If not handled carefully, then the code may go in an infinite loop.
Detailed explanation-2: -Disadvantages of Circular Linked Lists: If the circular linked list is not handled properly then it can lead to an infinite loop as it is circular in nature. In comparison with singly-linked lists, doubly linked lists are more complex in nature. Direct accessing of elements is not possible.
Detailed explanation-3: -Explanation: In Circular Linked List, end node will points to first Node (doesn’t contain a NULL pointer)whereas in singly linked list it won’t point to first Node. Circular list is very useful in case of Game play, to give turns for each player without any failure (due to its circular connectivity).
Detailed explanation-4: -Which of the following is false about a circular linked list? Explanation: Time complexity of inserting a new node at the head of the list is O(n) because you have to traverse through the list to find the tail node. 10.