Recent activity - GATE Overflow

+45 votes

7 answers

1

GATE2005-IT-41
Given below is a program which when executed spawns two concurrent processes : semaphore $X : = 0 ;$ /* Process now forks into concurrent processes $P1$ & $P2$ */ $\begin{array}{|l|l|}\hline \text{$P1$} & \text{$ ... (II) are true. (I) is true but (II) is false. (II) is true but (I) is false Both (I) and (II) are false

commented 1 hour ago in Operating System by srestha | 8.1k views

+31 votes

7 answers

2

GATE2008-IT-39
Consider a CPU where all the instructions require $7$ clock cycles to complete execution. There are $140$ instructions in the instruction set. It is found that $125$ control signals are needed to be generated by the control unit. While designing the horizontal microprogrammed ... minimum size of the control word and control address register? $125, 7$ $125, 10$ $135, 9$ $135, 10$

commented 1 hour ago in CO and Architecture by rishabhsharma | 6.1k views

+26 votes

1 answer

3

GATE2015-1-3
For any two languages $L_{1}$ and $L_{2}$ such that $L_{1}$ is context-free and $L_{2}$ is recursively enumerable but not recursive, which of the following is/are necessarily true? $\bar{L}_{1}$ ( Compliment of $L_{1}$) is recursive $\bar{L}_{2}$ ... $\bar{L}_{1}$ ∪ $L_{2}$ is recursively enumerable I only III only III and IV only I and IV only

commented 2 hours ago in Theory of Computation by roh | 2.6k views

+44 votes

1 answer

4

GATE2010-17
Let $L_1$ be the recursive language. Let $L_2$ and $L_3$ be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true? $L_2 - L_1 \:\text{is recursively enumerable.}$ $L_1 - L_3 \:\text{is recursively enumerable.}$ $L_2 \cap L_3 \:\text{is recursively enumerable.}$ $L_2 \cup L_3 \:\text{is recursively enumerable.}$

commented 2 hours ago in Theory of Computation by roh | 5.2k views

+20 votes

2 answers

5

GATE1990-3-vi
Choose the correct alternatives (More than one may be correct). Recursive languages are: A proper superset of context free languages. Always recognizable by pushdown automata. Also called type $0$ languages. Recognizable by Turing machines.

commented 2 hours ago in Theory of Computation by roh | 2.6k views

+18 votes

6 answers

6

GATE1999-2-18, ISRO2008-46
Raid configurations of the disks are used to provide Fault-tolerance High speed High data density (A) & (B)

commented 3 hours ago in Operating System by soram | 4.7k views

+1 vote

3 answers

7

ISI2015-MMA-3
Let $x$ be a positive real number. Then $x^2+\pi ^2 + x^{2 \pi} > x \pi+ (\pi + x) x^{\pi}$ $x^{\pi}+\pi^x > x^{2 \pi} + \pi ^{2x}$ $\pi x +(\pi+x)x^{\pi} > x^2+\pi ^2 + x^{2 \pi}$ none of the above

answered 6 hours ago in Numerical Ability by EuclideanSpace | 173 views

+48 votes

9 answers

8

GATE2006-54
Given two arrays of numbers $a_{1},...,a_{n}$ and $b_{1},...,b_{n}$ where each number is $0$ or $1$, the fastest algorithm to find the largest span $(i, j)$ such that $ a_{i}+a_{i+1}+\dots+a_{j}=b_{i}+b_{i+1}+\dots+b_{j}$ or report that ... $\Theta (n)$ time and space Takes $O(\sqrt n)$ time only if the sum of the $2n$ elements is an even number

answered 7 hours ago in Algorithms by Zaman3027 | 7.9k views

+3 votes

3 answers

9

ISRO2020-12
If $ABCD$ is a $4$-bit binary number, then what is the code generated by the following circuit? BCD code Gray code $8421$ code Excess-$3$ code

edited 8 hours ago in Digital Logic by soujanyareddy13 | 348 views

+22 votes

3 answers

10

GATE1994-26
A queue $Q$ containing $n$ items and an empty stack $S$ are given. It is required to transfer all the items from the queue to the stack, so that the item at the front of queue is on the TOP of the stack, and the order of all other items ... operations which can be performed on the queue and stack are Delete, Insert, Push and Pop. Do not assume any implementation of the queue or stack.

commented 8 hours ago in DS by prithatiti | 2.1k views

+75 votes

5 answers

11

GATE2014-2-36
Let $L_1=\{w\in\{0,1\}^*\mid w$ $\text{ has at least as many occurrences of }$ $(110)'$ $\text{s as }$ $(011)'$ $\text{s} \}$. Let $L_2=\{w \in\{0,1\}^*\ \mid w$ $ \text{ has at least as many occurrences of }$ $(000)'$ ... the following is TRUE? $L_1$ is regular but not $L_2$ $L_2$ is regular but not $L_1$ Both $L_1$ and $L_2$ are regular Neither $L_1$ nor $L_2$ are regular

commented 9 hours ago in Theory of Computation by roh | 9.5k views

+8 votes

2 answers

12

Please explain this question .. Number of trivial substrings in “GATE2013” are: A. 37 B. 35 C. 2 D. 36

commented 9 hours ago in Combinatory by Roh8raj | 4.6k views

0 votes

0 answers

13

Function Pointer question
#include<stdio.h> int main ( ) { int demo ( ); // What is this and what does it do? demo ( ); (*demo) ( ); } int demo ( ) { printf("Morning"); }

commented 9 hours ago in Programming by vipin.gautam1906 | 162 views

+51 votes

4 answers

14

GATE2003-54
Define languages $L_0$ and $L_1$ as follows : $L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $ $L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts on }w\}$ Here $\langle M, w, i \rangle$ is a triplet, whose first component ... $L'$ is not $L'$ is recursively enumerable, but $ L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable

comment edited 10 hours ago in Theory of Computation by roh | 8.6k views

+6 votes

2 answers

15

ISRO2007-02
The circuit shown in the following figure realizes the function. $(\overline{A+B}+C)(\bar{D}\bar{E})$ $(\overline{A+B}+C)(D\bar{E})$ $(A+ \overline{B+C})(\bar{D}E)$ $(A+ B+\bar{C})(\bar{D} \bar{E})$

edited 10 hours ago in Digital Logic by soujanyareddy13 | 2k views

+29 votes

3 answers

16

GATE2004-IT-53
An array of integers of size $n$ can be converted into a heap by adjusting the heaps rooted at each internal node of the complete binary tree starting at the node $\left \lfloor (n - 1) /2 \right \rfloor$, and doing this adjustment up to the root node (root node is at index $0$) in ... required to construct a heap in this manner is $O(\log n)$ $O(n)$ $O (n \log \log n)$ $O(n \log n)$

commented 11 hours ago in DS by s_dr_13 | 3.4k views

+37 votes

2 answers

17

GATE2001-12
Consider a $5-$stage pipeline - IF (Instruction Fetch), ID (Instruction Decode and register read), EX (Execute), MEM (memory), and WB (Write Back). All (memory or register) reads take place in the second phase of a clock cycle and all ... Show all data dependencies between the four instructions. Identify the data hazards. Can all hazards be avoided by forwarding in this case.

commented 11 hours ago in CO and Architecture by Dhiraj_45 | 5.7k views

0 votes

2 answers

18

Doubt on Write through
Consider the following specifications: Hit ratio for read = 0.8, Hit ratio for write = 0.9 Block size =2 words, cache of 10 ns is 10 times faster than main memory On any miss entire block is moved from main memory to cache memory 20% references are for write operations What is avg access time with write through using 1) Write allocate 2) No write allocate

comment edited 12 hours ago in CO and Architecture by pranavsettaluri9 | 237 views

0 votes

1 answer

19

UGCNET-DEC2018-II: 14
A computer uses a memory unit with $256$ K words of $32$ bits each. A binary instruction code is stored in one word of memory. The instruction has four parts: an indirect bit, an operation code and a register code part to specify one of $64$ registers and an address part. ... the operation code, the register code part and the address part? $7,6,18$ $6,7,18$ $7,7,18$ $18,7,7$

commented 12 hours ago in Unknown Category by Shaik Masthan | 357 views

0 votes

1 answer

20

relations
Let R be a reflexive relation on set A for any three elements a,b,c belongs to A if (aRb and bRc) +> (cRa) then which if the following is true? a)R is symmetric but not transitive b)R is transitive but not symmetric c)R is an equivalence relation d)R is neither symmetric nor transitive

commented 14 hours ago in Mathematical Logic by srestha | 103 views

0 votes

1 answer

21

Self Doubt : Regarding TLB entry for a page not present in memory
If a page is not present in the memory, then its corresponding entry in the page table would have the ‘Present’ bit set as 0 to indicate , the page is not present. Will this entry be considered for caching in TLB? As I understand from above line in Tanenbaum, The entry should not be present in TLB. Is my understanding right?

commented 14 hours ago in Operating System by Neelam_$ingh_222 | 84 views

+57 votes

3 answers

22

GATE2017-1-39
Let $A$ and $B$ be finite alphabets and let $\#$ be a symbol outside both $A$ and $B$. Let $f$ be a total function from $A^{*}$ to $B^{*}$. We say $f$ is computable if there exists a Turing machine $M$ ... If $f$ is computable then $L_{f}$ is recursive, but not conversely. If $f$ is computable then $L_{f}$ is recursively enumerable, but not conversely.

commented 15 hours ago in Theory of Computation by Twinkle Shukla | 7.6k views

+36 votes

7 answers

23

GATE2016-1-43
Consider the transition diagram of a PDA given below with input alphabet $\Sigma=\{a,b\}$ and stack alphabet $\Gamma = \{X,Z\}$. $Z$ is the initial stack symbol. Let $L$ ... that halts on every input $L =\{a^n\mid n \geq0 \} \cup \{a^nb^n \mid n \geq 0\}$ and is deterministic context-free

commented 15 hours ago in Theory of Computation by Twinkle Shukla | 6.7k views

+4 votes

1 answer

24

Packet switching
Q 30). Consider a route in a store and forward networking going through $9$ intermediate nodes.The packet contains $1100$ bits and are transmitted at $64 \ Kpbs $ . Assume propogation delay over the links are negligible.As packet travels along the route, it ... for the packets to get to the receiver if the nodes transmit on a " first come first served" basis (in ms) ?

commented 21 hours ago in Computer Networks by Hradesh patel | 1.1k views

+15 votes

2 answers

25

TIFR2017-B-14
Consider the following grammar $G$ with terminals $\{[, ]\}$, start symbol $S$, and non-terminals $\{A, B, C\}$: $S \rightarrow AC \mid SS \mid AB$ $C \rightarrow SB$ $A \rightarrow [$ $B \rightarrow ]$ A language $L$ is called prefix-closed if for ... free $L(G)$ is infinite $L(G)$ can be recognized by a deterministic push down automaton $L(G)$ is prefix-closed $L(G)$ is recursive

commented 23 hours ago in Theory of Computation by roh | 799 views

+25 votes

2 answers

26

TIFR2014-B-13
Let $L$ be a given context-free language over the alphabet $\left\{a, b\right\}$. Construct $L_{1},L_{2}$ as follows. Let $L_{1}= L - \left\{xyx\mid x, y \in \left\{a, b\right\}^*\right\}$, and $L_{2} = L \cdot L$. Then, Both $L_{1}$ and $L_{2}$ ... and $L_{2}$ is context free. $L_{1}$ and $L_{2}$ both may not be context free. $L_{1}$ is regular but $L_{2}$ may not be context free.

commented 23 hours ago in Theory of Computation by roh | 1.1k views

+64 votes

4 answers

27

GATE2013-39
A certain computation generates two arrays a and b such that $a[i] = f(i)$ for $0 \leq i < n$ and $b[i] = g(a[i])$ for $0 \leq i < n$. Suppose this computation is decomposed into two concurrent processes $X$ and $Y$ such that $X$ computes the array $a$ and $Y$ computes the array $b$. The ... ); } EntryY(R, S) { V(S); P(R); } ExitX(R, S) { V(R); P(S); } EntryY(R, S) { V(S); P(R); }

answered 23 hours ago in Operating System by HarshJoshi | 12.1k views

+1 vote

1 answer

28

COA: Cache Accesss Time
Little confusion with these questions. What will be o/p for these two questions one with Write back and the other is Write through. 1.)A 128 word cache and main memory are divided into 8 word blocks. The access time of a cache ... average access time? What will be the default technique ( write-allocate and no write-allocate)followed for Hierarchal and Simultaneous access ?

answered 1 day ago in CO and Architecture by Shikha shree | 155 views

+23 votes

8 answers

29

GATE2019-46
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at random. The expected value of the distance between $a$ and $b$ in $T$ (ie., the number of edges in the unique path between $a$ and $b$) is (rounded off to $2$ decimal places) _________.

answered 1 day ago in DS by Jhaiyam | 8.9k views

+58 votes

8 answers

30

GATE2014-2-47
The product of the non-zero eigenvalues of the matrix is ____ $\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 \end{pmatrix}$

commented 1 day ago in Linear Algebra by hello_manish | 13.2k views

To see more, click for the full list of questions or popular tags.

Recent activity

52,345 questions

60,501 answers

201,879 comments

95,329 users