Register
Filter

Recent questions without answers

3 votes
0 answers
15003
quick sort..plz tell the algo also
Which of the following cannot be the intermediate sequence if we apply quick sort on 9,8,7,6,5,4,3,2,1? Assume the pivot is always the first element A) 1,8,7,6,5,4,3,2,9 B) 1,2,3,6,5,4,7,8,9 C) 1,2,7,6,5,4,3,8,9 D) 1,2,3,5,4,6,7,8,9
Which of the following cannot be the intermediate sequence if we apply quick sort on 9,8,7,6,5,4,3,2,1?Assume the pivot is always the first elementA) 1,8,7,6,5,4,3,2,9B) ...
User Avatar
0 votes
0 answers
15005
CSL AND CFL
1)L={W$W^{R}WW^{R}/ W\epsilon (0+1)^{+}$ } IS THIS CSL OR CFL. 2)L={$a^{m}b^{n}c^{p}/(m=n) or (n=p)}$ } IS THIS DCFL OR CFL. Please construct PDA for 2nd language. --------------------------------------------------------------------------------- I think 1st is CSL and 2nd is CFL
1)L={W$W^{R}WW^{R}/ W\epsilon (0+1)^{+}$ } IS THIS CSL OR CFL.2)L={$a^{m}b^{n}c^{p}/(m=n) or (n=p)}$ } IS THIS DCFL OR CFL.Please construct PDA for 2nd language. -...
User Avatar
0 votes
0 answers
15006
#logic
Solve this problem?
Solve this problem?
User Avatar
0 votes
0 answers
15010
MadeEasy CN test q28
a. 920,440,440 b. 960,460,440 c. 960,460,460 d. 940,460,460
a. 920,440,440b. 960,460,440c. 960,460,460d. 940,460,460
User Avatar
0 votes
0 answers
15011
NPTEL-Design and Analysis of Algorithms-Week1-Quiz-1-Q6
if T(n) = n2 √ n then T(n) = O(n2) T(n) = O(n2 log n) T(n) = O(n3) None of the above Im getting option 2 is it correct ?
if T(n) = n2 √ n thenT(n) = O(n2)T(n) = O(n2 log n)T(n) = O(n3)None of the aboveIm getting option 2 is it correct ?
User Avatar
0 votes
0 answers
15014
MadeEasy Subject Test: Databases - Joins
Maximum no. of possible records in the result of the following expression is?
Maximum no. of possible records in the result of the following expression is?
User Avatar
0 votes
0 answers
15015
question
Let f(n)= Ω(n), g(n)= O(n) and n(n)= Ѳ(n). Then [f(n). g(n)] + h(n) is: (a) Ω (n) (b) O (n) (c) Ѳ (n) (d) None of these
Let f(n)= Ω(n), g(n)= O(n) and n(n)= Ѳ(n). Then [f(n). g(n)] + h(n) is:(a) Ω (n) (b) O (n)(c) Ѳ (n) (d) None of these
User Avatar
0 votes
0 answers
15017
rice theorem problem
L(M) has at most 10 strings We can have Tyes for ϕ and Tno for Σ∗. Hence, L={M∣L(M) has at most 10 strings} is not Turing decidable (not recursive). problem : It should not b Tyes Σ∗ and Tno for ϕ
L(M)has at most 10 stringsWe can have Tyesfor ϕ and Tno for Σ∗. Hence, L={M∣L(M) has at most 10 strings} is not Turing decidable (not recursive). problem :It should...
User Avatar
1 votes
0 answers
15019
ME Full Syllabus Test 2 Q43
Assume that node I, whose Key is Ki , is a leaf node of a BST 'T' having total noedes greater than 2 and that its parent is node p with Key Kp, then a. Kp is the smallest key greater than Ki b. Kp is the longest key smaller than Ki c. either a or b d. Only a but not b
Assume that node I, whose Key is Ki , is a leaf node of a BST 'T' having total noedes greater than 2 and that its parent is node p with Key Kp, thena. Kp is the smallest ...
User Avatar
0 votes
0 answers
15020
calculus
User Avatar
0 votes
0 answers
15021
ER Model
User Avatar
0 votes
0 answers
15023
data structure
User Avatar
1 votes
0 answers
15024
LOGIC
Only A1 and A3 Only A2 and A3 Only A1 and A2 Neither A1 nor A2 Anyone please suggest some good technique to check the validity of above type logic
Only A1 and A3Only A2 and A3Only A1 and A2Neither A1 nor A2Anyone please suggest some good technique to check the validity of above type logic
User Avatar
1 votes
0 answers
15025
Loop invariants [GateBook]
User Avatar
1 votes
0 answers
15026
Set Counting [GateBook]
User Avatar
1 votes
0 answers
15027
Functions fog, gof [GateBook]
User Avatar
2 votes
0 answers
15029
which one is R.E??
Consider the following languages: L1={0^(2k)│k≥0} L2={b∈{0,1}*│b∈L(Mb] ) } Which of the above languages is TM recognizable? please explain second one
Consider the following languages:L1={0^(2k)│k≥0}L2={b∈{0,1}*│b∈L(Mb] ) }Which of the above languages is TM recognizable?please explain second one
User Avatar
2 votes
0 answers
15030
Floating Point Representation Without Normalization
Mantissa is a pure fraction in signed magnitude form .What is the reprentation of decimal number 12.6255*102 12.6255*23 with Normalization and Without Normalization
Mantissa is a pure fraction in signed magnitude form .What is the reprentation of decimal number12.6255*10212.6255*23with Normalization and Without Normalization
User Avatar
Page: