Which of the following statement is true ?
Abdelrahman S. Fathy from Cairo, Egypt is saying Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe is correct answer
Sanju Rebel from Hyderabad, India is saying Optimal binary search tree construction can be performed efficiently using dynamic programming. is correct answer
Serkie Mekonnen from Dessie, Ethiopia is saying Depth first search can be used to find connected components of a graph. is correct answer
Marem Husen from Al Musayyib, Iraq is saying Optimal binary search tree construction can be performed efficiently using dynamic programming. is correct answer
deepak kumar is saying Breath first search cannot be used to find converted components of a graph. is correct answer
- [A] a network adapter to other devices on the network
- [B] the manufacturer of a computer
- [C] the physical location of a computer
- [D] none of the above
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
- [A] Stack
- [B] Set
- [C] List
- [D] Queue
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