PrelimExam-DSA-FCPC

What is the time complexity of accessing an element in a Python list by index?

• O(1)

• O(n)

• O(log n)

• O(n²)

What is the average time complexity of searching for an element in an unsorted linked list?

• O(1)

• O(n)

• O(log n)

• O(n log n)

The time complexity of appending an element to a Python list (average case) is:

• O(1)

• O(n)

• O(log n)

• O(n²)

Which operation on a singly linked list requires O(n) time?

• Traversal

• Access by index

• Searching

• All of the above

Which of the following is the best case time complexity of inserting at the head of a linked list?

• O(n)

• O(log n)

• O(1)

• O(n²)

What is the space complexity of storing a string of length n in Python?

• O(1)

• O(n)

• O(n²)

• O(log n)

Which operation in Python strings has O(n) complexity?

• Indexing

• Concatenation

• Slicing

• Both b and c

What is the worst-case time complexity of deleting a node from the middle of a singly linked list?

• O(1)

• O(n)

• O(log n)

• O(n²)

In a singly linked list, each node contains:

• Only data

• Data and pointer to next node

• Data and pointer to previous node

• Both b and c

What is the average-case time complexity of searching an element in a Python list?

• O(1)

• O(n)

• O(log n)

• O(n²)