ITEC33 (Ma'am Pamintuan)

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 list of supported operations, type of parameters they can accept and return type of these operations.

Answer 3

Interface

Question 4

provides the internal representation of a data structure.

Answer 4

Implementation

Question 5

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

Answer 5

Implementation

Question 6

Data structure implementation should implement its interface correctly.

Answer 6

Correctness

Question 7

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

Answer 7

Time Complexity

Question 8

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

Answer 8

Space Complexity

Question 9

Consider an inventory of 1 million(106) items of a store. If the application is to search an item, it has to search an item in 1 million(106) items every time slowing down the search. As data grows, search will become slower.

Answer 9

Data Search

Question 10

although being very high, falls limited if the data grows to billion records.

Answer 10

Processor Speed

Question 11

As thousands of users can search data simultaneously on a web server, even the fast server fails while searching the data.

Answer 11

Multiple Requests

Question 12

This is the scenario where a particular data structure operation takes maximum time it can take. If an operation’s worst case time is ƒ(n) then this operation will not take more than ƒ(n) time, where ƒ(n) represents function of n.

Answer 12

Worst Case

Question 13

This is the scenario depicting the average execution time of an operation of a data structure. If an operation takes ƒ(n) time in execution, then m operations will take mƒ(n) time.

Answer 13

Average Case

Question 14

This is the scenario depicting the least possible execution time of an operation of a data structure. If an operation takes ƒ(n) time in execution, then the actual operation may take time as the random number which would be maximum as ƒ(n).

Answer 14

Best Case

Question 15

are values or set of values.

Answer 15

Data

Question 16

refers to single unit of values.

Answer 16

Data item

Question 17

Data items that are divided into sub items

Answer 17

Group Items.

Question 18

Data items that cannot be divided

Answer 18

Elementary Items.

Question 19

An entity is that which contains certain attributes or properties, which may be assigned values.

Answer 19

Attribute and Entity

Question 20

Entities of similar attributes form an entity set.

Answer 20

Entity Set

Question 21

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

Answer 21

Field

Question 22

is a collection of field values of a given entity.

Answer 22

Record

Question 23

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

Answer 23

File

Question 24

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

Answer 24

Algortihm

Question 25

Algorithms form the basis of computer programming and are used to solve problems ranging from simple sorting and searching to complex tasks such as artificial intelligence and machine learning.

Answer 25

Computer Science

Question 26

Algorithms are used to solve mathematical problems, such as finding the optimal solution to a system of linear equations or finding the shortest path in a graph.

Answer 26

Mathematics

Question 27

Algorithms are used to optimize and make decisions in fields such as transportation, logistics, and resource allocation.

Answer 27

Operations Research

Question 28

Algorithms are the foundation of artificial intelligence and machine learning, and are used to develop intelligent systems that can perform tasks such as image recognition, natural language processing, and decision-making.

Answer 28

Artificial Intelligence

Question 29

Algorithms are used to analyze, process, and extract insights from large amounts of data in fields such as marketing, finance, and healthcare.

Answer 29

Data Science

Question 30

are necessary for solving complex problems efficiently and effectively. 

Answer 30

Algortihm

Question 31

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

Answer 31

Unambiguous

Question 32

It is the simplest approach to a problem. A brute force algorithm is the first approach that comes to finding when we see a problem.

Answer 32

Brute Force Algorithm

Question 33

is based on recursion. In this case, a problem is broken into several sub-parts and called the same

Answer 33

Recursive Algorithm

Question 34

builds the solution by searching among all possible solutions. Using this algorithm, we keep on building the solution following criteria. Whenever a solution fails we trace back to the failure point build on the next solution and continue this process till we find the solution or all possible solutions are looked after.

Answer 34

Backtracking Algorithm

Question 35

are the ones that are used for searching elements or groups of elements from a particular data structure. They can be of different types based on their approach or the data structure in which the element should be found.

Answer 35

Searching Algorithm

Question 36

Sorting is arranging a group of data in a particular manner according to the requirement -are used to sort groups of data in an increasing or decreasing manner.

Answer 36

Sorting Algorithm

Question 37

work similarly to the searching algorithm. But they contain an index with a key ID. In hashing, a key is assigned to specific data.

Answer 37

Hashing Algorithm

Question 38

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

Answer 38

Divide and Conquer Algorithm

Question 39

In this type of algorithm, the solution is built part by part. The solution for the next part is built based on the immediate benefit of the next part. The one solution that gives the most benefit will be chosen as the solution for the next part.

Answer 39

Greedy Algorithm

Question 40

This algorithm uses the concept of using the already found solution to avoid repetitive calculation of the same part of the problem. It divides the problem into smaller overlapping subproblems and solves them.

Answer 40

Dynamic Programming Algorithm

Question 41

we use a random number so it gives immediate benefit. The random number helps in deciding the expected outcome.

Answer 41

Randomized Algorithm

Question 42

This is a theoretical analysis of an algorithm. Efficiency of an algorithm is measured by assuming that all other factors, for example, processor speed, are constant and have no effect on the implementation.

Answer 42

A Priori  Analysis 

Question 43

This is an empirical analysis of an algorithm. The selected algorithm is implemented using programming language. This is then executed on target computer machine. In this analysis, actual statistics like running time and space required, are collected.

Answer 43

A Posteriori Analysis 

Question 44

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

Answer 44

Time Factor 

Question 45

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

Answer 45

Space Factor

Question 46

to specify a block of C++ code to be executed if a condition is true.

Answer 46

if statement

Question 47

to specify a block of code to be executed if the condition is false

Answer 47

else statement

Question 48

to specify a new condition if the first condition is false.

Answer 48

else if statement

Question 49

to select one of many code blocks to be executed.

Answer 49

switch statement

Question 50

loops through a block of code as long as a specified condition is true

Answer 50

While loop

Question 51

is a variant of the while loop. This loop will execute the code block once, before checking if the condition is true, then it will repeat the loop as long as the condition is true.

Answer 51

Do/While Loop

Question 52

When you know exactly how many times you want to loop through a block of code

Answer 52

For loop

Question 53

is a header file library that lets us work with input and output objects, such as cout. Header files add functionality to C++ programs.

Answer 53

#include

Question 54

means that we can use names for objects and variables from the standard library.

Answer 54

using namespace std

Question 55

This is called a function. Any code inside its curly brackets {} will be executed.

Answer 55

int main()

Question 56

is an object used together with the insertion operator (<<) to output/print text. cin >> store/input a value(uses extraction operator)

Answer 56

cout

Question 57

ends the main function.

Answer 57

return0

Question 58

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

Answer 58

Time Complexity

Question 59

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

Answer 59

Space Complexity

Question 60

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

Answer 60

fixed part

Question 61

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

Answer 61

variable part

Question 62

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

Answer 62

Asymptotic analysis

Question 63

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

Answer 63

Asymptotic analysis

Question 64

is the formal way to express the upper bound of an algorithm's running time. It measures the worst case time complexity or the longest amount of time an algorithm can possibly take to complete.

Answer 64

O(n) or Big Oh notation

Question 65

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

Answer 65

Theta Notation, or θ(n)

Question 66

is the formal way to express the lower bound of an algorithm's running time. It measures the best case time complexity or the best amount of time an algorithm can possibly take to complete.

Answer 66

Omega Notation, or Ω(n)

Question 67

An algorithm is designed to achieve optimum solution for a given problem. -the closest solution that seems to provide an optimum solution is chosen.

Answer 67

Greedy Algorithm

Question 68

the problem in hand, is divided into smaller sub-problems and then each problem is solved independently.

Answer 68

Divide and conquer approach

Question 69

smallest possible sub-problem (fractions) are solved.

Answer 69

atomic

Question 70

is similar to divide and conquer in breaking down the problem into smaller and yet smaller possible sub-problems. -But unlike, divide and conquer, these sub-problems are not solved independently. Rather, results of these smaller sub-problems are remembered and used for similar or overlapping sub-problems.

Answer 70

Dynamic Programming

Question 71

is used where we have problems, which can be divided into similar sub-problems, so that their results can be re-used.

Answer 71

Dynamic Programming

Question 72

allows us to execute a statement or group of statements multiple times

Answer 72

loop statement

Question 73

In this type of loop, the test condition is tested before entering the loop body.

Answer 73

Entry Controlled loops

Question 74

In this type of loop the test condition is tested or evaluated at the end of the loop body. Therefore, the loop body will execute at least once, irrespective of whether the test condition is true or false.

Answer 74

Exit Controlled Loops

Question 75

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

Answer 75

linked list

Question 76

Each link of a linked list can store a data called an element.

Answer 76

Link

Question 77

Each link of a linked list contains a link to the next link

Answer 77

Next

Question 78

contains the connection link to the first link called First.

Answer 78

LinkedList

Question 79

Item navigation is forward only.

Answer 79

Simple Linked List

Question 80

Items can be navigated forward and backward.

Answer 80

Doubly Linked List

Question 81

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

Answer 81

Circular Linked List