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 prateekdwv
23
votes
1
GATE CSE 2018 | Question: 4
Let $\oplus$ and $\odot$ denote the Exclusive OR and Exclusive NOR operations, respectively. Which one of the following is NOT CORRECT? $\overline{P \oplus Q} = P \odot Q$ $\overline{P} \oplus Q = P \odot Q$ $\overline{P} \oplus \overline{Q} = P \oplus Q$ $P \oplus \overline{P} \oplus Q = ( P \odot \overline{P} \odot \overline{Q})$
Let $\oplus$ and $\odot$ denote the Exclusive OR and Exclusive NOR operations, respectively. Which one of the following is NOT CORRECT?$\overline{P \oplus Q} = P \odot Q$...
8.5k
views
answered
Feb 14, 2018
Digital Logic
gatecse-2018
digital-logic
normal
boolean-algebra
1-mark
+
–
5
votes
2
TIFR CSE 2018 | Part B | Question: 1
What is the remainder when $4444^{4444}$ is divided by $9?$ $1$ $2$ $5$ $7$ $8$
What is the remainder when $4444^{4444}$ is divided by $9?$$1$$2$$5$$7$$8$
3.3k
views
answered
Dec 11, 2017
Quantitative Aptitude
tifr2018
quantitative-aptitude
modular-arithmetic
+
–
19
votes
3
TIFR CSE 2017 | Part A | Question: 15
Let $T(a, b)$ be the function with two arguments (both nonnegative integral powers of 2) defined by the following recurrence: $ T(a, b) = T \left( \frac{a}{2}, b \right) +T\left( a, \frac{b}{2} \right)\quad \quad \quad \text{if } a, b \geq 2$ ... $\begin{pmatrix} r+s \\ r \end{pmatrix}$ $2^{r-s}$ if $r \geq s$, otherwise $2^{s-r}$
Let $T(a, b)$ be the function with two arguments (both nonnegative integral powers of 2) defined by the following recurrence:$ T(a, b) = T \left( \frac{a}{2}, b \right) +...
2.4k
views
answered
Dec 9, 2017
Algorithms
tifr2017
algorithms
recurrence-relation
+
–
13
votes
4
TIFR CSE 2010 | Part B | Question: 24
Consider the following program operating on four variables $u, v, x, y$, and two constants $X$ and $Y$. x, y, u, v:= X, Y, Y, X; While (x ≠ y) do if (x > y) then x, v := x - y, v + u; else if (y > x) then y, u:= y ... . The program prints $\frac1 2 \times \text{gcd}(X, Y)$ followed by $\frac1 2 \times \text{lcm}(X, Y)$. The program does none of the above.
Consider the following program operating on four variables $u, v, x, y$, and two constants $X$ and $Y$.x, y, u, v:= X, Y, Y, X; While (x ≠ y) do if (x y) then x, v := ...
1.8k
views
answered
Dec 5, 2017
Algorithms
tifr2010
algorithms
identify-function
+
–
2
votes
5
Log formula related doubt.
Confusion regarding these log representations. 1.(logn)2 2.log2n 3.log(logn) 4.log(n)2 which of these are equal . Also explain meaning of each one.(Pls provide any source if possible).
Confusion regarding these log representations.1.(logn)22.log2n3.log(logn)4.log(n)2which of these are equal . Also explain meaning of each one.(Pls provide any source if p...
756
views
answered
Dec 1, 2017
Algorithms
algorithms
time-complexity
+
–
0
votes
6
Non deterministic finite
183
views
answered
Nov 29, 2017
1
votes
7
#programming
#include<stdio.h> main() { int i=511; char *ptr=(char *)&i; printf("%d",*ptr); } explain...how output came -1????
#include<stdio.h>main(){int i=511;char *ptr=(char *)&i;printf("%d",*ptr);}explain...how output came -1????
2.5k
views
answered
Sep 24, 2017
0
votes
8
LAnguage
L = { a^m b^n b^k d^l |(n+k)=odd only if m=l; m, n, k , l>0}. Which is true? a)CFL but not DCFL b)regular but not CFL c)DCFL but not regular d)none
L = { a^m b^n b^k d^l |(n+k)=odd only if m=l; m, n, k , l>0}. Which is true?a)CFL but not DCFLb)regular but not CFLc)DCFL but not regulard)none
435
views
answered
Sep 19, 2017
1
votes
9
PROGRAMMING
342
views
answered
Sep 18, 2017
Programming in C
programming-in-c
output
+
–
1
votes
10
time complexity
If F(n) = (log n)n then, is F(n) = O(n2) true? Also, what about F(n) = $\Theta$(n2)
If F(n) = (log n)n then, is F(n) = O(n2) true?Also, what about F(n) = $\Theta$(n2)
288
views
answered
Sep 11, 2017
Algorithms
time-complexity
algorithms
asymptotic-notation
+
–
5
votes
11
Peter Linz Edition 4 Exercise 2.1 Question 24 (Page No. 49)
Let us define an operation $truncate$, which removes the rightmost symbol from any string. For example, $truncate (aaaba)$ is $aaab$. The operation can be extended to languages by $truncate (L)= $ {$truncate(w):w ∈ L$} Show how, ... From this, prove that if $L$ is a regular language not containing $λ$, then $truncate (L)$ is also regular.
Let us define an operation $truncate$, which removes the rightmost symbol from any string. For example, $truncate (aaaba)$ is $aaab$. The operation can be extended to lan...
3.6k
views
answered
Sep 7, 2017
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
+
–
3
votes
12
TOC - Doubt
Consider these statements: S1: If a language is infinite, it has to be non-Regular. S2: Let L be any language. $(\overline{L})^{*} \neq (\overline{L^{*}})$ (a) Both are True (c) S1 → True, S2 → False (b) Both are False (d) S1 → False, S2 → True
Consider these statements:S1: If a language is infinite, it has to be non-Regular.S2: Let L be any language.$(\overline{L})^{*} \neq (\overline{L^{*}})$(a) Both are True(...
1.2k
views
answered
Sep 7, 2017
Theory of Computation
regular-language
regular
theory-of-computation
+
–
0
votes
13
Mapping Reducible
A={<M,w> M is a TM that accepts w} B=Ʃ* Is A Mapping reducible to B? http://theory.stanford.edu/~trevisan/cs154-12/reductions3.pdf
A={<M,w M is a TM that accepts w}B=Ʃ*Is A Mapping reducible to B?http://theory.stanford.edu/~trevisan/cs154-12/reductions3.pdf
970
views
answered
Sep 5, 2017
Theory of Computation
theory-of-computation
+
–
1
votes
14
C Program -2
#include<stdio.h> int f(int a){ a > 20 ? return 10: return 20; } int main(){ int b=fun(20); return 0; } what will be the output of this program ?
#include<stdio.h>int f(int a){ a 20 ? return 10: return 20;}int main(){int b=fun(20);return 0;}what will be the output of this program ?
1.7k
views
answered
Aug 27, 2017
Programming in C
programming-in-c
+
–
3
votes
15
identities of regular expression
how $\phi \cdot R = R \cdot \phi = \phi$ ? where R is regular expression, and why is $\phi^* is $\epsilon$
how $\phi \cdot R = R \cdot \phi = \phi$ ? where R is regular expression, and why is $\phi^* is $\epsilon$
2.2k
views
answered
Aug 17, 2017
4
votes
16
Proposition
X posed many puzzles about an island that has two kinds of inhabitants knights who always tells the truth, and their opposite knaves, who always lie. You encounter two people A and B. What are A and B if A says 'B is a knight' and B says 'two of us are of opposite types'?
X posed many puzzles about an island that has two kinds of inhabitants knights who always tells the truth, and their opposite knaves, who always lie. You encounter two pe...
2.1k
views
answered
Aug 13, 2017
4
votes
17
Array
A tridiagonal matrix [-2..2,5..9] is stored in row major order with base address 301.what is the address of data [0][8] if nonzero elements are stored??
A tridiagonal matrix [-2..2,5..9] is stored in row major order with base address 301.what is the address of data [0][8] if nonzero elements are stored??
2.3k
views
answered
Aug 8, 2017
1
votes
18
TOC Languages Difference
Given two languages L1 =$a^{*}(ab+a)$ L2=$a^{+}(ab+a)$ What is L1-L2?
Given two languagesL1 =$a^{*}(ab+a)$L2=$a^{+}(ab+a)$What is L1-L2?
595
views
answered
Aug 4, 2017
Theory of Computation
theory-of-computation
regular-expression
+
–
1
votes
19
first order logic
Is it always the case that implication comes with universal quantifier and conjunction comes with existential quantifier?
Is it always the case that implication comes with universal quantifier and conjunction comes with existential quantifier?
644
views
answered
Jun 7, 2017
Mathematical Logic
first-order-logic
mathematical-logic
discrete-mathematics
+
–
3
votes
20
C Programming
1.3k
views
answered
Jun 2, 2017
Programming in C
programming-in-c
output
+
–
12
votes
21
ISRO2017-24
When two $n$-bit binary numbers are added the sum will contain at the most $n$ bits $n + 2$ bits $n + 3$ bits $n + 1$ bits
When two $n$-bit binary numbers are added the sum will contain at the most$n$ bits$n + 2$ bits$n + 3$ bits$n + 1$ bits
7.8k
views
answered
May 7, 2017
Digital Logic
isro2017
digital-logic
adder
+
–
28
votes
22
GATE CSE 2009 | Question: 5, ISRO2017-57
$(1217)_8$ is equivalent to $(1217)_{16}$ $(028F)_{16}$ $(2297)_{10}$ $(0B17)_{16}$
$(1217)_8$ is equivalent to$(1217)_{16}$$(028F)_{16}$$(2297)_{10}$$(0B17)_{16}$
8.1k
views
answered
May 7, 2017
Digital Logic
gatecse-2009
digital-logic
number-representation
isro2017
+
–
4
votes
23
Stack Doubt
The question basically says no. of different outputs produced for given sequence of input (1,2,...,n) I thought in terms of push - pop pairs but cant arrive at the answer @arjun sir , @bikram sir
The question basically says no. of different outputs produced for given sequence of input (1,2,...,n)I thought in terms of push - pop pairs but cant arrive at the answer ...
974
views
answered
Jan 25, 2017
Programming in C
stack
data-structures
+
–
0
votes
24
GRAPH_degree seq
Is there any simple graph with degree sequence <1,1,1,1,2,2,3,3,3,3>
Is there any simple graph with degree sequence<1,1,1,1,2,2,3,3,3,3>
265
views
answered
Jan 20, 2017
0
votes
25
Ace Test Series: Databases - Transactions
Consider the following transaction T1 T2 T3 R(A) W(A) commit W(A) commit W(A) commit Which of the following is TRUE regarding above transaction? (1) Transaction is view serializable since it has a view-equivalent serial schedule < T1, ... schedule < T3, T2 T1 > (4) Transaction is not serializable Your Answer: 3 Correct Answer: 1 Status: incorrect
Consider the following transaction T1 T2 T3 R(A) W(A) commit W(A) commit W(A) commitWhich of the following is TRUE regarding above transaction?(1)Transaction is ...
409
views
answered
Jan 19, 2017
Databases
databases
transaction-and-concurrency
ace-test-series
+
–
2
votes
26
Number of possible conflict equivalent serial schedules
"Number of possible conflict equivalent serial schedules to some non-serial schedule is total number of topological sorts of its precedence graph." I haven't read this method anywhere yet but I found it by myself while ... answer, please can anyone refer me to standard(reference) books about this!(I found that,too but failed)
"Number of possible conflict equivalent serial schedules to some non-serial schedule is total number of topological sorts of its precedence graph."I haven't read this met...
1.0k
views
answered
Jan 17, 2017
Databases
topological-sort
databases
concurrency
conflict-serializable
algorithms
+
–
2
votes
27
If L is any language accepted by DPDA with stack containing only one symbol. Then L can be
1.9k
views
answered
Jan 14, 2017
Theory of Computation
theory-of-computation
context-free-language
pushdown-automata
+
–
2
votes
28
Quick Sort
Suppose we have a O(nlogn) time algorithm that finds median of an unsorted array. Now consider a QuickSort implementation where we first find median using the above algorithm, then use median as pivot. What will be the worst case time complexity of this modified ... quick sort. Average case time complexity of modified quick sort is same as that of original quick sort. None of the above
Suppose we have a O(nlogn) time algorithm that finds median of an unsorted array. Now consider a QuickSort implementation where we first find median using the above algor...
5.3k
views
answered
Jan 9, 2017
Algorithms
time-complexity
quick-sort
+
–
4
votes
29
Virtual Gate Test Series: Theory Of Computation - DFA
Number of states in the $\text{DFA}$ accepting the language $L=\{a^{n}b^{n}|1\leq n\leq 3\}$ over $\sum=\{a,b\}.$
Number of states in the $\text{DFA}$ accepting the language $L=\{a^{n}b^{n}|1\leq n\leq 3\}$ over $\sum=\{a,b\}.$
578
views
answered
Jan 8, 2017
Theory of Computation
theory-of-computation
finite-automata
number-of-states
virtual-gate-test-series
+
–
2
votes
30
Reader Writer
337
views
answered
Jan 8, 2017
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register