Recent activity by Shubhm / GATE Overflow for GATE CSE

7 answers

1

GATE CSE 2014 Set 2 | Question: 37
Consider two strings $A$="qpqrr" and $B$="pqprqrp". Let $x$ be the length of the longest common subsequence (not necessarily contiguous) between $A$ and $B$ and let $y$ be the number of such longest common subsequences between $A$ and $B$. Then $x +10y=$ ___.

Consider two strings $A$="qpqrr" and $B$="pqprqrp". Let $x$ be the length of the longest common subsequence (not necessarily contiguous) between $A$ and $B$ and let $y$ b...

17.2k views

comment edited Aug 29, 2020

1 answer

2

TIFR CSE 2018 | Part A | Question: 1
Consider a point $A$ inside a circle $C$ that is at distance $9$ from the centre of a circle. Suppose you told that there is a chord of length $24$ passing through $A$ with $A$ as its midpoint. How many distinct chords of $C$ have integer length and pass through $A?$ $2$ $6$ $7$ $12$ $14$

Consider a point $A$ inside a circle $C$ that is at distance $9$ from the centre of a circle. Suppose you told that there is a chord of length $24$ passing through $A$ wi...

1.5k views

commented Jan 22, 2020

3 answers

3

GATE CSE 2012 | Question: 42
Consider the virtual page reference string $\text{1, 2, 3, 2, 4, 1, 3, 2, 4, 1}$ on a demand paged virtual memory system running on a computer system that has main memory size of $3$ page frames which are initially empty. Let $\text{LRU}$, $\text{FIFO}$ ... $\text{OPTIMAL} < \text{FIFO} < \text{LRU}$ $\text{OPTIMAL} = \text{LRU}$ $\text{OPTIMAL} = \text{FIFO}$

Consider the virtual page reference string$$\text{1, 2, 3, 2, 4, 1, 3, 2, 4, 1}$$on a demand paged virtual memory system running on a computer system that has main memory...

10.5k views

commented Dec 17, 2019

4 answers

4

GATE CSE 1995 | Question: 9
Translate the arithmetic expression $a^\ast -(b+c)$ into syntax tree. A grammar is said to have cycles if it is the case that $A \overset{+}{\Rightarrow} A$ Show that no grammar that has cycles can be $\text{LL(1)}.$

Translate the arithmetic expression $a^\ast -(b+c)$ into syntax tree.A grammar is said to have cycles if it is the case that $A \overset{+}{\Rightarrow} A$ Show that no g...

6.7k views

commented Dec 17, 2019

5 answers

5

GATE CSE 2004 | Question: 29
The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of $n$ $n^2$ $n \log n$ $n \log^2n$

The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of$n$$n^2$$n \log n$$n \log^2n$

33.8k views

commented Dec 16, 2019

12 answers

6

GATE CSE 2003 | Question: 61
In a permutation $a_1 ... a_n$, of n distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i > a_j$. If all permutations are equally likely, what is the expected number of inversions in a randomly chosen permutation of $1. . . n$? $\frac{n(n-1)}{2}$ $\frac{n(n-1)}{4}$ $\frac{n(n+1)}{4}$ $2n[\log_2n]$

In a permutation $a_1 ... a_n$, of n distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i a_j$.If all permutations are equally likel...

22.2k views

commented Dec 15, 2019

17 answers

7

GATE CSE 2016 Set 1 | Question: 26
The coefficient of $x^{12}$ in $\left(x^{3}+x^{4}+x^{5}+x^{6}+\dots \right)^{3}$ is ___________.

The coefficient of $x^{12}$ in $\left(x^{3}+x^{4}+x^{5}+x^{6}+\dots \right)^{3}$ is ___________.

26.2k views

commented Dec 13, 2019

1 answer

8

Test by Bikram | Operating Systems | Test 2 | Question: 18
Consider a system with five processes $P0$ to $P4$ and three resources $R1$, $R2$ and $R3$, each having $10, \ 5, \ 7$ instances respectively. The system table at time $T0$ ... $P1, P4, P2, P3, P0$ $P3, P1, P2, P4, P0$ $P1, P4, P3, P0, P2$

Consider a system with five processes $P0$ to $P4$ and three resources $R1$, $R2$ and $R3$, each having $10, \ 5, \ 7$ instances respectively. The system table at time $T...

792 views

commented Dec 13, 2019

7 answers

9

GATE CSE 2003 | Question: 35
Consider the following recurrence relation $T(1)=1$ $T(n+1) = T(n)+\lfloor \sqrt{n+1} \rfloor$ for all $n \geq 1$ The value of $T(m^2)$ for $m \geq 1$ is $\frac{m}{6}\left(21m-39\right)+4$ $\frac{m}{6}\left(4m^2-3m+5\right)$ $\frac{m}{2}\left(3m^{2.5}-11m+20\right)-5$ $\frac{m}{6}\left(5m^3-34m^2+137m-104\right)+\frac{5}{6}$

Consider the following recurrence relation$T(1)=1$$T(n+1) = T(n)+\lfloor \sqrt{n+1} \rfloor$ for all $n \geq 1$The value of $T(m^2)$ for $m \geq 1$ is$\frac{m}{6}\left(21...

14.0k views

commented Dec 13, 2019

1 answer

10

Test by Bikram | Theory of Computation | Test 2 | Question: 12
Choose the regular expression corresponding to the given DFA : $(00 ^*1 + 11^* 0) (0 + 1) ^*$ $((11) ^* 0 + 00 ^* 1)(0 + 1) ^*$ $(11) ^* (0 ^* 1 + 1^* 0) (0 + 1) ^*$ $(11) ^* (00 ^* 1 + 10) (0 + 1) ^*$

Choose the regular expression corresponding to the given DFA :$(00 ^*1 + 11^* 0) (0 + 1) ^*$$((11) ^* 0 + 00 ^* 1)(0 + 1) ^*$$(11) ^* (0 ^* 1 + 1^* 0) (0 + 1) ^*$$(11) ^*...

312 views

commented Dec 12, 2019

7 answers

11

GATE CSE 2001 | Question: 1.16
Let $f(n) = n^2 \log n$ and $g(n) = n(\log n)^{10}$ be two positive functions of $n$. Which of the following statements is correct? $f(n) = O(g(n)) \text{ and } g(n) \neq O(f(n))$ $g(n) = O(f(n)) \text{ and } f(n) \neq O(g(n))$ $f(n) \neq O(g(n)) \text{ and } g(n) \neq O(f(n))$ $f(n) =O(g(n)) \text{ and } g(n) = O(f(n))$

Let $f(n) = n^2 \log n$ and $g(n) = n(\log n)^{10}$ be two positive functions of $n$. Which of the following statements is correct?$f(n) = O(g(n)) \text{ and } g(n) \neq ...

19.1k views

commented Dec 11, 2019

2 answers

12

GATE CSE 1990 | Question: 15a
Is the language generated by the grammar $G$ regular? If so, give a regular expression for it, else prove otherwise G: $S \rightarrow aB$ $B \rightarrow bC$ $C \rightarrow xB$ $C \rightarrow c$

Is the language generated by the grammar $G$ regular? If so, give a regular expression for it, else prove otherwiseG: $S \rightarrow aB$$B \rightarrow bC$$C \rightarro...

3.3k views

commented Dec 10, 2019

2 answers

13

TIFR CSE 2017 | Part B | Question: 4
Let $L$ be the language over the alphabet $\{1, 2, 3, (, )\}$ generated by the following grammar (with start symbol $S$, and non-terminals $\{A, B, C\}$ ... $L$ is finite $L$ is not recursively enumerable $L$ is regular $L$ contains only strings of even length $L$ is context-free but not regular

Let $L$ be the language over the alphabet $\{1, 2, 3, (, )\}$ generated by the following grammar (with start symbol $S$, and non-terminals $\{A, B, C\}$):$ S \rightarrow ...

2.5k views

commented Dec 9, 2019

5 answers

14

GATE CSE 1996 | Question: 2.23
Consider the following state table for a sequential machine. The number of states in the minimized machine will be ... $4$ $3$ $2$ $1$

Consider the following state table for a sequential machine. The number of states in the minimized machine will be$$\begin{array}{|l|l|ll|}\hline \text{} & \text{} & \tex...

13.1k views

commented Dec 9, 2019

9 answers

15

GATE CSE 1991 | Question: 17,b
Let $L$ be the language of all binary strings in which the third symbol from the right is a $1$. Give a non-deterministic finite automaton that recognizes $L$. How many states does the minimized equivalent deterministic finite automaton have? Justify your answer briefly?

Let $L$ be the language of all binary strings in which the third symbol from the right is a $1$. Give a non-deterministic finite automaton that recognizes $L$. How many s...

13.8k views

commented Dec 8, 2019

5 answers

16

GATE IT 2006 | Question: 34
In the context-free grammar below, $S$ is the start symbol, $a$ and $b$ are terminals, and $\epsilon$ denotes the empty string. $S \to aSAb \mid \epsilon$ $A \to bA \mid \epsilon$ The grammar generates the language $((a + b)^* b)$ $\{a^mb^n \mid m \leq n\}$ $\{a^mb^n \mid m = n)$ $a^* b^*$

In the context-free grammar below, $S$ is the start symbol, $a$ and $b$ are terminals, and $\epsilon$ denotes the empty string.$S \to aSAb \mid \epsilon$$A \to bA \mid \e...

8.1k views

commented Dec 8, 2019

6 answers

17

GATE CSE 2003 | Question: 79
A processor uses $\text{2-level}$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, ... tables of this process is $\text{8 KB}$ $\text{12 KB}$ $\text{16 KB}$ $\text{20 KB}$

A processor uses $\text{2-level}$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical...

24.2k views

commented Dec 5, 2019

4 answers

18

GATE CSE 2007 | Question: 17
Consider the following statements about user level threads and kernel level threads. Which one of the following statements is FALSE? Context switch time is longer for kernel level threads than for user level threads. User level threads do ... be scheduled on different processors in a multi-processor system. Blocking one kernel level thread blocks all related threads.

Consider the following statements about user level threads and kernel level threads. Which one of the following statements is FALSE?Context switch time is longer for kern...

21.5k views

commented Dec 4, 2019

5 answers

19

GATE IT 2007 | Question: 56
Synchronization in the classical readers and writers problem can be achieved through use of semaphores. In the following incomplete code for readers-writers problem, two binary semaphores mutex and wrt are used to obtain synchronization wait (wrt) writing is performed signal ... mutex), wait (mutex), signal (wrt) signal (mutex), wait (mutex), signal (mutex), wait (mutex)

Synchronization in the classical readers and writers problem can be achieved through use of semaphores. In the following incomplete code for readers-writers problem, two ...

10.6k views

commented Dec 3, 2019

1 answer

20

GATE CSE 1996 | Question: 1.18
The process state transition diagram in the below figure is representative of a batch operating system an operating system with a preemptive scheduler an operating system with a non-preemptive scheduler a uni-programmed operating system

The process state transition diagram in the below figure is representative ofa batch operating systeman operating system with a preemptive scheduleran operating system wi...

8.8k views

comment edited Dec 2, 2019

3 answers

21

GATE CSE 2001 | Question: 20
Consider a disk with the $100$ tracks numbered from $0$ to $99$ rotating at $3000$ rpm. The number of sectors per track is $100$ and the time to move the head between two successive tracks is $0.2$ millisecond. Consider a set of disk ... at track $0$ and the elevator algorithm is used to schedule disk requests, what is the worse case time to complete all the requests?

Consider a disk with the $100$ tracks numbered from $0$ to $99$ rotating at $3000$ rpm. The number of sectors per track is $100$ and the time to move the head between two...

11.1k views

comment edited Dec 1, 2019

5 answers

22

GATE CSE 2007 | Question: 21
How many different non-isomorphic Abelian groups of order $4$ are there? $2$ $3$ $4$ $5$

How many different non-isomorphic Abelian groups of order $4$ are there?$2$$3$$4$$5$

19.8k views

commented Dec 1, 2019

4 answers

23

GATE IT 2008 | Question: 40
A non pipelined single cycle processor operating at $100\;\text{MHz}$ is converted into a synchronous pipelined processor with five stages requiring $2.5\;\text{nsec}, 1.5\;\text{nsec}, 2\;\text{nsec}, 1.5\;\text{nsec}$ and $2.5\;\text{nsec}$, respectively ... $4.5$ $4.0$ $3.33$ $3.0$

A non pipelined single cycle processor operating at $100\;\text{MHz}$ is converted into a synchronous pipelined processor with five stages requiring $2.5\;\text{nsec}, ...

13.9k views

commented Nov 30, 2019

6 answers

24

GATE CSE 2016 Set 1 | Question: 31
The size of the data count register of a $\text{DMA}$ controller is $16\;\text{bits}$. The processor needs to transfer a file of $29,154$ kilobytes from disk to main memory. The memory is byte addressable. The minimum number of times ... needs to get the control of the system bus from the processor to transfer the file from the disk to main memory is _________.

The size of the data count register of a $\text{DMA}$ controller is $16\;\text{bits}$. The processor needs to transfer a file of $29,154$ kilobytes from disk to main memo...

18.9k views

commented Nov 30, 2019

1 answer

25

GATE CSE 2011 | Question: 28
On a non-pipelined sequential processor, a program segment, which is the part of the interrupt service routine, is given to transfer $500$ bytes from an I/O device to memory. Initialize the address register Initialize the count to 500 LOOP: Load a byte from device Store ... is used in a place of the interrupt driven program based input-output? $3.4$ $4.4$ $5.1$ $6.7$

On a non-pipelined sequential processor, a program segment, which is the part of the interrupt service routine, is given to transfer $500$ bytes from an I/O device to mem...

15.8k views

commented Nov 30, 2019

2 answers

26

GATE2019 CE-1: GA-7
In a sports academy of $300$ peoples, $105$ play only cricket, $70$ play only hockey, $50$ play only football, $25$ play both cricket and hockey, $15$ play both hockey and football and $30$ play both cricket and football. The rest of them play all three sports. What is the percentage of people who play at least two sports? $23.30$ $25.00$ $28.00$ $50.00$

In a sports academy of $300$ peoples, $105$ play only cricket, $70$ play only hockey, $50$ play only football, $25$ play both cricket and hockey, $15$ play both hockey an...

3.3k views

commented Nov 27, 2019

1 answer

27

GATE2015 CE-2: GA-10
There are $16$ teachers who can teach Thermodynamics $\text{(TD)}$, $11$ who can teach Electrical Sciences $\text{(ES)}$, and $5$ who can teach both $\text{TD}$ and Engineering Mechanics $\text{(EM)}$. There are a total of $40$ teachers. $6$ cannot teach any of the three ... $\text{ES}$ and $\text{EM}$ but not $\text{TD}$? $1$ $2$ $3$ $4$

There are $16$ teachers who can teach Thermodynamics $\text{(TD)}$, $11$ who can teach Electrical Sciences $\text{(ES)}$, and $5$ who can teach both $\text{TD}$ and Engin...

4.6k views

commented Nov 27, 2019

4 answers

28

GATE2014 EC-3: GA-4
The next term in the series $81, 54, 36, 24,\dots $ is_________.

The next term in the series $81, 54, 36, 24,\dots $ is_________.

3.5k views

commented Nov 25, 2019

6 answers

29

GATE2019 EE: GA-10
Consider five people- Mita, Ganga, Rekha, Lakshmi, and Sana. Ganga is taller than both Rekha and Lakshmi. Lakshmi is taller than Sana. Mita is taller than Ganga. Which of the following conclusions are true? Lakshmi is taller than Rekha Rekha is shorter than Mita Rekha is taller than Sana Sana is shorter than Ganga $1$ and $3$ $3$ only $2$ and $4$ $1$ only

Consider five people- Mita, Ganga, Rekha, Lakshmi, and Sana. Ganga is taller than both Rekha and Lakshmi. Lakshmi is taller than Sana. Mita is taller than Ganga.Which of ...

1.9k views

answered Nov 25, 2019

2 answers

30

GATE2017 CE-1: GA-7
Students applying for hostel rooms are allotted rooms in order of seniority. Students already staying in a room will move if they get a room in their preferred list. Preferences of lower ranked applicants are ignored during allocation. Given the data below, which room will Ajit stay in ? ... $P$ $Q$ $R$ $S$

Students applying for hostel rooms are allotted rooms in order of seniority. Students already staying in a room will move if they get a room in their preferred list. Pref...

1.8k views

commented Nov 25, 2019

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