DATA STRUCTURE Basic Info

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

• Data Structures

• Database

• Arrays

• Abstraction

The process of accessing data stored in a serial access memory is similar to manipulating data on a/an:

• Array

• BInary Tree

• Heap

• Stack

Which of the following data structure store the homogeneous data elements?

• Records

• Arrays

• Lists

• Pointers

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

• Arrays

• Tables

• Stacks

• Trees

Which of the following data structures CANNOT store the non-homogeneous data elements?

• Pointers

• Array

• Records

• Stack

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

• Programming

• Algorithms

• Data Types

• Variables

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

• Arrays

• Variables

• Abstract Data Types

• Algorithms

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

• Data

• Procedure

• Output

• Input

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

• Input

• Procedure

• Output

• Raw data

The number of edges from the node to the deepest leaf is called ___ of the tree.

• Depth

• Height

• Length

• Width