2 votes
5
Confusion regarding these log representations.1.(logn)22.log2n3.log(logn)4.log(n)2which of these are equal . Also explain meaning of each one.(Pls provide any source if p...
0 votes
6
1 votes
7
#include<stdio.h>main(){int i=511;char *ptr=(char *)&i;printf("%d",*ptr);}explain...how output came -1????
0 votes
8
L = { a^m b^n b^k d^l |(n+k)=odd only if m=l; m, n, k , l>0}. Which is true?a)CFL but not DCFLb)regular but not CFLc)DCFL but not regulard)none
1 votes
9
1 votes
10
If F(n) = (log n)n then, is F(n) = O(n2) true?Also, what about F(n) = $\Theta$(n2)
0 votes
13
A={<M,w M is a TM that accepts w}B=Ʃ*Is A Mapping reducible to B?http://theory.stanford.edu/~trevisan/cs154-12/reductions3.pdf
1 votes
14
#include<stdio.h>int f(int a){ a 20 ? return 10: return 20;}int main(){int b=fun(20);return 0;}what will be the output of this program ?
3 votes
15
how $\phi \cdot R = R \cdot \phi = \phi$ ? where R is regular expression, and why is $\phi^* is $\epsilon$
4 votes
16
X posed many puzzles about an island that has two kinds of inhabitants knights who always tells the truth, and their opposite knaves, who always lie. You encounter two pe...
4 votes
17
A tridiagonal matrix [-2..2,5..9] is stored in row major order with base address 301.what is the address of data [0][8] if nonzero elements are stored??
1 votes
18
1 votes
19
Is it always the case that implication comes with universal quantifier and conjunction comes with existential quantifier?
3 votes
20
12 votes
21
When two $n$-bit binary numbers are added the sum will contain at the most$n$ bits$n + 2$ bits$n + 3$ bits$n + 1$ bits
4 votes
23
The question basically says no. of different outputs produced for given sequence of input (1,2,...,n)I thought in terms of push - pop pairs but cant arrive at the answer ...
0 votes
24
Is there any simple graph with degree sequence<1,1,1,1,2,2,3,3,3,3>
2 votes
30