Week 1 & 2 Flashcards
Data Structures are a collection of?
Data values that have relationships among them
What are Algorithms?
a finite sequence of precise instructions for solving a problem
What is Abstraction?
Hiding implementation details in order to reduce complexity and increase manageability
What are three things DS’s do?
They store data, answer queries and perform updates
Why do we need DS’s?
Every part of a computer system has non-trivial data structures in it
What is a DS Interface?
What the data structure represents (ADTS) and what operations it supports (WHAT IT DOES)
What is an Implementation of a DS?
The performance (speed + memory). How long each operation takes and how much space it uses (HOW IT IS DONE)
What do Lists store?
An indexed sequence of elements
What do Queues store?
Elements that are accessed first in, first out
What do stacks store?
Store elements that are accessed in first-in-last-out order
What do priority queues store?
Elements that are accessed by minimum priority first
What is a set?
An unordered collection containing distinct elements
What is a map?
A set of keys to values
What is a linked list?
A node-based list that is a cycle, each node is connected to the one previous, and after
