Lfg Interview Questions, Process, and Tips

D

Error is at 48. Correct once is 58

underroot(1-r^2)/3

Therefore, the number of possible 13 digit numbers using 1, 2, 3, 4, 5 which are divisible by 4

= x 3 + x 2

= (3 + 2)

=

= 244140625 ways

Here is the ans with explanation…..
Just divide 48 hours into 8 parts…
for flowchart its 1/4 so it is 2/8 = 12hours
For Coding it is 3/8 = 18 hours
the rest is again 3/8 = 18 hours for debugging..

1

c-> structured oriented lang
Pascal-> Procedure oriented lang

Quick

Money will give Luxury but not experience

Ans = 8
Use simple box method
[1][2][2][2]= 1x2x2x2 =8
Logic >
once place have 2 number (2,6)
Tens place have also 2 number (7,3)
So that number is divisible by 4
Now, 2 numbers fixed at once and tens place left 2 numbers which is choice at hundredth place
Now 3 number fix left 1 number which is placed at thousands place
Total number form is 4×4 = 16
But divisible by 4 is 1x2x2x2 =8

Three families