WGU C949 - Data Structures And Algorithms Exam with Latest Questions and Answers.

WGU C949 - Data Structures And Algorithms Exam with Latest Questions and Answers. Algorithm - Answer- Describes a sequence of steps to solve a computational problem or perform a calculation. Computational Problem - Answer- Specifies an input, a question about the input that can be answered using a computer, and the desired output. Longest Common Substring - Answer- An algorithm that determines the longest common substring that exists in two inputs strings. Binary Search - Answer- An efficient algorithm for searching a list. The list's elements must be sorted and directly accessible (such as an array). Dijkstra's Shortest Path - Answer- An algorithm that determines the shortest path from a start vertex to each vertex in a graph. NP-Complete - Answer- A set of problems for which no known efficient algorithm exists. Polynomial time algorithm - Answer- An algorithm whose execution time grows as a polynomial of input size. An efficient algorithm is one whose runtime increases no more than polynomially with respect to the input size. Data structure - Answer- A way of organizing, storing, and performing operations on data. Operations include accessing or updating stored data, searching for specific data, inserting new data, and removing data. Record - Answer- A data structure that stores subitems, with a name associated with each subitem. Array - Answer- A data structure that stores subitems, with a name associated with each subitem. May only store homogeneous data elements. Linked list - Answer- A data structure that stores ordered list of items in nodes, where each node stores data and has a pointer to the next node. Binary tree - Answer- 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 - Answer- A data structure that stores unordered items by mapping (or hashing) each item to a location in an array. Tree - Answer- A non-linear data structure that organizes data in a hierarchical way. WGU C949 - Data Structures And Algorithms Exam with Latest Questions and Answers. Heap - Answer- A complete binary tree-based data structure. Max-heap - Answer- A tree that maintains the simple property that a node's key is greater than or equal to the node's childrens' keys. Min-heap - Answer- A tree that maintains the simple property that a node's key is less than or equal to the node's childrens' keys. Graph - Answer- A data structure for representing connections among items, and consists of vertices connected by edges. Vertex - Answer- Represents an item in a graph. Edge - Answer- Represents a connection between two vertices in a graph. Abstract Data Type (ADT) - Answer- A data type described by predefined user operations, such as "insert data at rear," without indicating how each operation is implemented. List - Answer- An ADT for holding ordered data. Duplicate items are allowed. Stack - Answer- An ADT in which items are only inserted on or removed from the top. Queue - Answer- An ADT in which items are inserted at the end and removed from the front. referred to as a first-in first-out ADT. Deque - Answer- An ADT in which items can be inserted and removed at both the front and back. Bag - Answer- An ADT for storing items in which the order does not matter and duplicate items are allowed. Set - Answer- An ADT for a collection of distinct items. Priority Queue - Answer- A queue where each item has a priority, and items with higher priority are closer to the front of the queue than items with lower priority. Duplicates items are allowed. Dictionary - Answer- An ADT that associates (or maps) keys with values. Can be used to describe associative relationships in Python. Queue push - Answer- Inserts an item at the end of the queue.