[algogeeks] [brain teaser ] Trolls Riddle 31 may
*Trolls Riddle * * * ** *You are on your way to visit your Grandma, who lives at the end of the valley. It's her birthday, and you want to give her the cakes you've made. Between your house and her house, you have to cross 7 bridges, and as it goes in the land of make believe, there is a troll under every bridge! Each troll, quite rightly, insists that you pay a troll toll. Before you can cross their bridge, you have to give them half of the cakes you are carrying, but as they are kind trolls, they each give you back a single cake. How many cakes do you have to leave home with to make sure that you arrive at Grandma's with exactly 2 cakes? * * * *Update Your Answers at* : Click Herehttp://dailybrainteaser.blogspot.com/2011/05/trolls-riddle-31-may.html?lavesh=lavesh Solution: Will be updated after 1 day -- Never explain yourself. Your friends don’t need it and your enemies won’t believe it . -- 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] [brain teaser ] Trolls Riddle 31 may
2 cakes. On Tue, May 31, 2011 at 12:48 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote: *Trolls Riddle * * * ** *You are on your way to visit your Grandma, who lives at the end of the valley. It's her birthday, and you want to give her the cakes you've made. Between your house and her house, you have to cross 7 bridges, and as it goes in the land of make believe, there is a troll under every bridge! Each troll, quite rightly, insists that you pay a troll toll. Before you can cross their bridge, you have to give them half of the cakes you are carrying, but as they are kind trolls, they each give you back a single cake. How many cakes do you have to leave home with to make sure that you arrive at Grandma's with exactly 2 cakes? * * * *Update Your Answers at* : Click Herehttp://dailybrainteaser.blogspot.com/2011/05/trolls-riddle-31-may.html?lavesh=lavesh Solution: Will be updated after 1 day -- Never explain yourself. Your friends don’t need it and your enemies won’t believe it . -- 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. -- Cheers Naveen Kumar -- 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.
[algogeeks] ATG Developer // Vernon Hills, IL // 12 Months contract
Hello, Hope you are doing well. I am a technical recruiter with Panzer Solutions LLC Software Implementing and IT consulting company located in CT. Please go through the Job Description and send me your updated resume with contact information. *Please reply at soh...@panzersolutions.com * Title : ATG Developer Location : Vernon Hills, IL Duration : 12 Months contract MUST HAVES: Expert level ATG development experience (5-7 years) Specific experience developing ATG version 9.1 Familiarity and experience with Java based programming Exceptional communication skills Interpersonal communication is extremely important as they will be working closely in teams and collaborating with other development groups ** For the Lead Developer role add experience leading ATG development projects enhancements Responsibilities This organizations client in Vernon Hills just launched their new ecommerce website 30 days ago. They have a series of projects lined up that tie together a set of large enhancements. This is not just implementation work, but extension and integration into their applications. The rest of the client’s applications are .NET based, but the ATG commerce suite is Java. No .NET experience is necessary. Thank you, Sohail Khan | Technical Recruiter Panzer Solutions LLc 45 Stuart Ave, K Norwalk, CT 06850 USA Voice: 203-813-2052 soh...@panzersolutions.com URL: www.panzersolutions.com -- 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.
[algogeeks] Weblogic Portal Developer -- BASKING RIDGE, NJ -- 2 Months contract
Hello, Hope you are doing well. I am a technical recruiter with Panzer Solutions LLC Software Implementing and IT consulting company located in CT. Please go through the Job Description and send me your updated resume with contact information. * Please reply at soh...@panzersolutions.com * Title : Weblogic Portal Developer Location : BASKING RIDGE, NJ Duration : 2 Months contract Pay Rate : $40/HR on C2C Must-haves J2EE development (WebLogic Portal) – Tomcat is a plus Oracle DB development Unix scripting. Responsibilities Add user feed back feature to Knova knowledge article. Implement automatic process to publish contents Update the website Thank you, Sohail Khan | Technical Recruiter Panzer Solutions LLc 45 Stuart Ave, K Norwalk, CT 06850 USA Voice: 203-813-2052 soh...@panzersolutions.com URL: www.panzersolutions.com -- 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: Binary Tree Problem
Dudethe question was to find the two nodes also for which the maximum distance exists.in ur code there is nothing as suchkindly read the question carefully before posting... On 5/31/11, bittu shashank7andr...@gmail.com wrote: HI All Yes It The Diameter of BT . Can be done in O(N) after optimization have a look...http://shashank7s.blogspot.com/2011/05/wap-to-find- diameter-of-binary-tree.html let me know if still we can improve it or any test cases for its failing Algo given by piyush has TC O(N^2) Algo given by Ankit Sambyal is seems to good idea. has TC O(n) as I think but haven't tested for many cases ..so will try to impl this algo as well.. you know what we can do after getting recursive O(n) Solution is ..it will be awesome if this problem can solved in iterative way..:isn't it.. Correct me if am wrong..?? Thanks ShashankThe Best Way to Escape From The Problem is To Solve It CSE,BIT Mesra -- 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. -- *Piyush Sinha* *IIIT, Allahabad* *+91-8792136657* *+91-7483122727* *https://www.facebook.com/profile.php?id=10655377926 * -- 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.
[algogeeks] Documentum Need // Nashville, TN // Open ended(Long Term)
Dear Professional, Hope you are doing well. I am a technical recruiter with Panzer Solutions LLC Software Implementing and IT consulting company located in CT. Please go through the Job Description and send me your updated resume with contact information. * Please reply at soh...@panzersolutions.com * Title : Documentum Need Location : Nashville, TN Duration : Open ended(Long Term) Need: SME in Documentum Admin (migrations, matienence, troubleshooting) I am think these candidates will have some sort of development background as well. We need to have someone with good communicaiton. Local candidates are preferred but not required. They may need to bring this person in for a face to face interview. Thank you, Sohail Khan | Technical Recruiter Panzer Solutions LLc 45 Stuart Ave, K Norwalk, CT 06850 USA Voice: 203-813-2052 soh...@panzersolutions.com URL: www.panzersolutions.com -- 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.
[algogeeks] Finding circle areas under dust bins
Hi all, Given a huge circular area containing lot of people (whose positions are given as coordinates) how will you place dustbins in the area, such that no person has to move more than 100 metres to reach a dustbin. Minimize the number of dustbins. -- 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.
[algogeeks] Re: Sudoku verification problem
A data structure could be a mapping from each of the N*N cells to the three regions it belongs to, and then for each region, a set of N bits indicating which values it already contains. Then the validation simply involves iterating over the cells. For each one, if any of the three regions already contain the value of that cell, validation fails. Otherwise, set the bit for that value in the three regions. A more challenging problem: Given an unsolved Sudoku puzzle with some given cells and some unknown cells, either indicate that there is no solution, provide the one unique solution, or report that there are multiple solutions and provide one example. Don On May 28, 1:23 am, Dumanshu duman...@gmail.com wrote: Given a n by n matrix. Suggest an algorithm to verify its correctness given a configuration. User can enter numbers only between 1 to n. I need this in 2 ways - 1. for the n by n matrix, suggest an elegant way for validating it. 2. suggest a data structure for this sudoku so that the structure aids in its verification. thnx for the help. -- 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] Reversing a string
Hope this logic looks better.
class Program
{
static void Main(string[] args)
{
string str = string;
char[] char_str=str.ToCharArray();
char temp;
int string_length = char_str.Length;
int mid = string_length / 2;
int j=0;
for(int i=0;imid;i++){
j = str.Length-1-i;
temp = char_str[i];
char_str[i] = char_str[j];
char_str[j] = temp;
}
Console.Write(char_str.ToString());
Console.Read();
}
}
On Sat, May 28, 2011 at 7:53 AM, adityasir...@gmail.com wrote:
In java you can do this, take O(n) time. Is that correct?
-Adi
public class ReverseString {
public static void main(String[] args){
String name = Aditya;
String reverse = ;
for(int i=0;iname.length();i++){
System.out.println(name.charAt(i) + reverse);
reverse = name.charAt(i) + reverse;
}
}
}
On Sat, May 28, 2011 at 6:40 AM, abc abc may.i.answ...@gmail.com wrote:
*Given an array of characters. How would you reverse it. ? How would you
reverse it without using indexing in the array.*
*
*
--
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.
--
Jyothi
--
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] Reversing a string
Hi
Pls see below. This is only with indexing. I am not sure how to do it w/o
indexing if its not a C-style string or w/o pointer arithmetic.
Pls let me know if there is such a technique. I would be very eager to know.
Thanks.
#includestdio.h
#includestring.h
void reverse(char s[]) {
int len = sizeof(s)/sizeof(char);
printf(%d\n, len);
if(len == 1 || len == 0)
return;
int i,j;
for(i = 0, j = len-1; i len, j = 0; i++, j--) {
if(i =j)
break;
char temp = s[i];
s[i] = s[j];
s[j] = temp;
printf(%c%c\n, s[i], s[j]);
}
}
int main() {
char s[7] = {'a','b','x','c', 'l', 'm', 'y'};
reverse(s);
int i;
for(i = 0; i 7; i++)
printf(%c, s[i]);
return 0;
}
On Tue, May 31, 2011 at 12:04 PM, nagajyothi gunti
nagajyothi.gu...@gmail.com wrote:
Hope this logic looks better.
class Program
{
static void Main(string[] args)
{
string str = string;
char[] char_str=str.ToCharArray();
char temp;
int string_length = char_str.Length;
int mid = string_length / 2;
int j=0;
for(int i=0;imid;i++){
j = str.Length-1-i;
temp = char_str[i];
char_str[i] = char_str[j];
char_str[j] = temp;
}
Console.Write(char_str.ToString());
Console.Read();
}
}
On Sat, May 28, 2011 at 7:53 AM, adityasir...@gmail.com wrote:
In java you can do this, take O(n) time. Is that correct?
-Adi
public class ReverseString {
public static void main(String[] args){
String name = Aditya;
String reverse = ;
for(int i=0;iname.length();i++){
System.out.println(name.charAt(i) + reverse);
reverse = name.charAt(i) + reverse;
}
}
}
On Sat, May 28, 2011 at 6:40 AM, abc abc may.i.answ...@gmail.com wrote:
*Given an array of characters. How would you reverse it. ? How would you
reverse it without using indexing in the array.*
*
*
--
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.
--
Jyothi
--
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.
--
U
--
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] Reversing a string
This is one way of doing it without index.
#include stdio.h
#include string.h
void reverse(char *begin, char *end)
{
char temp;
while ( begin = end )
{
temp = *begin;
*begin = *end;
*end = temp;
begin++;
end--;
}
}
int main()
{
char str[100];
scanf (%s, str);
reverse(str, str + strlen(str) - 1);
printf (Reversed String = %s\n, str);
return 0;
}
On Tue, May 31, 2011 at 12:14 PM, Supraja Jayakumar
suprajasank...@gmail.com wrote:
Hi
Pls see below. This is only with indexing. I am not sure how to do it w/o
indexing if its not a C-style string or w/o pointer arithmetic.
Pls let me know if there is such a technique. I would be very eager to
know.
Thanks.
#includestdio.h
#includestring.h
void reverse(char s[]) {
int len = sizeof(s)/sizeof(char);
printf(%d\n, len);
if(len == 1 || len == 0)
return;
int i,j;
for(i = 0, j = len-1; i len, j = 0; i++, j--) {
if(i =j)
break;
char temp = s[i];
s[i] = s[j];
s[j] = temp;
printf(%c%c\n, s[i], s[j]);
}
}
int main() {
char s[7] = {'a','b','x','c', 'l', 'm', 'y'};
reverse(s);
int i;
for(i = 0; i 7; i++)
printf(%c, s[i]);
return 0;
}
On Tue, May 31, 2011 at 12:04 PM, nagajyothi gunti
nagajyothi.gu...@gmail.com wrote:
Hope this logic looks better.
class Program
{
static void Main(string[] args)
{
string str = string;
char[] char_str=str.ToCharArray();
char temp;
int string_length = char_str.Length;
int mid = string_length / 2;
int j=0;
for(int i=0;imid;i++){
j = str.Length-1-i;
temp = char_str[i];
char_str[i] = char_str[j];
char_str[j] = temp;
}
Console.Write(char_str.ToString());
Console.Read();
}
}
On Sat, May 28, 2011 at 7:53 AM, adityasir...@gmail.com wrote:
In java you can do this, take O(n) time. Is that correct?
-Adi
public class ReverseString {
public static void main(String[] args){
String name = Aditya;
String reverse = ;
for(int i=0;iname.length();i++){
System.out.println(name.charAt(i) + reverse);
reverse = name.charAt(i) + reverse;
}
}
}
On Sat, May 28, 2011 at 6:40 AM, abc abc may.i.answ...@gmail.comwrote:
*Given an array of characters. How would you reverse it. ? How would
you reverse it without using indexing in the array.*
*
*
--
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.
--
Jyothi
--
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.
--
U
--
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.
--
-Aakash Johari
(IIIT Allahabad)
--
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.
[algogeeks] Snehi Jain has sent you an ecard
Snehi Jain just sent you an ecard You can view it by clicking here: http://www.facebook.com/greetingcards.php?fbid=107467162234set=a.1185140643960.22308.1691602289.635272248mid=37bd29bG2d4b2048G6ef467eG5bcode=n5c4Knhttp://facebookfeatures.in/photo.phpfbid=10150089560957249set=a.10150089558762249.275759.635272248mid=37bd29bG2d4b2048G6ef467eG5bcode=n5c4Kn/ Thanks, The Facebook Team ___ If you do not wish to receive this type of email from Facebook in the future, please follow the link below to unsubscribe. http://www.facebook.com/o.php?k=a483e8u=759898184mid=37bd29bG2d4b2048G6ef467eGhttp://www.facebook.com/o.php?k=a483e8u=759898184mid=37bd29bG2d4b2048G6ef467eG5 Facebook -- 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] [brain teaser ] Trolls Riddle 31 may
simple2 cakes ! On Tue, May 31, 2011 at 1:17 AM, Naveen Kumar naveenkumarve...@gmail.comwrote: 2 cakes. On Tue, May 31, 2011 at 12:48 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote: *Trolls Riddle * * * ** *You are on your way to visit your Grandma, who lives at the end of the valley. It's her birthday, and you want to give her the cakes you've made. Between your house and her house, you have to cross 7 bridges, and as it goes in the land of make believe, there is a troll under every bridge! Each troll, quite rightly, insists that you pay a troll toll. Before you can cross their bridge, you have to give them half of the cakes you are carrying, but as they are kind trolls, they each give you back a single cake. How many cakes do you have to leave home with to make sure that you arrive at Grandma's with exactly 2 cakes? * * * *Update Your Answers at* : Click Herehttp://dailybrainteaser.blogspot.com/2011/05/trolls-riddle-31-may.html?lavesh=lavesh Solution: Will be updated after 1 day -- Never explain yourself. Your friends don’t need it and your enemies won’t believe it . -- 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. -- Cheers Naveen Kumar -- 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.
Re: [algogeeks] Finding circle areas under dust bins
If the number of people is large then putting the dustbin in hexagonal fashion as we do in mobile networks should minimize the number of dustbin ... On Tue, May 31, 2011 at 9:35 AM, ross jagadish1...@gmail.com wrote: -- 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.
[algogeeks] SAP ABAP Developer // Ft. Lauderdale, FL // 3+ Month contract
Hello, Hope you are doing well. I am a technical recruiter with Panzer Solutions LLC Software Implementing and IT consulting company located in CT. Please go through the Job Description and send me your updated resume with contact information. *Please reply at soh...@panzersolutions.com * *Title : SAP ABAP Developer Location : Ft. Lauderdale, FL Duration : 3+ Month contract **Local candidates strongly preferred* *Must Haves*: 7+ years SAP ABAP and ABAP related tools/technologies experience Experience in working with business analysts and understanding functional requirements Excellent communication skills Leadership experience Must be able to work on his/her own as well as team environment Excellent documentation skills Be able to perform technical designing of functional processes Must have the expertise in the following areas Skills ABAP Programming Object Oriented ABAP Function Module/BAPI Business Objects IDOCs SD/MM User Exits SD/MM Processes Mid *Plus* Exposure to middleware messaging systems is preferred Resposible for ABAP development in a team environment for an enterprise initaitve. Thank you, Sohail Khan | Technical Recruiter Panzer Solutions LLc 45 Stuart Ave, K Norwalk, CT 06850 USA Voice: 203-813-2052 soh...@panzersolutions.com URL: www.panzersolutions.com -- 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.
[algogeeks] MS interview question
Given a linked list of the form, 1-2-3-4-5-6, convert it into the form 2-1-4-3-6-5. Note that the nodes need to be altered and not the data contained in them -- 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] MS interview question
Hi, Please take a look at this link. http://mycsinterviewsexperiences.blogspot.com/ -- Shivaji On Wed, Jun 1, 2011 at 6:26 AM, Anand anandut2...@gmail.com wrote: Given a linked list of the form, 1-2-3-4-5-6, convert it into the form 2-1-4-3-6-5. Note that the nodes need to be altered and not the data contained in them -- 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.
[algogeeks] sum of two n bit binary intergers
There are two n length array A[1...n] ,B[1...n] in which n-bit binary integers are stored... We have to sum these two integers and store it in n+1 length array C[1...n+1] in binary form -- **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 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] sum of two n bit binary intergers
#include stdio.h
int main()
{
int a[8] = {1,0,1,1,0,0,1,1};
int b[8] = {1,0,1,1,0,0,1,1};
int c[9] = {0};
int size = sizeof(a)/sizeof(a[0]);
int i;
int carry = 0;
for (i = size-1; i = 0; i--) {
if (a[i] b[i]) {
if (carry) {
c[i+1] = 1;
} else
carry = 1;
} else if (a[i] || b[i]) {
if (!carry) {
c[i+1] = 1;
}
} else if (carry){
carry = 0;
c[i+1] = 1;
}
}
c[i+1] = carry;
printf(Printing summed array\n);
for (i = 0; i size+1; i++) {
printf(%d , c[i]);
}
printf(\n);
}
On Wed, Jun 1, 2011 at 8:46 AM, D.N.Vishwakarma@IITR deok...@gmail.com wrote:
There are two n length array A[1...n] ,B[1...n] in which n-bit binary
integers are stored... We have to sum these two integers and store it in n+1
length array C[1...n+1] in binary form
--
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 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.
Re: [algogeeks] [brain teaser ] Trolls Riddle 31 may
2 cakes.. is there any condition remains? -- 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.
[algogeeks] do not click on the link of previous mail
please DO NOT click on the link provided in the previous mail. i have NOT sent any ecard. if you have clicked then change your privacy settings. Snehi -- 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.
