Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
2018
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by 2018
1
votes
1
theory of computation
Eliminate all Null -productions from S $\rightarrow$ AaB | aaB, A $\rightarrow$ Null B $\rightarrow$ bbA |Null.
Eliminate all Null -productions fromS $\rightarrow$ AaB | aaB,A $\rightarrow$ NullB $\rightarrow$ bbA |Null.
340
views
answered
Apr 5, 2017
Theory of Computation
theory-of-computation
grammar
+
–
1
votes
2
theory of computation
I guess the Language , L = { } ...please verify ...
I guess the Language , L = { } ...please verify ...
346
views
answered
Apr 5, 2017
Theory of Computation
theory-of-computation
grammar
+
–
3
votes
3
Gate math book
Find the sum of n terms of the series $log a+ log \frac{a^{2}}{b} + log \frac{a^{3}}{b^{2}}+ ...$ to n terms
Find the sum of n terms of the series$log a+ log \frac{a^{2}}{b} + log \frac{a^{3}}{b^{2}}+ ...$ to n terms
701
views
answered
Apr 5, 2017
Mathematical Logic
engineering-mathematics
+
–
1
votes
4
theory of computation
Let L = {anbn : n ≥ 0}...Is complement of the language L , DCFL or not ??? please explain your answer ...I feel it is a DCFL ...
Let L = {anbn : n ≥ 0}...Is complement of the language L , DCFL or not ??? please explain your answer ...I feel it is a DCFL ...
407
views
answered
Apr 5, 2017
Theory of Computation
theory-of-computation
regular-expression
context-free-language
+
–
0
votes
5
#hpsc asst professor
A set of techniques that allow to execute a program which is not entirely in memory is? a-demand paging b-virtual memory c-auxilary memory d-secondary memory
A set of techniques that allow to execute a program which is not entirely in memory is?a-demand pagingb-virtual memoryc-auxilary memoryd-secondary memory
540
views
answered
Apr 5, 2017
0
votes
6
theory of computation
Let L = {anblak: n = l or l ≠ k}. The language is A) regular B) DCFL but not regular. C) NDCFL but not DCFL. D) context sensitive but not CFL. The Option is C) right ...??? Please verify ...
Let L = {anblak: n = l or l ≠ k}. The language is A) regular B) DCFL but not regular.C) NDCFL but not DCFL.D) context sensitive but not CFL.The Option is C) right ...??...
423
views
answered
Apr 4, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
4
votes
7
theory of computation
L = {an: n is either prime or the product of two or more prime numbers}, This language is regular ...right ? Please verify ... The equivalent language is L = { an ; n >= 2 } ...right ?
L = {an: n is either prime or the product of two or more prime numbers},This language is regular ...right ? Please verify ...The equivalent language is L = { an ; n >= 2 ...
577
views
answered
Apr 4, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
21
votes
8
ISI 2004 MIII
A club with $x$ members is organized into four committees such that each member is in exactly two committees, any two committees have exactly one member in common . Then $x$ has exactly two values both between $4$ and $8$. exactly one value and this lies between $4$ and $8$. exactly two values both between $8$ and $16$. exactly one value and this lies between $8$ and $16$.
A club with $x$ members is organized into four committees such that each member is in exactly two committees,any two committees have exactly one member in common .Then $x...
1.6k
views
answered
Apr 4, 2017
Combinatory
combinatory
isi2004
+
–
10
votes
9
ISI2004-MIII
The equation $\frac{1}{3}+\frac{1}{2}s^{2}+\frac{1}{6}s^{3}=s$ has exactly three solution in $[0.1]$ exactly one solution in $[0,1]$ exactly two solution in $[0,1]$ no solution in $[0,1]$
The equation $\frac{1}{3}+\frac{1}{2}s^{2}+\frac{1}{6}s^{3}=s$hasexactly three solution in $[0.1]$exactly one solution in $[0,1]$exactly two solution in $[0,1]$no solu...
631
views
answered
Apr 3, 2017
Set Theory & Algebra
isi2004
polynomials
+
–
1
votes
10
ISI 2004 MIII
$Q8$ If $\alpha_{1},\alpha_{2},\alpha_{3}, \dots , \alpha_{n}$ be the roots of $x^{n}+1=0$, then $\left ( 1-\alpha_{1} \right )\left ( 1-\alpha_{2} \right ) \dots \left ( 1-\alpha_{n} \right )$ is equal to $1$ $0$ $n$ $2$
$Q8$ If $\alpha_{1},\alpha_{2},\alpha_{3}, \dots , \alpha_{n}$ be the roots of $x^{n}+1=0$, then $\left ( 1-\alpha_{1} \right )\left ( 1-\alpha_{2} \right ) \dots \left (...
440
views
answered
Apr 3, 2017
Set Theory & Algebra
isi2004
polynomials
+
–
0
votes
11
tanenbaum
An upper-layer packet is split into 10 frames, each of which has an 80% chance of arriving undamaged. If no error control is done by the data link protocol, how many times must the message be sent on average to get the entire thing through? how is it different if we use error control ?
An upper-layer packet is split into 10 frames, each of which has an 80% chance of arrivingundamaged. If no error control is done by the data link protocol, how manytimes ...
325
views
answered
Apr 1, 2017
Computer Networks
computer-networks
tanenbaum
+
–
1
votes
12
deterministic and non deterministic push down automata
Which of the following is accepted by an NDPDM but not by DPDM a)All strings in which a given symbol is present at least twice b)Even length palindromes c)Strings ending with a particular terminal d)Odd length palindromes
Which of the following is accepted by an NDPDM but not by DPDMa)All strings in which a given symbol is present at least twiceb)Even length palindromesc)Strings ending w...
11.2k
views
answered
Apr 1, 2017
0
votes
13
From a Question bank
410
views
answered
Mar 30, 2017
Calculus
calculus
limits
engineering-mathematics
+
–
1
votes
14
MIT Course
For each group of functions, sort the functions in increasing order of asymptotic (big-O) complexity: ... its an exponential function, but since the power is to 1.000001, it is growing very slowly, since base is tending to 1 only. Someone please check this.
For each group of functions, sort the functions in increasing order of asymptotic (big-O) complexity:$\begin{align*} &(a) \;\;f1(n) = n^{0.999999} * \log n \\ &(b) \;\;f2...
7.0k
views
answered
Mar 22, 2017
Algorithms
time-complexity
algorithms
mit-quiz
+
–
0
votes
15
Peter Linz Exercise 4.3
447
views
answered
Mar 18, 2017
Theory of Computation
theory-of-computation
regular-language
pumping-lemma
+
–
0
votes
16
set theory and algebra
424
views
answered
Mar 14, 2017
Set Theory & Algebra
set-theory&algebra
engineering-mathematics
discrete-mathematics
set-theory
+
–
0
votes
17
typedef
typedef int (*test)(float*, float*); test tmp; i am unable to understand the code ,please help!
typedef int (*test)(float*, float*);test tmp; i am unable to understand the code ,please help!
1.4k
views
answered
Mar 14, 2017
1
votes
18
geeksforgeeks Computer NEtwork IP adressing
My answer is 255.255.255.224 but answer given there was A
My answer is 255.255.255.224 but answer given there was A
1.6k
views
answered
Mar 14, 2017
Computer Networks
computer-networks
ip-addressing
+
–
16
votes
19
GATE CSE 2017 Set 1 | Question: GA-1
After Rajendra Chola returned from his voyage to Indonesia, he ________ to visit the temple in Thanjavur. was wishing is wishing wished had wished
After Rajendra Chola returned from his voyage to Indonesia, he ________ to visit the temple in Thanjavur.was wishingis wishingwishedhad wished
7.4k
views
answered
Mar 10, 2017
Verbal Aptitude
gatecse-2017-set1
general-aptitude
verbal-aptitude
tenses
english-grammar
normal
+
–
0
votes
20
graph theory
can somebody explain the logic behind this theorem ?
can somebody explain the logic behind this theorem ?
341
views
answered
Mar 9, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
engineering-mathematics
+
–
2
votes
21
rosen excercise
How many solutions are there to the equation x1 + x2 + x3 + x4 + x5 + x6 = 29, where xi , i = 1, 2, 3, 4, 5, 6, is a nonnegative integer such that a) x1 ≤ 5? b) x1 < 8 and x2 > 8?
How many solutions are there to the equationx1 + x2 + x3 + x4 + x5 + x6 = 29,where xi , i = 1, 2, 3, 4, 5, 6, is a nonnegative integer suchthata) x1 ≤ 5?b) x1 < 8 and x...
1.1k
views
answered
Mar 9, 2017
0
votes
22
algorithm
finf the tc T(n)=nlogn +T(n-1)
finf the tcT(n)=nlogn +T(n-1)
389
views
answered
Mar 9, 2017
Algorithms
algorithms
time-complexity
recurrence-relation
+
–
3
votes
23
ISI 2015 PCB C4 C
For the alphabet Σ = {a,b}, the enumeration of the strings of {a,b}* in the lexicographic order is following {ϵ, a, b, aa, ab, ba, bb, aaa, aab,...} List the fist 5 strings in lexicographic order, in the complement of {a, ab}*
For the alphabet Σ = {a,b}, the enumeration of the strings of {a,b}* in the lexicographic order is following{ϵ, a, b, aa, ab, ba, bb, aaa, aab,...}List the fist 5 stri...
306
views
answered
Mar 9, 2017
Theory of Computation
jsi2015
theory-of-computation
+
–
2
votes
24
ISI 2015 PCB C4 B
Draw a 4-state DFA for the language $L \subseteq$ {a,b}* , L = {x : the number of time ab appears in x is even}
Draw a 4-state DFA for the language $L \subseteq$ {a,b}* , L = {x : the number of time ab appears in x is even}
842
views
answered
Mar 9, 2017
Theory of Computation
theory-of-computation
jsi2015
finite-automata
+
–
0
votes
25
Peter Linz-Chapter 3.1 Regular Expressions
Give regular expression for the complement of the language L = { an bm : n<4, m<=3}
Give regular expression for the complement of the languageL = { an bm : n<4, m<=3}
504
views
answered
Mar 9, 2017
Theory of Computation
theory-of-computation
regular-expression
+
–
0
votes
26
Peter Linz-Chapter 3.1 Regular Expressions
Give regular Expression for the language L={an bm | n≥1, m≥1, nm≥3}
Give regular Expression for the languageL={an bm | n≥1, m≥1, nm≥3}
2.5k
views
answered
Mar 9, 2017
Theory of Computation
theory-of-computation
regular-expression
peter-linz
peter-linz-edition4
+
–
0
votes
27
Peter Linz-Chapter 3.1 Regular Expressions
Give regular expression for all strings over {0,1) not ending in 01.
Give regular expression for all strings over {0,1) not ending in 01.
536
views
answered
Mar 9, 2017
Theory of Computation
theory-of-computation
regular-expression
+
–
1
votes
28
MadeEasy Test Series
Consider the following schedule S : r1(A) w2(A) r3(A) w4(A) r5(A) w6(A) The number of schedules equal to given schedule(s) which not conflict equal to schedule(s) are _______.
Consider the following scheduleS : r1(A) w2(A) r3(A) w4(A) r5(A) w6(A)The number of schedules equal to given schedule(s) which not conflict equal to schedule(s) are _____...
1.1k
views
answered
Mar 8, 2017
Databases
databases
transaction-and-concurrency
+
–
0
votes
29
maximum records in join operation ME mock
Consider the following relation: R (A B C) A primary key with 100 tuples. S (E F G) E primary key with 50 tuples. T (AE D) AE primary key with 80 tuples. U (D G H) H primary key with 10 tuples. The maximum number of possible records in the result of R⋈S⋈T⋈U _______.
Consider the following relation:R (A B C) A primary key with 100 tuples.S (E F G) E primary key with 50 tuples.T (AE D) AE primary key with 80 tuples.U (D G H) H primary ...
635
views
answered
Mar 8, 2017
2
votes
30
ISRO 2013 - Matrices [Mech]
If A is Square Matrix of order 3, then product of A and its transpose is (a) Unit Matrix (b) Zero Matrix (c) Identity Matrix (d) Symmetric Matrix
If A is Square Matrix of order 3, then product of A and its transpose is(a) Unit Matrix(b) Zero Matrix(c) Identity Matrix(d) Symmetric Matrix
1.8k
views
answered
Mar 8, 2017
Linear Algebra
engineering-mathematics
isro-mech
linear-algebra
matrix
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register