C949 Data Structures & Algorithms at Western Governors University | Flashcards & Summaries

### Select your language

Suggested languages for you:

# Lernmaterialien für C949 Data Structures & Algorithms an der Western Governors University

Greife auf kostenlose Karteikarten, Zusammenfassungen, Übungsaufgaben und Altklausuren für deinen C949 Data Structures & Algorithms Kurs an der Western Governors University zu.

TESTE DEIN WISSEN

This is a data structure that stores subitems, also called fields, with a name associated with each item.

Lösung anzeigen
TESTE DEIN WISSEN

Record

Lösung ausblenden
TESTE DEIN WISSEN

ADT that associates (or maps) keys with values.

Common underlying data structures:

Hash Table, Binary Search Tree

Lösung anzeigen
TESTE DEIN WISSEN

Dictionary (Map)

Lösung ausblenden
TESTE DEIN WISSEN

This 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.

Lösung anzeigen
TESTE DEIN WISSEN

Lösung ausblenden
TESTE DEIN WISSEN

This 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

Lösung anzeigen
TESTE DEIN WISSEN

Binary Tree

Lösung ausblenden
TESTE DEIN WISSEN

ADT in which items are inserted at the end of the queue and removed from the front of the queue. FIFO (first in, first out)

Common underlying data structure:

Lösung anzeigen
TESTE DEIN WISSEN

Queue

Lösung ausblenden
TESTE DEIN WISSEN

ADT for storing items in which the order does not matter and duplicate items are allowed.

Common underlying data structure:

Lösung anzeigen
TESTE DEIN WISSEN

Bag

Lösung ausblenden
TESTE DEIN WISSEN

This data structure is a tree that maintains the simple property that a node's key is less than or equal to the node's childrens' keys.

Lösung anzeigen
TESTE DEIN WISSEN

Min-heap

Lösung ausblenden
TESTE DEIN WISSEN

This is a data structure for representing connections among items and consists of vertices connected by edges.

Lösung anzeigen
TESTE DEIN WISSEN

Graph

Lösung ausblenden
TESTE DEIN WISSEN

A _______ represents an item in a graph. An ______ represents a connection between two vertices in a graph.

Lösung anzeigen
TESTE DEIN WISSEN

A vertex represents an item in a graph. An edge represents a connection between two vertices in a graph.

Lösung ausblenden
TESTE DEIN WISSEN

ADT for holding ordered data.

Common underlying data structure: Array, Linked List

Lösung anzeigen
TESTE DEIN WISSEN

List

Lösung ausblenden
TESTE DEIN WISSEN

ADT in which items are only inserted on or removed from the top.  LIFO (last in, first out)

Common underlying data structure:

Lösung anzeigen
TESTE DEIN WISSEN

Stack

Lösung ausblenden
TESTE DEIN WISSEN

What does this operation do to a list ADT?

Remove(list, x)

Lösung anzeigen
TESTE DEIN WISSEN

Removes x

Original list:

99, 77

Operation:

Remove(list, 77)

New list:

list: 99

Lösung ausblenden
• 9167 Karteikarten
• 324 Studierende
• 0 Lernmaterialien

## Beispielhafte Karteikarten für deinen C949 Data Structures & Algorithms Kurs an der Western Governors University - von Kommilitonen auf StudySmarter erstellt!

Q:

This is a data structure that stores subitems, also called fields, with a name associated with each item.

A:

Record

Q:

ADT that associates (or maps) keys with values.

Common underlying data structures:

Hash Table, Binary Search Tree

A:

Dictionary (Map)

Q:

This 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.

A:

Q:

This 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

A:

Binary Tree

Q:

ADT in which items are inserted at the end of the queue and removed from the front of the queue. FIFO (first in, first out)

Common underlying data structure:

A:

Queue

Q:

ADT for storing items in which the order does not matter and duplicate items are allowed.

Common underlying data structure:

A:

Bag

Q:

This data structure is a tree that maintains the simple property that a node's key is less than or equal to the node's childrens' keys.

A:

Min-heap

Q:

This is a data structure for representing connections among items and consists of vertices connected by edges.

A:

Graph

Q:

A _______ represents an item in a graph. An ______ represents a connection between two vertices in a graph.

A:

A vertex represents an item in a graph. An edge represents a connection between two vertices in a graph.

Q:

ADT for holding ordered data.

Common underlying data structure: Array, Linked List

A:

List

Q:

ADT in which items are only inserted on or removed from the top.  LIFO (last in, first out)

Common underlying data structure:

A:

Stack

Q:

What does this operation do to a list ADT?

Remove(list, x)

A:

Removes x

Original list:

99, 77

Operation:

Remove(list, 77)

New list:

list: 99

### Erstelle und finde Lernmaterialien auf StudySmarter.

Greife kostenlos auf tausende geteilte Karteikarten, Zusammenfassungen, Altklausuren und mehr zu.

## Das sind die beliebtesten C949 Data Structures & Algorithms Kurse im gesamten StudySmarter Universum

##### Algorithmen & Datenstrukturen

FOM Hochschule für Oekonomie & Management

##### CS 123 - Data Structures and Algorithms

University of Southern Mindanao

Umea University

LMU München