Recent activity by smsubham / GATE Overflow for GATE CSE

5 answers

1

GATE IT 2006 | Question: 71
An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. The index of the parent of element $X[i], i \neq 0$, is? $\left \lfloor \dfrac i 2 \right \rfloor$ $\left \lceil \dfrac{i-1}{2} \right \rceil$ $\left \lceil \dfrac i 2 \right \rceil$ $\left \lceil \dfrac i 2 \right \rceil - 1$

An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. The index of the parent of element $X[...

13.7k views

commented Nov 13, 2020

4 answers

2

GATE IT 2004 | Question: 54
Which one of the following binary trees has its inorder and preorder traversals as $BCAD$ and $ABCD$, respectively?

Which one of the following binary trees has its inorder and preorder traversals as $BCAD$ and $ABCD$, respectively?

4.9k views

commented Nov 13, 2020

2 answers

3

ISI2016-MMA-9
Suppose $X$ and $Y$ are two independent random variables both following Poisson distribution with parameter $\lambda$. What is the value of $E(X-Y)^2$ ? $\lambda$ $2 \lambda$ $\lambda^2$ $4 \lambda^2$

Suppose $X$ and $Y$ are two independent random variables both following Poisson distribution with parameter $\lambda$. What is the value of $E(X-Y)^2$ ?$\lambda$$2 \lambd...

864 views

answered Jun 5, 2020

0 answers

4

Cormen Edition 3 Exercise 11.2 Question 1 (Page No. 261)
Suppose we use a hash function $h$ to hash $n$ distinct keys into an array $T$ of length $m$. Assuming simple uniform hashing, what is the expected number of collisions ? More precisely, what is the expected cardinality of $\{\{k,l\}:k\neq l and h(k)=h(l)\}$ ?

Suppose we use a hash function $h$ to hash $n$ distinct keys into an array $T$ of length $m$. Assuming simple uniform hashing, what is the expected number of collisions ?...

408 views

commented Jun 5, 2020

0 answers

5

Probability- Gravner- 79.b
A random variable $X$ has the density function $f(x)= \begin{Bmatrix} c(x+\sqrt{x}) & x\epsilon [0,1]\\ 0& otherwise \end{Bmatrix}.$ (b) Compute $\text{E(1/X)}$.

A random variable $X$ has the density function$f(x)= \begin{Bmatrix} c(x+\sqrt{x}) & x\epsilon [0,1]\\ 0& otherwise \end{Bmatrix}.$(b) Compute $\text{E(1/X)}$.

283 views

commented Jun 4, 2020

2 answers

6

Probability- Gravner- 75.a
What is the probability that a Normal random variable differs from its mean $\mu$ by more than $\sigma$ ?

What is the probability that a Normal random variable differs from its mean $\mu$ by more than $\sigma$ ?

639 views

commented Jun 4, 2020

1 answer

7

GATE ME 2018 Normal Distribution
Let X1, X2 be two independent normal random variables with means μ1, μ2 and standard deviations σ1, σ2 respectively. Consider Y =X1-X2; µ1=µ2=1, σl=1, σ2=2. Then. (a) Y is normal distributed with mean 0 and variance 1 (b) Y is normally ... Y has mean 0 and variance 5, but is NOT normally distributed (d) Y has mean 0 and variance 1, but is NOT normally distributed

Let X1, X2 be two independent normal random variables with means μ1, μ2 and standard deviations σ1, σ2 respectively. Consider Y =X1-X2; µ1=µ2=1, σl=1, σ2=2. Then....

3.8k views

commented Jun 4, 2020

2 answers

8

GATE CSE 2013 | Question: 2
Suppose $p$ is the number of cars per minute passing through a certain road junction between $5$ PM and $6$ PM, and $p$ has a Poisson distribution with mean $3$. What is the probability of observing fewer than $3$ cars during any given minute in this interval? $\dfrac{8}{(2e^{3})}$ $\dfrac{9}{(2e^{3})}$ $\dfrac{17}{(2e^{3})}$ $\dfrac{26}{(2e^{3})}$

Suppose $p$ is the number of cars per minute passing through a certain road junction between $5$ PM and $6$ PM, and $p$ has a Poisson distribution with mean $3$. What is ...

9.1k views

commented Jun 3, 2020

1 answer

9

ACE TEST SERIES QUESTION

388 views

commented Jun 3, 2020

3 answers

10

TIFR-2011-Maths-B-10
Suppose a box contains three cards, one with both sides white, one with both sides black, and one with one side white and the other side black. If you pick a card at random, and the side facing you is white, then the probability that the other side is white is $1/2$.

Suppose a box contains three cards, one with both sides white, one with both sides black, and one with one side white and the other side black. If you pick a card at rand...

873 views

commented Jun 2, 2020

4 answers

11

GATE CSE 1995 | Question: 1.15
Which scheduling policy is most suitable for a time shared operating system? Shortest Job First Round Robin First Come First Serve Elevator

Which scheduling policy is most suitable for a time shared operating system?Shortest Job FirstRound RobinFirst Come First ServeElevator

13.3k views

commented Apr 23, 2020

2 answers

12

User|Kernel threads
Assume that process A has 3 user level threads and process B has 4 kernel-level threads. Consider while process A is running in CPU, process B is waiting in ready queue. If one of the thread in A is blocked then find status of A threads and B threads? A. ... A threads are blocked and B threads are not blocked. C. All B threads are blocked and A threads are not blocked. D. None.

Assume that process A has 3 user level threads and process B has 4 kernel-level threads. Consider while process A is running in CPU, process B is waiting in ready queue. ...

1.7k views

commented Apr 23, 2020

4 answers

13

GATE CSE 2007 | Question: 83
A process, has been allocated $3$ ... above reference string, how many more page faults occur with LRU than with the optimal page replacement policy? $0$ $1$ $2$ $3$

A process, has been allocated $3$ page frames. Assume that none of the pages of the process are available in the memory initially. The process makes the following sequenc...

6.6k views

commented Apr 23, 2020

4 answers

14

GATE CSE 2009 | Question: 34
A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because It reduces the memory access time to read or write a memory location. It helps to reduce the size of ... is required by the translation lookaside buffer. It helps to reduce the number of page faults in page replacement algorithms.

A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address becauseIt reduces the memory access ti...

14.6k views

commented Apr 21, 2020

2 answers

15

AceBook
Consider the machine with 64 MB Physical Memory and a 34 bit Virtual Address Space. If the page size is 4KB, the appropriate sizes of conventional and inverted page table sizes are: a) 4M, 4K b)4K, 4M c)4M, 16K d)16K, 4M. soln: is Option C. but my ans is (7MB, 28KB)

Consider the machine with 64 MB Physical Memory and a 34 bit Virtual Address Space. If the page size is 4KB, the appropriate sizes of conventional and inverted page table...

1.7k views

answered Apr 6, 2020

1 answer

16

UGC NET CSE | June 2019 | Part 2 | Question: 47
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by page size physical size of memory the instruction set architecture number of processes in memory

The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined bypage sizephysical size of memorythe instruct...

1.9k views

commented Apr 6, 2020

2 answers

17

recurrence relation
the solution to the recurrence relation T(n)= T(n-1) +n, T(0)=2 is.. what is approach to solve it??

the solution to the recurrence relation T(n)= T(n-1) +n, T(0)=2 is..what is approach to solve it??

1.4k views

commented Apr 5, 2020

2 answers

18

NIELIT 2017 July Scientist B (CS) - Section B: 19
To make the following circuit a tautology ‘?’ marked box should be OR gate AND gate NAND gate EX-OR gate

To make the following circuit a tautology ‘?’ marked box should beOR gateAND gateNAND gateEX-OR gate

1.6k views

commented Apr 3, 2020

2 answers

19

NIELIT 2017 July Scientist B (CS) - Section B: 42
Let $G$ be a graph with $n$ vertices and $m$ edges.What is the tightest upper bound on the running time of Depth First Search of $G$, when $G$ is represented using adjacency matrix? $O(n)$ $O(m+n)$ $O(n^2)$ $O(mn)$

Let $G$ be a graph with $n$ vertices and $m$ edges.What is the tightest upper bound on the running time of Depth First Search of $G$, when $G$ is represented using adjace...

1.5k views

commented Apr 3, 2020

0 answers

20

NIELIT 2017 July Scientist B (CS) - Section B: 41
Four Matrices $M_1, M_2, M_3$ and $M_4$ of dimensions $ p \times q$, $q \times r$, $r \times s$ and $s \times t$ respectively can be multiplied in several ways with different number of total scalar multiplications. For example, when ... $t=80$, then the number of scalar multiplications needed is $248000$ $44000$ $19000$ $25000$

Four Matrices $M_1, M_2, M_3$ and $M_4$ of dimensions $ p \times q$, $q \times r$, $r \times s$ and $s \times t$ respectively can be multiplied in several ways with diffe...

970 views

commented Apr 3, 2020

3 answers

21

NIELIT 2017 July Scientist B (CS) - Section B: 40
Kadane algorithm is used to find Maximum sum subsequence in an array Maximum sum subarray in an array Maximum product subsequence in an array Maximum product subarray in an array

Kadane algorithm is used to findMaximum sum subsequence in an arrayMaximum sum subarray in an arrayMaximum product subsequence in an arrayMaximum product subarray in an a...

3.9k views

answered Apr 3, 2020

3 answers

22

NIELIT 2017 July Scientist B (CS) - Section B: 39
Which of the following standard algorithms is not Dynamic Programming based? Bellman-Ford Algorithm for single source shortest path Floyd Warshall Algorithm for all pairs shortest paths $0-1$ Knapsack problem Prim’s Minimum Spanning Tree

Which of the following standard algorithms is not Dynamic Programming based?Bellman-Ford Algorithm for single source shortest pathFloyd Warshall Algorithm for all pairs s...

6.2k views

answered Apr 3, 2020

3 answers

23

NIELIT 2017 July Scientist B (CS) - Section B: 38
A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is _________. $6$ $7$ $8$ $9$

A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks nev...

3.1k views

commented Apr 3, 2020

1 answer

24

NIELIT 2017 July Scientist B (CS) - Section B: 37
A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as follows: if(i%2==0){ if(i<n) request Ri; if(i+2<n) request Ri+2; } else ... following situations is a deadlock possible? $n=40,\: k=26$ $n=21,\:k=12$ $n=20,\:k=10$ $n=41,\:k=19$

A system has $n$ resources $R_0, \dots,R_{n-1}$, and $k$ processes $P_0, \dots, P_{k-1}$. The implementation of the resource request logic of each process $P_i$ is as fol...

969 views

commented Apr 3, 2020

1 answer

25

NIELIT 2017 July Scientist B (CS) - Section B: 36
Consider the following snapshot of a system running $n$ processes. Process $i$ is holding $X_i$ instances of a resource $R$, $ 1\leq i\leq n$. Currently, all instances of $R$ are occupied. Further, for all $i$, process $i$ has placed a request for an additional $Y_i$ ... $ \max(X_{p},X_{q})>1$ $ \min(X_{p},X_{q})>1$

Consider the following snapshot of a system running $n$ processes. Process $i$ is holding $X_i$ instances of a resource $R$, $ 1\leq i\leq n$. Currently, all instances o...

865 views

commented Apr 3, 2020

1 answer

26

NIELIT 2017 July Scientist B (CS) - Section B: 35
A disk has $200$ tracks (numbered $0$ through $199$). At a given time, it was servicing the request of reading data from track $120$, and at the previous request, service was for track $90$. The pending requests (in order of their arrival) are for track numbers. ... ) and FCFS (First Come First Serve)? $2$ and $3$ $3$ and $3$ $3$ and $4$ $4$ and $4$

A disk has $200$ tracks (numbered $0$ through $199$). At a given time, it was servicing the request of reading data from track $120$, and at the previous request, service...

875 views

commented Apr 3, 2020

0 answers

27

NIELIT 2017 July Scientist B (CS) - Section B: 34
A computer uses $46-bit$ virtual address, $32-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 ($T1$), which occupies exactly one page. Each ... that no two synonyms map to different sets in the processor cache of this computer? $2$ $4$ $8$ $16$

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

755 views

commented Apr 3, 2020

1 answer

28

NIELIT 2017 July Scientist B (CS) - Section B: 33
A computer uses $46$-bit virtual address, $32$-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 $(T1)$, which occupies exactly one page. Each entry of $T1$ stores ... is $64$ bytes. What is the size of a page in $KB$ in this computer? $2$ $4$ $8$ $16$

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

978 views

commented Apr 3, 2020

2 answers

29

NIELIT 2017 July Scientist B (CS) - Section B: 32
A CPU generates $32$-bit virtual addresses. The page size is $4$ KB. The processor has a Translation Look-aside Buffer (TLB) which can hold a total of $128$ page table entries and is $4$-way set associative. The minimum size of the TLB tag is $\text{11 bits}$ $\text{13 bits}$ $\text{15 bits}$ $\text{20 bits}$

A CPU generates $32$-bit virtual addresses. The page size is $4$ KB. The processor has a Translation Look-aside Buffer (TLB) which can hold a total of $128$ page table en...

1.2k views

commented Apr 3, 2020

3 answers

30

NIELIT 2017 July Scientist B (CS) - Section B: 25
Which access method is used for obtaining a record from cassette tape? Direct Sequential Random Parallel

Which access method is used for obtaining a record from cassette tape?DirectSequentialRandom Parallel

958 views

answered Apr 3, 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