hey from which college r u???
On Sun, Oct 2, 2011 at 10:51 PM, gaurav kumar mailmea...@gmail.com wrote:
there were 10 objective questions covering c,c++ and ds
questions were on mainly memory allocation
stack and heap ,etc
output/error ;
subjective part
1. compress the given string
eg.
0xa == 0x 1010, which stands for all the even bits
0x5 == 0x 0101, which stands for all the odd bits
1 and 1 means shifting odd to even and even to odd
then | means putting new even bits and odd bits together
Yanan Cao
On Wed, Sep 7, 2011 at 10:23 AM, teja bala
which is the best site where in can find backtracking and branch and bound
programs ?
On Wed, Sep 7, 2011 at 8:58 PM, gmagog...@gmail.com gmagog...@gmail.comwrote:
0xa == 0x 1010, which stands for all the even bits
0x5 == 0x 0101, which stands for all the odd bits
1 and 1 means shifting odd
Method 1 :
Use character array to store large number .
Define addition subtraction function for the following representation of
number .
Using addition subtraction number u can write another operation for the
library e.g. multiplication , division , modulus etc .
Method 2 :
Use Linked list to
Nybody got shortlisted in MS written test which happened on 23rd july???
On Sun, Jul 24, 2011 at 7:32 PM, Bhanu Pratap Singh bp.mn...@gmail.comwrote:
We can also use, c++ map... for implementing this!
--
*with regards ...
Bhanu P Singh (B!||-I~)
B.Tech Final Year
Computer Science And
Well here is one good tutorial on Topcoder
http://www.topcoder.com/tc?module=Staticd1=tutorialsd2=usingTries.May be
this can help you.
On Sun, Jul 24, 2011 at 3:51 AM, Akash Mukherjee akash...@gmail.com wrote:
sorry if it seems to be off the topic, but any good resources for trie
for a
here is one good tutorial on topcoder
http://www.topcoder.com/tc?module=Staticd1=tutorialsd2=usingTries May be
this can help you.
On Sun, Jul 24, 2011 at 3:51 AM, Akash Mukherjee akash...@gmail.com wrote:
sorry if it seems to be off the topic, but any good resources for trie
for a newbie??
Use trie tree and store word count also along with the pointer. So, that
search could take at max word size time.
On Sat, Jul 23, 2011 at 10:44 PM, rajeev bharshetty rajeevr...@gmail.comwrote:
Trie data structure can be used ? What you say guys??
On Sat, Jul 23, 2011 at 10:43 PM, ankit
sorry if it seems to be off the topic, but any good resources for trie
for a newbie??
thanks :)
On Sat, Jul 23, 2011 at 11:02 PM, varun pahwa varunpahwa2...@gmail.com wrote:
Use trie tree and store word count also along with the pointer. So, that
search could take at max word size time.
On
http://www.youtube.com/watch?v=uhAUk63tLRM
This would be helpful
On Sun, Jul 24, 2011 at 4:21 PM, Akash Mukherjee akash...@gmail.com wrote:
sorry if it seems to be off the topic, but any good resources for trie
for a newbie??
thanks :)
On Sat, Jul 23, 2011 at 11:02 PM, varun pahwa
@rajeev ty :)
On Sun, Jul 24, 2011 at 4:24 PM, rajeev bharshetty rajeevr...@gmail.com wrote:
http://www.youtube.com/watch?v=uhAUk63tLRM
This would be helpful
On Sun, Jul 24, 2011 at 4:21 PM, Akash Mukherjee akash...@gmail.com wrote:
sorry if it seems to be off the topic, but any good
We can also use, c++ map... for implementing this!
--
*with regards ...
Bhanu P Singh (B!||-I~)
B.Tech Final Year
Computer Science And Engineering
MNNIT Allahabad.*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
Use hashing with the words as key. Store the string of the word as the value..
--
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
Trie data structure can be used ? What you say guys??
On Sat, Jul 23, 2011 at 10:43 PM, ankit sambyal ankitsamb...@gmail.comwrote:
Use hashing with the words as key. Store the string of the word as the
value..
--
You received this message because you are subscribed to the Google Groups
@ankit, rajeev
even I wrote hashtable as the answer ..
but which would be faster? Hashtabel or Trie?
--
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
Hashtable o(1) trie atleast o(logn)
On Sat, Jul 23, 2011 at 11:05 PM, wats my name for 2day lok...@gmail.comwrote:
@ankit, rajeev
even I wrote hashtable as the answer ..
but which would be faster? Hashtabel or Trie?
--
You received this message because you are subscribed to the Google
I think regarding memory trie would be better.
On Sat, Jul 23, 2011 at 11:08 PM, saurabh singh saurab...@gmail.com wrote:
Hashtable o(1) trie atleast o(logn)
On Sat, Jul 23, 2011 at 11:05 PM, wats my name for 2day
lok...@gmail.comwrote:
@ankit, rajeev
even I wrote hashtable as the
It all depends on the distribution of words and their frequencies in the
input file.
But although somewhere I feel trie is better (i mean in terms of
flexibility).
Although a lot of pointers have to be maintained in trie , it really
provides an optimal solution for this problem .
On Sat, Jul 23,
no aditional data structure is required , if we search in directly on input
stream.
by using Boyer-Moore string search
algorithmhttp://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm.
it take Ω(n/m) or O(n).
so we do it on the fly.
Hash function has also some prolem in where
Trie is better in terms of scalability and performance.
With Hashtable there is a problem of rehashing when all buckets are full and
rehashing takes O(N). Although it happens once in a blue moon. That can
impact the performance in a production environment.
With trie you dont have that problem.
no I don't think they ask for a specific language .they will emphasis
on algo,DS,puzzle,sql some networking
On 7/18/11, sourabh chaki sourabh.chak...@gmail.com wrote:
Can any one please suggest the type of Microsoft written test. How many
sections are there? What are the area they mainly
21 matches
Mail list logo
