This is an assignment. Ryt? :P On Thu, Apr 28, 2011 at 1:31 PM, D.N.Vishwakarma@IITR <[email protected]>wrote:
> * > * > > > *Just give some time to these problems and solve it. Its sort of > Urgent.And Let me know the Solution. > * > > 1. Write an algorithm to implement a stack using a two dimensional > array. > > 2. Write an algorithm to store elements of a two-dimensional array in > a simple stack. > > > 3. You are in a rectangular area having one entry and one exit. The > Entrance is at the upper-left corner and the exit is at the lower-right > corner. The interior of the maze contains walls or obstacles that you can > not walk through. These obstacles are placed along rows and columns that are > parallel to the rectangular boundary of the maze. You can move north, south, > east or west neighboring positions. > Write an algorithm to find a path from entrance to exit using > Stack data structure. > > 4. Bob has a set A of n nuts and a set B of n bolts such that each > nut in A has a unique matching bolt in B. Unfortunately, the nuts in A all > look the same, and the bolts in B all look the same as well. The only kind > of a comparison that Bob can make is to take a nut-bolt pair (a,b), such > that a belongs to A and B belongs to B, and test it to see if the threads of > a are larger, smaller or a perfect match with the threads of B. Describe an > efficient algorithm for Bob to match up all his nuts and bolts. > > 5. A 3 –ary tree consists of two data fields: name and Age. Design > an algorithm for viewing the contents of all even numbered levels starting > from last-level. In a level display all nodes from right to left. Root is at > level 0. > > > Thank You....... > > > > > > > -- > **With Regards > Deoki Nandan Vishwakarma > IITR MCA > Mathematics Department* > * > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Umer -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
