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
Answers by minal
User minal
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User minal
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+34
votes
1
GATE200448
Consider two processes $P_1$ and $P_2$ accessing the shared variables $X$ and $Y$ protected by two binary semaphores $S_X$ and $S_Y$ respectively, both initialized to 1. $P$ and $V$ denote the usual semaphore operators, where $P$ decrements the semaphore value, and $V$ increments the semaphore value. The ... $P(S_X), P(S_X); P(S_Y), P(S_Y)$ $P(S_X), P(S_Y); P(S_X), P(S_Y)$
answered
Nov 8, 2015
in
Operating System

3.6k
views
gate2004
operatingsystem
processsynchronization
normal
+12
votes
2
GATE199101xii
A given set of processes can be implemented by using only parbegin/parend statement, if the precedence graph of these processes is ______
answered
Nov 8, 2015
in
Operating System

898
views
gate1991
operatingsystem
normal
precedencegraph
+19
votes
3
GATE19961.25
Consider the following floatingpoint number representation.$\begin{array}{cc} \begin{array}{cc}31\;\;\hspace{15pt}&\hspace{15pt}24\end{array} & \begin{array}{cc}23\hspace{15pt}&\hspace{15pt}0\end{array} \\\hline \text{Exponent}&\text{Mantissa}\\ \hline \end{array}$ ... $0$ to $1$ $0.5$ to $1$ $2^{23}$ to $0.5$ $0.5$ to $\left(12^{23}\right)$
answered
Nov 5, 2015
in
Digital Logic

6.8k
views
gate1996
digitallogic
numberrepresentation
normal
+5
votes
4
GATE200748
Which of the following is TRUE about formulae in Conjunctive Normal Form? For any formula, there is a truth assignment for which at least half the clauses evaluate to true. For any formula, there is a truth assignment for which all the clauses evaluate to true. There is a formula such that for each truth assignment, at most onefourth of the clauses evaluate to true. None of the above.
answered
Nov 5, 2015
in
Digital Logic

4.9k
views
gate2007
digitallogic
normal
conjunctivenormalform
+37
votes
5
GATE200638
Consider a Boolean function $ f(w,x,y,z)$. Suppose that exactly one of its inputs is allowed to change at a time. If the function happens to be true for two input vectors $ i_{1}=\left \langle w_{1}, x_{1}, y_{1},z_{1}\right \rangle $ ... $ wx\overline{y} \overline{z}, xz, w\overline{x}yz$ $ wx\overline{y}, wyz, wxz, \overline{w}xz, x\overline{y}z, xyz$
answered
Nov 4, 2015
in
Digital Logic

7.8k
views
gate2006
digitallogic
minsumofproductsform
difficult
statichazard
+36
votes
6
GATE200458
A circuit outputs a digit in the form of $4$ bits. $0$ is represented by $0000$, $1$ by $0001$, …, $9$ by $1001$. A combinational circuit is to be designed which takes these $4$ bits as input and outputs $1$ if the digit $\geq$ $5$, and $0$ otherwise. If only AND, OR and NOT gates may be used, what is the minimum number of gates required? $2$ $3$ $4$ $5$
answered
Nov 4, 2015
in
Digital Logic

2.8k
views
gate2004
digitallogic
normal
minnogates
0
votes
7
process
If a process on the system could issue an I/O request then the process will be placed on which of the following ? a)Ready State b) Running state c) ready queue d) I/o queue
answered
Oct 17, 2015
in
Operating System

266
views
operatingsystem
0
votes
8
DBMS SQL query (3)
answered
Oct 16, 2015
in
Databases

200
views
databases
sql
+5
votes
9
How many subgraphs with at least one vertex does K3 have?
answered
Oct 9, 2015
in
Graph Theory

3.8k
views
graphtheory
+4
votes
10
How many of $16$ boolean functions in $2$ variables $x$ and $y$ can be represented using only
answered
Oct 7, 2015
in
Digital Logic

438
views
digitallogic
booleanalgebra
+22
votes
11
TIFR2010A7
The limit of $\dfrac{10^{n}}{n!}$ as $n \to \infty$ is. $0$ $1$ $e$ $10$ $\infty$
answered
Oct 2, 2015
in
Calculus

801
views
tifr2010
calculus
limits
+2
votes
12
ISRO201169
Lightweight Directory Access protocol is used for Routing the packets Authentication obtaining IP address domain name resolving
answered
Oct 1, 2015
in
Computer Networks

1.8k
views
isro2011
computernetworks
networkprotocols
+2
votes
13
cpu scheduling
Consider a system running 10 I/O bound task and one CPU bound task.Assume that I/O bound task issue I/O operation once every millisecond of CPU computing and each I/O operation takes 10 msec to complete.Also assume that context switching overhead is 0.1 ms ... are long running tasks.What is CPU utilization for round robin scheduler when 1)time quantum is 1 ms 2)time quantum is 10 ms
answered
Oct 1, 2015
in
Operating System

1.7k
views
+2
votes
14
GATE200536
In a complete $k$ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal node is: $nk$ $(n1)k + 1$ $n(k1) +1$ $n(k1)$
answered
Sep 14, 2015
in
DS

3.6k
views
gate2005
datastructures
trees
normal
+26
votes
15
GATE20042,ISRO201754
Consider the following function void swap(int a, int b) { int temp; temp = a; a = b; b = temp; } In order to exchange the values of two variables $x$ and $y$. call $swap(x, y)$ call $swap(\&x, \&y)$ $swap (x, y)$ cannot be used as it does not return any value $swap (x, y)$ cannot be used as the parameters are passed by value
answered
Sep 13, 2015
in
Compiler Design

4.1k
views
gate2004
compilerdesign
programminginc
parameterpassing
easy
isro2017
runtimeenvironments
+19
votes
16
GATE200211
The following recursive function in C is a solution to the Towers of Hanoi problem. void move(int n, char A, char B, char C) { if (......................) { move (.............................); printf("Move disk %d from pole %c to pole %c\n", n, A,C); move (.....................); } } Fill in the dotted parts of the solution.
answered
Sep 7, 2015
in
Programming

1.1k
views
gate2002
programming
recursion
normal
descriptive
+2
votes
17
Prim's Algorithm
Which one of following statement is false about prim's algorithm? a) It use a running time of O(Elog2V) using binary heap b) It may use a binomial maxheap to represent the priority queue. c) A fibonacci heap imlementation require O(E+V log2V) d) Initially all keys of nodes in priority queue are set to infinity . The root's key is set to 0.
answered
Aug 20, 2015
in
Algorithms

331
views
+1
vote
18
How to solve the below question of Directed graph ?
Let $G (V, E)$ be a directed graph with $n$ vertices. A path from $v_i$ to $v_j$ in $G$ is sequence of vertices $(v_i, v_{i+1}, \ldots, v_j)$ such that $(v_k, v_{k+1}) \in E$ for all $k$ in $i$ ... then every simple path from $j$ to $k$ contain most $A[j, k]$ edges. I am confused between option C and D , answer given is D .
answered
Aug 19, 2015
in
Algorithms

305
views
+2
votes
19
Which of the following changes to typical QuickSort improves its performance on average and are generally done in practice ?
answered
Aug 18, 2015
in
Algorithms

463
views
sorting
+79
votes
20
GATE200573
In a packet switching network, packets are routed from source to destination along a single path having two intermediate nodes. If the message size is $24$ bytes and each packet contains a header of $3$ bytes, then the optimum packet size is: $4$ $6$ $7$ $9$
answered
Aug 13, 2015
in
Computer Networks

10.3k
views
gate2005
computernetworks
networkswitching
normal
+49
votes
21
GATE200767, ISRO201672
The address of a class $B$ host is to be split into subnets with a $6$$bit$ subnet number. What is the maximum number of subnets and the maximum number of hosts in each subnet? $62$ subnets and $262142$ hosts. $64$ subnets and $262142$ hosts. $62$ subnets and $1022$ hosts. $64$ subnets and $1024$ hosts.
answered
Aug 10, 2015
in
Computer Networks

11.5k
views
gate2007
computernetworks
subnetting
easy
isro2016
+53
votes
22
GATE200817
Which of the following system calls results in the sending of SYN packets? socket bind listen connect
answered
Aug 9, 2015
in
Computer Networks

3.7k
views
gate2008
normal
computernetworks
sockets
+2
votes
23
Given n points in the xy plane, what is the time complexity to find the closest pair?
answered
Aug 1, 2015
in
Algorithms

557
views
algorithms
+2
votes
24
minimum no. of states
answered
Jul 22, 2015
in
Theory of Computation

477
views
+37
votes
25
GATE20022.5
The finite state machine described by the following state diagram with $A$ as starting state, where an arc label is and $x$ stands for $1$bit input and $y$ stands for $2$bit output outputs the sum of the present and the previous bits of the input outputs $01$ whenever the input sequence contains $11$ outputs $00$ whenever the input sequence contains $10$ none of the above
answered
Jul 19, 2015
in
Theory of Computation

2.7k
views
gate2002
theoryofcomputation
normal
finiteautomata
+4
votes
26
Viable Prefix
answered
Jul 18, 2015
in
Compiler Design

909
views
compilerdesign
parsing
viableprefix
+6
votes
27
Elimination of epsilon
Question : (Here e=epsilon) S>AB, A>e, B>aBb, B>b My answer is : S>B, B>aBb , B>b or S>Be , B>aBb , B>b Want to know which one is correct ? please explain...
answered
Jul 16, 2015
in
Theory of Computation

140
views
theoryofcomputation
0
votes
28
Why is left recursion not a problem for bottom up parsers?
I know the parsing logic of bottom up parsers, that they start from the terminal and reduce it to the start symbol. But what really confuses me is the construction of LR(0)/LR(1) sets : Eg : S>Saa Then in LR(0) set : S' ... dot is in front of S , so shouldn't the S production be generated again and again and make it go to an inf. loop?
answered
Jul 16, 2015
in
Compiler Design

1.4k
views
+4
votes
29
set theory
difference between {} , ∅ , {∅} ???
answered
Jul 16, 2015
in
Set Theory & Algebra

220
views
settheory&algebra
sets
+38
votes
30
GATE200445
Consider the grammar with the following translation rules and $E$ ... for the root of the parse tree for the expression:$2$ # $3$ & $5$ # $6$ & $4$ $200$ $180$ $160$ $40$
answered
Jul 15, 2015
in
Compiler Design

2.3k
views
gate2004
compilerdesign
grammar
normal
+32
votes
31
GATE19961.17
The pass numbers for each of the following activities object code generation literals added to literal table listing printed address resolution of local symbols that occur in a two pass assembler respectively are $1, 2, 1, 2$ $2, 1, 2, 1$ $2, 1, 1, 2$ $1, 2, 2, 2$
answered
Jul 15, 2015
in
Compiler Design

3.6k
views
gate1996
compilerdesign
normal
assembler
+28
votes
32
GATE19987b
In a computer system where the bestfit' algorithm is used for allocating jobs' to memory partitions', the following situation was encountered:$\begin{array}{ll} \hline \textbf{Partitions size in $KB$} & \textbf{$4K \ 8K \ 20K \ 2K$} \\\hline \textbf{Job sizes in $ ... $} \\\hline \end{array}$When will the $20K$ job complete?
answered
Jul 11, 2015
in
Operating System

3.5k
views
gate1998
operatingsystem
processschedule
normal
+4
votes
33
What is the difference between ambiguous and inherently ambiguous for context free languages?
answered
Jul 9, 2015
in
Theory of Computation

1k
views
+69
votes
34
GATE2014137
There are $5$ bags labeled $1$ to $5$. All the coins in a given bag have the same weight. Some bags have coins of weight $10$ gm, others have coins of weight $11$ gm. I pick $1, 2, 4, 8, 16$ coins respectively from bags $1$ to $5$ Their total weight comes out to $323$ gm. Then the product of the labels of the bags having $11$ gm coins is ___.
answered
Jul 7, 2015
in
Algorithms

2.7k
views
gate20141
algorithms
numericalanswers
normal
algorithmdesign
+4
votes
35
expalin
if we use 3 key ,4 pointer nodes. how many different B tree are there when the data file has 6 records.
answered
Jul 3, 2015
in
Databases

221
views
+9
votes
36
GATE200759
Information about a collection of students is given by the relation $\text{studInfo(}\underline{\text{studId}},\text{ name, sex)}$. The relation $\text{enroll(}{\text{studId}},{\text{ courseId}})$ gives which student has enrolled for (or taken) ... . Courses in which a proper subset of female students are enrolled. Courses in which only male students are enrolled. None of the above
answered
Jun 27, 2015
in
Databases

6k
views
gate2007
databases
relationalalgebra
normal
+16
votes
37
GATE200447
Consider a system with a twolevel paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. The ... instruction execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
answered
Jun 27, 2015
in
CO and Architecture

22.4k
views
gate2004
coandarchitecture
virtualmemory
normal
+23
votes
38
GATE2007IT58
A demand paging system takes $100$ time units to service a page fault and $300$ time units to replace a dirty page. Memory access time is $1$ time unit. The probability of a page fault is $p$. In case of a page fault, the probability of page being dirty is also $p$. It is observed that the average access time is $3$ time units. Then the value of $p$ is $0.194$ $0.233$ $0.514$ $0.981$
answered
Jun 23, 2015
in
Operating System

7.1k
views
gate2007it
operatingsystem
pagereplacement
probability
normal
0
votes
39
Please give an example
Is deadlock possible in Test Set Lock?
answered
Jun 17, 2015
in
Operating System

264
views
operatingsystem
processsynchronization
+1
vote
40
Please solve this
answered
Jun 17, 2015
in
Operating System

129
views
deadlock
Page:
« prev
1
2
3
next »
50,737
questions
57,394
answers
198,594
comments
105,445
users