1- Moving from one node to another by following a next reference is known as Sel
ID: 3668365 • Letter: 1
Question
1- Moving from one node to another by following a next reference is known as
Select one:
a. templated node class
b. pointer hopping
c. insertion to the front of a linked list
d. generic singly linked list
2- The linked list constructor creates an empty list by
Select one:
a. setting the next pointer to NULL
b. setting head to point to the next node
c. setting the head pointer to NULL
d. allocating space for a new node
3- Each STL container class provides two member functions that return an iterator for that container. These functions are:
Select one:
a. insert and erase
b. reverse and find
c. new and delete
d. begin and end
Explanation / Answer
1.
d)generic singly linked list
explanation:A singly list is composed of various node,where each node has a data field and a next field,which serves as a pointer for the next node or in simple words,it contains address of the next node.In this fashion,chain of nodes are formed,based on requirement of user.Here we need the address to the next node because,the data is not stored in a continious fashion
2.
a)Setting the next pointer to NULL
explanation:When next pointer ,does not point to any other address or if it points to null,that means list is empty
3.
d)begin an end
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.