WGU C949 - Data Structures And Algorithms exam with 100% correct answers 2024

WGU C949 - Data Structures And Algorithms exam with 100% correct answers 2024 Task decomposition - answermeans to reduce a complex task into simpler basic steps, making the whole task easier to solve. interactive interpreter - answeris a program that allows the user to execute one line of code at a time. A statement - answeris a program instruction. A program mostly consists of a series of statements, each statement usually appears on its own line. Expressions - answerare code that return a value when evaluated; for example, the code wage * hours * weeks is an expression that computes a number. * is the symbol for multiplication. The names wage, hours, weeks, and salary are variables, which are named references to values stored by the interpreter. Record - answerA record is the data structure that stores subitems, often called fields, with a name associated with each subitem. Array - answerAn array is a data structure that stores an ordered list of items, where each item is directly accessible by a positional index. -may only store homogeneous data elements Linked list - answerA linked list is a data structure that stores an ordered list of items in nodes, where each node stores data and has a pointer to the next node. Binary tree - answerA binary tree is a data structure in which each node stores data and has up to two children, known as a left child and a right child. Hash table - answerA hash table is a data structure that stores unordered items by mapping (or hashing) each item to a location in an array. Heap - answerA max-heap is a tree that maintains the simple property that a node's key is greater than or equal to the node's childrens' keys. A min-heap is a tree that maintains the simple property that a node's key is less than or equal to the node's childrens' keys. Graph - answerA graph is a data structure for representing connections among items, and consists of vertices connected by edges. A vertex represents an item in a graph. An edge represents a connection between two vertices in a graph. List - answerA list is an ADT for holding ordered data, where the order is based on how the program insert or removes items. A list may contain duplicate items. Set - answerA set is an ADT for a collection of distinct items, so duplicate items are not allowed. Priority queue - answerA priority queue is an ADT where each item has a priority. Items with higher priority are closer to the front of the queue than items with lower priority, so the item's priority determines the item's position in the queue. Both duplicate items and items with the same priority are allowed. Bag - answerA bag is an ADT for storing items in which the order does not matter and duplicate items are allowed. Stack - answerA stack is an ADT in which items are only inserted on or removed from the top of a stack. Queue - answerA queue is an ADT in which items are inserted at the end of the queue and removed from the front of the queue. Deque - answerA deque (pronounced "deck"