Register
Filter

Answers by Sanket_

1 votes
41
UGC NET CSE | December 2011 | Part 2 | Question: 7
BCC in the internet refers to Black carbon copy Blind carbon copy Blank carbon copy Beautiful carbon copy
BCC in the internet refers toBlack carbon copyBlind carbon copyBlank carbon copyBeautiful carbon copy
3 votes
42
TESTBOOK Counter modulus
I am getting 6 answer is given 5 Please verify anyone
I am getting 6 answer is given 5 Please verify anyone
2 votes
43
madeeasy
A B C 3 5 NULL 6 NULL 10 NULL 10 5 12 NULL NULL SELECT * FROM R WHERE (A>=5) AND (B>C OR C>=5); NO OF TUPLES RESULTED BY QUERY?
A B C3 5 NULL6 NULL 10NULL 10 512 NULL NULLSELECT * FROM R WHERE (A>=5) AND (B>C OR C>=5);NO OF TUPLES RESULTED BY QUERY?
2 votes
44
Toc
{a(kn)|k>=0 n is fixed digit} minimum no of states in DFA a) k b) n c) k+1 d) n+1
{a(kn)|k>=0 n is fixed digit} minimum no of states in DFAa) kb) nc) k+1d) n+1
3 votes
45
UGC NET CSE | December 2013 | Part 3 | Question: 49
Match the following: ... $\text{a-iii, b-iv, c-i, d-ii}$ $\text{a-iii, b-i, c-iv, d-ii}$
Match the following:$\begin{array}{} {} & {\textbf{List -I}} & {} & {\textbf{List-II}} \\ \text{a.} & \text{Indexed addressing} & \text{i.} & \text{is not used when ...
1 votes
46
sorting
15 randomly generated numbers can be sorted preferably by: heap sort insertion sort bubble sort
15 randomly generated numbers can be sorted preferably by:heap sort insertion sort bubble sort
3 votes
47
UGC NET CSE | December 2014 | Part 3 | Question: 31
Any decision tree that sorts $n$ elements has height $\Omega(n)$ $\Omega(\text{lg}n)$ $\Omega(n \text{lg} n)$ $\Omega(n^2)$
Any decision tree that sorts $n$ elements has height$\Omega(n)$$\Omega(\text{lg}n)$$\Omega(n \text{lg} n)$$\Omega(n^2)$
1 votes
48
what will be the true about given language
L={an bn ; n>=0, n is not multiple of 2} A.) CFL but not DCFL B.) Recursive but not CFL C.) DCFL hence a CFL D.) May or may ot be a CFL
L={an bn ; n>=0, n is not multiple of 2}A.) CFL but not DCFLB.) Recursive but not CFLC.) DCFL hence a CFLD.) May or may ot be a CFL
0 votes
50
regular grammar
If a grammar G is not regular(i.e. neither left linear nor right linear) but G can be transformed into regular grammar G'(i.e. transformed into left or right linear ) ,then can L(G) be regular ?
If a grammar G is not regular(i.e. neither left linear nor right linear) but G can be transformed into regular grammar G'(i.e. transformed into left or right linear ) ,t...
3 votes
52
deadlocks
State True/False: "deadlocks will never occur if resources are requested in the same order."
State True/False:"deadlocks will never occur if resources are requested in the same order."
1 votes
55
TMH
which of the following is the minimum error code ? a)octal b)binary c)Gray d)Excess-3
which of the following is the minimum error code ?a)octal b)binary c)Gray d)Excess-3
1 votes
56
gate 2012
the amount of ROM needed to implement 4 bit multiplier/subtractor/adder/etc
the amount of ROM needed to implement 4 bit multiplier/subtractor/adder/etc
2 votes
62
UGC NET CSE | December 2015 | Part 3 | Question: 27
There are exactly ____ different finite automata with three states $x$, $y$ and $z$ over the alphabet $\{a,b\}$ where $x$ is always the start state $64$ $256$ $1024$ $5832$
There are exactly ____ different finite automata with three states $x$, $y$ and $z$ over the alphabet $\{a,b\}$ where $x$ is always the start state$64$$256$$1024$$5832$
2 votes
63
#Regular Expression
The regular expression 0*(10*)* denotes the same set as (A) (1*0)*1* (B) 0 + (0 + 10)* (C) (0 + 1)* 10(0 + 1)* (D) none of these
The regular expression 0*(10*)* denotes the same set as(A) (1*0)*1*(B) 0 + (0 + 10)*(C) (0 + 1)* 10(0 + 1)*(D) none of these
3 votes
64
regular exp[ression
Which of the following regular expression identities are true ? (A) (r + s)* = r* s* (B) (r + s)* = r* + s* (C) (r + s)* = (r*s*)* (D) r* s* = r* + s*
Which of the following regular expression identities are true ?(A) (r + s)* = r* s*(B) (r + s)* = r* + s*(C) (r + s)* = (r*s*)*(D) r* s* = r* + s*
Page: