QUIZ ON : C LANGUAGE - SELF REFERENTIAL STRUCTURES AND LINKED LISTS

SELF REFERENTIAL STRUCTURES AND LINKED LISTS

00:00:00

Tell whether the following tree is:

Option A. Heap
Option B. Full and Complete
Option C. Heap Complete
Option D. None of the above
True Answer B

Explanation :

Tell whether the following tree is:

Question No# : 01 out of 14


Maximum degree in any vector in a graph with n vertices is n-1.

Option A. TRUE
Option B. FALSE
Option C.
Option D.
True Answer A

Explanation :

Maximum degree in any vector in a graph with n vertices is n-1.

Question No# : 02 out of 14


Linked list must require continuous memory allocation unlike array.

Option A. TRUE
Option B. FALSE
Option C.
Option D.
True Answer B

Explanation :

Linked list must require continuous memory allocation unlike array.

Question No# : 03 out of 14


It is better to use array than a linked list, when there is a fixed size list in a program.

Option A. TRUE
Option B. FALSE
Option C.
Option D.
True Answer A

Explanation :

It is better to use array than a linked list, when there is a fixed size list in a program.

Question No# : 04 out of 14


The data structure that is needed to convert infix notation to prefix notation is graph.

Option A. TRUE
Option B. FALSE
Option C.
Option D.
True Answer B

Explanation :

The data structure that is needed to convert infix notation to prefix notation is graph.

Question No# : 05 out of 14


malloc() allocates memory from the heap and not from the stack.

Option A. TRUE
Option B. FALSE
Option C.
Option D.
True Answer B

Explanation :

malloc() allocates memory from the heap and not from the stack.

Question No# : 06 out of 14


Binary search can be easily performed on a linked list.

Option A. TRUE
Option B. FALSE
Option C.
Option D.
True Answer B

Explanation :

Binary search can be easily performed on a linked list.

Question No# : 07 out of 14


Forest is a set of N>=0 disjoint trees, which are obtained when root is removed.

Option A. TRUE
Option B. FALSE
Option C.
Option D.
True Answer B

Explanation :

Forest is a set of N>=0 disjoint trees, which are obtained when root is removed.

Question No# : 08 out of 14


A symmetric diagraph is a directed graph such that for every edge VW there is reverse edge WV.

Option A. TRUE
Option B. FALSE
Option C.
Option D.
True Answer A

Explanation :

A symmetric diagraph is a directed graph such that for every edge VW there is reverse edge WV.

Question No# : 09 out of 14


PERT graph is a graph used to perform PERT calculation.

Option A. TRUE
Option B. FALSE
Option C.
Option D.
True Answer B

Explanation :

PERT graph is a graph used to perform PERT calculation.

Question No# : 10 out of 14


Priority queue is a queue that is used to store priority data.

Option A. TRUE
Option B. FALSE
Option C.
Option D.
True Answer B

Explanation :

Priority queue is a queue that is used to store priority data.

Question No# : 11 out of 14


An example of hierarchical data structure is

Option A. array
Option B. link list
Option C. tree
Option D. all of the above
True Answer C

Explanation :

An example of hierarchical data structure is

Question No# : 12 out of 14


Singly-linked lists contain nodes which have a data field as well as a next field, which points to the next node in the linked list.

Option A. TRUE
Option B. FALSE
Option C.
Option D.
True Answer A

Explanation :

Singly-linked lists contain nodes which have a data field as well as a next field, which points to the next node in the linked list.

Question No# : 13 out of 14


Linked list must require continuous memory allocation unlike array.

Option A. TRUE
Option B. FALSE
Option C.
Option D.
True Answer B

Explanation :

Linked list must require continuous memory allocation unlike array.

Question No# : 14 out of 14