It refers to collection of variables, possibly of several different data types connected in various ways.

• Data Structures
• Database
• Arrays
• Abstraction

Which of the following is NOT a Type of Data Structures?

• Arrays
• Tables
• Stacks
• Trees

Data that a variable can hold in a programming language, all programming language has a set of it.

• Data Types
• Algorithms
• Programming
• Variables

Storage for data defined in terms of set of operations to be performed on the data 

• Arrays
• Variables
• Abstract Data Types
• Algorithms

Finite set of instructions that specify a sequence of operations to be carried out 

• Algorithms
• Procedure
• Flowcharting
• Pseudocodes

Are the data items presented to the algorithm. An algorithm has either no input or a predetermined number of them.

• Input
• Output
• Procedure
• Data

Are the data items presented to the outside world as the result of the execution of a program based on the algorithm.

• Input
• Output
• Procedure
• Raw Data

It can be used to encapsulate parts of an algorithm by localizing in one section of a program all the statements relevant to a certain aspect of a program.

• Algorithms
• Pseudocodes
• Flowcharting
• Procedures

Which of the following statements is NOT TRUE about PSEUDOCODES?

• textual presentation of a flowchart
• close to a natural language
• the control structures impose the logic
• None of the choices

The process by which a programmer refines an initial idea to a problem's solution into more specific terms.

• Flowcharting
• Algorithms
• Pseudocodes
• Stepwise Refinement