# It's All About The Concept Of Data Structure.

20 Questions  Settings  .

Related Topics
• 1.
Data is nothing but
• A.

Collection of node

• B.

Collection of information

• C.

Set of value

• D.

Set of node

• 2.
Overflow condition in stack is called
• A.

• B.

Stack implementation Error

• C.

Indifinite Error

• D.

Syntax Error

• 3.
Stack is work on the principal of
• A.

LILO

• B.

FIFO

• C.

FILO

• D.

LIFO

• 4.
Under which condition circular queue is Full
• A.

Front=-1

• B.

Front=(rear+1)%maxsize

• C.

Front=(front+1)%maxsize

• D.

Rear=(rear+1)%maxsize

• 5.
Which is not application of stack
• A.

Reversal of string

• B.

Evaluation of arithimatic operation

• C.

Real operating system

• D.

Recursion

• 6.
A leaf node have degree
• A.

1

• B.

2

• C.

0

• D.

3

• 7.
A  B-tree is called
• A.

Binary tree

• B.

Binary search tree

• C.

Bst with Height balance

• D.

Multi way search tree with Height balance

• 8.
Time complexity of linear search is
• A.

0(n)

• B.

0(1)

• C.

O(log n)

• D.

0(n log n)

• 9.
Highest precedence is
• A.

*

• B.

-

• C.

+

• D.

^

• 10.
Binary search tree is also called two way search tree
• A.

True

• B.

False

• 11.
The value of structure is resizing during run time by using
• A.

Malloc

• B.

Calloc

• C.

Free

• D.

Realloc

• 12.
How many types of queue's are available
• A.

0

• B.

1

• C.

2

• D.

4

• 13.
Array is Linear data  structure
• A.

True

• B.

False

• 14.
Disadvantage of linear queue is overcome by using
• A.

• B.

Circular queue

• C.

Stack

• D.

Double ended queue

• 15.
Leaf node is also called internal node
• A.

True

• B.

False

• 16.
Which is not predefine string function
• A.

Strlen

• B.

Strcnt

• C.

Strcat

• D.

Strcmp

• 17.
Concept of array employes Wastage of memory
• A.

True

• B.

False

• 18.
Which is not primitive data structure
• A.

Stack

• B.

Int

• C.

Char

• D.

Float

• 19.
How many types of sorting in data structure
• A.

0

• B.

3

• C.

4

• D.

2

• 20.
AVL stands for
• A.

Any vital lenght

• B.

Height balanced tree

• C.

Another voilence laptord

• D.

Anti virtual lite