Dark Mode

Recent activity by rhl

4 answers

1

GATE CSE 2024 | Set 2 | GA Question: 7
A person sold two different items at the same price. He made $10 \%$ profit in one item, and $10 \%$ loss in the other item. In selling these two items, the person made a total of $1 \%$ profit $2 \%$ profit $1 \%$ loss $2 \%$ loss

commented in Quantitative Aptitude Feb 25

2.5k views

6 answers

2

made easy test series
Consider a relation $R(ABCDEFGH)$. How many superkeys will be there in relation $R$ if the candidate keys for relation are ${A, BC, CDE, EF}$?

commented in Databases Jan 12

853 views

2 answers

3

ISRO 2024
Which of the following heap memory allocation strategies is likely to exploit spatial locality of memory accesses in a program, the most? Best Fit First Fit Next Fit Last Fit

answer edited in Operating System Jan 8

671 views

0 answers

4

Linear Algebra, Eigen Vales & Eigen Vectors
$If \ A = \begin{pmatrix} 1&1 \\ 1&0 \end{pmatrix},\ \alpha M_1+\beta M_2+\gamma M_3,\ where \ M_1 = L_{2x2},\ M_2 = \begin{pmatrix} 0&1 \\ 1&1 \end{pmatrix}\ and \ M_3 = \begin{pmatrix} 1&1 \\ 1&1 \end{pmatrix} \ then \ -$ ... $\alpha = 1,\ \beta = -1,\ \gamma = 2$ D. $\alpha = -1,\ \beta = 1,\ \gamma = 2$

commented in Linear Algebra Jan 8

110 views

0 answers

5

commented in Programming in C Dec 25, 2023

122 views

1 answer

6

#Applied Course
I think 3rd option is right but they mentioned The binary representation of -39 is : 1011001 2's complement of 1011001 will be: 1's complement of 1011001 + 1 => 0100110 + 1 = 0100111 = 39

commented in Digital Logic Dec 25, 2023

138 views

0 answers

7

commented in Digital Logic Dec 19, 2023

173 views

1 answer

8

madeeasy
The decimal equivalent of given 2’s complement number $(110101011.1101)_2$ is:

commented in Digital Logic Dec 11, 2023

382 views

1 answer

9

self doubt
2. Simplify the following Boolean expressions to a minimum number of literals: (a + b + c’)(a’b’ + c) 3. Draw logic diagrams of the circuits that implement the original and simplified expression in Problem 2.

commented in Digital Logic Dec 6, 2023

343 views

1 answer

10

General Doubt
Convert this language to Push Down Automata – {a^n u | u ∈ {a, b}*, |u| = n, n ≥ 0}

answered in Theory of Computation Oct 31, 2023

224 views

5 answers

11

GATE CSE 2015 Set 3 | Question: 18
Let $L$ be the language represented by the regular expression $\Sigma^*0011\Sigma^*$ where $\Sigma = \{0, 1\}$. What is the minimum number of states in a DFA that recognizes $\bar{L}$ (complement of $L$)? $4$ $5$ $6$ $8$

commented in Theory of Computation Oct 29, 2023

17.1k views

4 answers

12

GATE IT 2005 | Question: 37
Consider the non-deterministic finite automaton (NFA) shown in the figure. State $X$ is the starting state of the automaton. Let the language accepted by the NFA with $Y$ as the only accepting state be $L1$. Similarly, let the language accepted by the NFA with $Z$ as ... statements about $L1$ and $L2$ is TRUE? $L1 = L2$ $L1 \subset L2$ $L2 \subset L1$ None of the above

commented in Theory of Computation Oct 24, 2023

16.3k views

2 answers

13

Self Doubt
Convert DFA to regular expression

commented in Theory of Computation Oct 22, 2023

580 views

1 answer

14

GATE ECE 2023 | GA Question: 10
A $100 \mathrm{~cm} \times 32 \mathrm{~cm}$ rectangular sheet is folded $5$ times. Each time the sheet is folded, the long edge aligns with its opposite side. Eventually, the folded sheet is a rectangle of dimensions $100 \mathrm{~cm} \times 1 \mathrm{~cm}$. The total number of creases visible when the sheet is unfolded is ___________. $32$ $5$ $31$ $63$

answered in Quantitative Aptitude Oct 11, 2023

1.9k views

6 answers

15

GATE CSE 2015 Set 3 | Question: 10
Two processes $X$ and $Y$ ... proposed solution guarantees mutual exclusion and prevents deadlock The proposed solution fails to prevent deadlock and fails to guarantee mutual exclusion

commented in Operating System Sep 30, 2023

20.7k views

6 answers

16

GATE CSE 2013 | Question: 39
A certain computation generates two arrays a and b such that $a[i] = f(i)$ for $0 \leq i < n$ and $b[i] = g(a[i])$ for $0 \leq i < n$. Suppose this computation is decomposed into two concurrent processes $X$ and $Y$ such that $X$ computes the array $a$ and $Y$ computes the ... EntryY(R, S) { V(S); P(R); } ExitX(R, S) { V(R); P(S); } EntryY(R, S) { V(S); P(R); }

commented in Operating System Sep 30, 2023

28.3k views

1 answer

17

OS handout
Let m[0]…m[4] be mutexes (binary semaphores) and P[0] …. P[4] be processes. Suppose each process P[i] executes the following: P(i) { while(1) { P(m[i]); P(m[(i+1)%4]; <CS> V(m[i]); V(m[(i+1)%4]; } } What is the maximum no. Of processes that can be in<CS> .......

commented in Operating System Sep 18, 2023

420 views

1 answer

18

Doubt on First Order Logic
Can anyone explain this how this implication is valid with an example ∃x (Px ⊕ Qx) <-- ∃xPx ⊕ ∃xQx

answered in Others Jul 14, 2023

270 views

4 answers

19

GATE IT 2008 | Question: 32
If the final states and non-final states in the DFA below are interchanged, then which of the following languages over the alphabet $\{a, b\}$ will be accepted by the new DFA? Set of all strings that do not end with $ab$ Set of all strings that begin ... of all strings that do not contain the substring $ab$, The set described by the regular expression $b^*aa^*(ba)^*b^*$

commented in Theory of Computation Jul 13, 2023

8.9k views

1 answer

20

Regarding go classes weekly quiz Is there a schedule like some google calendar
How to get the schedule of go classes weekly quiz

commented in GATE Jul 12, 2023

368 views

1 answer

21

Regular expression
L1 = a*b* , L2 = a^+ b^+ . L2-L1 = ?

answered in Theory of Computation Jul 6, 2023

377 views

1 answer

22

Regular expression Theory of Computation
Answer this

answered in Theory of Computation Jul 6, 2023

468 views

1 answer

23

Possible Solutions for a System of Linear Equations
Consider a matrix of dimensions mxn and if rank(A)=n. What can be infer about the possible solutions?

answered in Linear Algebra Jul 4, 2023

413 views

1 answer

24

Theory of Computation
In a DFA, does every state have to have a transition for each of the symbols?

answered in Theory of Computation Jul 2, 2023

354 views

1 answer

25

Bits and byte
Sailor (Sid----,Sname,Age) Reserves (Sid,Bid---------,date) Boat (Bid----,Bname,color) i) Select B.bid, count (*) From boat B, Reserves R Where R.bid = B.bid and B.color = 'Red' Group By B.bid ii) Select B.bid, count (*) From boat B, ... result B Query (i) and Query (ii) gives the same result C Query (i) and Query (iii) gives the same result D Query (iii) results an error

answered in Databases Jul 1, 2023

250 views

2 answers

26

Go class
A database relation has10 attributes {A,BCD,E,F,J} “CDEF” is known to be a candidate key of relation . There may be other candidate keys, which are unknown. What is the maximum number of candidate keys that could simultaneously have?

answered in Set Theory & Algebra Jul 1, 2023

733 views

3 answers

27

I am unable to decide question is whether MSQ or MCQ in the GO books, someone can help me how i differentiate both??

commented in Unknown Category Jun 26, 2023

1.1k views

1 answer

28

answered in Mathematical Logic Jun 25, 2023

222 views

1 answer

29

Gate Overflow
Can some one share GO- pdf Volumes , updated ones .....???

commented in Unknown Category Jun 16, 2023

264 views

3 answers

30

GATE CSE 1999 | Question: 22-b
Consider the set of relations EMP (Employee-no. Dept-no, Employee-name, Salary) DEPT (Dept-no. Dept-name, Location) Write an SQL query to: Calculate, for each department number, the number of employees with a salary greater than Rs. 1,00,000

commented in Databases Jun 12, 2023

1.8k views