DS Basics Flashcards

1
Q

A __________________ is a way to store and organize data to facilitate access and modifications

A

Data Structure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Gives us the algorithms to support operations

A

Data Structure

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Two Main DS Approaches

A

Arrays and Linked lists

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

is a collection of same data type elements stored at contiguous
memory locations

A

Array

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

An array is a collection of same data type elements stored at __________ memory locations

A

contiguous

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

How array is represented in memory

A

array[i] = memory[address(array) + i]

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Characteristics of Array

A

easy to implement
fast random access
fixed size

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

A collection of dynamic variables linked together to form a chain-like structure

A

Linked Lists

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

A linked list is collection of ___________ variables linked together to form a _____________ structure

A

dynamic, chain-like

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Characteristics of Linked Lists

A

more complex
sequential access
dynamic size

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

A mathematical model, together with various operations defined in the model

A

Abstract Data Types (ADTs)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

A sequence of elements of the same type

A

List ADT

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly