Module 1

Question 1

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

Answer 1

Data structure

Question 2

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

Answer 2

data structure

Question 3

affects the design of both

structural & functional aspects of a program.

Answer 3

Data structure

Question 4

is a step by step

procedure to solve a particular function.

Answer 4

algorithm

Question 5

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.

Answer 5

algorithm

Question 6

Data structures are normally

divided into two broad categories:

Answer 6

• Primitive Data Structure

* Non-Primitive Data Structure

Question 7

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

Answer 7

Primitive Data Structure

Question 8

These are basic structures and directly operated

upon by the machine instructions.

Answer 8

Primitive Data Structure

Question 9

These are more sophisticated data structures.

Answer 9

Non-Primitive Data Structure

Question 10

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

Answer 10

non-primitive data structures

Question 11

2 types of non-primitive data structures

Answer 11

linear list

non-linear list

Question 12

in X data structure, values are arrange in

linear fashion.

Answer 12

linear data structure

linear list

Question 13

an ordered list that have a fixed-size

Answer 13

array

Question 14

an ordered list that have variable-size

Answer 14

linked-list

Question 15

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

Answer 15

stack

Question 16

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

Answer 16

queue

Question 17

add anywhere, remove the highest priority linear data structure

Answer 17

priority queue

Question 18

The data values in this structure are not

arranged in order.

Answer 18

non-linear list (data structure)

Question 19

unordered lists which use a hash function to insert and search

Answer 19

hash table

Question 20

an unordered list where data is organized in branches

Answer 20

tree

Question 21

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

Answer 21

graph

Question 22

types of data structures

Answer 22

homogenous, non-homogenous

Question 23

In this type of data structure,

values of the same types of data are stored.

Answer 23

Homogenous:

Question 24

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

Answer 24

Non-Homogenous:

Question 25

structures and classes are examples of a X data structure

Answer 25

non-homogenous

Question 26

The choice of particular data model depends on

two consideration:

Answer 26

rich enough, simple enough

Question 27

data type that separates
the logical properties from the implementation
details

Answer 27

Abstract data type (ADT):

Question 28

•Separating design details from usage
•Separating the logical properties from the
implementation details

Answer 28

Abstraction

Question 29

stores data and allow
various operations on the data to access and
change it.

Answer 29

Abstract Data Types (ADTs)

Question 30

A mathematical model, together with various

operations defined on the X

Answer 30

model

Question 31

is a collection of data and associated

operations for manipulating that data

Answer 31

Abstract Data Types (ADTs)

Question 32

support abstraction, encapsulation,

and information hiding

Answer 32

Abstract Data Types (ADTs)

Question 33

is providing only essential

information outside the world

Answer 33

Abstraction

Question 34

is binding the data, and the

functions that use them

Answer 34

Encapsulation