Linked Lists

Which of this not about linked list ?

• A nonlinear collection of data elements

• It can be used to implement several other common abstract data types example stack, queue, tree

• It use more memory than arrays because of the storage used by their pointers.

• Each record of a linked list is often called an 'element' or 'node'

Which the following circular linked list

• 
• 
• 

What advantage does a linked list have over an array?

• A linked list can give you the data faster

• It is easier to use

• A linked list is not of a fixed size

• It's better

Nodes in a linked list contain two things

• Direction and a pointer

• Data and a pointer

• A Pointer and a reference

• A pointer and a node

The situation when in a linked list START=NULL is

• underflow

• overflow

• list full

• saturated

A linked list contains a list pointer variable _____that stores the address of the first node of the list.

• Head

• NULL

• NEXT

• LAST

How many fields does the node of a singly linked list has?

• 1

• 2

• 3

• 4

How many null pointers exists in a circular linked list?

• 0

• 1

• 2

• 3

Linked list is generally considered as an example of _________ type of memory allocation.

• static

• compile time

• dynamic

• none of these

The last node of the singly-linked list contains__________.

• INFO

• NULL

• NEXT

• None of the above