Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by mcjoshi
7
votes
41
output of c program
341
views
answered
Dec 17, 2016
3
votes
42
partion of vertex
269
views
answered
Dec 16, 2016
Graph Theory
bipartite-graph
graph-theory
+
–
9
votes
43
L={⟨M⟩|TM accepts exactly 154 strings}
L={⟨M⟩|TM accepts exactly 154 strings} -------------------------------------------------------------------------------------------------------- this language is not decidable but is this R.E?? by second rice theorem, Tyes ={154 strings} and Tno = more than 154 strings hence, Tyes is subset of Tno.so,it is not even R.E. am i right? please correct me.
L={⟨M⟩|TM accepts exactly 154 strings} this language is not decidable but is this R.E??by second rice theorem, Tyes ={154 strings} and Tno = more than 154 ...
797
views
answered
Dec 16, 2016
Theory of Computation
theory-of-computation
rice-theorem
decidability
+
–
9
votes
44
MadeEasy Test Series: Theory Of Computation - Identify Class Language
Finite language Regular DCFL CFL but not DCFL Acc. to solution c) but I think the answer should be b). Here's the reasoning: We're looking for anbmcn $\cap$ axby (x not equal to y) => bm $\cap$ bn (n not equal to 0).
Finite languageRegularDCFLCFL but not DCFLAcc. to solution c) but I think the answer should be b). Here's the reasoning:We're looking for anbmcn $\cap$ axby (x not equa...
401
views
answered
Dec 16, 2016
Theory of Computation
made-easy-test-series
theory-of-computation
identify-class-language
+
–
2
votes
45
Made Easy Work Book
The regular expression $0(0+1)^*0$ is equivalent to (a) $0(0+1)^*(0+00) $ (b) $0 (0+1)^*00$ (c) $00(0+1)^*00$ (d) None of the above
The regular expression $0(0+1)^*0$ is equivalent to(a) $0(0+1)^*(0+00) $ (b) $0 (0+1)^*00$(c) $00(0+1)^*00$ (d) None of the above
592
views
answered
Dec 2, 2016
Theory of Computation
regular-expression
+
–
80
votes
46
GATE CSE 2005 | Question: 50
Let $G(x) = \frac{1}{(1-x)^2} = \sum\limits_{i=0}^\infty g(i)x^i$, where $|x| < 1$. What is $g(i)$? $i$ $i+1$ $2i$ $2^i$
Let $G(x) = \frac{1}{(1-x)^2} = \sum\limits_{i=0}^\infty g(i)x^i$, where $|x| < 1$. What is $g(i)$?$i$$i+1$$2i$$2^i$
8.3k
views
answered
Dec 1, 2016
Combinatory
gatecse-2005
normal
generating-functions
+
–
2
votes
47
past gate question
$\lim_{n \to \infty } \frac{10^{n}+n^{20}}{n!} = 0$ Please explain how
$\lim_{n \to \infty } \frac{10^{n}+n^{20}}{n!} = 0$ Please explain how
419
views
answered
Dec 1, 2016
4
votes
48
Pointers
2.5k
views
answered
Dec 1, 2016
Programming in C
pointers
programming-in-c
+
–
3
votes
49
Previous gate question
$\lim_{x\rightarrow infinity } \frac{x+sinx}{x}$
$\lim_{x\rightarrow infinity } \frac{x+sinx}{x}$
437
views
answered
Dec 1, 2016
4
votes
50
Modulo
What will be the remainder when $\large 6457^{76^{57}}$ is divided by $\large 23$ ?
What will be the remainder when $\large 6457^{76^{57}}$ is divided by $\large 23$ ?
1.2k
views
answered
Dec 1, 2016
Quantitative Aptitude
modular-arithmetic
+
–
2
votes
51
Toc RLG to LLG
Construct right-linear grammar and left-linear grammar for the language L ={anbm : n$\geq$2 , m$\geq$3} Explanation about this....???
Construct right-linear grammar and left-linear grammar for the languageL ={anbm : n$\geq$2 , m$\geq$3}Explanation about this....???
1.9k
views
answered
Dec 1, 2016
Theory of Computation
theory-of-computation
gatebook-toc
+
–
4
votes
52
TIFR-2015-Maths-B-5
Let $n \geq 1$ and let $A$ be an $n \times n$ matrix with real entries such that $A^{k}=0$, for some $k \geq 1$. Let $I$ be the identity $n \times n$ matrix. Then. $I+A$ need not be invertible. Det $(I+A)$ can be any non-zero real number. Det $(I+A) = 1$ $A^{n}$ is a non-zero matrix.
Let $n \geq 1$ and let $A$ be an $n \times n$ matrix with real entries such that $A^{k}=0$, for some $k \geq 1$. Let $I$ be the identity $n \times n$ matrix. Then.$I+A$ n...
954
views
answered
Dec 1, 2016
Linear Algebra
tifrmaths2015
linear-algebra
matrix
+
–
74
votes
53
GATE IT 2004 | Question: 87
A TCP message consisting of $2100$ $bytes$ is passed to IP for delivery across two networks. The first network can carry a maximum payload of $1200$ $bytes$ per frame and the second network can carry a maximum payload of $400$ $bytes$ per frame, excluding ... second network for this transmission? $\text{40 bytes}$ $\text{80 bytes}$ $\text{120 bytes}$ $\text{160 bytes}$
A TCP message consisting of $2100$ $bytes$ is passed to IP for delivery across two networks. The first network can carry a maximum payload of $1200$ $bytes$ per frame an...
19.5k
views
answered
Dec 1, 2016
Computer Networks
gateit-2004
computer-networks
network-flow
normal
+
–
5
votes
54
What is the time complexity of t(n)=t(n-1)+√(n-1)
What is the time complexity of T(n)=T(n-1)+√(n-1)
What is the time complexity of T(n)=T(n-1)+√(n-1)
1.3k
views
answered
Dec 1, 2016
Algorithms
algorithms
time-complexity
recurrence-relation
+
–
1
votes
55
Perimeter
Find the sum of the perimeters of all the rectangles with integral sides whose area is 216 sq. units.
Find the sum of the perimeters of all the rectangles with integral sides whose area is 216 sq. units.
930
views
answered
Dec 1, 2016
6
votes
56
Digital doubt
366
views
answered
Nov 14, 2016
Digital Logic
digital-logic
+
–
5
votes
57
paging scheme
249
views
answered
Nov 13, 2016
4
votes
58
row major address calculation in c
what is simple formula of address calculation in 1)row major order 2)column major order i think it should be simple enough as we have to just see the differerence from base address and what about if some negative subscripts are given like a[12,-5} is it possible for an array to have negative subscript
what is simple formula of address calculation in 1)row major order2)column major order i think it should be simple enough as we have to just see the differerence ...
2.4k
views
answered
Nov 13, 2016
8
votes
59
Time complexity
Consider the following program: for(i=0;i<=n;i++) for(i=0;i<=n;i++) for(i=0;i<=n;i++) print(GO); What is TC for above program??
Consider the following program:for(i=0;i<=n;i++) for(i=0;i<=n;i++) for(i=0;i<=n;i++) print(GO);What is TC for above program??
462
views
answered
Nov 12, 2016
Algorithms
time-complexity
+
–
6
votes
60
OS-Process State Diagram
1.7k
views
answered
Nov 12, 2016
6
votes
61
Time Complexity
801
views
answered
Nov 10, 2016
Algorithms
algorithms
time-complexity
test-series
+
–
5
votes
62
Time Complexity
266
views
answered
Nov 10, 2016
Algorithms
time-complexity
recurrence-relation
test-series
+
–
8
votes
63
Recurrence
307
views
answered
Nov 10, 2016
Algorithms
algorithms
time-complexity
recurrence-relation
test-series
+
–
3
votes
64
Minimum number of states
What is the No of states in Min.DFA on $ E={0,1,2} $which accepts the ternary no whose equivalent is divisible by $9?$
What is the No of states in Min.DFA on $ E={0,1,2} $which accepts the ternary no whose equivalent is divisible by $9?$
630
views
answered
Nov 10, 2016
Theory of Computation
finite-automata
theory-of-computation
+
–
4
votes
65
No of states required to accept the empty language?
2.0k
views
answered
Nov 10, 2016
3
votes
66
Gate Compiler Runtime Administration
In Storage allocation strategies the following strategies are there : 1)Static Allocation 2)Stack Allocation 3)Heap Allocation What is the difference among all three?
In Storage allocation strategies the following strategies are there :1)Static Allocation2)Stack Allocation3)Heap AllocationWhat is the difference among all three?
4.3k
views
answered
Nov 10, 2016
Compiler Design
compiler-design
runtime-environment
+
–
3
votes
67
ME-Practice Book Discrete Math Q#93
370
views
answered
Nov 10, 2016
Combinatory
combinatory
made-easy-booklet
+
–
4
votes
68
Compiler Construction
Consider the following code which computes the inner product of 2 vectors: prod := 0; i := 1; repeat { prod := prod + a[i] * b[i] i = i+1; until i >20 } Below is possible IR for this program : 1) prod := 0 2) i :=1 3) t1 :=4*i 4) ... i+1 11) i :=t7 12) if i<=20 goto (3) 13) .. Create Basic Blocks and the control Flow Graph and also show any Optimizatioions.If you Find.
Consider the following code which computes the inner product of 2 vectors:prod := 0;i := 1;repeat{prod := prod + a[i] * b[i]i = i+1;until i >20}Below is possible IR for t...
4.4k
views
answered
Nov 10, 2016
Compiler Design
compiler-design
code-optimization
+
–
Page:
« prev
1
2
3
4
5
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register