Dark Mode

Recent activity by slow_but_detemined

9 answers

1

GATE CSE 2020 | Question: 16
What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order? $\Theta(n)$ $\Theta(n \log n)$ $\Theta ( n)^{2}$ $\Theta(1)$

commented in DS Feb 17, 2020

19.9k views

7 answers

2

GATE CSE 2020 | Question: 39
Which one of the following predicate formulae is NOT logically valid? Note that $W$ is a predicate formula without any free occurrence of $x$. $\forall x (p(x) \vee W) \equiv \forall x \: ( px) \vee W$ ... $\exists x(p(x) \rightarrow W) \equiv \forall x \: p(x) \rightarrow W$

commented in Mathematical Logic Feb 13, 2020

11.3k views

3 answers

3

GATE2013 CE: GA-2
$\underset{\text{I}}{\underline{\text{The professor}}}$ $\underset{\text{II}}{\underline{\text{ordered to}}}$ $\underset{\text{III}}{\underline{\text{the students to go}}}$ $\underset{\text{IV}}{\underline{\text{out of the class.}}}$ Which of the above underlined parts of the sentence is grammatically incorrect? I II III IV

commented in Verbal Aptitude Feb 8, 2020

3.7k views

1 answer

4

ISI2014-DCG-38
Suppose that $A$ is a $3 \times 3$ real matrix such that for each $u=(u_1, u_2, u_3)’ \in \mathbb{R}^3, \: u’Au=0$ where $u’$ stands for the transpose of $u$. Then which one of the following is true? $A’=-A$ $A’=A$ $AA’=I$ None of these

commented in Linear Algebra Feb 7, 2020

373 views

2 answers

5

Will there be any starvation due to below synchronization mechanism ?
If a synchronization mechanism satisfies Bounded Waiting but no Progress and also it is a busy waiting solution so will there be any starvation ?

commented in Operating System Jan 31, 2020

814 views

1 answer

6

Test by Bikram | Operating Systems | Test 2 | Question: 13
The virtual memory system uses the demand paging for its implementation. The probability of getting page faults is $0.25$, the normal memory access time is $200$ nanoseconds. If it takes $2$ millseconds to service a page fault, then what is effective memory access time? $500000$ ns $500075$ ns $500150$ ns $500250$ ns

commented in Operating System Jan 31, 2020

260 views

3 answers

7

Test by Bikram | Operating Systems | Test 2 | Question: 5
Let us initialize counting semaphore $X$ to $5$. Assume that processes $P_i$ where $i= 1$ to $15$ are coded as follows. while (1) { P (x); { critical section } V (x); } and suppose that $P_{16}$ is coded as follows: ... { critical section } P (x); } The number of processes can be in the critical section at most at any point of time is ______

commented in Operating System Jan 31, 2020

428 views

2 answers

8

GateBook CN Grand Test-Q3

commented in Computer Networks Jan 29, 2020

453 views

0 answers

9

ISI2014-DCG-33
Let $f(x)$ be a continuous function from $[0,1]$ to $[0,1]$ satisfying the following properties. $f(0)=0$, $f(1)=1$, and $f(x_1)<f(x_2)$ for $x_1 < x_2$ with $0 < x_1, \: x_2<1$. Then the number of such functions is $0$ $1$ $2$ $\infty$

commented in Calculus Jan 27, 2020

303 views

2 answers

10

ISI2014-DCG-17
$\underset{x \to 2}{\lim} \dfrac{1}{1+e^{\frac{1}{x-2}}}$ is $0$ $1/2$ $1$ non-existent

commented in Calculus Jan 27, 2020

363 views

1 answer

11

ISI2018-MMA-29
Let $f$ be a continuous function with $f(1) = 1$. Define $F(t)=\int_{t}^{t^2}f(x)dx$. The value of $F’(1)$ is $-2$ $-1$ $1$ $2$

commented in Calculus Jan 27, 2020

735 views

0 answers

12

ISI2016-MMA-21
Let $A=\{1, 2, 3, 4, 5, 6, 7, 8 \}$. How many functions $f: A \rightarrow A$ can be defined such that $f(1)< f(2) < f(3)$? $\begin{pmatrix} 8 \\ 3 \end{pmatrix}$ $\begin{pmatrix} 8 \\ 3 \end{pmatrix} 5^8$ $\begin{pmatrix} 8 \\ 3 \end{pmatrix} 8^5$ $\frac{8!}{3!}$

commented in Calculus Jan 27, 2020

212 views

0 answers

13

ISI2015-MMA-80
Let $0 < \alpha < \beta < 1$. Then $ \Sigma_{k=1}^{\infty} \int_{1/(k+\beta)}^{1/(k+\alpha)} \frac{1}{1+x} dx$ is equal to $\log_e \frac{\beta}{\alpha}$ $\log_e \frac{1+ \beta}{1 + \alpha}$ $\log_e \frac{1+\alpha }{1+ \beta}$ $\infty$

commented in Calculus Jan 27, 2020

310 views

4 answers

14

VirtualGate Test Series: Theory Of Computation - Regular Languages
Consider the following subsets of $\left\{a, b, \$ \right\}^*$ $A=\left\{xy\, |\, x,y\in\left\{a,b\right\}^*,\#a(x)=\#b(y)\right\},$ $ ... are true? $A$ and $B$ both are regular $A$ is regular but $B$ is not $A$ is not regular but $B$ is regular Both are non-regular

commented in Theory of Computation Jan 22, 2020

1.3k views

6 answers

15

#DBMS ER Model - Minimum Number of tables
What are minimum number of tables required for the following given ER models such that they satisfy 1NF ?

commented in Databases Jan 20, 2020

1.8k views

7 answers

16

GATE CSE 2006 | Question: 24
Given a set of elements $N = {1, 2, ..., n}$ and two arbitrary subsets $A⊆N$ and $B⊆N$, how many of the n! permutations $\pi$ from $N$ to $N$ satisfy $\min(\pi(A)) = \min(\pi(B))$, where $\min(S)$ is the smallest integer in the set of integers $S$, and $\pi$(S) is the set of ... $n! \frac{|A ∩ B|}{|A ∪ B|}$ $\dfrac{|A ∩ B|^2}{^n \mathrm{C}_{|A ∪ B|}}$

commented in Set Theory & Algebra Jan 17, 2020

8.6k views

1 answer

17

Test by Bikram | Mock GATE | Test 2 | Question: 61
Choose the sentence that is grammatically correct : The serving bowl or the plates go on that shelf. The serving bowls or the plate go on that shelf. The serving bowl or the plate go on that shelf. The serving bowls or the plates goes on that shelf.

commented in GATE Jan 7, 2020

277 views

1 answer

18

Applied Course | Mock GATE | Test 1 | Question: 12
The number of miles that a particular car can run before its battery wears out is exponentially distributed with an average of $10,000$ miles. The owner of the car needs to take a $5000$-mile trip. What is the probability that he will be able to complete the trip without having to replace the car battery? $0.5$ $0.604$ $0.72$ None

commented in Probability Dec 28, 2019

2.7k views

2 answers

19

Test by Bikram | Mathematics | Test 2 | Question: 14
Given $f : Z^*Z \rightarrow Z$ And: $f(m,n) = \mid m \mid – \mid n \mid$ $f(m,n) = m2 + n2$ $f(m,n) = m2 – 4$ $f(m,n) = 2m – n$ Which one of the following options is correct? only IV is onto. only IV and I are onto. III is not onto. II is onto.

commented in Mathematical Logic Dec 20, 2019

190 views

4 answers

20

GATE CSE 2008 | Question: 17
Which of the following system calls results in the sending of SYN packets? $\textsf{socket}$ $\textsf{bind}$ $\textsf{listen}$ $\textsf{connect}$

commented in Computer Networks Dec 16, 2019

12.1k views

1 answer

21

TIFR CSE 2016 | Part B | Question: 11
Let $n \geq 4$ be an integer. Regard the set $\mathbb{R}^n$ as a vector space over $\mathbb{R}$. Consider the following undirected graph $H$ ... inifinite number of vertices The diameter of $H$ is infinite $H$ is conneceted $H$ contains an infinite clique $H$ contains an infinite independent set

answered in Graph Theory Dec 4, 2019

490 views

3 answers

22

TIFR CSE 2016 | Part A | Question: 13
Let $n \geq 2$ be any integer. Which of the following statements is not necessarily true? $\begin{pmatrix} n \\ i \end{pmatrix} = \begin{pmatrix} n-1 \\ i \end{pmatrix} + \begin{pmatrix} n-1 \\ i-1 \end{pmatrix}, \text{ where } 1 \leq i \leq n-1$ $n!$ divides the ... $ i \in \{1, 2, \dots , n-1\}$ If $n$ is an odd prime, then $n$ divides $2^{n-1} -1$

commented in Combinatory Dec 4, 2019

651 views

1 answer

23

right and left quotient in regular language
how to find L1/L2 for some L1 and L2 (is diagram making must ) how to conclude that L1 is divisible or not divisible by L2

comment edited in Theory of Computation Oct 22, 2019

12.8k views

1 answer

24

IIIT BLR TEST 1 : ALGORITHMS 1
Solve the following recursions ( in terms of Θ ). T(0) = T(1) = Θ(1) in all of the following. $T(n) = n + \frac{1}{n}\sum_{i=0}^{i=n-1}T(i)$ $T(n) = n + \frac{2}{n}\sum_{i=0}^{i=n-1}T(i)$ $T(n) = n + \frac{4}{n}\sum_{i=0}^{i=n/2}T(i)$ $T(n) = n + \frac{40}{n}\sum_{i=0}^{i=n/5}T(i)$

answered in Algorithms Aug 28, 2019

608 views