Module 1 Flashcards

1
Q

is representation of the logical
relationship existing between individual elements
of data.

A

Data structure

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

is a way of
organizing all data items that considers not only
the elements stored but also their relationship to
each other.

A

data structure

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

affects the design of both

structural & functional aspects of a program.

A

Data structure

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

is a step by step

procedure to solve a particular function.

A

algorithm

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

is a set of instruction written
to carry out certain tasks & the data structure is the
way of organizing the data with their logical
relationship retained.

A

algorithm

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

Data structures are normally

divided into two broad categories:

A
  • Primitive Data Structure

* Non-Primitive Data Structure

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

Integer, Floating-point number, Character
constants, string constants, pointers etc, fall in
this category.

A

Primitive Data Structure

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

These are basic structures and directly operated

upon by the machine instructions.

A

Primitive Data Structure

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

These are more sophisticated data structures.

A

Non-Primitive Data Structure

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

emphasize on
structuring of a group of homogeneous (same
type) or heterogeneous (different type) data items.

A

non-primitive data structures

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

2 types of non-primitive data structures

A

linear list

non-linear list

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

in X data structure, values are arrange in

linear fashion.

A

linear data structure

linear list

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

an ordered list that have a fixed-size

A

array

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

an ordered list that have variable-size

A

linked-list

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

an ordered list that adds to the top and removes from the top

A

stack

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

an ordered list that adds to the back and removes from the front

17
Q

add anywhere, remove the highest priority linear data structure

A

priority queue

18
Q

The data values in this structure are not

arranged in order.

A

non-linear list (data structure)

19
Q

unordered lists which use a hash function to insert and search

A

hash table

20
Q

an unordered list where data is organized in branches

21
Q

an unordered list where there is a more general branching structure witch less strict connection conditions than for a tree

22
Q

types of data structures

A

homogenous, non-homogenous

23
Q

In this type of data structure,

values of the same types of data are stored.

A

Homogenous:

24
Q

In this type of data structure,
data values of different types are grouped and
stored.

A

Non-Homogenous:

25
structures and classes are examples of a X data structure
non-homogenous
26
The choice of particular data model depends on | two consideration:
rich enough, simple enough
27
data type that separates the logical properties from the implementation details
Abstract data type (ADT):
28
•Separating design details from usage •Separating the logical properties from the implementation details
Abstraction
29
stores data and allow various operations on the data to access and change it.
Abstract Data Types (ADTs)
30
A mathematical model, together with various | operations defined on the X
model
31
is a collection of data and associated | operations for manipulating that data
Abstract Data Types (ADTs)
32
support abstraction, encapsulation, | and information hiding
Abstract Data Types (ADTs)
33
is providing only essential | information outside the world
Abstraction
34
is binding the data, and the | functions that use them
Encapsulation