C949 Data Structures And Algorithms Questions and Answers(A+ Solution guide)

Record - Data structure that stores subitems, w/ names associated w/ each subitem Array - Data structure that stores an ordered list of items, w/ each item directly accessible by a positional index. Linked List - Data structure that stores an ordered list as nodes, each node stores data and has a pointer to the next node. Binary Tree - Data structure where each node stores data and has up to two children, left child and right child. Hash Table - Data structure that stores unordered items by mapping each item to a location in an array. Max Heap - Tree that maintains the simple property that a node's key is greater than or equal to a node's children key. Min Heap - A tree that maintains simple property that node's key is less than or equal to the node's children key. Graph - Represents connections among items. Consists of vertices and edges. Vertex represents an item on a graph. Edges represent a connection between two vertices. ADT (Abstract Data Type) -Data type described by predefined user operations. Does not say anything about the implementation. List - Common ADT for holding ordered data.Like an array. Can store ints, strings. Ex. nums = [5, 25, 30]Queue - ADT where items are inserted at the end and removed at the front. First in first out ADT. push - inserts items at the end pop - removes and returns the item at the front Dictionary - Maps keys to values. Uses {}. The value can be number,string, or tuple. Can be any type. ex. players = { 'Lionel Messi': 10, 'Christiano Ronaldo': 7 } If else statement - Branching directs programs to execute either one group of statements or another. ex. if expression: # Statements to execute when expression is true else: # Statements to execute when expression is false # Statements here execute after the if-else. Boolean Operators - Has 3 operators: and / or / not In Python, True/False are case sensitive Membership Operators - not , in Cannot check for values but can check for keys. ex. my_dict = {'A': 1, 'B': 2, 'C': 3}if 'B' in my_dict: print("Found 'B'") else: print("'B' not found") # operator does not check values if 3 in my_dict: print('Found 3') else: print('3 not found') reversed() - Iterates over a for loop backwards. ex. print('nPrinting in reverse:') for name in reversed(names): print(name, '|', end=' ') Function (invoking a function is called a function call, which causes a function to execute. ) - Named series of statements. e.g.: def compute_square(num_square): return num_square * num_square Polymorphism - Behavior of function depends on argument type. ex. 'x' * 5 = 'xxxxx' Global - Used to change value of a global variable inside of a . employee_name = 'N/A' def get_name(): global employee_name name = input('Enter employee name:') employee_name = name get_name() print('Employee name:', employee_name) instantiation - is performed by "calling" the class, using parentheses like a function call as in my_time = Time(). - creates an instance, which is an individual object of the given class. automatically calls the __init__ method defined in the class definition. - A method is a function defined within a class. T - __init__ method, commonly known as a constructor, is responsible for setting up the initial state of the new instance with attributes ex. class Time(object): def __init__(self): = 0 es = 0 time1 = Time() = 7 es = 15Recursive Function - A function can call itself or other functions. Ex. def count_down(count): if count == 0: print('Go!') else: print(count) count_down(count-1) count_down(2)