WGU C949 Data Structures and Algorithms I Exam (Latest 2023/ 2024 Update) Questions and Verified Answers| 100% Correct| Grade A

WGU C949 Data Structures and Algorithms

I Exam (Latest 2023/ 2024 Update) Questions

and Verified Answers| 100% Correct| Grade

A

Q: 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);

Q: 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

Q: A list that builds on the singly linked list by adding reverse iteration.

Answer:

Dou- bly Linked List

Q: 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); node1.Next = node2; node2.Previous

= node1; node2.Next = node3; node3.Previous = node2;

Q: The first and last nodes of a doubly linked list should have a value of

Answer:

null

Q: Adds a value to the beginning of the list

Answer:

AddHead

Q: Adds a value at the end of the linked list

Answer:

AddTail

Q: Finds the first node whose value equals the provided argument

Answer:

Find

Q: Returns true if the specified value exists in the list, false otherwise

Answer:

Con- tains

Q: Removes the first node on the list whose value is equal to the argument

Answer:

 -

Remove

Q: A doubly linked list where the values are inserted and sorted in order

Answer:

Sort- ed List

Q: Adds the specified item to the linked list in the sort order of the item type

Answer:

Add

Q: A way of organizing, storing, and performing operations on data

Answer:

Data

Structure

Q: A data structure that stores subitems, with a name associated with each subitem.

Answer:

record

Q: A data structure that stores an ordered list of items, with each item is directly accessible by a

positional index.

Answer:

Array

Q: A data structure that stores ordered list of items in nodes, where each node stores data and

has a pointer to the next node.