Recent questions tagged selfdoubt - GATE CSE Doubts

0 votes

1 answer

Self Doubt (Hamming Codes)
Why do we consider $2^r \ge m+r+1$ for hamming codes where $r$ = number of parity bits and $m$ = number of message bits ?

asked 5 hours ago in Computer Networks by Mellophi (26 points) | 4 views

0 votes

1 answer

Self Doubt - Py (CO & Architecture)
Source : https://gateoverflow.in/1063/gate2004-69 In this question we have gate delays, latch delays and 1000 inst. and arjun sir's answer make it very clear on how to proceed without making use of any formula. Source : https://gateoverflow.in/ ... the same logic as above question I am getting answer as 164 instead of directly multiplying 15*11. Why is that $?$

asked 11 hours ago in CO & Architecture by Kushagra गुप्ता (486 points) | 7 views

0 votes

0 answers

Self Doubt (CO & Architecture)
If there is a miss in L1 cache then a block of size same as that in L1 is brought back to the L1 cache irrespective of the block size of L2 cache or memory. Is this statement correct?

asked 3 days ago in CO & Architecture by Mellophi (26 points) | 7 views

0 votes

0 answers

Self Doubt (Write through cache)
In write through cache if the hit ratio for write is given as 1 then do we consider both write and read as simultaneous or just write as simultaneous and read as hierarchal? Please provide the reference also.

asked 4 days ago in CO & Architecture by Mellophi (26 points) | 4 views

0 votes

0 answers

Threads Self Doubt IIT notes
User-level threads require non-blocking systems call i.e., a multithreaded kernel. Otherwise, the entire process will be blocked in the kernel, even if there are runnable threads left in the processes. For example, if one thread causes a page fault, ... kernel ? I cannot understand the relation between them, please help. link: IIT notes threads (last para of the page)

asked Jun 4 in Operating System by reboot (7 points) | 16 views

0 votes

0 answers

Databases Normalization
Can someone explain the last option If R in 3NF and not in BCNF then R must have atleast two compound candidate keys – TRUE / FALSE.

asked Jan 27 in Databases by kashyap02 (26 points) | 23 views

0 votes

0 answers

Self Doubt- DBMS
In which cases is a schedule view serializable but not conflict serializable? Please show with an example.

asked Jan 27 in Databases by Mellophi (26 points) | 22 views

+1 vote

0 answers

Self doubt : Serializability Dbms
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 in Databases by Chirag Shilwant (181 points) | 96 views

0 votes

0 answers

Regarding hardcopy of Go2021
sir i want to ask when will you release the hardcopy of go2021??

asked Jan 12 in GATE by Vasukaushik (6 points) | 5 views

0 votes

0 answers

Made Easy : Self Doubt
Is MUX functionally complete? and with a $8:1$ $MUX$ can we obtain all function of 3 variables?

asked Jan 4 in Digital Logic by Debapaul (699 points) | 10 views

0 votes

0 answers

Self doubt : Boolean algebra
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 in Set Theory & Algebra by Chirag Shilwant (181 points) | 10 views

0 votes

0 answers

mathematics-gate-ee-17
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 by Pratyush Priyam Kuan (804 points) | 7 views

0 votes

1 answer

Self doubt : In boolean expression simplification
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 by shaktisingh (90 points) | 30 views

0 votes

0 answers

self doubt in boolean algebra
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 by shaktisingh (90 points) | 38 views

0 votes

0 answers

doubt regarding syllabus of digital logic for gate 2020

asked Oct 26, 2019 in Digital Logic by shaktisingh (90 points) | 32 views

0 votes

0 answers

Self Doubt: Digital Logic( Boolean Algebra)
Explain the points mentioned in this question. https://gateoverflow.in/60905/ugcnet-june2015-ii-6

asked Oct 14, 2019 in Digital Logic by HeartBleed (57 points) | 13 views

0 votes

0 answers

Peter Linz Exercise 1.3 Question 12
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 by GATE_aspirant_2021 (8 points) | 76 views

+1 vote

0 answers

0-1 Knapsack Problem
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 by Shiva Sagar Rao (53 points) | 32 views

To see more, click for the full list of questions or popular tags.

7,688 questions

1,815 answers

11,053 comments

95,077 users