Recent activity by thor / GATE Overflow for GATE CSE

3 answers

1

Question
Find minimal states in DFA accepting {w1aw2, |w1| = 2, |w2| >=3, w1,w2 $\in$ $(a+b)^*$}? Is it $7$ or $8$?

Find minimal states in DFA accepting {w1aw2, |w1| = 2, |w2| >=3, w1,w2 $\in$ $(a+b)^*$}?Is it $7$ or $8$?

641 views

asked Feb 11, 2017

1 answer

2

NPTEL-Design and Analysis of Algorithms-Week1-Quiz-1-Q3
An algorithm has two phases. The first phase, initialization, takes time O(n2 log n). The second phase, which is the main computation, takes time O(n3). What is the most accurate description of the complexity of the overall algorithm? O(n2 log n) O(n3) O(n3 log n) O(n3 + log n) Im getting option 2 , is it correct ?

An algorithm has two phases. The first phase, initialization, takes time O(n2 log n). The second phase, which is the main computation, takes time O(n3). What is the most ...

8.5k views

commented Jan 24, 2017

1 answer

3

Graph MST
For a simple, undirected, weighted graph each edge havind distinct weight, How is it possible that there can be more than $1$ second best minimum spanning tree?

For a simple, undirected, weighted graph each edge havind distinct weight, How is it possible that there can be more than $1$ second best minimum spanning tree?

427 views

commented Jan 24, 2017

1 answer

4

Mock Test
Is statement 1 true for all safe expressions ?

Is statement 1 true for all safe expressions ?

873 views

commented Jan 24, 2017

0 answers

5

set theory

160 views

asked Jan 24, 2017

2 answers

6

Data Hazards [GateBook]

2.0k views

commented Jan 24, 2017

1 answer

7

Threading in OS [GateBook]

704 views

commented Jan 24, 2017

3 answers

8

bst
What would be the worst case time complexity to build binary search tree with given arbitrary n elements? A) O(nlogn) B) O(n) C) O() D) O(log n)

What would be the worst case time complexity to build binary search tree with given arbitrary n elements?A) O(nlogn)B) O(n)C) O()D) O(log n)

5.3k views

commented Jan 24, 2017

1 answer

9

Are the following regular expressions are correct?
1. {$wxw$ | x,w belong to $(0+1)^*$} = = $(0+1)^*$ 2. {$wxw$ | x,w belong to $(0+1)^+$} = = $0(0+1)^+0 + 1(0+1)^+1$ 3. {$wxw^r$ |x,w belong to $(0+1)^+$} = = $0(0+1)^+0 + 1(0+1)^+1$ 4. {$xww^rx$ | x,w belong to $(0+1)^+$} = = $(0+1)^+00(0+1)^+ + (0+1)^+11(0+1)^+$ 5. {$xwyw$ | x,w belong to $(0+1)^+$} = = $(0+1)^+0(0+1)^+0 + (0+1)^+1(0+1)^+1$

1. {$wxw$ | x,w belong to $(0+1)^*$} = = $(0+1)^*$2. {$wxw$ | x,w belong to $(0+1)^+$} = = $0(0+1)^+0 + 1(0+1)^+1$3. {$wxw^r$ |x,w belong to $(0+1)^+$} = = $0(0+1)^...

384 views

commented Jan 24, 2017

1 answer

10

MadeEasy CBT 2017:General Aptitude - Clock Time
The traffic lights at three different road crossing change after 24 sec , 56sec , 36sec respectively If they all change simultaneously at 10:00 AM. At what time will they again change simultaneously 10:16:54 AM 10:18:00 AM 10:17:02 AM 10:22:12 AM

The traffic lights at three different road crossing change after 24 sec , 56sec , 36sec respectively If they all change simultaneously at 10:00 AM. At what time will th...

631 views

commented Jan 23, 2017

1 answer

11

Regular and CFL (TestBook Test Series 2)

647 views

commented Jan 23, 2017

5 answers

12

MadeEasy CBT 2017: Algorithms - Graph Algorithms
No of topological sortings

No of topological sortings

2.1k views

commented Jan 22, 2017

1 answer

13

DAG ace test question
How does answer change when it is in SSA form? does answer remains 4 or 5

How does answer change when it is in SSA form? does answer remains 4 or 5

675 views

commented Jan 22, 2017

0 answers

14

find output

390 views

commented Jan 22, 2017

0 answers

15

find output

307 views

asked Jan 22, 2017

2 answers

16

please answer

222 views

asked Jan 22, 2017

3 answers

17

Test by Bikram | Mock GATE | Test 1 | Question: 26
Suppose we have a block-addressable disk drive. With such block organized disk non data overhead of subblocks and, interblock gaps have to be accounted for. There are $40,000$ bytes per track and the amount of space taken up by subblocks ... to the stored in each block in a file. A block is organized to hold an integral number of logical records.

Suppose we have a block-addressable disk drive. With such block organized disk non data overhead of subblocks and, interblock gaps have to be accounted for.There are $40,...

998 views

commented Jan 22, 2017

4 answers

18

Test by Bikram | Mock GATE | Test 1 | Question: 36
A pipeline system is affected by branch instruction. The penalty for the branch instruction is $3$ stall cycle, if $33\%$ of instruction is branch instruction and pipeline is operated with a clock of $10$ $ns$ and providing the speed up factor $8$, then the number of stage in pipeline is _______

A pipeline system is affected by branch instruction. The penalty for the branch instruction is $3$ stall cycle, if $33\%$ of instruction is branch instruction and pipelin...

1.3k views

commented Jan 22, 2017

1 answer

19

Test by Bikram | Mock GATE | Test 1 | Question: 47
For the given grammar consider the statements: $S' \rightarrow S$ $S \rightarrow aAd \mid bBd \mid aBe \mid bAe$ $A \rightarrow c$ $B \rightarrow c$ Which of the following statement is/are true? S1: The given grammar is LR(l). S2: On merger the grammar will generate reduce reduce conflict. Only S1 Only S2 Both S1 and S2 None of S1 and S2

For the given grammar consider the statements:$S' \rightarrow S$$S \rightarrow aAd \mid bBd \mid aBe \mid bAe$$A \rightarrow c$$B \rightarrow c$Which of the following...

718 views

commented Jan 22, 2017

2 answers

20

Test by Bikram | Mock GATE | Test 1 | Question: 25
Which of the following is true? Blind writes appear in any view serializable schedule that is not conflict serializable. Blind writes appear in some view serializable schedule that is also conflict serializable. Blind writes appear in all view ... in conflict serializable schedule that is not view serializable. II and III II and IV I only I and II

Which of the following is true? Blind writes appear in any view serializable schedule that is not conflict serializable. Blind writes appear in some view serializable...

1.2k views

commented Jan 22, 2017

1 answer

21

Test by Bikram | Mock GATE | Test 1 | Question: 12
Which of the following should be allowed only in Kernel mode? Changing mapping from virtual to physical address Mask and unmask interrupts Disabling all interrupts Reading processor status register Receive a packet of data from the network Cause a trap $(i)$, $(ii)$ , $(iii)$ ... $(vi)$ $(i)$, $(ii)$, $(iii)$, $(iv)$, $(v)$ and $(vi)$

Which of the following should be allowed only in Kernel mode? Changing mapping from virtual to physical address Mask and unmask interrupts Disabling all interrupts Readin...

894 views

commented Jan 22, 2017

1 answer

22

Test by Bikram | Mock GATE | Test 1 | Question: 61
The simplest animals are those whose bodies are simplest in structure and which do the things done by all living animals, such as eating, breathing, moving, and feeling, in the most ________ way. Haphazard Bizarre Primitive Advantageous

The simplest animals are those whose bodies are simplest in structure and which do the things done by all living animals, such as eating, breathing, moving, and feeling, ...

387 views

commented Jan 22, 2017

2 answers

23

Test by Bikram | Mock GATE | Test 1 | Question: 8
Consider the schedule given below. $T_1$ and $T_2$ are two transactions operating on two resources $x$ and $y.$ ... The given schedule is A serializable schedule A non-serializable schedule A dead lock situation Both non-serializable and deadlock schedule

Consider the schedule given below. $T_1$ and $T_2$ are two transactions operating on two resources $x$ and $y.$$$\begin{array}{|c|c|c|} \hline \bf{T_1} & \bf{T_2} \\ \hli...

1.3k views

commented Jan 22, 2017

2 answers

24

Test by Bikram | Mock GATE | Test 1 | Question: 60
Read the following passage carefully, and answer the question that follows: People who oppose the law that makes it mandatory for two wheeler riders to wear helmets argue that in a democracy, people have the right to take risks as long ... laws is lower than in states with no laws. A great number of people die in road accidents even otherwise.

Read the following passage carefully, and answer the question that follows:People who oppose the law that makes it mandatory for two wheeler riders to wear helmets argue ...

973 views

commented Jan 22, 2017

0 answers

25

PDautomata
What is language accepted by above PDA, where 0 is final state and 1 denotes non-final state ?

What is language accepted by above PDA, where 0 is final state and 1 denotes non-final state ?

224 views

edited Jan 16, 2017

0 answers

26

Number of possible TCP connections
Between a pair of IP addresses X and Y, what is the maximum number of simultaneous TCP connections possible?

Between a pair of IP addresses X and Y, what is the maximum number of simultaneous TCP connections possible?

431 views

commented Jan 15, 2017

0 answers

27

L={<M> | M is a turing machine and it takes less than 481 steps on some input>
L={<M> | M is a turing machine and it takes less than 481 steps on some input> decidable or R.E?? i think it is decidable..just confirm it pls

L={<M | M is a turing machine and it takes less than 481 steps on some input>decidable or R.E??i think it is decidable..just confirm it pls

2.4k views

commented Jan 15, 2017

2 answers

28

L={<M> : M is a TM that accepts all even numbers }
L={<M> : M is a TM that accepts all even numbers } is it recursive/R.E??

L={<M : M is a TM that accepts all even numbers }is it recursive/R.E??

3.5k views

commented Jan 15, 2017

0 answers

29

logic
Which of above three are valid. I know A3 is valid.

Which of above three are valid. I know A3 is valid.

176 views

asked Jan 15, 2017

1 answer

30

algo + bfs

312 views

asked Jan 15, 2017

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