Arrays and Linked Lists - Exam Prep for Competitive Exams

Arrays and Linked Lists - Complexity Analysis - Numerical Applications

Q. In a singly linked list, what is the time complexity of inserting a new node at the beginning?

Solution

Inserting a new node at the beginning of a singly linked list is done in constant time, O(1).

Correct Answer: A — O(1)

Q. What is the average time complexity of searching for an element in a sorted array using binary search?

Solution

Binary search divides the array in half each time, leading to a time complexity of O(log n) for searching.

Correct Answer: B — O(log n)

Q. What is the time complexity of traversing a linked list with 'n' nodes?

Solution

Traversing a linked list requires visiting each node, leading to a time complexity of O(n).

Correct Answer: B — O(n)

Q. Which of the following is a characteristic of a stack?

Solution

A stack operates on a Last In, First Out (LIFO) principle, meaning the last element added is the first one to be removed.

Correct Answer: B — LIFO

Showing 1 to 4 of 4 (1 Pages)