Dark Mode

Recent activity by MANSI_SOMANI

2 answers

1

GATE Overflow | Mock GATE | Test 1 | Question: 6
The remainder when $'m+n'$ is divided by $12$ is $8$, and the remainder when $'m-n'$ is divided by $12$ is $6$. If $m>n$, then what is the remainder when $'mn'$ is divided by $6$?

comment edited in Quantitative Aptitude Sep 14

747 views

3 answers

2

GATE Overflow | Mock GATE | Test 1 | Question: 53
A class of first year B.tech students is composed of four batches A, B, C and D, each consisting of $30$ students. It is found that the sessional marks of students in Engineering Drawing in batch C have a mean of $6.6$ and standard deviation of $2.3$. ... this, the marks of a student in batch C are changed from $8.5$ to $8.75$ $7.45$ $9.27$ $8.97$

answered in Probability Sep 13

654 views

2 answers

3

GATE Overflow | Mock GATE | Test 1 | Question: 46
Which of the following statements is/are not correct? (P) The class of all Turing Machines is countably infinite (Q) The class of all DCFL's is countably infinite (R) The class of all formal languages is uncountably infinite (S) The set of all primes is countably infinite Only R Only R and S All are incorrect except P None of the above

commented in Theory of Computation Sep 13

2.4k views

1 answer

4

GATE Overflow | Mock GATE | Test 1 | Question: 38
Consider a system with paging-based memory management, whose architecture allows for a $4\text{GB}$ virtual address space for processes. The size of logical pages and physical frames is $4\text{KB}$. The system has $8\text{GB}$ physical RAM. The system allows a maximum of ... $4 \text{GB} + 4 \text{KB}$ $4 \text{MB} + 4 \text{GB}$

answered in Operating System Sep 13

1.0k views

2 answers

5

GATE Overflow | Mock GATE | Test 1 | Question: 33
If $x=cy+bz, \: y=az+cx, \: z=bx+ay,$ where $x,y,z$ are not all zero, then $a^2+b^2+c^2=$ $1+2abc$ $1-2abc$ $1+abc$ $abc-1$

answered in Set Theory & Algebra Sep 13

557 views

4 answers

6

GATE Overflow | Mock GATE | Test 1 | Question: 34
Let $G$ be a graph of order $n$ in which every vertex has degree equal to $d$. How large must $d$ be in order to guarantee that $G$ is connected? $\frac{n}{2}$ $\lceil (n-1)/2 \rceil$ $\lfloor (n+1)/2 \rfloor$ $(n-1)/2$

answered in Graph Theory Sep 13

1.2k views

1 answer

7

GATE Overflow | Mock GATE | Test 1 | Question: 29
Consider the following piece of code: int function(int a[], int n, int x) { int i; for (i=0; i<n && a[i]!=x;i++); if (i==n) return -1; else return i; } A function call is made with the arguments as follows: $a[]=\{5, 32, 1, 9, 7, 2\}$ $n=6$ $x=8$ What will be the value returned by the above code?

commented in Algorithms Sep 13

487 views

2 answers

8

GATE Overflow | Mock GATE | Test 1 | Question: 25
Consider the function: int fun(int n) { if (n==4) return n; else return 2*fun(n+1); } A MOD-16 ripple counter is holding the count $(1001)_2.$ What will be the count after "$(\text{fun}(2)+15)_{10}$" clock pulses? $(1000)_2$ $(1010)_2$ $(1011)_2$ $(1101)_2$

answered in Digital Logic Sep 13

699 views

2 answers

9

GATE Overflow | Mock GATE | Test 1 | Question: 19
Evaluate the limit: $ \lim_{x \to -3} \frac{\sqrt{2x+22}-4}{x+3}$ $\frac{1}{2}$ $\frac{1}{4}$ $\frac{1}{8}$ $\frac{1}{16}$

answered in Calculus Sep 13

604 views

2 answers

10

GATE Overflow | Mock GATE | Test 1 | Question: 7
If $a/b=c/d$, then which of the following does not hold good? $(a+b)/b=(c+d)/d$ $(a+c)/(b+d)=(a-c)/(b-d)$ $(a+b)/(a-b)=(c+d)/(c-d)$ $(a+c)/(b-d)=(a-c)(b+d)$

answered in Quantitative Aptitude Sep 13

357 views

2 answers

11

GATE Overflow | Mock GATE | Test 1 | Question: 5
A book contains $100$ pages. A page is chosen at random. What is the chance that the sum of the digits on the page is equal to $8$? $0.08$ $0.09$ $0.90$ $0.10$

answered in Quantitative Aptitude Sep 13

2.5k views

4 answers

12

GATE Overflow | Mock GATE | Test 1 | Question: 4
What is the value of $(x \% \text{ of } y) + (y \% \text{ of } x)$? $20 \% \text{ of } x/y$ $2 \% \text{ of } x/y$ $2 \% \text{ of } xy$ $20 \% \text{ of } xy$

answered in Quantitative Aptitude Sep 13

488 views

1 answer

13

ME TEST SERIES
Consider the following synchronization construct used by the processes P1, P2 and P3. The S1, S2 and S3 are counting semaphore variables: S1 = 3, S2 = 2, S3 = 1; P (S1); P (S2); P (S3); Critical section V (S3); V (S2); ... not mutual exclusion. C It satisfies mutual exclusion and bounded waiting but not progress. D It satisfies all the mutual exclusion, progress and bounded waiting.

commented in Operating System Sep 12

1.1k views