DSA_Unit1

What is an array in data structures?

• A collection of elements stored at contiguous memory locations

• A collection of key-value pairs

• A type of linked list

• A hierarchical data structure

What is the time complexity of accessing an element in an array using an index?

• O(n)

• O(1)

• O(log n)

• O(n log n)

What is the best-case time complexity of the linear search algorithm?

• O(n)

• O(1)

• O(log n)

• O(n log n)

In an ordered list, the elements are arranged based on:

• Their insertion order

• A predefined sorting order

• The time of modification

• The length of the list

What is the primary advantage of a linked list over an array?

• Faster access time

• More efficient memory allocation

• Constant time search operation

• Easier sorting algorithms

A circular linked list is different from a singly linked list because:

• It does not store data

• It has no end node (last node points to the first node)

• It has two pointers for each node

• It allows insertion at only one end

What is the space complexity of a stack with 'n' elements?

• O(1)

• O(n)

• O(log n)

• O(n²)

The time complexity of inserting an element at the beginning of a singly linked list is:

• O(1)

• O(n)

• O(log n)

• O(n log n)

How many pointers does a node in a circular doubly linked list contain?

• 1

• 2

• 3

• 4

What is the main disadvantage of linked lists over arrays?

• More memory usage due to pointers

• Fixed size

• Poor insertion performance

• No dynamic allocation