Recent activity by manish_pal_sunny / GATE Overflow for GATE CSE

2 answers

1

GATE CSE 2010 | Question: 24
A system uses FIFO policy for system replacement. It has $4$ page frames with no pages loaded to begin with. The system first accesses $100$ distinct pages in some order and then accesses the same $100$ pages but now in the reverse order. How many page faults will occur? $196$ $192$ $197$ $195$

A system uses FIFO policy for system replacement. It has $4$ page frames with no pages loaded to begin with. The system first accesses $100$ distinct pages in some order ...

12.5k views

commented Nov 17, 2020

4 answers

2

TIFR CSE 2011 | Part A | Question: 3
The probability of three consecutive heads in four tosses of a fair coin is $\left(\dfrac{1}{4}\right)$ $\left(\dfrac{1}{8}\right)$ $\left(\dfrac{1}{16}\right)$ $\left(\dfrac{3}{16}\right)$ None of the above

The probability of three consecutive heads in four tosses of a fair coin is$\left(\dfrac{1}{4}\right)$$\left(\dfrac{1}{8}\right)$$\left(\dfrac{1}{16}\right)$$\left(\dfrac...

2.8k views

answered Oct 12, 2020

2 answers

3

TIFR CSE 2010 | Part A | Question: 6
Given 10 tosses of a coin with probability of head = .$4$ = ($1$ - the probability of tail), the probability of at least one head is? $(.4)^{10}$ $1 - (.4)^{10}$ $1 - (.6)^{10}$ $(.6)^{10}$ $10(.4) (.6)^{9}$

Given 10 tosses of a coin with probability of head = .$4$ = ($1$ - the probability of tail), the probability of at least one head is?$(.4)^{10}$$1 - (.4)^{10}$$1 - (.6)^{...

2.1k views

answered Oct 12, 2020

6 answers

4

TIFR CSE 2018 | Part A | Question: 9
How many ways are there to assign colours from range $\left\{1,2,\ldots,r\right\}$ to vertices of the following graph so that adjacent vertices receive distinct colours? $r^{4}$ $r^{4} - 4r^{3}$ $r^{4}-5r^{3}+8r^{2}-4r$ $r^{4}-4r^{3}+9r^{2}-3r$ $r^{4}-5r^{3}+10r^{2}-15r$

How many ways are there to assign colours from range $\left\{1,2,\ldots,r\right\}$ to vertices of the following graph so that adjacent vertices receive distinct colours?...

4.6k views

answered Sep 25, 2020

4 answers

5

GATE IT 2008 | Question: 3
What is the chromatic number of the following graph? $2$ $3$ $4$ $5$

What is the chromatic number of the following graph? $2$$3$$4$$5$

8.4k views

answered Sep 25, 2020

3 answers

6

GATE IT 2006 | Question: 52
The following function computes the value of $\binom{m}{n}$ correctly for all legal values $m$ and $n$ ($m ≥1, n ≥ 0$ and $m > n$) int func(int m, int n) { if (E) return 1; else return(func(m -1, n) + func(m - 1, n - 1)); } In the above function, which of the following is the ... $(m = = 1)$ $(n = = 0) || (m = = n)$ $(n = = 0)$ && $(m = = n)$

The following function computes the value of $\binom{m}{n}$ correctly for all legal values $m$ and $n$ ($m ≥1, n ≥ 0$ and $m n$)int func(int m, int n) { if (E) retu...

8.3k views

commented Sep 6, 2020

5 answers

7

GATE CSE 2014 Set 1 | Question: 41
Consider the following C function in which size is the number of elements in the array E: int MyX(int *E, unsigned int size) { int Y = 0; int Z; int i, j, k; for(i = 0; i< size; i++) Y = Y + E[i]; for(i=0; i < size; ... in any sub-array of array E. sum of the maximum elements in all possible sub-arrays of array E. the sum of all the elements in the array E.

Consider the following C function in which size is the number of elements in the array E: int MyX(int *E, unsigned int size) { int Y = 0; int Z; int i, j, k; for(i = 0; i...

12.7k views

commented Sep 4, 2020

5 answers

8

GATE CSE 2015 Set 3 | Question: 39
Consider the following recursive C function. void get(int n) { if (n<1) return; get (n-1); get (n-3); printf("%d", n); } If $get(6)$ function is being called in $main()$ then how many times will the $get()$ function be invoked before returning to the $main()$? $15$ $25$ $35$ $45$

Consider the following recursive C function.void get(int n) { if (n<1) return; get (n-1); get (n-3); printf("%d", n); }If $get(6)$ function is being called in $main()$ th...

18.3k views

answered Aug 21, 2020

3 answers

9

GATE CSE 2015 Set 1 | Question: 2
Which one of the following is the recurrence equation for the worst case time complexity of the quick sort algorithm for sorting $n\;( \geq 2)$ numbers? In the recurrence equations given in the options below, $c$ is a constant. $T(n) = 2 T (n/2) + cn$ $T(n) = T ( n - 1) + T(1) + cn$ $T(n) = 2T ( n - 1) + cn$ $T(n) = T (n/2) + cn$

Which one of the following is the recurrence equation for the worst case time complexity of the quick sort algorithm for sorting $n\;( \geq 2)$ numbers? In the recurrenc...

11.6k views

answered Aug 21, 2020

5 answers

10

GATE CSE 2005 | Question: 37
Suppose $T(n) =2T (\frac{n}{2}) + n$, $T(0) = T(1) =1$ Which one of the following is FALSE? $T(n)=O(n^2)$ $T(n)=\Theta(n \log n)$ $T(n)=\Omega(n^2)$ $T(n)=O(n \log n)$

Suppose $T(n) =2T (\frac{n}{2}) + n$, $T(0) = T(1) =1$Which one of the following is FALSE?$T(n)=O(n^2)$$T(n)=\Theta(n \log n)$$T(n)=\Omega(n^2)$$T(n)=O(n \log n)$

9.8k views

answered Aug 21, 2020

5 answers

11

GATE IT 2004 | Question: 57
Consider a list of recursive algorithms and a list of recurrence relations as shown below. Each recurrence relation corresponds to exactly one algorithm and is used to derive the time complexity of the algorithm. ... $\text{P-III, Q-II, R-IV, S-I}$ $\text{P-IV, Q-II, R-I, S-III}$

Consider a list of recursive algorithms and a list of recurrence relations as shown below. Each recurrence relation corresponds to exactly one algorithm and is used to de...

6.0k views

answered Aug 21, 2020

5 answers

12

TIFR CSE 2019 | Part B | Question: 2
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ? $8$ $16$ $32$ $64$ None of the above

How many distinct minimum weight spanning trees does the following undirected, weighted graph have ?$8$$16$$32$$64$None of the above

4.6k views

answered Aug 18, 2020

4 answers

13

GATE IT 2008 | Question: 82
Consider the code fragment written in C below : void f (int n) { if (n <=1) { printf ("%d", n); } else { f (n/2); printf ("%d", n%2); } } What does f(173) print? $010110101$ $010101101$ $10110101$ $10101101$

Consider the code fragment written in C below :void f (int n) { if (n <=1) { printf ("%d", n); } else { f (n/2); printf ("%d", n%2); } }What does f(173) print?$010110101$...

9.4k views

answered Aug 17, 2020

4 answers

14

GATE CSE 2006 | Question: 50
A set $X$ can be represented by an array $x[n]$ as follows: $x\left [ i \right ]=\begin {cases} 1 & \text{if } i \in X \\ 0 & \text{otherwise} \end{cases}$ Consider the following algorithm in which $x$, $y$, and $z$ are Boolean arrays of size $n$: algorithm zzz ... set $Z$ computed by the algorithm is: $(X\cup Y)$ $(X\cap Y)$ $(X-Y)\cap (Y-X)$ $(X-Y)\cup (Y-X)$

A set $X$ can be represented by an array $x[n]$ as follows: $x\left [ i \right ]=\begin {cases} 1 & \text{if } i \in X \\ 0 & \text{otherwise} \end{cases}$Consider the ...

5.1k views

answered Aug 17, 2020

3 answers

15

GATE IT 2005 | Question: 57
What is the output printed by the following program? #include <stdio.h> int f(int n, int k) { if (n == 0) return 0; else if (n % 2) return f(n/2, 2*k) + k; else return f(n/2, 2*k) - k; } int main () { printf("%d", f(20, 1)); return 0; } $5$ $8$ $9$ $20$

What is the output printed by the following program?#include <stdio.h int f(int n, int k) { if (n == 0) return 0; else if (n % 2) return f(n/2, 2*k) + k; else return f(n/...

9.1k views

answered Aug 17, 2020

3 answers

16

GATE CSE 2004 | Question: 41
Consider the following C program main() { int x, y, m, n; scanf("%d %d", &x, &y); /* Assume x>0 and y>0*/ m = x; n = y; while(m != n) { if (m > n) m = m-n; else n = n-m; } printf(" ... $x+y$ using repeated subtraction $x \mod y$ using repeated subtraction the greatest common divisor of $x$ and $y$ the least common multiple of $x$ and $y$

Consider the following C programmain() { int x, y, m, n; scanf("%d %d", &x, &y); /* Assume x>0 and y>0*/ m = x; n = y; while(m != n) { if (m n) m = m-n; else n = n-m; } ...

8.0k views

answered Aug 17, 2020

4 answers

17

GATE CSE 2005 | Question: 84a
We are given $9$ tasks $T_1, T_2, \dots, T_9$. The execution of each task requires one unit of time. We can execute one task at a time. Each task $T_i$ has a profit $P_i$ and a deadline $d_i$. Profit $P_i$ is earned if the task is completed before ... profit? All tasks are completed $T_1$ and $T_6$ are left out $T_1$ and $T_8$ are left out $T_4$ and $T_6$ are left out

We are given $9$ tasks $T_1, T_2, \dots, T_9$. The execution of each task requires one unit of time. We can execute one task at a time. Each task $T_i$ has a profit $P_i$...

14.0k views

commented Aug 17, 2020

9 answers

18

GATE CSE 2000 | Question: 1.16
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable

Aliasing in the context of programming languages refers tomultiple variables having the same memory locationmultiple variables having the same valuemultiple variables hav...

24.9k views

commented Aug 11, 2020

4 answers

19

GATE IT 2004 | Question: 53
An array of integers of size $n$ can be converted into a heap by adjusting the heaps rooted at each internal node of the complete binary tree starting at the node $\left \lfloor (n - 1) /2 \right \rfloor$ ... to construct a heap in this manner is $O(\log n)$ $O(n)$ $O (n \log \log n)$ $O(n \log n)$

An array of integers of size $n$ can be converted into a heap by adjusting the heaps rooted at each internal node of the complete binary tree starting at the node $\left ...

10.9k views

answered Aug 9, 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