tag:blogger.com,1999:blog-32064785.post4988565250416814573..comments2024-03-26T17:31:24.100+05:30Comments on Freshers Interviews: Google Interview Questionschaitanyahttp://www.blogger.com/profile/05855949584266440305noreply@blogger.comBlogger11125tag:blogger.com,1999:blog-32064785.post-65649040203315204512015-08-14T22:21:39.566+05:302015-08-14T22:21:39.566+05:30Thank you for such a wonderful Information !!
Her...Thank you for such a wonderful Information !!<br /><b> Here is a list of Top LINUX INTERVIEW QUESTIONS<br><br /><a href="http://linux.amitmaheshwari.in/2015/07/veritas-cluster-interview-questions.html" rel="nofollow">Veritas Cluster Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/07/commands-used-in-redhat-cluster-suite.html" rel="nofollow">Redhat Cluster Suite Commands </a><br><br /><a href="http://linux.amitmaheshwari.in/2015/07/samba-server-interview-questions.html" rel="nofollow">SAMBA Server Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/01/linux-ftp-vsftpd-interview-questions.html" rel="nofollow">Linux FTP vsftpd Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/01/ssh-interview-questions-and-answers.html" rel="nofollow">SSH Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/01/apache-interview-questions.html" rel="nofollow">Apache Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/01/nagios-interview-questions.html" rel="nofollow">Nagios Interview questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2014/11/iptables-tutorials.html" rel="nofollow">IPTABLES Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/01/ldap-server-interview-questions.html" rel="nofollow">Ldap Server Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/01/lvm-interview-questions.html" rel="nofollow">LVM Interview questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/01/sendmail-server-interview-questions.html" rel="nofollow">Sendmail Server Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/01/yum-interview-questions-and-answers.html" rel="nofollow">YUM Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/01/yum-interview-questions-and-answers.html" rel="nofollow">NFS Interview Questions</a><br><br /><a href="http://linux.amitmaheshwari.in/2015/08/tcpdump-command-examples-usages.html" rel="nofollow"> Tcpdump Command Examples & Usages </a><br><br /><a href="http://linux.amitmaheshwari.in/2015/08/example-of-yum-command-in-rhel-linux.html" rel="nofollow"> Example of YUM Commands </a><br><br />Read More at :- <a href="http://linux.amitmaheshwari.in" rel="nofollow">Linux Troubleshooting </a></b><br />Domain KINGhttps://www.blogger.com/profile/14652297000553299207noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-52551752281022805132013-04-15T13:42:50.948+05:302013-04-15T13:42:50.948+05:30Hi
Tks very much for post:
I like it and hope th...Hi<br /><br />Tks very much for post:<br /><br />I like it and hope that you continue posting.<br /><br />Let me show other source that may be good for community.<br /><br />Source: <a href="http://freeinterviewquestions.net/" rel="nofollow">Free interview questions</a><br /><br />Best rgs<br />David<br /><br />Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-32064785.post-68234834312323064952012-07-20T23:35:24.714+05:302012-07-20T23:35:24.714+05:30you done a good job.thanks for that.its very usefu...you done a good job.thanks for that.its very usefulAnandnoreply@blogger.comtag:blogger.com,1999:blog-32064785.post-62911570068013184862012-01-30T15:58:42.518+05:302012-01-30T15:58:42.518+05:30Nice post. I really like it. Thank you for sharing...Nice post. I really like it. Thank you for sharing.<br /><br /><a href="http://www.campusrecruitments.com/Bank/bankupcomingexams.html" rel="nofollow">Upcoming Bank Exams</a>Educationhttps://www.blogger.com/profile/15632089902231469280noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-88808031473445495702011-07-12T00:19:41.545+05:302011-07-12T00:19:41.545+05:30thank u for sharing..thank u for sharing..Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-32064785.post-56306759855945687342011-06-09T13:04:45.858+05:302011-06-09T13:04:45.858+05:30I haven't attended yet...but thanx for posting...I haven't attended yet...but thanx for posting...it is really going to help me in my interview...!!!!sharkyhttps://www.blogger.com/profile/02681721784792471521noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-1768885218982899332010-11-02T01:59:53.903+05:302010-11-02T01:59:53.903+05:30An alternative solution to problem Interview 4, pr...An alternative solution to problem Interview 4, problem 1 involves backtracking.<br />#include<br />#include<br />bool Interleaved(char *a, char *b, char *c)<br />{<br /> if(*c==0 && (*a!=0 || *b!=0))<br /> return false;<br /> if(*a == 0 && *b == 0 && *c == 0)<br /> return true;<br /> if(*a==*c && *b!=*c)//If no ambiguity move ahead<br /> return Interleaved(a+1, b, c+1);<br /> else if(*a!=*c && *b==*c)//If no ambiguity move ahead<br /> return Interleaved(a, b+1, c+1);<br /> else if(*a==*c && *b==*c)//Else test which case gives true in the long run.<br /> return Interleaved(a+1, b,c+1) || Interleaved(a, b+1, c+1);<br /> return false;<br />}<br />int main()<br />{<br /> char a[100], b[100], c[100];<br /> strcpy(a, "abcd");<br /> strcpy(b, "adcd");<br /> strcpy(c, "adcadcbd");<br /> if(Interleaved(a,b,c))<br /> printf("Is interleaved\n");<br /> else<br /> printf("Is not interleaved\n");<br />}Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-32064785.post-36992048480039321052009-11-29T02:46:35.522+05:302009-11-29T02:46:35.522+05:30unfortunately for the above solution, the array wo...unfortunately for the above solution, the array would have to be sorted, which would require additional effort and much greater time complexity. I think the one given in the post is a good one. It doesnt need a sorted arrayAnonymousnoreply@blogger.comtag:blogger.com,1999:blog-32064785.post-42014126095832620292009-05-23T22:36:56.180+05:302009-05-23T22:36:56.180+05:30The answer I thought of for finding the missing nu...The answer I thought of for finding the missing number in a 1 .. N-1 array has lower time complexity than the one given here. It works as follows:<br /><br />Perform a modified version of a binary search on the array. Create a lower pointer to the head of the array and an upper pointer to the tail of the array. Start by looking at the middle element of the array, (N-1)/2. If it is equal to (N-1)/2, hence it is less than the missing number, move the lower pointer to the element. If it is greater than (N-1)/2, hence it is greater than the missing number, move the upper pointer to the element. Then repeat by looking at the element halfway between the pointers; if it is equal to its index, move the lower pointer to it, else move the upper pointer to it. Repeat until the pointers are adjacent to each other; the missing number is array[lower pointer] + 1.<br /><br />This algorithm has time complexity of O(log n) since it is basically a worst-case binary search. The summation algorithm has a time complexity of O(n), because it has to add up all the elements of the array. So this algorithm is better.Andyhttps://www.blogger.com/profile/05026314411329924262noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-66988028226058915052008-06-08T10:41:00.000+05:302008-06-08T10:41:00.000+05:30hmm..it's not same for all, This interview was don...hmm..it's not same for all, This interview was done by Google india for New graduates here. I am not sure how the interview process in japan would be, but i am sure that these questions may help you before going to interview.chaitanyahttps://www.blogger.com/profile/05855949584266440305noreply@blogger.comtag:blogger.com,1999:blog-32064785.post-70159074962653827312008-06-08T06:56:00.000+05:302008-06-08T06:56:00.000+05:30Is it the same interview for new graduates ? Becau...Is it the same interview for new graduates ? Because I'll have the Google Japan interview on monday and now... I'm freaking out :SAnonymousnoreply@blogger.com