1|Page
WGU C949 OBJECTIVE ASSESSMENT 2 EXAM
LATEST 2026 ACTUAL VERIFIED EXAM WITH
COMPLETE QUESTIONS AND CORRECT DETAILED
ANSWERS (100% VERIFIED ANSWERS) |ALREADY
GRADED A+| ||NEWEST EXAM!!!||
A container where data is stored in nodes consisting of a
single data item and a reference to the next node -
Answer-Linked List
A ______ is a container where nodes of data are linked
together into a list - Answer-Linked List
Linking together complex nodes into a single structure -
Answer-Linked List
Each link in a chain for a linked lists is called a ______ -
Answer-node
What two things do nodes contain? - Answer-1. the value
2. reference to next item in the list
,2|Page
Give a coded example on how to create a 3 chained linked
list of nodes. - Answer-Node head = new Node(1);
head.Next = new Node(2);
head.Next.Next = new Node(3);
A list where we start at the first node and follow the chain
of nodes iterating over each until we get to the end -
Answer-Singly Linked List
A list that builds on the singly linked list by adding reverse
iteration. - Answer-Doubly Linked List
Give a coded example on how to create a doubly linked
list - Answer-Node node1 = new Node(1);
Node node2 = new Node(2);
Node node3 = new Node(3);
,3|Page
node1.Next = node2;
node2.Previous = node1;
node2.Next = node3;
node3.Previous = node2;
The first and last nodes of a doubly linked list should have
a value of ______ - Answer-null
A functions whose cost scales linearly with the size of the
input - Answer-O(n)
Iterating over a collection of data once often indicates an
______ algorithm. (alphabet for-loop example) - Answer-
O(n)
A functions whose cost scales logarithmically with the
input size - Answer-O(log n)
, 4|Page
Which type of function works by breaking down large
problem into smaller and smaller chunks? - Answer-O(log
n)
Which statement describes a queue data structure? -
Answer-It is a sequence of elements in which insertions
can take place only at the back end and deletions can take
place only at the front end.
Which data structure allows inserting and deleting data
elements at both the front and the rear? - Answer-Queues
Which data structure allows elements to be inserted and
deleted from one end and provides no direct access to the
other end? - Answer-Stack
What are the official indexes for the list list01 given this
declaration? int[ ] list01 = {0, 2, 4, 6, 8, 10}; - Answer-0, 1,
2, 3, 4, 5
Which abstract data type (ADT) has elements of the same
type so that the elements can be retrieved based on the
index or position? - Answer-List
WGU C949 OBJECTIVE ASSESSMENT 2 EXAM
LATEST 2026 ACTUAL VERIFIED EXAM WITH
COMPLETE QUESTIONS AND CORRECT DETAILED
ANSWERS (100% VERIFIED ANSWERS) |ALREADY
GRADED A+| ||NEWEST EXAM!!!||
A container where data is stored in nodes consisting of a
single data item and a reference to the next node -
Answer-Linked List
A ______ is a container where nodes of data are linked
together into a list - Answer-Linked List
Linking together complex nodes into a single structure -
Answer-Linked List
Each link in a chain for a linked lists is called a ______ -
Answer-node
What two things do nodes contain? - Answer-1. the value
2. reference to next item in the list
,2|Page
Give a coded example on how to create a 3 chained linked
list of nodes. - Answer-Node head = new Node(1);
head.Next = new Node(2);
head.Next.Next = new Node(3);
A list where we start at the first node and follow the chain
of nodes iterating over each until we get to the end -
Answer-Singly Linked List
A list that builds on the singly linked list by adding reverse
iteration. - Answer-Doubly Linked List
Give a coded example on how to create a doubly linked
list - Answer-Node node1 = new Node(1);
Node node2 = new Node(2);
Node node3 = new Node(3);
,3|Page
node1.Next = node2;
node2.Previous = node1;
node2.Next = node3;
node3.Previous = node2;
The first and last nodes of a doubly linked list should have
a value of ______ - Answer-null
A functions whose cost scales linearly with the size of the
input - Answer-O(n)
Iterating over a collection of data once often indicates an
______ algorithm. (alphabet for-loop example) - Answer-
O(n)
A functions whose cost scales logarithmically with the
input size - Answer-O(log n)
, 4|Page
Which type of function works by breaking down large
problem into smaller and smaller chunks? - Answer-O(log
n)
Which statement describes a queue data structure? -
Answer-It is a sequence of elements in which insertions
can take place only at the back end and deletions can take
place only at the front end.
Which data structure allows inserting and deleting data
elements at both the front and the rear? - Answer-Queues
Which data structure allows elements to be inserted and
deleted from one end and provides no direct access to the
other end? - Answer-Stack
What are the official indexes for the list list01 given this
declaration? int[ ] list01 = {0, 2, 4, 6, 8, 10}; - Answer-0, 1,
2, 3, 4, 5
Which abstract data type (ADT) has elements of the same
type so that the elements can be retrieved based on the
index or position? - Answer-List
