0% found this document useful (0 votes)
283 views4 pages

Dinner Seating and Logical Puzzles

The document describes a scenario where 6 people (A, B, C, D, E, F) are sitting around a table for dinner. Certain conditions are provided about who can and cannot sit next to each other. For example, A does not like to sit opposite or beside C, and B and F always like to sit opposite each other. Several multiple choice questions are then asked about the possible seating arrangements and who may be sitting next to each other given these conditions.

Uploaded by

piyush2801
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
283 views4 pages

Dinner Seating and Logical Puzzles

The document describes a scenario where 6 people (A, B, C, D, E, F) are sitting around a table for dinner. Certain conditions are provided about who can and cannot sit next to each other. For example, A does not like to sit opposite or beside C, and B and F always like to sit opposite each other. Several multiple choice questions are then asked about the possible seating arrangements and who may be sitting next to each other given these conditions.

Uploaded by

piyush2801
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

6 people A,B,C,D,E and F sit around a table for dinner.

Since (a) 485


A does not like C, he doesn't sit either opposite or                    (b) 480
beside C.B and F always like to sit opposite each other. (c) 478
(d) 481
1. If A is beside F then who is are the two neighbours of B?
Ans. (d)
(a) D and C
(b) E and C 5. Ravi's salary was reduced by 25%.Percentage increase to
(c) D and E be effected to bring the salary to the original level is
(d) Either (a) or (b)
(a) 20%
Ans. (c) (b) 25%
(c) 33 1/3%
2. If D is adjacent to F then who is adjacent to C? (d) 30%
(a) E and B Ans. (c)
(b) D and A
(c) D and B 6. A and B can finish a piece of work in 20 days .B and C in 30
(d) either (a) or (c) days and C and A in 40 days. In how many days 
    will A alone finish the job
Ans.(d)
(a) 48
3. Complete the sequence A, E ,I ,M ,Q ,U , _ , _ (b) 34 2/7
(a) B, F (c) 44
(b) Y, C (d) 45
(c) G, I Ans. (a)
(d) K, O
7. How long will a train 100m long travelling at 72kmph take
Ans.(b) to overtake another train 200m long travelling at 54kmph ?
4. If the letters of the word "rachit" are arranged in all (a) 70sec
possible ways and these words are written out as in a (b) 1min
dictionary,             (c) 1 min 15 sec
    what is the rank of the word "rachit". (d) 55 sec
Ans. (b) (c) qhutbk
(d) qhubtk
8. What is the product of the irrational roots of the equation
(2x-1)(2x-3)(2x-5)(2x-7)=9? Ans. (c)

(a) 3/2 12. If "football" is "cricket" ,"cricket" is


(b) 4 "basketball" ,"basketball" is "volleyball","volleyball" is
(c) 3 "khokho" and "khokho" is 
(d) 3/4       cricket, which is not a ball game?

Ans. (a) (a) cricket


(b) football
(c) khokho
9. The total population of a village is 5000.  The number of (d) basketball
males and females increases by 10% and 15% Ans. (a)
respectively             
     and consequently the population of the village becomes 13. Which of the following is a recursive set of production
5600.  what was the number of males in the village ?
(a) S --> a|A, A --> S
A) 2000    B) 2500    C) 3000    D) 4000 (b) S --> a|A, A --> b
(c) S -->aA, A-->S
Ans : C (d) None of these
10. Fresh fruit contains 68% water and dry fruit contains Ans. (c)
20% water.  How much dry fruit can be obtained from 100
kg                14. A sum 's' is divided into 4 parts. second person gets Rs 10
      of fresh fruits ? more than first.3rd person is Rs 10 more than
second,               
A) 32 kg    B) 40 kg    C) 52 kg    D) 80 kg       4th is 10 more than [Link] much amount do 1st person
Ans : B get.

11. If "segment" is coded as rffndou, then "ritual" is coded as Ans: (s-60)/4

(a) shutbm 15. One ship goes along the stream direction 28 km and in
(b) qjutbk opposite    direction 13 km in 5 hrs for each direction. What
is the  7. What data structures you should use for dictionary
       velocity of stream? searching and it  should be capable of doing spell check
also ?
Ans:  1.5 kmph
Ans: Hashing
Section3-technical ,20 questions
8. What is the value of 121 base 4 + 84 base 16 ?
1. What sorting algos have their best and worst case times
equal ? Ans :  2130

Ans. O(nlogn) for  mergesort  and heap sort 9. When the fn. is called where the return address is stored?

2. What page replacement algorithm has minimum number Ans. stack


of page faults ?
10.  C program code
Ans. Optimality algorithm
int zap (int n)
3.  What is the use of virtual base class in c++
{
Ans. Multiple lines between derived classes.
if (n<=1)then zap=1;
4. Assignment operator targets to _____
else  zap=zap(n-3)+zap(n-1);
Ans. l-value
}
5. A byte addressable computer has memory capacity of 2
power m Kbytes and can perform 2 power n operations then the call zap(6) gives the values of zap
an                [a] 8  [b]  9  [c] 6  [d]  12  [e] 15
     instruction involving three operands and one operator
needs maximum of___________ bits Ans: b
Ans. 3m + n 11.  Virtual memory size depends on
6. In round robin scheduling, if time quantum is too large [a] address lines    [b] data bus
then it degenerates to
[c] disc space       [d] a & c    [e] none
Ans. FCFS
Ans :  a
12. Critical section is Ans. A

Ans: statements which are accessing shared resources 18. Which is not an OS?

13. In which layer ROUTING is performed ? a)      Win 3.1        b)      Win 95

Ans.  Network Layer c)      Win 98       d)      Win 2000

14.  What is the output of the following  code snippet Ans. a

main() 19. Tcp/ip is

{ a) connectionless            b) connection oriented            c) both


a & b           d) none
printf(5+”Fascimile”);
Ans:  b
}
20. A sorting algorithm which can prove to be a best time
Ans. mile algorithm in one case and a worst time algorithm in worst
15. Which one has no L-Value case is

A   a[i]         B.  i         C.  2             D.  *(a+i) (a) Quick Sort         (b) Heap Sort     (c) Merge Sort         (d)
Insert Sort
Ans . C

16.     Which is true for binary search ?

A Traversal scheme                                B. Greedy algorithm

C. Divide and conquer algorithm             D. none of these

Ans. C

17.      What is the protocol used for getting the physical
address by supplying  IP address of a node ?

A.  ARP         B.  RARP         C. BOOTP         D. DHCP

You might also like