GkSeries.com

Linked Lists - Objective type questions and answers on C programming

Download PDF

Linked lists objective and answers are available to download in PDF for free.
Go To Download Page
(6) To make a queue empty, elements can be deleted, till
[A] Front=rear+1
[B] Front=rear-1
[C] Front=rear
[D] None of the above

Comment

Answer: Option [C]
(7) In which data structure direct or random access not possible?
[A] Array
[B] string
[C] set
[D] linked list

Comment

Answer: Option [D]

DOWNLOAD CURRENT AFFAIRS PDF FROM APP

(8) A pointer in which a pointer variable contains the address of a variable that has already been allocated:
[A] Null pointer
[B] Generaic pointer
[C] Dangling pointer
[D] Wild pointer

Comment

Answer: Option [C]
(9) In a doubly linked list traversing comes to a halt at:
[A] null
[B] front
[C] rear
[D] rear-1

Comment

Answer: Option [A]
(10) Deletion of a node in linked list involves keeping track of address of node which comes immediately
[A] after the node that is to be deleted
[B] before the node that is to be deleted
[C] afetr the middle node
[D] None of the above

Comment

Answer: Option [A]

Please share this page

Chapters

Click Here to Read more questions

Teacher Eligibility Test