Recent activity by Divyanshum29 / GATE Overflow for GATE CSE

1 answer

1

general
hi seniors and gate rankers in the month of November aspirants of gate 2019 are now able to complete 80 to 90 % of syllabus some of them are revising , I am also at the same position but since 1 week I am losing my confidence and because of this the no of hours I was giving to gate is decreasing drastically, please suggest me how to overcome from this problem.

hi seniors and gate rankers in the month of November aspirants of gate 2019 are now able to complete 80 to 90 % of syllabus some of them are revising , I am also at the s...

972 views

commented Nov 2, 2018

0 answers

2

Computer Networks - Csma Cd
If CSMA transmits 8 stations network data in single channel whats is the chip code for station 5 {Assume that W1=[+1]} how to solve it solution given is. 1111-1-1-1-1.

If CSMA transmits 8 stations network data in single channel whats is the chip code for station 5 {Assume that W1=[+1]}how to solve itsolution given is. 1111-1-1-1-1.

286 views

asked Oct 30, 2018

1 answer

3

test series
after execution of 15p and 18 v operations semaphore value is same as execution of A. 3P C.12P&15V B.3V C. Both B&C what is the solution

after execution of 15p and 18 v operations semaphore value is same as execution of A. 3P C.12P&15VB.3V ...

491 views

asked Oct 20, 2018

7 answers

4

GATE CSE 2013 | Question: 52
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table $\text{(T1)}$ ... is $64$ bytes. What is the size of a page in $\textsf{KB}$ in this computer? $2$ $4$ $8$ $16$

A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three–level paged page table organization. The page table base register stores ...

37.7k views

commented Oct 17, 2018

1 answer

5

the operating systems by galvin
What all chapters do I need to read from the operating systems by Galvin

What all chapters do I need to read from the operating systems by Galvin

1.4k views

answered Oct 16, 2018

0 answers

6

self doubt os
Assume we are dealing with multilevel page table here Page Size is 4KB, Page table entry is 4B and the outer page table size is 256B then if the no of levels is 1 so Virtual Address is= 256 KB. but when there are 2 levels of paging then please check my procedure to ... but how to get offset?? here 6 is no of bit in outer table of second split and 10 is the no of bit in first split.

Assume we are dealing with multilevel page table here Page Size is 4KB, Page table entry is 4B and the outer page table size is 256B then if the no of levels is 1 so V...

315 views

asked Oct 15, 2018

8 answers

7

GATE CSE 2012 | Question: 44
Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and three links $(L_{1},L_{2},\text{ and } L_{3})$. $L_{1}$ connects $S$ to ... propagation delays in transmitting the file from $S$ to $D$? $\text{1005 ms}$ $\text{1010 ms}$ $\text{3000 ms}$ $\text{3003 ms}$

Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and th...

25.8k views

answered Oct 14, 2018

2 answers

8

GATE CSE 1993 | Question: 6.4, ISRO2008-14
Assume that each character code consists of $8$ bits. The number of characters that can be transmitted per second through an asynchronous serial line at $2400$ baud rate, and with two stop bits is $109$ $216$ $218$ $219$

Assume that each character code consists of $8$ bits. The number of characters that can be transmitted per second through an asynchronous serial line at $2400$ baud rate,...

10.9k views

commented Oct 14, 2018

3 answers

9

GATE IT 2007 | Question: 62
Let us consider a statistical time division multiplexing of packets. The number of sources is $10$. In a time unit, a source transmits a packet of $1000$ bits. The number of sources sending data for the first $20$ ... unit. Then the average number of backlogged of packets per time unit during the given period is $5$ $4.45$ $3.45$ $0$

Let us consider a statistical time division multiplexing of packets. The number of sources is $10$. In a time unit, a source transmits a packet of $1000$ bits. The number...

13.0k views

commented Oct 14, 2018

1 answer

10

self doubt
I have a doubt regarding the no of context switches needed in any scheduling algorithm. assume we have 5 processes, which require 4, 6, 7,5 and 1 time units and arrive at times 0, 1, 2,3, and 5 respectively. How many context switches are needed if the ... 4 I wanted to ask how SRTF work internally (as i know it will check firstly for next process arrival time then it will go ahed)

I have a doubt regarding the no of context switches needed in any scheduling algorithm. assume we have 5 processes, which require 4, 6, 7,5 and 1 time units and arrive at...

930 views

commented Oct 14, 2018

1 answer

11

GATE CSE 2016 Set 2 | Question: 47
Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remaining-time first. ... The average turn around time of these processes is ___________ milliseconds.

Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remain...

9.0k views

commented Oct 13, 2018

10 answers

12

GATE CSE 2009 | Question: 30
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be ... deadlock Only $P1$ and $P2$ will be in deadlock Only $P1$ and $P3$ will be in deadlock All three processes will be in deadlock

Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used....

34.4k views

commented Oct 11, 2018

8 answers

13

GATE IT 2005 | Question: 42
Two concurrent processes $P1$ and $P2$ use four shared resources $R1, R2, R3$ and $R4$ ... binary semaphores are used to enforce the above scheduling constraints, what is the minimum number of binary semaphores needed? $1$ $2$ $3$ $4$

Two concurrent processes $P1$ and $P2$ use four shared resources $R1, R2, R3$ and $R4$, as shown below.$$\begin{array}{|l|l|}\hline \textbf{P1} & \textbf{P2} \\ \text...

12.9k views

commented Oct 9, 2018

11 answers

14

GATE IT 2005 | Question: 41
Given below is a program which when executed spawns two concurrent processes : semaphore $X : = 0 ;$ /* Process now forks into concurrent processes $P1$ & $P2$ ... (II) are true. (I) is true but (II) is false. (II) is true but (I) is false Both (I) and (II) are false

Given below is a program which when executed spawns two concurrent processes :semaphore $X : = 0 ;$/* Process now forks into concurrent processes $P1$ & $P2$ */$\begin{ar...

24.1k views

commented Oct 9, 2018

0 answers

15

process synchronization finding deadlock
Finding Deadlock In the execution of 2 processes is slightly lengthy, we have to check for all the lines and have to preempt the process ones by one is it any short procedure to find out or we have to check one by one.

Finding Deadlock In the execution of 2 processes is slightly lengthy, we have to check for all the lines and have to preempt the process ones by one is it any short proce...

157 views

asked Oct 9, 2018

5 answers

16

GATE CSE 2001 | Question: 2.22
Consider Peterson's algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below. repeat flag[i] = true; turn = j; while (P) do no-op; Enter critical section, perform actions, then exit critical section Flag[i] = ... i flag[j] = true and turn = j flag[i] = true and turn = j flag[i] = true and turn = i

Consider Peterson's algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below.repeat flag[i] = true; turn = ...

27.2k views

commented Oct 9, 2018

6 answers

17

GATE CSE 2011 | Question: 30
Which one of the following options is CORRECT given three positive integers $x, y$ and $z$ ... always true irrespective of the value of $x$ $P(x)$ being true means that $x$ has exactly two factors other than $1$ and $x$

Which one of the following options is CORRECT given three positive integers $x, y$ and $z$, and a predicate$$P\left(x\right) = \neg \left(x=1\right)\wedge \forall y \left...

13.4k views

answered Oct 8, 2018

14 answers

18

GATE CSE 1997 | Question: 6.8
Each Process $P_i, i = 1\ldots 9$ is coded as follows repeat P(mutex) {Critical section} V(mutex) forever The code for $P_{10}$ is identical except it uses V(mutex) in place of P(mutex). What is the largest number of processes that can be inside the critical section at any moment? $1$ $2$ $3$ None

Each Process $P_i, i = 1\ldots 9$ is coded as followsrepeat P(mutex) {Critical section} V(mutex) foreverThe code for $P_{10}$ is identical except it uses V(mutex) in plac...

25.2k views

answered Oct 8, 2018

8 answers

19

GATE CSE 2012 | Question: 32
Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X$. It is used in the pseudocode shown below to implement ... take on a non-zero value when the lock is actually available works correctly but may starve some processes works correctly without starvation

Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X...

30.1k views

commented Oct 8, 2018

9 answers

20

GATE CSE 2007 | Question: 50
An array of $n$ numbers is given, where $n$ is an even number. The maximum as well as the minimum of these $n$ numbers needs to be determined. Which of the following is TRUE about the number of comparisons needed? At least $2n-c$ comparisons, for ... $c$ are needed. At most $1.5n-2$ comparisons are needed. At least $n\log_2 n$ comparisons are needed None of the above

An array of $n$ numbers is given, where $n$ is an even number. The maximum as well as the minimum of these $n$ numbers needs to be determined. Which of the following is T...

29.6k views

commented Oct 8, 2018

2 answers

21

GATE CSE 1990 | Question: 17a
Express $T(n)$ in terms of the harmonic number $\displaystyle H_{n}= \sum_{i=1}^{n} \frac{1}{i},\quad n \geq 1$, where $T(n)$ satisfies the recurrence relation, $T(n)=\frac{n+1}{n} T(n - 1)+1$, for $n \geq \sum$ and $T(1) = 1$ What is the asymptotic behaviour of $T(n)$ as a function of $n$ ?

Express $T(n)$ in terms of the harmonic number $\displaystyle H_{n}= \sum_{i=1}^{n} \frac{1}{i},\quad n \geq 1$, where $T(n)$ satisfies the recurrence relation,$T(n)=\fra...

4.2k views

commented Oct 6, 2018

1 answer

22

self DOUBT database
If R1 have 120 tuples R2 have 100 tuples and R3 have 70 tuples then R1⋈R2⋈R3 WILL BE?

If R1 have 120 tuples R2 have 100 tuples and R3 have 70 tuples then R1⋈R2⋈R3 WILL BE?

537 views

commented Oct 6, 2018

0 answers

23

self doubt dbms
Is Minimal cover of FD'S and a minimal set of FD is different things?

Is Minimal cover of FD'S and a minimal set of FD is different things?

473 views

commented Oct 6, 2018

10 answers

24

GATE CSE 2000 | Question: 2.17
Consider the following functions $f(n) = 3n^{\sqrt{n}}$ $g(n) = 2^{\sqrt{n}{\log_{2}n}}$ $h(n) = n!$ Which of the following is true? $h(n)$ is $O(f(n))$ $h(n)$ is $O(g(n))$ $g(n)$ is not $O(f(n))$ $f(n)$ is $O(g(n))$

Consider the following functions$f(n) = 3n^{\sqrt{n}}$$g(n) = 2^{\sqrt{n}{\log_{2}n}}$$h(n) = n!$Which of the following is true?$h(n)$ is $O(f(n))$$h(n)$ is $O(g(n))$$g(n...

23.0k views

answered Oct 5, 2018

3 answers

25

Find minimal cover from given functional dependencies
A -> BC CD-> E B->D E->A

A - BCCD- EB->DE->A

8.6k views

commented Oct 5, 2018

5 answers

26

GATE CSE 2007 | Question: 61
Consider the table employee(empId, name, department, salary) and the two queries $Q_1, \, Q_2$ below. Assuming that department $5$ has more than one employee, and we want to find the employees who get higher salary than anyone in the department $5,$ ... $Q_1$ and $Q_2$ produce the same answer Neither $Q_1$ nor $Q_2$ is the correct query

Consider the table employee(empId, name, department, salary) and the two queries $Q_1, \, Q_2$ below. Assuming that department $5$ has more than one employee, and we want...

26.9k views

commented Oct 2, 2018

7 answers

27

GATE CSE 2006 | Question: 68
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. Assume no null values and no foreign keys or integrity constraints. ... strictly fewer rows than Query$2$ There exist databases for which Query$4$ will encounter an integrity violation at runtime

Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. ...

20.4k views

commented Oct 1, 2018

7 answers

28

GATE IT 2005 | Question: 69
In an inventory management system implemented at a trading corporation, there are several tables designed to hold all the information. Amongst these, the following two tables hold information on which items are supplied by which suppliers, and which warehouse ... who do not supply any item supply exactly one item supply one or more items supply two or more items

In an inventory management system implemented at a trading corporation, there are several tables designed to hold all the information. Amongst these, the following two ta...

14.4k views

commented Oct 1, 2018

6 answers

29

GATE CSE 2000 | Question: 17
An array contains four occurrences of $0$, five occurrences of $1$, and three occurrences of $2$ in any order. The array is to be sorted using swap operations (elements that are swapped need to be adjacent). What is the minimum number of swaps ... ? Give an ordering of elements in the above array so that the minimum number of swaps needed to sort the array is maximum.

An array contains four occurrences of $0$, five occurrences of $1$, and three occurrences of $2$ in any order. The array is to be sorted using swap operations (elements t...

11.1k views

commented Sep 30, 2018

2 answers

30

Algorithm || Minimum comparison sorting
The lower bound on the no. of comparisons required to sort n numbers is __________ ?

The lower bound on the no. of comparisons required to sort n numbers is __________ ?

3.6k views

commented Sep 30, 2018

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