wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Linked List

Total questions: 14

Worksheet time: 7mins

Name
Class
Date
1.

What advantage does a linked list have over an array?

a)

Size of the list doesn't need to be mentioned at the beginning of the program

b)

You can add or remove elements from the middle of the list.

c)

The linked list doesn't have a size limit

d)

All of these are true.

2.

Nodes in a linked list contain two things

a)

Direction and a pointer

b)

Data and a pointer

c)

A Pointer and a reference

d)

A pointer and a node

3.

The situation when in a linked list Head==NULL

is

a)

Full

b)

Empty

c)

Half full

d)

saturated

4.

In the above image what will be printed when Head->next->data?

a)

83

b)

9

c)

27

d)

Error

5.

Complete the code in the red column

a)

string info; int link;

b)

int info; NodeType link;

c)

int info; string link;

d)

int info; NodeType * link;

6.

Which of the following statement is not correct?

a)

List is a linear structure

b)

There are 2 example of list, Array List & Linked List.

c)

Array List is not an example of List

d)

List contains a sequence of elements

7.

What is value in the head -> next -> next below?

a)

12

b)

4600

c)

1600

d)

88

8.

Linked list is a collection of

a)

Nodes

b)

Arrays

c)

Address

d)

None

9.

Node consists of

a)

Address and Pointer

b)

Data

c)

Data and Address

d)

Pointer and Address

10.

Doubly Linked List Consists of

a)

1-Data , 1- Address

b)

2-Data , 1- Address

c)

1-Data , 0- Address

d)

1-Data , 2- Address

11.

Circular Linked List the Address part of last node holds the address of

a)

First Node

b)

Null

c)

Intermediate Node

d)

None of the Above

12.

Circular Linked List will be

a)

Only Singly

b)

Only Doubly

c)

Singly and Doubly

d)

None

13.

--------------------- is used to define a linked list in C Programming

a)

Arrays

b)

Structures

c)

Functions

d)

None

14.

Array Comes under

a)

Linear Data Structures

b)

Non - Linear Data Structures

c)

Primitive Data Structures

d)

None of the Above