Arrays and Linked Lists - C++ Implementations for Exams

Arrays and Linked Lists - Implementations in C++

Q. What is the average time complexity for inserting an element at the beginning of a linked list?

Solution

Inserting an element at the beginning of a linked list is done in constant time, O(1).

Correct Answer: A — O(1)

Q. Which data structure allows for LIFO (Last In First Out) access?

Solution

A stack is a data structure that follows the LIFO principle, where the last element added is the first to be removed.

Correct Answer: C — Stack

Q. Which sorting algorithm has the best average time complexity?

Solution

Quick Sort has the best average time complexity of O(n log n), making it more efficient than the other options listed.

Correct Answer: C — Quick Sort

Showing 1 to 3 of 3 (1 Pages)