### 1⟩ A building with height D ft shadow up to G. A neighbor building with what height shadow C ft is?

G shadow for height D ftC shadow for height = D*C/G

“Frequently Asked Aptitude Questions in various Aptitude job Interviews by interviewer. Get preparation of Aptitude job interview questions”

G shadow for height D ftC shadow for height = D*C/G

Answer:b:3 P.M.

Assumptions:

Distance between two points where Bus meets auto=x

Distance between the point where bus meets auto for the second time and Amritsar=y

velocity of bus=Vb

velocity of auto=va

vb=x/2

va=x/4

y=0.5*vb=05*x/2

time taken by auto for covering the distance y=y/va=1 Hour

hence time at which auto reaches Amritsar=2 P.M.+1 hour=3 P.M.

this is basically binary operation

n-intersection i.e.LOGICAL AND

U -union i.e. LOGICAL OR

AnB= 01011010

((AnB)uC)=01111111

A - C = 10001011

& (A - C) U B =

1 0 0 0 1 0 1 1

0 0 1 1 0 0 1 1

==========

1 0 1 1 1 0 1 1

HENCE,

ANS = 10111011

ANS-- 11

as A is short by 10- he has shot 1

as B is short by 2 - he has shot 9

9+1=10 10<11

THE OPTIONS ARE

1)55 2)64 3)32 4)53

ANSWER=55

It returns at the 9:58 am

no shankar4u ur wrong in ur calculation..... its ((A-c)B)

ie

197-51=146

146+58 = 204

X = 4 Hence Y = 36

so option 1,2&3 are correct

Its very simple... See by observing that in 2x+3y=100 2x is always even and 100 is also even so u need to have 3y also positive. so within 100 3 can be multiplied by 100/33 times to get an even number. So (b) 33 is the answer.

The Answer is 6:40 AM

The destination place is 80 degree west to the starting place. Hence the time difference between these two places is 5 hour 20 min. (=24hr*80/360).

When the flight landed, the time at the starting place is 12 noon (2 AM + 10 hours).

Hence, the time at the destination place is 12 noon - 5:20 hours = 6: 40 AM

There are seven children ( 3 girls and 4 boys )

The other condition 1,2 or 2,3 is not possible

Answer A

5-u

5-9

1-I

1-oteat

by substitution , consider x=2/3 & y=3

satisfyng ,x^2y^3=12;(2/3)^2*3^3=12

so 3x+4y=14

First we are taking the l.c.m of 1-10. the result is 2520.

then being the highest prime number 7.

we will divide 2520 by 7. the result will be 360.

which is the least number divisible by all numbers 1-10 other than 7

AM=Mr. Aye

AF= Mrs. Aye

BM=Mr. Bee

BF=Mrs. Bee

The possible sequence of matches can be :

AM(Win) Vs.AF

AM(win) Vs. BM

AM Vs. BF(win) Hence Mrs. Bee never lose.

in c++ programming language #incude<iostream.h> is must so it give error

see it doesn't matter that wat the time is being taken to fill the bucket.after reaching program it waits there for 10ms and back to the programmer in 20 ms.then total time to get the response is 20ms +10 ms=30ms...it's so simple....

Simple Silly question

Go to river catch fish

4*9=36

7*1=7

2*5=10

36+7+10=53...