search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.

Recent questions tagged self-doubt

0 votes
0 answers 42 views
In which cases is a schedule view serializable but not conflict serializable? Please show with an example.
asked Jan 27, 2020 in Databases Mellophi 363 points 42 views
1 vote
0 answers 140 views
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??
asked Jan 20, 2020 in Databases Chirag Shilwant 191 points 140 views
0 votes
0 answers 9 views
sir i want to ask when will you release the hardcopy of go2021??
asked Jan 12, 2020 in GATE Vasukaushik 5 points 9 views
0 votes
0 answers 41 views
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
asked Jan 7, 2020 in Computer Networks Pratyush Priyam Kuan 1.1k points 41 views
0 votes
0 answers 14 views
Is MUX functionally complete? and with a $8:1$ $MUX$ can we obtain all function of 3 variables?
asked Jan 4, 2020 in Digital Logic Debapaul 541 points 14 views
0 votes
0 answers 44 views
How many questions do we need answer correctly in ISRO in order to qualify the written exam?
asked Jan 2, 2020 in ISRO Pratyush Priyam Kuan 1.1k points 44 views
0 votes
0 answers 13 views
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?
asked Jan 2, 2020 in Set Theory & Algebra Chirag Shilwant 191 points 13 views
0 votes
1 answer 52 views
0 votes
0 answers 22 views
Dynamic programming runs slower than an equivalent memoization approach, if every sub problem is solved. True or False?
asked Dec 29, 2019 in Algorithms Chirag Shilwant 191 points 22 views
0 votes
0 answers 22 views
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
asked Dec 23, 2019 in Databases commenter commenter 11 points 22 views
0 votes
0 answers 19 views
0 votes
2 answers 38 views
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?
asked Dec 18, 2019 in Databases arunkantdubey 7 points 38 views
0 votes
0 answers 11 views
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
asked Dec 13, 2019 in Mathematical Logic Pratyush Priyam Kuan 1.1k points 11 views
0 votes
1 answer 58 views
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
asked Nov 24, 2019 in Theory of Computation Pratyush Priyam Kuan 1.1k points 58 views
0 votes
1 answer 37 views
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?
asked Nov 22, 2019 in Digital Logic shaktisingh 103 points 37 views
0 votes
1 answer 35 views
Can someone please explain the concept behind re-entrant and non re-entrant locks? Thank you
asked Nov 9, 2019 in Operating System Pratyush Priyam Kuan 1.1k points 35 views
0 votes
0 answers 66 views
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?
asked Oct 27, 2019 in Digital Logic shaktisingh 103 points 66 views
0 votes
0 answers 53 views
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?
asked Oct 26, 2019 in Digital Logic shaktisingh 103 points 53 views
0 votes
1 answer 38 views
The dispatcher program runs in user mode or kernel mode?
asked Oct 19, 2019 in Operating System aditi19 53 points 38 views
0 votes
0 answers 22 views
Explain the points mentioned in this question. https://gateoverflow.in/60905/ugcnet-june2015-ii-6
asked Oct 14, 2019 in Digital Logic HeartBleed 79 points 22 views
0 votes
0 answers 42 views
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.
asked Oct 10, 2019 in Databases HeartBleed 79 points 42 views
0 votes
0 answers 23 views
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
asked Sep 13, 2019 in Databases piyushhurpade 5 points 23 views
0 votes
0 answers 30 views
1 vote
0 answers 292 views
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.
asked Aug 17, 2019 in Theory of Computation GATE_aspirant_2021 13 points 292 views
1 vote
0 answers 61 views
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
asked Aug 12, 2019 in Algorithms Shiva Sagar Rao 35 points 61 views
0 votes
1 answer 49 views
#include <stdio.h> void main() { int i, x=5,y=10 ; for(i=1;i<=2;i++) { y+= f(x) + g(x); printf ("%d\n",y); } } f(int x) { int y; y= g(x); return(x+y); } g(int x) { static int y= 5; y= y+7; return (x+y); }
asked Aug 10, 2019 in Programming Rishav_Bhatt 15 points 49 views
0 votes
0 answers 34 views
How many memory accesses required by the following instructions? DIV r1, r2, @(r4) Suppose instruction is one word long, as well as every address. (A) 1 (B) 2 (C) 4 (D) 6
asked Aug 3, 2019 in CO & Architecture Hirak 1.9k points 34 views
0 votes
1 answer 37 views
What are PDA and Turing Machine by default deterministic or non deterministic?
asked Aug 3, 2019 in Theory of Computation Rajesh Panwar 31 points 37 views
0 votes
1 answer 38 views
Why we use Dynamic Programming even though it has such a high time complexity?
asked Jul 22, 2019 in Algorithms Ritabrata Dey 49 points 38 views
0 votes
1 answer 35 views
When is the time complexity O(loglogn) ??
asked Jul 22, 2019 in Algorithms Ritabrata Dey 49 points 35 views
...