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 Arjun
12
votes
1561
General Doubt
the complement of every context-free language is recursive ? or recursive enumerable? or both?
the complement of every context-free language is recursive ? or recursive enumerable? or both?
13.3k
views
answered
Feb 2, 2015
Theory of Computation
general-topic-doubt
theory-of-computation
closure-property
+
–
35
votes
1562
GATE CSE 2002 | Question: 1.18
The results returned by function under value-result and reference parameter passing conventions Do not differ Differ in the presence of loops Differ in all cases May differ in the presence of exception
The results returned by function under value-result and reference parameter passing conventionsDo not differDiffer in the presence of loopsDiffer in all casesMay differ i...
8.3k
views
answered
Jan 31, 2015
Programming in C
gatecse-2002
programming
parameter-passing
normal
out-of-syllabus-now
+
–
39
votes
1563
GATE CSE 2003 | Question: 88
In the following $C$ program fragment, $j$, $k$, $n$ and TwoLog_n are integer variables, and $A$ is an array of integers. The variable $n$ is initialized to an integer $\geqslant 3$, and TwoLog_n is initialized to the value of $2^*\lceil \log_2(n) \rceil$ for (k = 3; k ... $\left\{m \mid m \leq n, \text{m is prime} \right\}$ { }
In the following $C$ program fragment, $j$, $k$, $n$ and TwoLog_n are integer variables, and $A$ is an array of integers. The variable $n$ is initialized to an integer $\...
12.3k
views
answered
Jan 31, 2015
Algorithms
gatecse-2003
algorithms
identify-function
normal
+
–
53
votes
1564
GATE CSE 2007 | Question: 33
Define the connective $*$ for the Boolean variables $X$ and $Y$ as: $X * Y = XY + X'Y'.$ Let $Z = X * Y$. Consider the following expressions $P$, $Q$ and $R$. $P : X = Y * Z, \\ Q :Y = X * Z, \\ R : X *Y * Z = 1$ Which of the following is TRUE? Only $P$ and $Q$ are valid. Only $Q$ and $R$ are valid. Only $P$ and $R$ are valid. All $P$, $Q$, $R$ are valid.
Define the connective $*$ for the Boolean variables $X$ and $Y$ as: $$X * Y = XY + X'Y'.$$ Let $Z = X * Y$. Consider the following expressions $P$, $Q$ and $R$.$$P : X = ...
8.9k
views
answered
Jan 30, 2015
Digital Logic
gatecse-2007
digital-logic
normal
boolean-algebra
+
–
93
votes
1565
GATE CSE 2001 | Question: 1.16
Let $f(n) = n^2 \log n$ and $g(n) = n(\log n)^{10}$ be two positive functions of $n$. Which of the following statements is correct? $f(n) = O(g(n)) \text{ and } g(n) \neq O(f(n))$ $g(n) = O(f(n)) \text{ and } f(n) \neq O(g(n))$ $f(n) \neq O(g(n)) \text{ and } g(n) \neq O(f(n))$ $f(n) =O(g(n)) \text{ and } g(n) = O(f(n))$
Let $f(n) = n^2 \log n$ and $g(n) = n(\log n)^{10}$ be two positive functions of $n$. Which of the following statements is correct?$f(n) = O(g(n)) \text{ and } g(n) \neq ...
18.8k
views
answered
Jan 30, 2015
Algorithms
gatecse-2001
algorithms
asymptotic-notation
time-complexity
normal
+
–
5
votes
1566
combinatory
A parking lot has 16 spaces in a row. Twelve cars arrive, each of which requires one parking space, and their drivers chose spaces at random from among the available spaces. Auntie Em then arrives in her SUV, which requires 2 adjacent spaces. What is the probability that she is able to park? ...
A parking lot has 16 spaces in a row. Twelve cars arrive, each of which requires one parking space, and their drivers chose spaces at random from among the available spac...
774
views
answered
Jan 29, 2015
Combinatory
probability
+
–
10
votes
1567
Self Doubt: Permutations & Combinations
How many solutions are there to the equation $x+y+z=17$ in positive integers? $120$ $171$ $180$ $121$
How many solutions are there to the equation $x+y+z=17$ in positive integers?$120$$171$$180$$121$
3.4k
views
answered
Jan 29, 2015
Combinatory
self-doubt
combinatory
+
–
5
votes
1568
How many ternary strings of length 4 have exactly one 1?
1.8k
views
answered
Jan 29, 2015
1
votes
1569
anti symmetric set
A relation is said to be antisymmetric if (a,b) belong to R and (b,a) belong to R implies a=b... that means antisymmetric is reflexive?
A relation is said to be antisymmetric if (a,b) belong to R and (b,a) belong to R implies a=b...that means antisymmetric is reflexive?
611
views
answered
Jan 29, 2015
78
votes
1570
GATE CSE 2014 Set 2 | Question: 47
The product of the non-zero eigenvalues of the matrix is ____ $\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 \end{pmatrix}$
The product of the non-zero eigenvalues of the matrix is ____$\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & ...
37.3k
views
answered
Jan 28, 2015
Linear Algebra
gatecse-2014-set2
linear-algebra
eigen-value
normal
numerical-answers
+
–
44
votes
1571
GATE CSE 2009 | Question: 40
Let $L = L_1 \cap L_2 $, where $L_1$ and $L_2$ are languages as defined below: $L_1= \left \{ a^m b^mca^nb^n \mid m,n \geq 0 \right \}$ $L_2=\left \{ a^i b^j c^k \mid i,j,k \geq 0 \right \}$ Then $L$ is Not recursive Regular Context free but not regular Recursively enumerable but not context free.
Let $L = L_1 \cap L_2 $, where $L_1$ and $L_2$ are languages as defined below:$L_1= \left \{ a^m b^mca^nb^n \mid m,n \geq 0 \right \}$$L_2=\left \{ a^i b^j c^k \mid i,j,k...
13.1k
views
answered
Jan 28, 2015
Theory of Computation
gatecse-2009
theory-of-computation
easy
identify-class-language
+
–
116
votes
1572
GATE CSE 2014 Set 1 | Question: 12
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is $O(n^a\log^bn)$. Then the value of $a+10b$ is __________.
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly $4$ nodes is...
24.6k
views
answered
Jan 28, 2015
DS
gatecse-2014-set1
data-structures
binary-tree
numerical-answers
normal
+
–
108
votes
1573
GATE CSE 2003 | Question: 2
Assume the following C variable declaration: int *A[10], B[10][10]; Of the following expressions: $A[2]$ $A[2][3]$ $B[1]$ $B[2][3]$ which will not give compile-time errors if used as left hand sides of assignment statements in a C program? I, II, and IV only II, III, and IV only II and IV only IV only
Assume the following C variable declaration:int *A[10], B[10][10];Of the following expressions:$A $$A [3]$$B $$B [3]$which will not give compile-time errors if used as le...
30.1k
views
answered
Jan 28, 2015
Programming in C
gatecse-2003
programming
programming-in-c
easy
pointers
+
–
4
votes
1574
consider a machine with 64Mbyte physical memory and a 32 bit virtual address. if the page size is 4 kByte, what is the approximate size of the page table? a)16 Mbyte b)8 Mbyte c) 2 Mbyte d) 24 Mbyte
9.0k
views
answered
Jan 28, 2015
112
votes
1575
GATE CSE 2013 | Question: 34
A shared variable $x$, initialized to zero, is operated on by four concurrent processes $W, X, Y, Z$ as follows. Each of the processes $W$ and $X$ reads $x$ from memory, increments by one, stores it to memory, and then terminates. Each of the ... initialized to two. What is the maximum possible value of $x$ after all processes complete execution? $-2$ $-1$ $1$ $2$
A shared variable $x$, initialized to zero, is operated on by four concurrent processes $W, X, Y, Z$ as follows. Each of the processes $W$ and $X$ reads $x$ from memory, ...
22.6k
views
answered
Jan 27, 2015
Operating System
gatecse-2013
operating-system
process-synchronization
normal
+
–
5
votes
1576
equivalent regular expression?
Assume $R_1$, $R_2$, and $R_3$ are three regular expressions. Given $R_1 + R_2 \cdot R_3 = (R_1+R_2) \cdot (R_1+R_3)$ for any $R_2$ and $R_3$. Which of the following could be correct condition which always satisfies the above equation. 1. $R_1 = R_2$ 2. ... correct B) only 1 and 3 are correct C) only 2 and 3 are correct D) 1,2, and 3 are correct Answer is given as D
Assume $R_1$, $R_2$, and $R_3$ are three regular expressions.Given $R_1 + R_2 \cdot R_3 = (R_1+R_2) \cdot (R_1+R_3)$ for any $R_2$ and $R_3$. Which of the following could...
1.4k
views
answered
Jan 27, 2015
Theory of Computation
regular-expression
theory-of-computation
wrong-choices
+
–
5
votes
1577
Language accepted by PDA is __________?
2.2k
views
answered
Jan 27, 2015
Theory of Computation
pushdown-automata
theory-of-computation
+
–
32
votes
1578
Which of the following languages are Recursively Enumerable language?
Which of the following languages are Recursively Enumerable language? $\{\langle M \rangle \mid M$ is a TM and there exist an input whose length is less than 100, on which $M$ halts$\}$ ... $\{ \langle M1, M2, M3 \rangle \mid L(M1) = L(M2) \cup L(M3) \}$ All of these
Which of the following languages are Recursively Enumerable language?$\{\langle M \rangle \mid M$ is a TM and there exist an input whose length is less than 100, on which...
5.2k
views
answered
Jan 27, 2015
Theory of Computation
turing-machine
recursive-and-recursively-enumerable-languages
theory-of-computation
+
–
15
votes
1579
toc
Let $L_1 = \{a^nb^mc^n \mid m,n \geq 0 \}$ and $L_2 = \{a^nc^n \mid n \geq 0 \}$. Both $L_1$ and $L_2$ are context free languages. if $L = ( L_1 - L_2 )$ then $L$ is ____. a. Finite Language b. Regular language c. DCFL d. Not DCFL
Let $L_1 = \{a^nb^mc^n \mid m,n \geq 0 \}$ and $L_2 = \{a^nc^n \mid n \geq 0 \}$. Both $L_1$ and $L_2$ are context free languages. if $L = ( L_1 - L_2 )$ then $L$ is ___...
1.7k
views
answered
Jan 27, 2015
Theory of Computation
theory-of-computation
context-free-language
+
–
0
votes
1580
Direct Mapped Cache
910
views
answered
Jan 27, 2015
59
votes
1581
GATE CSE 2006 | Question: 51, ISRO2016-34
Consider the following recurrence: $ T(n)=2T\left ( \sqrt{n}\right )+1,$ $T(1)=1$ Which one of the following is true? $ T(n)=\Theta (\log\log n)$ $ T(n)=\Theta (\log n)$ $ T(n)=\Theta (\sqrt{n})$ $ T(n)=\Theta (n)$
Consider the following recurrence:$ T(n)=2T\left ( \sqrt{n}\right )+1,$ $T(1)=1$Which one of the following is true?$ T(n)=\Theta (\log\log n)$$ T(n)=\Theta (\log n)$$ T(n...
28.6k
views
answered
Jan 26, 2015
Algorithms
algorithms
recurrence-relation
isro2016
gatecse-2006
+
–
0
votes
1582
can any1 explain how to find maximum flow in graph from source to sink. pls
437
views
answered
Jan 25, 2015
Algorithms
cormen
graph-algorithms
+
–
62
votes
1583
GATE IT 2007 | Question: 50
Consider the following finite automata $P$ and $Q$ over the alphabet $\{a, b, c\}$. The start states are indicated by a double arrow and final states are indicated by a double circle. Let the languages recognized by them be denoted by $L(P)$ and $L(Q)$ respectively. The automation which recognizes the language $L(P) \cap L(Q)$ is :
Consider the following finite automata $P$ and $Q$ over the alphabet $\{a, b, c\}$. The start states are indicated by a double arrow and final states are indicated by a d...
14.8k
views
answered
Jan 25, 2015
Theory of Computation
gateit-2007
theory-of-computation
finite-automata
normal
+
–
12
votes
1584
Which of the following is a tautology?
Which of the following is a tautology? $P \rightarrow P \wedge Q$ $P \rightarrow Q \wedge V$ $(P \rightarrow Q) \wedge (Q \rightarrow R) \rightarrow P \rightarrow R$ $(P \rightarrow Q) \leftrightarrow (\sim Q \rightarrow \sim P)$
Which of the following is a tautology?$P \rightarrow P \wedge Q$$P \rightarrow Q \wedge V$$(P \rightarrow Q) \wedge (Q \rightarrow R) \rightarrow P \rightarrow R$$(P \rig...
3.1k
views
answered
Jan 25, 2015
Mathematical Logic
mathematical-logic
+
–
3
votes
1585
Mysterious Fork() call?
1.3k
views
answered
Jan 25, 2015
Operating System
fork-system-call
operating-system
+
–
88
votes
1586
GATE CSE 2007 | Question: 45
What is the $\text{time complexity}$ of the following recursive function? int DoSomething (int n) { if (n <= 2) return 1; else return (DoSomething (floor (sqrt(n))) + n); } $\Theta(n^2)$ $\Theta(n \log_2n)$ $\Theta(\log_2n)$ $\Theta(\log_2\log_2n)$
What is the $\text{time complexity}$ of the following recursive function?int DoSomething (int n) { if (n <= 2) return 1; else return (DoSomething (floor (sqrt(n))) + n); ...
32.0k
views
answered
Jan 22, 2015
Algorithms
gatecse-2007
algorithms
time-complexity
normal
+
–
37
votes
1587
GATE CSE 1998 | Question: 1.18
Which of the following devices should get higher priority in assigning interrupts? Hard disk Printer Keyboard Floppy disk
Which of the following devices should get higher priority in assigning interrupts?Hard diskPrinterKeyboardFloppy disk
12.3k
views
answered
Jan 22, 2015
Operating System
gate1998
operating-system
interrupts
normal
+
–
48
votes
1588
GATE CSE 2013 | Question: 29
Consider a hard disk with $16$ recording surfaces $(0-15)$ having $16384$ cylinders $(0-16383)$ and each cylinder contains $64$ sectors $(0-63)$. Data storage capacity in each sector is $512$ bytes. Data are organized cylinder-wise and the addressing ... cylinder number of the last sector of the file, if it is stored in a contiguous manner? $1281$ $1282$ $1283$ $1284$
Consider a hard disk with $16$ recording surfaces $(0-15)$ having $16384$ cylinders $(0-16383)$ and each cylinder contains $64$ sectors $(0-63)$. Data storage capacity in...
30.1k
views
answered
Jan 22, 2015
Operating System
gatecse-2013
operating-system
disk
normal
+
–
4
votes
1589
Let f(n) = O(n), g(n) = θ(n), and h(n) = Ω(n). Then f(n). h(n) + g(n) is_______________
let us consider f(n) is log(n) and g(n) = n and h(n) = n^2. since logn<= n n2 >= n for all values so given above equality holds true but when we substitute n+((logn)(n2) = O(n2) but ans is Ω(n) can somebody wxplain this plz
let us consider f(n) is log(n) and g(n) = n and h(n) = n^2.since logn<= n n2 >= n for all values so given above equality holds truebut when we substitute n+((logn)...
2.8k
views
answered
Jan 22, 2015
Algorithms
algorithms
asymptotic-notation
+
–
86
votes
1590
GATE CSE 2004 | Question: 56
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ bytes of application data to a host $H_C$ in network $C$. The $\text{TCP}$ layer prefixes $20$ byte header to the message. This passes ... $200$ $220$ $240$ $260$
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ bytes of application data to a host $H_C$ in network $C$. The $\...
23.1k
views
answered
Jan 22, 2015
Computer Networks
gatecse-2004
computer-networks
ip-addressing
tcp
normal
+
–
Page:
« prev
1
...
48
49
50
51
52
53
54
55
56
57
58
...
70
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register