Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged self-doubt
0
votes
2
answers
121
self doubt
Both euler path and euler circuit can be present in a graph ?
Both euler path and euler circuit can be present in a graph ?
raja11sep
1.0k
views
raja11sep
asked
Jan 5, 2022
Graph Theory
self-doubt
+
–
0
votes
0
answers
122
(Answered) Self doubt about ambiguous grammar
I understand all these following separately : 1) DCFG is always unambiguous 2) Regular grammar is a subset of DCFG 3) Regular grammar can be ambiguous But can't understand how any DCFG is unambiguous if its subset can be ambiguous
I understand all these following separately :1) DCFG is always unambiguous2) Regular grammar is a subset of DCFG3) Regular grammar can be ambiguousBut can't understand ho...
o
708
views
o
asked
Jan 2, 2022
Compiler Design
self-doubt
theory-of-computation
compiler-design
+
–
0
votes
1
answer
123
Self doubt
How many ‘n’ state FA are possible with ‘m’ symbols with – (i) Designated initial state (ii) With designated initial and final state (iii) With no designated initial and final state How can I approach this?
How many ‘n’ state FA are possible with ‘m’ symbols with –(i) Designated initial state(ii) With designated initial and final state(iii) With no designated initi...
Shoto
794
views
Shoto
asked
Dec 28, 2021
Theory of Computation
self-doubt
theory-of-computation
finite-automata
+
–
0
votes
0
answers
124
self-doubt operating-system semaphore
given solution is wait(P) , wait(Q), wait(p) , wait(Q) for s1,s2,s3,s4 respectively I know this implementation is deadlock free just want to ask if it will follow bounded waiting and progress and how both of them are different?
given solution is wait(P) , wait(Q), wait(p) , wait(Q) for s1,s2,s3,s4 respectivelyI know this implementation is deadlock free just want to ask if it will follow bounded ...
Arbaz__Malik
643
views
Arbaz__Malik
asked
Dec 25, 2021
Operating System
self-doubt
operating-system
semaphore
+
–
3
votes
3
answers
125
#selfDoubt
complement of CFL can never be CFL. please explain if the above statement is true of false?
complement of CFL can never be CFL.please explain if the above statement is true of false?
BHOJARAM
911
views
BHOJARAM
asked
Dec 13, 2021
Theory of Computation
theory-of-computation
context-free-language
normal
self-doubt
+
–
0
votes
0
answers
126
https://www.cs.utexas.edu/~lorenzo/corsi/cs372/06F/hw/3sol.html
https://www.cs.utexas.edu/~lorenzo/corsi/cs372/06F/hw/3sol.html Here, in problem 2: In solution, point number 2 should be: With 4-byte entries in the page table we can reference 2^34 pages. Since each page is 2^13 B long, the ... B (assuming no protection bits are used). REASON: 2^36/ 2^2 = 2^34, please correct me if I am wrong.
https://www.cs.utexas.edu/~lorenzo/corsi/cs372/06F/hw/3sol.html Here, in problem 2:In solution, point number 2 should be: With 4-byte entries in the page table we can ref...
ankit3009
387
views
ankit3009
asked
Dec 10, 2021
Operating System
multilevel-paging
operating-system
virtual-memory
self-doubt
paging
+
–
0
votes
2
answers
127
Calculus self doubt
Calculus looks difficult for me. Any resources to learn calculus for GATE
Calculus looks difficult for me. Any resources to learn calculus for GATE
kabilan45
536
views
kabilan45
asked
Nov 25, 2021
Calculus
engineering-mathematics
calculus
self-doubt
+
–
1
votes
0
answers
128
Page Table Entries in page Table
In Page Table,page-frame address entries are static or Dynamic means whether they are changed or not??(Consider 1-level page table)
In Page Table,page-frame address entries are static or Dynamic means whether they are changed or not??(Consider 1-level page table)
lalitver10
578
views
lalitver10
asked
Oct 21, 2021
Operating System
operating-system
memory-management
virtual-memory
self-doubt
+
–
1
votes
3
answers
129
Self Doubt:Paging
I have read that paging does not suffer from external fragmentation as the frames and the pages are all of the equal sizes, but when we store a last level page table in a frame at that time it may not fully occupy the frame. Similarly, if ... exceed a page size. Then there should be external fragmentation, right? So why is it said that paging does not have external fragmentation?
I have read that paging does not suffer from external fragmentation as the frames and the pages are all of the equal sizes, but when we store a last level page table in a...
Hirak
1.7k
views
Hirak
asked
Jun 13, 2019
Operating System
memory-management
paging
operating-system
multilevel-paging
self-doubt
+
–
2
votes
2
answers
130
Theory of Computation: Context Free Languages
Hi, I am having a doubt understanding the result of CFL - Regular: Here's my approach: CFL - Regular = CFL INTERSECTION Regular' = CFL INTERSECTION Regular = CFL Suppose some CFL L1= {a^n b^n | n>=1} and some Regular R1= (a+b)* ... to say CFL - Regular = Regular or CFL - Regular = CFL ? If both are separate options, which one should I go for? Thanks
Hi, I am having a doubt understanding the result of CFL – Regular:Here’s my approach:CFL – Regular = CFL INTERSECTION Regular’ = CFL INTERSECTION Regular = CFLSup...
DukeThunders
414
views
DukeThunders
asked
Jun 9, 2019
Theory of Computation
theory-of-computation
context-free-language
self-doubt
+
–
3
votes
1
answer
131
asymptotic_Notations Self_Doubt
Please give an example case for which all the three conditions $f(n)\neq O(g(n))$, $f(n)\neq \Theta (g(n))$ and $f(n)\neq \Omega (g(n))$ holds true.
Please give an example case for which all the three conditions$f(n)\neq O(g(n))$,$f(n)\neq \Theta (g(n))$ and$f(n)\neq \Omega (g(n))$holds true.
Satbir
1.4k
views
Satbir
asked
Jun 1, 2019
Algorithms
asymptotic-notation
self-doubt
algorithms
+
–
0
votes
1
answer
132
RISC JUMP INSTRUCTION SELF DOUBT
Why can’t we keep target32 address in the 32 bit registers of the RISC instruction? Why is it have to be t J target26 instead of J target32 ?
Why can’t we keep target32 address in the 32 bit registers of the RISC instruction? Why is it have to be tJ target26 instead of J target32 ?
Gitika Babbar
360
views
Gitika Babbar
asked
May 26, 2019
CO and Architecture
co-and-architecture
self-doubt
+
–
0
votes
1
answer
133
Self Doubt about ME Test Series
Are comparison charts of Made easy genuine? And say now if my rank is 3 in a test and after sometime if someone scores more than me will my rank get shifted to 4?
Are comparison charts of Made easy genuine?And say now if my rank is 3 in a test and after sometime if someone scores more than me will my rank get shifted to 4?
Hirak
641
views
Hirak
asked
May 25, 2019
GATE
made-easy-test-series
self-doubt
general
+
–
0
votes
0
answers
134
Self Doubt :automata
Is Mealy machine and Moore Machine in syllabus?
Is Mealy machine and Moore Machine in syllabus?
Hirak
301
views
Hirak
asked
May 22, 2019
Theory of Computation
syllabus
self-doubt
+
–
2
votes
2
answers
135
Self Doubt-Programming
Can someone explain the output of this code? and what (char*) is doing actually? #include<stdio.h> struct Ournode{ char x, y, z; }; int main() { struct Ournode p={'1', '0', 'a'+2}; struct Ournode *q=&p; printf("%c, %c", '*((char*)q+1)', '*((char*)q+2)'); return 0; }
Can someone explain the output of this code? and what (char*) is doing actually?#include<stdio.h struct Ournode{ char x, y, z; }; int main() { struct Ournode p={'1', '0',...
srestha
975
views
srestha
asked
May 13, 2019
Programming in C
programming-in-c
output
self-doubt
+
–
0
votes
1
answer
136
Self Doubt : Regarding TLB entry for a page not present in memory
If a page is not present in the memory, then its corresponding entry in the page table would have the ‘Present’ bit set as 0 to indicate , the page is not present. Will this entry be considered for caching in TLB? As I understand from above line in Tanenbaum, The entry should not be present in TLB. Is my understanding right?
If a page is not present in the memory, then its corresponding entry in the page table would have the ‘Present’ bit set as 0 to indicate , the page is not present.Wil...
Mayank0343
573
views
Mayank0343
asked
May 8, 2019
Operating System
self-doubt
operating-system
translation-lookaside-buffer
+
–
0
votes
0
answers
137
POSET self doubt
What is dual of a POSET?
What is dual of a POSET?
aditi19
486
views
aditi19
asked
Apr 27, 2019
Set Theory & Algebra
lattice
self-doubt
set-theory&algebra
relations
partial-order
+
–
0
votes
0
answers
138
turing machine self doubt a+b=c
Turing machine, language A = {a+b=c | a, b, c are sequences of 1's; |c| = |a| + |b|; |a| >= 0 and |b| > 0}.
Turing machine,language A = {a+b=c | a, b, c are sequences of 1's; |c| = |a| + |b|; |a| >= 0 and |b| 0}.
manisha11
271
views
manisha11
asked
Apr 27, 2019
Theory of Computation
theory-of-computation
self-doubt
+
–
0
votes
1
answer
139
Self doubt - Programming
X=2; Y=++x * ++x * ++x ; Printf("%d",Y); In the above question, we have to use the final value of x or it will be evaluated seperately and then multiplied. Ex: Y= 3*4*5; or Y=5*5*5;
X=2;Y=++x * ++x * ++x ;Printf("%d",Y);In the above question, we have to use the final value of x or it will be evaluated seperately and then multiplied.Ex: Y= 3*4*5; or Y...
Ashish Roy 1
608
views
Ashish Roy 1
asked
Apr 11, 2019
Programming in C
self-doubt
programming-in-c
output
+
–
1
votes
1
answer
140
Algorithm Time Complexity-Self Doubt
What is the best case and worst case of the algorithm? And when will best case and worst case will happen?? int main() { for(i=1 ; i<=n ; i++) { if(n%i == 0) { for(j=1 ; j<=n ; j++) { printf("Hello"); } } } }
What is the best case and worst case of the algorithm? And when will best case and worst case will happen??int main() { for(i=1 ; i<=n ; i++) { if(n%i == 0) { for(j=1 ; j...
sumitr
1.3k
views
sumitr
asked
Apr 10, 2019
Algorithms
algorithms
time-complexity
self-doubt
+
–
0
votes
0
answers
141
#SELF DOUBT(WEAK ENTITY IN DBMS)
Can a weak entity depend on more than one strong entity?If yes then how does that exaclty work?
Can a weak entity depend on more than one strong entity?If yes then how does that exaclty work?
codingo1234
248
views
codingo1234
asked
Apr 8, 2019
Databases
databases
self-doubt
+
–
0
votes
0
answers
142
self doubt
In this Question , it is said that S is serializable .. so if S is conflict serializable then the precedence graph will be acyclic and we can use Topological sort to get a serial schedule, but what if the graph is not conflict serializable and is view serializable, ... use topological sort to get a serial schedule .. then how come the answer is (A). Topological sort .. Please Help!!
In this Question , it is said that S is serializable….. so if S is conflict serializable then the precedence graph will be acyclic and we can use Topological sort to ge...
_Bash_
281
views
_Bash_
asked
Apr 5, 2019
Databases
self-doubt
databases
+
–
0
votes
0
answers
143
self doubt
What is the correct answer of this Question and what are the Minimized tables ???
What is the correct answer of this Question and what are the Minimized tables ???
_Bash_
451
views
_Bash_
asked
Apr 4, 2019
Databases
self-doubt
er-diagram
+
–
0
votes
0
answers
144
self doubt
In this answer, how is the number of conflict equivalent schedule equal to T1->T2 equal to 1(How is it being calculated). And how is the number of conflict equivalent schedule equal to T2->T1 being calculated??It is very confusing please Help!!!!!
In this answer, how is the number of conflict equivalent schedule equal to T1->T2 equal to 1(How is it being calculated). And how is the number of conflict equivalent sch...
_Bash_
484
views
_Bash_
asked
Apr 2, 2019
Databases
conflict-serializable
databases
self-doubt
+
–
0
votes
0
answers
145
Turing Machine: Self doubt
What is the difference between Turing recognizable language and Turing decidable language? Please someone explain me clearly the concept
What is the difference between Turing recognizable language and Turing decidable language?Please someone explain me clearly the concept
Ritabrata Dey
328
views
Ritabrata Dey
asked
Mar 26, 2019
Theory of Computation
self-doubt
+
–
0
votes
0
answers
146
Gate2020
Can anyone please suggest me what is the best youtube video lecture series on C programming for gate.
Can anyone please suggest me what is the best youtube video lecture series on C programming for gate.
Ritabrata Dey
493
views
Ritabrata Dey
asked
Mar 24, 2019
GATE Application
self-doubt
+
–
0
votes
0
answers
147
Discrete mathematics
If adjacency matrix of 2 graphs are same, then can we say that those 2 graphs are isomorphic?
If adjacency matrix of 2 graphs are same, then can we say that those 2 graphs are isomorphic?
Ritabrata Dey
273
views
Ritabrata Dey
asked
Mar 22, 2019
GATE Application
self-doubt
discrete-mathematics
+
–
0
votes
0
answers
148
Discrete Mathematics
I doubt Whether (a,b)R(b,c) is symmetric or antisymmetric or reflexive relation And how to approach this type of sums?
I doubtWhether (a,b)R(b,c) is symmetric or antisymmetric or reflexive relationAnd how to approach this type of sums?
Ritabrata Dey
336
views
Ritabrata Dey
asked
Mar 21, 2019
GATE Application
self-doubt
discrete
discrete-mathematics
+
–
0
votes
1
answer
149
Self Doubt
How to prepare for BARC exam and how many marks required to confirm interview call from the previous cutoff’s. Thankyou.
How to prepare for BARC exam and how many marks required to confirm interview call from the previous cutoff’s.Thankyou.
iamdeepakji
615
views
iamdeepakji
asked
Feb 16, 2019
Others
general
self-doubt
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register