Recent activity by amarVashishth / GATE Overflow for GATE CSE

3 answers

1

GATE CSE 2009 | Question: 59
Consider a binary max-heap implemented using an array. Which one of the following array represents a binary max-heap? $\left\{25,12,16,13,10,8,14\right\}$ $\left\{25,14,13,16,10,8,12\right\}$ $\left\{25,14,16,13,10,8,12\right\}$ $\left\{25,14,12,13,10,8,16\right\}$

Consider a binary max-heap implemented using an array.Which one of the following array represents a binary max-heap?$\left\{25,12,16,13,10,8,14\right\}$ $\left\{25,14,...

13.9k views

answer edited Jan 4, 2017

5 answers

2

GATE CSE 2009 | Question: 52
A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a triple $\langle c, h, s \rangle$, where $c$ is the cylinder number, $h$ is the surface number and $s$ is the sector ... $\langle 0, 16, 30 \rangle$ $\langle 0, 16, 31 \rangle$ $\langle 0, 17, 31 \rangle$

A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a triple $\langle c, h, s...

10.5k views

comment edited Jan 4, 2017

3 answers

3

GATE CSE 2008 | Question: 29
Let $X$ be a random variable following normal distribution with mean $+1$ and variance $4$. Let $Y$ be another normal variable with mean $-1$ and variance unknown. If $P (X \leq -1) = P (Y \geq 2)$ , the standard deviation of $Y$ is $3$ $2$ $\sqrt{2}$ $1$

Let $X$ be a random variable following normal distribution with mean $+1$ and variance $4$. Let $Y$ be another normal variable with mean $-1$ and variance unknown. If $P ...

23.7k views

commented Jan 4, 2017

8 answers

4

GATE CSE 2008 | Question: 63
The $P$ and $V$ operations on counting semaphores, where s is a counting semaphore, are defined as follows: $P(s):$ $s=s-1;$ If $s < 0$ then wait; $V(s):$ $s=s+1;$ If $s \leq0$ then wake up process waiting on s; Assume that $P_b$ and $V_b$ the wait ... $x_b$ and $y_b$ are respectively $0$ and $0$ $0$ and $1$ $1$ and $0$ $1$ and $1$

The $P$ and $V$ operations on counting semaphores, where s is a counting semaphore, are defined as follows:$P(s):$$s=s-1;$If $s < 0$ then wait;$V(s):$$s=s+1;$If $s \leq0$...

23.2k views

answer edited Jan 3, 2017

7 answers

5

GATE CSE 2008 | Question: 54
Which of the following are true? A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation Multi-level access link (or display) arrangement is ... activation records II and V only I, III and IV only I, II and V only II, III and V only

Which of the following are true?A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursio...

21.0k views

commented Dec 28, 2016

3 answers

6

Decomposition
Consider following set of FDs on $R(A,B,C,D,E,F)$ $A \to BCD$ $BC \to DE$ $B \to D$ $D \to A$ Compute the canonical cover. Give 3NF decomposition of $R$ based on canonical cover. Give BCNF decomposition of $R$ based on original set of FD. Can you get same decomposition of $R$ as above using canonical cover?

Consider following set of FDs on $R(A,B,C,D,E,F)$$A \to BCD$$BC \to DE$$B \to D$$D \to A$Compute the canonical cover.Give 3NF decomposition of $R$ based on canonical cove...

3.6k views

answer edited Dec 22, 2016

3 answers

7

BUGS in the Virtual Calculator for GATE 2016
There are may be BUGS in the GATE Calculator if you spot any please help other to get aware of them too. Check out the Virtual Calculator here : Your browser does not support iframes.

There are may be BUGS in the GATE Calculator if you spot any please help other to get aware of them too.Check out the Virtual Calculator here : Your browser does not supp...

1.8k views

commented Oct 16, 2016

14 answers

8

GATE CSE 2015 Set 1 | Question: 46
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of $3, 7$ and $20$ ... $T_{3}$ completes its execution at the end of_____________________milliseconds.

Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive peri...

38.3k views

commented Oct 12, 2016

1 answer

9

The average time between successive occurrences of earthquakes ?
In any given year, the probability of an earthquake greater than Magnitude 6 occurring in the Garhwal Himalayas is 0.04. The average time between successive occurrences of such earthquakes is ____ years.

In any given year, the probability of an earthquake greater than Magnitude 6 occurring in the Garhwal Himalayas is 0.04. The average time between successive occurrences o...

1.4k views

commented May 30, 2016

0 answers

10

dynamic hashing
what is dynamic hashing pl explain with some example

what is dynamic hashing pl explain with some example

389 views

commented May 14, 2016

2 answers

11

FOUR PROCESSES P1,P2,P3,P4 HAS RESOURSE R1,R2
FOUR PROCESSES P1,P2,P3,P4 HAS RESOURSE R1,R2 AS ,<4,3>,<2,4>,<3,6>,<2,8> WHAT SHOULD BE THE MINIMUM INSTANCES OF R1 AND R2 TO ENSURE THAT IT IS DEAD LOCK FREE???? CAN ANYONE EXPLAIN ME BRIEFLY HOE TO SOLVE THIS PROBLEM GIVE EXPLANATION TO U R ANSWER THE ANSWER IS <8,18>

FOUR PROCESSES P1,P2,P3,P4 HAS RESOURSE R1,R2 AS ,<4,3>,<2,4>,<3,6>,<2,8 WHAT SHOULD BE THE MINIMUM INSTANCES OF R1 AND R2 TO ENSURE THAT IT IS DEAD LOCK FREE????CAN ANY...

1.9k views

commented May 3, 2016

4 answers

12

operating systems
system call is a)hardware interrupts b)software interrupt c)exception d)none o these i feel all a,b,c :(

system call isa)hardware interruptsb)software interruptc)exceptiond)none o thesei feel all a,b,c :(

770 views

answered May 3, 2016

4 answers

13

operating systems
a system has 6 processes sharing 7 resourses if each process needs maximum 3 units then a) deadlock can never occur b)deadlock may occur c)starvation will occur d)none of these

a system has 6 processes sharing 7 resourses if each process needs maximum 3 units thena) deadlock can never occurb)deadlock may occurc)starvation will occurd)none of the...

1.6k views

answered May 3, 2016

4 answers

14

GATE CSE 2006 | Question: 79
Barrier is a synchronization construct where a set of processes synchronizes globally i.e., each process in the set arrives at the barrier and waits for all others to arrive and then all processes leave the barrier. Let the number of processes ... at the beginning of the barrier and re-enabled at the end. The variable process_left is made private instead of shared

Barrier is a synchronization construct where a set of processes synchronizes globally i.e., each process in the set arrives at the barrier and waits for all others to arr...

8.4k views

answered Apr 29, 2016

6 answers

15

GATE CSE 2006 | Question: 81
A CPU has a $32$ $KB$ direct mapped cache with $128$ byte-block size. Suppose $A$ is two dimensional array of size $512 \times512$ with elements that occupy $8-bytes$ each. Consider the following two $C$ code segments, $P1$ and $P2$. $P1$: for (i=0; i<512; i++) { for ( ... $M2$. The value of the ratio $\frac{M_{1}}{M_{2}}$: $0$ $\frac{1}{16}$ $\frac{1}{8}$ $16$

A CPU has a $32$ $KB$ direct mapped cache with $128$ byte-block size. Suppose $A$ is two dimensional array of size $512 \times512$ with elements that occupy $8-bytes$ eac...

10.5k views

answered Apr 29, 2016

5 answers

16

GATE CSE 2007 | Question: 85
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at $(i,j)$ then it can move to either $(i + 1, j)$ or $(i,j + 1)$. Suppose that the robot is not allowed to traverse the ... $^{20}\mathrm{C}_{10} - ^{8}\mathrm{C}_{4}\times ^{11}\mathrm{C}_{5}$

Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at $(i,j)$ then it can move...

9.6k views

answered Apr 29, 2016

10 answers

17

GATE CSE 2010 | Question: 53
A hash table of length $10$ uses open addressing with hash function $h(k) = k \: \mod \: 10$, and linear probing. After inserting $6$ ... of the key values using the same hash function and linear probing will result in the hash table shown above? $10$ $20$ $30$ $40$

A hash table of length $10$ uses open addressing with hash function $h(k) = k \: \mod \: 10$, and linear probing. After inserting $6$ values into an empty hash table, the...

27.3k views

answered Apr 29, 2016

4 answers

18

CN stop and wait bandwidth is 1.5 Mbps
If the bandwidth f the line is 1.5 Mbps, RTT is 45ms and packet size is 1KB, then find link utilization stop and wait protocol.

If the bandwidth f the line is 1.5 Mbps, RTT is 45ms and packet size is 1KB, then find link utilization stop and wait protocol.

11.2k views

commented Jan 25, 2016

4 answers

19

GATE CSE 2004 | Question: 80
A point is randomly selected with uniform probability in the $X-Y$ plane within the rectangle with corners at $(0,0), (1,0), (1,2)$ and $(0,2).$ If $p$ is the length of the position vector of the point, the expected value of $p^{2}$ is $\left(\dfrac{2}{3}\right)$ $\quad 1$ $\left(\dfrac{4}{3}\right)$ $\left(\dfrac{5}{3}\right)$

A point is randomly selected with uniform probability in the $X-Y$ plane within the rectangle with corners at $(0,0), (1,0), (1,2)$ and $(0,2).$ If $p$ is the length of t...

9.7k views

commented Jan 25, 2016

1 answer

20

What sub-topics do I need to study to cover Turing machines and Undecidability ?
Do I need to study basic concepts of complexity classes (P, NP , NP-Hard...reduction etc.) ?

Do I need to study basic concepts of complexity classes (P, NP , NP-Hard...reduction etc.) ?

436 views

commented Jan 21, 2016

1 answer

21

Question on shift reduce parsing
Given solution: After reducing two 1's of expression to E, E*E should be reduced not the 3rd 1. So final output will be 112*311+2 instead of the given output. Please check.

Given solution:After reducing two 1's of expression to E, E*E should be reduced not the 3rd 1. So final output will be 112*311+2 instead of the given output. Please check...

1.8k views

commented Jan 19, 2016

5 answers

22

GATE CSE 2006 | Question: 64
Consider three processes (process id $0$, $1$, $2$ respectively) with compute time bursts $2$, $4$ and $8$ time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by ... the process with the lowest process id. The average turn around time is: $13$ units $14$ units $15$ units $16$ units

Consider three processes (process id $0$, $1$, $2$ respectively) with compute time bursts $2$, $4$ and $8$ time units. All processes arrive at time zero. Consider the lon...

25.0k views

commented Jan 18, 2016

7 answers

23

GATE CSE 2006 | Question: 65
Consider three processes, all arriving at time zero, with total execution time of $10$, $20$ and $30$ units, respectively. Each process spends the first $\text{20%}$ of execution time doing I/O, the next $\text{70%}$ ... percentage of time does the CPU remain idle? $\text{0%}$ $\text{10.6%}$ $\text{30.0%}$ $\text{89.4%}$

Consider three processes, all arriving at time zero, with total execution time of $10$, $20$ and $30$ units, respectively. Each process spends the first $\text{20%}$ of e...

31.6k views

commented Jan 18, 2016

1 answer

24

Explain why incorrect?
answer = option C but why? what does with replacement mean? please verify

answer = option Cbut why?what does with replacement mean? please verify

328 views

answer selected Jan 18, 2016

4 answers

25

GATE CSE 2005 | Question: 68
A $5$ stage pipelined CPU has the following sequence of stages: IF - instruction fetch from instruction memory RD - Instruction decode and register read EX - Execute: ALU operation for data and address computation MA - Data memory access - for write access, the ... taken to complete the above sequence of instructions starting from the fetch of $I_1$? $8$ $10$ $12$ $15$

A $5$ stage pipelined CPU has the following sequence of stages:IF – instruction fetch from instruction memoryRD – Instruction decode and register readEX – Execute: ...

46.4k views

commented Jan 14, 2016

9 answers

26

GATE CSE 2005 | Question: 72
Consider the following code fragment: if (fork() == 0) { a = a + 5; printf("%d, %p n", a, &a); } else { a = a - 5; printf ("%d, %p n", a,& a); } Let $u,v$ be the values printed by the parent process and $x,y$ be the values printed by the child ... $u + 10 = x \text{ and } v = y$ $u + 10 = x \text{ and } v != y$

Consider the following code fragment: if (fork() == 0) { a = a + 5; printf("%d, %p n", a, &a); } else { a = a - 5; printf ("%d, %p n", a,& a); }Let $u,v$ be the values pr...

37.4k views

commented Jan 14, 2016

1 answer

27

MadeEasy Test Series: Digital Logic - Digital Counter
The number of Clock pulses needed to change the contents of an 8-bit-up-counter from (10101011) to (00111010) is ______________

The number of Clock pulses needed to change the contents of an 8-bit-up-counter from (10101011) to (00111010) is ______________

1.0k views

answered Jan 14, 2016

0 answers

28

DBMS Conflicts

325 views

comment edited Jan 13, 2016

6 answers

29

GATE CSE 2004 | Question: 49
A unix-style I-nodes has $10$ direct pointers and one single, one double and one triple indirect pointers. Disk block size is $1$ Kbyte, disk block address is $32$ bits, and $48$-bit integers are used. What is the maximum possible file size? $2^{24}$ bytes $2^{32}$ bytes $2^{34}$ bytes $2^{48}$ bytes

A unix-style I-nodes has $10$ direct pointers and one single, one double and one triple indirect pointers. Disk block size is $1$ Kbyte, disk block address is $32$ bits, ...

27.7k views

commented Jan 13, 2016

4 answers

30

GATE CSE 2004 | Question: 71
How many solutions does the following system of linear equations have? $-x + 5y = -1$ $x - y = 2$ $x + 3y = 3$ infinitely many two distinct solutions unique none

How many solutions does the following system of linear equations have?$-x + 5y = -1$$x - y = 2$$x + 3y = 3$infinitely manytwo distinct solutionsuniquenone

8.5k views

answered Jan 13, 2016

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