Recent activity by ronak.ladhar / GATE Overflow for GATE CSE

4 answers

1

GATE CSE 2021 Set 2 | Question: 8
What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size $n$? $\Theta ( \sqrt{n})$ $\Theta (\log _2(n))$ $\Theta(n^2)$ $\Theta(n)$

What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size $n$?$\Theta ( \sqrt{n})$$\Theta (\log _2(n))$$\Theta...

11.9k views

commented Feb 23, 2021

5 answers

2

GATE CSE 2021 Set 2 | Question: 7
Consider the three-way handshake mechanism followed during $\text{TCP}$ connection establishment between hosts $P$ and $Q$. Let $X$ and $Y$ be two random $32$-bit starting sequence numbers chosen by $P$ and $Q$ respectively. Suppose $P$ sends a $\text{TCP}$ connection request ... $=Y$, $\text{ACK}$ bit $=1$, $\text{ACK}$ number $=X$, $\text{FIN}$ bit $=0$

Consider the three-way handshake mechanism followed during $\text{TCP}$ connection establishment between hosts $P$ and $Q$. Let $X$ and $Y$ be two random $32$-bit startin...

7.0k views

commented Feb 23, 2021

3 answers

3

GATE CSE 2021 Set 1 | Question: 19
There are $6$ jobs with distinct difficulty levels, and $3$ computers with distinct processing speeds. Each job is assigned to a computer such that: The fastest computer gets the toughest job and the slowest computer gets the easiest job. Every computer gets at least one job. The number of ways in which this can be done is ___________.

There are $6$ jobs with distinct difficulty levels, and $3$ computers with distinct processing speeds. Each job is assigned to a computer such that:The fastest computer g...

11.8k views

commented Feb 23, 2021

1 answer

4

Which of the following statements is/are true?
The Operations P(S) & V(S) needs to be atomic. A process exiting the CS will call V(S) Busy-Wait' solutions to the Critical Section are typically implemented using machine instructions that execute in the Kernel mode All of ... the above process to enter the critical section) will never be able to run. Are my points incorrect? Please advice.

The Operations P(S) & V(S) needs to be atomic.A process exiting the CS will call V(S)‘Busy-Wait’ solutions to the Critical Section are typically implemented using mac...

3.3k views

commented Jan 9, 2021

1 answer

5

Find the grammar that generates inherently ambiguous context free language.

2.7k views

commented Jan 5, 2021

2 answers

6

Inherently ambiguous grammar
Q- Which one of following languages is inherently ambiguous? (A) The set of all strings of the form $\left\{a^nb^n,n>0 \right\}$ (B) $\left\{a^nb^nc^md^m,n,m>0 \right\}$ ... (D) Both (B) and (C) Plz explain.. ..........Is there any criteria on the basis of which we could identify inherently ambiguous grammar

Q- Which one of following languages is inherently ambiguous?(A) The set of all strings of the form $\left\{a^nb^n,n>0 \right\}$(B) $\left\{a^nb^nc^md^m,n,m>0 \right\}$(C)...

15.5k views

commented Jan 5, 2021

2 answers

7

Static Single Assignment
Definition of Static Single Assignment Static single-assignment form arranges for every value computed by a program to have a unique assignment (aka, “definition”) but p3 = a - b q4 = p3 * c p4 = u * v q5 = p4 + q4 is an valid example of SSA Now, tell me a,b,c,u,v are not assigned or previously recognized Then how this is a valid example of SSA? for ref see here

Definition of Static Single AssignmentStatic single-assignment form arranges for every value computed by a program to have a unique assignment (aka, “definition”)but ...

560 views

answered Dec 31, 2020

8 answers

8

#of variables in SSA
Consider the following code segment: c=b+a e=c-a f=c*e h=c+a i=h+f The minimum number of $\color{blue} {total}$ and $\color{blue} {temporary }$ variable required to convert the above code segment to static single assignment form are ________

Consider the following code segment:c=b+ae=c-af=c*eh=c+ai=h+f The minimum number of $\color{blue} {total}$ and $\color{blue} {temporary }$ variable required to convert t...

1.8k views

answered Dec 31, 2020

2 answers

9

Cache has a hit rate of 95%, 128 byte lines and a cache hit latency of 5 ns
A cache has a hit rate of 95 percent, 128-byte lines, and a cache hit latency of 5 ns. The main memory takes 100 ns to return the first word(32 bits) of a line, and 10 ns to return each subsequent word. What ... assume that the cache takes the same amount of time to detect that a miss has occurred as to handle a cache hit.)

A cache has a hit rate of 95 percent, 128-byte lines, and a cache hit latency of 5 ns. The main memory takes 100 ns to return the first word(32 bits) of a line, and 10 ns...

2.4k views

commented Dec 16, 2020

1 answer

10

[Co] hierarchical vs simultaneous memory organization
Please explain the concept of hierarchical vs simultaneous memory organization.I am not able to find this in book.There are lot of questions available on GO related to this concept,but most of the answers assume that memory organization is of ... In Simultaneous we access both in parallel or is there any order like L1 first ,then L2 and so on?

Please explain the concept of hierarchical vs simultaneous memory organization.I am not able to find this in book.There are lot of questions available on GO related to th...

5.8k views

commented Dec 16, 2020

4 answers

11

GATE CSE 2004 | Question: 64
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ ... }\\\hline \end{array} The total number of clock cycles required to execute the program is $29$ $24$ $23$ $20$

Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$\begin{array}{|l|l|c|} \hline \text {Instruction} & \text...

19.6k views

commented Dec 15, 2020

4 answers

12

GATE CSE 2004 | Question: 63
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ ... after executing the HALT instruction, the return address (in decimal) saved in the stack will be $1007$ $1020$ $1024$ $1028$

Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ $$\begin{array}{|l|l|c|} \hline \text {Instruction} & \t...

29.1k views

commented Dec 15, 2020

3 answers

13

GATE CSE 1994 | Question: 21
Consider the following recursive function: function fib (n:integer);integer; begin if (n=0) or (n=1) then fib := 1 else fib := fib(n-1) + fib(n-2) end; The above function is run on a computer with a stack of $64$ bytes. Assuming ... an address takes $2$ bytes each, estimate the maximum value of $n$ for which the stack will not overflow. Give reasons for your answer.

Consider the following recursive function:function fib (n:integer);integer; begin if (n=0) or (n=1) then fib := 1 else fib := fib(n-1) + fib(n-2) end;The above function i...

25.5k views

commented Dec 7, 2020

7 answers

14

GATE IT 2008 | Question: 18
How many bytes of data can be sent in $15$ seconds over a serial link with baud rate of $9600$ in asynchronous mode with odd parity and two stop bits in the frame? $10,000$ bytes $12,000$ bytes $15,000$ bytes $27,000$ bytes

How many bytes of data can be sent in $15$ seconds over a serial link with baud rate of $9600$ in asynchronous mode with odd parity and two stop bits in the frame?$10,000...

16.1k views

commented Nov 27, 2020

2 answers

15

GATE IT 2008 | Question: 68
Which of the following statements are TRUE? S1: TCP handles both congestion and flow control S2: UDP handles congestion but not flow control S3: Fast retransmit deals with congestion but not flow control S4: Slow start mechanism deals with both congestion and flow control $S1$, $S2$ and $S3$ only $S1$ and $S3$only $S3$and $S4$ only $S1$, $S3$ and $S4$ only

Which of the following statements are TRUE?S1: TCP handles both congestion and flow controlS2: UDP handles congestion but not flow controlS3: Fast retransmit deals wit...

15.9k views

commented Nov 26, 2020

2 answers

16

Round robin scheduling algorithm
What happens to average Turn Around Time if time quantum increased?

What happens to average Turn Around Time if time quantum increased?

10.7k views

commented Nov 4, 2020

3 answers

17

MadeEasy Subject Test: Theory of Computation - Decidability
Consider the following languages : L1 : {< M, q >|M is a Turing Machine that visits state q on some input within 15 steps}. L2 : {< M >|M is a Turing Machine, |M|< 200 where |M|is number of states in machine}. Which of the following is decidable please explain decidability for L1

Consider the following languages :L1 : {< M, q >|M is a Turing Machine that visits state q on some input within 15 steps}.L2 : {< M >|M is a Turing Machine, |M|< 200 wher...

561 views

answered Nov 4, 2020

3 answers

18

GATE2017 CE-2: GA-3
Four cards lie on table. Each card has a number printed on one side and a colour on the other. The faces visible on the cards are $2,3,$ red, and blue. Proposition: If a card has an even value on one side, then its opposite face is red. The card which MUST be turned over to verify the above proposition are $2,$ red $2,3,$ red $2,$ blue $2,$ red, blue

Four cards lie on table. Each card has a number printed on one side and a colour on the other. The faces visible on the cards are $2,3,$ red, and blue.Proposition: If a c...

3.2k views

answered Oct 24, 2020

3 answers

19

NIELIT 2017 DEC Scientist B - Section B: 43
Which one is the correct translation of the following statement into mathematical logic? “None of my friends are perfect.” $\neg\:\exists\:x(p(x)\land q(x))$ $\exists\:x(\neg\:p(x)\land q(x))$ $\exists\:x(\neg\:p(x)\land\neg\:q(x))$ $\exists\:x(p(x)\land\neg\:q(x))$

Which one is the correct translation of the following statement into mathematical logic?“None of my friends are perfect.”$\neg\:\exists\:x(p(x)\land q(x))$$\exists\:x...

1.3k views

commented Oct 21, 2020

0 answers

20

MadeEasy Test Series: CO & Architecture - Instruction Execution

542 views

commented Oct 20, 2020

1 answer

21

MadeEasy Test Series: CO & Architecture - Conflict Misses
I have got - 5 compulsory misses for first 5 ref. - 3 conflict misses for last 3 ref.

I have got - 5 compulsory misses for first 5 ref.- 3 conflict misses for last 3 ref.

1.1k views

commented Oct 20, 2020

3 answers

22

GATE CSE 1997 | Question: 5.3
A micro instruction is to be designed to specify: none or one of the three micro operations of one kind and none or upto six micro operations of another kind The minimum number of bits in the micro-instruction is: $9$ $5$ $8$ None of the above

A micro instruction is to be designed to specify:none or one of the three micro operations of one kind andnone or upto six micro operations of another kindThe minimum num...

11.4k views

commented Oct 18, 2020

2 answers

23

Gateforum Test Series: CO & Architecture - Microprogramming

825 views

commented Oct 18, 2020

1 answer

24

Computer Organization
Consider the following program segment used to execute on a hypothetical processor. Consider all the registers are of 16 bit size I1 MOV CX,0005 ; CX ← 0005 I2 MOV BX,OFF7H ; BX ← OFF7H I3 MOV AX,OBCAH ; AX ← OBCAH I4 OR BX,AX ; BX ← ... 4 cycles and transfer of control operations takes 2 cycles to execute. How much time is required to execute the program on a above CPU?

Consider the following program segment used to execute on a hypothetical processor. Consider all the registers are of 16 bit sizeI1 MOV CX,0005 ; CX ← 0005I2 MOV BX,OFF...

2.2k views

answered Oct 16, 2020

2 answers

25

Find number of minimum NAND and NOR gates required
F= PQ+ QR+ RS+ST. i) What is the minimum number of NAND gates required to implement F? ii) What is the minimum number of NOR gates required to implement F?

F= PQ+ QR+ RS+ST.i) What is the minimum number of NAND gates required to implement F?ii) What is the minimum number of NOR gates required to implement F?

8.5k views

commented Oct 12, 2020

3 answers

26

GEEKS FOR GEEKS GATE 2017 MOCK
If Kruskal’s algorithm is used for finding a minimum spanning tree of a weighted graph G with n vertices and m edges and edge weights are already given in a sorted list, then, What will be the time complexity to compute the minimum cost spanning tree given that union and find operations take amortized O(1) ? A O(m logn) B O(n) C O(m) D O(n logm)

If Kruskal’s algorithm is used for finding a minimum spanning tree of a weighted graph G with n vertices and m edges and edge weights are already given in a sorted list...

3.6k views

commented Sep 22, 2020

4 answers

27

GATE CSE 2016 Set 2 | Question: 41
In an adjacency list representation of an undirected simple graph $G=(V, E)$, each edge $(u, v)$ has two adjacency list entries: $[v]$ in the adjacency list of $u$, and $[u]$ in the adjacency list of $v$. These are called twins of each other. A twin pointer ... $\Theta\left(n+m\right)$ $\Theta\left(m^{2}\right)$ $\Theta\left(n^{4}\right)$

In an adjacency list representation of an undirected simple graph $G=(V, E)$, each edge $(u, v)$ has two adjacency list entries: $[v]$ in the adjacency list of $u$, and $...

19.6k views

commented Sep 22, 2020

2 answers

28

NIELIT 2016 MAR Scientist B - Section C: 19
If there is in NP-Complete language L whose complement is in NP, then complement of any language in NP is in P NP both (A) and (B) None of these

If there is in NP-Complete language L whose complement is in NP, then complement of any language in NP is inPNPboth (A) and (B)None of these

1.7k views

answered Sep 18, 2020

1 answer

29

GATE CSE 2005 | Question: 58
Consider the following two problems on undirected graphs: $\alpha$: Given $G(V, E)$, does $G$ have an independent set of size |V| - $4$? $\beta$: Given $G(V, E)$, does $G$ have an independent set of size $5$ ... $\beta$ is in P Both $\alpha$ and $\beta$ are NP-complete Both $\alpha$ and $\beta$ are in P

Consider the following two problems on undirected graphs:$\alpha$: Given $G(V, E)$, does $G$ have an independent set of size |V| - $4$?$\beta$: Given $G(V, E)$, does $G$ ...

6.6k views

commented Aug 17, 2020

1 answer

30

Poisson Distributions
Customers arrive at a shop according to a Poisson process at rate λ (/min), where they choose to buy either product A (with probability P) or product B (with probability 1 - P), independently. Given that during the first hour 5 customers chose product B, what is the probability ... shop within the first 10 minutes, all bought product A? 60% 70% 30% 40%

Customers arrive at a shop according to a Poisson process at rate λ (/min), where they choose to buy either product A (with probability P) or product B (with probability...

784 views

commented Aug 13, 2020

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true