Online GK Series

This site is dedicated to the aspirants of competitive exams SSC, UPSC, Railways, Postal Assistants, Bank, GATE and NET

Connect with Universities & Study Abroad Instantly Search University

Linked Lists - Objective type questions and answers on C programming

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

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

Answer: Option [D]
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

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

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

Answer: Option [A]


Useful Computer Science EBooks