Recent questions without an upvoted answer

0 votes
2 answers
19981
0 votes
0 answers
19983
How to know whether a enumeration method exist or not for a given set to prove it countable?? For example how to know that set of irrational numbers is countable or not.....
2 votes
0 answers
19986
Let G be a 3-regular graph and S be a minimum vertex cut of G with |S| = 5The the size of smallest edge cut of G is _______(A)4(B) 5(C) 6(D) None of the above
0 votes
1 answer
19987
A search was performed on some binary search tree. Which of the following is a valid search sequence?(A) 1, 11, 111, 98, 58, 78, 90, 48, 88(B) 333, 33, 53, 93, 63, 90, 70...
0 votes
0 answers
19988
can someone explain cpu utilization and how to calculate it ?
0 votes
1 answer
19989
1 votes
0 answers
19990
What is the number of Comparison to sort below arrays using quick sort using first element as pivot ?Please show steps .A1=4,1,5,3,2A2=1,2,3,4,5
0 votes
3 answers
19991
0 votes
1 answer
19992
0 votes
0 answers
19993
The minimum size that an array may require to store a binary tree with ‘n’ nodes is _______.A log$2^{log_{2}(n+1)} -1$B 2^{n}-1C n + 1
0 votes
0 answers
19996
what will be the compliment of language L={a^nb^nc^n | n>=1} ?
0 votes
0 answers
19999
There are three passengers in a share auto. There are three more stops ahead for that auto. Consider that each passenger independently and equally like to get down at any...
1 votes
0 answers
20001
0 votes
0 answers
20002
0 votes
0 answers
20003
Which of the following statement are true?1. Computing the most frequently occurring elements in an array a(1....n) can be done in o(nlogn) time.
1 votes
0 answers
20004
how to read/breakdown/understand this query? which part wil be solved first?{t∣t∈πR−S(r)∧∀u∈s(∃v∈r(u=v[S]∧t=v[R−S]))}
0 votes
0 answers
20005
equivalence of nfa is p problem or np problem ?
1 votes
1 answer
20007
0 votes
0 answers
20008
In Engineering Mathematics , In Calculus are the topics "Convergence, Divergence , Partial and total derivatives" included in syllabus?
0 votes
0 answers
20010
Register Indirect Scaled AddressingHow does it work