[algogeeks] Brain Teaser Digest Of The Week 28March-1st April
Hi Puzzle Digest Of The Week 28March-1st April *http://dailybrainteaser.blogspot.com/2011/03/28march.html?lavesh=lavesh* * * *http://dailybrainteaser.blogspot.com/2011/03/29march.html?lavesh=lavesh* * * *http://dailybrainteaser.blogspot.com/2011/03/30march.html?lavesh=lavesh* * * *http://dailybrainteaser.blogspot.com/2011/03/31march.html?lavesh=lavesh* * * *http://dailybrainteaser.blogspot.com/2011/04/1april.html?lavesh=lavesh* *Please subscribe and follow this blog to show your liking to the blog.* -- 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] graphs
Given a directed graph G, with V vertices and E edges. Each edge in E is associated with a real number ‘r’,a reliabilty factor with r between 0(exclusive) and 1(inclusive). You are also given a pair of nodes u and v. Find the most reliable path in the given graph from u to v. Input will be the graph represented as a matrix with the following format: * the number of vertices n. (therefore, A is an nxn matrix) * The elements of A, row-wise: (total n*n numbers) A(i,j) = 0 denotes that the edge (i,j) is not present A(i,j) between 0 (exclusive) and 1 (inclusive) indicates that the edge (i,j) is present with reliability A(i,j). Output: Your output will be a sequence of vertices giving the path from u to v such as 1,4,3,5,8,6,7 with u=1 and v=7. The output is thus a comma separated list of vertices giving the path from u to v. -- 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] CFP with Extended Deadline of Apr. 10: The 2011 International Conference on Foundations of Computer Science (FCS'11), USA, July 18-21, 2011
Dear Colleagues: Please share the announcement below with those who may be interested. Thank you, Organizing Committee CALL FOR PAPERS === Extended Paper Submission Deadline: April 10, 2011 FCS'11 The 2011 International Conference on Foundations of Computer Science July 18-21, 2011, Las Vegas, USA http://www.world-academy-of-science.org/ === You are invited to submit a full paper for consideration. All accepted papers will be published in the FCS conference proceedings (in printed book form; later, the proceedings will also be accessible online). Those interested in proposing workshops/sessions, should refer to the relevant sections that appear below. SCOPE: Topics of interest include, but are not limited to, the following: O Quantum Computing O Game theory and methods O Computational number theory O Logic in computer science O Theory of computing and formal systems O Automata and formal languages O Optimization methods O Coding theory O Novel data structures O Languages O Complexity theory (including circuit complexity) O Theory of parallel and distributed computing O Graph algorithms and graph drawing O Deduction O Combinatorics O Algorithms O Probabilistic and randomized methodologies O Approximation methods O Parametrized complexity (including Kolmogorov, ...) O Non-linear dynamics and chaos O Computational biology and bioinformatics O Cryptography O Novel compression methods O Database theory O Queuing methods O Pansystems O Foundations of computer security O Model checking and computer-aided verification O Models of computation O Computational geometry O Semantics, concurrency and type theory O Scheduling methods O Models of internet computing O Other emerging topics USEFUL WEB LINKS: To see the DBLP list of accepted papers of FCS 2009, go to: http://www.informatik.uni-trier.de/~ley/db/conf/fcs/fcs2009.html The DBLP list of accepted papers of FCS 2010 will soon appear at: http://www.informatik.uni-trier.de/~ley/db/conf/fcs/fcs2010.html FCS 2011 URL: http://www.world-academy-of-science.org/worldcomp11/ws/conferences/fcs11 IMPORTANT DATES: April 10, 2011: Submission of papers (about 5 to 7 pages) April 25-30, 2011: Notification of acceptance (+/- 6 days) May 7, 2011: Final papers + Copyright/Consent + Registration July 18-21, 2011: The 2011 International Conference on Foundations of Computer Science (FCS'11) ACADEMIC CO-SPONSORS: Currently being prepared - The Academic sponsors of the last offering of FCS (2010) included research labs and centers affiliated with (a partial list): University of California, Berkeley; University of Southern California; University of Texas at Austin; Harvard University, Cambridge, Massachusetts; Georgia Institute of Technology, Georgia; Emory University, Georgia; University of Minnesota; University of Iowa; University of North Dakota; NDSU-CIIT Green Computing Comm. Lab.; University of Siegen, Germany; UMIT, Austria; SECLAB (University of Naples Federico II + University of Naples Parthenope + Second University of Naples, Italy); National Institute for Health Research; World Academy of Biomedical Sciences and Technologies; Russian Academy of Sciences, Russia; International Society of Intelligent Biological Medicine (ISIBM); The International Council on Medical and Care Compunetics; Eastern Virginia Medical School the American College of Surgeons, USA. SUBMISSION OF PAPERS: Prospective authors are invited to submit their papers by uploading them to the evaluation web site at: http://world-comp.org Submissions must be uploaded by April 10, 2011 and they must be in either MS doc (but not docx) or pdf formats (about 5 to 7 pages - single space, font size of 10 to 12). All reasonable typesetting formats are acceptable (later, the authors of accepted papers will be asked to follow a particular typesetting format to prepare their final papers for publication.) Papers must not have been previously published or currently submitted for publication elsewhere. The first page of the paper should include: title of the paper, name, affiliation, postal address, and email address for each author. The first page should also identify the name of the Contact Author and a maximum of 5 topical keywords that would best represent the content of the paper. Finally, the name of the conference (ie, FCS) that the paper is being submitted for consideration must be stated on the first page. The length of the final/Camera-Ready papers (if accepted) will be limited to 7 (two-column IEEE style) pages. Each paper will be peer-reviewed by two experts in the field for originality, significance, clarity, impact, and soundness. In cases of contradictory recommendations, a
[algogeeks] printing a paragraph on a printer
Consider the problem of neatly printing a paragraph on a printer. The
input text is a sequence of n words of lengths l1, l2, l3, ……,ln,
measured in characters. We want to print this paragraph neatly on a
number of lines that hold a maximum of M characters each. Our
criterion of “neatness” is as follows. If given line contains words i
through j, where i ≤ j, and we leave exactly one space between words,
the number of extra space characters at the end of the line is M – j +
i – Σj{k=i} lk, which must be non-negative so that words fit on a
line. We wish to minimize the sum, over all lines except the last, of
the numbers of extra space characters at the ends of the lines. Design
an algorithm to print a paragraph of n words neatly on a printer.
--
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: finds a pair of close numbers
Hi , Use Hashing for That , for sum =12 arr[]={2,4,3,6,5,8,7}; store
in to hashtable for each index=0 in loop find sum-arr[index] so
fro sum =12 if we do index=1 a[1]=4 sum-a[1]=8 so stop it we have
done..hope make d perfect code.
time Complxity o(n) space size of hashtable
Let me me if anything wrong ??
Thanks Regrads
Shashank The Best Way to Escape From The Problem is Solve 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] Re: 28march
7 races. well explained by Dave. On Thu, Mar 31, 2011 at 11:00 AM, sourabh jakhar sourabhjak...@gmail.comwrote: answer is 6 races On Mon, Mar 28, 2011 at 11:53 PM, Dave dave_and_da...@juno.com wrote: 7 races. For the first five races, divide the horses into groups of five and record the win, place, and show finishers of each race. For the sixth race, run the winners of the first five races. Now, only six horses remain in contention for the fastest three: The winner of the sixth race and the place and show horses of his first race, The place horse in the sixth race and the place horse in his first race. The show horse in the sixth race. Three of these horses are known to be faster than all other horses. The winner of the sixth race is known to be the fastest horse. Run the other five contenders in race 7 and choose the fastest two. Dave On Mar 28, 2:54 am, Lavesh Rawat lavesh.ra...@gmail.com wrote: *Horse Race Problem Solution* * *Ok, so there are 25 horses and the race track only allows 5 horses to race at a given time. Given that there is no stop watch available your task is to determine the fastest 3 horses. Assume that each horses speed is constant in different races, what is the minimum number of races to determine the fastest 3? Update Your Answers at : Click Here http://dailybrainteaser.blogspot.com/2011/03/28march.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. -- SOURABH JAKHAR,(CSE)(3 year) ROOM NO 167 , TILAK,HOSTEL 'MNNIT ALLAHABAD The Law of Win says, Let's not do it your way or my way; let's do it the best way. -- 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 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.
