Dark Mode

Answers by Abhay123

0 votes

1

GO Classes Set Theory And Algebra Practice Set 1 | Question: 10
Are the following relations reflexive, symmetric, transitive, antisymmetric? Explain. Let $R$ be a relation on $\mathbb{Z}$ such that $(a, b) \in R$ iff $b=a$ or $b=-a$. Let $R$ be a relation on $\mathbb{R}$ ... $(a, b) \in R$ iff $a+b$ is a rational number, that is can be represented by a fraction.

answered in Set Theory & Algebra Oct 20, 2023

289 views

0 votes

2

Combinatorics, Discrete Maths (self doubts)
Consider the set of 4 -digit positive integers. How many of them have their digits in :- a) strictly decreasing order ? b) non decreasing order ? c) non increasing order ?

answered in Combinatory Oct 20, 2023

392 views

1 vote

3

Go-Back-N
In Go-Back-N protocol (with an ACK/NAK response time within three frame transmissions) there are constantly new frames to be transmitted. The frames are numbered with 3 bits and all numbers 0, 1, . . , 7 are used. The length of the transmission ... the 3rd and 9th transmission. Give the transmission window and receive window for the first 18 frames, and the numbering of the frames.

answered in Computer Networks Oct 20, 2023

489 views

0 votes

4

Ace Test Series | DBMS
A schedule S is having 3 transactions and each transaction is having two different data items and a blind 'Write A' statement is in all the three transactions.With the above information can you say whether the schedule is ... how many equivalent serial schedules are there serializable and it is equivalent to only two serial schedule detailed schedule is needed

answered in Databases Oct 20, 2023

319 views

0 votes

5

GO Classes Set Theory And Algebra Practice Set 1 | Question: 24
For each of the following relations $R$ on the set of real numbers, decide whether it is reflexive, symmetric, and/or transitive? Justify your arguments. Is the relation an equivalence relation? Explain. $(x, y) \in R$ if and only if $|x-y| \leq 3$ ... $(x, y) \in R$ if and only if $|x+y|=|x|+|y|$.

answered in Set Theory & Algebra Oct 19, 2023

182 views

0 votes

6

GO Classes Set Theory And Algebra Practice Set 1 | Question: 21
Define the relation $\mathrm{O}$ on $\mathrm{Z}$ as follows: $ \forall m, n \in Z, m O n \longleftrightarrow \exists k \in Z \mid(m-n)=2 k+1 $ ... $\mathrm{O}$ is not reflexive, symmetric, and not transitive.

answered in Set Theory & Algebra Oct 19, 2023

174 views

0 votes

7

GO Classes Set Theory And Algebra Practice Set 1 | Question: 11
Let $A \neq \varnothing$ be a set. Consider the following statements: $\varnothing$ is a reflexive binary relation on $A$; $\varnothing$ is a symmetric binary relation on $A ;$ $\varnothing$ is a transitive binary relation on $A$; Which of ... $(2)$ are correct. Only $(2)$ and $(3)$ are correct. None is correct. All are correct.

answered in Set Theory & Algebra Oct 19, 2023

239 views

0 votes

8

answered in Mathematical Logic Oct 19, 2023

188 views

0 votes

9

answered in Mathematical Logic Oct 19, 2023

110 views

0 votes

10

Chromatic Number

answered in Graph Theory Oct 19, 2023

206 views

1 vote

11

Self doubt
How many simple directed (unweighted) graphs on the set of vertices {v0,v1,…v5} are there that have at most one edge between any pair of vertices? (That is, for two vertices a, b, only at most one of the edges (a, b) and (b, a) is in the graph.)

answered in Graph Theory Oct 19, 2023

307 views

0 votes

12

Automata and Formal Languages

answered in Theory of Computation Oct 19, 2023

226 views

0 votes

13

simplify the following boolean function using boolean algebraic method (A'+C)(A'+C')(A'+B+C'D)

answered in Digital Logic Oct 19, 2023

199 views

0 votes

14

answered in Algorithms Oct 18, 2023

121 views

0 votes

15

Permutations and combination

answered in Algorithms Oct 18, 2023

90 views

1 vote

16

Discrete Mathematics | Set Theory | Equivalent Relation

answered in Set Theory & Algebra Oct 18, 2023

179 views

1 vote

17

Self doubt
How $O(n)+O(n)+O(n)+O(n)+O(n)+….+O(n)=O(n^2)$ but $\neq O(n)$ please explain it.

answered in Algorithms Oct 18, 2023

410 views

0 votes

18

TOC Find the language

answered in Algorithms Oct 9, 2023

121 views

0 votes

19

#DBMS #Normalization
please can someone help with part (a) of this question.

answered in Databases Oct 9, 2023

258 views

0 votes

20

answered in Theory of Computation Oct 9, 2023

172 views

0 votes

21

Made Easy Test Series

answered in Operating System Oct 9, 2023

428 views

0 votes

22

answered in Graph Theory Oct 8, 2023

191 views

0 votes

23

pipelining hazard
Consider a 5-stage pipelined processor with stages - Instruction Fetch (IF), Instruction Decode (ID), Execute (EX), Memory Access (MA) and Write Back (WB). All stages except Memory Access takes 1 clock cycle each for all instructions. Memory access takes 3 clock cycles for instruction LOAD. How many ... (R4) ; R3 ← [4 + [R4]] I3 : SUB R5, R3, R4 ; R5 ← R3 - R4 ans is 14 bt how?

answered in Operating System Oct 8, 2023

408 views

1 vote

24

Checking regularity of a given language.
$L =\left \{ w(w^{R})^{*}: w\in(a,b)^{*} \right \}.$ Is this language regular?

answered in Theory of Computation Oct 8, 2023

242 views