WGU - C949 QUESTIONS AND ANSWERS

WGU - C949 QUESTIONS AND ANSWERS
list.append(x)
CORRECT ANSWER adds x at last element


list.pop(x)
CORRECT ANSWER removes the x element


list.remove(x)
CORRECT ANSWER removes the x value


tuple.count(x)
CORRECT ANSWER returns how many times x is in tuple


tuple.index(x)
CORRECT ANSWER finds where x is located in the tuple


set.update(set2)
CORRECT ANSWER adds new set to current set


set.add(x)
CORRECT ANSWER adds x to set


set.remove(x)
CORRECT ANSWER finds x and removes from set


set.pop()
CORRECT ANSWER removes RANDOM element from set


set.clear()
CORRECT ANSWER clears set

, set.intersection(set2, set3)
CORRECT ANSWER sees what both sets have in common


set.union(set2, set3)
CORRECT ANSWER combines both sets


Record
CORRECT ANSWER A group of related items.
Stores subitem names, then lists associated subitem (field)


Linked List
CORRECT ANSWER A list that has an element.
ALSO has a reference to the next node


Doubly Linked List
CORRECT ANSWER Linked list, but ALSO has a reference to the previous node.


Can traverse back and forth


Hash Table datatypes
CORRECT ANSWER Array and Dictionaries.


Has BUCKETS and MAPPING KEYS.


Stores values based on common characteristic (ex. %10 of each value)


Hash Table Collision - Chaining
CORRECT ANSWER Value is put in a PRE-EXISTING bucket


Hash Table Collision - Probing
CORRECT ANSWER Instead of chaining, the value is put in an UNOCCUPIED bucket