This section contains a lot of data structure question and answer with explanation on the topic language fundamental. These question and answer are very much helpful for interview(campus interviews, walkin interviews, company interviews), competitive examination ,entrance test and placements. Each question having answer and explanation that would help you to understand easily. These question are designed from basic to advance level. So anyone can learn from here (beginner, fresher, engineering graduate, an experienced IT professional).

All the question of data structure are listed below on language fundamental along with detailed explanation / solution and answer.

1) Merge sort uses ?

A. Divide and conquer strategy

B. Backtracking approach

C. Heuristic search

D. Greedy approach

Answer:

Divide and conquer strategy

Option:

( A )

Explanation :

No explanations available for this question.

2) Linked list are not suitable data structure of which one of the following problems ?

A. Insertion sort

B. Binary search

C. Radix sort

D. Polynomial manipulation

Answer:

Binary search

Option:

( B )

Explanation :

No explanations available for this question.

3) Which of the following algorithm design technique is used in the quick sort algorithm?

A. Dynamic programming

B. Backtracking

C. Divide and conquer

D. Greedy method

Answer:

Divide and conquer

Option:

( C )

Explanation :

No explanations available for this question.

4) Queue can be used to implement ?

A. quick sort

B. merge sort

C. heap sort

D. insertion sort

Answer:

quick sort

Option:

( A )

Explanation :

No explanations available for this question.

5) Sparse matrices have ?

A. no zero

B. many zero

C. higher dimenstion

D. none

Answer:

many zero

Option:

( B )

Explanation :

No explanations available for this question.