Register

Recent questions tagged self-doubt

0 votes
1 answer
61
Operating System
In Dining philosopher's problem, there are 8 number of diners and X number of chopsticks. What is the minimum value of X which ensures that therewill be no deadlock Note: Even number philosopher takes left fork first and odd number philosopher takes right fork first.
In Dining philosopher's problem, there are 8 number of diners and X number of chopsticks. What is the minimum value of X which ensures that therewill be no deadlock Note:...
User Avatar
0 votes
4 answers
62
Self Doubt
A recursion program without a terminating condition will provide infinite output. True/False?
A recursion program without a terminating condition will provide infinite output. True/False?
User Avatar
0 votes
1 answer
63
Operating System
When a page is referred for the first time, then it will be counted in page fault or not?. E.g page reference 1,2,3,4,2,1. LRU is used with 3 frames(initially empty).
When a page is referred for the first time, then it will be counted in page fault or not?.E.g page reference 1,2,3,4,2,1.LRU is used with 3 frames(initially empty).
User Avatar
0 votes
1 answer
64
Set Theory, Basic | Power of a set
Given set A= {a,b}$^3$ What do the formed set look like and what is |A| (cardinility of A)
Given set A= {a,b}$^3$What do the formed set look like and what is |A| (cardinility of A)
User Avatar
0 votes
1 answer
65
Programming
Why nothing is printed for %c.
Why nothing is printed for %c.
User Avatar
0 votes
0 answers
67
Self Doubt
A relation R1 : aRb iff (a congruent b) modulo 5 and relation R2 : aRb iff (a congruent b modulo 7). What will be R1 U R2 ?
A relation R1 : aRb iff (a congruent b) modulo 5 and relation R2 : aRb iff (a congruent b modulo 7). What will be R1 U R2 ?
User Avatar
0 votes
0 answers
68
Self Doubt
Question: How NullSpace of the matrix A and the uniqueness of the solution of Ax=b are related ??
Question: How NullSpace of the matrix A and the uniqueness of the solution of Ax=b are related ??
User Avatar
1 votes
1 answer
70
Self doubt
How to do this Boolean multiplication? And which Boolean law is applicable here ? ( P' + Q ) ( Q' + P )
How to do this Boolean multiplication? And which Boolean law is applicable here ?( P' + Q ) ( Q' + P )
User Avatar
1 votes
0 answers
72
self doubt
Any attribute(s) determining a prime attribute, automatically becomes a prime(s) attribute True or false
Any attribute(s) determining a prime attribute, automatically becomes a prime(s) attributeTrue or false
User Avatar
0 votes
0 answers
74
General question(Not CS)
How to upload image while asking GO question? It asks for URL mandatorily. If the image is from personal laptop, how to give URL?
How to upload image while asking GO question? It asks for URL mandatorily. If the image is from personal laptop, how to give URL?
User Avatar
0 votes
0 answers
75
Toc-Self Doubt
Can anyone explain what is the meaning of saying set of some languages is another language. Ex: L1,L2,L3.....Ln are some languages then i define L={L1,L2,L3.....Ln} which is set of languages . If i say L is regular Does it mean L1,l2,l3...Ln are regular.
Can anyone explain what is the meaning of saying set of some languages is another language.Ex: L1,L2,L3.....Ln are some languages then i define L={L1,L2,L3.....Ln} which ...
User Avatar
0 votes
0 answers
77
KMaps - Digital Logic (self doubt)
I’m taking for an example kmaps for 3 var A’B’ A’B AB AB’ C’ 0 1 3 2 C 4 5 7 6 (probably here we are taking CAB’ = 6 and below like AB’C =5 ) A’B’ A’B AB AB’ C’ 0 2 6 4 C 1 3 7 5 But how do i know which one to use and when?
I’m taking for an example kmaps for 3 var A’B’A’BABAB’C’ 0132C4576(probably here we are taking CAB’ = 6and below like AB’C =5 ) A’B’A’BABAB’C’...
User Avatar
0 votes
0 answers
78
selfdoubt
can a relationship have a degree of one if both the entities are same and participating in one form? ex: employee helps employee
can a relationship have a degree of one if both the entities are same and participating in one form?ex: employee helps employee
User Avatar
0 votes
1 answer
79
Indexing in database(Self Doubt)
Can anyone explain in detail about the concepts of sencondary indexing in dbms??
Can anyone explain in detail about the concepts of sencondary indexing in dbms??
User Avatar
3 votes
1 answer
80
Google
$Find \ Time \ Complexity :$ $T(n) =$ $n^{\frac{1}{3}}$ . T($n^{\frac{2}{3}}$) + $\Theta (n)$
$Find \ Time \ Complexity :$ $T(n) =$ $n^{\frac{1}{3}}$ . T($n^{\frac{2}{3}}$) + $\Theta (n)$
User Avatar
0 votes
0 answers
82
Theory of computation
Can finite automata do multiplication.
Can finite automata do multiplication.
User Avatar
0 votes
1 answer
83
Theory of Computation
Difference between L1 and L2 ??
Difference between L1 and L2 ??
User Avatar
1 votes
1 answer
84
Theory of Computation
State True or False. All Linear languages are non-deterministic context free language.
State True or False. All Linear languages are non-deterministic context free language.
User Avatar
0 votes
1 answer
86
SelfDoubt
During the instruction fetch does the program counter increment in the same clock cycle or it take next clock cycle
During the instruction fetch does the program counter increment in the same clock cycle or it take next clock cycle
User Avatar
1 votes
0 answers
88
Set Theory
If A = {1, 3,5,7,.......} Then (A, +) is semi group or not. Doubt : a +(b+c) =( a + b) +c So associativity property is present But a + b doesn't belong to A So closure property is not present. So A is semi group or not.
If A = {1, 3,5,7,.......}Then (A, +) is semi group or not. Doubt :a +(b+c) =( a + b) +cSo associativity property is present But a + b doesn't belong to ASo closure prop...
User Avatar
0 votes
0 answers
89
postfix expression
I want to know which evaluation is wrong here: a-b-c = ab-c- or a-b-c = abc- – a * b *c = ab*c* a*b*c = abc** 3 . a+b-c = ab+c- a+b-c = abc-+
I want to know which evaluation is wrong here:a-b-c = ab-c- or a-b-c = abc- –a * b *c = ab*c* a*b*c = abc 3 . a+b-c = ab+c- a+b-c = ...
User Avatar
0 votes
1 answer
90
Data Structure
Can we determine unique tree by Inorder and level order traversal .
Can we determine unique tree by Inorder and level order traversal .
User Avatar
Page: