1.4.(c) Data Structures (video)

What is the time complexity for reading elements in an array?

• O(1)

• O(n)

• O(log n)

• O(n^2)

Which data structure is described as LIFO?

What is the major advantage of using hash maps?

• Ordered storage

• Quick searching

• Sequential access

• Fixed size

In a binary search tree, where are the smaller child nodes located relative to their parent node?

• Left

• Right

• Top

• Bottom

What is the primary disadvantage of linked lists compared to arrays?

• More memory usage

• Fixed size

• Slower at insertion

• Slower at reading

Which operation is fast in queues?

• Dequeue

• Push

• Pop

• Peek

What type of data structure is primarily used for representing a set of connections?

• Graphs

• Trees

• Arrays

• Stacks

What does FIFO stand for in the context of queues?

• First In, First Out

• First In, Last Out

• Last In, Last Out

• Last In, First Out

Which data structure would you use to efficiently find the capital city of a country?

• Linked List

• Queue

• Array

• Hash Map

What is the time complexity for inserting or deleting elements in a hash map?

• O(1)

• O(n^2)

• O(n)

• O(log n)