Data Structures Flashcard 1

Front

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

Back

Data Structures

Front

Which of the following is NOT a Type of Data Structures? Arrays, Tables, Stacks, Trees

Back

Tables

Front

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

Back

Data Types

Front

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

Back

Abstract Data Types

Front

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

Back

Algorithms

Front

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

Back

Input

Front

Are the data items presented to the outside world as the result of the execution of a program based on the algorithm? Options: Input, Output, Procedure, Raw Data

Back

Output

Front

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.

Back

Procedures

Front

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

Back

None of the choices

Front

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

Back

Stepwise Refinement