Register
Filter

Recent activity by shreyansh jain

1.3k
views
2 answers
Discrete maths:- Predicate logic
Consider $F(P), Q(P), L(P)$ denotes statements Printer $P$ is out of service , Print job $P$ is queued and Print job $P$ ... $\forall j (Q(j) \wedge L(j)) \rightarrow \exists p F(P)$
Consider $F(P), Q(P), L(P)$ denotes statements “Printer $P$ is out of service”, “Print job $P$ is queued” and “Print job $P$ is lost” respectively. Then state...
1.7k
views
3 answers
ME MOCK 4
Consider the following function: void madeeasy (int n) { if (n < 0) return; else { printf(n); madeeasy (- -n); madeeasy (n - -); printf(n); } } The sum of all values printed by madeeasy (5)_______ (I am getting -12 but given answer is 52)
Consider the following function:void madeeasy (int n) { if (n < 0) return; else { printf(n); madeeasy (- -n); madeeasy (n - -); printf(n); } }The sum of all values printe...
19.4k
views
13 answers
GATE CSE 2015 Set 2 | Question: 35
Consider the alphabet $\Sigma = \{0, 1\}$, the null/empty string $\lambda$ and the set of strings $X_0, X_1, \text{ and } X_2$ generated by the corresponding non-terminals of a regular grammar. $X_0, X_1, \text{ and } X_2$ are related as follows. $X_0 = 1 X_1$ $X_1 = 0 X_1 + 1 X_2$ ... $10(0^*+(10)^*)1$ $10(0^*+(10)^*)^*1$ $1(0+10)^*1$ $10(0+10)^*1 +110(0+10)^*1$
Consider the alphabet $\Sigma = \{0, 1\}$, the null/empty string $\lambda$ and the set of strings $X_0, X_1, \text{ and } X_2$ generated by the corresponding non-terminal...
4.8k
views
1 answers
GATE Overflow | Mock GATE | Test 1 | Question: 27
Which of the following statements is incorrect with respect to B-tree and B+ trees? Deletion operation is easier in B-tree but complex in case of B+ trees. In B+ trees, data records are stored only in the leaf nodes but in B trees data ... repeated in case of B+ trees but not in case of B trees. Searching is faster in B+ trees compared to B trees
Which of the following statements is incorrect with respect to B-tree and B+ trees?Deletion operation is easier in B-tree but complex in case of B+ trees.In B+ trees, dat...
477
views
0 answers
APPLIED-COURSE-MOCKTEST-2
How many 5 digit numbers can be formed if either (a) every successive digit exceeds its predecessor ,or (b) every successive digit is smaller than it’s predecessor Note:leading 0’s don’t count ,like 04521 is not a 5-digit number._
How many 5 digit numbers can be formed if either (a) every successive digit exceeds its predecessor ,or(b) every successive digit is smaller than it’s predecessor Note:...
1.1k
views
1 answers
GATE Overflow | Mock GATE | Test 1 | Question: 23
What is the minimum number of people that must be there in a room to make the probability of two people having same birthday be at least 50%? Assume a year has $365$ days and the probability distribution is uniform throughout. $23$ $182$ $183$ $123$
What is the minimum number of people that must be there in a room to make the probability of two people having same birthday be at least 50%? Assume a year has $365$ day...
1.6k
views
1 answers
GATE Overflow | Mock GATE | Test 1 | Question: 57
Which of the following statements on Viable Prefixes is incorrect? A viable prefix does not extend past the right end of the handle For any context-free grammar, the set of viable prefixes is a regular language A viable prefix by default is a suffix of the handle As long as a parser has viable prefixes on the stack no parsing error has been detected
Which of the following statements on Viable Prefixes is incorrect?A viable prefix does not extend past the right end of the handleFor any context-free grammar, the set of...
1.9k
views
1 answers
GATE Overflow | Mock GATE | Test 1 | Question: 58
Let $f(A, B, C, D)=\Pi (2, 3, 5, 9, 11, 12, 13)$ The total number of prime implicants and essential prime implicants are denoted by $P$ and $Q$ respectively. What is the value $Q \% P$ where $'\%'$ denotes the modulo operator?
Let $f(A, B, C, D)=\Pi (2, 3, 5, 9, 11, 12, 13)$The total number of prime implicants and essential prime implicants are denoted by $P$ and $Q$ respectively. What is the v...
1.0k
views
2 answers
GATE Overflow | Mock GATE | Test 1 | Question: 44
For two data sets, each of size $5$, the variances are given to be $4$ and $5$ and the corresponding means are given to be $2$ and $4$ respectively. The variance of the combined data is? $11/2$ $6$ $13/2$ $5/2$
For two data sets, each of size $5$, the variances are given to be $4$ and $5$ and the corresponding means are given to be $2$ and $4$ respectively. The variance of the c...
1.4k
views
1 answers
GATE Overflow | Mock GATE | Test 1 | Question: 18
Assume a program has just referenced an address in virtual memory. Which of the following scenario cannot occur? TLB miss with no page fault TLB hit and page replacement TLB miss and page fault TLB hit with no page fault
Assume a program has just referenced an address in virtual memory. Which of the following scenario cannot occur?TLB miss with no page faultTLB hit and page replacementTLB...
4.6k
views
2 answers
Digital Logic madeeasy
The frequency of the clock signal applied to the rising edge triggered D flip-flop shown in figure is 10 kHz. The frequency of the signal available at Q is? 5 Khz 10 Khz 1 Khz 0.5 Khz
The frequency of the clock signal applied to the rising edge triggered D flip-flop shown in figure is 10 kHz. The frequency of the signal available at Q is? 5 Khz10 Khz1 ...
1.7k
views
3 answers
GATE2018 CE-2: GA-10
Each of the letters in the figure below represents a unique integer from $1$ to $9$. The letters are positioned in the figure such that each of $(A+B+C), (C+D+E), (E+F+G)$ and $(G+H+K)$ is equal to $13$. Which integer does $E$ represent? $1$ $4$ $6$ $7$
Each of the letters in the figure below represents a unique integer from $1$ to $9$. The letters are positioned in the figure such that each of $(A+B+C), (C+D+E), (E+F+G)...
845
views
1 answers
Ace algorithms
What is the time complexity? int i,j,k,x=0; for(i=1;i<=n;i++) for(j=1;j<=i*i;j++) { if (j mod i ==0) for(k=1;k<=j;k++) x=x+10; }
What is the time complexity?int i,j,k,x=0;for(i=1;i<=n;i++)for(j=1;j<=i*i;j++){if (j mod i ==0)for(k=1;k<=j;k++)x=x+10;}
973
views
1 answers
Time complexity (Advance Level)
The difference of time Complexity between given functions can be represented by: void fun1(int n) { for(int i=1;i<=n;i++) for(int j=1;j<=i*i;j++) if(j%i==0) for(int k=1;k<=j;k++) s++; return 0; } void fun2(int n) { for(int i=1;i<=n;i++) for(int j=1;j<=i*i;j++) for(int k=1;k<=j;k++) s++; return 0; } $i. O(n^2)$ $ii. O(n)$ $iii.O(1)$ $iv. O(n^{1.5})$
The difference of time Complexity between given functions can be represented by:void fun1(int n){ for(int i=1;i<=n;i++) for(int j=1;j<=i*i;j++) if(j%i==0) ...
467
views
1 answers
MadeEasy Test Series: Theory Of Computation - Decidability
Among II and III. Which one is decidable ? Please explain in detail.
Among II and III. Which one is decidable ? Please explain in detail.
3.2k
views
3 answers
UGC NET CSE | December 2018 | Part 2 | Question: 34
Consider the following two languages : $L_1 = \{ x \mid \text{ for some y with } \mid y \mid = 2^{\mid x \mid} , xy \in \text{ L and L is regular language} \}$ ... $L_2$ is regular language Both $L_1$ and $L_2$ are regular languages Both $L_1$ and $L_2$ are not regular languages
Consider the following two languages :$L_1 = \{ x \mid \text{ for some y with } \mid y \mid = 2^{\mid x \mid} , xy \in \text{ L and L is regular language} \}$$L_2=\{ x \m...
4.2k
views
3 answers
UGC NET CSE | December 2018 | Part 2 | Question: 32
Consider the language $L$ given by $L=\{ 2^{nk} \mid k >0, \text{ and n is non-negative integer number } \}$ The minimum number of states of finite automaton which accepts the language $L$ is $n$ $n+1$ $\frac{n(n+1)}{2}$ $2^n$
Consider the language $L$ given by$$L=\{ 2^{nk} \mid k >0, \text{ and n is non-negative integer number } \}$$The minimum number of states of finite automaton which accept...
281
views
0 answers
Math doubt
Is it true $\frac{1}{1+x^{2}}=1-x^{2}$ Is it applied every function? (like limit func, generating func)?
Is it true$\frac{1}{1+x^{2}}=1-x^{2}$Is it applied every function? (like limit func, generating func)?
2.2k
views
2 answers
Output Under Dynamic Scoping
#include<stdio.h> int x=10; int main() { static int x=10; x+=f1()+f2()+f3()+f1(); printf("%d",x); return 0; } int f1(){static int x=25;x++;return x;} int f2(){int x=50;x++;return x;} int f3(){x*=10;return x;} What is the output of the above code, if dynamic scoping is used.
#include<stdio.h int x=10; int main() { static int x=10; x+=f1()+f2()+f3()+f1(); printf("%d",x); return 0; } int f1(){static int x=25;x++;return x;} int f2(){int x=50;x++...
9.3k
views
9 answers
AVL tree
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is root are ________.
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is...
258
views
0 answers
Madeeasy_OS
S1: User-level threads switching does not require context switching. TRUE S2 : Virtual memory increases the context switching overhead. TRUE Doubt: How S1 is TRUE when Context switching between user level threads is faster than context switching between kernel level threads. GATE2014
S1: User-level threads switching does not require context switching. TRUES2 : Virtual memory increases the context switching overhead. TRUEDoubt: How S1 is TRUE when Cont...
364
views
0 answers
ME OTS 1
I didn't get the solution.
I didn't get the solution.
6.8k
views
1 answers
GATE IT 2005 | Question: 24
Amongst the ACID properties of a transaction, the 'Durability' property requires that the changes made to the database by a successful transaction persist Except in case of an Operating System crash Except in case of a Disk crash Except in case of a power failure Always, even if there is a failure of any kind
Amongst the ACID properties of a transaction, the 'Durability' property requires that the changes made to the database by a successful transaction persistExcept in case o...
2.3k
views
1 answers
MadeEasy Test Series: Digital Logic - Decoder
A $3 \times 8$ decoder with two enables inputs is to be used to address 8 blocks of memory. What will be the size of each memory block when addressed from a sixteen-bit bus with two MSBs used to enable the decoder? $i)2k$ $ii)4k$ $iii)16k$ $iv) 64k$ What does “two enable inputs is to be used” mean? I am not able to visualize the circuit.
A $3 \times 8$ decoder with two enables inputs is to be used to address 8 blocks of memory. What will be the size of each memory block when addressed from a sixteen-bit ...
2.2k
views
4 answers
Topological Sort
How many Topological Orderings possible from A to H?
How many Topological Orderings possible from A to H?
3.7k
views
2 answers
Floating point
Consider the following bit pattern represents the floating point number in IEEE 754 single precision format: 1 10000111 11100000000000000000000 Which of the following represents the decimal value of above floating number? A) -192 B) -320 C) -384 D) -448
Consider the following bit pattern represents the floating point number in IEEE 754 single precision format: 1 10000111 11100000000000000000000Which of the following repr...