A merchant has bough some 3000 banana from market and want to bring them to his home which is 1000 km far from Market. He have a elephant which can carry maximum of 1000/- banana at time. That could have been easy but this elephant is very shrewd and he charges 1 banana for every one kilometer he travel. Now we have to maximise number of banana which should reach to home. Solution: At present we are at 0th km with 3000 banana and elephant. Lets see if elephant have to shift all the 3000 banana and elephant by 1 km. For 1 km shift: Take first 1000 banana and drop at 1st km. 2 banana consumed. One banana each for to and fro. Second 1000 banana and drop at 1st km. 2 banana consumed. Third 1000 banana and reach at 1st km. 1 banana consumed. So all in all total 5 banana will be consumed if we shift a kilometer. But that's not all, our total banana number are also reducing so we may have to reduce the number of turns too. And this will happen once we have reduced the b
22. No of permutations with n numbers. (1/(n+1)2ncn).
ReplyDeletea) No of permutations are 1/(n+1) (2n)cn.
b) No of stack permutation possible.
c) No of binary trees possible with n nodes.
d) No of ways to parenthesise with n data element.
23. A string with a’s and b’s and with one special character ‘x’. Find out whether its palindrome or not.
a) Take two pointer one from start and another from end. Start comparing till pointers don’t cross each other.
24. Implement queue by stack with enque and deque of order O(1);
Pop all the element and push in second stack2. The top2 will point to the beginning of
Deque and top1 will be at end. Maintain size1 and size2 for the bottom removing with both the cases.
Add at beg: push in stack2, size1 and size2 incremented.
Add at end: push in stack1, size1 and size2 incremented.
Delete at beg: pop in stack2 and decrement size1 and size2.
Delete at end: pop in stack2 and decrement size1 and size2.
25. Convert infix expression to postfix.
While ( ch )
{
If ( ch is alphanumeric ) push (ch);
If ( ch is ‘)’ ) pop from operatorstack and push(ch);
If ( ch is operator) pushoperator(ch);
}