# Data Structure(DS) Questions and Answers

## Computer Science :: Data Structure

1. Which one of the following permutations can be obtained the output using stack assuming that the input is the sequence 1,2,3,4,5 in that order ?

Loading...

2. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?

Loading...

3. Linked list are not suitable data structure of which one of the following problems ?

Loading...

4. The number of possible ordered trees with three nodes A,B,C is?

Loading...

5. Which of the following algorithm design technique is used in the quick sort algorithm?

Loading...

6. The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?

Loading...

7. Which of the following statement is true ?

Loading...

8. Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?

Loading...

9. Merge sort uses ?

Loading...

10. The following sequence of operation is performed on stack : push(1),push(2),pop,push(1),push(2),pop,pop,pop,push(2),pop. The sequence of popped out values are ?

Loading...

**Are these questions helpful for you?**

Comments: (Your feedback is valuable to us)pankaj4 months ago Replywe want to more explanitions

NARENDRA KUMAR6 months ago Replyand want to more explanation two dimensional array also

NARENDRA KUMAR6 months ago Replywe want to more explanation about stack and queue

HIFZURRAHAMAN1 year ago ReplyAdd atleast 100 questions.........

Rituraj2 years ago ReplyNeed explanation as well

keerthana g2 years ago ReplyIts useful, but I need explanation for each one.

Rehan2 years ago Replynice questions to study.....

Avdhoot2 years ago Replywe want the more explanations

devi bala2 years ago Replyto give breif explanation

Shraddha2 years ago Replynice questions to study.....