The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by Nithish
User Nithish
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Nithish
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
digital signature
can we use a secret symmetric key to both sign and verify a signature?
answered
Apr 29, 2017
in
Computer Networks

91
views
3
answers
2
Suppose that 100 people enter a contest and that different winners are selected at random for first, second, and third prizes. What is the probability that Michelle wins one of these prizes if she is one of the contestants?
commented
Apr 26, 2017
in
Probability

941
views
1
answer
3
Addressing Mode
comment edited
Feb 9, 2017
in
CO and Architecture

308
views
3
answers
4
GATE2006IT55
Consider the solution to the bounded buffer producer/consumer problem by using general semaphores $S, F,$ and $E$. The semaphore $S$ is the mutual exclusion semaphore initialized to $1$. The semaphore $F$ ... and Signal $(F)$ in the Consumer process (I) only (II) only Neither (I) nor (II) Both (I) and (II)
commented
Feb 7, 2017
in
Operating System

3.4k
views
gate2006it
operatingsystem
processsynchronization
normal
2
answers
5
GATE200828
How many of the following matrices have an eigenvalue 1? $\left[\begin{array}{cc}1 & 0 \\0 & 0 \end{array} \right]\left[\begin{array}{cc}0 & 1 \\0 & 0 \end{array} \right] \left[\begin{array}{cc}1 & 1 \\1 & 1 \end{array} \right]$ and $\left[\begin{array}{cc}1 & 0 \\1 & 1 \end{array} \right]$ one two three four
commented
Feb 7, 2017
in
Linear Algebra

1.7k
views
gate2008
eigenvalue
linearalgebra
1
answer
6
GATE199813
Let $M=(\{q_0, q_1\}, \{0, 1\}, \{z_0, X\}, \delta, q_0, z_0, \phi)$ be a Pushdown automation where $\delta$ is given by $\delta(q_0, 1, z_0) = \{(q_0, Xz_0)\}$ $\delta(q_0, \epsilon, z_0) = \{(q_0, \epsilon)\}$ ... $\delta(q_0, 0, z_0) = \{(q_0, z_0)\}$ What is the language accepted by this PDA by empty stack? Describe informally the working of the PDA
commented
Feb 4, 2017
in
Theory of Computation

1.2k
views
gate1998
theoryofcomputation
pushdownautomata
descriptive
3
answers
7
GATE2015224
Assume that for a certain processor, a read request takes $50$ $nanoseconds$ on a cache miss and $5$ $nanoseconds$ on a cache hit. Suppose while running a program, it was observed that $80$% of the processor's read requests result in a cache hit. The average read access time in nanoseconds is _____.
commented
Jan 31, 2017
in
CO and Architecture

3.9k
views
gate20152
coandarchitecture
cachememory
easy
numericalanswers
3
answers
8
GATE19938.5
The lessthan relation, $<,$ on reals is a partial ordering since it is asymmetric and reflexive a partial ordering since it is antisymmetric and reflexive not a partial ordering because it is not asymmetric and not reflexive not a partial ordering because it is not antisymmetric and reflexive none of the above
commented
Jan 30, 2017
in
Set Theory & Algebra

1.3k
views
gate1993
settheory&algebra
partialorder
easy
5
answers
9
GATE19973.1
Let $\left(Z, *\right)$ be an algebraic structure where $Z$ is the set of integers and the operation $*$ is defined by $n*m = \max(n,m)$. Which of the following statements is true for $\left(Z, *\right)$? $\left(Z, *\right)$ is a monoid $\left(Z, *\right)$ is an Abelian group $\left(Z, *\right)$ is a group None of the above
commented
Jan 29, 2017
in
Set Theory & Algebra

1.9k
views
gate1997
settheory&algebra
groups
normal
4
answers
10
GATE2014344
The memory access time is $1$ $nanosecond$ for a read operation with a hit in cache, $5$ $nanoseconds$ for a read operation with a miss in cache, $2$ $nanoseconds$ for a write operation with a hit in cache and $10$ $nanoseconds$ for a write ... operations. The cache hitratio is $0.9$. The average memory access time (in nanoseconds) in executing the sequence of instructions is ______.
commented
Jan 26, 2017
in
CO and Architecture

7.8k
views
gate20143
coandarchitecture
cachememory
numericalanswers
normal
11
answers
11
GATE19941.11
In a compact single dimensional array representation for lower triangular matrices (i.e all the elements above the diagonal are zero) of size $n \times n$ ... new representation is: $i+j$ $i+j1$ $(j1)+\frac{i(i1)}{2}$ $i+\frac{j(j1)}{2}$
commented
Jan 26, 2017
in
DS

6.5k
views
gate1994
datastructure
arrays
normal
14
answers
12
GATE2016154
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $20$ $\text{megabytes}$ per $\text{second}$. Tokens arrive at a rate to sustain output ... needs to send $12$ $\text{megabytes}$ of data. The minimum time required to transmit the data is _____________ $\text{seconds}$.
commented
Jan 25, 2017
in
Computer Networks

12.2k
views
gate20161
computernetworks
tokenbucket
normal
numericalanswers
4
answers
13
GATE200682
Consider the diagram shown below where a number of LANs are connected by (transparent) bridges. In order to avoid packets looping through circuits in the graph, the bridges organize themselves in a spanning tree. First, the root bridge is identified as the bridge with the least serial number. Next, the root ... $\text{B1, B5, B2, B3, B4}$ $\text{B1, B3, B4, B5, B2}$
commented
Jan 23, 2017
in
Computer Networks

7.3k
views
gate2006
computernetworks
bridges
normal
1
answer
14
****** test series
Which of the following statements is/are TRUE? S1: Suppose L is Turing recognizable but not Turing decidable. Then any Turing machine that recognizes L must fail to halt on an infinite number of strings. S2: The language A'TM={⟨M,w⟩  M does not accept w} is Turing recognizable.
commented
Jan 17, 2017
in
Theory of Computation

252
views
7
answers
15
GATE19976.8
Each Process $P_i$, i = $1....9$ is coded as follows repeat P(mutex) {Critical section} V(mutex) forever The code for $P_{10}$ is identical except it uses V(mutex) in place of P(mutex). What is the largest number of processes that can be inside the critical section at any moment? $1$ $2$ $3$ None
commented
Jan 17, 2017
in
Operating System

6.3k
views
gate1997
operatingsystem
processsynchronization
normal
1
answer
16
turing machine
Consider the following languages: Lne={〈M〉│L(M)≠ф } Le={〈M〉│L(M)=ф } where 〈M〉 denotes encoding of a Turning machine M Then which one of the following is true? (a) Lne is r.e. but not recursive and Le is not r.e. (b) Both are not r.e. (c) Both are recursive (d) Le is r.e. but not recursive and Lne is not r.e.
commented
Jan 15, 2017
in
Theory of Computation

108
views
theoryofcomputation
4
answers
17
GATE199212b
Let the page reference and the working set window be $c\ c\ d\ b\ c\ e\ c\ e\ a\ d\ $ and $4$, respectively. The initial working set at time $t=0$ contains the pages $\{a,d,e\}$, where $a$ was referenced at time $t=0$ ... referenced at time $t=2$. Determine the total number of page faults and the average number of page frames used by computing the working set at each reference.
commented
Jan 15, 2017
in
Operating System

2.7k
views
gate1992
operatingsystem
memorymanagement
normal
2
answers
18
binary heap
Consider a binary min heap containing n elements and every node is having degree 2 ( i.e. full binary min heap tree). What is the probability of finding the largest element at the last level ? According to my understanding the largest elemenyt has to be a leaf and since leafs can be on two levels last and second last therefore the probability should be 1/2
commented
Jan 15, 2017
in
Algorithms

278
views
heap
binaryheap
algorithms
geekmock2017
0
answers
19
Which of the following is CSL?
commented
Jan 15, 2017
in
Theory of Computation

160
views
1
answer
20
GATE201135
Consider the following table of arrival time and burst time for three processes $P0, P1$ and $P2.$ ... completion of processes. What is the average waiting time for the three processes? $5.0$ ms $4.33$ ms $6.33$ ms $7.33$ ms
commented
Jan 14, 2017
in
Operating System

2.7k
views
gate2011
operatingsystem
processschedule
normal
1
answer
21
TOC Decidability
Are the following problems decidable? 1.{⟨M⟩∣M is a TM and there exist an input whose length is less than 100, on which M halts} I think we can simulate all the combinations of strings whose length is less than 100,and if the machine halts for any of them ... these words are not accepted by machine,Can it hang the machine?Is it also RE but NOT REC Please correct if I am going wrong
answered
Jan 14, 2017
in
Theory of Computation

151
views
decidability
theoryofcomputation
2
answers
22
DSCLL
Time complexity to insert a node in the end of circular linked list, if the pointer to the 1st node is given and number of nodes in list is N is A)O(1) B)O(log N) C)O(N) D)O(N log N)
commented
Jan 13, 2017
in
DS

663
views
datastructure
timecomplexity
algorithms
linkedlists
2
answers
23
the number of generators of the group { 0,1,2........... 14} under the group operation addition modulu 15 is
commented
Jan 12, 2017
in
Set Theory & Algebra

564
views
settheory&algebra
groups
generators
2
answers
24
Binary Search tree
Consider an array with ‘n’ numbers, let “T” be time complexity for finding a number appeared maximum number of times in an array. Using Binary Search Tree data structure the T will be A. O(log n) B. O(n) C. O(n logn) D. O(n2)
commented
Jan 12, 2017
in
Algorithms

670
views
algorithms
binarysearchtree
datastructure
bst
2
answers
25
NCFL,CFL,PDA
L1={wlwR∣w∈{a,b}∗,l∈{a,b} } which type of language is this DCFL or NDCFL? (note that l∈{a,b} not {a,b}*) I feel its NDCFL can you also tell how PDA will look like?
comment reshown
Jan 12, 2017
in
Theory of Computation

201
views
1
answer
26
Decidable/Undecidable
Let A = {<M>M is a TM and L(M) is regular}. Then A is _________ a) Decidable language and regular language b) Undecidable but partially decidable c) Totally not decidable d) Decidable language but not regular language
answered
Jan 12, 2017
in
Theory of Computation

261
views
theoryofcomputation
decidability
2
answers
27
DSBST
If preorder of a BST is passed as an argument to the above function. Function returns 1 if, a)All the leaf nodes of the tree are at same level b) All the nodes of the tree have atmost 1 child c) True is a complete binary tree, where the nodes at each level are completely filled d) None of these
answered
Jan 12, 2017
in
DS

163
views
datastructure
tree
2
answers
28
Deadlocks
Consider a system with processes P0, P1,P2, . . . . P99, P100, each process requires maximum of 4 resources. System has allocated 2 resources to each process. The minimum number of resources should release such that above system is deadlock free is _____
asked
Jan 11, 2017
in
Operating System

819
views
resourceallocation
operatingsystem
1
answer
29
MadeEasy Subject Test: Programming & DS  Hashing
True Or False.....? Explain...?
answered
Jan 9, 2017
in
DS

190
views
madeeasytestseries
datastructure
hashing
2
answers
30
What we should consider NFA or DFA while they ask 'Finite Autpmata' in question?
answered
Jan 9, 2017
in
Theory of Computation

114
views
general
finiteautomata
0
answers
31
Regular expression
will option B generate string a??
comment edited
Jan 6, 2017
in
Theory of Computation

77
views
1
answer
32
graph
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.
answered
Jan 5, 2017
in
Graph Theory

74
views
1
answer
33
geeks for geeks
In a village, people build houses in the same side of the road. A thief plans to loot the village. He wants maximum amount of money without having any risk of getting caught. By some means, the villagers know that their adjacent house is being looted ... ? (a) Brute force (b) Dynamic programming (c) Backtracking (d) Divide and conquer Please provide explanation to your solution :)
answer edited
Jan 5, 2017
in
Algorithms

371
views
1
answer
34
REGULAR LANGUAGES
L={WX$W^{R}$ / W,X$\epsilon (a+b)^{*}$.} L={XW$W^{R}$ / W,X$\epsilon (a+b)^{*}$.} l={W$W^{R}$X /W,X $\epsilon (a+b)^{*}$.} which of the above are REGULAR LANGUAGES.?  ... all are regular I)w=$\epsilon$ then w^r=$\epsilon$ and x=$(a+b)^{*}$ // it accept complete language so it is regular. same as for remaining problems also.am i ryt???
comment edited
Jan 4, 2017
in
Theory of Computation

137
views
1
answer
35
B+ Tree
Consider a B+ Tree of height $h$ and order of root node $p$ and order of leaf node $q$. Find ? Time complexity to find a record in B+ Tree Minimum and Maximum number of records stored in B+ Tree
answered
Jan 4, 2017
in
Databases

192
views
databases
2
answers
36
Doubt
Whether a given regular grammar is ambiguous is decidable ?
answered
Jan 3, 2017
in
Theory of Computation

40
views
1
answer
37
Targate
The Answer given is A) I think the naswer should be B) as we have both the prev pointer and the next pointer available , it will take constant time to update the adjacent nodes pointers and delete the given node .?
answered
Jan 3, 2017
in
DS

893
views
linkedlists
datastructure
timecomplexity
1
answer
38
MadeEasy Subject Test: Computer Networks  Sliding Window
In list II , the 2nd point and 4th point both are correct for GBN according to me.
answered
Jan 3, 2017
in
Computer Networks

174
views
madeeasytestseries
computernetworks
slidingwindow
3
answers
39
user and kernel mdoe
can anyone tell what are different activities that are performed in kernel mode user mode how to change frm user mode to kernel mode and viceversa,,
answered
Jan 2, 2017
in
Operating System

630
views
operatingsystem
threads
process
1
answer
40
Deadlock
Consider a system with 200 resources, if each process requires 3 resources. Maximum number of processes present in the system, such that system is in safe state is ?
answer selected
Dec 31, 2016
in
Operating System

279
views
deadlock
operatingsystem
deadlockpreventionavoidancedetection
50,645
questions
56,556
answers
195,715
comments
101,582
users