Answers by afroze / GATE Overflow for GATE CSE

2 votes

1

Analysis of algorithms
Is ln(n!)=theta(n ln(n))?

Is ln(n!)=theta(n ln(n))?

392 views

answered Nov 3, 2022

3 votes

2

Process Synchronisation
What is the significance of infinite loop that is written in every example of process synchronisation? What would happen if there wasn't any infinite loop?

What is the significance of infinite loop that is written in every example of process synchronisation? What would happen if there wasn't any infinite loop?

909 views

answered Oct 24, 2022

2 votes

3

UGC NET CSE | October 2022 | Part 1 | Question: 2
Consider two lists $\mathrm{A}$ and $\mathrm{B}$ of three strings on $\{0,1\}$ $X$ : List A List B $1$ $111$ $10111$ $10$ $10$ $0$ $Y$: List A List B $10$ $101$ $011$ $11$ $101$ $011$ Which of the following is true? ... solution., PCP in both $\mathrm{X}$ and $\mathrm{Y}$ has solution. PCP neither in $\mathrm{X}$ nor in $\mathrm{Y}$ has solution.,

Consider two lists $\mathrm{A}$ and $\mathrm{B}$ of three strings on $\{0,1\}$$X$ : List AList B$1$$111$$10111$$10$$10$$0$$Y$:List AList B$10$$101$$011$$11$$101$$011$Whic...

1.0k views

answered Oct 23, 2022

2 votes

4

UGC NET CSE | October 2022 | Part 1 | Question: 76
Consider the following statements: Statement $\text{I}$: $\text{LALR}$ parser is more powerful than canonical $\text{LR}$ Parser. Statement $\text{II}$: $\text{SLR}$ parser is more powerful than $\text{LALR}$ Which of the following is ... Statement $\text{I}$ and Statement $\text{II}$ false Both Statement $\text{I}$ and Statement $\text{II}$ true

Consider the following statements:Statement $\text{I}$: $\text{LALR}$ parser is more powerful than canonical $\text{LR}$ Parser.Statement $\text{II}$: $\text{SLR}$ parser...

536 views

answered Oct 23, 2022

1 votes

5

How to do questions of ToC like finding min. No. Of states , min. No. Of substring etc ?

445 views

answered Oct 14, 2022

0 votes

6

In the network 200.10.11.144/27, the fourth octet (in decimal) of the last IP address of the network which can be assigned to a host is (A) 158 (B) 255 (C) 222 (D) 223

722 views

answered Oct 9, 2022

1 votes

7

made easy test series
How is the max possible value of n is 12? We will have to store T(0) and T(1) in stack too, so we can call f(11) at max which will require T(10) and T(9) and then we will store f(11) in stack. But if we call f(12) we wont be able to store it as overflow will occur.

How is the max possible value of n is 12? We will have to store T(0) and T(1) in stack too, so we can call f(11) at max which will require T(10) and T(9) and then we will...

587 views

answered Oct 1, 2022

0 votes

8

Subnetting/Supernetting
In class $B$ if subnet mask is $255.192.0.0$ then the total number of networks that can be joined is: $32$ $64$ $16$ None of the Above

In class $B$ if subnet mask is $255.192.0.0$ then the total number of networks that can be joined is: $32$ $64$ $16$ None of the Above

1.5k views

answered Sep 28, 2022

1 votes

9

Working Set Model
Consider a system uses working-set model for frame allocations. Working-set window size is 7. Following is sequence of virtual page references: 5, 4, 3, 3, 4, 1, 2, 2, 1, 2, 1, 1, 5, 4, 3, 5 What will be the minimum number of ... think that after executing the above sequence in the beginning the working set will contain only frame 5 so the minimum number of elements will be 1.

Consider a system uses working-set model for frame allocations. Working-set window size is 7. Following is sequence of virtual page references:5, 4, 3, 3, 4, 1, 2, 2, 1, ...

644 views

answered Sep 22, 2022

0 votes

10

CPU Scheduling
If we are using non-preemptive CPU scheduling then can there be process state transition from running to ready state?

If we are using non-preemptive CPU scheduling then can there be process state transition from running to ready state?

657 views

answered Sep 22, 2022

0 votes

11

Self Doubt.
Can anyone please explain this?

Can anyone please explain this?

777 views

answered Sep 22, 2022

2 votes

12

Binary Semaphore
Say there is a Binary semaphore R, initialized to 0. Say process X and Y are working on R. At T1 :- X has performed P(R); X gets blocked and gets added in Process Queue. At T2 :-Y has performed V(R); Will Process X get unblocked and removed from ready queue? Which process will run after Y has performed V(R)? Process Y or Process X?

Say there is a Binary semaphore R, initialized to 0. Say process X and Y are working on R.At T1 :- X has performed P(R); X gets blocked and gets added in Process Queue.At...

516 views

answered Sep 21, 2022

0 votes

13

Engineering mathematics
If A is a non-zero column matrix of order n×1 and B is a non-zero row matrix of order 1×n then rank of AB equals ? Rank(ab) can be zero???

If A is a non-zero column matrix of order n×1 and B is a non-zero row matrix of order 1×n then rank of AB equals ? Rank(ab) can be zero???

587 views

answered Sep 21, 2022

0 votes

14

University Assignment
Question → Consider a system in which bus cycles take 500 ns. Transfer of bus control in either direction, from processor to I/O device or vice-versa, takes 250 ns. One of the I/O devices has a data transfer rate of 50 KB/s and employs DMA. ... For how long would the device tie up the bus when transferring a block of 128 bytes? b)Repeat the calculation for cycle-stealing mode

Question → Consider a system in which bus cycles take 500 ns. Transfer of bus control in either direction, from processor to I/O device or vice-versa, takes 250 ns. One...

725 views

answered Sep 20, 2022

1 votes

15

Gate@Zeal Test Series 2023
Ans: 211

Ans: 211

505 views

answered Sep 19, 2022

1 votes

16

Gate At Zeal
Question → If (G,*) is a group of order 960 and there exist a in G such that a^m=e for some integer m<=960 where e is identity element of G then total number of possible value of m is___________ Answer==28

Question → If (G,*) is a group of order 960 and there exist a in G such that a^m=e for some integer m<=960 where e is identity element of G then total number of possibl...

486 views

answered Sep 17, 2022

3 votes

17

PhD Qualifier Examination, Paper I
Give a context-free grammar for the set of all strings over the alphabet {a, b} with exactly twice as many a’s as b’s. Explain the working of the grammar by characterizing the strings generated by each non-terminal.

Give a context-free grammar for the set of all strings over the alphabet {a, b} with exactly twice as many a’s as b’s. Explain the working of the grammar by character...

272 views

answered Sep 17, 2022

0 votes

18

TIFR Mathematics 2022 | Part B | Question: 19
Answer whether the following statements are True or False. There are $N$ balls in a box, out of which $n$ are blue $(1 < n < N)$ and the rest are red. Balls are drawn from the box one by one at random, and discarded. Then the ... in the first $n$ drawn is the same as the probability of picking all the red balls in the first $(N - n)$ draws.

Answer whether the following statements are True or False.There are $N$ balls in a box, out of which $n$ are blue $(1 < n < N)$ and the rest are red. Balls are drawn from...

345 views

answered Sep 10, 2022

0 votes

19

TIFR CSE 2022 | Part B | Question: 7
Consider the following grammar: $\text{P, Q, R}$ are non-terminals; $c, d$ are terminals; $\text{P}$ is the start symbol; and the production rules follow. $\mathrm{P}::=\mathrm{QR}$ $\text{Q ::= c}$ $\text{Q} ::=\text{RcR}$ ... three consecutive $c\text{'s}$ Every string produced by the grammar has at least has many $d\text{'s}$ as $c\text{'s}$

Consider the following grammar: $\text{P, Q, R}$ are non-terminals; $c, d$ are terminals; $\text{P}$ is the start symbol; and the production rules follow.$\mathrm{P}::=\m...

510 views

answered Sep 9, 2022

2 votes

20

External fragmentation, Fixed partioning
If the main memory is divided into 4 fixed sized partitions of 5KB each and each of them is occupied by processes of 4KB each can I say that the total 4KB of space unused as external fragmentation?

If the main memory is divided into 4 fixed sized partitions of 5KB each and each of them is occupied by processes of 4KB each can I say that the total 4KB of space unused...

325 views

answered Sep 3, 2022

2 votes

21

TIFR CSE 2022 | Part A | Question: 1
A snail crawls up a vertical pole $75$ feet high, starting from the ground. Each day it crawls up $5$ feet, and each night it slides down $4$ feet. When will it first reach the top of the pole? $75^{\text {th}}$ day $74^{\text {th}}$ day $73^{ \text{rd}}$ day $72^{\text {nd }}$ day $71^{\text {st }}$ day

A snail crawls up a vertical pole $75$ feet high, starting from the ground. Each day it crawls up $5$ feet, and each night it slides down $4$ feet. When will it first rea...

587 views

answered Sep 1, 2022

1 votes

22

Made easy Test Series 2022
I am getting ans 6 and given ans is 8

I am getting ans 6 and given ans is 8

527 views

answered Aug 30, 2022

1 votes

23

Operating System
On Solving manually I too getting 14 as answer. but on running more than 14 * are printed.

On Solving manually I too getting 14 as answer. but on running more than 14 * are printed.

863 views

answered Aug 29, 2022

2 votes

24

Quiz
How many runs a batsman can score in one day match (50 overs / 300 balls) with no wides, no balls, no extras and no over throws?

How many runs a batsman can score in one day match (50 overs / 300 balls) with no wides, no balls, no extras and no over throws?

521 views

answered Aug 28, 2022

0 votes

25

Divide and conquer
How To Solve This Using Divide And Conquer Suppose we are given the two n bit integers, assuming for common sense n as power of 2. It is required to multiply them using Divide & conquer method. What is the divide & conquer recurrence, that would arise for the problem. 1. T(n) = 4T(n/2) + O(1) 2. T(n) = 2T(n/2) + O(n) 3. T(n) = 4T(n/2) + O(n^2) 4. T(n) = 4T(n/2) + O(n)

How To Solve This Using Divide And ConquerSuppose we are given the two n bit integers, assuming for common sense n as power of 2. It is required to multiply them using Di...

490 views

answered Aug 28, 2022

0 votes

26

Spannig trees
For a complete graph with 10 vertices, The number of spanning trees is at least_____?

For a complete graph with 10 vertices, The number of spanning trees is at least_____?

2.4k views

answered Jul 17, 2022

0 votes

27

Counters
Is this statement true? Nonbinary counter means synchronous counter?

Is this statement true?Nonbinary counter means synchronous counter?

325 views

answered Dec 5, 2021

0 votes

28

DMA - Data Transfer Rate
A computer consists of a CPU and an I/O device D connected to main memory M via a shared bus with a data bus width of one word (16-bits). The CPU can execute a maximum of 106 instructions per second. An average instruction requires six processor cycles, three of which use the memory ... or status-checking time] ? (A) 2.15 x 106 (B) 3.15 x 106 (C) 1.15 x 106 (D) 4.15 x 106

A computer consists of a CPU and an I/O device D connected to main memory M via a shared bus with a data bus width of one word (16-bits). The CPU can execute a maximum of...

1.4k views

answered Oct 26, 2021

0 votes

29

Vectored I/O

844 views

answered Jun 3, 2021

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