[algogeeks] Interns Required
Hello all, We at Mindtickle (Pune based) are looking to hire some interns having interest and experience in *JS / frontend*. People having a break in next two months would be very suitable, but others are also encouraged to reach out. 6 months interns would be even better. The work will be focusing mostly on JS / front end. You'd be required to write production code in existing JS infra and develop some new modules. This will be a great chance to learn from experienced people and get an exposure in writing production grade applications. If interested, reply to this email with following details : - Duration available for work. - College and Branch. -- Prateek Gupta MNNIT Allahabad. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
Re: [algogeeks] VIDEO STREAMING
@kartik +1:P :P PS : pardon the pun. On Sat, Nov 24, 2012 at 11:42 AM, Kartik Sachan wrote: > > hey anybody has any idea about video streaming using vlcj lib ?? > > > -- > > *WITH REGARDS, > > *KARTIK SACHAN > B.Tech. Final Year > Computer Science And Engineering > Motilal Nehru National Institute of Technology,Allahabad > Phone No: +91-9451012943 > E-mail: kartik.sac...@gmail.com > > > -- > > > --
[algogeeks] Re: Class Doubt
In c++ we have default copy constructor ,which is called when we use
statement like e2=e;ie when object are of same class type.
On Aug 28, 3:29 pm, ravi maggon wrote:
> Hi
> Can you explain the below mentioned code. As far as I know we need to
> overload = operator in order to equate object of a class and below code
> should give error. But it is running perfectly on gcc compiler. Please
> correct me if I am wrong at some point.
>
> #include
> using namespace std;
>
> class emp
> {
> public:
> char *n;
> int age;};
>
> int main ()
> {
> emp e={"xyz",21};
> emp e2;
> e2=e;
> printf("%d",e2.age);
> system("pause");
>
> }
>
> --
>
> Regards
> Ravi Maggon
--
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] elitmus test
prepare well for di, quant and va are easy but di is really hard. 1 ques that often appears in their test is ABC * EFG - 7JK L4N PQR --- --- some conditions will be given and you have to find which number does a particular character given in ques represents. On Thu, Aug 25, 2011 at 9:49 AM, prasanna wrote: > Hi > Whosoever have taken the elitmus test, pls share the type of questions > asked in the test. > > -- > 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: regarding amdocs interview questions
@abhishek yes i am appearing through offcampus drive.plz tell me regarding sql and unix preparation as i belong to ECE and don't have good knowledge of these subjects. On Aug 16, 1:29 pm, abhishek wrote: > @ prateek > > r u appearing offcampus??? from which college u r? > just brush up ur c concepts like array,dynamic memory allocation and > pointers. and sql is very important like view,index .. and little bit > imp commands of unix > > On 8/15/11, prateek gupta wrote: > > > > > > > > > hey guys, > > Tell me aboutamdocsinterview questions and also post the good links > > for preparation as my interview is scheduled on friday. > > thanks in advance. > > Regards > > Prateek Gupta > > > -- > > 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] regarding amdocs interview questions
hey guys, Tell me about amdocs interview questions and also post the good links for preparation as my interview is scheduled on friday. thanks in advance. Regards Prateek Gupta -- 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] string easy question
When the strings are equal then strcmp returns zero so your condition will
become if (0).
In order to correct it use
if(strcmp(str1,str2)==0)
pritnf("equal");
else
Unequal.
On Tue, Aug 2, 2011 at 7:47 PM, Vijay Khandar wrote:
> #include
> #include
> #include
> void main()
> {
> clrscr();
> char str1[]="Hello";
> char str2[]="Hello";
> int i;
> if(strcmp(str1,str2))
> printf ("\n Equal");
> else
> printf("\n Unequal");
> getch();
> }
>
> Plz anyone explain me o/p with explanation.
>
> Vijay
>
> --
> 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.
>
>
--
Prateek Gupta
7th sem, Information Technology,
Netaji Subhas Institute Of Technology
Delhi.
--
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: MS c output ques
it prints the first n characters of the string that matches any character of "india". The printing stops as soon as the first character different from the characters of "india" is encountered. On Mon, Aug 1, 2011 at 9:36 PM, ramya reddy wrote: > > Hey all, > > I have a doubt . > what if there is no xor operator.. > what if it is simply %[india]..how it behaves? > -- > Regards > Ramya > * > * > *Try to learn something about everything and everything about 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. > -- Prateek Gupta 7th sem, Information Technology, Netaji Subhas Institute Of Technology Delhi. -- 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] puzzle
Can anyone plz tell me 1. how to get a fair result from a unfair coin? 2. How to use a fair coin to get unfair result? -- Prateek Gupta -- 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] Any help on bits?
C= A^B then count number of bits set in C. On Sun, Jul 31, 2011 at 5:52 PM, Nikhil Gupta wrote: > Given two integers A & B. Determine how many bits required to convert A to > B. Write a function int BitSwapReqd(int A, int B); > > -- > Nikhil Gupta > > -- > 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. > -- Prateek Gupta 7th sem, Information Technology, Netaji Subhas Institute Of Technology Delhi. -- 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] quick sort query
void quicksort( T[] A, Integer left, Integer right) if ( left < right ) q = partition( A, left, right) ; quicksort ( A, left, q–1); quicksort ( A, q+1, right) ; Integer partition( T[] A, Integer left, Integer right) m = left + right / 2; swap( A[left], A[m]); pivot = A[left] ; lo = left+1; hi = right; while ( lo ≤ hi ) while ( A[hi] > pivot ) hi = hi – 1; while ( lo ≤ hi and A[lo] < ∼ pivot ) lo = lo + 1; if ( lo ≤ hi ) swap( A[lo], A[hi]); lo = lo + 1; hi = hi – 1; swap( A[left], A[hi]); return hi plz tell me the case for (lo=hi) in while loop in partition. -- 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] string matching
yup, got it thanks!!! On Thu, Jun 23, 2011 at 11:27 AM, sunny agrawal wrote: > last line is > *in worst case k=1 only 2*n comparisons will be there hence O(n)* > > > > On Thu, Jun 23, 2011 at 11:26 AM, sunny agrawal > wrote: > >> Lets Consider the case of Naive matching in which at some shift s first k >> characters are matched and next character does not match so instead of >> starting from s+1 shift we can safely jump to s+k because all characters of >> pattern are distinct >> in worst case k=1 only an comparisons will be there hence O(n) >> >> On Thu, Jun 23, 2011 at 11:19 AM, Piyush Sinha >> wrote: >> >>> >>> Read KMP algorithm.. >>> >>> >>> On Thu, Jun 23, 2011 at 11:17 AM, prateek gupta >>> wrote: >>> >>>> In naive string matching how can the knowledge abt. pattern that it has >>>> all different characters can be used to accelerate the algorithm to O(n) . >>>> >>>> -- >>>> 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. >>> >> >> >> >> -- >> Sunny Aggrawal >> B-Tech IV year,CSI >> Indian Institute Of Technology,Roorkee >> >> > > > -- > Sunny Aggrawal > B-Tech IV year,CSI > Indian Institute Of Technology,Roorkee > > -- > 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] string matching
In KMP there is a pre processing time of O(m). which is not there in naive. The question says to accelerate naive string matching. On Thu, Jun 23, 2011 at 11:19 AM, Piyush Sinha wrote: > > Read KMP algorithm.. > > > On Thu, Jun 23, 2011 at 11:17 AM, prateek gupta wrote: > >> In naive string matching how can the knowledge abt. pattern that it has >> all different characters can be used to accelerate the algorithm to O(n) . >> >> -- >> 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. > -- 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] string matching
In naive string matching how can the knowledge abt. pattern that it has all different characters can be used to accelerate the algorithm to O(n) . -- 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] is it correct??
no the no of elements in an array should be known to compiler before execution of the program. On Tue, Jun 14, 2011 at 8:09 PM, amit wrote: > is such a declaration correct: > cin>>x; > int a[x]; > > -- > 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] help
the expression involving and and or operator is evaluated from left to right
uptill the point from where the value of the expression can be determined.
On Mon, Jun 13, 2011 at 6:17 PM, Shachindra A C wrote:
> || and && operators are called short circuit operators and need not
> necessarily evaluate the entire expression. In ex 1, m= ++i && ++j || ++k;
> here, ++i and ++j are done. then the result is orred with ++k; here,
> irrespective of the value of the right side(++k), the result would always be
> 1. Hence, the results.
>
>
> On Mon, Jun 13, 2011 at 6:12 PM, sahil wrote:
>
>> can sme body tell me..?
>>
>> 1)
>> #include
>> int main()
>> {
>> int i= -3, j=2 ,k=0, m;
>> m= ++i && ++j || ++k;
>> printf("%d %d %d %d\n",i,j,k,m);
>> return 0;
>>
>> }
>> output:
>> -2 3 0 1
>>
>> 2)#include
>> int main()
>> {
>> int i= -3, j=2 ,k=0, m;
>> m= ++i || ++j && ++k;
>> printf("%d %d %d %d\n",i,j,k,m);
>> return 0;
>>
>> }
>>
>> output:
>> -2 2 0 1
>>
>>
>> 3)
>> #include
>> int main()
>> {
>> int i= -3, j=2 ,k=0, m;
>> m= ++i && ++j && ++k;
>> printf("%d %d %d %d\n",i,j,k,m);
>> return 0;
>>
>> }
>>
>> output:
>> -2 3 1 1
>>
>>
>>
>> how came this output.???
>> in the first code why..k is not incremented.??
>> and hw the value of m came out to be 1...?
>>
>>
>> --
>> 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,
> Shachindra A C
>
> --
> 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] Re: find error
its working in dev-cpp. On Sun, Jun 12, 2011 at 10:40 AM, Balaji S wrote: > no error ryt?? > > -- > 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.
