WGU C949 WGU Terminology

C949 WGU Terminology 26 studiers today 4.3 (55 reviews) Students also studied Terms in this set (72) Western Governors UniversityD 333 Save WGU C949 Data Structures and Alg...102 terms bodiewoodPreview C949 Data Structures and Algorithm...173 terms AidenOSprague Preview

WGU C949 STUDY GUIDE

Teacher 95 terms badunique321 Preview

D426 S

225 term bra Practice questions for this set Learn1 / 7Study using Learn symbol for floored division recorddata structure that stores subitems, with a name associated with each subitem arraya data structure that stores an ordered list of items, with each item is directly accessible by a positional index homogeneous data elements Choose an answer 1//2record 3list4hash table Don't know?

linked listdata 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 binary treeA 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 tabledata structure that stores unordered items by mapping (or hashing) each item to a location in an array max-heapa tree that maintains the simple property that a node's key is greater than or equal to the node's childrens' keys min-heapa tree that maintains the simple property that a node's key is less than or equal to the node's childrens' keys graphdata structure for representing connections among items, and consists of vertices connected by edges verticepart of a graph the represents an item in a graph edgepart of a graph that represents a connection between to vertices in a graph what is an advantage of a linked list over an array? when inserting a new item at the beginning it causes no shift to the data ADT (Abstract data Type)data type described by predefined user operations, such as "insert data at rear", without indication how each operation is implemented listADT for holding ordered data stackADT which items are only inserted on or removed from the top of a stack LIFO QueueADT 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 BagADT for stroing items in which the order does not matter and duplicate items are allowed SetADT for collection of distinct items

common underlying DS: Binary search tree, hash table

Priority Queuea queue in which the highest-priority elements are removed first; within a priority value, the earliest arrival is removed first.

common underlying DS: heap

Dictionary (map)ADT that associates (or maps) keys with values

common underlying DS: has table, binary search tree

List, BagADTs with array, linked list as common underlying DS Stack, Queue, DequeADTs with linked list as their only common underlying DS PeekADT operation for a queue that returns but does not remove item at the front of the queue identityunique identifier that describes the object //symbol for floored division tuplebehaves similar to a list but is immutable -- once created the els can not be chagned const array/list for i in range(0)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.range(5, -6, -1)code for every int form 5 down to -5 range(10, 21, 2)code for every 2nd int from 10 to 20 polymorphismfunctional behavior depends on the argument types dynamic typingused to determine the type of objects as a program executes; Python Static Typingrequires the programmer to define the type of every variable and every function parameter in a program's source code; C, C++ classkeyword that can be used to create a user-defined type of object containing groups of related vars and fxns creates a new type of object __init__instantiation of a class automatically calls this method defined in the class def this is also known as the constructor memory allocationthe process of an app req and being granted memory

garbage collectionreference count is an integer count that reps how many vars ref an obj; when an obj ref count = 0 the obj is no longer referenced and is sent here

ternarytype of operation condition ? (T)Block1: (F)Block2

assignmenttype of operation for setting a var comparisontype of operation for comparing data <, > ...equalitytype of operation == !== shortdata type longdata type linked allocationA data structured contains the name, size, and starting block/cluster address of a file. A table is used to identify the address of each piece of the file.Storage is allocated using pointers to new locations as needed.mid-values dequeA ______ is a "doubled-ended queue" ListADT that has elements of the same type so that the elements can be retrieved based on index or position (high + low)/2mid-values calculation for binary search. toCeil() It is automatically available for garbage collection What is the effect on the object regarding garbage collection?Computing obj = new Computing(); obj = null mutableopen to or capable of change, fickle immutable(adj.) not subject to change, constant unique and immutableCharacteristics of keys in associative dictionary data type DictName[key].remove(value)method used to take a value out of a dictionary Java.io.FileInputStreamJava method used to read bytes from standard file Add(int index, Object x)command that inserts object x at position index in a list quick sortrecursively breaks down a problem into two or more subproblems of the same or related type O(n^2)Bubble sort && Insertion sort time complexity