Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent questions tagged selfdoubt
0
votes
1
answer
GATE syllabus(self Doubt) socket programming
Do we have socket API functionalities in GATE?
asked
Dec 30, 2019
in
Computer Networks
by
Pratyush Priyam Kuan
(
1.1k
points)

47
views
selfdoubt
computernetwork
0
votes
0
answers
Can someone give a good clarification on Dense index, sparse index?
asked
Dec 23, 2019
in
Databases
by
commenter commenter
(
11
points)

21
views
databases
selfdoubt
0
votes
0
answers
Why the name Context Free and Context Sensitive?
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.
asked
Dec 21, 2019
in
Theory of Computation
by
AkashChandraGupta
(
5
points)

17
views
theoryofcomputation
contextfreelanguages
contextsensitivelanguages
selfdoubt
0
votes
2
answers
locking and releasing a lock twice on a data item in 2LP
asked
Dec 18, 2019
in
Databases
by
arunkantdubey
(
7
points)

33
views
2phaselocking
selfdoubt
madeeasyworkbook
0
votes
0
answers
mathematicsgateee17
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/mathematicsgateee17
asked
Dec 13, 2019
in
Mathematical Logic
by
Pratyush Priyam Kuan
(
1.1k
points)

9
views
selfdoubt
engineeringmaths
0
votes
1
answer
Rice Theorem
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
by
Pratyush Priyam Kuan
(
1.1k
points)

53
views
ricestheorem
selfdoubt
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
(
103
points)

36
views
digitallogic
selfdoubt
booleanexpression
0
votes
1
answer
Concept behind Reentrant and non re entrant lock (self doubt)
asked
Nov 9, 2019
in
Operating System
by
Pratyush Priyam Kuan
(
1.1k
points)

33
views
operatingsystem
selfdoubt
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
(
103
points)

60
views
digitallogic
booleanalgebra
selfdoubt
0
votes
0
answers
doubt regarding syllabus of digital logic for gate 2020
asked
Oct 26, 2019
in
Digital Logic
by
shaktisingh
(
103
points)

44
views
digitallogic
selfdoubt
gatesyllabus
0
votes
1
answer
Dispatcher Self Doubt
The dispatcher program runs in user mode or kernel mode?
asked
Oct 19, 2019
in
Operating System
by
aditi19
(
53
points)

32
views
operatingsystem
scheduling
processscheduling
selfdoubt
0
votes
0
answers
Self Doubt: Digital Logic( Boolean Algebra)
Explain the points mentioned in this question. https://gateoverflow.in/60905/ugcnetjune2015ii6
asked
Oct 14, 2019
in
Digital Logic
by
HeartBleed
(
79
points)

20
views
digitallogic
selfdoubt
booleanalgebra
0
votes
0
answers
Diffrerence between Functional Dependency and Fully Functionally Dependency on primary Key
asked
Oct 10, 2019
in
Databases
by
HeartBleed
(
79
points)

37
views
databases
normalization
selfdoubt
functionaldependency
0
votes
0
answers
functional dependency
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/LosslessJoin_Decomposition Thanks
asked
Sep 13, 2019
in
Databases
by
piyushhurpade
(
5
points)

20
views
databases
selfdoubt
functionaldependency
0
votes
0
answers
on which interface will an IP packet with destination address 144.25.64.120 be forwarded
asked
Aug 21, 2019
in
Computer Networks
by
Jayasoorya
(
5
points)

25
views
selfdoubt
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
(
9
points)

191
views
theoryofcomputation
peterlinz
selfdoubt
+1
vote
0
answers
01 Knapsack Problem
The recursive equation of the $01$ Knapsack Problem is $V[i,w] = max(v_{i}+V[i1,ww_{i}],V[i1,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[i1,w]) \geqslant (v_{i}+V[i1,ww_{i}])$? Source: http://www.es.ele.tue.nl/education/5MC10/Solutions/knapsack.pdf
asked
Aug 12, 2019
in
Algorithms
by
Shiva Sagar Rao
(
19
points)

54
views
algorithms
dynamicprogramming
selfdoubt
0
votes
1
answer
Question on static variables . What will be the output ?
asked
Aug 10, 2019
in
Programming
by
Rishav_Bhatt
(
15
points)

44
views
selfdoubt
0
votes
0
answers
Self Doubt: CO and Architecture
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
by
Hirak
(
1.9k
points)

30
views
coandarchitecture
selfdoubt
0
votes
1
answer
Self doubt, test Series
What are PDA and Turing Machine by default deterministic or non deterministic?
asked
Aug 3, 2019
in
Theory of Computation
by
Rajesh Panwar
(
31
points)

34
views
selfdoubt
0
votes
1
answer
SelfDoubt
Why we use Dynamic Programming even though it has such a high time complexity?
asked
Jul 22, 2019
in
Algorithms
by
Ritabrata Dey
(
49
points)

35
views
selfdoubt
0
votes
1
answer
doubttimecomplexity
When is the time complexity O(loglogn) ??
asked
Jul 22, 2019
in
Algorithms
by
Ritabrata Dey
(
49
points)

31
views
selfdoubt
Page:
« prev
1
...
4
5
6
7
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 Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
9,106
questions
3,157
answers
14,595
comments
95,958
users