wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

Linked List

Total questions: 18

Worksheet time: 9mins

Name
Class
Date
1.

A linear dynamic data structure to store data items is called

a)

Linked list

b)

Stack

c)

Tree

d)

Queue

2.

Linked list elements are at contiguous location

a)

No

b)

Yes

3.

There are several types of linked list

a)

All of the above

b)

Singly

c)

Doubly

d)

Circular

4.

Singly linked list has ... parts

a)

2

b)

3

c)

1

d)

More than 3

5.

Linked list has the form like

a)

Chain

b)

Wagons

c)

Bracelet

d)

Necklace

6.

An item in linked list is called

a)

Node

b)

Head

c)

Tail

d)

Pointer

7.

The first and last node is called

a)

Head and tail

b)

Head and leg

c)

Eye and tail

d)

Eye and leg

8.

Node contains two things

a)

Data and pointer

b)

Direction and pointer

c)

Reference and pointer

d)

Direction and address

9.

The difference between arrays and linked list

a)

All of the above

b)

Linked list does not store data in contiguous memory locations

c)

Linked list does not have a size limit

d)

Linked list does not waste memory space

10.

How to insert a new node in the beginning of the linked list

a)

Head -> new node, new node -> previous node

b)

Previous node -> new node, new node -> next node

c)

Previous tail -> new node, new node -> null

d)

Head ->  previous node, previous node -> new node

11.

Which one is the advantage of linked list:

-          Linked list random access is not allowed

-          Linked lists need more memory

-          Linked lists have dynamic size

a)

3

b)

1

c)

2 and 3

d)

1, 2, and 3

12.

Which one is the disadvantage of linked list:

-          Linked lists have dynamic size

-          Linked lists cannot randomly access

-          Linked lists are linked with pointer

a)

2

b)

1

c)

1 and 3

d)

1, 2, and 3

13.

One of linked list part has a function to

a)

Send data

b)

Store data

c)

Keep data

d)

Duplicate data

14.

From the presentation before, after we allocate the node, what we have to do after it?

a)

Assign the value and the pointer for each nodes

b)

Create a function

15.

Which one of these pictures is the insertion in the middle of linked list

a)
b)
c)
d)
16.

Which are the correct statements?

- Linked List insertion of new element is expensive

- Linked list random access is not possible

- Linked List need extra memory space for next pointer

a)

1 and 2

b)

1 and 3

c)

2 and 3

d)

1

17.

Which is the node structure for linked list in c++?

a)
b)
c)
d)
18.

Who is your data structure lecturer?

a)

Miss Nurul

b)

Sir Tri

c)

Sir Jude

d)

Sir Bagus