Dark Mode

Recent activity by soumam007

1 answer

1

MADEEASY TEST SERIES
WHICH OF THE FOLLOWING IS NOT A VALID DESCRIPTION OF THE INPUT ALPHABET SET? ANSWER IS GIVEN AS {01,110,NULL} WITH A EXPLAINATION THAT ALPHABET CANNOT CONTAIN NULL . NOW I HAVE A QUESTIONN REGARDING THAT {0,1,01 } IS NOT ALPHABET WHY ? AND {01,10} IS ALPHABET WHY ?? ... ? AS I KNOW FOR {0,1,01} IS WHEN WE WRITE 01 WE CANT DIFFERENTIATE IT IS FROMM 0 AND 1 OR 01?? RIGHT??

commented in Theory of Computation Jan 20, 2019

570 views

5 answers

2

GATE CSE 2008 | Question: 13, ISRO2016-36
If $L$ and $\overline{L}$ are recursively enumerable then $L$ is regular context-free context-sensitive recursive

answered in Theory of Computation Jan 12, 2019

10.0k views

5 answers

3

Number of moves of smallest disc in tower of Hanoi
______ is the number of moves of the smallest disc in Tower of Hanoi implementation where the tower consisting of 17 discs (numbered from 0 to 16) Answer given: $2^{16}$ = 65536 Please explain

answered in DS Dec 30, 2018

2.8k views

3 answers

4

Test Series
Examine the structure of the EMPLOYEES table: EMPLOYEE_ID NUMBER Primary Key FIRST_NAME VARCHAR2(25) LAST_NAME VARCHAR2(25) Assume all the following four options are executed in the same sequence order. Which statement will not insert a row into the table? a. INSERT ... (employee_id) VALUES (1000); d. INSERT INTO employees (employee_id, first_name, last_name) VALUES ( 1000, John', ');

answered in Databases Dec 28, 2018

9.3k views

4 answers

5

GATE CSE 2015 Set 3 | Question: GA-10
The exports and imports (in crores of $Rs$.) of a country from the year $2000$ to $2007$ are given in the following bar chart. In which year is the combined percentage increase in imports and exports the highest?

commented in Quantitative Aptitude Dec 27, 2018

4.3k views

0 answers

6

Beladys anamoly
"if an algorithm has stack property then it never falls into Beladys Anomaly" Is their any simple proof to this? Also I wanna know if it's one way or two way implication. Thanks.

commented in Operating System Dec 11, 2018

756 views

2 answers

7

Process Synchronisation Of Operating System
Consider the below Algorithm where flag and lock are global variables: P0: P1: while (flag= =1 && lock= = 0); while (flag= = 0 && lock= = 1); Enter CS Enter CS lock= 0 flag= 0 flag= 1 lock= 1 (a) The above algorithm is deadlock free (b) The above algorithm guarantees Mutual Exclusion (c) Both (a) & (b) (d) None of the above

commented in Operating System Dec 8, 2018

1.1k views

6 answers

8

GATE CSE 2016 Set 2 | Question: 55
Consider a $128 \times 10^3$ bits/second satellite communication link with one way propagation delay of $150$ milliseconds. Selective retransmission (repeat) protocol is used on this link to send data with a frame size of $1$ kilobyte ... acknowledgement. The minimum number of bits required for the sequence number field to achieve $100 \%$ utilization is ________.

commented in Computer Networks Sep 23, 2018

17.4k views

12 answers

9

GATE CSE 2016 Set 1 | Question: 41
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly $Top(S)$ returns the element at the top of $S$ without removing ... = Pop(S); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.

commented in DS Sep 10, 2018

24.8k views

7 answers

10

GATE CSE 2017 Set 1 | Question: 36
Consider the C functions foo and bar given below: int foo(int val) { int x=0; while(val > 0) { x = x + foo(val--); } return val; } int bar(int val) { int x = 0; while(val > 0) { x ... in: Return of $6$ and $6$ respectively. Infinite loop and abnormal termination respectively. Abnormal termination and infinite loop respectively. Both terminating abnormally.

commented in Programming Sep 6, 2018

20.0k views

2 answers

11

Language identify
consider following language L1= {a^nB^b/n>=0} L2= compliment of L1 choose the correct option regarding the language L1& L2 1. L1 &L2 are context free 2.L1 is context free but L2 is regular 3.L1 is context free & L2 is contxt sensitive 4. none

commented in Theory of Computation Jan 24, 2018

2.6k views