ITEC33

Question 1

is a systematic way to organize data in order to use it efficiently.

Answer 1

data structure

Question 2

represents the set of operations that a data structure supports.

Answer 2

interface

Question 3

provides the internal representation of a data structure.

Answer 3

implementation

Question 4

provides the definition of the algorithms used in the operations of the data structure.

Answer 4

implementation

Question 5

Data structure implementation should implement its interface correctly.

Answer 5

correctness

Question 6

Running time or the execution time of operations of data structure must be as small as possible.

Answer 6

time complexity

Question 7

Memory usage of a data structure operation should be as little as possible.

Answer 7

space complexity

Question 8

characteristics of data structure

Answer 8

correctness, time complexity, space complexity

Question 9

need for data structure

Answer 9

data search,
processor speed,
multiple request

Question 10

This is the scenario where a particular data structure operation takes maximum time

Answer 10

worst case

Question 11

This is the scenario depicting the average execution time of an operation of a data structure

Answer 11

average case

Question 12

This is the scenario depicting the least possible execution time of an operation of a data structure.

Answer 12

best case

Question 13

values or set of values

Answer 13

data

Question 14

refers to a single unit of values

Answer 14

data item

Question 15

data items that are divided into sub items

Answer 15

group items

Question 16

data items that cannot be divided

Answer 16

elementary items

Question 17

an entity which contains certain attributes or properties

Answer 17

attribute and entity

Question 18

entities of similar attributes

Answer 18

entity set

Question 19

is a single elementary unit of information representing an attribute of an entity

Answer 19

field

Question 20

is a collection of field values of a given entity

Answer 20

record

Question 21

is a collection of records of the entities in a given entity set

Answer 21

file

Question 22

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

Answer 22

algorithm

Question 23

uses of algorithms

Answer 23

computer science
mathematics
operations research
artificial intelligence
data science

Question 24

important categories of algorithm

Answer 24

search
sort
insert
update
delete

Question 25

characteristics of an algorithm

Answer 25

unambiguous input output finiteness feasibility independent

Question 26

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

Answer 26

unambiguous

Question 27

Algorithms must terminate after a finite number of steps.

Answer 27

finiteness

Question 28

types of algorithms

Answer 28

brute force algorithm recursive algorithm backtracking algorithm searching algorithm sorting algorithm hashing algorithm divide and conquer algorithm greedy algorithm dynamic algorithm randomized algorithm

Question 29

This is a theoretical analysis of an algorithm.

Answer 29

priori analysis

Question 30

This is an empirical analysis of an algorithm.

Answer 30

posteriori analysis

Question 31

measured by counting the number of key operations such as comparisons in the sorting algorithm.

Answer 31

time factor

Question 32

measured by counting the maximum memory space required by the algorithm.

Answer 32

space factor

Question 33

need for algorithm

Answer 33

efficiency consistency scalability automation standardization

Question 34

Algorithms can perform tasks quickly and accurately, making them an essential tool for tasks that require a lot of calculations or data processing.

Answer 34

efficiency

Question 35

Algorithms are repeatable and produce consistent results every time they are executed. This is important when dealing with large amounts of data or complex processes.

Answer 35

consistency

Question 36

Algorithms can be scaled up to handle large datasets or complex problems, which makes them useful for applications that require processing large volumes of data.

Answer 36

scalability

Question 37

Algorithms can automate repetitive tasks, reducing the need for human intervention and freeing up time for other tasks.

Answer 37

automation

Question 38

Algorithms can be standardized and shared among different teams or organizations, making it easier for people to collaborate and share knowledge.

Answer 38

standardization

Question 39

represents the amount of time required by the algorithm to run to completion.

Answer 39

time complexity

Question 40

represents the amount of memory space required by the algorithm in its life cycle.

Answer 40

space complexity

Question 41

components of space complexity

Answer 41

fixed part variable part

Question 42

is a space required to store certain data and variables, that are independent of the size of the problem.

Answer 42

fixed part

Question 43

is a space required by variables, whose size depends on the size of the problem.

Answer 43

variable part

Question 44

refers to defining the mathematical boundation /framing of its run-time performance.

Answer 44

asymptotic analysis

Question 45

refers to computing the running time of any operation in mathematical units of computation.

Answer 45

asymptotic analysis

Question 46

commonly used asymptotic notations

Answer 46

big oh notation theta notation omega notation

Question 47

formal way to express the upper bound of an algorithm's running time.

Answer 47

big oh notation

Question 48

formal way to express both the lower bound and the upper bound of an algorithm's running time.

Answer 48

theta notation

Question 49

formal way to express the lower bound of an algorithm's running time.

Answer 49

omega notation

Question 50

the closest solution that seems to provide an optimum solution is chosen.

Answer 50

greedy algorithm

Question 51

greedy algorithms example

Answer 51

travelling salesman problem graph - map coloring graph - vertex cover and more hehe

Question 52

it is divided into smaller sub-problems and then each problem is solved independently.

Answer 52

divide and conquer approach

Question 53

examples of divide and conquer approach

Answer 53

merge sort quick sort binary search and more hehe katamad ilagay yung iba eh

Question 54

These sub-problems are not solved independently. Results of these smaller sub-problems are remembered and used for similar or overlapping sub-problems.

Answer 54

dynamic programming approach

Question 55

(dynamic or greedy) sub problems are solved first

Answer 55

dynamic

Question 56

(dynamic or greedy) top-down approach

Answer 56

greedy

Question 57

(dynamic or greedy) bottom-up approach

Answer 57

dynamic

Question 58

example of dynamic programming approach

Answer 58

Fibonacci number series Tower of Hanoi Project scheduling and more... hehe lam mo na

Question 59

is a sequence of data structures, which are connected together via links.

Answer 59

linked list

Question 60

Each link of a linked list can store a data called _______

Answer 60

element

Question 61

type of linked list

Answer 61

simple doubly circular

Question 62

item can be navigated forward only

Answer 62

simple linked list

Question 63

items can be navigated forward and backward

Answer 63

doubly linked list

Question 64

Last item contains link of the first element as next and the first element has a link to the last element as previous

Answer 64

circular linked list

Question 65

basic operations supported by a list

Answer 65

insertion deletion display search delete

Question 66

basic operations in doubly linked list

Answer 66

insertion deletion insert last delete last insert after delete display forward display backward

Question 67

basic operations of circular linked list

Answer 67

insert delete display

Question 68

simplest approach to a problem

Answer 68

brute force algorithm

Question 69

a problem is broken into several sub-parts and called the same function again and again

Answer 69

recursive algorithm

Question 70

builds the solution by searching among all possible solutions

Answer 70

backtracking algorithm

Question 71

the ones that are used for searching or groups of elements from a particular data structure

Answer 71

searching algorithms

Question 72

arranging a group of data in a particular manner according to the requirement

Answer 72

sorting algorithm

Question 73

work similarly to the searching algorithm but the contain an index with a key ID

Answer 73

hashing algorithm

Question 74

breaks a problem into sub-problems, solves a single sub-problem and merges the solutions to get the final solution

Answer 74

divide and conquer algorithm

Question 75

divide and conquer algorithm steps

Answer 75

divide solve combine

Question 76

the solution is built part-by-part

Answer 76

greedy algorithm

Question 77

uses the concept of using the already found solution to avoid repetitive calculation of the same part of the problem

Answer 77

dynamic algorithm

Question 78

use a random number so it gives immediate benefit

Answer 78

randomized algorithm

Question 79

smallest possible sub-problem is solved

Answer 79

atomic