Dark Mode

Recent activity by AngshukN

1 answer

1

#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 #

commented in Databases Jul 8, 2022

253 views

1 answer

2

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.

commented in DS Jul 5, 2022

208 views

0 answers

3

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

commented in Databases Jul 2, 2022

125 views

0 answers

4

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?

commented in Computer Networks Jul 2, 2022

131 views

0 answers

5

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 +

commented in CO and Architecture Jul 2, 2022

119 views

3 answers

6

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

commented in Digital Logic Jul 2, 2022

528 views

0 answers

7

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) *

commented in Compiler Design Jul 2, 2022

203 views

1 answer

8

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

asked in CO and Architecture Jun 22, 2022

257 views

1 answer

9

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

commented in Operating System Jun 10, 2022

463 views

1 answer

10

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

answered in Mathematical Logic Jun 10, 2022

145 views

0 answers

11

Introduction to Graph Theory Exercises
This is the problem snapshot

commented in Graph Theory May 29, 2022

227 views

0 answers

12

NPTEL Assignment Question
Its MSQ.

commented in Theory of Computation May 23, 2022

107 views

2 answers

13

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 ?

commented in Programming May 23, 2022

258 views

3 answers

14

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

answer edited in Programming May 23, 2022

561 views

3 answers

15

Zeal Test Series 2019: Graph Theory - Graph Connectivity

answered in Graph Theory May 22, 2022

563 views

0 answers

16

#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}$

commented in Calculus May 3, 2022

130 views

1 answer

17

Calculus by Spivak 4th edition Chapter 10 problem 9

asked in Calculus May 3, 2022

107 views

8 answers

18

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$

commented in Computer Networks Jan 26, 2022

15.1k views

0 answers

19

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.

commented in Operating System Jan 25, 2022

345 views

2 answers

20

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

commented in Computer Networks Jan 24, 2022

400 views

8 answers

21

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$

commented in Graph Theory Jan 21, 2022

28.9k views

3 answers

22

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$

commented in Computer Networks Jan 17, 2022

9.8k views

1 answer

23

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$

commented in Quantitative Aptitude Jan 6, 2022

7.3k views

1 answer

24

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$.

answered in Set Theory & Algebra Jan 5, 2022

405 views

1 answer

25

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?

answered in Operating System Jan 5, 2022

487 views

0 answers

26

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.

commented in Compiler Design Jan 2, 2022

295 views

1 answer

27

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!

answered in Programming Dec 31, 2021

638 views

0 answers

28

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

commented in Digital Logic Dec 29, 2021

229 views

1 answer

29

#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 ?

answered in Theory of Computation Dec 29, 2021

198 views

1 answer

30

COA Applied Course
Assume that we are using the classic MIPS five-stage(IF, ID, EX, MEM and WB) integer pipeling.

commented in CO and Architecture Dec 27, 2021

238 views