Register
Filter

Recent activity by rhl

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}$?
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}$?
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
Which of the following heap memory allocation strategies is likely to exploit spatial locality of memory accesses in a program, the most?Best FitFirst FitNext FitLast Fit...
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
I think 3rd option is right but they mentionedThe binary representation of -39 is : 10110012's complement of 1011001 will be: 1's complement of 1011001 + 1= 0100110 + 1 ...
0 answers
7
Applied course
1 answer
8
madeeasy
The decimal equivalent of given 2’s complement number $(110101011.1101)_2$ is:
The decimal equivalent of given 2’s complement number $(110101011.1101)_2$ is:
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.
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 orig...
1 answer
10
General Doubt
Convert this language to Push Down Automata – {a^n u | u ∈ {a, b}*, |u| = n, n ≥ 0}
Convert this language to Push Down Automata – {a^n u | u ∈ {a, b}*, |u| = n, n ≥ 0}
2 answers
13
Self Doubt
Convert DFA to regular expression
Convert DFA to regular expression
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
Two processes $X$ and $Y$ need to access a critical section. Consider the following synchronization construct used by both the processes$$\begin{array}{|l|l|}\hline \text...
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
Can anyone explain this how this implication is valid with an example∃x (Px ⊕ Qx) < ∃xPx ⊕ ∃xQx
1 answer
21
Regular expression
L1 = a*b* , L2 = a^+ b^+ . L2-L1 = ?
L1 = a*b* , L2 = a^+ b^+ . L2-L1 = ?
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?
Consider a matrix of dimensions mxn and if rank(A)=n. What can be infer about the possible solutions?
1 answer
24
Theory of Computation
In a DFA, does every state have to have a transition for each of the symbols?
In a DFA, does every state have to have a transition for each of the symbols?
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?
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 t...
1 answer
29
Gate Overflow
Can some one share GO- pdf Volumes , updated ones .....???
Can some one share GO- pdf Volumes , updated ones .....???
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
Consider the set of relationsEMP (Employee-no. Dept-no, Employee-name, Salary)DEPT (Dept-no. Dept-name, Location)Write an SQL query to:Calculate, for each department numb...