User-Defined DS

A linked list is a user-defined data structure

• True

• False

• Could be both

• What are the components of a node object?

• data and reference

• data and type

• doubly and singly

• list and elements

In a singly linked list, the nodes have pointer to the previous nodes.

• True

• False

Select the elements from the options that are considered Truthy:

• []

• '0.1'

• 'None'

• {}

• list()

Select the elements from the options that are considered Falsy:

• None

• 0

• 0.0

• 0.1

• 'None'

Nodes in a linked list are stored contiguously.

• True

• False

• Improbable

In creating a Node class, the obj.next is ____ by default.

• None

• obj.head

• 0

• Anne Curtis

What is the additional component that is added to a node on doubly linked lists?

• Interrnal Pointerr Varriable

• Index

• Next Reference

• Previous Reference

Why are insertion and deletion more efficient in linked lists compared to arrays?

• Because linked lists use less memory than arrays.

• Because linked lists store elements contiguously, making operations faster.

• Because linked lists always have a fixed size, reducing overhead.

• Because nodes are stored randomly, avoiding shifting.

Why is the time complexity for accessing an element in a linked list O(n)?

• Because linked lists store elements contiguously.

• Because linked lists use indexing like arrays.

• Because traversal is required to reach the element.

• Because linked lists have a fixed access time.