Dark Mode

Recent activity by yg92

2 answers

1

ISRO2017-71
At a particular time the value of counting semaphore is 10. It will become 7 after: 3 V operations 3 P operations 5 V operations and 2 P operations 2 V operations and 5 P operations

commented in Operating System May 7, 2017

13.5k views

3 answers

2

ISRO2017-16
Given two statements Insertion of an element should be done at the last node of the circular list Deletion of an element should be done at the last node of the circular list Both are true Both are false First is false and second is true None of the above

commented in DS May 7, 2017

10.5k views

2 answers

3

Probability Exercise
The chess club of two school consists of 8 and 9 players.4 member from each club are randomly chosen to participate in a competition of two school.chosen player from one team are then randomly paired against chosen players of another team.suppose Rebecca and ... and Elise will be paired 2.Rebecca and Elise will be chosen to play but they will NOT be paired against Each Other

commented in Probability Apr 11, 2017

665 views

1 answer

4

MadeEasy Workbook: Probability - Conditional Probability
Q : Two computers A and B are to be sold . A salesman who is assigned the job of selling these has the chances of 60 percent and 40 percent respectively to get success.The two computers may be sold independently.Given that at least ... probability that computer A has been sold is ..........(Round off your answer correct to 2 decimal places).

commented in Probability Apr 5, 2017

3.3k views

7 answers

5

GATE CSE 2017 Set 1 | Question: 27
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock $l$, then it cannot re-acquire lock $l$ without releasing ... $x = 1, y = 2$ $x = 2, y = 1$ $x = 2, y = 2$ $x = 1, y = 1$

commented in Operating System Mar 28, 2017

33.1k views

12 answers

6

GATE CSE 2017 Set 1 | Question: 44
In a RSA cryptosystem, a participant $A$ uses two prime numbers $p = 13$ and $q = 17$ to generate her public and private keys. If the public key of $A$ is $35$, then the private key of $A$ is __________ .

commented in Computer Networks Mar 25, 2017

23.7k views

11 answers

7

ISRO2015-30
Semaphores are used to solve the problem of Race Condition Process Synchronization Mutual Exclusion None of the above I and II II and III All of the above None of the above

commented in Operating System Mar 25, 2017

21.5k views

7 answers

8

GATE CSE 2017 Set 1 | Question: 45
The values of parameters for the Stop-and-Wait ARQ protocol are as given below: Bit rate of the transmission channel $= 1$ Mbps. Propagation delay from sender to receiver $= 0.75$ ms. Time to process a frame $= 0.25$ ms. Number ... (expressed in percentage) of the Stop-and-Wait ARQ protocol for the above parameters is _____________ (correct to $2$ decimal places).

commented in Computer Networks Feb 28, 2017

32.8k views

4 answers

9

GATE CSE 2017 Set 1 | Question: 42
In a database system, unique timestamps are assigned to each transaction using Lamport's logical clock. Let $TS(T_{1})$ and $TS(T_{2})$ be the timestamps of transactions $T_{1}$ and $T_{2}$ ... -free. The database system is starvation-free, but not deadlock-free. The database system is neither deadlock-free nor starvation-free.

comment edited in Databases Feb 23, 2017

26.8k views

5 answers

10

GATE CSE 2017 Set 1 | Question: 40
Recall that Belady's anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements: $S_1$: Random page replacement algorithm (where a page chosen at random is replaced) suffers from Belady's ... is true, $S_2$ is false $S_1$ is false, $S_2$ is true $S_1$ is false, $S_2$ is false

commented in Operating System Feb 16, 2017

15.1k views

11 answers

11

GATE CSE 2017 Set 1 | Question: 43
Consider the following grammar: stmt $\rightarrow$ if expr then expr else expr; stmt | $Ò$ expr $\rightarrow$ term relop term | term term $\rightarrow$ id | number id $\rightarrow$ a | b | c number $\rightarrow [0-9]$ where relop is a relational ... program if $e_1$ then $e_2$ else $e_3$ has $2$ control flow paths. $e_1 \rightarrow e_2$ and $e_1 \rightarrow e_3$.

commented in Compiler Design Feb 16, 2017

20.2k views

11 answers

12

GATE CSE 2017 Set 1 | Question: 08
Consider the C code fragment given below. typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->next; } p->next = m; } Assuming that m and n ... append list m to the end of list n. cause a null pointer dereference for all inputs. append list n to the end of list m for all inputs.

commented in DS Feb 15, 2017

25.6k views

8 answers

13

GATE CSE 2017 Set 1 | Question: 10
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$S \rightarrow abScT \mid abcT$$T \rightarrow bT \mid b$ ... $\{\left ( ab \right )^{n}\left ( cb^{n} \right )^{m} \mid m,n \geq 1 \}$

answer edited in Theory of Computation Feb 15, 2017

21.6k views

7 answers

14

GATE CSE 2017 Set 1 | Question: 13
Consider the following C code: #include<stdio.h> int *assignval (int *x, int val) { *x = val; return x; } void main () { int *x = malloc(sizeof(int)); if (NULL == x) return; x = assignval (x,0); ... and not as shown. compiles successfully but execution may result in dangling pointer. compiles successfully but execution may result in memory leak.

commented in Programming in C Feb 15, 2017

35.2k views

5 answers

15

GATE CSE 2017 Set 1 | Question: 41
Consider a database that has the relation schemas EMP(EmpId, EmpName, DeptId), and DEPT(DeptName, DeptId). Note that the DeptId can be permitted to be NULL in the relation EMP. Consider the following queries on the database expressed in tuple relational calculus. { ... Which of the above queries are safe? I and II only I and III only II and III only I, II and III

answered in Databases Feb 15, 2017

25.1k views

4 answers

16

GATE CSE 2017 Set 1 | Question: 12
Consider the following intermediate program in three address code p = a - b q = p * c p = u * v q = p + q Which one of the following corresponds to a static single assignment form of the above code? p1 = a - b q1 = p1 * c p1 = u * v q1 = p1 + q1 p3 = a - b q4 = p3 * c p4 = ... = a - b q1 = p2 * c p3 = u * v q2 = p4 + q3 p1 = a - b q1 = p * c p2 = u * v q2 = p + q

commented in Compiler Design Feb 14, 2017

11.5k views

7 answers

17

GATE CSE 2017 Set 1 | Question: 14
Consider a TCP client and a TCP server running on two different machines. After completing data transfer, the TCP client calls close to terminate the connection and a FIN segment is sent to the TCP server. Server-side TCP responds by sending an ACK, which is ... TCP connection wait for the FIN from the server-side TCP? LAST-ACK TIME-WAIT FIN-WAIT-$1$ FIN-WAIT-$2$

asked in Computer Networks Feb 14, 2017

13.8k views

1 answer

18

Gate_2017_Set_1_9

asked in Operating System Feb 14, 2017

446 views

1 answer

19

Gate2017_Set_1_6

asked in CO and Architecture Feb 14, 2017

350 views

3 answers

20

Gate 2017 Set-1 first order logic
Consider following first order logic $\forall x ( \exists y R( x, y ) )$ is equivalent to 1) $\exists y ( \exists x R( x, y ) )$ 2) $\exists y ( \forall x R( x, y ) )$ 3) $\forall y ( \exists x R( x, y ) )$ 4) $\neg \exists x ( \forall y \neg R(x,y) )$ Note: Not sure in the question was it equivalent to or which of these are implied by

commented in Mathematical Logic Feb 13, 2017

2.3k views

1 answer

21

Gate 2017 Set 1 minimum Comparisons
Consider an array A of size 31 consisting of 0's followed by number of 1's. In order to find the smallest index i such that A[i]=1 minimum number of comparisons required in worst case by optimal algorithm?

asked in Programming in C Feb 12, 2017

213 views

1 answer

22

Gate 2017 Set-1 Min Reg/Nor gates
Could somone pls confirm what is the ans for min NOR gates and min number of Registers? Also what was the marks distribution for Memory Leal/Malloc DS question?

asked in Digital Logic Feb 12, 2017

481 views

8 answers

23

Subnet mask-NID
For a class C network if IP address of a computer is 200.99.39.112 and subnet mask is 255.255.255.224 the decimal value of last octet of last host of sixth subnet is ? shouldn't it be 190 but the answer given is 222? anyone help

commented in Computer Networks Feb 10, 2017

5.4k views

0 answers

24

Are CSL, RE, Recursive languages closed under Subset operation?
Regular languages are not closed under Subset - Example anbn is subset of a*b* which is non-regular. DCFL/CFL languages are not closed under Subset - Example anbncn is subset of anbnc* which is non-cfl. Are the languages CSL,Recursive or Recursively Enumerable lanuages closed under Subset operation?

commented in Theory of Computation Feb 10, 2017

2.7k views

2 answers

25

decidability
is intersection of two context sensitive decidable?? I think since they are closed under intersection, it must be decidable. please answer

commented in Theory of Computation Feb 10, 2017

1.8k views

1 answer

26

Cache Hit Ratio
A processor refers to the cache memory 1000 times. Out of which 150 references are resulting in misses due to conflicts, 100 of them are due to capacity limitations and 100 of them are due to compulsory page faults. Calculate the hit ratio for direct mapping and associative mapping.

commented in CO and Architecture Feb 10, 2017

1.2k views

1 answer

27

Testbook Test Series: Computer Networks - Csma Cd
A 2-km-long, 10-Mbps CSMA/CD LAN (not 802.3) has a propagation speed of 200 m/microsec. Repeaters are not allowed in this system. Data frames are 512 bits long, including 32 bits of header, checksum, and ... The effective data rate is _____________________ Mbps (correct to 2 decimal places), excluding overhead, assuming that there are no collisions?

comment edited in Computer Networks Feb 9, 2017

2.0k views

2 answers

28

PTE- paging
consider a paging system with 48bit virtual address space.Each address defers to a byte in memory.suppose the size of page is 16KB and the main memory size is 16GB.The minimum size of page table with each entry need 2 protection bits is _____ (in GB) now what should be ... . should i round it to 3bytes and make answer as 48GB or shuld i keep it as it is and write the answer as 44GB?

commented in Operating System Feb 9, 2017

840 views

6 answers

29

Gate ECE 2017 Eigen Value
For the given matrix A, one of the Eigenvalue is real $A=\begin{bmatrix} 1 &2 &3 &4 &5 \\ 5 &1 &2 &3 &4 \\ 4&5 &1 &2 &3 \\ 3&4 &5 &1 &2 \\ 2 &3 &4 &5 &1 \end{bmatrix}$ The real Eigen value is:

commented in Linear Algebra Feb 9, 2017

5.3k views

2 answers

30

GATE2016 EC-3: GA-6
The velocity $V$ of a vehicle along a straight line is measured in $m/s$ and plotted as shown with respect to time in seconds. At the end of the $7$ seconds, how much will the odometer reading increase by (in m)? $0$ $3$ $4$ $5$

commented in Quantitative Aptitude Feb 9, 2017

4.8k views