1

IIsc has released dates for written test.

I know nearly all the current/previous toppers are on GO, can you guys please share what to read for the test? I’ve read past year interviews but most of them had choice of subject to get asked on, a liberty we might not have in the written test.

2

First instance of T2 is arriving at T1, so second instance at 1+7 = T8. Now, if finishes at T9 and next arrival is only at T15.

3

total schedule = 6!/2!*2!*2! = 90 and every schedule is conflict equal schedule because no cycle in any precedence graph .. by symmetry each serial schedule must have equal no of conflict schedule.. der are 90 schedule and 3! serial schedule.. T1 ----> T2 ----> T3 is one out of 6 serial schedule. so no ofconflict equal schedule which is equal to T1 ----> T2 ----> T3 = 90/6 = 15

4

every write commit before next operation.. no Write Write conflict so no Lost update problem. no Dirty read also..

5

Car C, we get 3 matching tuples with 1+1+2+2=6 comparisons assuming red is compared first and then green. Now these 3 are compared with 10 tuples in reservation. After this we get 4 dids which we compare with 10 tuples of Driver. I think we get 60-64 comparisons.

6

Answer is option D. Probability of choosing the correct option = $\frac{1}{4}$ Probability of choosing a wrong option = $\frac{3}{4}$ So, expected mark for a question for a student = $\frac{1}{4} \times 1 + \frac{3}{4}\times (-0.25) = 0.0625$ Expected mark for a ... = $0.0625 \times 150 = 9.375$ So, sum total of the expected marks obtained by all $1000$ students = $9.375 \times 1000 = 9375$.

7

In CNF, any non-terminal can derive empty string?

8

Let the sequence be 1 2 3 4 5 6 7 8 (=A) if i select any 3 elements say 3,4,5 (=C) then B would be 1,2,6,7,8 On merging B and C i get 1,2,6,7,8,3,4,5 which is not in ascending order as A.. Can you please explain the case as here i am not getting A on merging....

9

sir, let if L1={ab} than L2 can be {ba} n here also l1 intersection l2 is empty n l1 union l2 is regular n thus we can say that l2 can be regular n finite. Is this approach right to say that l2 can be regular n finite??

11

present state next state output of multiplexer 000 001 I0 001 011 1 011 010 1 010 110 I1 110 111 I3 111 101 1 101 100 1 100 000 I2 all states are in gray format.. A option..

13

I am just reading that Microperations from Morris mano They have explained the concept of 3 state gate which can be used as a multiplexer which have output 1, 0 and high Impedance. what is used of it (I am not getting )

14

Base relative is unsigned but PC relative is signed.

16

Can you explain me this : A table is in second normal form if every attribute is determined by every candidate key , but is not determined by any pure subset of Candidate key ? True or false

17

Cool even i got the same answer so answer is false ! right ?

18

A,B,C,D all are prime attribute so no partial as well as no transitive dependencies..

19

Hi @laser0 , can u please clarify one doubt of mine. In case of K3,3 , that is also complete bipartite graph , isn't it ? So , is the answer 3 ?

20

Can you explain why the offset in addressing modes need to be a signed integer ?