The disadvantage in using a circular linked list is __________ Data Structure

  • it is possible to get into infinite loop
  • last node points to fist node.
  • time consuming
  • requires more memory space.
Answer: it is possible to get into infinite loop
1106 students attemted this question.

Explanation

No Explanation Available.

Share this question with friends

Similar Questions

  1. Two lists, A and B are implemented as singly linked link-lists. The address of the first and last node are stored in variables firstA and lastA for list A and firstB and lastB for list B. Given the address of a node is given in the variable node, the element stored in the node can be accessed by the statement node->data and the address to the next node can be accessed by node->next. Pankaj wants to append list B at end of list A. Which of the following statements should he use?

  2. Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?

  3. In linked list, the elements are using _________ to linked the data item to the next address in memory location.

  4. A variant of linked list in which last node of the list points to the first node of the list is?

  5. In circular linked list, insertion of node requires modification of?

  6. Surbhi wants to implement a particular data structure using a static array. She uses the concept of circular list to implement the data structure, because this allows her to efficiently use all fields of the array. Which data structure is Surbhi implementing?

  7. What does the following function do for a given Linked List with first node as head?

  8. Linked list data structure offers considerable saving in _____________

  9. In linked list each node is divided into ___________parts?

  10. Give syntax to create a node for Single linked list?

  11. How to insert a node after a position P in singly linked list?

  12. What advantage does a linked list have over an array?

  13. Which of the following points is/are true about Linked List data structure when it is compared with array

  14. In linked list each node contain minimum of two fields. One field is data field to store the data second field is?

  15. What kind of linked list is best to answer question like “What is the item at position n?”

  16. Linked list is considered as an example of ___________ type of memory allocation.

  17. While implementing Stack using list when we want to delete element we must use pop function as__________

  18. While implementing Queue using list when we want to delete element we must use pop function as__________

  19. In ___________ type of linked lists we can traverse in both the directions.

  20. Linked lists are not suitable to for the implementation of?

Comments

Add Your Review

Your email address will not be published.

Subscribe to Newsletter!

Subscribe to get latest updates and information.