Mastering Python Data Structures and Algorithms

What are the main types of data structures in Python?

• Arrays, Strings, Floats, Booleans

• Files, Modules, Classes, Functions

• Lists, Tuples, Sets, Dictionaries

• Graphs, Trees, Queues, Stacks

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

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

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

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

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

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

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

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

• A dictionary in Python is a built-in function that converts strings to integers.

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

Describe the characteristics of a stack data structure.

• A stack is a LIFO data structure that supports push, pop, and peek operations.

• A stack is a data structure that allows random access to its elements.

• A stack can only store integer values and does not support any operations.

• A stack is a FIFO data structure that supports enqueue and dequeue operations.

What is a queue and how does it differ from a stack?

• A queue is a LIFO data structure, while a stack is a FIFO data structure.

• A queue is a FIFO data structure, while a stack is a LIFO data structure.

• A queue allows random access, while a stack does not.

• A queue is a data structure that only allows insertion at the front.

List and explain the common sorting algorithms in Python.

• Shell Sort

• Heap Sort

• Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, Timsort

• Radix Sort

What is the time complexity of bubble sort?

• O(n^2)

• O(n log n)

• O(log n)

• O(n)

How does quicksort work and what is its average time complexity?

• O(log n)

• O(n log n)

• O(n^2)

• O(n)

What is the difference between linear search and binary search?

• Linear search is O(n) and works on unsorted lists; binary search is O(log n) and requires sorted lists.

• Linear search is faster than binary search for large datasets.

• Linear search requires a sorted list to function properly.

• Binary search can be used on unsorted lists without any preprocessing.

Explain the concept of recursion in programming.

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

• Recursion is a method of storing data in a database.

• Recursion is when a function is executed multiple times without any conditions.

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