How can you achieve multiple inheritance in Python?
- By using interfaces.
- By using mixins and multiple inheritance.
- By using the extends keyword.
- Python does not support multiple inheritance.
In Python, you can achieve multiple inheritance by using mixins. Mixins are classes that provide specific behaviors and can be combined in a class to inherit those behaviors. Python supports multiple inheritance through this mechanism.
How can you achieve inheritance in Python?
- By creating a subclass that inherits from a superclass
- By defining a superclass variable
- By importing a superclass module
- Using the extends keyword
In Python, you achieve inheritance by creating a subclass that inherits from a superclass using the syntax class Subclass(Superclass):. The extends keyword is not used for inheritance in Python.
How can you access the sqrt function from the math module?
- math.sqrt(x)
- math::sqrt(x)
- math->sqrt(x)
- sqrt(x)
To access the sqrt function from the math module, you should use the dot notation like math.sqrt(x). This allows you to access functions or properties within a module in JavaScript.
A decorator in Python is a design pattern used to add new functionality to an object without altering its ____.
- attributes
- class
- methods
- structure
In Python, decorators are typically used to add new functionality to methods of a class without changing the method's name or signature. This is commonly used for tasks like logging, authorization, and caching.
A ____ tree is a tree in which each node has at most two children, which are referred to as the left child and the right child.
- Binary
- Octal
- Quad
- Ternary
A Binary Tree is a tree data structure where each node has at most two children, a left child and a right child. This data structure is commonly used in computer science and is fundamental to many algorithms and data structures.
A ____ sort is a highly efficient sorting algorithm based on partitioning of an array of data into smaller arrays.
- Bubble
- Merge
- Quick
- Selection
A Merge sort is a highly efficient sorting algorithm that uses a divide-and-conquer approach to sort an array. It repeatedly divides the array into smaller sub-arrays until each sub-array is sorted, then merges them back together to achieve the final sorted order.
A ____ loop is used to iterate a block of code a specified number of times.
- do-while
- for
- repeat
- while
In Python, a for loop is commonly used to iterate over a sequence (such as a list) a specified number of times. The for loop iterates over the elements of the sequence, executing the block of code for each element.
A ____ is a type of binary tree where the tree automatically balances itself as items are inserted or removed.
- AVL Tree
- B-Tree
- Heap
- Red-Black Tree
A Red-Black Tree is a type of binary search tree that automatically balances itself during insertions and deletions to ensure the tree remains approximately balanced. This property ensures efficient search and insertion operations.
A ____ is a special type of binary tree where each node has a higher (or equal) value than its children.
- AVL Tree
- Binary Search Tree (BST)
- B-Tree
- Red-Black Tree
A Binary Search Tree (BST) is a special type of binary tree where each node has a higher (or equal) value than its children. This property allows for efficient searching, insertion, and deletion of elements.
A ____ is a linear data structure where the elements are arranged in a circular fashion.
- Linked List
- Queue
- Ring Buffer
- Stack
A "Ring Buffer" (or Circular Buffer) is a linear data structure where elements are stored in a circular manner. It has fixed-size storage and efficiently manages data by overwriting old data when full.
A ____ is a data structure that stores elements in a linear sequence but allows additions and removals only at the start.
- Array
- Linked List
- Queue
- Stack
A Stack is a data structure that follows the Last-In-First-Out (LIFO) principle, meaning the last element added is the first to be removed. It allows additions and removals at the start, making it suitable for managing function calls, undo functionality, and more.
A ____ in Python is a collection of key-value pairs, where the keys must be immutable.
- Dictionary
- List
- Set
- Tuple
In Python, a dictionary is a collection of key-value pairs, where the keys must be immutable (and usually unique). Tuples are immutable, making them suitable for use as dictionary keys.