a file is given containing lots of records seprated by new line
(records can be repeat)
and a substring given for egabc
now check for the record which contains the substring
and print top 10 record according to their frequency
derive algo with complexity o(n)
On Sep 26, 10:58 am, htross
what package did they offer?
On Mon, Sep 26, 2011 at 9:41 AM, aditya kumar
aditya.kumar130...@gmail.comwrote:
1st round was a written test . It had 30 mcq's . This was the easiest mcq's
.
20 simple aptitude questions were thr along with some 10 C questions .
21 students were shortlisted for
5.5 lakhs
On Mon, Sep 26, 2011 at 1:46 PM, Aditya Virmani virmanisadi...@gmail.comwrote:
what package did they offer?
On Mon, Sep 26, 2011 at 9:41 AM, aditya kumar
aditya.kumar130...@gmail.com wrote:
1st round was a written test . It had 30 mcq's . This was the easiest
mcq's .
20 simple
can you tell how to write code to access log file
On 26 September 2011 09:27, teja bala pawanjalsa.t...@gmail.com wrote:
do dfs traversal along the two log files and maintain a stack in which push
the element from 1st log file and if matching id in 2 log file is found pop
it and display it to
plz mail me this ebook the given link does not have complete pages only 94
pages can be viewed
On 26 September 2011 05:27, Bhanu Kishore bhanukishor...@gmail.com wrote:
http://www.scribd.com/doc/50658450/Data-Structures-and-Algorithms-Made-Easy-For-Interviews-Programming-Interview-Questions
plz send me that book to
I also need that book...
On Sun, Sep 25, 2011 at 9:37 PM, sarath prasath prasathsar...@gmail.comwrote:
hi every one..
pls do give me the link if u find or have, about this book..
title name:Data Structures and Algorithms Made Easy: 700 Data
Structure and
plz send me that book too
On Mon, Sep 26, 2011 at 3:28 PM, Ishan Aggarwal
ishan.aggarwal.1...@gmail.com wrote:
plz send me that book to
I also need that book...
On Sun, Sep 25, 2011 at 9:37 PM, sarath prasath
prasathsar...@gmail.comwrote:
hi every one..
pls do give me the link
Thanks in advance
--
**With Regards
Deoki Nandan Vishwakarma
*
*
--
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
i also need that book
On Mon, Sep 26, 2011 at 6:00 AM, Amit Mittal amit.mitt...@gmail.com wrote:
plz send me that book too
On Mon, Sep 26, 2011 at 3:28 PM, Ishan Aggarwal
ishan.aggarwal.1...@gmail.com wrote:
plz send me that book to
I also need that book...
On Sun, Sep 25,
you can't... if you are having trouble solving some problem, you can always
discuss it in spoj forums. spoj.pl/forum
On Mon, Sep 26, 2011 at 3:54 PM, Deoki Nandan deok...@gmail.com wrote:
Thanks in advance
--
**With Regards
Deoki Nandan Vishwakarma
*
*
--
You received this message
Explain this code-
It is supposed to print- Hello World
#include iostream
using namespace std;
int main()
{
long long int
l1l[]={72,-11037827,917043223,-47519989,1450408591,-194718605,2037206149,-8912843,279667,-26713,-3617,1571,-79};
had been finnding d buk since many daz..
plzzz..do send d buk 2 me 2...
thnx...in advance...:)
regards,
PAYAL GUPTA,
CSE-3rd YR
NIT_B
On Mon, Sep 26, 2011 at 4:03 PM, sangeeta goyal sangeeta15...@gmail.comwrote:
i also need that book
On Mon, Sep 26, 2011 at 6:00 AM, Amit Mittal
for the first instruction : 150+5+120+5+160+5+140=585 ns
for the rest of the instructions , though pipeline
max(150,120,160,140)=160
(160+5)*999=164835 ns
we assume that there will be no extra stalls existed in our system
-585 + 164835 =165420 ns =165.4 us...
correct me if I'm wrong
pls send me d book too
really need it
thanks
regards
sahil
--
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
any language pref?? are bash solns acceptable??
On Mon, Sep 26, 2011 at 12:04 PM, abhishek abhishek.ma...@gmail.com wrote:
a file is given containing lots of records seprated by new line
(records can be repeat)
and a substring given for egabc
now check for the record which contains the
if someone is having the book, he/she will not specifically mail it to each
and everyone of you... rather to the mailing list.. so stop sending these
mails
if (you have the book)
then mail
else
do nothing
On Mon, Sep 26, 2011 at 4:35 PM, sahil sharma sahil18...@gmail.com wrote:
pls send
count the number of 0s 1s 2s.then store os first den 1s followed by 2s
On Sat, Sep 24, 2011 at 9:55 AM, Anup Ghatage ghat...@gmail.com wrote:
Is this like the segregating all the 1's to the right and the 0's to the
left
or am i missing something?
On Sat, Sep 24, 2011 at 9:39 AM, VIHARRI
@ shady i appreciate you
but can't resist myself as i barely need it
so plz mail me as well
On Sep 26, 4:25 pm, shady sinv...@gmail.com wrote:
if someone is having the book, he/she will not specifically mail it to each
and everyone of you... rather to the mailing list.. so stop sending these
c,c++ ,java
On Sep 26, 4:15 pm, Akash Mukherjee akash...@gmail.com wrote:
any language pref?? are bash solns acceptable??
On Mon, Sep 26, 2011 at 12:04 PM, abhishek abhishek.ma...@gmail.com wrote:
a file is given containing lots of records seprated by new line
(records can be
Have anyone appeared for *NAGARRO* recently? can ne one mention there rounds
experience; like wat type of coding problems they ask in their coding
rounds.. please share your experiences !!
--
*Partik Madan*
Computer Engg.
NIT Kurukshetra
--
You received this message because you are subscribed
here is the process of paypal/ebay india
written test ---40 ques in 60 min (no negative marking)
interview 1
interview 2
HR interview
written was a mix of technical and aptitude question
interview 1
first asked me about my hobby and discussed about 5 to 10 min on it
discussed on project
asked
dutch national flag problem..search in wiki...classical.
On Sat, Sep 24, 2011 at 9:39 AM, VIHARRI viharri@gmail.com wrote:
You are given a string (consisting of 0's, 1's or 2's) where 0
represents a blue ball, 1 a
red ball, and 2 a black ball. Using only swap operations (counting
sort
plz upload this on this group.. or mail to everyone i also need
it...mail me if nyone has
On Mon, Sep 26, 2011 at 5:58 PM, abhishek abhishek.ma...@gmail.com wrote:
@ shady i appreciate you
but can't resist myself as i barely need it
so plz mail me as well
On Sep 26, 4:25 pm, shady
i would have appreciated it if you had understood my mail :p
if someone is having the book he will mail it to the group and not
selectively to so many people :)
On Mon, Sep 26, 2011 at 5:58 PM, abhishek abhishek.ma...@gmail.com wrote:
@ shady i appreciate you
but can't resist myself as i
@yogesh : pages are missing in the book u ve mailed man... ly few pages are
ther in the book u jus maile..
On Mon, Sep 26, 2011 at 7:23 PM, Yogesh Yadav medu...@gmail.com wrote:
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
itz same as at scribd.comnot complete..i think
itz not easilty availabl
2011/9/26 Vιиodh vinodh...@gmail.com
@yogesh : pages are missing in the book u ve mailed man... ly few pages are
ther in the book u jus maile..
On Mon, Sep 26, 2011 at 7:23 PM, Yogesh Yadav
ok thanks
On 26 September 2011 16:11, shady sinv...@gmail.com wrote:
you can't... if you are having trouble solving some problem, you can always
discuss it in spoj forums. spoj.pl/forum
On Mon, Sep 26, 2011 at 3:54 PM, Deoki Nandan deok...@gmail.com wrote:
Thanks in advance
--
**With
Find the difference of two numbers without using '-' operator !
plz share ur solutions!
--
Cheers,
Vicky
--
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
find the smallest of two number . then keep adding 1 to the smaller number
till you get the bigger number .
this will give you absolute diff so check for the correct ans .
in case you have floating number then add unit of fraction . and repeat the
same .
On Mon, Sep 26, 2011 at 7:33 PM,
difference = x+ ~y +1
On Mon, Sep 26, 2011 at 7:33 PM, ~*~VICKY~*~ venkat.jun...@gmail.comwrote:
Find the difference of two numbers without using '-' operator !
plz share ur solutions!
--
Cheers,
Vicky
--
You received this message because you are subscribed to the Google Groups
bharatkumar bagan...can u plz explain why u multipiled (160+5) with 999 ?
--
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
I have a software problem and I'm searching for a solution but tried
different algorithm approach and nothing came out.
I'm not very familiar with all the graph algorithms and I hope there
is already a way to solve this kind of problems in polynomial time.
I need the algorithm for different task
Tricky question with more tricky answers. thank you all.
On Mon, Sep 26, 2011 at 9:55 PM, Kunal Yadav kunalyada...@gmail.com wrote:
difference = x+ ~y +1
On Mon, Sep 26, 2011 at 7:33 PM, ~*~VICKY~*~ venkat.jun...@gmail.comwrote:
Find the difference of two numbers without using '-' operator
grt.we never generally use ~ operator. got to knw abt it.
Ashima
M.Sc.(Tech)Information Systems
4th year
BITS Pilani
Rajasthan
On Mon, Sep 26, 2011 at 10:07 AM, ~*~VICKY~*~ venkat.jun...@gmail.comwrote:
Tricky question with more tricky answers. thank you all.
On Mon, Sep 26, 2011 at 9:55
thats basically taking twos' compliment and converting it to negative one
and then adding it..its the same principle...which is used for dividing two
numbers without using '/' and '-'...right kunal??
On Mon, Sep 26, 2011 at 10:38 PM, Ashima . ashima.b...@gmail.com wrote:
grt.we never generally
+1 to abhishek
On Mon, Sep 26, 2011 at 11:44 PM, Abhishek Gupta
guptaabhishe...@gmail.comwrote:
thats basically taking twos' compliment and converting it to negative one
and then adding it..its the same principle...which is used for dividing two
numbers without using '/' and '-'...right
ya pl send
On Mon, Sep 26, 2011 at 8:04 PM, rahul sharma rahul23111...@gmail.comwrote:
itz same as at scribd.comnot complete..i think
itz not easilty availabl
2011/9/26 Vιиodh vinodh...@gmail.com
@yogesh : pages are missing in the book u ve mailed man... ly few
@bharat:
for the second part where u multiplied (160+5) with 999, it should be
160*999 because it is max of (150,120,160,140,5). Correct me if i am
wrong.
On Sep 26, 4:02 pm, bharatkumar bagana bagana.bharatku...@gmail.com
wrote:
for the first instruction : 150+5+120+5+160+5+140=585 ns
for the
Here is a little program to show how it works. It's a nice little
problem. There is also a coding with recursion.
#include stdio.h
#include stdlib.h
typedef struct node_s {
int data;
struct node_s *left, *right;
} NODE;
void print_tree(NODE *tree)
{
if (tree == NULL) return;
You guys have the right idea except that since it's multiple choice
you can do this with no math. With 1000 data items and only 4 stages,
the bottleneck has to be the slowest pipeline stage with its register
delay. So you can answer b in 10 seconds and move on to the next
question!
On Sep 26,
Saw this question in one of the algo communities.
Amazon telephonic interview question on Matrix
Input is a matrix of size n x m of 0's and 1's. eg:
1 0 0 1
0 0 1 0
0 0 0 0
If a location has 1; make all the elements of that row and column = 1. eg
1 1 1 1
1 1 1 1
1 0 1 1
Solution should be with
@abhishek: absolutely correct abhishek :)
On Mon, Sep 26, 2011 at 11:53 PM, aditya kumar aditya.kumar130...@gmail.com
wrote:
+1 to abhishek
On Mon, Sep 26, 2011 at 11:44 PM, Abhishek Gupta
guptaabhishe...@gmail.com wrote:
thats basically taking twos' compliment and converting it to
difference = x^y
On Tue, Sep 27, 2011 at 1:42 AM, Kunal Yadav kunalyada...@gmail.com wrote:
@abhishek: absolutely correct abhishek :)
On Mon, Sep 26, 2011 at 11:53 PM, aditya kumar
aditya.kumar130...@gmail.com wrote:
+1 to abhishek
On Mon, Sep 26, 2011 at 11:44 PM, Abhishek Gupta
@sandeep: Its simple xor. How can this be equal to difference??
--
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
@Teja Bala
U dont need the last line for a[0][0]
else code will be wrong
conside
0 0 0 0 1
0 0 0 0 0
0 1 0 0 0
0 0 0 1 0
Regards
On Sun, Sep 11, 2011 at 11:56 PM, teja bala pawanjalsa.t...@gmail.comwrote:
//pseudo code dis will work for sure.
for(i=0;irow_count;i++)
I assume we don't want to use extra storage.
So one way is this: Go over the matrix and mark the first row with a 1
and the first column with a 1 for each 1 you find. Because row and
column 1 are used for temporary storage in this manner, you must first
remember whether they contained a 1, then
simple graph question,
graph is given as list , just check the dependancy
On Sep 25, 6:25 pm, siva viknesh sivavikne...@gmail.com wrote:
thanks a lot yogesh...
On Sep 25, 2:23 pm, Yogesh Yadav medu...@gmail.com wrote:
T1-T2-T3-T6
T1-T2-T4-T7
T1-T2-T5-T8
2 Processor:
(T1-T2) ..2
Guys an Update ,
This has been asked in MS by me.. I suggested O(m*n) but they were looking
for a solution in nlogn ( n*n Sparse Matrix ) ..Any idea ...
This post was discussed earlier but every1 came with O(m*n) solution so
instead of cluttering it ..opened a new One ...
On Tue, Sep 27, 2011
what's the algo of this question
On Mon, Sep 26, 2011 at 2:38 PM, vikas vikas.rastogi2...@gmail.com wrote:
simple graph question,
graph is given as list , just check the dependancy
On Sep 25, 6:25 pm, siva viknesh sivavikne...@gmail.com wrote:
thanks a lot yogesh...
On Sep 25, 2:23 pm,
#includestdio.h
int main()
{
int a=1;
switch(a)
{
int b=6;
case 1:
printf(b is %d,b);
break;
default:
printf(b is %d:,b);
Nice question nice answer... :)
On Tue, Sep 27, 2011 at 6:25 AM, UTKARSH SRIVASTAV
usrivastav...@gmail.comwrote:
what's the algo of this question
On Mon, Sep 26, 2011 at 2:38 PM, vikas vikas.rastogi2...@gmail.comwrote:
simple graph question,
graph is given as list , just check the
junk value cz b=6 will not get executed
--
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
Compilation error.
Definition of b is skipped by Switch statement.
so 'b' not declared/defined error will occur.
Correct me if m wrong.
Sanju
:)
On Mon, Sep 26, 2011 at 6:38 PM, deepikaanand swinyanand...@gmail.comwrote:
junk value cz b=6 will not get executed
--
You received this
i think steiner tree can be used
On Sep 26, 10:05 pm, drealecs dreal...@gmail.com wrote:
I have a software problem and I'm searching for a solution but tried
different algorithm approach and nothing came out.
I'm not very familiar with all the graph algorithms and I hope there
is already a
compile time error... except case labels nothing else will be executed in
case of switch statements... so definition of b will not be executed.so
compilation error
On Tue, Sep 27, 2011 at 6:28 AM, Ratan success.rata...@gmail.com wrote:
#includestdio.h
int main()
{
int a=1;
if any one have this book plz send it to me also...thnx
--
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
b=6 will not execute..
--
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,
On ideone.com its showing compiler error and on ubuntu garbage value
of b gets as the result...
On Tue, Sep 27, 2011 at 10:21 AM, gaurav yadav
gauravyadav1...@gmail.com wrote:
b=6 will not execute..
--
You received this message because you are subscribed to the Google Groups
Algorithm
58 matches
Mail list logo
