Recent activity by val_pro20 / GATE Overflow for GATE CSE

4 answers

1

GATE CSE 2015 Set 2 | Question: GA-8
In a triangle $PQR, PS$ is the angle bisector of $\angle QPR \text{ and } \angle QPS =60^\circ$. What is the length of $PS$ ? $\left(\dfrac{(q+r)} {qr}\right)$ $\left(\dfrac {qr} {q+r}\right)$ $\large \sqrt {(q^2 + r^2)}$ $\left(\dfrac{(q+r)^2} {qr}\right)$

In a triangle $PQR, PS$ is the angle bisector of $\angle QPR \text{ and } \angle QPS =60^\circ$. What is the length of $PS$ ?$\left(\dfrac{(q+r)} {qr}\right)$$\left(\dfra...

11.1k views

commented Feb 6, 2021

4 answers

2

GATE CSE 2019 | Question: 44
Consider the following matrix: $R = \begin{bmatrix} 1 & 2 & 4 & 8 \\ 1 & 3 & 9 & 27 \\ 1 & 4 & 16 & 64 \\ 1 & 5 & 25 & 125 \end{bmatrix}$ The absolute value of the product of Eigen values of $R$ is _______

Consider the following matrix:$R = \begin{bmatrix} 1 & 2 & 4 & 8 \\ 1 & 3 & 9 & 27 \\ 1 & 4 & 16 & 64 \\ 1 & 5 & 25 & 125 \end{bmatrix}$The absolute value of the product ...

19.7k views

commented Feb 3, 2021

0 answers

3

Undecidability
Is it so that compliment of undecidable problems (not rec) in the decidability table are always not re as compliment of not rec is not re?

Is it so that compliment of undecidable problems (not rec) in the decidability table are always not re as compliment of not rec is not re?

755 views

commented Feb 2, 2021

3 answers

4

GATE CSE 2005 | Question: 45
Consider three decision problems $P_1$, $P_2$ and $P_3$. It is known that $P_1$ is decidable and $P_2$ is undecidable. Which one of the following is TRUE? $P_3$ is decidable if $P_1$ is reducible to $P_3$ $P_3$ is undecidable if $P_3$ is reducible ... $P_3$ is undecidable if $P_2$ is reducible to $P_3$ $P_3$ is decidable if $P_3$ is reducible to $P_2$'s complement

Consider three decision problems $P_1$, $P_2$ and $P_3$. It is known that $P_1$ is decidable and $P_2$ is undecidable. Which one of the following is TRUE?$P_3$ is decidab...

12.2k views

commented Feb 2, 2021

2 answers

5

GATE CSE 1996 | Question: 1.9
Which of the following statements is false? The Halting Problem of Turing machines is undecidable Determining whether a context-free grammar is ambiguous is undecidable Given two arbitrary context-free grammars $G_1$ and $G_2$ it is undecidable whether $L(G_1) = L(G_2)$ Given two regular grammars $G_1$ and $G_2$ it is undecidable whether $L(G_1) = L(G_2)$

Which of the following statements is false?The Halting Problem of Turing machines is undecidableDetermining whether a context-free grammar is ambiguous is undecidableGive...

8.1k views

commented Feb 2, 2021

1 answer

6

Lattice

3.3k views

commented Feb 1, 2021

1 answer

7

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 4
Which of the following statements is FALSE? In a SLR(1) parser, it is allowable for both shift and reduce items to be in the same state In a SLR(1) parser, it is allowable for multiple reduce items to be in the same state All SLR(1) grammars are LR(0) All LR(0) grammars are SLR(1)

Which of the following statements is FALSE?In a SLR(1) parser, it is allowable for both shift and reduce items to be in the same stateIn a SLR(1) parser, it is allowable ...

3.5k views

commented Feb 1, 2021

3 answers

8

NIELIT 2017 DEC Scientific Assistant A - Section B: 56
In a particular system it is observed that, the cache performance gets improved as a result of increasing the block size of the cache. The primary reason behind this is : Programs exhibits temporal locality Programs have small working set Read operation is frequently required rather than write operation Programs exhibits spatial locality

In a particular system it is observed that, the cache performance gets improved as a result of increasing the block size of the cache. The primary reason behind this is :...

2.0k views

commented Jan 28, 2021

3 answers

9

GATE IT 2005 | Question: 82a
A database table $T_1$ has $2000$ records and occupies $80$ disk blocks. Another table $T_2$ has $400$ records and occupies $20$ disk blocks. These two tables have to be joined as per a specified join condition that needs to be evaluated for every ... to be used in outer loop, the number of block accesses required for reading the data are $800000$ $40080$ $32020$ $100$

A database table $T_1$ has $2000$ records and occupies $80$ disk blocks. Another table $T_2$ has $400$ records and occupies $20$ disk blocks. These two tables have to be ...

8.7k views

commented Jan 28, 2021

1 answer

10

Test by Bikram | Computer Networks | Test 1 | Question: 3
Let the source has sent four TCP segments to Destination with the sequence numbers $50, \ 74, \ 97,\ 120$ ($1$st, $2$nd, $3$rd and $4$th segment) if the first and fourth segments arrive at destination successfully then the negative acknowledgement that destination sends to source is _______

Let the source has sent four TCP segments to Destination with the sequence numbers $50, \ 74, \ 97,\ 120$ ($1$st, $2$nd, $3$rd and $4$th segment) if the first and fourth ...

702 views

commented Jan 27, 2021

11 answers

11

GATE CSE 2015 Set 3 | Question: 36
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a packet $35$ microseconds after it receives the same. If $10000$ bits of ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______.

Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a pack...

33.1k views

commented Jan 26, 2021

2 answers

12

GATE IT 2004 | Question: 1
In a population of $N$ families, $50 \%$ of the families have three children, $30 \%$ of the families have two children and the remaining families have one child. What is the probability that a randomly picked child belongs to a family with two children? $\left(\dfrac{3}{23}\right)$ $\left(\dfrac{6}{23}\right)$ $\left(\dfrac{3}{10}\right)$ $\left(\dfrac{3}{5}\right)$

In a population of $N$ families, $50 \%$ of the families have three children, $30 \%$ of the families have two children and the remaining families have one child. What is...

10.6k views

commented Jan 24, 2021

8 answers

13

GATE CSE 2004 | Question: 57
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ $bytes$ of application data to a host $H_C$ in network $C$. The TCP layer prefixes $20$ byte header to the message. This passes through an intermediate network $B$ ... overheads. $325.5$ $\text{Kbps}$ $354.5$ $\text{Kbps}$ $409.6$ $\text{Kbps}$ $512.0$ $\text{Kbps}$

Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ $bytes$ of application data to a host $H_C$ in network $C$. The ...

19.1k views

commented Jan 23, 2021

6 answers

14

GATE IT 2008 | Question: 64
A $1\;\text{Mbps}$ satellite link connects two ground stations. The altitude of the satellite is $36,504\;\text{km}$ and speed of the signal is $3 \times 10^{8}\;\text{m/s}.$ What should be the packet size for a channel utilization of $25\%$ for ... there are no errors during communication. $120\;\text{bytes}$ $60\;\text{bytes}$ $240\;\text{bytes}$ $90\;\text{bytes}$

A $1\;\text{Mbps}$ satellite link connects two ground stations. The altitude of the satellite is $36,504\;\text{km}$ and speed of the signal is $3 \times 10^{8}\;\text{m/...

24.9k views

commented Jan 16, 2021

7 answers

15

GATE IT 2008 | Question: 4
What is the size of the smallest $\textsf{MIS}$ (Maximal Independent Set) of a chain of nine nodes? $5$ $4$ $3$ $2$

What is the size of the smallest $\textsf{MIS}$ (Maximal Independent Set) of a chain of nine nodes?$5$$4$$3$$2$

59.1k views

commented Jan 16, 2021

1 answer

16

Test by Bikram | Mock GATE | Test 1 | Question: 46
Assume there are n transactions $T^{1}$., $T^{2}$., .... ,$T^{n}$. Every transaction Writes a value of variable $X$ and then it is read by its successive transaction, like, $T^{1}$ writes a value of $X$ that is read by $T^{2}$ ... of transaction rollbacks are required to recover the schedule is ? $0$ $\left ( n \right )$ $1$ $\left ( n-1 \right )$

Assume there are n transactions $T^{1}$., $T^{2}$., .... ,$T^{n}$.Every transaction Writes a value of variable $X$ and then it is read by its successive transaction, l...

1.3k views

commented Jan 11, 2021

8 answers

17

GATE CSE 2015 Set 3 | Question: 7
Consider the following C program segment. # include <stdio.h> int main() { char s1[7] = "1234", *p; p = s1 + 2; *p = '0'; printf("%s", s1); } What will be printed by the program? $12$ $120400$ $1204$ $1034$

Consider the following C program segment.# include <stdio.h int main() { char s1[7] = "1234", *p; p = s1 + 2; *p = '0'; printf("%s", s1); }What will be printed by the pro...

16.3k views

answered Jan 9, 2021

2 answers

18

Maximum and Minimum number in 16 bit Floating Point
16 bit Floating Point Representation $(-1)^{sign}*(1.M)*2^{Exp - 63}$ Sign = 1 bit Exponent = 7 bit Mantissa = 8 bit 1) Max positive number 2) Min positive number. 3) Max negative number. 4) Min negative number. 5) What is meant by precision.

16 bit Floating Point Representation$(-1)^{sign}*(1.M)*2^{Exp - 63}$Sign = 1 bitExponent = 7 bitMantissa = 8 bit1) Max positive number2) Min positive number.3) Max negati...

4.0k views

commented Jan 8, 2021

1 answer

19

Test by Bikram | Databases | Test 1 | Question: 11
Consider the following database schedule with $3$ transactions, $T1$ ,$T2$ and $T3$. Where $r$ ... following statements about the above schedule is TRUE? the schedule is serializable the schedule is not serializable schedule will not execute this schedule have deadlock

Consider the following database schedule with $3$ transactions, $T1$ ,$T2$ and $T3$. Where $r$ stands for READ, w for WRITE.$S : r2 (A); r1 (B); w2 (A); r2 (B); r3 (A); w...

445 views

commented Jan 8, 2021

1 answer

20

Computing the dual of the boolean function
Suppose, $f(A,B,C,D) = \sum m(0,2,4,6)$ is a boolean expression, expressed in minterm form. How can I calculate and express the dual of the function? I have tried the method using the exact definition, but it turns out to be very cumbersome and prone to errors. Any other method?

Suppose, $f(A,B,C,D) = \sum m(0,2,4,6)$ is a boolean expression, expressed in minterm form. How can I calculate and express the dual of the function?I have tried the meth...

6.8k views

commented Jan 3, 2021

6 answers

21

GATE CSE 2000 | Question: 1.15
Let $S$ be a sorted array of $n$ integers. Let $T(n)$ denote the time taken for the most efficient algorithm to determined if there are two elements with sum less than $1000$ in $S$. Which of the following statement is true? $T (n)$ is $O(1)$ $n \leq T(n) \leq n \log_2 n$ $n \log_2 n ≤ T(n) < \frac{n}{2}$ $T(n) = \left (\frac{n}{2} \right)$

Let $S$ be a sorted array of $n$ integers. Let $T(n)$ denote the time taken for the most efficient algorithm to determined if there are two elements with sum less than $1...

16.1k views

commented Jan 2, 2021

5 answers

22

GATE CSE 2006 | Question: 18
We are given a set $X = \{X_1,\ldots,X_n\}$ where $X_i=2^i$. A sample $S\subseteq X$ is drawn by selecting each $X_i$ independently with probability $P_i = \frac{1}{2}$ . The expected value of the smallest number in sample $S$ is: $\left(\frac{1}{n}\right)$ $2$ $\sqrt n$ $n$

We are given a set $X = \{X_1,\ldots,X_n\}$ where $X_i=2^i$. A sample $S\subseteq X$ is drawn by selecting each $X_i$ independently with probability $P_i = \frac{1}{2...

16.1k views

commented Dec 31, 2020

11 answers

23

GATE IT 2006 | Question: 9
In a binary tree, the number of internal nodes of degree $1$ is $5$, and the number of internal nodes of degree $2$ is $10$. The number of leaf nodes in the binary tree is $10$ $11$ $12$ $15$

In a binary tree, the number of internal nodes of degree $1$ is $5$, and the number of internal nodes of degree $2$ is $10$. The number of leaf nodes in the binary tree i...

26.2k views

commented Dec 28, 2020

4 answers

24

GATE CSE 2013 | Question: 46
A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). The number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM from 1K × 8 RAM is (A) 4 (B) 5 (C) 6 (D) 7

A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). The number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM from 1K × 8 RAM is(A...

27.8k views

commented Dec 27, 2020

2 answers

25

GATE CSE 2013 | Question: 42
What is the return value of $f(p,p)$, if the value of $p$ is initialized to $5$ before the call? Note that the first parameter is passed by reference, whereas the second parameter is passed by value. int f (int &x, int c) { c = c - 1; if (c==0) return 1; x = x + 1; return f(x,c) * x; }

What is the return value of $f(p,p)$, if the value of $p$ is initialized to $5$ before the call? Note that the first parameter is passed by reference, whereas the second ...

21.2k views

commented Dec 27, 2020

4 answers

26

GATE CSE 2015 Set 3 | Question: GA-10
The exports and imports (in crores of $Rs$.) of a country from the year $2000$ to $2007$ are given in the following bar chart. In which year is the combined percentage increase in imports and exports the highest?

The exports and imports (in crores of $Rs$.) of a country from the year $2000$ to $2007$ are given in the following bar chart. In which year is the combined percentage in...

5.7k views

commented Dec 26, 2020

5 answers

27

GATE CSE 2016 Set 1 | Question: GA06
A shaving set company sells $4$ different types of razors- Elegance, Smooth, Soft and Executive. Elegance sells at $\text{Rs.} \ 48$, Smooth at $\text{Rs.} \ 63$, Soft at $\text{Rs.} \ 78$ ... Which product contributes the greatest fraction to the revenue of the company in that year? Elegance Executive Smooth Soft

A shaving set company sells $4$ different types of razors- Elegance, Smooth, Soft and Executive.Elegance sells at $\text{Rs.} \ 48$, Smooth at $\text{Rs.} \ 63$, Soft at ...

5.4k views

commented Dec 26, 2020

2 answers

28

Test by Bikram | Operating Systems | Test 2 | Question: 9
Assume that pages are $128$ words in size. Consider below code snippet whose function is to initialize to $0$ each element of a $128$ - by - $128$ array. Then number of page faults generated by the following Code snippet is: Assume the array is stored row major ... j++) for( int i=0; i<128; i++) A[i][j] = 0; $128$ $16384$ $0$ $16378$

Assume that pages are $128$ words in size. Consider below code snippet whose function is to initialize to $0$ each element of a $128$ – by – $128$ array. Then number ...

729 views

commented Dec 26, 2020

5 answers

29

GATE IT 2007 | Question: 56
Synchronization in the classical readers and writers problem can be achieved through use of semaphores. In the following incomplete code for readers-writers problem, two binary semaphores mutex and wrt are used to obtain synchronization wait (wrt) writing is performed signal ... mutex), wait (mutex), signal (wrt) signal (mutex), wait (mutex), signal (mutex), wait (mutex)

Synchronization in the classical readers and writers problem can be achieved through use of semaphores. In the following incomplete code for readers-writers problem, two ...

10.5k views

commented Dec 24, 2020

8 answers

30

GATE CSE 1996 | Question: 1.1
Let $A$ and $B$ be sets and let $A^c$ and $B^c$ denote the complements of the sets $A$ and $B$. The set $(A-B) \cup (B-A) \cup (A \cap B)$ is equal to $A \cup B$ $A^c \cup B^c$ $A \cap B$ $A^c \cap B^c$

Let $A$ and $B$ be sets and let $A^c$ and $B^c$ denote the complements of the sets $A$ and $B$. The set $(A-B) \cup (B-A) \cup (A \cap B)$ is equal to$A \cup B$$A^c \cup ...

6.1k views

commented Dec 23, 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