# Recent questions tagged self-doubt

In which cases is a schedule view serializable but not conflict serializable? Please show with an example.
1 vote
We know that a schedule even if it is not conflict nor view serializable still it can be consistent and there is no typical method to find them. So my doubt is that Such schedules which are neither view serializable nor conflict serializable but consistent can be termed as serializable??
sir i want to ask when will you release the hardcopy of go2021??
How is Birthday attack possible by third party as well as receiver if sender encrypts the message digest with his own private key for authentication?. This question is similar to https://gateoverflow.in/118295/gate2017-1-15 ? Thank you
Is MUX functionally complete? and with a $8:1$ $MUX$ can we obtain all function of 3 variables?
How many questions do we need answer correctly in ISRO in order to qualify the written exam?
Can we have a Lattice with odd number of elements as a Boolean algebra? According to me we can't have because each element should have one complement and hence for odd number of elements one element would be remaining which will have no complement or more than one complement. Is this justification valid?
Do we have socket API functionalities in GATE?
Dynamic programming runs slower than an equivalent memoization approach, if every sub problem is solved. True or False?
There are lots of contradicting material out there for these concepts. Definitions are not clear. At some places it is said that Clustering index is sparse index. While at other places it is said that clustering index can be both dense and sparse index but not at the ... same time? primary, secondary (key), secondary (non key), clustered indices belongs to which class of indices- dense? sparse? b
Why do we call CFG as Context Free and CSL as Context Sensitive? I am searching this since a long time but could not find an answer.
If a schedule has a transaction that locks an item say A and then release the lock after few steps can it again lock the item A in a 2-phase locking scheme?
Hi Can someone please explain the answer to question in the below link . I am not able to understand it . Thank You https://gateoverflow.in/135069/mathematics-gate-ee-17
I am not able to understand Rice theorem. Can anyone suggest any reference where Rice theorem is explained properly with proper understandable explanation? Thank you
suppose we have something like this: f1(p,q,r) = minterms(1,3,7) f2(p,q,r) = minterms(0,3,6) F = minterms( f1’.f2’ ) = minterms( (1,3,7)’.(0,3,6)’ ) How we simplify this F function directly?
Can someone please explain the concept behind re-entrant and non re-entrant locks? Thank you
we know that Complement of minterms = maxterms but do this same apply here to:- 1) complement of function of SOP = POS function?Is this right? 2)can we do the complement of X = AB+A’B’ which is SOP to get POS function?
do these are included in Digital logic for gate 2020:- 1.Registers and counters? 2.Analysis and Design of Synchronous sequential circuits which include moore, mealy,excitation table,characteristic equation, state transition and diagrams?Also what are subtopics included in sequential circuits?
The dispatcher program runs in user mode or kernel mode?
Explain the points mentioned in this question. https://gateoverflow.in/60905/ugcnet-june2015-ii-6
What is the difference between functionally dependent and fully functionally dependent? Do these two statements mean the same or do they mean two different things? Statement 1: Every non-key attribute is functionally dependent on the primary key. Statement 2: Every non-key attribute is fully functionally dependent on the primary key.
Is there any difference between lossless decomposition and join dependency or both are same. both definition has same criteria. https://en.wikipedia.org/wiki/Join_dependency https://en.wikipedia.org/wiki/Lossless-Join_Decomposition Thanks
Eth0 Eth1 Eth2 Eth3
1 vote
Design a transducer to convert a binary string into octal. For example, the bit string 001101110 should produce the output 156. In this case, are we given only those binary strings whose lengths are multiples of 3? Are we reading the binary string in reverse or normally? Also, please provide the solution to this problem.
1 vote
The recursive equation of the $0-1$ Knapsack Problem is $V[i,w] = max(v_{i}+V[i-1,w-w_{i}],V[i-1,w])\ for\ 1\leqslant i\leqslant n,\ 0\leqslant w\leqslant W$ Could anyone give me an example of weights, profits and Knapsack size where $(V[i-1,w]) \geqslant (v_{i}+V[i-1,w-w_{i}])$? Source: http://www.es.ele.tue.nl/education/5MC10/Solutions/knapsack.pdf