Register
Filter

Answers by Kapil

3 votes
43
TIFR CSE 2016 | Part B | Question: 5
Consider the recursive function $\mathsf{mc91}$ ... $\{ n: 0 \leq n \leq 110 \}$ $\{ n: 0 \leq n \leq 111 \}$ $\{ n: 0 \leq n < + \infty \}$
Consider the recursive function $\mathsf{mc91}$.int mc91(int n) { print n if (n 100) { return n-10; } else { return mc91(mc91(n+11)); } }Let $\mathsf{Out}=\{n : \text{ t...
9 votes
46
C programming
int func(int n) { if(n<3) return 1; else return func(n-1)+func(n-3)+1; } How many invocations for calculating func(func(5))
int func(int n) { if(n<3) return 1; else return func(n-1)+func(n-3)+1; } How many invocations for calculating func(func(5))
6 votes
47
toc dfa
Minimum Number of states required by a DFA to accept the String (a+b) * a(a+b)(a+b) ?
Minimum Number of states required by a DFA to accept the String (a+b) * a(a+b)(a+b) ?
7 votes
48
DAG compilers
How to find unnecessary production while optimising DAG. for ex- a = b * c d = b e = d * c b = e f = b + c g = f + d How many production need to be removed and how to find them . ?
How to find unnecessary production while optimising DAG. for ex-a = b * c d = b e = d * c b = e f = b + c g = f + dHow many production need to be removed and how to find ...
4 votes
54
#Hashing
Consider a hash table with m slots that uses open addressing with linear probing. The table is initially empty. A key k1 is inserted into the table, followed by keyk2, and then keyk3.What is the probability that the total number of probes while inserting these keys is at least 4?
Consider a hash table with m slots that uses open addressing with linear probing. The table is initially empty. A key k1 is inserted into the table, followed by keyk2, an...
15 votes
55
L= {<TM> | TM halts on every input}
$L=\left \{ <TM> | TM\ halts\ on\ every\ input\ \right \}$ is above language Recursively enumerable or non recursively enumerable??
$L=\left \{ <TM | TM\ halts\ on\ every\ input\ \right \}$is above language Recursively enumerable or non recursively enumerable??
12 votes
56
#compiler
given Grammar E → E + E E → E * E E → ( E ) E → id Find set of handles and viable prefixes for the input string id1 + id2 * id3
given GrammarE → E + EE → E * EE → ( E )E → idFind set of handles and viable prefixes for the input string id1 + id2 * id3
22 votes
57
Tokenization in lexical analysis
Consider the following C program: int main (void) { in/*this is an example*/z; double/*is it an error?*/y; print( “This is simple” ); return 0; } - How many Different tokens are there in the above code.
Consider the following C program: int main (void) { in/*this is an example*/z; double/*is it an error?*/y; print( “This is simple” ); return 0; }- How many Different ...
4 votes
58
Graph
graph of 100 edges and 25 vertices..size of minimum vertex cover is 8..what is the size of maximum independence set?
graph of 100 edges and 25 vertices..size of minimum vertex cover is 8..what is the size of maximum independence set?
12 votes
59
TOC- DFA
Number of states in DFA which accepts the binary strings divisible by 4 or 5. answer?
Number of states in DFA which accepts the binary strings divisible by 4 or 5.answer?
7 votes
61
dpda || Linz 7.3-2
DPDA for $L = \left \{ a^nb^m|m\geq n+2 \right \}$
DPDA for $L = \left \{ a^nb^m|m\geq n+2 \right \}$
12 votes
62
shortest path
Let P be a shortest path from some vertex s to some other vertex t in a directed graph. If the weight of each edge in the graph is increased by one, P will still be a shortest path from s to t. T/F
Let P be a shortest path from some vertex s to some other vertex t in a directed graph. If the weight of each edge in the graph is increased by one, P will still be a sho...
8 votes
63
Given the disk capacity of 50 MB has block size 256 bytes and block/cluster is 8
Given the disk capacity of 50 MB has block size 256 bytes and block/cluster is 8, the number of entries require in the FAT (File Allocation Table) is? 50*212 50*210 50*224 50*22
Given the disk capacity of 50 MB has block size 256 bytes and block/cluster is 8, the number of entries require in the FAT (File Allocation Table) is? 50*212 50*210 50...
9 votes
64
Made-easy
$T(N) = 2T\sqrt{N} + Log\sqrt{N}$ what is the solution of recurrence relation
$T(N) = 2T\sqrt{N} + Log\sqrt{N}$what is the solution of recurrence relation
5 votes
68
ME FLT-1 q29
please explain this anyone
please explain this anyone
9 votes
69
What is the difference ??
Please explain clearly?
Please explain clearly?
Page: