wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

Linked List

Total questions: 15

Worksheet time: 8mins

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.

struct node *current = start->next

what will "current" contain if it is a pointer to a variable of type struct node ?

a)

Address of 2nd Node

b)

Data Field of 2nd Node

c)

Address of 1st Node

d)

None of these

9.

What is the operation of the below statements?

a)

Insert a new node to the front of a linked list

b)

Create a new node for a linked list

c)

Insert a new node to the end of the linked list

d)

Calculate the size of a linked list

10.

What is the operation of the below statements?

a)

Create a new node for a linked list

b)

Insert a new node to the front of a linked list

c)

Delete a new node from a linked list

d)

Insert a new node to the end of the linked list

11.

Which the following circular linked list

a)
b)
c)
12.

How to delete node B?

a)

head->next=TempPtr; free(TemPtr);

b)

free(TemPtr); head->next=TempPtr->next;

c)

head->next=TempPtr->next;free(TemPtr)r;

d)

free(head); head->next= TempPtr->next

13.

The doubly linked list would have how many fields in a node?

a)

1

b)

2

c)

3

d)

4

14.

How many times should


“temp =temp->next” be executed in the image to get the value of "Null" when the initial value of temp is temp=head

a)

1

b)

2

c)

3

d)

4

15.

How many null pointers exists in a circular linked list?

a)

0

b)

1

c)

2

d)

3