Lesson 1.4: Data Structures Flashcards

1
Q

Is a logical model of a particular organization of data. The programs have to follow certain rules to access and process the structured data.

A

data structure

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

data structure is represented as:

A

Organized Data + Allowed Operations = Data structure (ODAO)

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

Advantages of Data Structures

A

Efficiency, Reusability and Abstraction

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

The (2) types of data structures are:

A

Linear and Non-Linear Data Structures

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

The elements of these data structures form a sequence, i.e. linear list. Common examples are arrays, linked lists, stacks, and queues.

A

Linear Data Structures

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

The elements do not form a sequence. Common examples are trees and graphs.

A

Non-Linear Data Structures

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

The organization of the data in a way so that it can be used efficiently.

A

Data Structures

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

When a program runs, some memory blocks are allocated to them.

A

Memory Allocation

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

Memory is allocated to the entities by the Operating System. Once the memory blocks are allocated to the entities, they remain reserved till the end of the program.

A

Static memory allocation

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

Memory is allocated dynamically to the entities of the program. Programmer has freedom to allocate and free the memory for the program entities.

A

Dynamic memory allocation

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