**Davinder Singh**- 4 years ago in Data Structure

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

Loading...

#### Related Questions

**Davinder Singh**- 4 years ago in Data Structure

Which of the following is useful in traversing a given graph by breadth first search?

- [A] Stack
- [B] Set
- [C] List
- [D] Queue

**Davinder Singh**- 4 years ago in Data Structure

You can make telephone calls over the Internet using a technology called

- [A] Intertel
- [B] Telenet
- [C] VoIP
- [D] VoRP

**Davinder Singh**- 4 years ago in Data Structure

**Davinder Singh**- 4 years ago in Data Structure

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 ?

- [A] 2 deletions and 3 additions
- [B] 3 additions and 2 deletions
- [C] 3 deletions and 3 additions
- [D] 3 deletions and 4 additions

**Davinder Singh**- 4 years ago in Data Structure

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 ?

- [A] 2,2,1,1,2
- [B] 2,2,1,2,2
- [C] 2,1,2,2,1
- [D] 2,1,2,2,2