Recent activity by vupadhayayx86 / GATE Overflow for GATE CSE

9 answers

1

GATE CSE 2016 Set 1 | Question: 38
Consider the weighted undirected graph with $4$ vertices, where the weight of edge $\{i,j\}$ is given by the entry $W_{ij}$ in the matrix $W$ ... integer value of $x$, for which at least one shortest path between some pair of vertices will contain the edge with weight $x$ is ___________.

Consider the weighted undirected graph with $4$ vertices, where the weight of edge $\{i,j\}$ is given by the entry $W_{ij}$ in the matrix $W$. W=$\begin{bmatrix} 0&2 &8 &...

24.0k views

commented Jan 28, 2020

6 answers

2

GATE CSE 2003 | Question: 79
A processor uses $\text{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, ... tables of this process is $\text{8 KB}$ $\text{12 KB}$ $\text{16 KB}$ $\text{20 KB}$

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

23.9k views

commented Dec 25, 2019

2 answers

3

Made Easy test series DS
Consider a binary tree where for every node ⏐P – Q⏐ ≤ 2. P represents number of nodes in left sub tree for node S and Q represents the number of nodes in right sub tree for node S for h > 0. The minimum number of nodes present in such binary tree of height h = 4 _________. (Assume root is at height 0)

Consider a binary tree where for every node ⏐P – Q⏐ ≤ 2. P represents number of nodes in left sub tree for node S and Q represents the number of nodes in right su...

2.5k views

commented Dec 24, 2019

2 answers

4

minimum relation which satisfy 1nf
the number of minimum relation which satisfy1 nf (partial participation between E1 and R should not lost in RDBMS design )

the number of minimum relation which satisfy1 nf (partial participation between E1 and R should not lost in RDBMS design )

1.0k views

commented Dec 18, 2019

1 answer

5

madeeasytestseries
Consider the following segment: int count = 0; void tally( ) { for(int i=1;i<=5;i++) count=count+1; } main() { parbegin tally(); tally(); parend } Note: Assume the count = count + 1; will execute in 3' different instructions. ... can occur while executing the above instructions. After completion of both functions of tally( ), The minimum final values of count is.....?

Consider the following segment:int count = 0;void tally( ){for(int i=1;i<=5;i++)count=count+1;}main(){parbegintally();tally();parend} Note: Assume the count = count + 1�...

1.0k views

commented Dec 14, 2019

1 answer

6

what is minimum num of 2:1 MUX needs to implement half subtractor

8.5k views

commented Dec 3, 2019

0 answers

7

MadeEasy Subject Test 2019: Algorithms - Dynamic Programming
Let G = (V,E) be a directed graph.Each edge of G is represented as (i,j) with length l[i,j].If there is no edge from i to j then l[i,j] = (IMAGE ATTACHED)

Let G = (V,E) be a directed graph.Each edge of G is represented as (i,j) with length l[i,j].If there is no edge from i to j then l[i,j] = (IMAGE ATTACHED)

533 views

commented Nov 30, 2019

1 answer

8

Test by Bikram | Computer Networks | Test 1 | Question: 22
A TCP connection is transferring $6000$ bytes where the first byte is numbered $10010.$ If data is sent in five segments with the first four segments carrying $1000$ bytes and the last segment carrying $2000$ bytes then number of the last byte sent is ______

A TCP connection is transferring $6000$ bytes where the first byte is numbered $10010.$ If data is sent in five segments with the first four segments carrying $1000$ byte...

731 views

commented Nov 13, 2019

0 answers

9

To test if the given language is regular.
There are two sources on YouTube giving different answers for the same expression.I am confused. Is the given expressions wxwr | w,x $\in$(0,1)+ I think this is regular because this can be reduced to ending with 00 or 01 or 10 or 11 wwrx | w,x $\in$(0,1)+ I think this is regular because it can reduced to starting with 0 or 1

There are two sources on YouTube giving different answers for the same expression.I am confused.Is the given expressionswxwr | w,x $\in$(0,1)+ I think this is regular b...

731 views

commented Nov 13, 2019

1 answer

10

Test by Bikram | Theory of Computation | Test 2 | Question: 15
Which of the following languages is regular? $L = \{ bba (ba)^* a^{n-1} \mid n> 0 \}$ $L = \{a^nb^n \mid n < 1000 \}$ $L = \{a^nb^k \mid \text{ n is odd or k is even} \}$ $L = \{ wxw^R \mid w,x \in (0+1)^* \}$ $1$, $3$ and $4$ $2, 3, 4$ $2, 3$ $1, 2, 3, 4$

Which of the following languages is regular?$L = \{ bba (ba)^* a^{n-1} \mid n 0 \}$$L = \{a^nb^n \mid n < 1000 \}$$L = \{a^nb^k \mid \text{ n is odd or k is even} \}$$L ...

446 views

commented Nov 13, 2019

1 answer

11

ICMP Messages doubt ?
Please explain these points : No ICMP error message will be generated for a fragmented datagram that is not the first fragment . No ICMP error message will be generated for a datagram having a multicast address . No ICMP error message will be generated for a datagram having a special address such as 127.0.0.0

Please explain these points :No ICMP error message will be generated for a fragmented datagram that is not the first fragment .No ICMP error message will be generated for...

4.1k views

commented Nov 7, 2019

1 answer

12

MadeEasy Test Series: Computer Networks - Flow Control Methods
Assume 100 nodes are connected to a 10000 meter length of coaxial cable. Using some protocol, each node can transmit 100 frames/seconds, where the average frame length is 2500 bits. The transmission rate of the system is 108 bps. The efficiency of the protocol in percentage is _______. Answer given :: 25

Assume 100 nodes are connected to a 10000 meter length of coaxial cable. Using some protocol, each node can transmit 100 frames/seconds, where the average frame length is...

2.1k views

commented Nov 6, 2019

1 answer

13

Ace Test Series: DBMS - Canonical Cover In FD

2.4k views

commented Nov 6, 2019

1 answer

14

Test series
An organization is granted the block 172.89.0.0/16. The administrator wants to create 1024 subnets using 10 bits. The first and last addresses of any host in subnet 1024 respectively are

An organization is granted the block 172.89.0.0/16. The administrator wants to create 1024 subnets using 10 bits. The first and last addresses of any host in subnet 1024 ...

1.2k views

commented Nov 5, 2019

9 answers

15

GATE CSE 2012 | Question: 34, ISRO-DEC2017-32
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: $245.248.128.0/20$. The ISP wants to give half of this chunk of addresses to Organization $A$, and a quarter to Organization $B$, while retaining the remaining ... $245.248.136.0/24 \text{ and } 245.248.132.0/21$

An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: $245.248.128.0/20$. The ISP wants to give half of this chunk of a...

30.2k views

commented Nov 5, 2019

5 answers

16

GATE CSE 2015 Set 2 | Question: 46
Consider a simple checkpointing protocol and the following set of operations in the log. (start, T4); (write, T4, y, 2, 3); (start, T1); (commit, T4); (write, T1, z, 5, 7); (checkpoint); (start, T2); (write, T2, x, 1, 9); (commit, T2); (start, T3); ( ... Undo: T3, T1; Redo: T2 Undo: T3, T1; Redo: T2, T4 Undo: none; Redo: T2, T4, T3, T1 Undo: T3, T1, T4; Redo: T2

Consider a simple checkpointing protocol and the following set of operations in the log.(start, T4); (write, T4, y, 2, 3); (start, T1); (commit, T4); (write, T1, z, 5, 7)...

24.8k views

commented Nov 2, 2019

6 answers

17

GATE CSE 2000 | Question: 17
An array contains four occurrences of $0$, five occurrences of $1$, and three occurrences of $2$ in any order. The array is to be sorted using swap operations (elements that are swapped need to be adjacent). What is the minimum number of swaps ... ? Give an ordering of elements in the above array so that the minimum number of swaps needed to sort the array is maximum.

An array contains four occurrences of $0$, five occurrences of $1$, and three occurrences of $2$ in any order. The array is to be sorted using swap operations (elements t...

11.0k views

commented Oct 13, 2019

4 answers

18

GATE Overflow | Data Structures | Test 1 | Question: 8
What is the number of binary trees with $4$ nodes which when traversed in pre-order gives the sequence A, B, C, D?

What is the number of binary trees with $4$ nodes which when traversed in pre-order gives the sequence A, B, C, D?

815 views

commented Oct 10, 2019

5 answers

19

GATE CSE 2016 Set 2 | Question: 34
A complete binary min-heap is made by including each integer in $[1, 1023]$ exactly once. The depth of a node in the heap is the length of the path from the root of the heap to that node. Thus, the root is at depth $0$. The maximum depth at which integer $9$ can appear is _________.

A complete binary min-heap is made by including each integer in $[1, 1023]$ exactly once. The depth of a node in the heap is the length of the path from the root of the h...

25.9k views

commented Oct 8, 2019

3 answers

20

GATE CSE 1993 | Question: 18
Show that proposition $C$ is a logical consequence of the formula$A\wedge \left(A \to \left(B \vee C\right)\right) \wedge \left( B \to \neg A\right)$using truth tables.

Show that proposition $C$ is a logical consequence of the formula$$A\wedge \left(A \to \left(B \vee C\right)\right) \wedge \left( B \to \neg A\right)$$using truth tables....

3.2k views

commented Oct 8, 2019

7 answers

21

GATE CSE 1989 | Question: 3-v
Which of the following well-formed formulas are equivalent? $P \rightarrow Q$ $\neg Q \rightarrow \neg P$ $\neg P \vee Q$ $\neg Q \rightarrow P$

Which of the following well-formed formulas are equivalent?$P \rightarrow Q$$\neg Q \rightarrow \neg P$$\neg P \vee Q$$\neg Q \rightarrow P$

3.7k views

answered Oct 8, 2019

4 answers

22

GATE CSE 2012 | Question: 49
Consider the following C code segment. int a, b, c = 0; void prtFun(void); main() { static int a = 1; /* Line 1 */ prtFun(); a += 1; prtFun(); printf( \n %d %d , a, b); } void prtFun(void) { static int a = 2; /* Line 2 */ int b = 1; a += ++b ... $\begin{array}{ll} \text{4} & \text{2} \\ \text{4} & \text{2} \\ \text{2} & \text{0} \\ \end{array}$

Consider the following C code segment.int a, b, c = 0; void prtFun(void); main() { static int a = 1; /* Line 1 */ prtFun(); a += 1; prtFun(); printf(“ \n %d %d ”, a, ...

10.1k views

commented Oct 7, 2019

5 answers

23

GATE CSE 1993 | Question: 6.7
A certain moving arm disk storage, with one head, has the following specifications: Number of tracks/recording surface $= 200$ Disk rotation speed $= 2400$ rpm Track storage capacity $= 62,500$ bits The average latency of this device is $\text{P}$ ms and the data transfer rate is $\text{Q}$ bits/sec. Write the values of $\text{P}$ and $\text{Q}$.

A certain moving arm disk storage, with one head, has the following specifications:Number of tracks/recording surface $= 200$Disk rotation speed $= 2400$ rpmTrack storage...

20.3k views

commented Sep 8, 2019

4 answers

24

GATE CSE 2008 | Question: 5
In the Karnaugh map shown below, $X$ denotes a don’t care term. What is the minimal form of the function represented by the Karnaugh map? $\bar{b}.\bar{d} + \bar{a}.\bar{d}$ $\bar{a}.\bar{b} + \bar{b}.\bar{d} + \bar{a}.b.\bar{d}$ $\bar{b}.\bar{d} + \bar{a}.b.\bar{d}$ $\bar{a}.\bar{b} + \bar{b}.\bar{d} + \bar{a}.\bar{d}$

In the Karnaugh map shown below, $X$ denotes a don’t care term. What is the minimal form of the function represented by the Karnaugh map?$\bar{b}.\bar{d} + \bar{a}.\bar...

7.1k views

commented Jul 13, 2019

1 answer

25

depth first traversal

1.2k views

commented Jul 11, 2019

2 answers

26

How many RAM chips & size of decoder required?
How many 256 X 4 RAM chips are required to organize a memory of capacity 32KB ? What is the size of decoder required in this implementation to select a row of chip? Options : (a) 128 , 7 X 128 (b) 256 , 7 X 128 (c) 512 , 7 X 128 (d) 256 , 8 X 256.

How many 256 X 4 RAM chips are required to organize a memory of capacity 32KB ? What is the size of decoder required in this implementation to select a row of chip?Option...

13.8k views

commented Jun 22, 2019

1 answer

27

SELF DOUBT OS MADEEASY TEST SERIES
CONSIDER A SYSTEM USING PAGING AND SEGMENTATION .THE VIRTUAL ADDRESS SPACE CONSIST OF UP TO 8 SEGMENTS AND EACH SEGMENT IS 229 BYTE long the hardware pages each segment into 28 B pages Q: HOW MANY BITS IN THE VIRTUAL ADDRESS SPECIFY THE PAGE NUMBER? A)4 bits b)5 bits c)16 bits d)21 bits

CONSIDER A SYSTEM USING PAGING AND SEGMENTATION .THE VIRTUAL ADDRESS SPACE CONSIST OF UP TO 8 SEGMENTS AND EACH SEGMENT IS 229 BYTE longthe hardware p...

2.1k views

commented Jun 14, 2019

2 answers

28

number of spanning trees
Find the no. of minimum cost spanning tree using Kruskal’s or Primus algorithm i am getting "4" but the answer is given "5" ...verify please

Find the no. of minimum cost spanning tree using Kruskal’s or Primus algorithmi am getting "4" but the answer is given "5" ...verify please

1.9k views

commented Jun 6, 2019

1 answer

29

Dijikstra
Consider a Graph G which contains a negative weight edges but not negative cycles then which of the following statements is TRUE when we run Dijkstra’s algorithm? It may not terminate It terminates but may produce incorrect results. It never terminates due to cycles in graph None of these

Consider a Graph G which contains a negative weight edges but not negative cycles then which of the following statements is TRUE when we run Dijkstra’s algorithm? It ma...

1.1k views

commented Jun 5, 2019

4 answers

30

Boolean algebra expression Floyd Digital Logic
Simplify the following expression AB’C + A’BC + A’B’C Solution given is A’C + B’C can someone show me how?

Simplify the following expressionAB’C + A’BC + A’B’CSolution given is A’C + B’C can someone show me how?

1.4k views

asked May 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