WGU C949 2026 COMPREHENSIVE STUDY GUIDE PRACTICE SET

WGU C949 2026 COMPREHENSIVE STUDY
GUIDE PRACTICE SET

◉ What is the deletion complexity at a specific index in an array?
Answer: O(n).


◉ What are use cases for arrays? Answer: Fast access by index and
known data set size.


◉ What is a linked list? Answer: Linear collection of nodes, each
containing data and a pointer to the next node.


◉ What are the types of linked lists? Answer: Singly, doubly, circular.


◉ What is the access complexity of a linked list? Answer: O(n).


◉ What is the search complexity of a linked list? Answer: O(n).


◉ What is the insertion complexity at the beginning of a linked list?
Answer: O(1).

, ◉ What is the insertion complexity at the end of a linked list?
Answer: O(n).


◉ What is the insertion complexity at a specific position in a linked
list? Answer: O(n).


◉ What is the deletion complexity from the beginning of a linked
list? Answer: O(1).


◉ What is the deletion complexity from the end of a linked list?
Answer: O(n).


◉ What is the deletion complexity from a specific position in a
linked list? Answer: O(n).


◉ What does append() do in Python? Answer: Adds an element to
the end of the list.


◉ What does extend() do in Python? Answer: Extends list with
elements from another iterable.


◉ What does insert() do in Python? Answer: Inserts an element at a
specific index.