Recent activity by mehul vaidya / GATE Overflow for GATE CSE

4 answers

1

GATE CSE 2010 | Question: 62
Hari(H), Gita(G), Irfan(I) and Saira(S) are siblings (i.e., brothers and sisters). All were born on $1^{\text{st}}$ January. The age difference between any two successive siblings (that is born one after another) is less than three years. Given the ... no twins. In what order they were born (oldest first)? $\text{HSIG}$ $\text{SGHI}$ $\text{IGSH}$ $\text{IHSG}$

Hari(H), Gita(G), Irfan(I) and Saira(S) are siblings (i.e., brothers and sisters). All were born on $1^{\text{st}}$ January. The age difference between any two successive...

11.4k views

commented Jan 16, 2020

8 answers

2

GATE CSE 2015 Set 2 | Question: 7
The minimum number of $\text{JK}$ flip-flops required to construct a synchronous counter with the count sequence $(0, 0, 1, 1, 2, 2, 3, 3, 0, 0, \ldots)$ is _______.

The minimum number of $\text{JK}$ flip-flops required to construct a synchronous counter with the count sequence $(0, 0, 1, 1, 2, 2, 3, 3, 0, 0, \ldots)$ is _______.

37.1k views

commented Jan 5, 2020

1 answer

3

GATE CSE 2015 Set 1 | Question: GA-8
The given statement is followed by some courses of action. Assuming the statement to be true, decide the correct option. Statement: There has been a significant drop in the water level in the lakes supplying water to the city. Course of ... areas. Statements I and II follow. Statements I and III follow. Statements II and III follow. All the statements follow.

The given statement is followed by some courses of action. Assuming the statement to be true, decide the correct option.Statement:There has been a significant drop in the...

2.1k views

commented Jan 1, 2020

12 answers

4

GATE CSE 2016 Set 2 | Question: 30
Suppose the functions $F$ and $G$ can be computed in $5$ and $3$ nanoseconds by functional units $U_{F}$ and $U_{G}$, respectively. Given two instances of $U_{F}$ and two instances of $U_{G}$, it is required to implement ... $1 \leq i \leq 10$. Ignoring all other delays, the minimum time required to complete this computation is ____________ nanoseconds.

Suppose the functions $F$ and $G$ can be computed in $5$ and $3$ nanoseconds by functional units $U_{F}$ and $U_{G}$, respectively. Given two instances of $U_{F}$ and two...

22.8k views

commented Jan 1, 2020

1 answer

5

GATE CSE 2016 Set 2 | Question: 46
A student wrote two context-free grammars G1 and G2 for generating a single C-like array declaration. The dimension of the array is at least one. For example, int a[10] [3]; The grammars use D as the start symbol, and use six ... Which of the grammars correctly generate the declaration mentioned above? Both G1 and G2 Only G1 Only G2 Neither G1 nor G2

A student wrote two context-free grammars G1 and G2 for generating a single C-like array declaration. The dimension of the array is at least one. For example,int a[10] [3...

9.1k views

commented Jan 1, 2020

7 answers

6

GATE CSE 2016 Set 2 | Question: 38
Let $A_{1}, A_{2}, A_{3}$ and $A_{4}$ be four matrices of dimensions $10 \times 5, 5 \times 20, 20 \times 10$ and $10 \times 5$, respectively. The minimum number of scalar multiplications required to find the product $A_{1}A_{2}A_{3}A_{4}$ using the basic matrix multiplication method is _________.

Let $A_{1}, A_{2}, A_{3}$ and $A_{4}$ be four matrices of dimensions $10 \times 5, 5 \times 20, 20 \times 10$ and $10 \times 5$, respectively. The minimum number of scala...

23.0k views

commented Dec 31, 2019

9 answers

7

GATE CSE 2017 Set 1 | Question: 3
Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$. Consider the set of linear equations $Ax = b$ ... has a unique solution at $x=J_{n}$ where $J_{n}$ denotes a $n$-dimensional vector of all 1. no solution infinitely many solutions finitely many solutions

Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$.Consider the set of linear equations$...

20.6k views

answer edited Dec 25, 2019

9 answers

8

GATE CSE 2019 | Question: 46
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at random. The expected value of the distance between $a$ and $b$ in $T$ (ie., the number of edges in the unique path between $a$ and $b$) is (rounded off to $2$ decimal places) _________.

Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at ...

31.0k views

commented Dec 23, 2019

3 answers

9

In Go-Back-N protocol, if the maximum window size is 127, what is the range of the sequence number?
In Go-Back-N protocol, if the maximum window size is 127, what is the range of the sequence number? A. 0 to 127 B. 0 to 128 C. 1 to 127 D. 1 to 128 Answer given is A Please explain :) Thanks.

In Go-Back-N protocol, if the maximum window size is 127, what is the range of the sequence number?A. 0 to 127 B. 0 to 128 C. 1 to 127 D. 1 to 128Answer given is APlease ...

13.8k views

commented Dec 7, 2019

2 answers

10

check the question
consider a file of 8192 records .each records is 16 bytes long and its key field is pf size 6 bytes.the file is ordered on a key field and the file organization is unspanned .the file is stored in a file system with block size 512 ... index scheme i used to store the primary index,the number of first level and second level blocks in the multilevel index are respectively_________

consider a file of 8192 records .each records is 16 bytes long and its key field is pf size 6 bytes.the file is ordered on a key field and the file organization is unspan...

6.9k views

commented Nov 20, 2019

2 answers

11

GATE CSE 1989 | Question: 1-v
The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given $n$) is ___________.

The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given $n$) is ___________.

6.6k views

comment edited Jul 19, 2019

3 answers

12

GATE CSE 2006 | Question: 55
Consider these two functions and two statements S1 and S2 about them. int work1(int *a, int i, int j) { int x = a[i+2]; a[j] = x+1; return a[i+2] - 3; } int work2(int *a, int i, int j) { int t1 = i+2; int t2 = a[t1]; a[j] = ... CPU time) of work2 compared to work1 S1 is false and S2 is false S1 is false and S2 is true S1 is true and S2 is false S1 is true and S2 is true

Consider these two functions and two statements S1 and S2 about them. int work1(int *a, int i, int j) { int x = a[i+2]; a[j] = x+1; return a[i+2] - 3; }int work2(int *a, ...

10.6k views

commented Jul 15, 2019

9 answers

13

GATE CSE 2006 | Question: 25
Let $S = \{1, 2, 3,\ldots, m\}, m >3.$ Let $X_1,\ldots,X_n$ be subsets of $S$ each of size $3.$ Define a function $f$ from $S$ to the set of natural numbers as, $f(i)$ is the number of sets $X_j$ that contain the element $i.$ That is $f(i)=\left | \left\{j \mid i\in X_j \right\} \right|$ then $ \sum_{i=1}^{m} f(i)$ is: $3m$ $3n$ $2m+1$ $2n+1$

Let $S = \{1, 2, 3,\ldots, m\}, m >3.$ Let $X_1,\ldots,X_n$ be subsets of $S$ each of size $3.$ Define a function $f$ from $S$ to the set of natural numbers as, $f(i)$ is...

11.3k views

commented Jul 14, 2019

5 answers

14

GATE CSE 2006 | Question: 3
The set $\{1,2,3,5,7,8,9\}$ under multiplication modulo $10$ is not a group. Given below are four possible reasons. Which one of them is false? It is not closed $2$ does not have an inverse $3$ does not have an inverse $8$ does not have an inverse

The set $\{1,2,3,5,7,8,9\}$ under multiplication modulo $10$ is not a group. Given below are four possible reasons. Which one of them is false?It is not closed$2$ does no...

10.0k views

commented Jul 13, 2019

11 answers

15

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.4k views

commented Jun 29, 2019

6 answers

16

GATE CSE 2003 | Question: 31
Let $(S, \leq)$ be a partial order with two minimal elements a and b, and a maximum element c. Let P: S $\to$ {True, False} be a predicate defined on S. Suppose that P(a) = True, P(b) = False and P(x) $\implies$ P(y) for all $x, y \in S$ satisfying $x \leq y$ ... for all x $\in$ S such that b ≤ x and x ≠ c P(x) = False for all x $\in$ S such that a ≤ x and b ≤ x

Let $(S, \leq)$ be a partial order with two minimal elements a and b, and a maximum element c. Let P: S $\to$ {True, False} be a predicate defined on S. Suppose that P(...

12.0k views

commented Jun 14, 2019

1 answer

17

Test by Bikram | Mock GATE | Test 4 | Question: 24
An unsorted array has this property that every element in it is at most $d$ distance from its position in the sorted version of the array (where $d$ is a positive integer smaller than the size of the array). Which among the following algorithms is best suited to sort this array? Insertion Sort Quick Sort Heap Sort Merge Sort

An unsorted array has this property that every element in it is at most $d$ distance from its position in the sorted version of the array (where $d$ is a positive integer...

624 views

commented Jun 10, 2019

1 answer

18

GATE Overflow | Mock GATE | Test 1 | Question: 38
Consider a system with paging-based memory management, whose architecture allows for a $4\text{GB}$ virtual address space for processes. The size of logical pages and physical frames is $4\text{KB}$. The system has $8\text{GB}$ physical RAM. The system allows a maximum of ... $4 \text{GB} + 4 \text{KB}$ $4 \text{MB} + 4 \text{GB}$

Consider a system with paging-based memory management, whose architecture allows for a $4\text{GB}$ virtual address space for processes. The size of logical pages and phy...

2.6k views

commented Jun 7, 2019

0 answers

19

GATE Overflow | Mock GATE | Test 1 | Question: 36
#include<stdio.h> #define create_node struct node {char x, y;}; #define call_main int main() { #define create_pointer struct node *p=&obj; #define create_object(a,b) struct node obj={b+a,a}; #define print_value printf("%c", *((char*)p+1 ... are correct Only $2$ and $3$ are correct $1$, $2$ and $4$ are correct Only $3$ is correct

#include<stdio.h>#define create_node struct node {char x, y;};#define call_main int main() {#define create_pointer struct node *p=&obj;#define create_object(a,b) struct n...

801 views

commented Jun 7, 2019

1 answer

20

Test by Bikram | Mock GATE | Test 4 | Question: 45
Consider the following code snippet: #include <stdio.h> void s1(int*, int); void s2(int*, int); void (*k[2])(int*, int); int main() { int a = 4; int b = 2; k[0] = s1; k[1] = s2; k[0](&a, b); printf("%d %d ", a, ... void s2(int *k, int q) { int tmp = *k; *k = q; q = tmp; } The output of the above program is : 4242 2222 4444 2424

Consider the following code snippet:#include <stdio.h void s1(int*, int); void s2(int*, int); void (*k )(int*, int); int main() { int a = 4; int b = 2; k[0] = s1; k = s2...

433 views

commented Jun 6, 2019

1 answer

21

Test by Bikram | Mock GATE | Test 4 | Question: 20
Consider the $5\times 5$ matrix below : $\begin{bmatrix} 1&0 &0 &0 &1 \\ 0& 1 & 1 & 1 & 0\\ 0& 1 &1 &1 &0 \\ 0& 1 &1 &1 &0 \\ 1 & 0 & 0 & 0 & 1 \end{bmatrix}$ The product of the non-zero eigenvalues of the matrix is _____.

Consider the $5\times 5$ matrix below :$\begin{bmatrix} 1&0 &0 &0 &1 \\ 0& 1 & 1 & 1 & 0\\ 0& 1 &1 &1 &0 \\ 0& 1 &1 &1 &0 \\ 1 & 0 & 0 & 0 & 1 \end{bmatrix}$The product ...

836 views

commented Jun 6, 2019

1 answer

22

Applied Course | Mock GATE | Test 1 | Question: 63
Suppose there are $4$ routers connected between two systems $S_1$ and $S_2$. $S_1$ wants to send a python file of size $8 \:KB$ to $S_2$ ... the time to transfer $1$ bit from $S_1$ to $S_2$ is $32$ sec and there is no traffic between these two systems)

Suppose there are $4$ routers connected between two systems $S_1$ and $S_2$. $S_1$ wants to send a python file of size $8 \:KB$ to $S_2$. But the data rates at each route...

684 views

commented Jun 4, 2019

1 answer

23

Applied Course | Mock GATE | Test 1 | Question: 62
Consider a $32$ bit, $10$ MIPS processor with an interrupt driven interface. Suppose a hard disk has a $16$ bit data bus and is connected to the processor and its transfer rate is $50 \:KB$ per second. ... instructions per second) $256000$ instructions per second $512000$ instructions per second $1024000$ instructions per second None of the above

Consider a $32$ bit, $10$ MIPS processor with an interrupt driven interface. Suppose a hard disk has a $16$ bit data bus and is connected to the processor and its transfe...

785 views

commented Jun 4, 2019

1 answer

24

Applied Course | Mock GATE | Test 1 | Question: 60
The left-factoring of the given CFG is $S \rightarrow aBcD \mid aBD \mid daB \mid d$ $B \rightarrow b$ $D \rightarrow d$ $S \rightarrow aBB' \mid d$ $B' \rightarrow cD \mid D$ $B \rightarrow b$ $D \rightarrow d$ ... $B' \rightarrow aB$ $B \rightarrow b$ $D \rightarrow d$ None of them

The left-factoring of the given CFG is$S \rightarrow aBcD \mid aBD \mid daB \mid d$$B \rightarrow b$$D \rightarrow d$$S \rightarrow aBB' \mid d$$B' \rightarrow cD \mid D$...

698 views

commented Jun 4, 2019

1 answer

25

Applied Course | Mock GATE | Test 1 | Question: 57
Insert the following keys in an array of size $17$ using the modulo division method. Use double hashing to resolve collisions. Take $h'(k) = (\text{key%}7)+1$ as the second hash function: $94, 37, 29, 40, 84, 88, 102, 63, 67, 120, 122$. What is the value present at location $7$ ____

Insert the following keys in an array of size $17$ using the modulo division method. Use double hashing to resolve collisions. Take $h'(k) = (\text{key%}7)+1$ as the seco...

1.4k views

commented Jun 4, 2019

2 answers

26

Applied Course | Mock GATE | Test 1 | Question: 49
How much memory is used for page tables, when there are $10$ process running in the system with the below details? Virtual Address space: $1GB$ Page size: $1KB$ Each page table entry contains a valid bit, dirty bit and the resulting frame number. And the system has a maximum of $2^{14}$ physical pages. $10$ MB $20$ MB $30$ MB None of these

How much memory is used for page tables, when there are $10$ process running in the system with the below details?Virtual Address space: $1GB$Page size: $1KB$Each page ta...

761 views

commented Jun 4, 2019

2 answers

27

Applied Course | Mock GATE | Test 1 | Question: 48
Assume the following program is compiled and run on a modern Linux machine: main() { int x = 0; int a = fork(); x++; if (a == 0) { a = fork(); x++; } else { x++; } printf("GATE!\n"); printf("x is %d ... $"x"$ may have different values on different runs of the program. $2$ $3$ $5$

Assume the following program is compiled and run on a modern Linux machine:main() { int x = 0; int a = fork(); x++; if (a == 0) { a = fork(); x++; } else { x++; } printf(...

903 views

answered Jun 3, 2019

1 answer

28

Applied Course | Mock GATE | Test 1 | Question: 44
Minimum number of states in a deterministic Finite automata that accepts the given language is ______ $L = \{ w \mid w \text{ is any string not in } a^*b^* \}$

Minimum number of states in a deterministic Finite automata that accepts the given language is ______$L = \{ w \mid w \text{ is any string not in } a^*b^* \}$

691 views

commented Jun 3, 2019

2 answers

29

Applied Course | Mock GATE | Test 1 | Question: 30
Consider the following program code, where pow() is the exponentiation function. f (int n) { if (n <= 1) return 1; return f(n-1) + g(n) + g(pow(2, n-1)); } g (int n) { if (n <= 1) return 1; return 1 + g(n/2); } What is the worst-case time complexity of $f(n)$? $O(2^n)$ $O(n^2)$ $O(2^n \log (n))$ $O( \log ^n (n))$

Consider the following program code, where pow() is the exponentiation function.f (int n) { if (n <= 1) return 1; return f(n-1) + g(n) + g(pow(2, n-1)); } g (int n) { if ...

723 views

answered Jun 2, 2019

1 answer

30

Applied Course | Mock GATE | Test 1 | Question: 29
Consider a hypothetical $8$-bit IEEE floating point representation: $\begin{array}{|l|l|l|} \hline \text{s} & \text{exp(3bits)} & \text{frac(4 bits)} \\ \hline \end{array}$ What is the largest positive denormalized value? $\frac{1}{4}$ $\frac{31}{2}$ $\frac{15}{64}$ None of the above

Consider a hypothetical $8$-bit IEEE floating point representation:$$\begin{array}{|l|l|l|} \hline \text{s} & \text{exp(3bits)} & \text{frac(4 bits)} \\ \hline \end{array...

761 views

commented Jun 2, 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