Recent activity by akshay7797 / GATE Overflow for GATE CSE

1 answer

1

GATE CSE 1999 | Question: 15
What will be the output of the following program assuming that parameter passing is call by value call by reference call by copy restore procedure P{x, y, z}; begin y:y+1; z: x+x; end; begin a:= b:= 3; P(a+b, a, a); Print(a); end

What will be the output of the following program assuming that parameter passing iscall by valuecall by referencecall by copy restoreprocedure P{x, y, z}; begin y:y+1; z:...

5.9k views

commented Jul 20, 2020

1 answer

2

GATE Overflow Test Series | Discrete Mathematics | Test 2 | Question: 30
Number of triangles that can be formed with vertices on a $3 \times 3$ grid of points is $\_\_\_\_$

Number of triangles that can be formed with vertices on a $3 \times 3$ grid of points is $\_\_\_\_$

377 views

commented Jul 17, 2020

5 answers

3

GATE IT 2008 | Question: 74
Consider the following relational schema: $\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$ ... the name of the school and the number of its students scoring $100$ in at least one exam nothing; the query has a syntax error

Consider the following relational schema:$\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$$\text{School} (\underline{\tex...

18.2k views

commented Jul 16, 2020

3 answers

4

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 Jul 14, 2020

8 answers

5

GATE CSE 1998 | Question: 1.34
Which normal form is considered adequate for normal relational database design? $2NF$ $5NF$ $4NF$ $3NF$

Which normal form is considered adequate for normal relational database design?$2NF$$5NF$$4NF$$3NF$

10.5k views

commented Jul 13, 2020

2 answers

6

GATE Overflow Test Series | Discrete Mathematics | Test 1 | Question: 2
Consider the following logical statements: $P_1:$ If it rained or one of the team did not turn up, the match would not be played. $P_2:$ The match was played. Which of the following is not a valid conclusion? It did not rain. It did not rain and no team turned up One team turned up All are valid conclusions

Consider the following logical statements:$P_1:$ If it rained or one of the team did not turn up, the match would not be played.$P_2:$ The match was played.Which of the f...

368 views

commented Jul 12, 2020

2 answers

7

GATE CSE 1995 | Question: 2.13
A unit vector perpendicular to both the vectors $a=2i-3j+k$ and $b=i+j-2k$ is: $\frac{1}{\sqrt{3}} (i+j+k)$ $\frac{1}{3} (i+j-k)$ $\frac{1}{3} (i-j-k)$ $\frac{1}{\sqrt{3}} (i+j-k)$

A unit vector perpendicular to both the vectors $a=2i-3j+k$ and $b=i+j-2k$ is:$\frac{1}{\sqrt{3}} (i+j+k)$$\frac{1}{3} (i+j-k)$$\frac{1}{3} (i-j-k)$$\frac{1}{\sqrt{3}} (i...

4.1k views

commented Jul 4, 2020

4 answers

8

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

commented Jul 3, 2020

1 answer

9

Advanced Computer Architecture , KAI HWANG | How to Find MAL from Collision Vector | Non-Linear Pipeline

Collition Vector : 1011010 MAL for the above Collition Vector is _____Please also tell me how to calculate efficiency and throughtput

14.8k views

commented Jul 1, 2020

3 answers

10

GATE CSE 2004 | Question: 65
Consider a small two-way set-associative cache memory, consisting of four blocks. For choosing the block to be replaced, use the least recently used (LRU) scheme. The number of cache misses for the following sequence of block addresses is: $8, 12, 0, 12, 8$. $2$ $3$ $4$ $5$

Consider a small two-way set-associative cache memory, consisting of four blocks. For choosing the block to be replaced, use the least recently used (LRU) scheme. The num...

15.2k views

commented Jun 25, 2020

5 answers

11

GATE CSE 1999 | Question: 5
Let $G$ be a connected, undirected graph. A cut in $G$ is a set of edges whose removal results in $G$ being broken into two or more components, which are not connected with each other. The size of a cut is called its cardinality. A min-cut of $G$ is a cut ... $n$ vertices has a min-cut of cardinality $k$, then $G$ has at least $\left(\frac{n\times k}{2}\right)$ edges.

Let $G$ be a connected, undirected graph. A cut in $G$ is a set of edges whose removal results in $G$ being broken into two or more components, which are not connected wi...

6.4k views

commented Jun 10, 2020

4 answers

12

GATE CSE 2014 Set 1 | Question: 52
An ordered $n-$tuple $(d_1, d_2,\ldots,d_n)$ with $d_1 \geq d_2 \geq \ldots \geq d_n$ is called graphic if there exists a simple undirected graph with $n$ vertices having degrees $d_1,d_2,\ldots,d_n$ respectively. Which one of the following $6$-tuples is NOT graphic? $(1,1,1,1,1,1)$ $(2,2,2,2,2,2)$ $(3,3,3,1,0,0)$ $(3,2,1,1,1,0)$

An ordered $n-$tuple $(d_1, d_2,\ldots,d_n)$ with $d_1 \geq d_2 \geq \ldots \geq d_n$ is called graphic if there exists a simple undirected graph with $n$ vertices havin...

7.5k views

commented Jun 9, 2020

3 answers

13

Variable Entered K-Map (VEM)
From the given K-map for the function F=(a,b,c,d,e), answer the following questions: In the minimized form of the function how many minterms are free from e, e’ (The term should not include any of e, e’) 2 3 1 0

From the given K-map for the function F=(a,b,c,d,e), answer the following questions: In the minimized form of the function how many minterms are free from e, e’ (The te...

4.0k views

commented Jun 5, 2020

3 answers

14

GATE CSE 1994 | Question: 1.10
Some group $(G, o)$ is known to be abelian. Then, which one of the following is true for $G$? $g=g^{-1} \text{ for every } g \in G$ $g=g^2 \text{ for every }g \in G$ $(goh)^2 = g^2oh^2 \text{ for every } g, h \in G$ $G$ is of finite order

Some group $(G, o)$ is known to be abelian. Then, which one of the following is true for $G$?$g=g^{-1} \text{ for every } g \in G$$g=g^2 \text{ for every }g \in G$$(goh)...

10.6k views

commented May 28, 2020

1 answer

15

TIFR CSE 2018 | Part B | Question: 10
For two $n$ bit strings $x,y \in\{0,1\}^{n},$ define $z=x\oplus y$ to be the bitwise XOR of the two strings (that is, if $x_{i},y_{i},z_{i}$ denote the $i^{th}$ bits of $x,y,z$ respectively, then $z_{i}=x_{i}+y_{i} \bmod 2$ ... such linear functions for $n \geq 2$ is: $2^{n}$ $2^{n^{2}}$ $\large2^{\frac{n}{2}}$ $2^{4n}$ $2^{n^{2}+n}$

For two $n$ bit strings $x,y \in\{0,1\}^{n},$ define $z=x\oplus y$ to be the bitwise XOR of the two strings (that is, if $x_{i},y_{i},z_{i}$ denote the $i^{th}$ bits of $...

1.6k views

commented May 28, 2020

3 answers

16

TIFR CSE 2012 | Part B | Question: 1
For $x, y\in \left\{0, 1\right\}^{n}$, let $x ⊕ y$ be the element of $\left\{0, 1\right\}^{n}$ obtained by the component-wise exclusive-or of $x$ and $y$. A Boolean function $F:\left\{0, 1\right\}^{n}\rightarrow\left\{0, 1\right\}$ ... $\left\{0, 1\right\}$ is. $2^{2n}$ $2^{n+1}$ $2^{n-1}+1$ $n!$ $2^{n}$

For $x, y\in \left\{0, 1\right\}^{n}$, let $x ⊕ y$ be the element of $\left\{0, 1\right\}^{n}$ obtained by the component-wise exclusive-or of $x$ and $y$. A Boolean fun...

2.2k views

commented May 26, 2020

6 answers

17

GATE CSE 2003 | Question: 39
Let $\Sigma = \left\{a, b, c, d, e\right\}$ be an alphabet. We define an encoding scheme as follows: $g(a) = 3, g(b) = 5, g(c) = 7, g(d) = 9, g(e) = 11$. Let $p_i$ denote the i-th prime number $\left(p_1 = 2\right)$ ... numbers is the encoding, $h$, of a non-empty sequence of strings? $2^73^75^7$ $2^83^85^8$ $2^93^95^9$ $2^{10}3^{10}5^{10}$

Let $\Sigma = \left\{a, b, c, d, e\right\}$ be an alphabet. We define an encoding scheme as follows:$g(a) = 3, g(b) = 5, g(c) = 7, g(d) = 9, g(e) = 11$.Let $p_i$ denote t...

7.6k views

commented May 25, 2020

3 answers

18

GATE CSE 1999 | Question: 14
Show that the formula $\left[(\sim p \vee q) \Rightarrow (q \Rightarrow p)\right]$ is not a tautology. Let $A$ be a tautology and $B$ any other formula. Prove that $(A \vee B)$ is a tautology.

Show that the formula $\left[(\sim p \vee q) \Rightarrow (q \Rightarrow p)\right]$ is not a tautology.Let $A$ be a tautology and $B$ any other formula. Prove that $(A \ve...

2.4k views

commented May 21, 2020

3 answers

19

GATE CSE 1994 | Question: 3.13
Let $p$ and $q$ be propositions. Using only the Truth Table, decide whether $p \Longleftrightarrow q$ does not imply $p \to \lnot q$ is True or False.

Let $p$ and $q$ be propositions. Using only the Truth Table, decide whether $p \Longleftrightarrow q$ does not imply $p \to \lnot q$is True or False.

7.3k views

commented May 20, 2020

1 answer

20

GATE CSE 1992 | Question: 15.a
Use Modus ponens $(A, A → B |= B)$ or resolution to show that the following set is inconsistent: $Q(x) \rightarrow P (x) \vee \sim R (a)$ $R (a) \vee \sim Q(a)$ $Q(a)$ $\sim P (y)$ where $x$ and $y$ are universally quantified variables, $a$ is a constant and $P, Q, R$ are monadic predicates.

Use Modus ponens $(A, A → B |= B)$ or resolution to show that the following set is inconsistent:$Q(x) \rightarrow P (x) \vee \sim R (a)$$R (a) \vee \sim Q(a)$$Q(a)$$\si...

3.4k views

commented May 19, 2020

4 answers

21

GATE CSE 2012 | Question: 22
Which of the following transport layer protocols is used to support electronic mail? $\textsf{SMTP}$ $\textsf{IP}$ $\textsf{TCP}$ $\textsf{UDP}$

Which of the following transport layer protocols is used to support electronic mail?$\textsf{SMTP}$$\textsf{IP}$$\textsf{TCP}$$\textsf{UDP}$

20.3k views

commented Apr 11, 2020

4 answers

22

GATE CSE 2019 | Question: 28
Consider three machines M, N, and P with IP addresses $100.10.5.2, \: 100.10.5.5$, and $100.10.5.6$ respectively. The subnet mask is set to $255.255.255.252$ for all the three machines. Which one of the following is true? M, N, and P ... subnet Only M and N belong to the same subnet Only N and P belong to the same subnet M, N, and P belong to three different subnets

Consider three machines M, N, and P with IP addresses $100.10.5.2, \: 100.10.5.5$, and $100.10.5.6$ respectively. The subnet mask is set to $255.255.255.252$ for all the ...

9.2k views

commented Apr 11, 2020

1 answer

23

GATE CSE 1995 | Question: 17a
An asynchronous serial communication controller that uses a start-stop scheme for controlling the serial I/O of a system is programmed for a string of length seven bits, one parity bit (odd parity) and one stop bit. The transmission rate is ... the complete bit stream that is transmitted for the string $ 0110101'?$ How many such string can be transmitted per second?

An asynchronous serial communication controller that uses a start-stop scheme for controlling the serial I/O of a system is programmed for a string of length seven bits, ...

2.4k views

commented Apr 9, 2020

3 answers

24

GATE CSE 2005 | Question: 26
In a network of LANs connected by bridges, packets are sent from one LAN to another through intermediate bridges. Since more than one path may exist between two LANs, packets may have to be routed through multiple bridges. Why is ... -routing? For shortest path routing between LANs For avoiding loops in the routing paths For fault tolerance For minimizing collisions

In a network of LANs connected by bridges, packets are sent from one LAN to another through intermediate bridges. Since more than one path may exist between two LANs, pac...

12.4k views

commented Apr 9, 2020

8 answers

25

GATE CSE 2005 | Question: 74
Suppose the round trip propagation delay for a $10\text{ Mbps}$ Ethernet having $48\text{-bit}$ jamming signal is $46.4\ \mu s$. The minimum frame size is: $94$ $416$ $464$ $512$

Suppose the round trip propagation delay for a $10\text{ Mbps}$ Ethernet having $48\text{-bit}$ jamming signal is $46.4\ \mu s$. The minimum frame size is:$94$$416$$464$$...

49.9k views

commented Apr 6, 2020

3 answers

26

TCP Congestion control AIMD
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 KB and the threshold at the start of first transmission is 32 KB. Assume that 3 ... transmission and 1 duplicate ACK received during 6th transmission. what is the congestion window size at the end of 10th transmission?

Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 KB and the threshol...

2.0k views

commented Apr 3, 2020

2 answers

27

NIELIT 2017 July Scientist B (CS) - Section B: 5
Following is C like Pseudo code of a function that takes a number as an argument, and uses a stack S to do processing. void fun(int n) { Stack S;//Say it creates an empty stack S while(n>0) { // This line pushes the value of ... . Prints binary representation of $n$. Prints the value of $\log n$. Prints the value of $\log n$ in reverse order.

Following is C like Pseudo code of a function that takes a number as an argument, and uses a stack S to do processing. void fun(int n) { Stack S;//Say it creates an empty...

6.5k views

answered Apr 3, 2020

8 answers

28

GATE CSE 2008 | Question: 14, ISRO2016-74
What is the maximum size of data that the application layer can pass on to the TCP layer below? Any size $2^{16}$ bytes - size of TCP header $2^{16}$ bytes $1500$ bytes

What is the maximum size of data that the application layer can pass on to the TCP layer below?Any size$2^{16}$ bytes - size of TCP header$2^{16}$ bytes$1500$ bytes

17.8k views

commented Apr 2, 2020

4 answers

29

GATE CSE 2016 Set 1 | Question: 10
A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ($n$ refers to the number of items in the queue) ? Both operations can be performed in $O(1)$ ... both operations will be $\Omega (n)$. Worst case time complexity for both operations will be $\Omega (\log n)$

A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ($n$ refers to ...

23.4k views

commented Apr 1, 2020

3 answers

30

GATE CSE 1994 | Question: 26
A queue $Q$ containing $n$ items and an empty stack $S$ are given. It is required to transfer all the items from the queue to the stack, so that the item at the front of queue is on the TOP of the stack, and the order of all other ... which can be performed on the queue and stack are Delete, Insert, Push and Pop. Do not assume any implementation of the queue or stack.

A queue $Q$ containing $n$ items and an empty stack $S$ are given. It is required to transfer all the items from the queue to the stack, so that the item at the front of ...

7.4k views

commented Apr 1, 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