• wonderlic tests
  • EXAM REVIEW
  • NCCCO Examination
  • Summary
  • Class notes
  • QUESTIONS & ANSWERS
  • NCLEX EXAM
  • Exam (elaborations)
  • Study guide
  • Latest nclex materials
  • HESI EXAMS
  • EXAMS AND CERTIFICATIONS
  • HESI ENTRANCE EXAM
  • ATI EXAM
  • NR AND NUR Exams
  • Gizmos
  • PORTAGE LEARNING
  • Ihuman Case Study
  • LETRS
  • NURS EXAM
  • NSG Exam
  • Testbanks
  • Vsim
  • Latest WGU
  • AQA PAPERS AND MARK SCHEME
  • DMV
  • WGU EXAM
  • exam bundles
  • Study Material
  • Study Notes
  • Test Prep

WGU C949 - Data Structures And Algorithms

Latest WGU Jan 15, 2026 ★★★★☆ (4.0/5)
Loading...

Loading document viewer...

Page 0 of 0

Document Text

WGU C949 - Data Structures And Algorithms 5.0 (1 review) Students also studied Terms in this set (163) Western Governors UniversityD 333 Save WGU C949 Data Structures and Alg...102 terms bodiewoodPreview C949 Data Structures and Algorithm...173 terms AidenOSprague Preview C949 WGU Terminology 72 terms VeraButlerPreview

C949 D

70 terms Sha Practice questions for this set Learn1 / 7Study using Learn In a binary tree, a node with a child.

Root: The one tree node with no parent (the "top" node).

AlgorithmDescribes a sequence of steps to solve a computational problem or perform a calculation.Computational ProblemSpecifies an input, a question about the input that can be answered using a computer, and the desired output.Choose an answer 1Tree2Child 3Root4Parent Don't know?

Longest Common SubstringAn algorithm that determines the longest common substring that exists in two inputs strings.Binary SearchAn efficient algorithm for searching a list. The list's elements must be sorted and directly accessible (such as an array).Dijkstra's Shortest PathAn algorithm that determines the shortest path from a start vertex to each vertex in a graph.NP-CompleteA set of problems for which no known efficient algorithm exists.Polynomial time algorithmAn 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 structureA 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.RecordA data structure that stores subitems, with a name associated with each subitem.ArrayA data structure that stores subitems, with a name associated with each subitem.May only store homogeneous data elements.Linked listA data structure that stores ordered list of items in nodes, where each node stores data and has a pointer to the next node.Binary treeA data structure in which each node stores data and has up to two children, known as a left child and a right child.Hash tableA data structure that stores unordered items by mapping (or hashing) each item to a location in an array.TreeA non-linear data structure that organizes data in a hierarchical way.HeapA complete binary tree-based data structure.Max-heapA tree that maintains the simple property that a node's key is greater than or equal to the node's childrens' keys.Min-heapA tree that maintains the simple property that a node's key is less than or equal to the node's childrens' keys.GraphA data structure for representing connections among items, and consists of vertices connected by edges.VertexRepresents an item in a graph.EdgeRepresents a connection between two vertices in a graph.

Abstract Data Type (ADT)A data type described by predefined user operations, such as "insert data at rear," without indicating how each operation is implemented.ListAn ADT for holding ordered data. Duplicate items are allowed.StackAn ADT in which items are only inserted on or removed from the top.QueueAn ADT in which items are inserted at the end and removed from the front.referred to as a first-in first-out ADT.DequeAn ADT in which items can be inserted and removed at both the front and back.BagAn ADT for storing items in which the order does not matter and duplicate items are allowed.SetAn ADT for a collection of distinct items.Priority QueueA 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.DictionaryAn ADT that associates (or maps) keys with values. Can be used to describe associative relationships in Python.Queue pushInserts an item at the end of the queue.Queue popRemoves and returns the item at the front of the queue.Queue peekReturns but does not remove item at the front of the queue Assignment statementAssigns the name on the left side to reference the value on the right side.MutabilityIndicates whether the object's value is allowed to change.type()A Python function that returns the class type of the argument (object) passed as parameter.id()A Python function that returns identity (unique integer) of an object.name/identifierA sequence of letters (a-z, A-Z, _) and digits (0-9), and must start with a letter.Note that "_", called an underscore, is considered to be a letter.Reserved wordsWords that have special meaning and therefore cannot be used as identifiers.PEP 8The Python style guide that outlines the basics of how to write Python code neatly and consistently.floating-point literalA number with a fractional part, even if that fraction is 0, as in 1.0, 0.0, or 99.573

Scientific notationA floating-point literal written using an e preceding the power-of-10 exponent, as in 6.02e23 to represent 6.02x10^23. The e stands for exponent. Likewise, 0.001 is 1x10-^3 so can be written as 1.0e-3.OverflowOccurs when a value is too large to be stored in the memory allocated by the interpreter.ExpressionA combination of items such as variables, literals, and operators that evaluates to a value. Can be just a literal, just a variable, or some combination of variables, literals, and operators.LiteralA specific value in code like 2 or "abc".OperatorA symbol for a built-in language calculation like + for addition.Modulo operatorWritten as %, evaluates to the remainder of the division of the two integer operands.String literalA string value specified in the source code of a program.Sequence typeA type that specifies a collection of objects ordered from left to right. A string's characters are ordered from the first letter of the string to the last.Character indexThe position of a character in a string.len()A Python function to find the length of a string (and any other sequence type).any()A Python function that returns True if any key of the dictionary is true.ContainersObjects that contain references to other objects instead of data.ElementAn item of a list Sequence-type functionsBuilt-in functions that operate on sequences like lists and strings.TupleA data type behaves similar to a list but is immutable - once created the elements cannot be changed.Numeric typeThis type includes int and float which represent the most common types used to store data. These types all support the normal mathematical operations such as addition, subtraction, multiplication, and division, among others.Mapping typeA mapping type is a data type comprised of a collection of keys and associated values. Python's only built-in mapping type is the dictionary. Dictionaries implement the associative array abstract data type.membership operatorsThese operators include the in and not in operators and yield True or False if the left operand matches the value of some element in the right operand, which is always a container.

User Reviews

★★★★☆ (4.0/5 based on 1 reviews)
Login to Review
S
Student
May 21, 2025
★★★★☆

This document featured detailed explanations that was a perfect resource for my project. Such an excellent resource!

Download Document

Buy This Document

$11.00 One-time purchase
Buy Now
  • Full access to this document
  • Download anytime
  • No expiration

Document Information

Category: Latest WGU
Added: Jan 15, 2026
Description:

WGU C949 - Data Structures And Algorithms 5.0 (1 review) Students also studied Terms in this set Western Governors UniversityD 333 Save WGU C949 Data Structures and Alg... 102 terms bodiewood Previ...

Unlock Now
$ 11.00