Day 1 - Data Structures and Algorithms

What is a data structure?

• A data structure is a programming language.

• A data structure is a method for writing code.

• A data structure is a specialized format for organizing, processing, and storing data.

• A data structure is a type of computer program.

Explain the difference between a tuple and a list.

• A tuple can be changed after creation, while a list cannot.

• Both tuples and lists are mutable data types.

• A tuple is a type of list that can hold only integers.

• A tuple is immutable, while a list is mutable.

How do you access elements in an array using indexing?

• Use arrayName[index] to access elements.

• Elements can be accessed using arrayName.at(index).

• Access elements with arrayName.get(index).

• Use array[index] to retrieve values.

What is the time complexity of accessing an element in a list?

• O(log n)

• O(n^2)

• O(n)

• O(1)

Define big-O notation and its significance in algorithms.

• Big-O notation is used to describe the lower bound of an algorithm's complexity.

• Big-O notation measures the exact runtime of an algorithm.

• Big-O notation describes the upper bound of an algorithm's complexity, indicating its efficiency and allowing for performance comparison.

• Big-O notation is irrelevant for comparing algorithm performance.

What is the result of slicing a list from index 1 to 3?

• Elements from index 1 to 4 of the list.

• Elements from index 0 to 2 of the list.

• Elements from index 1 to 3 (exclusive) of the list.

• Elements from index 2 to 3 of the list.

How do you insert an element into a tuple?

• Add the element directly to the tuple using indexing.

• Convert the tuple to a list, insert the element, and convert it back to a tuple.

• Replace the entire tuple with a new one containing the element.

• Use the append method on the tuple.

What is the space complexity of an array?

• O(n^2)

• O(n)

• O(log n)

• O(1)

Describe the process of deleting an element from a list.

• Identify the index of the element, then use a method to remove it.

• Sort the list in ascending order.

• Remove the first element only.

• Add the element to the end of the list.

What is the time complexity of inserting an element at the beginning of a list?

• O(n)

• O(1)

• O(log n)

• O(n^2)