Recent activity by Rishav_Bhatt / GATE Overflow for GATE CSE

1 answer

1

GATE CSE 1989 | Question: 1-vi
Consider an excess -$50$ representation for floating point numbers with $4$ BCD digit mantissa and $2$ BCD digit exponent in normalised form. The minimum and maximum positive numbers that can be represented are __________ and _____________ respectively.

Consider an excess -$50$ representation for floating point numbers with $4$ BCD digit mantissa and $2$ BCD digit exponent in normalised form. The minimum and maximum posi...

3.9k views

comment edited Sep 13, 2020

2 answers

2

proper non empty substrings
The maximum no of proper non empty sub-strings for the given 'n' length string is: A) n*(n+1)/2 - 1 B) n*(n+1)/2 C) n*(n+1)/2 + 1 D) none of the above I basically want a good explanation here for whatever option you choose???thanks in advance . <answer given as per coaching book is B>

The maximum no of proper non empty sub-strings for the given 'n' length string is:A) n*(n+1)/2 - 1B) n*(n+1)/2C) n*(n+1)/2 + 1D) none of the aboveI ba...

2.2k views

commented Jan 15, 2020

1 answer

3

consider the following
Consider a single-level cache with an access time of 2.5 ns, a line size of 64 bytes, and a hit ratio of H 0.95. Main memory uses a block transfer capability that has a first word (4 bytes) access time of 50 ns and an access time of 5 ns ... a hit. b. Suppose that increasing the line size to 128 bytes increases the H to 0.97. Does this reduce the average memory access time?

Consider a single-level cache with an access time of 2.5 ns, a line size of 64 bytes, and a hit ratio of H 0.95. Main memory uses a block transfer capability that has a f...

8.1k views

commented Jan 15, 2020

12 answers

4

GATE CSE 2019 | Question: 29
Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for this? X sends an ARP request packet to the local gateway' ... packet with broadcast MAC address in its local subnet X sends an ARP request packet with broadcast IP address in its local subnet

Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be ...

19.5k views

commented Jan 15, 2020

7 answers

5

GATE CSE 2019 | Question: 39
Consider the following snapshot of a system running $n$ concurrent processes. Process $i$ is holding $X_i$ instances of a resource $R$, $1 \leq i \leq n$. Assume that all instances of $R$ are currently in use. Further, for all $i$, process $i$ ... $\text{Min}(X_p,X_q) \leq \text{Max} \{Y_k \mid 1 \leq k \leq n, k \neq p, k \neq q\}$

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

12.4k views

comment edited Dec 17, 2019

5 answers

6

GATE CSE 2019 | Question: 42
The index node (inode) of a Unix -like file system has $12$ direct, one single-indirect and one double-indirect pointers. The disk block size is $4$ kB, and the disk block address is $32$-bits long. The maximum possible file size is (rounded off to $1$ decimal place) ____ GB

The index node (inode) of a Unix -like file system has $12$ direct, one single-indirect and one double-indirect pointers. The disk block size is $4$ kB, and the disk bloc...

23.0k views

commented Dec 11, 2019

6 answers

7

GATE CSE 2017 Set 2 | Question: 29
In a two-level cache system, the access times of $L_1$ and $L_2$ caches are $1$ and $8$ clock cycles, respectively. The miss penalty from the $L_2$ cache to main memory is $18$ clock cycles. The miss rate of $L_1$ cache is twice that of $L_2$. The average ... respectively are $0.111$ and $0.056$ $0.056$ and $0.111$ $0.0892$ and $0.1784$ $0.1784$ and $0.0892$

In a two-level cache system, the access times of $L_1$ and $L_2$ caches are $1$ and $8$ clock cycles, respectively. The miss penalty from the $L_2$ cache to main memory i...

28.7k views

commented Dec 4, 2019

12 answers

8

GATE CSE 2005 | Question: 80
Consider the following data path of a $\text{CPU}.$ The $\text{ALU},$ the bus and all the registers in the data path are of identical size. All operations including incrementation of the $\text{PC}$ and the $\text{GPRs}$ are to be carried out in ... $2$ $3$ $4$ $5$

Consider the following data path of a $\text{CPU}.$The $\text{ALU},$ the bus and all the registers in the data path are of identical size. All operations including increm...

24.3k views

commented Dec 4, 2019

2 answers

9

MadeEasy Test Series: CO & Architecture - Instruction Format
How will this question be solved?

How will this question be solved?

995 views

commented Dec 2, 2019

11 answers

10

GATE CSE 2014 Set 2 | Question: 33
A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that order, and repeats the access sequence THRICE. Which one of ... as the optimal page replacement policy for this program? Least-recently-used First-in-first-out Last-in-first-out Most-recently-used

A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that ord...

28.8k views

commented Nov 29, 2019

2 answers

11

GATE CSE 2006 | Question: 66
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$ instances while ... $ \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 ...

16.6k views

commented Nov 22, 2019

15 answers

12

GATE CSE 2003 | Question: 78
A processor uses $2-level$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, the ... virtual address is approximately (to the nearest $0.5$ ns) $1.5$ ns $2$ ns $3$ ns $4$ ns

A processor uses $2-level$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addres...

50.1k views

commented Nov 20, 2019

3 answers

13

GATE CSE 2019 | Question: 19
Consider the grammar given below: $S \rightarrow Aa$ $A \rightarrow BD$ $B \rightarrow b \mid \epsilon $ $D \rightarrow d \mid \epsilon $ Let $a,b,d$ and $\$ be indexed as follows:$\begin{array}{|l|l|l|l|} \hline a & b & d & \$ \ ... $)$ , then the answer should be $3210$)

Consider the grammar given below:$S \rightarrow Aa$$A \rightarrow BD$$B \rightarrow b \mid \epsilon $$D \rightarrow d \mid \epsilon $Let $a,b,d$ and $\$$ be indexed as fo...

20.2k views

commented Oct 11, 2019

4 answers

14

GATE CSE 2014 Set 3 | Question: 13
Suppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checking that the vertex has not been visited earlier. Then the maximum possible recursion depth (including the initial call) is _________.

Suppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checkin...

17.2k views

commented Sep 28, 2019

5 answers

15

GATE CSE 2012 | Question: 11
Let A be the $ 2 × 2 $ matrix with elements $a_{11} = a_{12} = a_{21} = +1 $ and $ a_{22} = −1 $ . Then the eigenvalues of the matrix $A^{19}$ are $1024$ and $−1024$ $1024\sqrt{2}$ and $−1024 \sqrt{2}$ $4 \sqrt{2}$ and $−4 \sqrt{2}$ $512 \sqrt{2}$ and $−512 \sqrt{2}$

Let A be the $ 2 × 2 $ matrix with elements $a_{11} = a_{12} = a_{21} = +1 $ and $ a_{22} = −1 $ . Then the eigenvalues of the matrix $A^{19}$ are$1024$ and $−1024$$...

11.4k views

commented Sep 12, 2019

3 answers

16

GATE CSE 1998 | Question: 1.2
Consider the following set of equations $x+2y=5$ $4x+8y=12$ $3x+6y+3z=15$ This set has unique solution has no solution has finite number of solutions has infinite number of solutions

Consider the following set of equations$x+2y=5$$4x+8y=12$$3x+6y+3z=15$This sethas unique solutionhas no solutionhas finite number of solutionshas infinite number of solut...

7.2k views

commented Sep 11, 2019

7 answers

17

GATE CSE 2016 Set 2 | Question: 04
Consider the systems, each consisting of $m$ linear equations in $n$ variables. If $m < n$, then all such systems have a solution. If $m > n$, then none of these systems has a solution. If $m = n$, then there exists a system which has a solution. ... $\text{II}$ and $\text{III}$ are true. Only $\text{III}$ is true. None of them is true.

Consider the systems, each consisting of $m$ linear equations in $n$ variables.If $m < n$, then all such systems have a solution.If $m n$, then none of these systems has...

15.9k views

commented Sep 11, 2019

2 answers

18

MadeEasy Test Series 2018: Graph Theory - Graph Coloring
Consider the following graph: Which of the following will represents the chromatic number of the graph? answer given is 4. Please provide a detailed solution.

Consider the following graph: Which of the following will represents the chromatic number of the graph?answer given is 4.Please provide a detailed solution.

769 views

answered Sep 3, 2019

10 answers

19

GATE CSE 2017 Set 1 | Question: 48
Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i \right ]$ is $1$ by probing the minimum number of locations in $A$. The worst case number of probes performed by an optimal algorithm is ____________.

Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i ...

21.8k views

comment edited Aug 24, 2019

15 answers

20

GATE CSE 2007 | Question: 15, ISRO2016-26
Consider the following segment of C-code: int j, n; j = 1; while (j <= n) j = j * 2; The number of comparisons made in the execution of the loop for any $n > 0$ is: $\lceil \log_2n \rceil +1$ $n$ $\lceil \log_2n \rceil$ $\lfloor \log_2n \rfloor +1$

Consider the following segment of C-code:int j, n; j = 1; while (j <= n) j = j * 2;The number of comparisons made in the execution of the loop for any $n 0$ is:$\lceil \...

37.3k views

commented Aug 23, 2019

7 answers

21

GATE CSE 2014 Set 3 | Question: 41
Consider the pseudocode given below. The function $DoSomething()$ takes as argument a pointer to the root of an arbitrary tree represented by the $leftMostChild-rightSibling$ representation. Each node of the tree is of type $treeNode$. typedef struct ... height of the tree. number of nodes without a right sibling in the tree. number of leaf nodes in the tree

Consider the pseudocode given below. The function $DoSomething()$ takes as argument a pointer to the root of an arbitrary tree represented by the $leftMostChild-rightSibl...

19.9k views

commented Aug 19, 2019

9 answers

22

GATE CSE 2011 | Question: 29
We are given a set of $n$ distinct elements and an unlabeled binary tree with $n$ nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree? $0$ $1$ $n!$ $\frac{1} {n+1} .^{2n}C_n$

We are given a set of $n$ distinct elements and an unlabeled binary tree with $n$ nodes. In how many ways can we populate the tree with the given set so that it becomes a...

31.9k views

commented Aug 19, 2019

9 answers

23

GATE CSE 2018 | Question: 2
Consider the following C program: #include<stdio.h> struct Ournode{ char x, y, z; }; int main() { struct Ournode p={'1', '0', 'a'+2}; struct Ournode *q=&p; printf("%c, %c", *((char*)q+1), *((char*)q+2)); return 0; } The output of this program is: 0, c 0, a+2 '0', 'a+2' '0', 'c'

Consider the following C program:#include<stdio.h struct Ournode{ char x, y, z; }; int main() { struct Ournode p={'1', '0', 'a'+2}; struct Ournode *q=&p; printf("%c, %c",...

20.5k views

commented Aug 13, 2019

1 answer

24

GATE CSE 1987 | Question: 7a
List the invariant assertions at points $A, B, C, D$ and $E$ in program given below: Program division (input, output) Const dividend = 81; divisor = 9; Var remainder, quotient:interger begin (*(dividend >= 0) AND (divisor > 0)*) remainder := dividend; ... = remainder - divisor; (*C*) end; (*D*) quotient := quotient - 1; remainder := remainder + divisor; (*E*) end

List the invariant assertions at points $A, B, C, D$ and $E$ in program given below:Program division (input, output) Const dividend = 81; divisor = 9; Var remainder, quot...

2.5k views

commented Aug 13, 2019

3 answers

25

program output
char *c[] = {"GeksQuiz", "MCQ", "TEST", "QUIZ"}; char **cp[] = {c+3, c+2, c+1, c}; char ***cpp = cp; int main() { printf("%s ", **++cpp); printf("%s ", *--*++cpp+3); printf("%s ", *cpp[-2]+3); printf("%s ", cpp[-1][-1]+1); return 0; }

char *c[] = {"GeksQuiz", "MCQ", "TEST", "QUIZ"}; char cp[] = {c+3, c+2, c+1, c}; char *cpp = cp; int main() { printf("%s ", ++cpp); printf("%s ", * *++cpp+3); printf("...

4.3k views

commented Aug 8, 2019

5 answers

26

GATE IT 2008 | Question: 42
The two numbers given below are multiplied using the Booth's algorithm. Multiplicand : $0101$ $1010$ $1110$ $1110$ Multiplier: $0111$ $0111$ $1011$ $1101$ How many additions/Subtractions are required for the multiplication of the above two numbers? $6$ $8$ $10$ $12$

The two numbers given below are multiplied using the Booth's algorithm.Multiplicand : $0101$ $1010$ $1110$ $1110$Multiplier: ...

21.9k views

commented Aug 4, 2019

4 answers

27

GATE CSE 2008 | Question: 26
If $P, Q, R$ are Boolean variables, then $(P + \bar{Q}) (P.\bar{Q} + P.R) (\bar{P}.\bar{R} + \bar{Q})$ simplifies to $P.\bar{Q}$ $P.\bar{R}$ $P.\bar{Q} + R$ $P.\bar{R} + Q$

If $P, Q, R$ are Boolean variables, then$(P + \bar{Q}) (P.\bar{Q} + P.R) (\bar{P}.\bar{R} + \bar{Q})$ simplifies to$P.\bar{Q}$$P.\bar{R}$$P.\bar{Q} + R$$P.\bar{R} + Q$

10.6k views

commented Jul 27, 2019

1 answer

28

Go-schedule information
As per Gate Overflow Schedule for 2020 for the first week we have to study " Logical Reasoning and Data Interpretation: Verbal reasoning deriving conclusion from passage, conclusions as in puzzles (can be in mathematical logic also) ". So which topics are covered under this and what questions to practice from GO PDF?

As per Gate Overflow Schedule for 2020 for the first week we have to study " Logical Reasoning and Data Interpretation: Verbal reasoning deriving conclusion from passa...

484 views

commented Jun 12, 2019

5 answers

29

GATE2014 AG: GA-1
Choose the most appropriate word from the options given below to complete the following sentence. A person suffering from Alzheimer’s disease ______ short-term memory loss. Experienced Has experienced Is experiencing Experiences

Choose the most appropriate word from the options given below to complete the following sentence. A person suffering from Alzheimer’s disease ______ short-term memo...

2.8k views

commented Jun 12, 2019

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