1.4.2 Data Structures

What is the primary difference between a list and a tuple in Python?

• Lists are immutable, while tuples are mutable.

• Lists are mutable, while tuples are immutable.

• Lists can only store integers, while tuples can store any data type.

• Lists are faster to access than tuples.

Which data structure is best suited for implementing a LIFO (Last In, First Out) system?

• Queue

• Stack

• Linked-list

• Graph

In a binary search tree, what is the time complexity of searching for an element in the average case?

Which of the following data structures can be used to implement a priority queue?

• Stack

• Hash table

• Binary heap

• Linked-list

What is the main advantage of using a hash table over a linked-list?

• Hash tables are easier to implement.

• Hash tables have faster average time complexity for search operations.

• Linked-lists use less memory.

• Linked-lists are faster for insertion operations.

Which of the following is a characteristic of a directed graph?

• All edges have weights.

• Edges have a direction from one vertex to another.

• All vertices are connected.

• It contains no cycles.

How do you traverse a binary tree in pre-order?

• Visit the left subtree, then the root, then the right subtree.

• Visit the root, then the left subtree, then the right subtree.

• Visit the right subtree, then the root, then the left subtree.

• Visit the left subtree, then the right subtree, then the root.

What is the time complexity of adding an element to the end of a dynamic array (e.g., Python list) in the average case?

Which of the following operations is not typically supported by a queue?

• Enqueue

• Dequeue

• Peek

• Random access

In a linked-list, what is the time complexity of inserting an element at the beginning?