._____________ 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. Data Structure

  • Queue
  • Stack
  • Singly Linked List
  • Circular queue
Answer: Singly Linked List
931 students attemted this question.


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

  3. State true of false.i) A node is a parent if it has successor nodes.ii) A node is child node if out degree is one.

  4. _______________ is the data structure that has collection of nodes two fields named data and link.

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

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

  7. Which of the following data structure is not a linear data structure

  8. Can We implement Queue data structure using stack data structure

  9. Linked list data structure offers considerable saving in _____________

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

  11. This structure uses a pointer to link nodes.

  12. If node N is a terminal node in a binary tree then its ________

  13. Statement 1: When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node.Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree.

  14. What kind of Data structure would you expect to find utilised to store operations in a CPU?

  15. A Kind of tree where every node in a tree can have at most two children.

  16. The decision tree structure begins at a node called the _____.

  17. _____________ specifies how we enter data into our programs and what type of data we enter.

  18. Which data structure allows deleting data elements from front and inserting from rear?

  19. Data structure= Organized data +________________

  20. In ____________ data structure, the data items are arranged in a linear sequence.


Add Your Review

Your email address will not be published.

Subscribe to Newsletter!

Subscribe to get latest updates and information.