Questions by Vikrant Singh

5 votes

1 answer

1

maths_mocktest1_30
Let $G$ be a finite group. If $A$ and $B$ are subgroups of $G$ with orders 4 and 5 respectively, then $|A \cap B|$ = ______.

asked in Set Theory & Algebra Feb 4, 2015

2.3k views

3 votes

1 answer

2

maths_mocktest1_11

asked in Mathematical Logic Feb 4, 2015

421 views

1 vote

2 answers

3

maths_mocktest1_12
A. 1 B. 2 C. 3 D. 4

asked in Calculus Feb 4, 2015

642 views

3 votes

1 answer

4

permutation and combination

asked in Combinatory Feb 1, 2015

3.9k views

3 votes

1 answer

5

maths_mock_test4

asked in Set Theory & Algebra Feb 1, 2015

291 views

0 votes

2 answers

6

maths_mock_test2

asked in Graph Theory Feb 1, 2015

240 views

5 votes

1 answer

7

maths_mock_test
How many labelled sub-graphs of $K_n$ are isomorphic to $W_{n-1}$? (Where $K_n$ : Complete graph with $n$ vertices , $W_n$ : Wheel graph with $ n+1$ vertices) 1.$\frac{(n-1)!}{2}$ 2. $\frac{(n-2)!}{2}$ 3. $\frac{n!}{2(n-1)}$ 4. $\frac{n!}{2(n-1)^2}$

asked in Graph Theory Feb 1, 2015

574 views

1 vote

1 answer

8

To allow only one process in the critical section, value of a binary semaphore is initialized to __?

asked in Operating System Feb 1, 2015

603 views

1 vote

1 answer

9

The identification of common sub-expression and replacement of run-time computations by compile-time computations is ?

asked in Compiler Design Feb 1, 2015

4.1k views

3 votes

0 answers

10

Which of the following is true?

asked in Compiler Design Feb 1, 2015

287 views

14 votes

5 answers

11

No. of states in the minimal finite automata which accepts the binary strings whose equivalent is divisible by 32 is ________?

asked in Theory of Computation Feb 1, 2015

3.5k views

2 votes

2 answers

12

What is the worst case time complexity to find the gcd(m,n) using best algorithm known?
What is the worst case time complexity to find the gcd(m,n) using best algorithm known? A. O(log(min(m,n))) B, O(log(max(m,n)))

asked in Algorithms Jan 31, 2015

1.4k views

1 vote

3 answers

13

Sliding window size?
In sliding window protocol, assume a 3-bit sequence number field. A and B have windows, which has 3-bit sequence number. If A sends 3 frames and waits for all the 3 acknowledgments until the timer expires. Which of the following "could not be" the sender's "window ... correctly. But ACK's send by receivers may be lost. a. 4 b. 7 c. 6 d. 5 answer is given as 4.

asked in Computer Networks Jan 29, 2015

4.4k views

6 votes

2 answers

14

In P-persistent CSMA network there are 5 systems in a slot. The probability of station not transmitting the data is 0.6. Only two stations should transmit the data to avoid collision. What is the probability that channel is collision free?

asked in Computer Networks Jan 29, 2015

3.3k views

5 votes

2 answers

15

Find the number of minimal candidate keys of R?

asked in Databases Jan 29, 2015

1.4k views

6 votes

3 answers

16

Consider 3 transactions T1, T2 and T3 having 2, 3 and 4 operations respectively.
Consider $3$ transactions $T_1, T_2$ and $T_3$ having $2, 3$ and $4$ operations respectively. Find the number of concurrent schedules?

asked in Databases Jan 29, 2015

16.0k views

5 votes

1 answer

17

Find the grammar that generates inherently ambiguous context free language.

asked in Theory of Computation Jan 27, 2015

2.0k views

24 votes

1 answer

18

Which of the following languages are Recursively Enumerable language?
Which of the following languages are Recursively Enumerable language? $\{\langle M \rangle \mid M$ is a TM and there exist an input whose length is less than 100, on which $M$ halts$\}$ ... $\{ \langle M1, M2, M3 \rangle \mid L(M1) = L(M2) \cup L(M3) \}$ All of these

asked in Theory of Computation Jan 27, 2015

4.1k views

4 votes

2 answers

19

toc
Let $L_1 = \{a^nb^mc^n \mid m,n \geq 0 \}$ and $L_2 = \{a^nc^n \mid n \geq 0 \}$. Both $L_1$ and $L_2$ are context free languages. if $L = ( L_1 - L_2 )$ then $L$ is ____. a. Finite Language b. Regular language c. DCFL d. Not DCFL

asked in Theory of Computation Jan 27, 2015

1.3k views

5 votes

2 answers

20

equivalent regular expression?
Assume $R_1$, $R_2$, and $R_3$ are three regular expressions. Given $R_1 + R_2 \cdot R_3 = (R_1+R_2) \cdot (R_1+R_3)$ for any $R_2$ and $R_3$. Which of the following could be correct condition which always satisfies the above equation. 1. $R_1 = R_2$ 2. ... correct B) only 1 and 3 are correct C) only 2 and 3 are correct D) 1,2, and 3 are correct Answer is given as D

asked in Theory of Computation Jan 27, 2015

1.1k views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Questions by Vikrant Singh

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

Subjects

Questions by Vikrant Singh

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

Recent Posts

Subjects

Recent Blog Comments