1/21/25, 1:50 PM Assignment-1

Assignment-1
Topic: Linked List

* Indicates required question

1. Email *

2. A linked list is a * 1 point

Mark only one oval.

Random access structure

Sequential access structure

Both

None of these

3. An array is a * 1 point

Mark only one oval.

Random access structure

Sequential access structure

Both

None of these

https://docs.google.com/forms/d/1D10B7CFDeQ7qbs9r4SYzxCKwKPnqq7MgGZfUVMwTrXk/edit 1/10
1/21/25, 1:50 PM Assignment-1

4. If a linked list starts with node HEADER and a new node has to be inserted, 1 point

then OVERFLOW condition occurs if

Mark only one oval.

HEADER=NULL

AVAIL=NULL

Both of above

None of above

5. The algorithm given here is to 1 point

Mark only one oval.

Delete an item from list

Traverse the list

Print the value of each node

Traverse upto last node of list

6. A linear collection of data elements where the linear node is given by means 1 point
of pointer is called, and the insertion and deletion can perform at any
location?

Mark only one oval.

Stack

Queue

Linked list

All of above

https://docs.google.com/forms/d/1D10B7CFDeQ7qbs9r4SYzxCKwKPnqq7MgGZfUVMwTrXk/edit 2/10
1/21/25, 1:50 PM Assignment-1

7. Consider the STRUCTURE NODE declared in C programing language as 1 point

Mark only one oval.

PTR=(NODE*)malloc(sizeof(NODE))

PTR=(struct NODE*)malloc(sizeof(struct NODE))

PTR=(struct NODE)malloc(sizeof(struct NODE))

None of the above

8. Linked list is used to implement data structures like * 1 point

Mark only one oval.

Stacks

Queues

Trees

All of these

9. Which type of linked list contains a pointer to the next as well as the * 1 point
previous node in the sequence?

Mark only one oval.

Singly linked list

Circular linked list

Doubly linked list

All of these

https://docs.google.com/forms/d/1D10B7CFDeQ7qbs9r4SYzxCKwKPnqq7MgGZfUVMwTrXk/edit 3/10
1/21/25, 1:50 PM Assignment-1

10. Which type of linked list does not store NULL in next field? * 1 point

Mark only one oval.

Singly linked list

Circular linked list

Doubly linked list

All of these

11. Which type of linked list stores the address of the header node in the next * 1 point
field of the last node?

Mark only one oval.

Singly linked list

Circular linked list

Doubly linked list

Circular header linked list

12. Which type of linked list can have four pointer per node * 1 point

Mark only one oval.

Circular doubly linked list

Multi-linked list

Header linked list

Doubly linked list

13. A linked list is a linear collection of data elements. * 1 point

Mark only one oval.

True

False

https://docs.google.com/forms/d/1D10B7CFDeQ7qbs9r4SYzxCKwKPnqq7MgGZfUVMwTrXk/edit 4/10
1/21/25, 1:50 PM Assignment-1

14. A linked list can grow and shrink during run time * 1 point

Mark only one oval.

True

False

15. Consider the following code snippet. What will be the data type of r. 1 point

Mark only one oval.

int *r

int **r

int ***r

None of above

16. A node in a singly linked list can reference the previous node * 1 point

Mark only one oval.

True

False

17. A linked list can store only integer values * 1 point

Mark only one oval.

True

False

https://docs.google.com/forms/d/1D10B7CFDeQ7qbs9r4SYzxCKwKPnqq7MgGZfUVMwTrXk/edit 5/10
1/21/25, 1:50 PM Assignment-1

18. Deleting a node from a doubly linked list is easier than deleting it from a * 1 point
singly linked list

Mark only one oval.

True

False

19. Every node in a linked list contains an integer part and a pointer * 1 point

Mark only one oval.

True

False

20. START stores the address of the first node in the list * 1 point

Mark only one oval.

True

False

21. Underflow is a condition that occurs when we try to delete a node from a * 1 point

linked list that is empty

Mark only one oval.

True

False

https://docs.google.com/forms/d/1D10B7CFDeQ7qbs9r4SYzxCKwKPnqq7MgGZfUVMwTrXk/edit 6/10
1/21/25, 1:50 PM Assignment-1

22. The following questions use a linked list consisting of nodes as defined in 1 point
attached code snippet. Variable Node *head; holds the header of the list.
Compute FindSpecialChar(str) for str = "linked".

Mark only one oval.

None of above

https://docs.google.com/forms/d/1D10B7CFDeQ7qbs9r4SYzxCKwKPnqq7MgGZfUVMwTrXk/edit 7/10
1/21/25, 1:50 PM Assignment-1

23. What will be the output of the following code snippet for the list 1->2->3->4- 1 point

>5->6?

Mark only one oval.

123456

135531

135135

246135

24. Insertion of an element at the middle of a single linked list requires 1 point

modification of how many pointers?

Mark only one oval.

https://docs.google.com/forms/d/1D10B7CFDeQ7qbs9r4SYzxCKwKPnqq7MgGZfUVMwTrXk/edit 8/10
1/21/25, 1:50 PM Assignment-1

25. What will be the value of SUM after the following code snippet terminates for 1 point

the List 1->2->3->4->5

Mark only one oval.

20

15

26. A linked list in which none of the nodes contains a NULL pointer is 1 point

Mark only one oval.

Single Linked List

Doubly Linked List

Circular Linked List

None of the above

This content is neither created nor endorsed by Google.

Forms
https://docs.google.com/forms/d/1D10B7CFDeQ7qbs9r4SYzxCKwKPnqq7MgGZfUVMwTrXk/edit 9/10
1/21/25, 1:50 PM Assignment-1

https://docs.google.com/forms/d/1D10B7CFDeQ7qbs9r4SYzxCKwKPnqq7MgGZfUVMwTrXk/edit 10/10