Recent activity by AngshukN / GATE Overflow for GATE CSE

1 answer

1

GO Classes Test Series 2023 | Theory of Computation | Test 2 | Question: 10
Let $\text{L}$ be a language over an alphabet $\Sigma$. The equivalence relation $\sim_{\text{L}}$ on the set $\Sigma^{\ast}$ of finite strings over $\Sigma$ ... $1$ Only $2$ Both None

Let $\text{L}$ be a language over an alphabet $\Sigma$. The equivalence relation $\sim_{\text{L}}$ on the set $\Sigma^{\ast}$ of finite strings over $\Sigma$ is defined b...

378 views

commented Nov 4, 2022

1 answer

2

#DBMS
Consider a relation schema r(A,B,C,D) with F as set of functional dependencies. F contain following functional dependencies: A -> B A -> D A -> C B -> D we decompose the relation r into two relation schemas r1(A,B,C) and r2(B,D). The statement (Functional dependency in r1) U (Functional dependency in r2) = F is correct ? #dbms #

Consider a relation schema r(A,B,C,D) with F as set of functional dependencies. F contain following functional dependencies:A - BA - DA - CB - Dwe decompose the relation ...

641 views

commented Jul 8, 2022

1 answer

3

For which of the following does there exist a tree satisfying the specified constraints? (a) A binary tree with 65 leaves and height 6. (b) A binary tree with 33 leaves and height 5.

668 views

commented Jul 4, 2022

0 answers

4

HCU PHD 2018 JUNE
Suppose there are three relations as given below: (x) R(a,b)= (0,1),(4,5),(8,9). (y) S(b,c )=(1,2),(5,2),(5,6),(5,10),(13,10). (z) T( c,d)=(2,3),(6,7)(10,11),(10,3) the number of tuples in (R * S) * T, where * is the full natural outer join, is: (a) 5 (b) 8 (c) 13 (d) 60

Suppose there are three relations as given below:(x) R(a,b)= (0,1),(4,5),(8,9).(y) S(b,c )=(1,2),(5,2),(5,6),(5,10),(13,10).(z) T( c,d)=(2,3),(6,7)(10,11),(10,3)the numbe...

349 views

commented Jul 2, 2022

0 answers

5

Automatic Repeat Request
Consider an ARQ algorithm running over a 20-km point-to-point fiber link. (a) Compute the propagation delay for this link, assuming that the speed of light is 2 × 10^8 m/s in the fiber. (b) Suggest a suitable timeout value for the ARQ algorithm to use. (c) Why might it still be possible for the ARQ algorithm to time out and retransmit a frame, given this timeout value?

Consider an ARQ algorithm running over a 20-km point-to-point fiber link.(a) Compute the propagation delay for this link, assuming that the speed of light is 2 × 10^8 m/...

490 views

commented Jul 2, 2022

0 answers

6

in a stack ISA, the postfix expression z = X Y x W U x +
In a stack ISA, the postfix expression z = X Y x W U x +

In a stack ISA, the postfix expression z = X Y x W U x +

421 views

commented Jul 2, 2022

3 answers

7

Let the functions 𝑓1 𝑎, 𝑏, 𝑐 = ∑ 1,2,3,4 and 𝑓2 𝑎, 𝑏, 𝑐 = ∑ 0,2,4,6 .What is 𝑓1 ⊕ 𝑓2?

How do we solve this?

2.6k views

commented Jul 2, 2022

0 answers

8

B) Construct DFA for the following regular expressions and assure the minimum number of states in the constructed DFA. (i) ab*a*(a/b) (ii) 1(1+0)* + 10(0 + 1) *

491 views

commented Jul 2, 2022

1 answer

9

Stallings Computer Organization Problem
Consider two microprocessors having 8- and 16-bit-wide external data buses, respectively. The two processors are identical otherwise and their bus cycles take just as long a. Suppose all instructions and operands are two bytes long. By what factor ... and hence would be able to send 2 one byte instructions/data in one bus cycle. Can anyone solve this. Thanks

Consider two microprocessors having 8- and 16-bit-wide external data buses, respectively. The two processors are identical otherwise and their bus cycles take just as lon...

907 views

asked Jun 22, 2022

1 answer

10

Operating System | Process Scheduling | Round Robin
Lets consider one situation where, OS is scheduling processes(P1,P2,P3...Pn) with Round Robin method and current running process is P1 and next scheduled process in queue is also P1 (this case is possible in Round Robin). ... take place in Round Robin scheduling method with quantum=3unit for the given data below. AT=Arrival Time, BT=Burst Time

Lets consider one situation where,OS is scheduling processes(P1,P2,P3...Pn) with Round Robin method and current running process is P1 and next scheduled process in queue ...

1.4k views

commented Jun 10, 2022

1 answer

11

Can someone please explain how "I am lying" is a Liars paradox? and how the truth values are toggling here?

I want to understand why the statement “I am lying” is a liars paradox as I unable to to toggle between the truth values for this statement. Thanks in advance.

469 views

answered Jun 10, 2022

0 answers

12

Introduction to Graph Theory Exercises
This is the problem snapshot

This is the problem snapshot

404 views

commented May 29, 2022

0 answers

13

NPTEL Assignment Question
Its MSQ.

Its MSQ.

244 views

commented May 23, 2022

2 answers

14

what is the ouput of this c code ?
// C/C++ program to demonstrate return value // of printf() #include <stdio.h> int main() { long int n = 123456789; printf("While printing "); printf(", the value returned by printf() is : %d", printf("%ld" ... : 9 123456789 but this prints While printing 123456789, the value returned by printf() is : 9 why this is happens ?

// C/C++ program to demonstrate return value// of printf()#include <stdio.h>int main(){ long int n = 123456789; printf("While printing "); printf(", the value re...

668 views

commented May 23, 2022

3 answers

15

Which value of static variable is returned if it is present in return statement of a recursive function?

#include <stdio.h>int f(int n){ static int r = 0; if (n <= 0) return 1; r=n; return f(n-1) + r;}int main() { printf("output is %d", f(5)); return 0;}Ou...

1.1k views

answer edited May 23, 2022

3 answers

16

Zeal Test Series 2019: Graph Theory - Graph Connectivity

918 views

answered May 22, 2022

0 answers

17

#ISI2021
Let f(x-y) = $\frac{f(x)}{f(y)}$ for all x,y $\epsilon$ R and f’(0) = p, f’(5) = q. Then the value of f’(-5) is q -q $\frac{p}{q}$ $\frac{p^2}{q}$

Let f(x-y) = $\frac{f(x)}{f(y)}$ for all x,y $\epsilon$ R and f’(0) = p, f’(5) = q. Then the value of f’(-5) is q-q$\frac{p}{q}$$\frac{p^2}{q}$

344 views

commented May 3, 2022

1 answer

18

Calculus by Spivak 4th edition Chapter 10 problem 9

351 views

asked May 3, 2022

8 answers

19

GATE IT 2007 | Question: 63
A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a message to the root of the tree. The root then sends the message back down to router $j$ ... mean number of hops per message, assuming all possible router pairs are equally likely is $3$ $4.26$ $4.53$ $5.26$

A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a mess...

19.0k views

commented Jan 26, 2022

0 answers

20

made east test series - synchronization - OS
Consider the following proposed solution to Dining Philosopher's problem to avoid deadlock. The binary semaphore lock is initialized to 1. Which of the following is correct? Removing (i) and (ii) will not affect the code. It will work fine. Removing (iii) ... fine. All (i), (ii), (iii) and (iv) are necessary. Removal of any of them will affect the code.

Consider the following proposed solution to Dining Philosopher’s problem to avoid deadlock. The binary semaphore lock is initialized to 1.Which of the following is corr...

987 views

commented Jan 25, 2022

2 answers

21

Gate CSE Mock Test Series | Unacademy 2022
A sender uses the stop and wait ARQ protocol for reliable transmission of frames. Frames are of size 100 bytes and the transmission rate at the sender is 20 Kbps. Size of an acknowledgement is 10 bytes and the transmission rate at the receiver is 8 Kbps. The ... data meaning 1msec → $\frac{100}{70}$ Bytes of data hence 1sec → $\frac{10}{7}X1000$ = 1428.57

A sender uses the stop and wait ARQ protocol for reliable transmission of frames. Frames are of size 100 bytes and the transmission rate at the sender is 20 Kbps. Size of...

717 views

commented Jan 24, 2022

9 answers

22

GATE CSE 2012 | Question: 38
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to $15$ $30$ $90$ $360$

Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to$15$$30$$90$$36...

35.0k views

commented Jan 21, 2022

3 answers

23

GATE IT 2007 | Question: 62
Let us consider a statistical time division multiplexing of packets. The number of sources is $10$. In a time unit, a source transmits a packet of $1000$ bits. The number of sources sending data for the first $20$ ... unit. Then the average number of backlogged of packets per time unit during the given period is $5$ $4.45$ $3.45$ $0$

Let us consider a statistical time division multiplexing of packets. The number of sources is $10$. In a time unit, a source transmits a packet of $1000$ bits. The number...

13.0k views

commented Jan 17, 2022

1 answer

24

GATE CSE 2021 Set 1 | GA Question: 8
There are five bags each containing identical sets of ten distinct chocolates. One chocolate is picked from each bag. The probability that at least two chocolates are identical is __________ $0.3024$ $0.4235$ $0.6976$ $0.8125$

There are five bags each containing identical sets of ten distinct chocolates. One chocolate is picked from each bag.The probability that at least two chocolates are iden...

10.8k views

commented Jan 6, 2022

1 answer

25

GATE CSE 1988 | Question: 13ic
Verify whether the following mapping is a homomorphism. If so, determine its kernel. $f(x)=x^3$, for all $x$ belonging to $G$.

Verify whether the following mapping is a homomorphism. If so, determine its kernel.$f(x)=x^3$, for all $x$ belonging to $G$.

558 views

answered Jan 5, 2022

1 answer

26

GATE CSE 2017 Set 1 | Question: 27 with modification
A multithreaded program P executes with x number of threads and uses y number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock l, then it cannot ... D) x = 1, y = 1 If non- re entrant was not part of question then it would be OPTION - C?

A multithreaded program P executes with x number of threads and uses y number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks...

685 views

answered Jan 5, 2022

1 answer

27

To get follow of grammar ,Should I remove left_recursion first?
S-> SS | Aa A->Sb | a (a) prove that the grammar is ambiguous. (b) find the follow for the grammar (c) then remove the left recursion from the grammar.

S- SS | AaA->Sb | a(a) prove that the grammar is ambiguous.(b) find the follow for the grammar(c) then remove the left recursion from the grammar.

1.2k views

commented Jan 2, 2022

1 answer

28

Applied Test series: DS
The number of insertion sequences of the numbers {1,2,3,4,5,6,7} which would lead to the following BST How to tackle this kind of problem. Anyone!

The number of insertion sequences of the numbers {1,2,3,4,5,6,7} which would lead to the following BSTHow to tackle this kind of problem. Anyone!

1.4k views

answered Dec 31, 2021

0 answers

29

Testbook Test Series
Consider the following statements 4 : 16 decoder can be constructed (with enable input). Which of the following statements is/are correct? (MSQ) a. Using four 2 : 4 decoders (each with an enable input) only b. Using five 2 : 4 decoders (each with an enable ... : 8 decoders (each with an enable input) only d. Using two 3 : 8 decoders (each with an enable input) and an inverter

Consider the following statements4 : 16 decoder can be constructed (with enable input). Which of the following statements is/are correct? (MSQ)a. Using four 2 : 4 decoder...

521 views

commented Dec 29, 2021

1 answer

30

#Empty_Language #ϕ #TOC #Doubt #Concatenation
I have a naive doubt about the below statement L. ϕ = ϕ. L = ϕ I want to know if the above statement holds true. If yes, can you please explain ?

I have a naive doubt about the below statementL. ϕ = ϕ. L = ϕI want to know if the above statement holds true. If yes, can you please explain ?

360 views

answered Dec 29, 2021

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