Fundamentals of Data Structure and Algorithms

Question 1

special format for storing and organizing data

Answer 1

data structure

Question 2

2 types of data structure:

Answer 2

linear and non-linear

Question 3

a type of data structure where elements are accessed in sequential order

Answer 3

linear

Question 4

a type of data structure where elements are accessed in non-sequential order

Answer 4

non-linear

Question 5

logical description of how data is viewed as well as the operations that are allowed without regard to how they will be implemented.

Answer 5

abstract data type (ADT)

Question 6

benefits of using ADT:

Answer 6

code is easier to understand, implementations can be changed without requiring changed to the program that uses ADT, and this can be used in future programs

Question 7

2 parts of abstract data type:

Answer 7

public or external and private or internal

Question 8

data and the operations

Answer 8

public or external ADT

Question 9

representations and implementations

Answer 9

private or internal ADT

Question 10

9 abstract data types:

Answer 10

linked list
stack
queue
tree
priority queue
heap
set
map
graph

Question 11

storing elements where each is a separate object

Answer 11

linked list

Question 12

last element added is the first element retrieved or removed

Answer 12

stack

Question 13

first element added is the first element retrieved or removed

Answer 13

queue

Question 14

hierarchical nature of a structure in a graphical form

Answer 14

tree

Question 15

elements are processed based on their order

Answer 15

priority queue

Question 16

binary tree where the value of each parent node is either higher or lower than the value of its child nodes

Answer 16

heap

Question 17

collections of elements where each element is unique

Answer 17

set

Question 18

set of ordered pairs where elements are known as keys (identifiers) and values (content)

Answer 18

map

Question 19

graph

Answer 19

consists of a set of vertices (nodes) and a set of edges (relations) between the pair of vertices

Question 20

4 main operations of ADT:

Answer 20

initializing, adding, accessing, removing of data

Question 21

set of instruction to be executed in sequence for solving a problem

Answer 21

algorithm

Question 22

characteristics of an algorithm:

Answer 22

finiteness, definiteness, input, output, uniqueness

Question 23

a characteristic of an algorithm where it must terminate after a specified number of steps

Answer 23

finiteness

Question 24

a characteristic of an algorithm where instructions has to be clear and unambiguous

Answer 24

definiteness

Question 25

a characteristic of an algorithm where it should have zero or more well-defined data given before the algorithm starts

Answer 25

input

Question 26

a characteristic of an algorithm where it must have zero or more results

Answer 26

output

Question 27

a characteristic of an algorithm where the result of each step depends on the input and/or the result of the previous step

Answer 27

uniqueness

Question 28

elements of an algorithm:

Answer 28

sequential operations, actions based on the state of a data structure, iteration, recursion

Question 29

repeating an action multiple times

Answer 29

iteration

Question 30

function that calls itself once or multiple times to solve a problem

Answer 30

recursion

Question 31

algorithm design paradigms:

Answer 31

divide and conquer, greedy algorithms, dynamic programming