Re: [algogeeks] Amazon Online Test
U need to construct a binary tree given only PreOrder traversal with the condition that each node has zero or two children. On Wed, Feb 23, 2011 at 10:52 AM, murthy.krishn...@gmail.com murthy.krishn...@gmail.com wrote: hii vinay, can u elaborate the third question thanks, Krishna On Wed, Feb 23, 2011 at 9:34 AM, vinay reddy gvina...@gmail.com wrote: Hi Anurag, I have taken that online test there were 3 questions ... 1. given a linked list check if it is a palindrome. 2.given two sorted arrays a[m] b[2*m], each contains m elements only. You need to merge those two arrays into second array b[2*m] 3. construct a Binary tree from a given String, where every node has zero or two children. e.g String = NNNLLL , N represents internal Node , L represents leaf Node. The alloted time was 1hr. and asked to write the function only ... no main function and all. hope this helps Thanks vinay On Wed, Feb 16, 2011 at 3:45 PM, Anurag Bhatia abhati...@gmail.comwrote: Has anyone give any first round online test for Amazon? If yes, can you please share details? --Anurag -- 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.
Re: [algogeeks] Amazon Online Test
thanks vinay :-) On Wed, Feb 23, 2011 at 5:39 PM, vinay reddy gvina...@gmail.com wrote: U need to construct a binary tree given only PreOrder traversal with the condition that each node has zero or two children. On Wed, Feb 23, 2011 at 10:52 AM, murthy.krishn...@gmail.com murthy.krishn...@gmail.com wrote: hii vinay, can u elaborate the third question thanks, Krishna On Wed, Feb 23, 2011 at 9:34 AM, vinay reddy gvina...@gmail.comwrote: Hi Anurag, I have taken that online test there were 3 questions ... 1. given a linked list check if it is a palindrome. 2.given two sorted arrays a[m] b[2*m], each contains m elements only. You need to merge those two arrays into second array b[2*m] 3. construct a Binary tree from a given String, where every node has zero or two children. e.g String = NNNLLL , N represents internal Node , L represents leaf Node. The alloted time was 1hr. and asked to write the function only ... no main function and all. hope this helps Thanks vinay On Wed, Feb 16, 2011 at 3:45 PM, Anurag Bhatia abhati...@gmail.comwrote: Has anyone give any first round online test for Amazon? If yes, can you please share details? --Anurag -- 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 this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Amazon Online Test
hii vinay, the prob is we can get many such trees given a preorder traversal with the condition that each node has zero or two children. Please correct me if I am wrong. Thanks, Krishna. On Wed, Feb 23, 2011 at 6:00 PM, murthy.krishn...@gmail.com murthy.krishn...@gmail.com wrote: thanks vinay :-) On Wed, Feb 23, 2011 at 5:39 PM, vinay reddy gvina...@gmail.com wrote: U need to construct a binary tree given only PreOrder traversal with the condition that each node has zero or two children. On Wed, Feb 23, 2011 at 10:52 AM, murthy.krishn...@gmail.com murthy.krishn...@gmail.com wrote: hii vinay, can u elaborate the third question thanks, Krishna On Wed, Feb 23, 2011 at 9:34 AM, vinay reddy gvina...@gmail.comwrote: Hi Anurag, I have taken that online test there were 3 questions ... 1. given a linked list check if it is a palindrome. 2.given two sorted arrays a[m] b[2*m], each contains m elements only. You need to merge those two arrays into second array b[2*m] 3. construct a Binary tree from a given String, where every node has zero or two children. e.g String = NNNLLL , N represents internal Node , L represents leaf Node. The alloted time was 1hr. and asked to write the function only ... no main function and all. hope this helps Thanks vinay On Wed, Feb 16, 2011 at 3:45 PM, Anurag Bhatia abhati...@gmail.comwrote: Has anyone give any first round online test for Amazon? If yes, can you please share details? --Anurag -- 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 this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Pairwise Sum Array
If pairwise sums of 'n' numbers are given in non-decreasing order identify the individual numbers. If the sum is corrupted print -1 Example: i/p: 4 5 7 10 12 13 o/p: 1 3 4 9 Thanks Regards 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]
can anyone help?? how to convert a string into a palindrome..with MINIMUM NUMBER OF SUBSTITUTIONS ( operations..) -- 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.
Re: [algogeeks]
Dynamic Programming :P On Wed, Feb 23, 2011 at 7:19 PM, Balaji S balaji.ceg...@gmail.com wrote: can anyone help?? how to convert a string into a palindrome..with MINIMUM NUMBER OF SUBSTITUTIONS ( operations..) -- 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.
[algogeeks] Re: amazon
Are you talking about IPC? On Feb 22, 10:05 am, jaladhi dave jaladhi.k.d...@gmail.com wrote: What do you mean by data element here ? Also by file you mean the file where you wrote the code ? And above all which programming language are we talking ? You hit send button too early I guess :) On 22-Feb-2011 7:39 PM, jalaj jaiswal jalaj.jaiswa...@gmail.com wrote: Is there any way by which a data element in a file is accessible by another file, where the program has multiple files. That data element should be accessible to a particular file only and inaccessible to the rest.? declaring it as an extern will make it accessible to all i think .. what cud be the answer ? -- With Regards, *Jalaj Jaiswal* (+919019947895) Software developer, Cisco Systems B.Tech 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. -- 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] Call For Papers: The 2011 International Conference on e-Learning, e-Business, EIS, and e-Government (EEE'11), USA, July 18-21, 2011
Dear colleagues: We would be very grateful if you would share the appended announcement with those who may be interested. Thank you - Steering Committee, EEE CALL FOR PAPERS and Call For Workshop/Session Proposals EEE'11 The 2011 International Conference on e-Learning, e-Business, Enterprise Information Systems, and e-Government Date and Location: 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 EEE conference proceedings (in printed book form; later, the proceedings will also be accessible online) - the proceedings will be indexed in Inspec / IET / The Institute for Engineering Technology, DBLP / Computer Science Bibliography, and others. Those interested in proposing workshops/sessions, should refer to the relevant sections that appear below. The main keynote lecture will be delivered by Prof. David Lorge Parnas (Fellow of IEEE, ACM, RSC, CAE, GI; MRIA); there will also be 8 other distinguished speakers, 12 planned tutorials and panel discussions as well as about 75 research paper presentations. SCOPE: Topics of interest include, but are not limited to, the following: O e-Learning: - e-Learning design and methodologies - e-Learning portals - Instructional design methodologies - Audio and video technologies for e-Learning - Authoring tools - e-Learning technologies and tools - Social impact and cultural issues in e-Learning - Content management and development - Policy issues in e-Learning - On-demand e-Learning - e-Learning standards - Learning tools and strategies - Assessment methodologies - Knowledge management - Virtual learning environments - AI and e-Learning - On-line education (all levels: elementary, secondary, ...) - Open-source e-Learning platforms - Training and evaluation strategies - e-Universities - Case studies and emerging applications O e-Business: - e-Business systems integration and standardization - Electronic negotiation systems and protocols - Internet payment systems - e-Procurement methods - Techniques for B2B e-Commerce - Global e-Commerce and e-Business - e-Business models and architectures - Service-oriented e-Commerce - Trust, security, and privacy in e-Commerce and e-Business - Intelligence in e-Commerce - Secure Databases and e-Commerce applications - Business-oriented and consumer-oriented e-Commerce - Development of e-Business and applications - e-Business in developing countries - Novel marketing strategies on the web - Organizational and management issues - Supply chain management - e-Retailing and web design - Applications of new technologies to e-Business - Middleware technologies to support e-business - Case studies and applications O Enterprise Information Systems: - Strategic decision support systems - Organizational semiotics and semiotics in computing - Datacenters, data warehouses and technologies - Knowledge management - Enterprise resource planning and e-Business - middleware integration - Intranet and extranet business applications - Databases and information systems integration - Intelligent agents - Enterprise-wide client-server architectures - Information systems analysis and specification - Ontology engineering - CASE tools for system development - B2B and B2C applications - Business processes re-engineering - Market-spaces: market portals, hubs, auctions, ... - Semantic web technologies and Cloud computing - Web interfaces and usability - Human factors and e-Learning - Case studies and applications O e-Government: - e-Democracy and e-Voting - e-Government - Use of e-Government methodologies to prevent corruption - Legal aspects of e-Government - Risk management - Methods and tools for e-Government - Policies and strategies - Designing web services for e-Government - Trust and security in e-Government - Enterprise architecture for e-Government - Interoperability frameworks in e-Government - Inter-administration and G2G issues - Public and private partnership - Teaching e-Government - Case studies USEFUL WEB LINKS: The DBLP list of accepted papers of EEE 2010 appears at: http://www.informatik.uni-trier.de/~ley/db/conf/csreaEEE/csreaEEE2010.html The main web site of EEE'11 can be found via: http://www.world-academy-of-science.org/ IMPORTANT DATES: March 10, 2011: Submission of papers (about 5 to 7 pages) April 03, 2011: Notification of acceptance (+/- two days) April 24, 2011:
[algogeeks] Re: Amazon Online Test
with the given constraints there is only one possible tree Regards Aviral http://coders-stop.blogspot.com On Feb 23, 5:47 pm, murthy.krishn...@gmail.com murthy.krishn...@gmail.com wrote: hii vinay, the prob is we can get many such trees given a preorder traversal with the condition that each node has zero or two children. Please correct me if I am wrong. Thanks, Krishna. On Wed, Feb 23, 2011 at 6:00 PM, murthy.krishn...@gmail.com murthy.krishn...@gmail.com wrote: thanks vinay :-) On Wed, Feb 23, 2011 at 5:39 PM, vinay reddy gvina...@gmail.com wrote: U need to construct a binary tree given only PreOrder traversal with the condition that each node has zero or two children. On Wed, Feb 23, 2011 at 10:52 AM, murthy.krishn...@gmail.com murthy.krishn...@gmail.com wrote: hii vinay, can u elaborate the third question thanks, Krishna On Wed, Feb 23, 2011 at 9:34 AM, vinay reddy gvina...@gmail.comwrote: Hi Anurag, I have taken that online test there were 3 questions ... 1. given a linked list check if it is a palindrome. 2.given two sorted arrays a[m] b[2*m], each contains m elements only. You need to merge those two arrays into second array b[2*m] 3. construct a Binary tree from a given String, where every node has zero or two children. e.g String = NNNLLL , N represents internal Node , L represents leaf Node. The alloted time was 1hr. and asked to write the function only ... no main function and all. hope this helps Thanks vinay On Wed, Feb 16, 2011 at 3:45 PM, Anurag Bhatia abhati...@gmail.comwrote: Has anyone give any first round online test for Amazon? If yes, can you please share details? --Anurag -- 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 this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Pairwise Sum Array
This s a topcoder problem :) On Wed, Feb 23, 2011 at 7:16 PM, bittu shashank7andr...@gmail.com wrote: If pairwise sums of 'n' numbers are given in non-decreasing order identify the individual numbers. If the sum is corrupted print -1 Example: i/p: 4 5 7 10 12 13 o/p: 1 3 4 9 Thanks Regards 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. -- 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] Combine deep analytics technology of IBM's Watson jeopardy winning supercomputer with evolutionary computing to add invention and innovation to analysis.
Combine deep analytics technology of IBM's Watson jeopardy winning supercomputer with evolutionary computing, including Genetic Programming to add invention and innovation to analysis. Use this on all STEM Disciplines ie Science Technology Engineering and Mathematics, including Electronics and Computer Science, as well as Healthcare and Medicine. -- 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: Lets C Who Really Loves Perfect Square .................
Try this:
int i,k,n;
long long j,nsq;
for( n = 31623 ; n 10 ; ++n )
{
nsq = (long long)n * (long long)n;
j = nsq;
k = 0;
for( i = 0 ; i 10; ++i )
{
k |= (1 (j % 10));
j /= 10;
}
if( k == 01777 )
printf(%i %lli\n,n,nsq);
}
It finds 76 answers in the blink of an eye, the first being 32043^2
and the last being 99066^2.
Dave
On Feb 22, 3:17 pm, bittu shashank7andr...@gmail.com wrote:
How to find a number of 10 digits (non repeated digits) which is a
perfect square? perfect square examples: 9 (3x3) 16 (4x4) 25(5x) etc.
Ten digit number example 1,234,567,890
Thanks Regards
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.
