2. Fundamentals of Data Structures Flashcards

1
Q

How many pointers do linear queues have?

A

2, front and rear

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

FIFO stands for?

A

first in, first out

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

Which abstract data structure operate on a FILO basis?

A

stacks

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

hows is translation of vectors achieved?

A

vector addition

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

What type of data structures are fixed in size?

A

static

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

What is a dictionary?

A

a collection of key-value pairs

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

What occurs when two values produce the same hash?

A

a collision

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

What is meant by a tree?

A

Connected, undirected graph with no cycles

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

Procedure that removes an item from a stack?

A

Pop

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

Procedure which adds an items to a stack?

A

Push

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

Define array…?

A

a finite, indexed set of related elements which have the same data type

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