WEEK 2: INTRO TO DSA

Question 1

a computational method for solving a problem; a sequence of steps that take us from the input to the output

Answer 1

algorithm

Question 2

an algorithm must be (4):

Answer 2

correct, finite, general, efficicent

Question 3

an algoritm should provide correct solution according to the specifications

Answer 3

correct

Question 4

an algorithm should terminate

Answer 4

finite

Question 5

an algorithm should work for every instance of a problem

Answer 5

general

Question 6

an algorithm should use few resources (such as time and memory)

Answer 6

efficient

Question 7

2 types of algorithm representation

Answer 7

flowchart & pseudocode

Question 8

a graphical representation of an algorithm

Answer 8

flowchart

Question 9

an english-like representation of the code required for an algorithm; it is the most common tool to define alogithms

Answer 9

pseudocode

Question 10

the first programming concept

Answer 10

nonstructured, linear programs (spaghetti code)

Question 11

in this programming concept, the logic flow wounds through the program; all processes are stored in main

Answer 11

nonstructured, linear programs

Question 12

the second concept of programming

Answer 12

modular programminbng (structured/procedural)

Question 13

programs were organized in functions, each of which is still used in a linear coding technique

Answer 13

modular programming

Question 14

the third and modern programming concept

Answer 14

object-oriented programming

Question 15

in this programming concept, the functions are developed around an object; one part of it is encapsulation, in which all processing from an object is bundled together in a library and hidden from the user

Answer 15

object-oriented programming

Question 16

3 types of statement constructs in programming

Answer 16

sequence, selection, loop

Question 17

a series of statements that do not alter the execution path within an algorithm

Answer 17

sequence

Question 18

this evaluates one or more alternative; also known as conditional statements

Answer 18

selection

Question 19

iterates a block of code

Answer 19

loop

Question 20

main difference between array & data structure

Answer 20

array is homogeneous while data structure is not

Question 21

array concept; you declare one data type to be used for the entire structure

Answer 21

homogeneous

Question 22

a way of organizing data considering not only the items stored, but also their relationship from each other

Answer 22

data structure

Question 23

an aggregation of atomic and composite data types into a set with defined relationships

Answer 23

data structure

Question 24

a combination of elements each of which is either a data type or another one of itself

Answer 24

data structure

Question 25

a group of data elements grouped together under one name

Answer 25

data structure

Question 26

a set of associations or relationships involving combined elements

Answer 26

data structure

Question 27

4 main elements of data structure

Answer 27

atomic data, composite data, data type, structure

Question 28

these are data that we choose to consider as a single, nondecomposible entity

Answer 28

atomic data

Question 29

this can be broken out into subfields that have meaning

Answer 29

composite data

Question 30

this is a set of data and the operations that can be performed on the data

Answer 30

data type

Question 31

this is a set of rules that holds data together

Answer 31

structure

Question 32

name 5 types of data structures

Answer 32

set, array, list, queue, stack

Question 33

it is a mathematical model for data types

Answer 33

abstract data type

Question 34

class of objects whose logical behavior is defined by a set of values and a set of operations

Answer 34

abstract data type

Question 35

a data declaration packaged together with the operations that are meaningful for the data type

Answer 35

abstract data type

Question 36

with this, users are not concerned with how the task is done, but rather what it can do

Answer 36

abstract data type

Question 37

this consists of a set of definitions that allow the programmers to use the functions while hiding the implementation

Answer 37

abstract data type

Question 38

this contains elements of the same type arranged in sequential order

Answer 38

list abstract data type

Question 39

this contains elements of the same type arranged in sequential order, but all operations take place at a single end that is the top of it

Answer 39

stack

Question 40

these grow and shrink during execution

Answer 40

dynamic data types

Question 41

with this, insertions and removals can be made anywhere

Answer 41

linked list

Question 42

insertions and deletions are made at the front of the structure

Answer 42

stack

Question 43

insertions are made at the back and removals made from the front of the structure

Answer 43

queues

Question 44

a high-speed searching and sorting of data and efficient elimination of duplicate data items

Answer 44

binary tree