[algogeeks] [brain teaser ] 29march
*Series Problem Solution* 1, 2, 5, 14, 41, x Whats x ?? Update Your Answers at : Click Herehttp://dailybrainteaser.blogspot.com/2011/03/29march.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 ] 29march
122 On Tue, Mar 29, 2011 at 1:05 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote: *Series Problem Solution* 1, 2, 5, 14, 41, x Whats x ?? Update Your Answers at : Click Herehttp://dailybrainteaser.blogspot.com/2011/03/29march.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. -- Regards, Arpit Sood -- 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 ] 29march
*122 it's so simple * On Tue, Mar 29, 2011 at 1:15 PM, Arpit Sood soodfi...@gmail.com wrote: 122 On Tue, Mar 29, 2011 at 1:05 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote: *Series Problem Solution* 1, 2, 5, 14, 41, x Whats x ?? Update Your Answers at : Click Herehttp://dailybrainteaser.blogspot.com/2011/03/29march.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. -- Regards, Arpit Sood -- 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 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.
[algogeeks] Who Will Reach Final? Watch PAK vs IND Live Match
World Cup2011 Srilanka vs New Zealand live Score|Srilanka vs New Zealand Live Match http://www.liveruns.com/worldcup2011/SriLanka_vs_New%20Zealand.php World Cup2011 Srilanka vs New Zealand live Score,live streaming Srilanka vs New Zealand,Srilanka vs New Zealand Live Match. World Cup2011 India vs Pakistan live Match http://www.liveruns.com/worldcup2011/India_vs_Pakistan.php World Cup2011 India vs Pakistan live Score,live streaming India vs Pakistan,India vs Pakistan Live Match. -- 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] Output of the code
ruby :
putsIndia will win the worldcup 2011
On Mon, Mar 28, 2011 at 9:04 PM, shady sinv...@gmail.com wrote:
python 2.6
print 'India will win the World Cup 2010'
On Mon, Mar 28, 2011 at 8:45 PM, Praveen Kumar praveen97...@gmail.comwrote:
Here is the correct program :
#includeiostream
using namespace std;
int main()
{
while(true)
{
coutIndia will win the World Cup 2010endl;
}
return 0;
}
On Mon, Mar 28, 2011 at 8:42 PM, Praveen Kumar praveen97...@gmail.comwrote:
true is a keyword representing 1 and false as 0. The program will print
the line a single time.
On Mon, Mar 28, 2011 at 11:13 AM, balaji a peshwa.bal...@gmail.comwrote:
the code will give error as there is nothing called true defined.
On Sun, Mar 27, 2011 at 10:38 PM, Umer Farooq the.um...@gmail.comwrote:
Hi,
Can anyone tell me the output of the following code?
#include iostream.h
int main()
{
.. if (true)
.. cout Pakistan will win the WorldCup 2011\n;
return 0;
}
--
Umer
--
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.
--
A.Balaji
--
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.
--
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,
chinna.
--
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] Application of Data Structure System Design
Pretend you work for a phone company. At your company, you have a satellite that routes phone calls. We want to bill customers by the maximum number of simultaneous phone calls they make in a single day. (After asking clarifying questions I received the following information: assume no calls last more than 24 hours and that at midnight each night all the calls are automatically dropped. In the event that one call ends as soon as another starts, answer part 2 of this question in such a way as to maximize revenue). What information should the satellite store for each phone call? Define a data structure for this (e.g. write a struct). Write a function that finds the maximum number of simultaneous phone calls from a given customer. (Hint: typical solution is O(nlogn), but if you use an absurd amount of memory like I did, it can be done in O(n)). Thanks Shashank -- 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] Application of Data Structure System Design
Pretend you work for a phone company. At your company, you have a satellite that routes phone calls. We want to bill customers by the maximum number of simultaneous phone calls they make in a single day. ( clarifying questions with the following information: assume no calls last more than 24 hours and that at midnight each night all the calls are automatically dropped. In the event that one call ends as soon as another starts). What information should the satellite store for each phone call? Define a data structure for this (e.g. write a struct). Write a function that finds the maximum number of simultaneous phone calls from a given customer. (Hint: typical solution is O(nlogn), but if you use an absurd amount of memory it can be done in O(n)). Best Designing DS, Approach Will b highly Appreciated Thanks Shashank -- 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: Ties The Rope With Minimum Cost ..Interesting For Geeks
visit http://code-forum.blogspot.com/2011/01/tying-ropes-in-minimum-cost.html for explanation of this problem . Regards Priyaranjan On Mar 28, 11:41 am, bittu shashank7andr...@gmail.com wrote: you are given n ropes,maybe of different length. the cost of tying two ropes is the sum of their lengths.Find a way to tie these ropes together so that the cost is minimum. Thanks Shashank -- 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: Ties The Rope With Minimum Cost ..Interesting For Geeks
apply huffman algorithm it will work... to know huffman algo do google On Tue, Mar 29, 2011 at 3:51 PM, awesomeandroid priyaranjan@gmail.comwrote: visit http://code-forum.blogspot.com/2011/01/tying-ropes-in-minimum-cost.html for explanation of this problem . Regards Priyaranjan On Mar 28, 11:41 am, bittu shashank7andr...@gmail.com wrote: you are given n ropes,maybe of different length. the cost of tying two ropes is the sum of their lengths.Find a way to tie these ropes together so that the cost is minimum. Thanks Shashank -- 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. -- *UTKARSH SRIVATAV* *CSE-3 B-Tech 2nd Year @MNNIT 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] Re: SPOJ problem
Formula: Math.E*a-0.5*Math.log(2*Math.PI*a)-1d/a gives right result almost always besides (a:n:formula value): 3 : 7 : 6 195 : 526 : 527 534 : 1447 : 1448 580 : 1572 : 1573 1168 : 3170 : 3171 1870 : 5078 : 5079 2175 : 5907 : 5908 2590 : 7035 : 7036 2927 : 7951 : 7952 3225 : 8761 : 8762 3892 : 10574 : 10575 9183 : 24956 : 24957 13016 : 35375 : 35376 13882 : 37729 : 37730 ... They can be hardcoded. -- 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: Ties The Rope With Minimum Cost ..Interesting For Geeks
@utkarsh i was just about to put Huffman algo ..yes it is optimized answer to solve the problem @all basicaly we have to minimize the cost of intermediate path ,final o/p will obvious be the same Try Huffman algo 1st read what it is..dan u will able to figure out soln of this problem Hope i am clear , if missing something , correct me Thanks Reagrds Shashank Mani 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.
Re: [algogeeks] [brain teaser ] 29march
122 1, 2, 5, 14, 41, x Whats x ?? -- Regards Kunal Yadav (http://algoritmus.in/) -- 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 ] 29march
Agreed, 122 On 29 March 2011 14:19, Kunal Yadav kunalyada...@gmail.com wrote: 122 1, 2, 5, 14, 41, x Whats x ?? -- Regards Kunal Yadav (http://algoritmus.in/) -- 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] getting out of the loop
Hi, If I have a recurrence relation defined as: _ _ |_ _| - floor function. || - ceiling function _ _ Pn = |_n/2_| + P|_n/2_| + P| n/2 | for n =1 with P0 = 0 for n = 1 I have: P1 = 0 + 0 + P1 so I have P1 again and enter in an infinity loop. Did this exercise forget to define P1 or am I missing something? -- 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: getting out of the loop
On Mar 29, 9:41 am, dmjcunha dmjcu...@gmail.com wrote: Hi, If I have a recurrence relation defined as: _ _ |_ _| - floor function. | | - ceiling function _ _ Pn = |_n/2_| + P|_n/2_| + P| n/2 | for n =1 with P0 = 0 for n = 1 I have: P1 = 0 + 0 + P1 so I have P1 again and enter in an infinity loop. Did this exercise forget to define P1 or am I missing something? The underscores went to the wrong place, I am trying to fix. -- 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: getting out of the loop
On Mar 29, 9:50 am, dmjcunha dmjcu...@gmail.com wrote: On Mar 29, 9:41 am, dmjcunha dmjcu...@gmail.com wrote: Hi, If I have a recurrence relation defined as: _ _ |_ _| - floor function. | | - ceiling function _ _ Pn = |_n/2_| + P|_n/2_| + P| n/2 | for n =1 with P0 = 0 for n = 1 I have: P1 = 0 + 0 + P1 so I have P1 again and enter in an infinity loop. Did this exercise forget to define P1 or am I missing something? The underscores went to the wrong place, I am trying to fix. -- 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: getting out of the loop
On Mar 29, 9:52 am, dmjcunha dmjcu...@gmail.com wrote: On Mar 29, 9:50 am, dmjcunha dmjcu...@gmail.com wrote: On Mar 29, 9:41 am, dmjcunha dmjcu...@gmail.com wrote: Hi, If I have a recurrence relation defined as: _ _ |_ _| - floor function. | | - ceiling function _ _ Pn = |_n/2_| + P|_n/2_| + P| n/2 | for n =1 with P0 = 0 for n = 1 I have: P1 = 0 + 0 + P1 so I have P1 again and enter in an infinity loop. Did this exercise forget to define P1 or am I missing something? The underscores went to the wrong place, I am trying to fix. -- 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] sex medicine hot videos
how to encourage women hot sex http://onlyforhealth-muni.blogspot.com/2011/03/medicine-for-women.html food list for pregnant womens http://onlyforhealth-muni.blogspot.com/2011/03/pregnants-food-list.html hormone imbalance for men and women http://onlyforhealth-muni.blogspot.com/2011/03/hormone-imbalance.html sex medicine for men http://onlyforhealth-muni.blogspot.com/2011/03/sildenafil-citrate.html cure diseases only with water http://onlyforhealth-muni.blogspot.com/2011/03/water-theraphy.html antibiotics and there uses http://onlyforhealth-muni.blogspot.com/2010/12/antibiotics-introduction.html hot katrina kaif wallpapers http://cinyworld96.blogspot.com/2011/03/katrina-kaif.html deepika padukone new stills http://cinyworld96.blogspot.com/2011/03/deepika-padukone.html beautiful aishwariya rai http://cinyworld96.blogspot.com/2011/03/aishwariya-rai.html diya mirza sexy photos http://cinyworld96.blogspot.com/2011/03/diya-mirza.html stunning beauty sneha http://cinyworld96.blogspot.com/2011/03/sneha.html unbelivable iliyana photos http://cinyworld96.blogspot.com/2011/03/iliyana.html priyamani beautiful stills http://cinyworld96.blogspot.com/2011/03/priyamani.html -- 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: Google puzzles
arpit can u a bit more explain how u came up with this formula ??? On Thu, Mar 17, 2011 at 11:11 PM, arpit.gupta arpitg1...@gmail.com wrote: ans is n=6, m=36; m= n + (n*7/6 + (n-1)) + ((n*7/6 + (n-1))*7/6 + n-2) +.. now n must be a multiple of 6. taking n=6, we get the answer m= 36 On Mar 16, 3:27 pm, may.I.answer may.i.answ...@gmail.com wrote: In a sports contest there were m medals awarded on n successive days (n 1). 1. On the first day 1 medal and 1/7 of the remaining m - 1 medals were awarded. 2. On the second day 2 medals and 1/7 of the now remaining medals was awarded; and so on. 3. On the nth and last day, the remaining n medals were awarded. How many days did the contest last, and how many medals were awarded altogether? -- 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] Re: C o/p gud one try
please do answer geeks me waiting
On Mon, Mar 28, 2011 at 11:14 PM, ArPiT BhAtNaGaR
arpitbhatnagarm...@gmail.com wrote:
#includestdio.h
main()
{
long x;
float t;
scanf(%f,t);
printf(%d\n,t);
x=90;
printf(%f\n,x);
{
x=1;
printf(%f\n,x);
{
x=30;
printf(%f\n,x);
}
printf(%f\n,x);
}
x==9;
printf(%f\n,x);
}
o/p on gcc compiler
20.3 (i/p given)
-1073741824
20.299988
20.299988
20.299988
20.299988
20.299988
plz explain the o/p
--
Arpit Bhatnagar
(MNIT JAIPUR)
--
Arpit Bhatnagar
(MNIT JAIPUR)
--
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] 3 QA Testers/Analyst Tester/Analyst (3), preferably local who can do F2F -- F2F Required
Hello Friends, Please go through the below requirement and let me know if you have any consultant for the below position. *Job Title: 3 QA Testers/Analyst Tester/Analyst (3), preferably local who can do F2F Location: Westborough, MA Duration: 6 months contract. Rate: $38hr on CTC * This individual should have a minimum of 5 years experience within a financial services firm. Primary responsibilities include: Test Planning - participate in the development of test plans. Use of Test Tools - performance of testing using: Defect tracking tools and manual tools such as check lists, test scripts, and decision tables; use of other test tools; providing technical support for test tools in a test organization. Test Case Design - designing test cases based on a written statement of requirements; designing test cases based on software structure; designing test cases based on business or operational scenarios. Test Execution - experience in executing tests; serving as a member of an independent test team. Defect Management - use of defect management tools for defect logging and reporting. Test Measurement - collecting test measurements. Maintaining a Test Environment - performing ongoing maintenance of a test environment (e.g. updating test data, adding new test data and test cases, coordinating new modules or tables to be added to the test environment); performing configuration management for a test environment. Thanks Leon Parker - l...@panzersolutions.com 203-983-9475 -- 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: C o/p gud one try
refer let us c by YK fr these type of ques
On Tue, Mar 29, 2011 at 10:07 PM, ArPiT BhAtNaGaR
arpitbhatnagarm...@gmail.com wrote:
please do answer geeks me waiting
On Mon, Mar 28, 2011 at 11:14 PM, ArPiT BhAtNaGaR
arpitbhatnagarm...@gmail.com wrote:
#includestdio.h
main()
{
long x;
float t;
scanf(%f,t);
printf(%d\n,t);
x=90;
printf(%f\n,x);
{
x=1;
printf(%f\n,x);
{
x=30;
printf(%f\n,x);
}
printf(%f\n,x);
}
x==9;
printf(%f\n,x);
}
o/p on gcc compiler
20.3 (i/p given)
-1073741824
20.299988
20.299988
20.299988
20.299988
20.299988
plz explain the o/p
--
Arpit Bhatnagar
(MNIT JAIPUR)
--
Arpit Bhatnagar
(MNIT JAIPUR)
--
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.
--
thezeitgeistmovement.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] Re: How to check whether a language isTuring Complete?
Cool. Getting an Idea. Thanks a lot for replies guys. On Mar 28, 12:50 pm, Carl Barton odysseus.ulys...@gmail.com wrote: Somewhat; HTML, CSS and SQL aren't programming languages anyway, they're markup, style sheets and query languages respectively. TXL would be an example of a programming language which isn't turing complete but can still do something. Being able to compute something doesn't make it turing complete, being able to compute anything which it is possible to compute is what makes it turing complete. On 28 March 2011 17:42, Karthik Jayaprakash howtechstuffwo...@gmail.comwrote: Thanks for your reply. I understood lot better than I was previously. So summing up your answers, A language is turing complete, if we can write infinite loops and primitive recursive function. Some of the non turing complete languages that I came across are HTML, CSS, SQL... From this can I assume, that a language is turing complete, if it computes something, rather than just trying to display a interface, or pull records. Coz languages like HTML CSS doesnt do anything to compute something, it just transforms one way of representation to another(HTML - browser readable code), where as C,C++ can compute something and can represent large mathematical problems. Am I right Pardon me if my question is stupid... Thanks.. On Mar 27, 4:07 pm, Wladimir Tavares wladimir...@gmail.com wrote: Theoretically, a language is Turing-complete if it computes all partial recursive functions, ie functions that include all the basic functions and is closed under composition, primitive recursion and minimization. Basic Functions zero () = 0 succ (x) = x +1 proj_i (x1, x2,..., xn) = xi Composition Let f1, f2, f3, fn eg partial recursive functions then h is defined by a composition iff h (x1,..., xn) = g (f1 (x1, .., xn), f2 (x1, ... , xn ),..., fn (x1,..., xn)) The notion of computability is established by Churh-Turing thesis. I believe our general computability is a very difficult task:) Wladimir Araujo Tavares *Federal University of Ceará * On Sun, Mar 27, 2011 at 3:56 PM, Carl Barton odysseus.ulys...@gmail.com wrote: To elaborate why; if your language suffers from the halting problem then it's pretty safe to say it's turing complete and infinite loops would allow you to achieve that. On 27 March 2011 19:03, Carl Barton odysseus.ulys...@gmail.com wrote: If you're not concerned about being that formal then having conditional branching statements and being able to write infinite loops would be a pretty good indication. On 27 March 2011 14:38, Karthik Jayaprakash howtechstuffwo...@gmail.comwrote: Hi, Thanks for replying. I am aware of that. But is there a practical way of checking it On Mar 26, 7:40 pm, Carl Barton odysseus.ulys...@gmail.com wrote: If it can simulate a universal turing machine then it is turing complete On 26 March 2011 22:34, Karthik Jayaprakash howtechstuffwo...@gmail.comwrote: Hi, Is there a way to check that if a language is Turing complete? Thanks. -- 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. -- 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. -- 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
Re: [algogeeks] Re: Ties The Rope With Minimum Cost ..Interesting For Geeks
yaar it was sooo easy,,,room mein aa utkarsh btata hun.. On Tue, Mar 29, 2011 at 6:05 AM, bittu shashank7andr...@gmail.com wrote: @utkarsh i was just about to put Huffman algo ..yes it is optimized answer to solve the problem @all basicaly we have to minimize the cost of intermediate path ,final o/p will obvious be the same Try Huffman algo 1st read what it is..dan u will able to figure out soln of this problem Hope i am clear , if missing something , correct me Thanks Reagrds Shashank Mani 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. -- 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] ***** PAK vs IND Live Match *****
World Cup2011 ** http://bit.ly/dEnau6 ** World Cup2011 India vs Pakistan live Score,live streaming India vs Pakistan,India vs Pakistan Live Match. -- 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.
