@praveen raj: yes bubble sort takes O(N) in best case,
but selection sort it depends the selection algo(does the selection
starts from the first(then itsO(n)) or last(then its O(N^2))
Thank you,
Sid.
On Fri, Sep 9, 2011 at 11:20 AM, praveen raj praveen0...@gmail.com wrote:
for checking whther
@surender: say the hash table of freq,linked_lis is as follows...
1,2-3-4
2,5-6
3,7-8
pop(7) would decrease the frequency of element 7 means that element has to
be added to 2nd key i.e 2,5-6-7 here
how do u get the element 7 from hash table as freq is the key element in u'r
table?
And after
Full of Aptitude. they check the speed and accuracy...
With regards,
Praveen Raj
DCE-IT 3rd yr
735993
praveen0...@gmail.com
On Thu, Sep 8, 2011 at 3:33 AM, htross htb...@gmail.com wrote:
future first is coming to our college.what kind of questions will
be asked in first
@bharat
take two hashmaps of
hash1data, freq and
hash2freq,linked_list
take frequency of a data from hash1, and find its list in hash2.
if ur poping, reduce frequency in hash1 and in corresponding hash2 remove
its entry in that list and put it in freq-1 entry
and keep track of max and second max
Guys, why don't we do something like this :
1. If (arrayHasBeenTraversed, Goto 4).
Else, Traverse the 2-D array [row,column] wise. Inspect element
array[row][column]. Goto 2.
2. If you encounter a '1' (array[row][column]),
change all the 0's in the corresponding [row,column] to '-1'
hi,
I am not able to add a person to the algogeeks group. Is there a limit on
the number of people who could join a particular google groups ?
At present there are 7960 people :)
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
great idea...
On Fri, Sep 9, 2011 at 11:00 AM, Manish Verma jalsa.n.sa...@gmail.comwrote:
Hey, anyone preparing for acm-icpc
what about discussing acm-icpc questions here
what say @shady??
--
You received this message because you are subscribed to the Google Groups
Algorithm
hi everyone
yahoo is coming to our college on september 30
what kind of questions will be asked in first round???
how to prepare for the first round
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
@Dave : Please specify reason for choosing radix sort ?
On Thu, Sep 8, 2011 at 7:02 AM, Sandy sandy.wad...@gmail.com wrote:
Thanks Dave, Piyush, and Bittursk.
On Wed, Sep 7, 2011 at 2:48 PM, Dave dave_and_da...@juno.com wrote:
@Sandy: It can be done in O(n) time with O(n) extra space by
is there any difference b/w
int var;
var=0;
and
int var;
var =0;
both codes yield the same value right?
Thank you,
Sid.
--
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
---
siddharam suresh 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-c210beca0f-94c347d8f9-1MYpPRw3iV2W4LJT9RRZENB3cAY
whch collg wat package?
last time when it came to our collg..it has 4 questions on probablity..2-3
on c..and rest 15 20 on unix..
On Fri, Sep 9, 2011 at 3:40 PM, htross htb...@gmail.com wrote:
hi everyone
yahoo is coming to our college on september 30
what kind of questions will be asked in
its offering 9.55was there a coding round also
On Sep 9, 4:19 pm, Dheeraj Sharma dheerajsharma1...@gmail.com wrote:
whch collg wat package?
last time when it came to our collg..it has 4 questions on probablity..2-3
on c..and rest 15 20 on unix..
On Fri, Sep 9, 2011 at 3:40
Hi all,
Telcordia is going to visit our campus.. pls post the recent
questions u have come across.. Thanks 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
Yes It Will Great to Discuss Such Probs Here ::)
Thanks
Shashank
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/PEgb5PWqS0cJ.
To post to this group, send
O(kN)
where k is the length of the numbers which are assumed to be integers, so
for even k = 100
it is O(N).
On Fri, Sep 9, 2011 at 4:27 PM, Pritpal Singh pritpal2...@gmail.com wrote:
@Dave : Please specify reason for choosing radix sort ?
On Thu, Sep 8, 2011 at 7:02 AM, Sandy
*no, there is no such limit
*regards
- Sumit Kumar Pathak
(Sumit/ Pathak/ SKP ...)
*Smile is only good contagious thing.*
*Spread it*!
On Fri, Sep 9, 2011 at 1:59 PM, shady sinv...@gmail.com wrote:
hi,
I am not able to add a person to the algogeeks group. Is there a limit on
the number
*int var without initialization gives junk values to var
*
*Doing its '' with 0 will give 0.
*
*In other case you are normally assigning it some value.*
regards
- Sumit Kumar Pathak
(Sumit/ Pathak/ SKP ...)
*Smile is only good contagious thing.*
*Spread it*!
On Fri, Sep 9, 2011 at 4:31 PM,
are all the numbers in a range?? say from (1 to n) and is there atleast one
occurence of each??
On Fri, Sep 9, 2011 at 5:25 PM, shady sinv...@gmail.com wrote:
O(kN)
where k is the length of the numbers which are assumed to be integers, so
for even k = 100
it is O(N).
On Fri, Sep 9, 2011
yeah..after that their was..one coding..round..and then interviews...
i didnt gave the coding round..bt i know..that there was..coding round..
On Fri, Sep 9, 2011 at 5:15 PM, htross htb...@gmail.com wrote:
its offering 9.55was there a coding round also
On Sep 9, 4:19 pm, Dheeraj
hey wat is its eligibility criteriaand whch branches allowed
and wat package..and profile also...
On Fri, Sep 9, 2011 at 5:20 PM, keerthana keerthana1...@gmail.com wrote:
Hi all,
Telcordia is going to visit our campus.. pls post the recent
hello frnds , can u give any reason why this code is trying to read
when the file has reached the EOF ???
--
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
wrong place to ask people to debug your codes.
topic closed***
On Fri, Sep 9, 2011 at 7:56 PM, SAMMM somnath.nit...@gmail.com wrote:
hello frnds , can u give any reason why this code is trying to read
when the file has reached the EOF ???
--
You received this
eligiblity seems to be somewat overwhelming ..its 9 nd above
cgpa! cs it ec .. 4.2 lpa
On Sep 9, 7:17 pm, vivek goel vivek.thapar2...@gmail.com wrote:
hey wat is its eligibility criteriaand whch branches allowed
and wat package..and profile
@Praveen: I can think of two ways you might be using the heap:
1) You transform the unordered input array into a max heap. This is
O(n log n). Then, k times, you remove the top element. This is O(k log
n). The total is O((k+n) log n).
2) You form a min heap of the first k elements of the array.
hi...which coll and package???...plz post the interview experiences
after attending ..thx
On Sep 8, 6:03 pm, htross htb...@gmail.com wrote:
please post the questions after the first round is over...
On Sep 8, 9:35 am, rahulmaximus rahul29ma...@gmail.com wrote:
what the pattern
@PRAVEEN :
with scanf , we can read two or more than two variables at a time
like
scanf( %s %sstring1, string2)
but with gets we can read only one variable
gets (string1)
we cannot use gets (string1, string2)
On Thu, Sep 8, 2011 at 11:05 PM, praveen raj praveen0...@gmail.com wrote:
can anyone tell me the procedure for IOCL?
paper nd all
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
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
dr's get shortlisted and den direct interview..no written test
On Fri, Sep 9, 2011 at 10:27 PM, Dheeraj Sharma dheerajsharma1...@gmail.com
wrote:
can anyone tell me the procedure for IOCL?
paper nd all
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received
can anybody tell the code of followingone -
write a program which accepts i/p into an array of letters
c-circle
t-triangle etc
and prints circle if array entry is 'c'
triangle if array entry is 't'
hint : use virtual functions, abstract class
know polymorphism very well
--
You received this
watever test conduct ..watever interview they conducttopper will
be selected... tats all...a girl wit 9.9 cgpa was selected in our coll
nd no other !!!
On Sep 9, 9:58 pm, Kamakshii Aggarwal kamakshi...@gmail.com wrote:
dr's get shortlisted and den direct interview..no written test
On Fri,
MINDTREE is coming in my college so is there anyone where MINDTREE has came
recently.
and can tell me what is procedure and which type of qus. they asked in
written..
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
can anybody tell me the code of thisone
we have to count the 3 letter,4letter and 5letter words from a file and
print the number of 3 letter,4letter and 5letter words. Delimiter is space,
tab, hifen. Also we should not consider the line in the file after we
encounter # in that line. (ie after
Been done before. Check the archives
On Sat, Sep 10, 2011 at 12:15 AM, aditya kumar aditya.kumar130...@gmail.com
wrote:
Given k sorted streams where each stream could possibly be infinite in
length, describe an efficient algorithm to merge the k streams into a new
stream (also in sorted
pseudo algo:
=array idx[0...k-1] indicates the current pointer position in the ith
stream(initialized to 0).
=heap tree of size k where each node stores value of the data and value of
stream which the node belongs to.
do{
for all i = 0:k-1
=insert idx[i] value of ith stream to the
1. can recursive func be converted to iterative func always
Yes/No
is vice versa True/False
if False give the example.
2. can recursion be done without stack when converted to iterative sort of
thing or we need to implement our own stack?
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar
Any recursive function can be converted to iterative function, but the
reverse is not true...
On Sat, Sep 10, 2011 at 1:08 AM, ravi maggon maggonr...@gmail.com wrote:
1. can recursive func be converted to iterative func always
Yes/No
is vice versa True/False
if False give the example.
2.
For question 2 I guess finding the minimum element's index should suffice
(considering all elements are positive integer). No need to even calculate
n! as it might cause overflow in case the arrary is big.
--
You received this message because you are subscribed to the Google Groups
please someone post wat question was asked in coding
round.
On Sep 9, 6:55 pm, Dheeraj Sharma dheerajsharma1...@gmail.com wrote:
yeah..after that their was..one coding..round..and then interviews...
i didnt gave the coding round..bt i know..that there was..coding round..
1. True and True, though the second depends somewhat on features
supported by the language you are using. Languages like ML (or OCAML)
and Scheme are designed to support this.
2. You need somewhere to store state (lambda parameters at the lowest
level). The stack is one mechanism. There are
It can also be done in O(n) time and space with this. The XOR
solution of bittusrk is interesting, too. The only advantage of this
one is that it will work for any kind of object, not just numbers.
Let S be the empty set
for all elements E
if E is in S, remove it else add it
end;
for all
i agree with hashd.
--
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
let their be two classes A and B having a virtual function.
class C derives both class A and B.
How many virtual table does class C have?
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
You received this message because you are subscribed to the Google Groups
Algorithm
What is the complexity of this code
for(i=0;in;i++)
{
for(j=0;ji*i;j++)
{
for(k=0;kj;k++)
}
}
1. O(n^3)
2. O(n^4)
3. O(n^5)
4. O(n^6)
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
You received this message because you are subscribed to the Google Groups
give some traversal other then pre,in and post order to print all elements
of tree?
Asked in informatica interview.
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to
O(n^5)
--
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
tell the out of the below code related to mutex and semaphore
process1
wait(mutex);
print 0
print 1
signal(mutex);
process2
wait(mutex)
print 1
print 0
signal(mutex)
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
You received this message because you are subscribed to
zigzag, level by level ?
On Sat, Sep 10, 2011 at 10:48 AM, ravi maggon maggonr...@gmail.com wrote:
give some traversal other then pre,in and post order to print all elements
of tree?
Asked in informatica interview.
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
0110 or 1001 depending on how the processes r scheduled
--
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
can u elaborate its algo
On Sat, Sep 10, 2011 at 10:58 AM, Shravan Kumar shrava...@gmail.com wrote:
zigzag, level by level ?
On Sat, Sep 10, 2011 at 10:48 AM, ravi maggon maggonr...@gmail.comwrote:
give some traversal other then pre,in and post order to print all elements
of tree?
Asked
I think it should be n^3
On Sat, Sep 10, 2011 at 10:51 AM, Neha Singh neha.ndelhi.1...@gmail.comwrote:
O(n^5)
--
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
interviewer also made addition to this ques of increment by 1 that you can't
do multiplication.
On Sat, Sep 10, 2011 at 10:08 AM, Neha Singh neha.ndelhi.1...@gmail.comwrote:
i agree with hashd.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
first loop n
send loop n^2
third loop n(i m not sure)
so n^4
Thank you,
Sid.
On Sat, Sep 10, 2011 at 11:09 AM, ravi maggon maggonr...@gmail.com wrote:
I think it should be n^3
On Sat, Sep 10, 2011 at 10:51 AM, Neha Singh
neha.ndelhi.1...@gmail.comwrote:
O(n^5)
--
You received this
there is one more way called as.. Level order traversing or spiral
traversing google this term u will find a new method.
On Sat, Sep 10, 2011 at 11:08 AM, ravi maggon maggonr...@gmail.com wrote:
can u elaborate its algo
On Sat, Sep 10, 2011 at 10:58 AM, Shravan Kumar
54 matches
Mail list logo
