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 Aspirant
2
answers
1
Digital
How to prove is FUNCTIONALLY COMPLETE ?
How to prove is FUNCTIONALLY COMPLETE ?
343
views
asked
Feb 13, 2018
Digital Logic
digital-logic
+
–
1
answer
2
Graph theory
If $N=(0,1,2,3 ....)$ , then $(N,+)$ is a Group. If $N=(1,2,3 ....)$ , then $(N,+)$ is a not Group. Which one to consider in exam ?
If $N=(0,1,2,3 ....)$ , then $(N,+)$ is a Group.If $N=(1,2,3 ....)$ , then $(N,+)$ is a not Group.Which one to consider in exam ?
379
views
asked
Feb 6, 2018
Mathematical Logic
group-theory
discrete-mathematics
+
–
6
answers
3
GATE CSE 2015 Set 3 | Question: 44
Given the function $F = P' +QR$, where $F$ is a function in three Boolean variables $P, Q$ and $R$ and $P'=!P$, consider the following statements. $(S1) F = \sum(4, 5, 6)$ $(S2) F = \sum(0, 1, 2, 3, 7)$ $(S3) F = \Pi (4, 5, 6)$ ... (S2)-False, (S3)-False, (S4)-True (S1)-False, (S2)-False, (S3)-True, (S4)-True (S1)-True, (S2)-True, (S3)-False, (S4)-False
Given the function $F = P' +QR$, where $F$ is a function in three Boolean variables $P, Q$ and $R$ and $P'=!P$, consider the following statements.$(S1) F = \sum(4, 5, 6)$...
8.4k
views
commented
Jan 18, 2018
Digital Logic
gatecse-2015-set3
digital-logic
canonical-normal-form
normal
+
–
4
answers
4
GATE IT 2006 | Question: 14
Consider the relations $r_{1}\text{(P, Q, R)}$ and $r_{2}\text{(R, S, T)}$ with primary keys $\text{P}$ and $\text{R}$ respectively. The relation $r_{1}$ contains $2000$ tuples and $r_{2}$ contains $2500$ tuples. The maximum size of the join $r_1⋈ r_2$ is : $2000$ $2500$ $4500$ $5000$
Consider the relations $r_{1}\text{(P, Q, R)}$ and $r_{2}\text{(R, S, T)}$ with primary keys $\text{P}$ and $\text{R}$ respectively. The relation $r_{1}$ contains $2000$ ...
17.5k
views
commented
Jan 14, 2018
Databases
gateit-2006
databases
joins
natural-join
normal
+
–
3
answers
5
GATE CSE 1995 | Question: 1.10
Consider a grammar with the following productions $S \rightarrow a \alpha b \mid b \alpha c \mid aB$ $S \rightarrow \alpha S\mid b$ $S \rightarrow \alpha b b\mid ab$ $S \alpha \rightarrow bd b\mid b$ The above grammar is: Context free Regular Context sensitive $LR(k)$
Consider a grammar with the following productions$S \rightarrow a \alpha b \mid b \alpha c \mid aB$$S \rightarrow \alpha S\mid b$$S \rightarrow \alpha b b\mid ab$$...
18.3k
views
commented
Jan 9, 2018
Compiler Design
gate1995
compiler-design
grammar
normal
+
–
1
answer
6
CMI2010-A-08
In programming language terminology, $\text{ call by value }$ refers to the fact that: A function call can return a value. When a function is called, arguments are copied into local storage. Functions can indirectly modify the value of external variables. Every argument passed to a function must have a value.
In programming language terminology, $\text{ call by value }$ refers to the fact that:A function call can return a value.When a function is called, arguments are copied i...
1.2k
views
commented
Jan 7, 2018
Compiler Design
cmi2010
compiler-design
runtime-environment
parameter-passing
+
–
1
answer
7
GATE CSE 2009 | Question: 17
Match all items in Group 1 with the correct options from those given in Group 2.Syntax analysis ... $\text{P-3, Q-4, R-1, S-2}$ $\text{P-2, Q-1, R-4, S-3}$
Match all items in Group 1 with the correct options from those given in Group 2.Syntax analysis$$\begin{array}{|ll|ll|}\hline \rlap{\textbf{Group 1}} & & \rlap{\textbf{Gr...
8.0k
views
commented
Jan 6, 2018
Compiler Design
gatecse-2009
compiler-design
easy
compilation-phases
+
–
2
answers
8
GATE CSE 1996 | Question: 1.17
The pass numbers for each of the following activities object code generation literals added to literal table listing printed address resolution of local symbols that occur in a two pass assembler respectively are $1, 2, 1, 2$ $2, 1, 2, 1$ $2, 1, 1, 2$ $1, 2, 2, 2$
The pass numbers for each of the following activitiesobject code generationliterals added to literal tablelisting printedaddress resolution of local symbols that occur in...
12.9k
views
commented
Jan 6, 2018
Compiler Design
gate1996
compiler-design
normal
assembler
+
–
1
answer
9
GATE CSE 2015 Set 2 | Question: 14
In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is TRUE? In both AST and CFG, let node $N_2$ be the successor of node $N_1$. In the input program, the code corresponding to $N_2$ ... an AST and a CFG depends on the input program Each node in AST and CFG corresponds to at most one statement in the input program
In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is TRUE? In both AST and CFG, let node $N_2$ be the successor of nod...
13.2k
views
commented
Jan 6, 2018
Compiler Design
gatecse-2015-set2
compiler-design
easy
abstract-syntax-tree
+
–
7
answers
10
GATE CSE 1998 | Question: 1.12
The string $1101$ does not belong to the set represented by $110^*(0 + 1)$ $1(0 + 1)^*101$ $(10)^*(01)^*(00 + 11)^*$ $(00 + (11)^*0)^*$
The string $1101$ does not belong to the set represented by$110^*(0 + 1)$$1(0 + 1)^*101$$(10)^*(01)^*(00 + 11)^*$$(00 + (11)^*0)^*$
23.2k
views
comment edited
Jan 6, 2018
Theory of Computation
gate1998
theory-of-computation
regular-expression
easy
multiple-selects
+
–
4
answers
11
GATE CSE 2016 Set 1 | Question: 18
Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $0$'s and two consecutive $1$'s? $(0+1 )^ *0011 (0+1)^* +(0+1)^*1100(0+1)^*$ $(0+1)^* (00(0+1)^*11+11(0+1)^*00)(0+1)^*$ $(0+1)^*00(0+1)^* + (0+1)^*11 (0+1)^*$ $00(0+1)^*11 +11(0+1)^*00$
Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $0$'s and two consecutive $1$'s?$(0+1 )^ *001...
20.8k
views
commented
Jan 5, 2018
Theory of Computation
gatecse-2016-set1
theory-of-computation
regular-expression
normal
+
–
1
answer
12
GATE CSE 2007 | Question: 42
Consider the following C function: int f(int n) { static int r = 0; if (n <= 0) return 1; if (n > 3) { r = n; return f(n-2) + 2; } return f(n-1) + r; } What is the value of $f(5)$? $5$ $7$ $9$ $18$
Consider the following C function:int f(int n) { static int r = 0; if (n <= 0) return 1; if (n 3) { r = n; return f(n-2) + 2; } return f(n-1) + r; }What is the value of ...
10.4k
views
commented
Jan 5, 2018
Programming in C
gatecse-2007
programming
recursion
normal
+
–
11
answers
13
GATE CSE 2016 Set 1 | Question: 35
What will be the output of the following $C$ program? void count (int n) { static int d=1; printf ("%d",n); printf ("%d",d); d++; if (n>1) count (n-1); printf ("%d",d); } void main(){ count (3); } $3 \ 1 \ 2 \ 2 \ 1 \ 3 \ 4 \ 4 \ 4$ $3 \ 1 \ 2 \ 1 \ 1 \ 1 \ 2 \ 2 \ 2$ $3 \ 1 \ 2 \ 2 \ 1 \ 3 \ 4$ $3 \ 1 \ 2 \ 1 \ 1 \ 1 \ 2$
What will be the output of the following $C$ program?void count (int n) { static int d=1; printf ("%d",n); printf ("%d",d); d++; if (n>1) count (n-1); printf ("%d",d); } ...
15.6k
views
commented
Jan 5, 2018
Programming in C
gatecse-2016-set1
programming-in-c
recursion
normal
+
–
6
answers
14
GATE CSE 2015 Set 1 | Question: 35
What is the output of the following C code? Assume that the address of $x$ is $2000$ (in decimal) and an integer requires four bytes of memory. int main () { unsigned int x [4] [3] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {10, 11, 12}}; printf ("%u, %u, %u", x + 3, *(x + 3), *(x + 2) + 3); } $2036, 2036, 2036$ $2012, 4, 2204$ $2036, 10, 10$ $2012, 4, 6$
What is the output of the following C code? Assume that the address of $x$ is $2000$ (in decimal) and an integer requires four bytes of memory.int main () { unsigned int ...
28.3k
views
commented
Jan 4, 2018
Programming in C
gatecse-2015-set1
programming
programming-in-c
array
normal
+
–
2
answers
15
PROGRAMMING IN C
What is the output of the following program? # include <stdio.h> # define MUL (a, b) a ∗ b # define pow (a) a ∗ a int main ( ) { int a = 3; int b = 2; printf (“%”, MUL (MUL (a+1, b), pow (b + 1))); return 0; }
What is the output of the following program?# include <stdio.h># define MUL (a, b) a ∗ b# define pow (a) a ∗ aint main ( ){int a = 3;int b = 2;printf (“%”, MUL (M...
2.3k
views
commented
Jan 3, 2018
Programming in C
programming-in-c
+
–
3
answers
16
GATE CSE 2001 | Question: 2.18
Consider the following three C functions: $[P1]$ int *g(void) { int x = 10; return (&x); } $[P2]$ int *g(void) { int *px; *px = 10; return px; } $[P3]$ int *g(void) { int *px; px = (int*) malloc (sizeof(int)); *px = 10; ... of the above three functions are likely to cause problems with pointers? Only $P3$ Only $P1$ and $P3$ Only $P1$ and $P2$ $P1, P2$ and $P3$
Consider the following three C functions:$[P1]$ int *g(void) { int x = 10; return (&x); }$[P2]$ int *g(void) { int *px; *px = 10; return px; }$[P3]$ int *g(void) { int *p...
24.3k
views
commented
Jan 3, 2018
Programming in C
gatecse-2001
programming
programming-in-c
normal
pointers
+
–
1
answer
17
Matrices
Let $\begin{pmatrix} -1 &2 \\ 0 & -1 \end{pmatrix}$,and $B=A+A^{2}+A^{3}+\dots +A^{50}$, then $B^{2}=I$ $B^{2}=0$ $B^{2}=A$ $B^{2}=B$
Let $\begin{pmatrix} -1 &2 \\ 0 & -1 \end{pmatrix}$,and $B=A+A^{2}+A^{3}+\dots +A^{50}$, then$B^{2}=I$ $B^{2}=0$ $B^{2}=A$ $B^{2}=B$...
729
views
answer selected
May 13, 2017
Linear Algebra
isro-mech
linear-algebra
matrix
+
–
1
answer
18
matrices
Let A be a real $2 \times 2$ matrix.If $5 + 3\iota$ is an eigen value of A, then det(A) (A)equals 4 (B)equals 8 (C)equals 16
Let A be a real $2 \times 2$ matrix.If $5 + 3\iota$ is an eigen value of A, then det(A)(A)equals 4(B)equals 8(C)equals 16
963
views
asked
May 12, 2017
Mathematical Logic
linear-algebra
matrix
+
–
1
answer
19
LIMITS CALCULUS
Will it be 0 ? Anyone explain please
Will it be 0 ? Anyone explain please
259
views
asked
Apr 14, 2017
1
answer
20
Calculus
633
views
commented
Apr 12, 2017
Mathematical Logic
limits
calculus
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register