## Data Structure

1

Which data structure is defined as a collection of similar data elements?

Arrays

Linked lists

Stack

Queue

2

The data structure used in hierarchical data model is?

Graphs

Stack

Linked Lists

Tree

3

Data is a collection or set of values?

TRUE

FALSE

4

Files is a collection of Data elements?

TRUE

FALSE

5

Data Structures is used to store and organize data in such a way that it can be remove easily?

TRUE

FALSE

6

A program is efficient if it takes less time and space to execute?

TRUE

FALSE

7

Record is a collection of data?

TRUE

FALSE

8

Which is not a type of linear data structure.

Array

Stack

Trees

Queue

9

Mainly Datatypes are of two types : primitive and non primitive.

TRUE

FALSE

10

Which data structures stores data in consecutive memory locations.

Linked Lists

Arrays

Tree

Graphs

11

Which is not a primitive data type.

struct

int

float

char

12

Non primitive data structures includes

Arrays

Lists

Files

All of these

13

Linked list uses static memory allocation.

TRUE

FALSE

14

Arrays is used when.

Data is large of different type

Data is large of same type

Data is small of different type

Data is small of same type

15

Stack is linear Data structure.

TRUE

FALSE

16

Full form of ADT is

Abstract Data Tool

Advance Data Type

Abstract Data Type

Advance Data Tool

17

Array index starts with

1

0

2

-1

18

Index is also known as

Subscript

Superscript

Data Element

Number

19

Lower bound in array is always

0

1

n+1

n-1

20

In a stack, insertion is done at

Front

Rear

Top

Down

21

Stack is a LIFO Data Structure.

TRUE

FALSE

22

Trees and graphs are the example of linear data structure.

TRUE

FALSE

23

The position in a queue from which an element is deleted is called as

Top

Rear

Front

Mid

24

Which data structure uses FIFO structure.

Stack

Queue

Trees

Graphs

25

Which data structure has fixed size.

Arrays

Linked Lists

Trees

Graphs

26

(upper bound – lower bound) + 1 is the formula to find length/size of array.

TRUE

FALSE

27

Insertion and deletion is problematic in array.

TRUE

FALSE

28

Sparse matrix is a matrix that has large number of elements with a zero value.

TRUE

FALSE

29

If an array is declared as arr[] = {1,3,5,7,9}; then what is the value of sizeof(arr[3])?

1

2

3

8

30

If an array is declared as int arr[5][5], how many elements can it store?

5

25

10

0

31

If an array is declared as arr[] = {1,3,5,7,9}; then what is the value of arr[3]?

3

5

7

9

32

______ is the address of the first element in the array.

lower address

upper address

base address

index address

33

Each array element is accessed using a ______.

subscript

superscript

base address

lower bound

34

A two-dimensional array contains data of two different types.

TRUE

FALSE

35

Upper bound is the index of the first element in an array..

TRUE

FALSE

36

Each element in a linked list is known as a __________.

Node

Data

Value

Pointer

37

Linked list is used to implement data structures like.

Stack

Queue

Trees

All of these

38

A linked list can store only integer values.

TRUE

FALSE

39

START stores the address of first node in linked list.

TRUE

FALSE

40

free() function is used to deallocate memory space.

TRUE

FALSE

41

In double linked list there are only one pointer next which point next address of a node.

TRUE

FALSE

42

Insertion and deletion of a node is easier task in Linked list.

TRUE

FALSE

43

Linear search requires sorted data.

TRUE

FALSE

44

Linear search is used for large data.

TRUE

FALSE

45

Binary search uses _____ to find element.

low

mid

high

index

46

formula to find mid is :

upper+lower

(upper+lower)*2

(upper+lower)/2

upper-lower

47

There are mainly ____ types of sorting

1

2

3

5

48

Bubble sort is the most efficient sorting technique.

TRUE

FALSE

49

Merge sort uses ____ technique to sort elements.

Greedy

Backtracking

Divide and Conquer

iterative

50

Quick sort uses divide and conquer technique to sort element

TRUE

FALSE

51

Selection sort selects ______ element from the list and places it on first position.

small

big

mid

low

52

Bubble sort bubble ups the highest element at last position in first pass.

TRUE

FALSE

53

Binary search needs sorted data

TRUE

FALSE