ya same pattern was in PESIT college .
but be careful in mcq's 26/30 was cutt off .. it was easy n ya thr was no
negative marking . in objective they had more stress on number system .
i got selected in Sourcebits :)
On Sun, Sep 25, 2011 at 11:14 AM, aanchal goyal goyal.aanch...@gmail.comwrote:
Can you plz tell the answer for
for 3 answer=?
nd for 4 answer=?
Sanju
:)
On Sat, Sep 24, 2011 at 10:39 PM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
can u plz be more..clear ..with wat the input will consist of..
wat does this mean
for 2 answer=55
does that mean..that how many
first of all congrats rajeev for the placements :) :)
rajeev can u please tell us in more detaill about the technical anr hr
around
can u find any differenence on giving hr through skype
can u list questions that were asked in techinacal and hr around.
--
You received this message because you
first of all congrats rajeev for the placements :) :)
rajeev can u please tell us in more detaill about the technical anr hr
around
can u find any differenence on giving hr through skype
can u list questions that were asked in techinacal and hr around
waiting for ur reply
--
You received
first of all congrats rajeev for the placements :) :)
rajeev can u please tell us in more detaill about the technical anr hr
around
can u find any differenence on giving hr through skype
can u list questions that were asked in techinacal and hr around
waiting for ur
first of all congrats rajeev for the placements :) :)
rajeev can u please tell us in more detaill about the technical anr hr
around
can u find any differenence on giving hr through skype
can u list questions that were asked in techinacal and hr around
--
You received this message because you are
ok.. thanks guys...
one doubt now... if this ques is asked in an interview(its already been
asked in ms interview)... then u cant just write the code... u hv to explain
the whole approach like why u r choosing that way to narrowing dowm the
range...
so pls explain how this sol is derived...
On
yah rite answer would be 5 and 4 resp.
Sanju
:)
On Sat, Sep 24, 2011 at 10:04 PM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
5 4?
On Sun, Sep 25, 2011 at 9:33 AM, sivaviknesh s sivavikne...@gmail.comwrote:
A parallel program consists of 8 tasks – T1 through T8. Each task
thanks every1 for their explanations especially vishwaas and anup
ghatage
--
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
n=1 n=2 n=3 n=4
01010!(10!)!
1 9 9! (9!)!
2 8 8!
3 7 7!
4 6 6!
5 5 5!
6 4
mistake in last post...it was not factorialsum upto n i.e =n(n+1)/2
i.e 10! is wrong ...it will be 10(10+1)/2
On Sun, Sep 25, 2011 at 12:14 PM, Yogesh Yadav medu...@gmail.com wrote:
n=1 n=2 n=3 n=4
01010!(10!)!
1
yeah exactly..yogesh..i was confused with factorial
On Sun, Sep 25, 2011 at 12:21 PM, Yogesh Yadav medu...@gmail.com wrote:
mistake in last post...it was not factorialsum upto n i.e =n(n+1)/2
i.e 10! is wrong ...it will be 10(10+1)/2
On Sun, Sep 25, 2011 at 12:14 PM, Yogesh Yadav
let the number of digits be n
then answer would be ((n+9)! ) / (9! * n!)
Sanju
:)
On Sat, Sep 24, 2011 at 11:51 PM, Yogesh Yadav medu...@gmail.com wrote:
mistake in last post...it was not factorialsum upto n i.e =n(n+1)/2
i.e 10! is wrong ...it will be 10(10+1)/2
On Sun,
Or in other words...
for n=2 , answer= (10*11)/2
for n=3, answer= (10*11*12)/(2*3)
for n=4, answer = (10*11*12*13)/(2*3*4)
Sanju
:)
On Sat, Sep 24, 2011 at 11:58 PM, Sanjay Rajpal srn...@gmail.com wrote:
let the number of digits be n
then answer would be ((n+9)! ) / (9! * n!)
Sanju
:)
+1 Gohana
On Sun, Sep 25, 2011 at 12:28 PM, Sanjay Rajpal srn...@gmail.com wrote:
let the number of digits be n
then answer would be ((n+9)! ) / (9! * n!)
Sanju
:)
On Sat, Sep 24, 2011 at 11:51 PM, Yogesh Yadav medu...@gmail.com wrote:
mistake in last post...it was not
use radix sort 4 times. using bucket sort with chaining as the sorting
algorithm.
time complexity= O(4(n+k))
space complexity = O(n)
Ashima
M.Sc.(Tech)Information Systems
4th year
BITS Pilani
Rajasthan
On Sun, Sep 25, 2011 at 6:01 AM, Jasveen Singh jasveen.sing...@gmail.comwrote:
i have a
yes i can do that but how do u want me to proceed if u can give me the code
to tell me how to fetch data from the file and use bucket sort on it
it will be a huge favour and am i right at my approach to use 2d array to
store the values
plz tell me sir plz!!
On Sun, Sep 25, 2011 at 1:08 PM, Ashima
Try this one...
#includestdio.h
#includestring.h
void reverse(char *p,char*q)
{
char c;
while(pq)
{
c=*p;*p=*q;*q=c;
p++;
q--;
}
}
int main()
{
char A[50];
printf(\n Enter a String:\n\n);
gets(A);
int len=strlen(A);
can u plz giv the sequence
On Sep 25, 11:36 am, Sanjay Rajpal srn...@gmail.com wrote:
yah rite answer would be 5 and 4 resp.
Sanju
:)
On Sat, Sep 24, 2011 at 10:04 PM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
5 4?
On Sun, Sep 25, 2011 at 9:33 AM, sivaviknesh s
plz give detailed explanation
On Sep 25, 1:58 pm, siva viknesh sivavikne...@gmail.com wrote:
can u plz giv the sequence
On Sep 25, 11:36 am, Sanjay Rajpal srn...@gmail.com wrote:
yah rite answer would be 5 and 4 resp.
Sanju
:)
On Sat, Sep 24, 2011 at 10:04 PM, Dheeraj Sharma
T1-T2-T3-T6
T1-T2-T4-T7
T1-T2-T5-T8
2 Processor:
(T1-T2) ..2 TS
(T3T4)...1 TS
(T6T5)...1 TS
(T7T8)...1 TS
4 Processor
(T1-T2) ..2 TS
(T3T4T5)...1 TS
(T6T7T8)...1 TS
.
On Sun, Sep 25, 2011 at 2:33 PM, siva viknesh sivavikne...@gmail.comwrote:
plz give detailed
@vikram
the one which i posted(link) it was newton raphson method which is used to
derive the square root of a number , there are many other methods if u r
interested visit wikipedia ,
and coming to this method write the code and xplain to him with an
xample...
--
You received this message
double sqrt(double c)
{
if (c 0) return error;
double err = 1e-15;
double t = c;
while (fabs(t*t - c) err)
t = (c/t + t) / 2.0;
return t;
}
On Sun, Sep 25, 2011 at 2:57 PM, teja bala pawanjalsa.t...@gmail.comwrote:
@vikram
the one which i posted(link) it was newton raphson method which
---
partik madan 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-a22f4159ec-363d645c31-lzW9eUV8TIRL6D8GX_X1FNpq_hw
You'll
---
partik madan 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-a22f4159ec-df83285ad2-FuxLvU7SFJ5iXMoDOsXGYyZ1Tfk
You'll
Binary search isn't the right term. Rather you want bisection. But
for each iteration it adds only one bit to the precision of the
answer.
You should also look at Newton's method. It doubles the number of bits
of precision in each iteration.
Algorithm: float sqrt(float x)
root = intial guess
Hi,
Can anyone give me some idea about telephonic interview of D.E.SHAW
for internships.What kind of questions do they ask generally? I know
it'll be a 30 min technical interview but don't know what to prepare
for it.Is there anyone who had given interview recently?
Thanks in advance.
--
You
A 4-stage pipeline has the stage delays as 150, 120, 160 and 140 ns
(nano seconds)
respectively. Registers that are used between the stages have a delay
of 5 ns each. Assuming
constant clocking rate, the total time taken to process 1000 data
items on this pipeline will
approximately be
a. 120 us
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 TS
(T3T4)...1 TS
(T6T5)...1 TS
(T7T8)...1 TS
4 Processor
(T1-T2) ..2 TS
(T3T4T5)...1 TS
(T6T7T8)...1 TS
.
What does it mean by simple BST ??
--
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/-/Q5mtepDUIx0J.
To post to this group, send email to
Q1) A sorted array is rotated unknown number of times , write an algorithm
to search an element in this rotated array in O(log n) .
Hint : Modify binary search
Q2) Write an algorithm to traverse a rectangular matrix spirally.
--
You received this message because you are subscribed to the
neone who has appeared for yahoo recently? can ne one mention thr i/w /
written rounds experience; they visited dce 3 days back also nit
surathkal...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
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 Algorithmic Puzzles
author:Narasimha Karumanchi
ISBN-10: 145654988X
ISBN-13: 978-1456549886
publisher:careermonk..
pls do send to this email
@ Decipher:
Q1) find where the rotation begins and do binary search in the first half or
the second half depending upon the search element
On Sun, Sep 25, 2011 at 8:58 PM, Decipher ankurseth...@gmail.com wrote:
Q1) A sorted array is rotated unknown number of times , write an algorithm
to
@sanjay can you please tell how did you arrive at that solution ?
On Sun, Sep 25, 2011 at 12:32 PM, Yogesh Yadav medu...@gmail.com wrote:
+1 Gohana
On Sun, Sep 25, 2011 at 12:28 PM, Sanjay Rajpal srn...@gmail.com wrote:
let the number of digits be n
then answer would be ((n+9)! ) /
Q1
int fun(int arr[],int left,int right,int num)
{
int mid=(left+right)/2;
if(mid==0)
return 0;
if(mid==num-1)
return 1;
if( arr[mid]arr[mid-1] arr[mid]=(arr[mid]+1))
return (num-mid);
else if(arr[mid]=arr[left])
return fun(arr,mid+1,right,num);
else
it has some errors..lemme modify it
On Sun, Sep 25, 2011 at 10:45 PM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
Q1
int fun(int arr[],int left,int right,int num)
{
int mid=(left+right)/2;
if(mid==0)
return 0;
if(mid==num-1)
return 1;
if(
that would be (n+9)C(n)..
On Sep 25, 10:05 pm, shady sinv...@gmail.com wrote:
@sanjay can you please tell how did you arrive at that solution ?
On Sun, Sep 25, 2011 at 12:32 PM, Yogesh Yadav medu...@gmail.com wrote:
+1 Gohana
On Sun, Sep 25, 2011 at 12:28 PM, Sanjay Rajpal
how ?
elaborate on the solution part ? how to arrive at that
formulation ?
On Sep 25, 11:39 pm, asdqwe ayushgoel...@gmail.com wrote:
that would be (n+9)C(n)..
On Sep 25, 10:05 pm, shady sinv...@gmail.com wrote:
@sanjay can you please tell how did you arrive at that solution ?
You are given 2 log files each having 1 billion entries and each entry has a
unique customer id.You need to print the records in two files which are
common.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
Are the customer id's in 2 files in sorted order ?
On Mon, Sep 26, 2011 at 1:29 AM, Ankur Garg ankurga...@gmail.com wrote:
You are given 2 log files each having 1 billion entries and each entry has
a unique customer id.You need to print the records in two files which are
common.
--
You
http://www.scribd.com/doc/50658450/Data-Structures-and-Algorithms-Made-Easy-For-Interviews-Programming-Interview-Questions
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
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 user
but dis 'll take extra stack space ,,,
another sol.. maintain a bit array for any of the log file and while doing
BFS
hi guys sourcebits is visiting our campus tomorrow
can anybody please telll us what type of question wiill be there in
wrriten and interview around
it would be great help :)
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
I cleared the written round, the next round was coding round.
We were asked to select any one problem out of three in 2 hrs.
Q1) Given n number of xml files find a particular word and output should
list all the files in current directory that contains that word.
Q2) Given a hierarichal
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 the first round .
in the interview round they asked me basics questions possibly from all the
subjects .
1)
Sol for Q1
http://www.geeksforgeeks.org/archives/1068
Sol for Q2
http://www.geeksforgeeks.org/archives/10768
On Sun, Sep 25, 2011 at 10:55 PM, Dheeraj Sharma
dheerajsharma1...@gmail.com wrote:
it has some errors..lemme modify it
On Sun, Sep 25, 2011 at 10:45 PM, Dheeraj
process was
written test
technical interview 1
tech interview 2
coading round
disscussion /improvement in coading
On Sep 26, 9:08 am, aditya kumar aditya.kumar130...@gmail.com wrote:
I cleared the written round, the next round was coding round.
We were asked to select any one problem out of
can u explain more on the coding question u solved?
On Sep 26, 9:08 am, aditya kumar aditya.kumar130...@gmail.com wrote:
I cleared the written round, the next round was coding round.
We were asked to select any one problem out of three in 2 hrs.
Q1) Given n number of xml files find a
49 matches
Mail list logo
