Re: [algogeeks] student and company match algo

2011-08-03 Thread Ashish Modi
Its a problem derived from Stable Marriage Problem, Google it u'll find sol.

On Wed, Aug 3, 2011 at 1:54 PM, MAC macatad...@gmail.com wrote:
 Suppose you have N companies visiting your college and your college has N
 students . You as placement coordinator knows that each student will get
 placed and your college policy is that each student can take ONLY 1 job and
 each company can take ONLY 1 student . Each student has told
 the placement coordinator his priority . So student A says i will first want
 to join ggl, if not  i will like to join amz if not adb and so on for
 N companies . So each of these N students tell you ,
 the placement coordinator his preference . Next each company who enters
 campus takes a separate exam and ranks the students and says its preference
 .So when adb visits campus , adb will say I want student A , if not i want
 student F if not i want student G and so on for all N students . So all
 these N companies takes separate exam and tells the coordinator its
 preference order . So you have N preference lists from companies and
 N preference lists from students.

 As a placement coordinator , with all student preferences and with all
 company preferences find the best matrix ie which student joins
 which company .
 --
 thanks
 --mac

 --
 You received this message because you are subscribed to the Google Groups
 Algorithm Geeks group.
 To post to this group, send email to algogeeks@googlegroups.com.
 To unsubscribe from this group, send email to
 algogeeks+unsubscr...@googlegroups.com.
 For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
Regards
Ashish

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



Re: [algogeeks] NVIDIA Q

2011-07-06 Thread Ashish Modi
@piyush:
No,one can declare the variable of empty struct and access its address via
pointer. So, when you are accessing address via pointer means some memory is
allocated for that variable. But *sizeof()* operator returns *zero*?? why???


On Wed, Jul 6, 2011 at 10:38 PM, T3rminal piyush@gmail.com wrote:

 @ashish
 Most probably because empty struct in C have nothing associated with it.
 They are as good as nothing. But empty classes in C++ can have member
 functions. These functions need to be associated with object, having a
 unique address, for that class. And unique address is not possible with
 class of size 0 as already explained above.

 --
 You received this message because you are subscribed to the Google Groups
 Algorithm Geeks group.
 To view this discussion on the web visit
 https://groups.google.com/d/msg/algogeeks/-/XP8yGGz2YbEJ.

 To post to this group, send email to algogeeks@googlegroups.com.
 To unsubscribe from this group, send email to
 algogeeks+unsubscr...@googlegroups.com.
 For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
With Regards
Ashish Modi
9423721478

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



Re: [algogeeks] Re: If any one have algorithms for interviews by adnan aziz ebook... Please mail ...

2011-05-05 Thread Ashish Modi
Hello,
Can  you please mail me ashishrmod...@gmail.com

Thanks in advance

-- 
With Regards
Ashish

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



Re: [algogeeks] A SIMPLE C++ PROGRAM.

2011-04-30 Thread Ashish Modi
 For such type of questions, the best method is to draw a parse tree
according to precedence  and evaluate the tree. This is how it is evaluated
at compiler level. Many times parsing tree creation is implementation
dependent.





On Fri, Apr 29, 2011 at 6:43 PM, Varun Nagpal varun.nagp...@gmail.comwrote:

 I think these questions are stupid in the sense that no one would ever use
 these constructs in their production code unless someone wants to write an
 obscure obfuscated code in some competition. Many times similar expressions
 are non-portable.

 Anyways, to understand this and related concepts, please see iso c or c++
 standard and try to understand operator precedence, operator associativity
 and sequence points.

 On Fri, Apr 29, 2011 at 3:06 PM, Nikhil Gupta 
 nikhilgupta2...@gmail.comwrote:

 12
 5

 because y=4+4+3+1
 and x is incremented to 5


 On Fri, Apr 29, 2011 at 2:01 PM, MANNU manishkr2...@gmail.com wrote:

 *Can anyone please explain me the output of this program:*

 int x=1;
 int y=x++ + ++x + ++x + x++;
 couty;
 coutx;

 --
 You received this message because you are subscribed to the Google Groups
 Algorithm Geeks group.
 To post to this group, send email to algogeeks@googlegroups.com.
 To unsubscribe from this group, send email to
 algogeeks+unsubscr...@googlegroups.com.
 For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.




 --
 Nikhil Gupta
 Senior Co-ordinator, Publicity
 CSI, NSIT Students' Branch
 NSIT, New Delhi, India

  --
 You received this message because you are subscribed to the Google Groups
 Algorithm Geeks group.
 To post to this group, send email to algogeeks@googlegroups.com.
 To unsubscribe from this group, send email to
 algogeeks+unsubscr...@googlegroups.com.
 For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.


  --
 You received this message because you are subscribed to the Google Groups
 Algorithm Geeks group.
 To post to this group, send email to algogeeks@googlegroups.com.
 To unsubscribe from this group, send email to
 algogeeks+unsubscr...@googlegroups.com.
 For more options, visit this group at
 http://groups.google.com/group/algogeeks?hl=en.




-- 
With Regards
Ashish Modi
9423721478

-- 
You received this message because you are subscribed to the Google Groups 
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.