Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Most viewed questions
49
votes
6
answers
101
GATE CSE 2019 | Question: 15
For $\Sigma = \{a ,b \}$, let us consider the regular language $L=\{x \mid x = a^{2+3k} \text{ or } x=b^{10+12k}, k \geq 0\}$. Which one of the following can be a pumping length (the constant guaranteed by the pumping lemma) for $L$ ? $3$ $5$ $9$ $24$
For $\Sigma = \{a ,b \}$, let us consider the regular language $L=\{x \mid x = a^{2+3k} \text{ or } x=b^{10+12k}, k \geq 0\}$. Which one of the following can be a pumping...
Arjun
33.9k
views
Arjun
asked
Feb 7, 2019
Theory of Computation
gatecse-2019
theory-of-computation
pumping-lemma
1-mark
+
–
97
votes
8
answers
102
GATE CSE 2005 | Question: 65
Consider a three word machine instruction $\text{ADD} A[R_0], @B$ The first operand (destination) $ A[R_0] $ uses indexed addressing mode with $R_0$ as the index register. The second operand (source) $ @B $ uses indirect addressing mode. $A$ and $B$ ... (first operand). The number of memory cycles needed during the execution cycle of the instruction is: $3$ $4$ $5$ $6$
Consider a three word machine instruction$\text{ADD} A[R_0], @B$The first operand (destination) $“A[R_0]”$ uses indexed addressing mode with $R_0$ as the index regist...
Kathleen
33.9k
views
Kathleen
asked
Sep 22, 2014
CO and Architecture
gatecse-2005
co-and-architecture
addressing-modes
normal
+
–
14
votes
3
answers
103
minimum number of NAND and NOR gates
Is there any systematic approach to find the minimum number of two input NAND gates and two input NOR gates to be used to impelement a binary expression? If there then please elaborate it for the function Y = A'B+B'C+CD' .
Is there any systematic approach to find the minimum number of two input NAND gates and two input NOR gates to be used to impelement a binary expression?If there then ple...
Nirmal Gaur
33.9k
views
Nirmal Gaur
asked
May 4, 2017
Digital Logic
digital-logic
min-no-gates
+
–
49
votes
10
answers
104
GATE CSE 2015 Set 2 | Question: 23
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could lead to a deadlock? $1$ $2$ $3$ $4$
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could l...
go_editor
33.8k
views
go_editor
asked
Feb 12, 2015
Operating System
gatecse-2015-set2
operating-system
resource-allocation
easy
+
–
27
votes
4
answers
105
GATE CSE 2007 | Question: 68, ISRO2016-73
The message $11001001$ is to be transmitted using the CRC polynomial $x^3 +1$ to protect it from errors. The message that should be transmitted is: $11001001000$ $11001001011$ $11001010$ $110010010011$
The message $11001001$ is to be transmitted using the CRC polynomial $x^3 +1$ to protect it from errors. The message that should be transmitted is:$11001001000$$110010010...
Kathleen
33.7k
views
Kathleen
asked
Sep 21, 2014
Computer Networks
gatecse-2007
computer-networks
error-detection
crc-polynomial
normal
isro2016
+
–
3
votes
1
answer
106
Solve this Equation T(n) = 8T(n/2) + n^2 where (T(1) = 1)
Deep99
33.7k
views
Deep99
asked
Jun 18, 2016
Algorithms
algorithms
recurrence-relation
+
–
67
votes
10
answers
107
GATE CSE 2009 | Question: 30
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be ... deadlock Only $P1$ and $P2$ will be in deadlock Only $P1$ and $P3$ will be in deadlock All three processes will be in deadlock
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used....
Kathleen
33.7k
views
Kathleen
asked
Sep 22, 2014
Operating System
gatecse-2009
operating-system
resource-allocation
normal
+
–
5
votes
1
answer
108
Carl Hamacher
Registers R1 and R2 of a computer contain the decimal values 1200 and 4600.What is the Effective address of the memory operand in each of the following instructions? a) Load 20(R1),R5 b) Move #3000,R5 c) Store R5,30(R1,R2) d) Add -(R2),R5 e) Subtract (R1)+,R5
Registers R1 and R2 of a computer contain the decimal values 1200 and 4600.What is the Effectiveaddress of the memory operand in each of the following instructions?a) Loa...
reena_kandari
33.6k
views
reena_kandari
asked
Jun 4, 2017
CO and Architecture
co-and-architecture
carl-hamacher
+
–
100
votes
9
answers
109
GATE CSE 2014 Set 2 | Question: 34
For a C program accessing $\mathbf{X[i] [j] [k]}$, the following intermediate code is generated by a compiler. Assume that the size of an integer is $32$ bits and the size of a character is $8$ bits. t0 = i ∗ 1024 t1 = j ∗ 32 t2 = k ∗ 4 t3 = t1 + t0 t4 ... as "char $\mathbf{X[4] [32] [8]}$ . $\mathbf{X}$ is declared as "char $\mathbf{X[32] [16] [2]}$ .
For a C program accessing $\mathbf{X[i] [j] [k]}$, the following intermediate code is generated by a compiler. Assume that the size of an integer is $32$ bits and the siz...
go_editor
33.5k
views
go_editor
asked
Sep 28, 2014
Compiler Design
gatecse-2014-set2
compiler-design
intermediate-code
programming-in-c
normal
+
–
0
votes
1
answer
110
Andrew S. Tanenbaum Edition 5th Exercise 3 Question 17 (Page No. 253)
A bit stream 10011101 is transmitted using the standard CRC method described in the text. The generator polynomial is x 3 + 1. Show the actual bit string transmitted. Suppose that the third bit from the left is inverted ... . Give an example of bit errors in the bit string transmitted that will not be detected by the receiver.
A bit stream 10011101 is transmitted using the standard CRC method described in thetext. The generator polynomial is x 3 + 1. Show the actual bit string transmitted. Supp...
ajaysoni1924
33.3k
views
ajaysoni1924
asked
Mar 16, 2019
Computer Networks
computer-networks
tanenbaum
crc-polynomial
error-detection
data-link-layer
+
–
2
votes
1
answer
111
NIELIT 2017 July Scientist B (IT) - Section B: 42
Which of the following is false about abstract classes in Java? If we derive an abstract class and do not implement all the abstract methods, then the derived class should also be marked as abstract using 'abstract' ... . A class can be made abstract without any abstract method. A class can inherit from multiple abstract classes.
Which of the following is false about abstract classes in Java?If we derive an abstract class and do not implement all the abstract methods, then the derived class should...
admin
33.3k
views
admin
asked
Mar 30, 2020
Java
nielit2017july-scientistb-it
non-gate
java
+
–
108
votes
7
answers
112
GATE CSE 2016 Set 2 | Question: 44
Consider the following languages. $L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2016 steps on some input} \right\}$ ... not recursive $L_{1}, L_{2}$ are recursive and $L_{3}$ is not recursive $L_{1}, L_{2}, L_{3}$ are recursive
Consider the following languages.$L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2016 steps on some input} \right\}$,$L_{2} = \left\{\left\langl...
Akash Kanase
33.3k
views
Akash Kanase
asked
Feb 12, 2016
Theory of Computation
gatecse-2016-set2
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
77
votes
5
answers
113
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$
Kathleen
33.2k
views
Kathleen
asked
Sep 18, 2014
Algorithms
gatecse-2004
algorithms
sorting
asymptotic-notation
easy
+
–
1
votes
1
answer
114
Graph
1. Suppose that G is a non-directed graph with 12 edges. Suppose that G has 6 vertices of degree 3 and the rest have degrees less than 3. The minimum number of vertices G can have? a) 2 b) 0 c)1 d)3 I am getting 3..plz verify
1. Suppose that G is a non-directed graph with 12 edges. Suppose that G has 6 vertices of degree 3 and the rest have degrees less than 3. The minimum number of vertices G...
cse23
33.1k
views
cse23
asked
Jan 20, 2017
47
votes
8
answers
115
GATE CSE 2019 | Question: 37
There are $n$ unsorted arrays: $A_1, A_2, \dots, A_n$. Assume that $n$ is odd.Each of $A_1, A_2, \dots, A_n$ contains $n$ distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of $A_1, A_2, \dots , A_n$ is $O(n)$ $O(n \: \log \: n)$ $O(n^2)$ $\Omega (n^2 \log n)$
There are $n$ unsorted arrays: $A_1, A_2, \dots, A_n$. Assume that $n$ is odd.Each of $A_1, A_2, \dots, A_n$ contains $n$ distinct elements. There are no common elements ...
Arjun
33.1k
views
Arjun
asked
Feb 7, 2019
Algorithms
gatecse-2019
algorithms
time-complexity
2-marks
+
–
33
votes
6
answers
116
GATE CSE 1994 | Question: 1.14
Which of the following permutations can be obtained in the output (in the same order) using a stack assuming that the input is the sequence $\text{1, 2, 3, 4, 5}$ in that order? $\text{3, 4, 5, 1, 2}$ $\text{3, 4, 5, 2, 1}$ $\text{1, 5, 2, 3, 4}$ $\text{5, 4, 3, 1, 2}$
Which of the following permutations can be obtained in the output (in the same order) using a stack assuming that the input is the sequence $\text{1, 2, 3, 4, 5}$ in that...
Kathleen
33.1k
views
Kathleen
asked
Oct 4, 2014
DS
gate1994
data-structures
stack
normal
+
–
5
votes
2
answers
117
ISRO2013-55
Consider a logical address space of $8$ pages of $1024$ words each, mapped onto a physical memory of $32$ frames. How many bits are there in the physical address and logical address respectively? $5, 3$ $10, 10$ $15, 13$ $15, 15$
Consider a logical address space of $8$ pages of $1024$ words each, mapped onto a physical memory of $32$ frames. How many bits are there in the physical address and logi...
makhdoom ghaya
33.0k
views
makhdoom ghaya
asked
May 2, 2016
Operating System
isro2013
operating-system
memory-management
+
–
122
votes
7
answers
118
GATE CSE 2017 Set 1 | Question: 27
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock $l$, then it cannot re-acquire lock $l$ without releasing ... $x = 1, y = 2$ $x = 2, y = 1$ $x = 2, y = 2$ $x = 1, y = 1$
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All...
Arjun
32.9k
views
Arjun
asked
Feb 14, 2017
Operating System
gatecse-2017-set1
operating-system
process-synchronization
normal
+
–
83
votes
13
answers
119
GATE CSE 2013 | Question: 9
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilon$ and $A \rightarrow a$) to parse a string with $n$ tokens? $n/2$ $n-1$ $2n-1$ $2^{n}$
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilo...
Arjun
32.8k
views
Arjun
asked
Sep 23, 2014
Compiler Design
gatecse-2013
compiler-design
parsing
normal
+
–
56
votes
8
answers
120
GATE CSE 2010 | Question: 18
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node? $1$ $2$ $3$ $4$
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node?$1$$2$$3$$4$
go_editor
32.7k
views
go_editor
asked
Sep 29, 2014
Databases
gatecse-2010
databases
b-tree
easy
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
3214
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register