WGU C949 OBJECTIVE ASSESSMENT 2 LATEST VERSIONS NEWEST 2024 ACTUAL EXAM COMPLETE 350 QUESTIONS AND CORRECT DETAILED ANSWERS

WGU C949 OBJECTIVE ASSESSMENT 2 LATEST VERSIONS NEWEST 2024 ACTUAL EXAM COMPLETE 350
QUESTIONS AND CORRECT DETAILED ANSWERS

list.append(x) - (answer) adds x at last element



list.pop(x) - (answer) removes the x element



list.remove(x) - (answer) removes the x value



tuple.count(x) - (answer) returns how many times x is in tuple



tuple.index(x) - (answer) finds where x is located in the tuple



set.update(set2) - (answer) adds new set to current set



set.add(x) - (answer) adds x to set



set.remove(x) - (answer) finds x and removes from set



set.pop() - (answer) removes RANDOM element from set



set.clear() - (answer) clears set



set.intersection(set2, set3) - (answer) sees what both sets have in common



set.union(set2, set3) - (answer) combines both sets



Record - (answer) A group of related items.

Stores subitem names, then lists associated subitem (field)

, WGU C949 OBJECTIVE ASSESSMENT 2 LATEST VERSIONS NEWEST 2024 ACTUAL EXAM COMPLETE 350
QUESTIONS AND CORRECT DETAILED ANSWERS

Linked List - (answer) A list that has an element.

ALSO has a reference to the next node



Doubly Linked List - (answer) Linked list, but ALSO has a reference to the previous node.



Can traverse back and forth



Hash Table datatypes - (answer) Array and Dictionaries.



Has BUCKETS and MAPPING KEYS.



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



Hash Table Collision - Chaining - (answer) Value is put in a PRE-EXISTING bucket



Hash Table Collision - Probing - (answer) Instead of chaining, the value is put in an UNOCCUPIED bucket



queue.Enqueue(x) - (answer) adds x to END of queue



queue.Dequeue()

queue.Dequeue(x) - (answer) Removes FRONT element

Removes x from queue



queue.pop() - (answer) removes REAR element



deque.PushFront(x)

deque.PushBack(x) - (answer) Adds to front / end of deque