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
Recent activity by 2018
6
answers
1
GATE IT 2004 | Question: 77
Consider the following schedule $S$ of transactions $T1$ and $T2:$ ... only as $T2, T1$ $S$ is serializable both as $T1, T2$ and $T2, T1$ $S$ is not serializable either as $T1,T2$ or as $T2,T1$
Consider the following schedule $S$ of transactions $T1$ and $T2:$$${\begin{array}{l|l}\textbf{T1}& \textbf{T2} \\\hline\text{Read(A)} \\\text{A = A – 10}\\& \text...
12.6k
views
commented
Apr 15, 2017
Databases
gateit-2004
databases
transaction-and-concurrency
normal
+
–
0
answers
2
ISI 2013 Subjective
Q C4 b) If it is known that the language L1=$\left \{ 0^{n}1^{n}2^{i}\mid n\neq i \right \}$ is not a context free language (CFL). Now consider the language L2=$\left \{ 0^{i}1^{n}2^{n}\mid i\neq n \right \}$. We ... that L2 is not CFL by converting L2 into L1 by applying two operation, both know to be closed on CFLs. What are two operation you will use for this construction.
Q C4 b) If it is known that the language L1=$\left \{ 0^{n}1^{n}2^{i}\mid n\neq i \right \}$ is not a context free language (CFL). Now consider the language L2=$\left \{...
590
views
commented
Apr 5, 2017
Theory of Computation
isi2013
theory-of-computation
context-free-language
+
–
3
answers
3
combinatorics
THERE ARE 10 PRIZES AND 4 STUDENTS. WE WANT ONLY TWO STUDENTS TO GET THE PRIZES. HOW MANY WAYS ARE THERE??
THERE ARE 10 PRIZES AND 4 STUDENTS. WE WANT ONLY TWO STUDENTS TO GET THE PRIZES. HOW MANY WAYS ARE THERE??
767
views
commented
Apr 5, 2017
Mathematical Logic
discrete-mathematics
combinatory
+
–
5
answers
4
ISRO2014-36
Consider a standard Circular Queue implementation (which has the same condition for Queue Full and Queue Empty) whose size is $11$ and the elements of the queue are $q[0], q[1], \ldots q[10]$. The front and rear pointers are initialized to point at $q[2]$. In which position will the ninth element be added? $q[0]$ $q[1]$ $q[9]$ $q[10]$
Consider a standard Circular Queue implementation (which has the same condition for Queue Full and Queue Empty) whose size is $11$ and the elements of the queue are $q[0]...
8.8k
views
commented
Apr 5, 2017
DS
data-structures
queue
isro2014
+
–
1
answer
5
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.
372
views
commented
Apr 5, 2017
Theory of Computation
theory-of-computation
grammar
+
–
1
answer
6
#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
585
views
commented
Apr 5, 2017
2
answers
7
theory of computation
I guess the Language , L = { } ...please verify ...
I guess the Language , L = { } ...please verify ...
384
views
answered
Apr 5, 2017
Theory of Computation
theory-of-computation
grammar
+
–
3
answers
8
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
745
views
answered
Apr 5, 2017
Mathematical Logic
engineering-mathematics
+
–
2
answers
9
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 ...
436
views
answered
Apr 5, 2017
Theory of Computation
theory-of-computation
regular-expression
context-free-language
+
–
3
answers
10
theory of computation
The language generated by the below grammar is S --> aSS / b
The language generated by the below grammar is S aSS / b
1.6k
views
commented
Apr 5, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
1
answer
11
theory of computation
The language L = {anbm : 2n ≤ m ≤ 3n} is a Non deterministic CFL but not a DCFL right ??? please correct me if i am wrong ...
The language L = {anbm : 2n ≤ m ≤ 3n} is a Non deterministic CFL but not a DCFL right ??? please correct me if i am wrong ...
575
views
answer selected
Apr 5, 2017
Theory of Computation
theory-of-computation
context-free-language
+
–
2
answers
12
ISI 2004 MIII
The inequality $\frac{2-gx+x^{2}}{1-x+x^{2}}\leq 3$ is true for all the value of $x$ if and only if $1\leq g\leq 7$ $-1\leq g\leq 1$ $-6\leq g\leq 7$ $-1\leq g\leq 7$
The inequality $\frac{2-gx+x^{2}}{1-x+x^{2}}\leq 3$ is true for all the value of $x$ if and only if$1\leq g\leq 7$$-1\leq g\leq 1$$-6\leq g\leq 7$$-1\leq g\leq 7$
958
views
commented
Apr 4, 2017
Set Theory & Algebra
isi2004
inequality
+
–
3
answers
13
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.7k
views
commented
Apr 4, 2017
Combinatory
combinatory
isi2004
+
–
3
answers
14
theory of computation
Is the language given below regular or not ? I feel it is regular. The equivalent language is, L = {anblak ; n>=1,l>=1,k>=1 } - { a1b1a1 , a1b1a2 , a1b1a3 , a1b2a1 , a1b2a2 , a1b3a1 and few more strings (but finite number of ... language is regular ... QUESTION TAKEN FROM PETER LINZ TEXTBOOK AND ANSWER WAS NOT GIVEN. So please verify whether i am correct ...???
Is the language given below regular or not ?I feel it is regular.The equivalent language is, L = {anblak ; n>=1,l>=1,k>=1 } - { a1b1a1 , a1b1a2 , a1b1a3 , a1b2a1 , a1...
583
views
answer selected
Apr 4, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
2
answers
15
ISI2004-MIII: 7
The equation $x^{6}-5x^{4}+16x^{2}-72x+9=0$ has exactly two distinct real roots exactly three distinct real roots exactly four distinct real roots six different real roots
The equation $x^{6}-5x^{4}+16x^{2}-72x+9=0$ hasexactly two distinct real rootsexactly three distinct real rootsexactly four distinct real rootssix different real roots
1.9k
views
commented
Apr 4, 2017
Set Theory & Algebra
isi2004
polynomials
maxima-minima
+
–
1
answer
16
ME test
Let f(n) = Ω(n), g(n) = O(n), h(n) = θ(n). Then [ f(n) + g(n)] - h(n) is ______________ ? A) Ω(n2) B) O(n) C) θ(n) D) None
Let f(n) = Ω(n), g(n) = O(n), h(n) = θ(n). Then [ f(n) + g(n)] - h(n) is ______________ ?A) Ω(n2)B) O(n)C) θ(n)D) None
956
views
commented
Apr 4, 2017
Algorithms
algorithms
time-complexity
made-easy-test-series
+
–
2
answers
17
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 ...??...
447
views
commented
Apr 4, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
6
answers
18
GATE CSE 2007 | Question: 63, ISRO2016-59
The order of a leaf node in a $B^+$ - tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is $1K\;\text{bytes}$, data record pointer is $7\;\text{bytes}$ long, the value field is $9\;\text{bytes}$ long and a block pointer is $6 \;\text{bytes}$ long, what is the order of the leaf node? $63$ $64$ $67$ $68$
The order of a leaf node in a $B^+$ - tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is $1K\;\text{bytes}$, data ...
23.7k
views
commented
Apr 4, 2017
Databases
gatecse-2007
databases
b-tree
normal
isro2016
+
–
3
answers
19
GATE CSE 2017 Set 1 | Question: 11
Consider the $C$ struct defined below: struct data { int marks [100]; char grade; int cnumber; }; struct data student; The base address of student is available in register $R1$. The field student.grade can be accessed efficiently using: Post-increment ... mode, $X(R1)$, where $X$ is an offset represented in $2's$ complement $16\text{-bit}$ representation
Consider the $C$ struct defined below:struct data { int marks [100]; char grade; int cnumber; }; struct data student;The base address of student is available in register...
14.6k
views
commented
Apr 4, 2017
CO and Architecture
gatecse-2017-set1
co-and-architecture
addressing-modes
+
–
1
answer
20
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 ...
607
views
answered
Apr 4, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
2
answers
21
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...
674
views
answered
Apr 3, 2017
Set Theory & Algebra
isi2004
polynomials
+
–
1
answer
22
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 (...
470
views
answered
Apr 3, 2017
Set Theory & Algebra
isi2004
polynomials
+
–
0
answers
23
some suggestion from expert and experience people needed? please take yr time and comment here..
AIR-1370 GS:633 CAT: GEN UG: 61%(so no chance in any of IIIT, due to some financial issues i don't want to go with IIIT H) 1.can u please suggest, which college should i apply for? 2.will ... go with BSNL JTO post? 3.if taking worst scenario, is there any chance in top 3 nit or nit allahabad?
AIR-1370GS:633CAT: GENUG: 61%(so no chance in any of IIIT, due to some financial issues i don't want to go with IIIT H)1.can u please suggest, which college should i appl...
327
views
asked
Apr 3, 2017
2
answers
24
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.3k
views
commented
Apr 1, 2017
1
answer
25
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 ...
346
views
answered
Apr 1, 2017
Computer Networks
computer-networks
tanenbaum
+
–
1
answer
26
CFG (Timothy WIlliams)
The following CFG S->aS| bS| a| b is equivalent to the regular expression a)(a*+b)* b)(a+b)+ c)(a+b)(a+b)* d)(a+b)* (a+b)
The following CFG S->aS| bS| a| bis equivalent to the regular expression a)(a*+b)* b)(a+b)+c)(a+b)(a+b)* d)(a+b)* (a+b)
285
views
answer selected
Mar 30, 2017
1
answer
27
theory of computation
The number of prefixes and suffixes respectively in the string "abbab" are ___ and ___ .
The number of prefixes and suffixes respectively in the string "abbab" are ___ and ___ .
979
views
answer selected
Mar 30, 2017
Theory of Computation
theory-of-computation
+
–
1
answer
28
From a Question bank
430
views
answered
Mar 30, 2017
Calculus
calculus
limits
engineering-mathematics
+
–
2
answers
29
Which circle should I choose for BSNL jto CSE OC AIR-1370 n.marks-50.29?
1.1k
views
commented
Mar 28, 2017
2
answers
30
C Programming (interview)
WAP where smallest subarrays with sum greater than x? Say an array={1,5,6,2,45,17}; Now, x=60 Now we have to find smallest subarray which is greater than x
WAP where smallest subarrays with sum greater than x?Say an array={1,5,6,2,45,17};Now, x=60Now we have to find smallest subarray which is greater than x
1.4k
views
commented
Mar 23, 2017
Programming in C
programming-in-c
output
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register