C949 WGU Terminology exam questions and answers

inserting a new item at the beginning it causes no shift to the data what is an advantage of a linked list over an array?n N In the worst case, inserting a new node into a tree with N nodes requires how many comparisons? reference count A _____________is an integer counter that represents how many variables reference an object. When an object's reference count is 0, that object is no longer referenced. Branching directs a program to execute either one group of statements or another, depending on the result of an expression. while loop A ______ executes a block of code as long as the loop's expression is True. print(user_value*5) The syntax __________ produces a new string, which repeats the value of user_value 5 times. In this case, the value of user_value may be "-", thus the result of the multiplication is "-----". range() generates a sequence of numbers, starting at zero and ending before a value given inside the parentheses. For example, for i in range(3) sets i to 0 during the first iteration of the for loop, i to 1 during the second iteration, and finally i to 2 on the third iteration. The value within the parentheses is not included in the generated sequence. namespace A ____________ maps names to objects. The Python interpreter uses namespaces to track all of the objects in a program. object In a program, an ______ consists of some internal data items plus operations that can be performed on that data. Value: A ________ such as "20", "abcdef", or 55. min(list) Find the element in list with the smallest value. sum(list) Find the sum of all elements of a list (numbers only). (val) find the index of the first element in list whose value matches val. (val) Count the number of occurrences of the value val in list. max(list) Find the element in list with the largest value. name A ,__________ also called an identifier, is a sequence of letters (a-z, A-Z, _) and digits (0-9), and must start with a letter. Note that "_", called an underscore, is considered to be a letter. type() built-in function ___________ prints the type of an object. Identity: A unique identifier that describes the object selection sort O(n^2) A sort algorithm that repeatedly searches remaining items to find the least one and moves it to its final location. Remove(list, x) Removes x Remove(list, 77), list: 99 Search(list, x) Returns item if found, else returns null Search(list, 99), returns item 99Search(list, 22), returns null Print(list) Prints list's items in orderPrint(list) outputs: 99, 77 Sort(list) Sorts the lists items in ascending orderlist becomes: 77, 99 IsEmpty(list) Returns true if list has no items For list 99, 77, IsEmpty(list) returns false GetLength(list) Returns the number of items in the listGetLength(list) returns 2 record data structure that stores subitems, with a name associated with each subitem array a data structure that stores an ordered list of items, with each item is directly accessible by a positional index homogeneous data elements Inserting at the beginning requires making room for the new item. So every current item must be shifted once. linked list data structure that stores ordered list of items in nodes, where each node stores data and has a pointer to the next node; can have multiple subitems No shifting of other items is required, which is an advantage of using linked lists. binary tree A data structure that consists of nodes, with one root node at the base of the tree, and two nodes (left child and right child) extending from the root, and from each child node can have no children, single left or right, or both right and left hash table data structure that stores unordered items by mapping (or hashing) each item to a location in an array max-heap a tree that maintains the simple property that a node's key is greater than or equal to the node's childrens' keys min-heap a tree that maintains the simple property that a node's key is less than or equal to the node's childrens' keys graph data structure for representing connections among items, and consists of vertices connected by edges vertice part of a graph the represents an item in a graph edge part of a graph that represents a connection between to vertices in a graph ADT (Abstract data Type) data type described by predefined user operations, such as "insert data at rear", without indication how each operation is implemented list ADT for holding ordered data stack ADT which items are only inserted on or removed from the top of a stack LIFO Queue ADT in which items are inserted at the end of the queue and removed from the front of the queue FIFO deque ("deck") ADT in which items can be removed at both the front and back Bag ADT for stroing items in which the order does not matter and duplicate items are allowed Set ADT for collection of distinct items common underlying DS: Binary search tree, hash table Priority Queue a queue in which the highest-priority elements are removed first; within a priority value, the earliest arrival is removed first. common underlying DS: heap