Dark Mode

Answers by AngshukN

0 votes

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 #

answered in Databases Jul 3, 2022

254 views

0 votes

2

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

1 vote

3

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

answered in Programming May 23, 2022

561 views

1 vote

4

Zeal Test Series 2019: Graph Theory - Graph Connectivity

answered in Graph Theory May 22, 2022

563 views

0 votes

5

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

0 votes

6

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

6 votes

7

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 votes

8

#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

2 votes

9

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

answered in CO and Architecture Dec 27, 2021

238 views

0 votes

10

Made easy Test Series:Graph Theory+Automata
Consider a graph $G$ with $2^{n}$ vertices where the level of each vertex is a $n$ bit binary string represented as $a_{0},a_{1},a_{2},.............,a_{n-1}$, where each $a_{i}$ is $0$ or $1$ ... and $y$ denote the degree of a vertex $G$ and number of connected component of $G$ for $n=8.$ The value of $x+10y$ is_____________

answered in Graph Theory Dec 27, 2021

732 views

1 vote

11

Applied Test series: C-programming
I know the answer but need a good explanation for this question. Can anyone help. Thanks!

answered in Programming Dec 26, 2021

295 views

2 votes

12

Testbook Test Series

answered in Digital Logic Dec 26, 2021

153 views

2 votes

13

Testbook Test Series

answered in Digital Logic Dec 26, 2021

142 views

1 vote

14

Testbook Test Series

answered in Programming Dec 26, 2021

129 views

1 vote

15

Testbook Test Series

answered in Programming Dec 26, 2021

147 views

0 votes

16

Conditional Probability
The above-given problem is from MIT-OCW probability - https://tinyurl.com/25wamnxz There are two biased coins - A and B. The probability of choosing either coin is 0.5. Once the coins are chosen, we perform the experiment of tossing the coins as shown in the ... probability of (A | B) i.e. if we get 10 successive heads, then what is the probability that coin A was chosen?

answered in Probability Dec 26, 2021

318 views

3 votes

17

Applied Mock Test
A uniprocessor computer system has three processes, which alternate 20ms CPU bursts with 80ms I/O bursts. All the processes were created at nearly the same time. The I/O of all the processes can proceed in parallel. The absolute difference of CPU utilization (over a long period of time) using FCFS and Round Robin (time quantum 10ms) for this system is _____ %

answered in Operating System Dec 25, 2021

1.5k views

2 votes

18

Kenneth Rosen Edition 7 Exercise 8.1 Question 25 (Page No. 511)
How many bit sequences of length seven contain an even number of $0s?$

answered in Combinatory Dec 25, 2021

211 views

1 vote

19

Testbook Test Series

answered in Linear Algebra Dec 22, 2021

181 views

1 vote

20

Testbook Test Series

answered in Linear Algebra Dec 22, 2021

224 views

0 votes

21

answered in Probability Dec 22, 2021

154 views

0 votes

22

answered in Probability Dec 22, 2021

137 views

0 votes

23

NIELIT STQC STA 2021
Let $C(n,r)= \binom{n}{r}$.The value of $\sum_{k=0}^{20}(2k+1)C(41,2k+1)$ is : A)40(2)^40 B)40(2)^39 C)41(2)^40 D)41(2)^39

answered in Set Theory & Algebra Dec 21, 2021

233 views

1 vote

24

Testbook Test Series

answered in DS Dec 21, 2021

123 views

1 vote

25

Testbook Test Series

answered in Algorithms Dec 21, 2021

170 views

0 votes

26

nptel assignment
The given answer is 5. My answer is coming 3. Please post the detailed solution if someone getting 5 as an answer.

answered in Digital Logic Dec 21, 2021

395 views

1 vote

27

Data Communications and Networks, James Irvine and David Harle, Chapter 8, Question 8.1.2.1
An information source produces 8 different symbols with probabilities 1/2, 1/4, 1/8, 1/16, 1/32, 1/64, 1/128, 1/128. These symbols are encoded as 000, 001, 010, 011, 100, 101, 110 and 111, ... ) What is the amount of information per symbol? (ii) What are the probabilities of occurrence for a 0 and a 1?

answered in Study Resources Dec 20, 2021

171 views

0 votes

28

confusion -- computer networks
Do we actually need ip and Mac addresses both at same time for the computer for communication? Why we not use Mac instead of ip address since Mac is also the unique address globally? Why we not use ip instead of Mac Since both are unique but why we use both for computer networkws?

answered in Computer Networks Dec 20, 2021

309 views

2 votes

29

Geeksforgeeks mock - 2022
Consider the following C program: #include <stdio.h> #include <stdlib.h> #include <unistd.h> int main (void) { pid_t pid; int x = 2; pid = fork ( ); if (pid = = 0); x = 8; fork( ); printf("%d", x); return 0; } Fork ( ) is a system call creates new ... the program is executed on the unix OS?[MSQ] (a) 8 2 2 8 (b) 8 8 2 2 (c) 2 8 8 2 (d) 2 2 8 8

answered in Operating System Dec 20, 2021

909 views

1 vote

30

Test Series- Applied:
Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a deadlock is ___ I answered it as 3. Because it asked for maximum which is not correct. Can someone help me in this.

answered in Operating System Dec 20, 2021

237 views

Page: