0

Data Structure

Description: A Test to Check the Computers Fundamentals of Students
Number of Questions: 25
Created by:
Tags: Computer History Fundamentals Computer Basics Databases Programming Data Structures
Attempted 0/25 Correct 0 Score 0

What is information?

  1. A set of values

  2. A processed data

  3. A collection of record

  4. None of these


Correct Option: B

A value or set of values is called____.

  1. file

  2. entity

  3. data

  4. key


Correct Option: C

What do you mean by record?

  1. A collection of similar entities

  2. A collection of related records

  3. A collection of related items

  4. None of these


Correct Option: C

A primitive data type is a ____ data type.

  1. predefined

  2. post defined

  3. abstract

  4. none of these


Correct Option: A

A data item in a record that takes unique values and can be used to distinguish a record from other record, is called____.

  1. key

  2. information

  3. data time

  4. record


Correct Option: A

The collection of values and a set of operations that act on values is called____.

  1. abstract data type

  2. primitive data type

  3. polymorphic

  4. data type


Correct Option: D

What is a list?

  1. A collection of record which can be ordered or unordered.

  2. A collection of data type which can be ordered or unordered.

  3. A collection of different values.

  4. A collection of elements which can be ordered or unordered.


Correct Option: D

A data type that is organized in such a way that the specification of the values and the specification of the operation on these values are separated from the representation of the values and the implementation of the operation is called

  1. primitive data type

  2. polymorphic data type

  3. abstract data type

  4. none of these


Correct Option: C

____ is important because it supplies two essential pieces of information.

  1. Data typing

  2. Data hiding

  3. Data typing

  4. None of these


Correct Option: A

A data structure is a/an____of a particular organization of data.

  1. algorithm

  2. logical model

  3. analytical

  4. none of these


Correct Option: B

What is a linear data structure?

  1. The records form a sequence

  2. The files form a sequence

  3. The elements from a sequence

  4. The logics form a sequence


Correct Option: B

The pre defined data type is also known as____.

  1. set of values

  2. built-in data type

  3. polymorphic

  4. abstract data type


Correct Option: B

FIFO stands for

  1. first-out-first-in

  2. first-inner-from-out

  3. first-inter-for-offer

  4. first-in-first-out


Correct Option: D

LIFO stands for.

  1. left-in-first-off

  2. long- inbox- from- on

  3. last-in-first-out

  4. last-in-from-open


Correct Option: C

What is a stack?

  1. LIFO

  2. FILO

  3. LOFT

  4. FOLI


Correct Option: A

A data structure that represents hierarchical relationship between various elements is called

  1. tree

  2. queue

  3. heap

  4. shape


Correct Option: A

The finding of location of a given element is called____.

  1. sorting

  2. deletion

  3. searching

  4. in serration


Correct Option: C

How many children are there in a binary tree?

  1. 3

  2. 2

  3. 4

  4. 5


Correct Option: B

In doubly linked list, each node is divided into ________ parts.

  1. 4

  2. 3

  3. 5

  4. 6


Correct Option: B

A list of finite number of elements of same data type is called____.

  1. arrays

  2. data type

  3. record of file

  4. none of these


Correct Option: A

Combining the elements of two similar sorted structures into a single structure is called _____.

  1. traversal

  2. heap

  3. sorting

  4. merging


Correct Option: D

The collection of data elements is called ______.

  1. array

  2. station

  3. node

  4. none of these


Correct Option: C

In liner linked list, each node is divided into_____ parts.

  1. 5

  2. 4

  3. 3

  4. 2


Correct Option: D

In linear linked list, the first part contains the information of the element and second called ____ contains the address of the node in the list.

  1. the linked field or next pointer field

  2. the pervious pointer field

  3. the information of the element

  4. none of these


Correct Option: A

____ requires only one index to access an individual element of the array.

  1. Two-dimensional array

  2. One- dimenstrional array

  3. Multi dimensional array

  4. Single ten array


Correct Option: B
- Hide questions