Mastering Python Data Structures and Algorithms

What are the main types of data structures in Python?

• Files, Modules, Classes, Functions

• Lists, Tuples, Sets, Dictionaries

• Graphs, Trees, Queues, Stacks

• Arrays, Strings, Floats, Booleans

Explain the difference between a list and a tuple in Python.

• A list is mutable and defined with [], while a tuple is immutable and defined with ().

• A list can contain only integers, while a tuple can contain any data type.

• Both lists and tuples are mutable and defined with [].

• A list is immutable and defined with [], while a tuple is mutable and defined with ().

What is a dictionary in Python and how is it used?

• A dictionary in Python is a type of list that stores elements in a sequential order.

• A dictionary in Python is a single value that cannot be modified after creation.

• A dictionary in Python is a collection of key-value pairs used for storing and retrieving data efficiently.

• A dictionary in Python is a collection of unique values used for mathematical operations.

Describe the characteristics of a stack data structure.

• A stack is characterized by LIFO order, operations like push and pop, and can be implemented using arrays or linked lists.

• A stack can only be implemented using hash tables or trees.

• A stack allows random access to elements like an array.

• A stack is characterized by FIFO order and only allows peek operations.

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

• O(1)

• O(n)

• O(n^2)

• O(log n)

Name and explain two common sorting algorithms.

• Radix Sort and Shell Sort

• Insertion Sort and Merge Sort

• Bubble Sort and Quick Sort

• Heap Sort and Selection Sort

What is the difference between bubble sort and quicksort?

• Bubble sort is faster than quicksort.

• Bubble sort is less efficient (O(n^2)) compared to quicksort (O(n log n)).

• Quicksort is a stable sorting algorithm while bubble sort is not.

• Bubble sort can handle larger datasets more efficiently than quicksort.

How does merge sort work?

• Merge sort sorts an array by randomly shuffling its elements.

• Merge sort is a linear algorithm that processes elements one by one.

• Merge sort is a divide-and-conquer algorithm that sorts an array by recursively splitting it into halves and merging the sorted halves.

• Merge sort requires the entire array to be sorted before it can begin.

What is a binary search and when is it used?

• A binary search is used to find an element in a sorted array efficiently.

• A binary search is a method for searching in a linked list.

• A binary search can find the maximum element in an array.

• A binary search is used to sort an unsorted array.

Explain the concept of recursion with an example.

• Recursion is a technique used to optimize code by removing unnecessary functions.

• Recursion is when a function is executed multiple times without calling itself.

• Recursion is a method where a function runs in a loop until a condition is met.

• Recursion is a method where a function calls itself to solve smaller instances of the same problem.