Re: [algogeeks] plzzzzzzzz heeeppppp!!!!!!!!!!1

Its an open ended question for the New Guys.. So.. here its some analysis.. If its project is R&D with high profile org like Amazon.. Google.. SDET is Developer in Test (Framework Developer for TESTING) but QA is a Complete Tester (Mostly No Code Work).. So SDET will develop in basically in So

Re: [algogeeks] plzzzzzzzz heeeppppp!!!!!!!!!!1

testing is very broad area of s/w development. first get clear about the job, when i was giving interview with MS for SDET, they said its developing test s/w for already build s/w. my view, testing requires more skills than developer, to find out the flaws in the code. Thank you, Sid. On Thu

Re: [algogeeks] program

Use hashing like counting sort... On Wed, Sep 14, 2011 at 11:20 AM, raj wrote: > program to find the top 3 repeating number from the given array > eg > You r given an array and u have to find out the top 3 repeated > numbers. > for ex: GAURAV[]={20,8,3,7,8,9,20,6,4,6,20,8,20} > so the output wi

Re: [algogeeks] plzzzzzzzz heeeppppp!!!!!!!!!!1

hello nikhil, suppose if we currently opt for testing OR consultant profile then Is it possible to switch to Software Development profile later on. plss tell me... On 9/15/11, Nikhil Kumar wrote: > Testing profile : You have to test the features

Re: [algogeeks] plzzzzzzzz heeeppppp!!!!!!!!!!1

Testing profile : You have to test the features developed by others.Kinda bruteforce work , you will be given a set of commands and a large no. of test cases.All you have to do is run commands and validate test cases again and again.Boring.Only periodic growth. Developers: Much better. You have to

Re: [algogeeks]

@rahul and @suarabh the program is giving different output on ubuntu and redhat.. is ubuntu and redhat deals shell differently On Thu, Sep 15, 2011 at 9:45 AM, rahul vatsa wrote: > @utkarsh, its opensuse. > > @saurabh, i agree wht u r saying i hd also checkd that in man p

Re: [algogeeks] plzzzzzzzz heeeppppp!!!!!!!!!!1

in my opinion developer profile is better than testing...one On Thu, Sep 15, 2011 at 10:57 AM, rahul sharma wrote: > hey guys plz tell the difference b/w testing n develp. profile ??? n > joing i n testing profile has growth as much as in develpoer???plz > tell soon..?should i go in testing prof

Re: [algogeeks] Math Puzzle

P+Q = -R (P+Q)3 = -R3 P3+Q3+3PQ(P+Q) = -R3 P3+Q3+R3 = =3PQ(P+Q) P3+Q3+R3 = 3PQR NOW, P2/QR+Q2/PR+R2/PQ=(P3+Q3+R3)PQR = 3 -- 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 unsu

Re: [algogeeks] Math Puzzle

P^2/QR+Q^2/PR+R^2/PQ = (P^3+Q^3+R^3)/PQR = ((P+Q+R)(P^2+Q^2+R^2-PQ-QR-PR)+3PQR)/PQR = 3 On 2011-9-15 13:29, rahul sharma wrote: hw? On Thu, Sep 15, 2011 at 10:57 AM, Tamanna Afroze > wrote: yah the ans is 3 -- You received this message because y

Re: [algogeeks] Math Puzzle

hw? On Thu, Sep 15, 2011 at 10:57 AM, Tamanna Afroze wrote: > yah the ans is 3 > > -- > 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 e

Re: [algogeeks] Math Puzzle

yah the ans is 3 -- 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 t

[algogeeks] plzzzzzzzz heeeppppp!!!!!!!!!!1

hey guys plz tell the difference b/w testing n develp. profile ??? n joing i n testing profile has growth as much as in develpoer???plz tell soon..?should i go in testing profile in lagre industry or in developer in medium scale...plz hepl -- You received this message because you are subscribed

Re: [algogeeks] Re: branching factor when BFS and DFS of a graph is same

@siddharam: i think the above example is isomorphic because in isomopic we check for the degree of each node in one tree to the corresponding degree of another tree is present or not . like eg:- p-q--r---s is isomorphic with a--b--c---d On Thu, Sep

Re: [algogeeks] OS

http://www.tenouk.com/WinVirtualAddressSpace.html go to this link. think it will help you... i On Wed, Sep 14, 2011 at 7:48 PM, teja bala wrote: > can any one tell the difference between ADDRESS SPACE and VIRTUAL > ADDRESS SPACE? > > thx in advance. > > -- > You received this message be

Re: [algogeeks] Math Puzzle

ans is 3 :) On Thu, Sep 15, 2011 at 10:35 AM, jestincobol nair wrote: > wat is p2 p's square?? > > > On Thu, Sep 15, 2011 at 10:26 AM, NAGARAJAN SIVARAMAN > wrote: > >> if P+Q+R= 0 then P2 /QR + Q2/PR + R2/PQ = ?? >> >> how to solve this?? >> >> -- >> You received this message because you are

Re: [algogeeks] Math Puzzle

wat is p2 p's square?? On Thu, Sep 15, 2011 at 10:26 AM, NAGARAJAN SIVARAMAN wrote: > if P+Q+R= 0 then P2 /QR + Q2/PR + R2/PQ = ?? > > how to solve this?? > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send

[algogeeks] Math Puzzle

if P+Q+R= 0 then P2 /QR + Q2/PR + R2/PQ = ?? how to solve this?? -- 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+unsu

Re: [algogeeks] Re: branching factor when BFS and DFS of a graph is same

as per your example preorder inorder tree1: ab ba tree2: ab ab both are not isomorphic. its easy to extend preorder/DFS to replace two calls to children with for loop considering the graph is N-array tree. Thank you, Sid. On Wed, Sep 14, 2011 at 5:50 PM, bugaboo

Re: [algogeeks]

@utkarsh, its opensuse. @saurabh, i agree wht u r saying i hd also checkd that in man page. nd hd tried @terminal with sh, and it hadn't expanded. bt wen i run this prog on my m/c, it gives the expanded output. linux-7ap5:/home/user/test # ls system.c linux-7ap5:/home/user/test # cat system.c #i

[algogeeks] InfoCepts Technology Pvt Ltd

InfoCepts Technology Pvt Ltd visited in any college?? tell me procedure -- Regards SOURABH KUMAR JAIN MCA, NIT RAIPUR MOB.-+919993878717 -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, se

Re: [algogeeks] Re: yahoo campus placements

k...bt its a gud 2 weeks lefti guess der wud be sm other clg visits b4 dat On Wed, Sep 14, 2011 at 9:22 PM, htross wrote: > please share the questions asked after the company visits ur campus > > > On Sep 14, 8:53 pm, Akash Mukherjee wrote: > > bit mesra, cg 7...dunno nething else :( > > >

Re: [algogeeks]

1) sort each array O(n lg(n)) 2) for(i=0;ihttp://groups.google.com/group/algogeeks?hl=en.

Re: [algogeeks]

If you go a bit deeper into the system calls that system makes you will realize that the argument is actually expanded as "sh -c echo {abc}{abc}{abc} The expansion facility is provided by bash but not sh.(You may verify my claim) The default shell is bash.*switch to sh mode and you will realize wha

Bls: [algogeeks] what is the output????

  Ndua Gunung Dari: Rohit Upadhyaya Kepada: algogeeks@googlegroups.com Dikirim: Rabu, 14 September 2011 15:07 Judul: Re: [algogeeks] what is the output can any1 explain me the fork() function??? -- You received this message because you are subscribed t

[algogeeks] Re: yahoo campus placements

please share the questions asked after the company visits ur campus On Sep 14, 8:53 pm, Akash Mukherjee wrote: > bit mesra, cg 7...dunno nething else :( > > On Wed, Sep 14, 2011 at 3:00 PM, rahul sharma wrote: > > > > > > > > > in which col it is cumingn wats is its procedure???waht is cgpa

Re: [algogeeks]

@rahul have you tried it n your system and if yes then which os? On Thu, Sep 15, 2011 at 2:28 AM, UTKARSH SRIVASTAV wrote: > yes it's giving wrong output on terminal using gcc compiler in ubuntu > > > On Thu, Sep 15, 2011 at 1:25 AM, Amol Sharma wrote: > >> though it is giving the expected output

Re: [algogeeks]

yes it's giving wrong output on terminal using gcc compiler in ubuntu On Thu, Sep 15, 2011 at 1:25 AM, Amol Sharma wrote: > though it is giving the expected output on the ideone but i am not getting > the the output on the terminal using gcc compiler it is just printing > {a,b,c}{a,b,c}{a,b,c} .

[algogeeks] Re: Exchanging bit values in a number

On Sep 14, 10:27 pm, Gene wrote: > My solution just tests bit i and either sets or clears bit j based on > the result.  Then it does the same testing bit j and setting or > clearing bit i. > > There are many other possibilities.  It would be slick if C shift > operators accepted negative shift v

[algogeeks] Re: Exchanging bit values in a number

My solution just tests bit i and either sets or clears bit j based on the result. Then it does the same testing bit j and setting or clearing bit i. There are many other possibilities. It would be slick if C shift operators accepted negative shift values. But they don't. Instead you could shift

Re: [algogeeks]

though it is giving the expected output on the ideone but i am not getting the the output on the terminal using gcc compiler it is just printing {a,b,c}{a,b,c}{a,b,c} what could be the reason ? my OS- Ubuntu 10.04 @rahul what's ur os ? -- Amol Sharma Third Year Student Computer Scien

Re: [algogeeks]

http://ideone.com/WQxfK -- Amol Sharma Third Year Student Computer Science and Engineering MNNIT Allahabad On Thu, Sep 15, 2011 at 1:13 AM, ra

Re: [algogeeks]

i tried ur code & it gives the same output as wen u execute the command on terminal. On Wed, Sep 14, 2011 at 3:03 PM, UTKARSH SRIVASTAV wrote: > > if i write on terminal echo {a,b,c}{a,b,c}{a,b,c} then i get the output all > possible combination of a,b,c and if i write like this > > main() > { >

Re: [algogeeks]

for(i=0;i wrote: > *Write a program to find out the combination of an element of each array > gives a result 0.* > For example: > > array 1: {2,1,4,7} > array 1: {3,-3,-8,0} > array 1: {-1,-4,-7,6} > > > Output: > > pairs = > > {2,-8,6} > {1,3,-4} > {4,-3,-1} > {7,0,-7} > > -- > You received thi

Re: [algogeeks] find the error

ther is no get() function. On Wed, Sep 14, 2011 at 1:55 PM, Puneet Gautam wrote: > I think there is no problem with the while statement, even if file is > not present , it will create a new file... > The problem is with f.get()but dunno what...? > > > On 9/14/11, sandeep kumar wrote: > > if

[algogeeks]

*Write a program to find out the combination of an element of each array gives a result 0.* For example: array 1: {2,1,4,7} array 1: {3,-3,-8,0} array 1: {-1,-4,-7,6} Output: pairs = {2,-8,6} {1,3,-4} {4,-3,-1} {7,0,-7} -- You received this message because you are subscribed to the Google Gr

[algogeeks] matrix

Write a program for adding the outer elements of N*M matrix -- 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...@

[algogeeks] Re: MICROSOFT in VJTI mumbai

@Bharatkumar bagana : that is a standard Qs which uses line sweep algo and has O(n lgn) soln other than the trivial O(n^2) soln... google that Qs... @tej bala: out of 10.. 5-6 were output type obj Q... then 1 was what's full form of GCC... its gnu compiler collection.. i made mistake in this Q.. @d

[algogeeks] Re: MS test cases type Questions

U must mention all the boundary cases, very large input cases, -ve nos and must throw appropriate exception while coding during interviews... Questions are not too hard in MS... just they dont want buggy code... even if u allocate memory.. u should take an if condition i.e. if (p ! = NULL)...and av

Re: [algogeeks] find the error

I think there is no problem with the while statement, even if file is not present , it will create a new file... The problem is with f.get()but dunno what...? On 9/14/11, sandeep kumar wrote: > if file.txt is not present it gives a seg fault > and if the file is present then the problem is w

[algogeeks] Re: matrix

@Guna: The outer elements are a[i][j] with i = 0 or i = n-1 or j = 0 or j = m-1. Thus, something like this will do the trick: sum=0; for( i = 0 ; i < n ; ++i ) sum += a[i][0] + a[i][m-1]; for( j = 1 ; j < m-1 ; ++j ) sum += a[0][j] + a[n-1][j]; Dave On Sep 14, 12:35 pm, guna sekaran wro

Re: [algogeeks] C output

@ prateek absolutely wrong , dear u need to brushup ur basics d is a pointer , it's can be 2 or 4 depebding on compiler On Wed, Sep 14, 2011 at 6:26 AM, PRATEEK VERMA wrote: > 9 and 3 > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. >

[algogeeks] veeru chinta wants to chat

--- veeru chinta wants to stay in better touch using some of Google's coolest new products. If you already have Gmail or Google Talk, visit: http://mail.google.com/mail/b-eb7f62dde3-e529b22300-R5hRrNkLa-AUvgLu6HzvDygcHrQ You'll n

Re: [algogeeks] Re: MICROSOFT WRITTEN IN VASAVI

take an array containing all original upper-case letters and their smaller case letters and now the problem is reduced to print all substrings containing length of original string. On Wed, Sep 14, 2011 at 8:55 PM, teja bala wrote: > > //dis one works check it out.. > > #include > #in

[algogeeks] Re: Samsung India electronics pvt. ltd

can anybody plz tell SISO's package and are they recruiting for s/w developer??? On Aug 8, 4:57 pm, MANNU wrote: > SISO in our college have 50 Apti questions (1 hr) and 20 tech questions, all > on c (in 30 mins). > > Manish Kumar (Placed In SISO) > NIT DGP > FINAL YEAR. -- You received this mes

[algogeeks] Re: complexity of recursion

The complexity of a simple recursive implementation to find the fibonacci series is exponential complexity. But there are faster ways to compute the fibonacci series which are not exponential, so you really can't say that the complexity of the fibonacci series is exponential. Don On Sep 14, 11:08 

Re: [algogeeks] complexity of recursion

it is O(n) actually we use memoization in recursion to avoid calculating same subproblem. On Wed, Sep 14, 2011 at 9:38 PM, tech coder wrote: > > an interseting problem > > for a fibonacci series > the recurrence relation is > t(n)=t(n-1)+t(n-2)+O(1) > on solving it gives upper bound of O(n^2) > >

[algogeeks] Schneider electric !!

Has anyone attended schneider electric placement ?? if yes plz share ur experience it is coming after 2 days to my coll. -- 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 unsub

Re: [algogeeks] OS

Address Space: The total addresses taken up by a process is known as a process's address space On Wed, Sep 14, 2011 at 7:48 PM, teja bala wrote: > can any one tell the difference between ADDRESS SPACE and VIRTUAL > ADDRESS SPACE? > > thx in advance. > > -- > You received this message because

[algogeeks] complexity of recursion

an interseting problem for a fibonacci series the recurrence relation is t(n)=t(n-1)+t(n-2)+O(1) on solving it gives upper bound of O(n^2) but when draw tree for the recurcsion we see that it is growing exponentially giving a complexity of O(2^n). so what is the complexity for fibonaacci series

Re: [algogeeks] yahoo campus placements

bit mesra, cg 7...dunno nething else :( On Wed, Sep 14, 2011 at 3:00 PM, rahul sharma wrote: > in which col it is cumingn wats is its procedure???waht is cgpa > creteria? > > On Wed, Sep 14, 2011 at 6:26 PM, Akash Mukherjee wrote: > >> anybody has any yahoo campus placements papers/questions

Re: [algogeeks]

if you want the longest common subsecuence is a dynamic problem, there is a algorithm O(n*n) but you can solve it in (nlogn) with suffix array... If you want the longest substring read about suffix array, search in google about it!!!, "chococontest suffix array" <- there is a good tutorial

[algogeeks] Re: Which one is better to work for ThoughtWorks or Samsung

it depends upon your interst in which profile u r interested...at another prospective sansung famous cmpny but TW is not u can grow well in both... On Sep 14, 10:46 am, tech coder wrote: > Which one is better to work for  ThoughtWorks or Samsung. > ThoughtWorks package 5.86 >

Re: [algogeeks] Re: MICROSOFT WRITTEN IN VASAVI

//dis one works check it out.. #include #include #include #include void toggler(char* x, int pos) { if(pos==0){ printf("%s\n",x); return; } // printf("String is now: %s\n",x); x[pos-1] = toupper(x[pos-1]); toggler(x, pos-1); x[pos-1] = tolower(x[pos-1]); toggler(x, pos-1

Re: [algogeeks] samsung engineering lab interview..

its very simplein first round data interpretation n reasoning.. in second test ur c skilss copied questions and 10 from os and ds..totaly simple...then basic technical interview On Tue, Sep 13, 2011 at 9:23 PM, Rajeshwar Patra wrote: > Questions are asked mostly on os and c programmin

Re: [algogeeks] royal bank of scotland

they take elitmus test..and then interviewws On Wed, Sep 14, 2011 at 12:17 PM, deepikaanand wrote: > wat is selection procedure of RBS (for internships or placements) > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this gr

Re: [algogeeks] yahoo campus placements

in which col it is cumingn wats is its procedure???waht is cgpa creteria? On Wed, Sep 14, 2011 at 6:26 PM, Akash Mukherjee wrote: > anybody has any yahoo campus placements papers/questions or tips etc. > please share > > thanx in advance > > Akash > > -- > You received this message because y

Re: [algogeeks] Please share experiences if any body has faced Samsung Engineering Labs(SIEL)

hw much package it offeringn wich one cuming to ur college ???sel is in noida and siso in banglore.hw much it is offering On Wed, Sep 14, 2011 at 8:17 PM, Prags wrote: > @ghsjgl k - Plz tell me abt SISO rounds ??? > > On Mon, Aug 22, 2011 at 9:36 PM, ghsjgl k wrote: > >> i atten

Re: [algogeeks] Please share experiences if any body has faced Samsung Engineering Labs(SIEL)

@ghsjgl k - Plz tell me abt SISO rounds ??? On Mon, Aug 22, 2011 at 9:36 PM, ghsjgl k wrote: > i attended for SISO > > > On Mon, Aug 22, 2011 at 2:08 PM, saurabh wrote: > >> Can Please tell about the type of question if any body has faced >> SIEL . >> >> Saurabh sah >> NIT Jaipur. >> >> --

Re: [algogeeks] Re: Thoughtworks and Tejas network

dey would only look for OPPS concept with proper working knowledge and DB concepts.. On Tue, Sep 13, 2011 at 8:15 PM, Brijesh wrote: > yes..please anyone post questions asked in thoughtworks interview > > -- > You received this message because you are subscribed to the Google Groups > "Algorith

[algogeeks] Nonuniform distribution

Given a pseudo-random generator which produces a uniform distribution from the range 0..2^32-1, build a generator which produces discrete samples from the integers 0..N-1 according to a user-specified probability distribution {P0, P1, P2, ... PN-1} (where Px is the probability of x being generated

[algogeeks] Can we define a bijective function from set(strings) ------> Q?

Hi, Can we define a bijective function from set(strings) --> Q? I thought of using a polynomial function, for example: f(ANIL)=pow(31,0)*ASCII(L)+pow(31,1)*ASCII(I)+pow(31,2)*ASCII(I)+pow(31,3)*ASCII(A), In this f will be one-one from set(Strings)--->N, but I don't whether is onto or no

[algogeeks] Tech Mahindra

Tech Mahidra is going to visit in my collage for recruitment. Does anyone knows which type of question ask in written test and interview. With Regards Prachi Bhise B.E (I.T) Pune University -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To

[algogeeks] OS

can any one tell the difference between ADDRESS SPACE and VIRTUAL ADDRESS SPACE? thx in advance. -- 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 g

[algogeeks] plz help...

hello, i want a good reference in web designing.can anyone plzz help me with some good links, for reference.. plzz its urgent Thanks in Advance -- Tushar Kanta Rath, Master In Computer Application MNNIT, Allahabad -- You received this message because you a

[algogeeks] Re: MICROSOFT WRITTEN IN VASAVI

@Teja: Oops. I was wrong. By the time I fix my conceptual error, the code is no shorter than Anshu's. Dave On Sep 14, 8:14 am, teja bala wrote: > @DAVE > > dis was the o/p for ur prog. > > aBC > abC > abC > abc > abc > abc > abc > abc > > #include > main() > { > int i, n = 3; > char *s="ABC"; >

Re: [algogeeks] Re: informatica pattern and question of interview

Informatica sucks.I have topped in its offcampus written test still they din call me. On Wed, Sep 14, 2011 at 7:05 PM, ravi maggon wrote: > In Thapar Criteria was > BE CSE and I think MCA was also eligible but for interviews only BE CSE > were shortlisted. > Package: 7.75 lpa > > On Wed, Sep

[algogeeks] Re: informatica pattern and question of interview

many i know what's the criteria and package for the company... regards sushaanth BE-computer science Madras Institute of technology On Sep 14, 3:02 pm, Ankit Agarwal wrote: > 2  question > > numbers are (a1+1)*a2*a3... an = a1*a2*a3...an + a2*a3...an > the first term is same... > for second term

Re: [algogeeks] Re: MICROSOFT WRITTEN IN VASAVI

1 wahat is the logic why 1< > > On Wed, Sep 14, 2011 at 6:44 PM, teja bala wrote: > >> @DAVE >> >> dis was the o/p for ur prog. >> >> aBC >> abC >> abC >> abc >> abc >> abc >> abc >> abc >> >> #include >> main() >> { >> int i, n = 3; >> char *s="ABC"; >> for( i = 0 ; i < (1<> { >> s[i^(i

Re: [algogeeks] Re: informatica pattern and question of interview

In Thapar Criteria was BE CSE and I think MCA was also eligible but for interviews only BE CSE were shortlisted. Package: 7.75 lpa On Wed, Sep 14, 2011 at 6:56 PM, sush57 wrote: > many i know what's the criteria and package for the company... > > regards > sushaanth > BE-computer science > Madra

Re: [algogeeks] Re: MICROSOFT WRITTEN IN VASAVI

wahat is the logic why 1 @DAVE > > dis was the o/p for ur prog. > > aBC > abC > abC > abc > abc > abc > abc > abc > > #include > main() > { > int i, n = 3; > char *s="ABC"; > for( i = 0 ; i < (1< { > s[i^(i>>1)] ^= 'a' ^ 'A'; > cout << s << endl; > } > } > > > > -- > You received this

Re: [algogeeks] Re: MICROSOFT WRITTEN IN VASAVI

@DAVE dis was the o/p for ur prog. aBC abC abC abc abc abc abc abc #include main() { int i, n = 3; char *s="ABC"; for( i = 0 ; i < (1<>1)] ^= 'a' ^ 'A'; cout << s << endl; } } -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to thi

Re: [algogeeks] find the error

if file.txt is not present it gives a seg fault and if the file is present then the problem is with f.get(), use fgetc or fgets etc the program runs without any error *..* * **Regards Sandeep Kumar MTech Computer Science **IIT Madras* Music washes away from the soul the dust of everyd

Re: [algogeeks] program

Create a structure with num,count(of num) and link parse the array and create nodes (nodes are created with id=num). when the no of nodes == 3 print the nodes data and count. On Wed, Sep 14, 2011 at 5:13 PM, parag khanna wrote: > > find the frequencies of each alphabet ... n store it in an array

Re: [algogeeks] find the error

I guess, if file is not found, fopen will return -1. Which will evaluate the statement if(f=fopen("file.txt","r")) as true.. -- *Regards Jitesh Kumar "There is only one 'YOU' in this world. You are Unique and Special.* *Don't Ever Forget it."* -- You received this message because you are subsc

[algogeeks] yahoo campus placements

anybody has any yahoo campus placements papers/questions or tips etc. please share thanx in advance Akash -- 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 t

Re: [algogeeks] find the error

sorry fclose was also written in the last line. I missed it while asking. On Wed, Sep 14, 2011 at 6:10 PM, abhinav gupta wrote: > file not closed. > > On Wed, Sep 14, 2011 at 5:56 PM, ravi maggon wrote: > >> Something like this was asked in written test of Tally. We had to find the >> cause why

Re: [algogeeks] find the error

file not closed. On Wed, Sep 14, 2011 at 5:56 PM, ravi maggon wrote: > Something like this was asked in written test of Tally. We had to find the > cause why this program crased during run time. > File *f; > int count=0; > if(f=fopen("file.txt","r")) > { > while(f.get()!=EOF) > { >

Re: [algogeeks] ms question

thanx...it was very helpful :) On Mon, Sep 12, 2011 at 8:46 PM, Piyush Grover wrote: > A can remain same in following cases: > -> If m, n are equal in all the N iterations > -> if m, n are equal in N-2 iterations but in 1 iteration m and n both are > different in that case there should be one ite

[algogeeks] find the error

Something like this was asked in written test of Tally. We had to find the cause why this program crased during run time. File *f; int count=0; if(f=fopen("file.txt","r")) { while(f.get()!=EOF) { count++; } } -- Regards Ravi Maggon B.E. CSE, Final Year Thapar Univers

[algogeeks] Re: branching factor when BFS and DFS of a graph is same

@siddharam: Performing inorder and pre/postorder will still have false positives. Consider 2 trees one with root node "a" with node "b" as left child, another tree with root node "a" with node "b" as its right child. Anyway, for binary trees, I am aware of a recursive solution to find out simila

[algogeeks] juniper networks

Did juniper visit any campus for training or job recruitment? -- Regards Ravi Maggon B.E. CSE, Final Year Thapar University www.algorithmguru.com "*Failure is the opportunity to begin again more intelligently"* -- You received this message because you are subscribed to the Google Groups "Alg

Re: [algogeeks] program

find the frequencies of each alphabet ... n store it in an array corressponding to the ascii value of the alphabet as a index of array ... n store its count ... then sort the array in decreasing order ... and return the top 3 index value of the array in integer form -- > Parag Khanna > B.tech

Re: [algogeeks] program

heap construction ... On Wed, Sep 14, 2011 at 4:44 PM, bharatkumar bagana < bagana.bharatku...@gmail.com> wrote: > with space O(n) and time O(n), we can trace the whole array and maintain > the freq of each number and by one more trace with using 3 variables , > we can find top 3 > >

Re: [algogeeks] Matrix

wat do u mean by reversing a matrix ? On Wed, Sep 14, 2011 at 4:51 PM, bharatkumar bagana < bagana.bharatku...@gmail.com> wrote: > will u pls provide one example .. so that every one understand ... > > > On Wed, Sep 14, 2011 at 1:29 PM, guna sekaran wrote: > >> Write a program for reversing the

Re: [algogeeks] Matrix

will u pls provide one example .. so that every one understand ... On Wed, Sep 14, 2011 at 1:29 PM, guna sekaran wrote: > Write a program for reversing the matrix > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group

Re: [algogeeks] program

with space O(n) and time O(n), we can trace the whole array and maintain the freq of each number and by one more trace with using 3 variables , we can find top 3 On Wed, Sep 14, 2011 at 11:20 AM, raj wrote: > program to find the top 3 repeating number from the given array > eg > You

Re: [algogeeks] Re: Microsoft Question

The well known examples of priority queue is minheap and maxheap.. i guess the question is how do we implement one of these(at least) using queue? On Wed, Sep 14, 2011 at 9:08 AM, Ankuj Gupta wrote: > I guess the functionality of priority should be maintained > > On Sep 13, 11:59 pm, Ankur Garg

Re: [algogeeks] Re: Finding connection b/w 2 profiles

Using DFS we can stuck in the blind ally as there is not limit of depth.. On Wed, Sep 14, 2011 at 4:16 PM, tech coder wrote: > we can also use dfs and find if there exist path between given two > nodes(profiles here). > if yea , there is a connection b/w two profiles. > > > On Wed, Sep 14, 2011

[algogeeks] Re: MICROSOFT WRITTEN IN VASAVI

Shorter. It is assumed that the input string consists of upper and lower case letters only. void allCase(string r) { int i, n = s.sise(); for( i = 0 ; i < (1<>1)] ^= 'a' ^ 'A'; cout << s << endl; } } The expression i^(i>>1) is a Gray-code (see http://en.wikipedia.org/wiki/Gra

Re: [algogeeks] Re: what is the output????

9,8,7,6,5,4,3,2,1 hello by the 9 child prs On Wed, Sep 14, 2011 at 4:07 AM, htross wrote: > how is it 45 > > On Sep 14, 12:56 pm, rahul vatsa wrote: > > 45 times > > > > On Wed, Sep 14, 2011 at 3:35 AM, sharmila saru >wrote: > > > > > > > > > > > > > > > > > hello will be printed 9 times..

Re: [algogeeks] Re: Finding connection b/w 2 profiles

we can also use dfs and find if there exist path between given two nodes(profiles here). if yea , there is a connection b/w two profiles. On Wed, Sep 14, 2011 at 1:58 PM, Azhar Hussain wrote: > Union Find Algorithm would do > > - > Azhar. > > > On Wed, Sep 14, 2011 at 1:42 PM, JITESH KUMAR wr

Re: [algogeeks] MICROSOFT WRITTEN IN VASAVI

void allCase(string r) { int n = s.sise(); string s; for (i = 0; i < (1 << n); i++) { s = r; for ( j = 0; j < n; j++) { if ( i & ( 1 << j) ) { s[j] = s[j] + ('a' - 'A'); } }

[algogeeks] MICROSOFT WRITTEN IN VASAVI

dis was asked in MS written U r given a string u need to print all cases of letters without changing the order eg:- ABC,Abc,ABc,aBC,abC etc... -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algo

Re: [algogeeks] C output

9 and 3 -- 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

Re: [algogeeks] Re: informatica pattern and question of interview

2 question numbers are (a1+1)*a2*a3... an = a1*a2*a3...an + a2*a3...an the first term is same... for second term is (a1*a2...an)/(a1) now we have to find max of ( ((a1*a2..an)/a1), (a1*a2...an)/a2) so the question of max becomes min of( a1, a2, a3... an) -- Ankit Agarwal Computer Science

Re: [algogeeks] Re: Amazon ques

however maximum subarray can be found in O(n) just needs to get maximum difference in entries of each A[i] [-2]->[5] [-1]->[0, 2, 4, 6] maxdiff[-1] = 6-0 [0]->[-1, 1, 3, 7] maxdiff[0] = 7-(-1) [1]->[8, 10] maxdiff[1] = 10-8 [2]->[9] max(maxdiff[i]) = 8 surender On Sun, Sep 11, 2011 a

Re: [algogeeks] Re: MS test cases type Questions

dats f9...bt cud i get 2 knoe ...how bout answering 2 d perfectness...n if v cud practice dem from nywhere Regards, PAYAL GUPTA, CSE-3 rd yr, NIT-B On Tue, Sep 13, 2011 at 10:05 PM, Navneet wrote: > Basically test cases are asked for very general purpose software like > a Notepad etc. > >

Re: [algogeeks] Re: Finding connection b/w 2 profiles

Union Find Algorithm would do - Azhar. On Wed, Sep 14, 2011 at 1:42 PM, JITESH KUMAR wrote: > Neither depth is known nor we have to find the shortest path. We just have > to find the path. > > > -- > *Regards > Jitesh Kumar > * > > -- > You received this message because you are subscribed to th

Re: [algogeeks] Exchanging bit values in a number

#include int main() { int n,i,j,temp,temp1; scanf("%d %d %d",&n,&i,&j); temp=(1

Re: [algogeeks] Mentor Graphics Help !!

If anybody know about placement procedure of mentor graphics pls help On Mon, Aug 22, 2011 at 11:09 PM, Ankur Garg wrote: > Also to add, > > If you post profile in their portal no reply comes...How to apply ...can > any one here refer my candidature for Mentor Graphics ..I have 2 yrs work ex > w

  1   2   >