QUIZ NO.

1
1. What is the best storage example that we are currently using which describes the
data structures?
A. hard disk
B. flash drive
C. google drive
D. compaq disk

2. Which concepts is best described for data processing cycle?

A. input, process, output
B. input data, process information, output data
C. inputs, stores results
D. none of the above

3. It refers to the raw facts and it needs to be processed to have better resut.
A. information
B. data
C. structures
D. data structures

4. It refers to the results of processing.

A. information
B. data
C. structures
D. data structures

5. It refers to a scheme for organizing data, or in other words a data structure is an

arrangement of data in computer's memory in such a way that it could make the data
quickly available to the processor for required calculations?
A. information
B. data
C. structures
D. data structures

6. It is a set of values from which a variable, constant, function, or other expression may
take its value.
A. information
B. data types
 C. structures
D. data structures

7. It is the most basic data type which is usually declared according to the syntax rule of
a programming language.
A. simple type
B. data types
C. composite type
D. data structures

8. It refers to the format on how to use each command in every programming language.
A. logical
B. syntax
C. semantics
D. data types

9. It refers to the meaning of a command used in every programming language.

A. logical
B. syntax
C. semantics
D. data types

10. It represents integers or whole numbers where in the maximum or minimum value is
the unit of data that a computer can process at one time and is determined by the length
of one word.
A. Integer
B. String
C. Character
D. Real

11. It holds several characters and usually enclosed with double quotation.
A. Integer
B. String
C. Character
D. Real

12. It means any implementation of data in which the implementation details are hidden
(abstracted) from the user
A. encapsulation
B. inheritance
 C. polymorphism
D. abstraction

13. It refers to the address that are allocated in a main memory unit. Pointer types are
used to refer to variables, file records, or functions.
A. pointer type
B. enumeration type
C. abstract data type
D. logical type

14. It refers to the address that are allocated in a main memory unit. Pointer types are
used to refer to variables, file records, or functions.
A. pointer type
B. enumeration type
C. abstract data type
D. logical type

15. It refers to information hiding on the level of data type?

A. abstraction
B. encapsulation
C. polymorphism
D. inheritance
 QUIZ NO.2
1. It is the theoretical study of computer program's performance and resource usage.
A. Data Structure
B. Database
C. Algorithm Analysis
D. Object Oriented Programming

2. It is a finite set of instructions or logic, written in order, to accomplish a certain

predefined task.
A. Algorithm
B. Flowchart
C. Pseudo Code
D. Data Structure

3. It is textual representation that describe the flow of the program.

A. Algorithm
B. Flowchart
C. Pseudo Code
D. Data Structure

4. It is a symbolic representation used to describe the flow of the instructions in the

program.
A. Algorithm
B. Flowchart
C. Pseudo Code
D. Data Structure

5. It is an algorithm criteria which are externally supplied taken from a set of objects
called the domain of the algorithm.
A. effectiveness
B. output
C. process
D. input

6. It refers to each instruction must be clear and unambiguous, meaning each step of an
algorithm must be precisely defined.
A. Effectiveness
B. Definiteness
 C. Finiteness
D. reliability

7. It is an algorithm criteria which will terminate the program after a finite number of
steps.
A. Effectiveness
B. Definiteness
C. Finiteness
D. reliability

8. In this scenario, the algorithm is executed, the fewest number of instructions are
executed.
A. worst case
B. best case
C. Average case
D. good case

9. In this scenario, it refers to which the algorithm produces path lengths that are always
a maximum.
A. worst case
B. best case
C. Average case
D. good case

10. It is most commonly estimated by counting the number of elementary steps (we call
this frequency count) performed by any algorithm to finish execution.
A. Space Complexity
B. Algorithm Analysis
C. Time Complexity
D. Data Structure

11. It is the amount of working storage an algorithm need.

A. Space Complexity
B. Algorithm Analysis
C. Time Complexity
D. Data Structure

12. It is the set of functions that grow slower than or at the same rate as expression.
A. Theta(expression)
B. O(expression)
 C. Omega(expression)
D. Little Oh(expression)

13. It is a measure of the amount of computing resources that a particular algorithm

consumes when it runs.
A. Space Complexity
B. Time Complexity
C. Algorithm Analysis
D. Complexity Theory

14. It refers to the individual operations in the program.

A. variable
B. identifiers
C. lines of codes
D. keywords

15. Operation is based on the length of data to be executed.

A. O(n)2
B. n(O)
C. O(n)
D. O(N)/2
 QUIZ NO.3
1. Single Array: Compute the memory address of the following elements of an Array.
Given the base address of an array B[1000.....2500] as 1050 and size of each element
is 2 bytes in the memory. Find the address of B[1500].
Using this formula: Address of A[X] = B + W * (X – LB)
A. 2100
B. 2050
C. 2150
D. 2200

2. Two Dimensional Array: Compute the memory address of the following elements of
an Array.
Note: The base address is 106 and the interval value store 1 element is 2.

A. 114
B. 116
C. 112
D. 118
3. Two Dimensional Array: Compute the memory address of the following elements of
an Array.
Note: The base address is 104 and the interval value store 1 element is 2.

A. 118
B. 112
C. 120
D. 114

QUIZ NO.4
1.
 Option 1: Option 2:

Option 3: Option 4:

2.

Option 1: Option 2:
 Option 3: Option 4:

QUIZ NO.5
1. What method in the program that is used to insert an item in the stack? Note use
capital letters.
Ans: _____________________________________

2. What words stand for the acronym LIFO? (Note: Use all capital letters)
Ans: _____________________________________

3. What operation in the stack used to remove an item.

Ans: _____________________________________

4. What operation is used to insert an item on top of the stack.

Ans: _____________________________________

5. It is used to return top element of stack.

Ans: _____________________________________

6. TRANS***FOR**MAT***IONAL_DEVEL***OPMEN***TAL**********

A. TRFIO
B. TRFI
C. TRF
D. TR

7. SYN**TAC*TIC_D**ATA_A**NALY**SIS********

A. STAT
B. STATI
C. STA
D. STATIC