CS- data structures

0.0(0)
studied byStudied by 0 people
0.0(0)
full-widthCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/15

flashcard set

Earn XP

Description and Tags

data structures

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

16 Terms

1
New cards

what is an array?

a variable that contains more than one data item/ static/ only one data type

2
New cards

What is a record?

a collection of different fields which can be of different data types

3
New cards

What is a list?

a data structure that consists of a number of items where the items can occur more than once

4
New cards

What is a tuple?

an ordered set of values of any type

5
New cards

What is a linked list?

a data structure that provides a foundation upon which other structures can be built, like stacks, graphs, queues and trees 

6
New cards
7
New cards

What is a dictionary?

an abstract data type made up of associated pairs

8
New cards

What is a hash table?

an associative array which is coupled with a  hash function

9
New cards

What is a stack?

a linear data structure that follows LIFO principle 

10
New cards

What is a queue?

a linear data structure/ enqueue + dequeue / items removed from top of queue

11
New cards

What is a graph?

a set of nodes that are connected by edges

12
New cards

ADV of matrix considerations in graphs

  1. convenient to work with

  2. adding an edge is simple

13
New cards

DIS of matrix considerations in graphs

a sparse graph (not many connections) will leave most cells empty and this is not storage efficient

14
New cards

What is a tree?

  • A connected undirected form of a graph with nodes and pointers 

  • An abstract data type

15
New cards

how is a directed graph different to an undirected graph?

in directed graphs, edges can only go in one direction

in undirected graphs edges can go in both directions

16
New cards

ADV + DIS of declaring an array as a global variable?

ADV = can be accessed anywhere in the program

DIS = increases memory usage as it is used until full program execution is over