;*
* union D{*
*char ch;*
*int x[5];*
* }s;*
*}a;*
* }b;*
*}*p;*
--
--
Shiv Narayan Sharma
Jt. Secretary CSI-DTU
+919971228389
www.jugadengg.com
--
hey how was your snapdeal exam you also please give some details ...
On Tuesday, 28 August 2012 22:26:48 UTC+5:30, [we]fork wrote:
-- Forwarded message --
From: sachin singh sach...@gmail.com javascript:
Date: Tue, Aug 28, 2012 at 10:23 PM
Subject: Snapdeal placement
, this
question is not base 26 number obviously.
On Wed, Aug 8, 2012 at 4:46 AM, shiv narayan narayan.shiv...@gmail.comwrote:
this is similar to conversion of no in base 26.( where digits are
a,b,c,d...z) just think it like decimal to binary conversion here base is
instead 26.
char Carr[26]={a,b
this is similar to conversion of no in base 26.( where digits are
a,b,c,d...z) just think it like decimal to binary conversion here base is
instead 26.
char Carr[26]={a,b,c...z}
i=0;
int arr[];
do
{
arrr[i++]=n%26;
n/=2;
}
while(n) ;
for(int i=n-1;i=0;i--)
coutCarr[a[i]];
correct me if i am
Preorder and postorder do not uniquely define a binary tree.
so question is vague .
On Sunday, 15 July 2012 01:41:15 UTC+5:30, Navin Kumar wrote:
Given Preorder and postorder traversals of a tree. Device an algorithm to
constuct a fully binary tree from these traversals.
--
You received
Preorder and postorder do not uniquely define a binary tree.
so question is vague .
On Sunday, 15 July 2012 01:41:15 UTC+5:30, Navin Kumar wrote:
Given Preorder and postorder traversals of a tree. Device an algorithm to
constuct a fully binary tree from these traversals.
--
You received
check this out http://www.careercup.com/question?id=14182739 .
On Friday, 6 July 2012 10:27:32 UTC+5:30, enchantress wrote:
Given a list of people and music bands they like, two people are
compatible if they have at least 2 bands in common. The compatibility of
two people is directly
6/5=1, in integer division, how come you can think it as 2?
On Tuesday, 3 July 2012 13:22:07 UTC+5:30, rahul sharma wrote:
#includestdio.h
#includeconio.h
int main()
{
int i;
i=5;
i=++i/i++;
printf(%d,i);
getch();
}
Why o/p is 1 and not 2?? what happened for
could you please provide free E-copy ?
On Saturday, 9 June 2012 22:00:52 UTC+5:30, Ravi wrote:
Hi All,
Hope you are all doing great.
I am a cloud engineer and specialize in cloud computing development
and architecting as well big data analysis. Check out my blog for my
views @
although we know this is compiler dependent , but still such questions are
very frequent in some local competitions and can be found in some old
books too.
is it possible to have such questions in any company placement paper
or interview ?
On Thursday, 14 June 2012 11:41:04 UTC+5:30, Ajesh js
this is the running code to find no of triangles using brute force technique
logic: in a triangle having sides a,b,c; then a+bc(if c is greatest side)
correct me if i am wrong.
#includeiostream
#includeconio.h
using namespace std;
int max(int a,int b,int c)
{
return ((ab?a:b)c?(ab?a:b):c);
}
On Jun 16, 2:1@shubham
couldnt understand following logic in you algo please explain
when first k elemnts traversed then traverse again k elemnts of B
and
S[2*k-i]+=B[i])...again S[i-2*k]+=B[i][.so on till B is traversed
completely.
6 am, Shubham Sandeep s.shubhamsand...@gmail.com wrote:
wat
-sharma/21/79b/507http://www.simplyamol.blogspot.com/
On Fri, Jun 15, 2012 at 7:01 PM, shiv narayan
narayan.shiv...@gmail.comwrote:
this is the running code to find no of triangles using brute force
technique
logic: in a triangle having sides a,b,c; then a+bc(if c is greatest side
@ayush goel couldnt really understand your algo , can you please explain
little bit more .
On Wednesday, 13 June 2012 21:49:49 UTC+5:30, Krishna Kishore wrote:
Given a array of integers both positive and negative and you need to shift
positive numbers to one side
and negative numbers to
will be better if you post on spoj forums.!!
On Wednesday, 13 June 2012 01:40:36 UTC+5:30, gaurav yadav wrote:
plz nyone explain how to approach this problem..
http://www.spoj.pl/problems/XORROUND/
--
You received this message because you are subscribed to the Google Groups
Algorithm
@jeevitesh yeah that may be right but it requires extra space as lot
of space will be wasted...
On May 5, 1:44 pm, Jeevitesh jeeviteshshekha...@gmail.com wrote:
Hi all,
I am new to this group.
My last post was deleted i do not know the reason behind it.
I will explain my logic here:-
as
can't be use squares of no's as said by rahul patil as said in
previous comment??
On Jan 4, 10:57 am, atul anand atul.87fri...@gmail.com wrote:
@sharad : after checking the link provided by u...it seem like complexity
will be O(n^2) { not sure } + saurabh point is also valid.
--
You received
Assume that you have just heard of a scandal and you are the first one
to know. You pass it on to four person in a matter of 30 minutes. Each
of these four in turn passes it to four other persons in the next 30
minutes and so on.
How long it will take for everybody in the World to get to know the
what is answer to In how many ways 3 identical coins can be placed in
5x5 grid so that no
two coin come in same row and same column ??
according to me it should be 25*16*9 .
On Sep 24, 2:19 am, Deoki Nandan deok...@gmail.com wrote:
1)write code to find first non repeating character in given
hi,
can anyone tell their experience of intern questions. and how to
prepare for essay.
On Aug 3, 5:02 pm, Ankit Minglani ankit.mingl...@gmail.com wrote:
heyy thanks alot to you people .. it was of so much help :)
On Wed, Aug 3, 2011 at 2:49 AM, Kunal Patil kp101...@gmail.com wrote:
according to me it is 1/3
read the line carefully What is the probability that the next pen
from the same packet will also be a blue one?
since it is said the first pen was blue and second pen must also be
blue. for it to happen 1st packet contaning all blue pen should be
selected whose
i have seen plenty of questions on string manipulation and bits
operations asked in various comcanies exams.
any one give me some good links where i can find some really good
tutorials on string manipulation.
--
You received this message because you are subscribed to the Google Groups
according to me 2nd structure must also have 16 bit size for 64 bit
architecture as padding must also take place there also.
On Aug 6, 4:10 am, Shashank Jain shashan...@gmail.com wrote:
i dont understand the diff btw dem, could u plz elaborate?
Shashank Jain
IIIrd year
Computer Engineering
yes we can.
On Aug 3, 10:08 pm, Arshad Alam alam3...@gmail.com wrote:
can we insert 16 elements of one dimension array in 4*4 of double dimension
array?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
Mike has $20 more than Todd. How much does each have given that
combined they have $21 between them. You can't use fractions in the
answer.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
solutions for cow questions:
if we consider first cow would she calf at age 2 then first new cow
would come at age two.
at end of 2nd year: 1st would give new cow:
at end of 3rd year:1st cow would another new cow
at end of 4th year :1st cow will give new cow and the cow born at end
of 2nd year
this is very popular interview question i also want solution.
On Jul 29, 11:19 am, jagrati verma jagrativermamn...@gmail.com
wrote:
an array containing +ve and -ve integers.find sub array with the largest
sum
--
You received this message because you are subscribed to the Google Groups
would it work
temp=root;
for(int i=0;ik;i++)
{
temp=temp-left;
}
On Jul 29, 10:48 am, sunny agrawal sunny816.i...@gmail.com wrote:
Node* x = TREE_MINIMUM(root);
for(int i = 0; i k-1; i++){
x = TREE-SUCCESSOR(x);}
return x;
On Fri, Jul 29, 2011 at 11:08 AM, noobcoder
i think for rat pair answer should be same as cow..correct me if i am
wrong
On Jul 29, 1:10 pm, sunny agrawal sunny816.i...@gmail.com wrote:
No ans will be sum of all
final fib. number is the no of she-calves of age 0
second last is number is she-calves of age 1
...and so on
so answer is
value of k in any if case would be k=m+n-1, now analyse both of the
options
i)jm, k=n+j-1, and a[n-1]b[j] if i=n
ii)in,k=m+i-1, and b[m-`1]=a[i] if j=m
for 1st case k=n+j-1 and jm so km+n-1 which is false
for 2nd case k=m+i-1 and in so km+n-1 which is also false so both
statement are false
ans:c
There is a clock at the bottom of the hill and a clock at the top of
the hill. The clock at the bottom of the hill works fine but the clock
at the top doesn't. How will you synchronize the two clocks.
Obviously, you can,t carry either of the clocks up or down the hill!
And you have a horse to help
There is a temple, whose premises have a garden and a pond. It has 4
idols, each of Ram, Shiv, Vishnu and Durga. The priest plucks x
flowers from the garden and places them in the pond. The number of
flowers
doubles up, and he picks y flowers out of them and goes to offer it to
Lord Ram. By the
Printf(“%d”,printf(“%d %d”,2,2) printf(“%d %d ”, 2, 2));
--
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
according to me it processing is done from righ to left .first right
most a would be incremented and then from righ to left
for first question answer should be 8+7+6=21
and for 2nd it should be
(8)+(7)*10+(6)*100=678
On Jul 15, 1:15 pm, Antony Kotre antonyko...@gmail.com wrote:
can any tell and
@sunny iam asking minimum no of comaparisons.
On Jul 14, 10:22 am, sunny agrawal sunny816.i...@gmail.com wrote:
n+lgn-2 no of comparisions will do
On Thu, Jul 14, 2011 at 10:19 AM, shiv narayan
narayan.shiv...@gmail.comwrote:
Describe an optimal algorithm to find the second minimum
A car is traveling at a uniform speed.The driver sees a milestone
showing a 2-digit number. After traveling for an hour the driver sees
another milestone with the same digits in reverse order.After another
hour the driver sees another milestone containing the same two digits.
What is the average
Describe an optimal algorithm to find the second minimum number in an
array of numbers. What is the exact number of comparisons required in
the worst case? Note that they didn't ask the order in Big-Oh
notation. They wanted the exact number of comparisons.
--
You received this message because
cant i invoke both simultaneously??
if i try to make two objects like
x const a;
x a;
then it gives error..can u explain plz.
On Jul 12, 9:55 pm, Sandeep Jain sandeep6...@gmail.com wrote:
*const* in C++ is not exactly same as *final* in java. SO unlike java adding
the keyword const to a
it would be size of int.
On Jul 7, 10:34 am, oppilas . jatka.oppimi...@gmail.com wrote:
Ok. So for differentiating objects, we have size 1. What will be size of
following class:-
class A{
int z;};
How does different objects gets differentiated in above case?
On Wed, Jul 6, 2011
* You are given 2 eggs.
* You have access to a 100-storey building.
* Eggs can be very hard or very fragile means it may break if dropped
from the first
floor or may not even break if dropped from 100 th floor.Both eggs are
identical.
* You need to figure out the highest floor of a 100-storey
, Jul 6, 2011 at 11:11 PM, TIRU REDDY tiru...@gmail.com wrote:
14
On 6 Jul 2011 22:35, shiv narayan narayan.shiv...@gmail.com wrote:
* You are given 2 eggs.
* You have access to a 100-storey building.
* Eggs can be very hard or very fragile means it may break if dropped
from the first
speed of river=(distance traveled by object in it) / total time it
took to travel
here hat has traveled a distance of 1 KM
and it has taken =5mn+5 min=10 min=10min/60=1/6 hrs;
so speed = 1/(1/6)=6km/hr
On Jul 6, 9:28 pm, Tushar Bindal tushicom...@gmail.com wrote:
Let speed of boat be x miles/hr
hey i am getting size of empty struct 1.
check my code
#includeiostream
#includeconio.h
using namespace std;
struct empty{};
int main()
{
empty e;
int x=sizeof(e);
coutx;
getch();
return 0;
}
when i run this i get 1 as output
On Jul 6, 10:16 pm, Ashish Modi ashishrmod...@gmail.com
Write a program that accepts an input integer n, and calculates the
number and sum of all the numbers between 1 and n (inclusive) that are
NOT evenly divisible by ANY of the first 5 prime numbers (2,3,5,7,11).
The program should print out a clearly labeled count and sum
my code is : it is not
@ tushar
as per your interpretation this looks coreect...but i am not saying to
exclude all no's which are divisible by first 5 prime no ..question
says to exclude those no which are evenly divisible by first 5 prime
no..
On Jul 5, 10:47 pm, Tushar Bindal tushicom...@gmail.com wrote:
If my
@ tushar just one modification to you code would make the things
correct.makin if (a % 2*prime[b] == 0) inspite of if (a % prime[b]
== 0) would take care of even things
hope i am correct..
thanx! for the reply
On Jul 5, 10:47 pm, Tushar Bindal tushicom...@gmail.com wrote:
If my
@ashish thanx buddy
nice solution
On Jul 6, 7:20 am, Ashish Goel ashg...@gmail.com wrote:
Q3 : 42101000
started with 7000
then changes this to
6010
51000100 to
42101000 to
Best Regards
Ashish Goel
Think positive and find fuel in failure
+919985813081
+919966006652
On
can u please explain how is it 3?
On Jun 26, 11:18 pm, D.N.Vishwakarma@IITR deok...@gmail.com
wrote:
3 mice .
On Sun, Jun 26, 2011 at 6:13 PM, ArPiT BhAtNaGaR
arpitbhatnagarm...@gmail.com wrote:
3
On Mon, Jun 27, 2011 at 2:10 AM, amit the cool
amitthecoo...@gmail.comwrote:
can you please give the link of the book or mail me at
narayan.s...@gmail.com
On Apr 24, 7:31 pm, D.N.Vishwakarma@IITR deok...@gmail.com wrote:
I have shared this book with algo geek group please check in group
On Sun, Apr 24, 2011 at 6:52 PM, hary rathor harry.rat...@gmail.com wrote:
send
49 matches
Mail list logo
