{"id":129381,"date":"2023-12-01T15:16:09","date_gmt":"2023-12-01T15:16:09","guid":{"rendered":"https:\/\/learnexams.com\/blog\/?p=129381"},"modified":"2023-12-01T15:16:10","modified_gmt":"2023-12-01T15:16:10","slug":"wgu-c949-data-structures-and-algorithms-i-exam-new-2023-2024-update-questions-and-verified-answers-100-correct-grade-a","status":"publish","type":"post","link":"https:\/\/www.learnexams.com\/blog\/2023\/12\/01\/wgu-c949-data-structures-and-algorithms-i-exam-new-2023-2024-update-questions-and-verified-answers-100-correct-grade-a\/","title":{"rendered":"WGU C949 Data Structures and Algorithms I Exam (New 2023\/ 2024 Update) Questions and Verified Answers| 100% Correct| Grade A"},"content":{"rendered":"\n

WGU C949 Data Structures and Algorithms I Exam (New 2023\/ 2024 Update) Questions and Verified Answers| 100% Correct| Grade A<\/p>\n\n\n\n

WGU C949 Data Structures and Algorithms
I Exam (New 2023\/ 2024 Update) Questions
and Verified Answers| 100% Correct| Grade
A
Q:UESTION
A tree that maintains the simple property that a node’s key is greater than or equal to the node’s
childrens’ keys.
Answer:
max heap
Q:UESTION
A tree that maintains the simple property that a node’s key is less than or equal to the node’s
childrens’ keys.
Answer:
min heap
Q:UESTION
A data structure for representing connections among items, and consists of vertices connected
by edges.
Answer:
graph
Q:UESTION
This represents an item in a graph.
Answer:
vertex<\/p>\n\n\n\n

Q:UESTION
This represents a connection between two vertices in a graph.
Answer:
edge
Q:UESTION
A Last-in, First-out (LIFO) data container
Answer:
Stack
Q:UESTION
When something is retrieved from a stack, does it come from t
bottom of the stack?
Answer:
Top
Q:UESTION
A First-in, First-out (FIFO) container
Answer:
Queue
Q:UESTION
When something is removed from a queue, does it come fro the tail?
Answer:
Head<\/p>\n\n\n\n

Q:UESTION
When something is added to a queue, does it get added to the head or the tail?
Answer:
Tail
Q:UESTION
A queue-like container which is both First-in, First-out and Last-in, Last-out
Answer:
Doubly Ended Queue (deque)
Q:UESTION
Which type of function allows for items to be added or removed from the beginning or end?
Answer:
Doubly Ended Queue (deque)
Q:UESTION
A data structure where nodes have parent-child (1:N) relationship
Answer:
Tree
Q:UESTION
Each node in a Tree has at least parent, but the number of children depends on the type
of tree
Answer:
one
Q:UESTION
Every node in a tree has how many parents?
Powered by https:\/\/learnexams.com\/search\/study?query=<\/a><\/p>\n\n\n\n