INTRODUCTION

Question 1

defines a particular data with the
following characteristics

Answer 1

DATA

Question 2

refer to the data that a variable can hold in
a programming language.

Answer 2

Data Object

Question 3

3 CRITERIAS OF DATA OBJECT

Answer 3

ATOMIC
TRACEABLE
ACCURATE

Question 4

definition should be defined a
single concept

Answer 4

ATOMIC

Question 5

should be able to
mapped to some data element

Answer 5

TRACEABLE

Question 6

should be
unambiguous and understandable.

Answer 6

ACCURATE

Question 7

Specialized format to store and organize data in a computer’s memory or disk

Answer 7

DATA STRUCTURES

Question 8

Collection of variables, possibly of several different data types connected in various ways.

Answer 8

DATA STRUCTURES

Question 9

TYPES OF DATA STRUCTURES

Answer 9

ARRAY
LINKED LIST
STACKS
TREES
SORTING
HASH TABLES

Question 10

BASIC OPERATIONS OF DATA STRUCTURES

Answer 10

TRAVERSING
SEARCHING
INSERTION
DELETION
SORTING
MERGING

Question 11

All data structures can be classified as

Answer 11

primitive or aggregate

Question 12

simple kind of data structure stores single data items.

Answer 12

PRIMITIVE

Question 13

Many data structures are capable of
storing multiple data items.

Answer 13

AGGREGATE

Question 14

data structures in which data elements are arranged sequentially or linearly,

Answer 14

LINEAR

Question 15

HAS A FIXED MEMORY SIZE

Answer 15

Static

Question 16

THE SIZE IS NOT FIXED

Answer 16

DYNAMIC

Question 17

elements are not placed
sequentially or linearly

Answer 17

NON-LINEAR

Question 18

The user does not need to know the
implementation of the data structure.

Answer 18

ABSTRACTION

Question 19

ADT gives us a better
conceptualization of the real world.

Answer 19

BETTER CONCEPTUALIZATION

Question 20

The program is robust and has the ability to catch errors.

Answer 20

ROBUST

Question 21

The process of providing only the
essential and hiding the details.

Answer 21

ABSTRACTION

Question 22

a technique of combining the
data and the member function in a single unit

Answer 22

ENCAPSULATION

Question 23

must terminate after a finite
number of steps.

Answer 23

FINITENESS

Question 24

an algorithm should have 0 or more
well-defines inputs.

Answer 24

INPUT

Question 25

is a step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output.

Answer 25

ALGORITHM

Question 26

should have step-by-step directions, which should be independent of any programming code.

Answer 26

INDEPENDENT

Question 27

CHARACTERISTICS OF ALGO

Answer 27

FINITENESS INPUT INDEPENDENT FEASIBILITY OUTPUT UNAMBIGUOUS

Question 28

should be feasible with the available resources.

Answer 28

FEASIBILITY

Question 29

Should have 1 or more well-defined outputs, and match the desired output.

Answer 29

OUTPUT

Question 30

each of its steps (or phases), and their inputs/outputs should be clear and must lead to only one meaning.

Answer 30

UNAMBIGUOUS

Question 31

determine the amount of resources necessary to execute it such as time and storage.

Answer 31

MEASUREMENT OF COMPLEXITY

Question 32

DEFINES WHETHER THE SET OF FUNCTIONS WILL GROW FASTER OR AT THE SAME RATE AS THE EXPRESSION.

Answer 32

OMEGA NOTATION Best-case Analysis

Question 33

DEFINES WHEN THE SET OF FUNCTIONS LIES IN BOTH O (EXPRESSION) AND OMEGA (EXPRESSION).

Answer 33

THETA NOTATION Average-case Analysis

Question 34

DETERMINES THE SET OF FUNCTIONS GROWS SLOWER

Answer 34

BIG-O NOTATION Worst-case Analysis

Question 35

is textual representation of flowchart.

Answer 35

PSEUDOCODE