2025 update| WGU C949 Data Structures and Algorithms (2 VERSIONS) |
latest |COMPREHENSIVE QUESTIONS AND VERIFIED ANSWERS (100% Correct
solutions) GET IT 100% ACCURATE!!
A container where data is stored in nodes consisting of a single data item and a
reference to the next node
Linked List
A ______ is a container where nodes of data are linked together into a list
Linked List
Linking together complex nodes into a single structure
Linked List
Each link in a chain for a linked lists is called a ______
node
What two things do nodes contain?
1. the value
2. reference to next item in the list
Give a coded example on how to create a 3 chained linked list of nodes.
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
Singly Linked List
A list that builds on the singly linked list by adding reverse iteration.
Doubly Linked List
Give a coded example on how to create a doubly linked list
Node node1 = new Node(1);
Node node2 = new Node(2);
Node node3 = new Node(3);
,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 ______
null
Adds a value to the beginning of the list
AddHead
Adds a value at the end of the linked list
AddTail
Finds the first node whose value equals the provided argument
Find
Returns true if the specified value exists in the list, false otherwise
Contains
Removes the first node on the list whose value is equal to the argument
Remove
A doubly linked list where the values are inserted and sorted in order
Sorted List
Adds the specified item to the linked list in the sort order of the item type
Add
A way of organizing, storing, and performing operations on data
Data Structure
A data structure that stores subitems, with a name associated with each subitem.
record
A data structure that stores an ordered list of items, with each item is directly
accessible by a positional index.
Array
A data structure that stores ordered list of items in nodes, where each node stores
data and has a pointer to the next node.
linked list
A data structure in which each node stores data and has up to two children, known as
a left child and a right child.
binary tree
,A data structure that stores unordered items by mapping (or hashing) each item to a
location in an array.
hash table
A functions whose cost scales linearly with the size of the input
O(n)
Iterating over a collection of data once often indicates an ______ algorithm. (alphabet
for-loop example)
O(n)
A functions whose cost scales logarithmically with the input size
O(log n)
Which type of function works by breaking down large problem into smaller and
smaller chunks?
O(log n)
As the size of the input grows the cost of the algorithm does not increase at the same
rate. The overall cost of performing an operation on 1,000,000 items is only twice
that of performing the operation on 1,000 items.
O(log n)
A function that exhibits quadratic growth relative to the input size
O(n^2)
An example of this type of function is doubly nested loop
O(n^2)
Which type of function gets really expensive really quickly?
O(n^2)
A function that has two inputs that contribute to growth
O(nm)
An example of this type of function is when there is a nested loop that iterates of two
distinct collections of data
O(nm)
Are Big-O cases used in the best or worst situations?
Worst
Which statement is static?
, readonly Contact[] contacts = new Contact[];
readonly Contact contacts = new Contacts[100];
readonly Contact contacts = new Contacts[100];
A tree that maintains the simple property that a node's key is greater than or equal
to the node's childrens' keys.
max heap
A tree that maintains the simple property that a node's key is less than or equal to
the node's childrens' keys.
min heap
A data structure for representing connections among items, and consists of vertices
connected by edges.
graph
This represents an item in a graph.
vertex
This represents a connection between two vertices in a graph.
edge
A Last-in, First-out (LIFO) data container
Stack
When something is retrieved from a stack, does it come from the top or bottom of the
stack?
Top
A First-in, First-out (FIFO) container
Queue
When something is removed from a queue, does it come from the head or the tail?
Head
When something is added to a queue, does it get added to the head or the tail?
Tail
A queue-like container which is both First-in, First-out and Last-in, Last-out
Doubly Ended Queue (deque)
Which type of function allows for items to be added or removed from the beginning or
end?
Doubly Ended Queue (deque)
latest |COMPREHENSIVE QUESTIONS AND VERIFIED ANSWERS (100% Correct
solutions) GET IT 100% ACCURATE!!
A container where data is stored in nodes consisting of a single data item and a
reference to the next node
Linked List
A ______ is a container where nodes of data are linked together into a list
Linked List
Linking together complex nodes into a single structure
Linked List
Each link in a chain for a linked lists is called a ______
node
What two things do nodes contain?
1. the value
2. reference to next item in the list
Give a coded example on how to create a 3 chained linked list of nodes.
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
Singly Linked List
A list that builds on the singly linked list by adding reverse iteration.
Doubly Linked List
Give a coded example on how to create a doubly linked list
Node node1 = new Node(1);
Node node2 = new Node(2);
Node node3 = new Node(3);
,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 ______
null
Adds a value to the beginning of the list
AddHead
Adds a value at the end of the linked list
AddTail
Finds the first node whose value equals the provided argument
Find
Returns true if the specified value exists in the list, false otherwise
Contains
Removes the first node on the list whose value is equal to the argument
Remove
A doubly linked list where the values are inserted and sorted in order
Sorted List
Adds the specified item to the linked list in the sort order of the item type
Add
A way of organizing, storing, and performing operations on data
Data Structure
A data structure that stores subitems, with a name associated with each subitem.
record
A data structure that stores an ordered list of items, with each item is directly
accessible by a positional index.
Array
A data structure that stores ordered list of items in nodes, where each node stores
data and has a pointer to the next node.
linked list
A data structure in which each node stores data and has up to two children, known as
a left child and a right child.
binary tree
,A data structure that stores unordered items by mapping (or hashing) each item to a
location in an array.
hash table
A functions whose cost scales linearly with the size of the input
O(n)
Iterating over a collection of data once often indicates an ______ algorithm. (alphabet
for-loop example)
O(n)
A functions whose cost scales logarithmically with the input size
O(log n)
Which type of function works by breaking down large problem into smaller and
smaller chunks?
O(log n)
As the size of the input grows the cost of the algorithm does not increase at the same
rate. The overall cost of performing an operation on 1,000,000 items is only twice
that of performing the operation on 1,000 items.
O(log n)
A function that exhibits quadratic growth relative to the input size
O(n^2)
An example of this type of function is doubly nested loop
O(n^2)
Which type of function gets really expensive really quickly?
O(n^2)
A function that has two inputs that contribute to growth
O(nm)
An example of this type of function is when there is a nested loop that iterates of two
distinct collections of data
O(nm)
Are Big-O cases used in the best or worst situations?
Worst
Which statement is static?
, readonly Contact[] contacts = new Contact[];
readonly Contact contacts = new Contacts[100];
readonly Contact contacts = new Contacts[100];
A tree that maintains the simple property that a node's key is greater than or equal
to the node's childrens' keys.
max heap
A tree that maintains the simple property that a node's key is less than or equal to
the node's childrens' keys.
min heap
A data structure for representing connections among items, and consists of vertices
connected by edges.
graph
This represents an item in a graph.
vertex
This represents a connection between two vertices in a graph.
edge
A Last-in, First-out (LIFO) data container
Stack
When something is retrieved from a stack, does it come from the top or bottom of the
stack?
Top
A First-in, First-out (FIFO) container
Queue
When something is removed from a queue, does it come from the head or the tail?
Head
When something is added to a queue, does it get added to the head or the tail?
Tail
A queue-like container which is both First-in, First-out and Last-in, Last-out
Doubly Ended Queue (deque)
Which type of function allows for items to be added or removed from the beginning or
end?
Doubly Ended Queue (deque)
