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

  • pointer
  • pointers
  • POINTER
  • POINTERS
  • Pointer
581 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. A variant of linked list in which last node of the list points to the first node of the list is?

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

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

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

  7. 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?

  8. ._____________ is a data structure in which every individual node consists of INFO to store data and LINK to store the address of the next node.

  9. The disadvantage in using a circular linked list is __________

  10. Linked list data structure offers considerable saving in _____________

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

  12. A hash table can store a maximum of 10 records, currently there are records in location 1, 3,4,7,8,9,10. The probability of a new record going into location 2, with hash functions resolving collisions by linear probing is

  13. A _______________ is a linear data structure, in which elements are not stored at contiguous memory locations.

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

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

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

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

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

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

  20. Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing? Note that ‘_’ denotes an empty location in the table.

Comments

Add Your Review

Your email address will not be published.

Subscribe to Newsletter!

Subscribe to get latest updates and information.