http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/-t1.htm Thu, 18 Sep 2008 06:58:16 GMT 10 http://illiweb.com/fa/prosilver_pink/site_logo.gif http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/-t1.htm http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/lets-get-started-again-t40.htm shivang Given a 2-dimensional array of positive and negative integers, find the sub-rectangle with the largest sum. The sum of a rectangle is the sum of all the elements in that rectangle. In this problem the sub-rectangle with the largest sum is referred to as the maximal sub-rectangle. A sub-rectangle is any contiguous sub-array of size 1 x 1 or greater located within the whole array. As an example, the maximal sub-rectangle of the array: matrix2 0......2.....-7....0 9......2......-6....2 -4.....1......-4....1 -1.....8...... ... Data Structures/Algorithms Wed, 27 Aug 2008 13:13:47 GMT http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/lets-get-started-again-t40.htm#171 http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/lets-get-started-again-t40.htm http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/randonint-t56.htm SwitchCase A nested function call is when inside a function, you call the same function.\ We will now define a function RandomInt(N). This function generates a random number between 0 and N-1 (inclusive) with equal probability. Now RandomInt(Random(Random(..........RandomInt(N).....)))) is nested. RandomInt(N) means nesting of 1. And RandomInt(RandomInt(N)) means nesting of 2 and thus so on.... You will be given a Number N, nesting (the no of nestings) and Target. You have to give the ... Data Structures/Algorithms Thu, 18 Sep 2008 06:58:16 GMT http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/randonint-t56.htm#235 http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/randonint-t56.htm http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/probability-t55.htm SwitchCase You are given a value n. This represents nXn Chess Board. Im sure you all know how a knight moves on a chess board. You will be given a starting position for the knight (x,y) With 1,1 being the bottom left corner. Now, a knight can jump over other pieces and can thus make J number of jumps. Given n, x,y, J Find the probability that after J jumps the knight is still on the Board. (The knight is said to be outside a board, if a jump causes it to move out of the nXn ... Data Structures/Algorithms Thu, 18 Sep 2008 06:52:55 GMT http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/probability-t55.htm#234 http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/probability-t55.htm http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/sum-of-all-permutations-t54.htm prani you are given a number n you are to give the sum of all possible unique permutations Example 0) 157 Returns: 2886 We have: 157 + 175 + 517 + 571 + 715 + 751 = 2886 1) 313 Returns: 777 We have: 133 + 313 + 331 = 777 2) 1234 Returns: 66660 3) 5 Returns: 5 4) 54321 Returns: 3999960 5) 99999 Returns: 99999 problem source SRM 252 topcoder Data Structures/Algorithms Tue, 16 Sep 2008 17:18:25 GMT http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/sum-of-all-permutations-t54.htm#230 http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/sum-of-all-permutations-t54.htm http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/rotate-an-array-and-a-linked-list-t2.htm Admin For e.g. if we have the array A={1,2,3,4,5} and k=2 then the resulting array should be {3,4,5,1,2}. Try to post an in-place solution. The array need not be sorted originally. The question has multiple solutions. Try to discuss all.

Now what will be the approach if you want to rotate a singly linked list instead of an array.]]> Data Structures/Algorithms Sun, 03 Aug 2008 12:03:48 GMT http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/rotate-an-array-and-a-linked-list-t2.htm#2 http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/rotate-an-array-and-a-linked-list-t2.htm http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/reverse-a-list-t13.htm Pulkit
If done with this try it for a Doubly linked list.]]> Data Structures/Algorithms Tue, 12 Aug 2008 17:08:23 GMT http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/reverse-a-list-t13.htm#42 http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/reverse-a-list-t13.htm http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/count-total-trees-t42.htm Admin Try to optimise the solution.]]> Data Structures/Algorithms Sat, 30 Aug 2008 17:00:39 GMT http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/count-total-trees-t42.htm#175 http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/count-total-trees-t42.htm http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/first-repeated-element-in-an-array-t22.htm ish_mnnit e.g.{1,2,3,4,2,1,5,6}
output=2]]> Data Structures/Algorithms Wed, 13 Aug 2008 17:41:16 GMT http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/first-repeated-element-in-an-array-t22.htm#87 http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/first-repeated-element-in-an-array-t22.htm http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/n-largest-sum-t23.htm mnnit.rahul the aim is to find such n largest sums in o(n) complexity]]> Data Structures/Algorithms Wed, 13 Aug 2008 17:45:21 GMT http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/n-largest-sum-t23.htm#88 http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/n-largest-sum-t23.htm http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/challenging-shopkeeper-coin-problem-t36.htm Ramprasadg remember what sunita mam was saying in class.....i know most of us don't . PROBLEM: given a set of denominations,make an amount with min no of coins. no of coins of each denomination is unlimited. but the catch is that u can also get back money i.e. its like a shop keeper on the other side and not a ATM machine. for eg: given 1 , 10 ,15 as the denominations u can make 20 from 2 coins by 10+10 u can form 5 from 2 coins by 15-10.ie by giving 15 Rs and getting back 10Rs. u can ... Data Structures/Algorithms Mon, 18 Aug 2008 20:57:24 GMT http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/challenging-shopkeeper-coin-problem-t36.htm#151 http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/challenging-shopkeeper-coin-problem-t36.htm http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/computer-club-question-t29.htm Ramprasadg last year in computer club this question was asked...i am pretty sure gaurav-ji knows the ans... given a number n.print all the numbers from 1 till n^2 in a spiral. for example given 3. print the following 1 2 3 8 9 4 7 6 5 for 4 1 2 3 4 121314 5 111615 6 109 8 7 (i am not able to align for n=4 correctly,but i am sure everyone can get it??? : ) please give logic/code....but mainly tell me the class under which it comes if you know Data Structures/Algorithms Sat, 16 Aug 2008 13:19:39 GMT http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/computer-club-question-t29.htm#125 http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/computer-club-question-t29.htm http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/merging-trees-t18.htm prani how to merge them in minimum time so that final tree is also balanced???]]> Data Structures/Algorithms Wed, 13 Aug 2008 15:24:43 GMT http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/merging-trees-t18.htm#72 http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/merging-trees-t18.htm http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/dbms-section-t25.htm shivang Vase nice work buddies.....but a way to go
keep up the good work.... ]]> Data Structures/Algorithms Wed, 13 Aug 2008 18:30:40 GMT http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/dbms-section-t25.htm#92 http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/dbms-section-t25.htm http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/graph-problem-t15.htm shivang Given an Adjacency Matrix representation of A directed Graph u have to find in O(V) time complexity if der is a Universal Sink in the Graph Universal Sink:A vertex V is said to be universal sink if the rest |V| -1 vertices point to it and the vertex V itself doesnot have any out edge..i.e. it does not point to any other vertex. example : consider the following Adj Matrix ..........a.....b.....c.....d a.......0......1.....0.....1 b.......0......0.....0.....0 c........0......1......1.....1 d.........1......1.....0.....0 here ... Data Structures/Algorithms Tue, 12 Aug 2008 21:58:39 GMT http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/graph-problem-t15.htm#59 http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/graph-problem-t15.htm http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/same-no-of-one-s-t24.htm mnnit.rahul Given a number N, how many numbers less than N have the same number of 1s as N in their binary form ?? Data Structures/Algorithms Wed, 13 Aug 2008 17:46:36 GMT http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/same-no-of-one-s-t24.htm#89 http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/same-no-of-one-s-t24.htm http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/rotation-of-string-t16.htm Admin example s1=abcde
s2=cdeab
here s2 is a rotation of s1
]]> Data Structures/Algorithms Wed, 13 Aug 2008 13:45:36 GMT http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/rotation-of-string-t16.htm#64 http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/rotation-of-string-t16.htm http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/anagrams-t11.htm Admin You have been given 2 strings str1 and str2. Find whether the strings are anagrams of each other. What will be the test cases?? Data Structures/Algorithms Tue, 12 Aug 2008 14:49:54 GMT http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/anagrams-t11.htm#33 http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/anagrams-t11.htm http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/find-the-missing-element-in-the-array-t1.htm Admin Suppose we have an array A containing elements from 1 to n. An element is made zero and the resulting array is called B. Find the element that was made zero. Consider all the test cases and boundary conditions. Try to post multiple solutions. (This question was asked in Adobe written exam) Data Structures/Algorithms Sun, 03 Aug 2008 12:03:15 GMT http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/find-the-missing-element-in-the-array-t1.htm#1 http://computerclub09mnnit.forumotion.net/data-structures-algorithms-f1/find-the-missing-element-in-the-array-t1.htm