The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google 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
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent activity by akankshadewangan24
User akankshadewangan24
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User akankshadewangan24
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
7
answers
1
GATE200867
A processor uses $36$ bit physical address and $32$ bit virtual addresses, with a page frame size of $4$ Kbytes. Each page table entry is of size $4$ bytes. A three level page table is used for virtual to physical address translation, where the virtual address is used as follows: ... page tables are respectively $\text{20,20,20}$ $\text{24,24,24}$ $\text{24,24,20}$ $\text{25,25,24}$
commented
Nov 2
in
Operating System

18k
views
gate2008
operatingsystem
virtualmemory
normal
6
answers
2
TIFR2012B15
Let $T$ be a tree of $n$ nodes. Consider the following algorithm, that constructs a sequence of leaves $u_{1}, u_{2}...$. Let $u_{1}$ be some leaf of tree. Let $u_{2}$be a leaf that is farthest from $u_{1}$. Let $u_{3}$ be the leaf ... stays constant. For the same tree, the distance between the last two vertices visited can be different, based on the choice of the first leaf $u_{1}$.
commented
Oct 20
in
DS

752
views
tifr2012
datastructure
trees
4
answers
3
GATE198911a
A system of four concurrent processes, $P, Q, R$ and $S$, use shared resources $A, B$ and $C$. The sequences in which processes, $P, Q, R$ and $S$ request and release resources are as follows: Process P: 1. P requests A ... . What strategies can be used to prevent deadlocks in a system of concurrent processes using shared resources if preemption of granted resources is not allowed?
commented
Oct 13
in
Operating System

442
views
descriptive
gate1989
operatingsystem
resourceallocation
2
answers
4
GATE199920b
Consider the following solution to the producerconsumer problem using a buffer of size 1. Assume that the initial value of count is 0. Also assume that the testing of count and assignment to count are atomic operations. Producer: Repeat Produce an item; if ... ); Consume item; Forever; Show that in this solution it is possible that both the processes are sleeping at the same time.
commented
Oct 13
in
Operating System

206
views
gate1999
operatingsystem
processsynchronization
normal
0
answers
5
Matrix
Vector space is in syllabus of gate 2019 cse????????
asked
Oct 12
in
Mathematical Logic

13
views
engineeringmathematics
0
answers
6
Cyclic group
The order of cyclic group is equal to order of generating element.... Somebody explain with example plz
asked
Oct 10
in
Mathematical Logic

23
views
groups
discretemathematics
cyclic
settheory&algebra
2
answers
7
GATE2005IT81b
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $10$ MB. If the disk has $20$ sectors per track and is currently at the end of the $5^{th}$ sector of the ... data starting from the sector $4$ of the outermost track? $13.5 \ ms$ $10 \ ms$ $9.5 \ ms$ $20 \ ms$
commented
Oct 4
in
Operating System

2.7k
views
gate2005it
operatingsystem
disks
normal
1
answer
8
Paging advantage
Advantage of paging: It support time sharing system..... Explain plz can't get it
commented
Oct 2
in
Operating System

38
views
operatingsystem
paging
6
answers
9
GATE200629
If $s$ is a string over $(0+1)^*$ then let $n_0(s)$ denote the number of $0$'s in $s$ and $n_1(s)$ the number of $1$'s in $s$. Which one of the following languages is not regular? $L=\left \{ s\in (0+1)^* \mid n_{0}(s) \text{ is a 3digit prime } \right \}$ ... $L=\left \{ s\in (0+1)^*\mid n_{0}(s) \mod 7=n_{1}(s) \mod 5=0 \right \}$
commented
Sep 24
in
Theory of Computation

4.2k
views
gate2006
theoryofcomputation
normal
regularlanguages
0
answers
10
https://www.geeksforgeeks.org/wpcontent/uploads/gq/2016/02/GATECS201612.png
asked
Sep 22
in
Discrete Mathematics

40
views
functions
1
answer
11
Ace test
If t(n) and s(n) denotes the time and space complexity of an algorithm with input size n element then which one of the following is always true? S(n)=O(t(n)) correct How???
asked
Sep 20
in
Algorithms

47
views
acetestseries
3
answers
12
GATE2017119
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $max\left ( X,0 \right )$ where $max\left ( a,b \right )$ is the maximum of $a$ and $b$. The median of $Y$ is ______________ .
commented
Mar 23
in
Probability

4k
views
gate20171
probability
randomvariable
numericalanswers
2
answers
13
data structure
the number of inversions in (n,n1,.........3,2,1) is n(n1)/2 how??????????????????/
answer selected
Mar 19
in
Programming

52
views
datastructure
3
answers
14
GATE2015151
Consider the NPDA ... is as follows: Which one of the following sequences must follow the string $101100$ so that the overall string is accepted by the automaton? $10110$ $10010$ $01010$ $01001$
commented
Mar 15
in
Theory of Computation

5.3k
views
gate20151
theoryofcomputation
pushdownautomata
normal
5
answers
15
GATE2014234
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 = t3 + t2 ... is declared as "char $\mathbf{X[4] [32] [8]}$ . $\mathbf{X}$ is declared as "char $\mathbf{X[32] [16] [2]}$ .
commented
Mar 13
in
Compiler Design

4.6k
views
gate20142
compilerdesign
intermediatecode
programminginc
normal
1
answer
16
GATE201221
Consider a random variable $X$ that takes values $+1$ and $−1$ with probability $0.5$ each. The values of the cumulative distribution function $F(x)$ at $x = −1$ and $+1$ are $0$ and $0.5$ $0$ and $1$ $0.5$ and $1$ $0.25$ and $0.75$
commented
Mar 9
in
Probability

2.2k
views
gate2012
probability
randomvariable
easy
2
answers
17
GATE2007IT65
Consider a selection of the form $\sigma_{A\leq 100} (r)$, where $r$ is a relation with $1000$ tuples. Assume that the attribute values for $A$ among the tuples are uniformly distributed in the interval $[0, 500].$ Which one of the following options is the best estimate of the number of tuples returned by the given selection query ? $50$ $100$ $150$ $200$
commented
Mar 8
in
Databases

2.4k
views
gate2007it
databases
relationalcalculus
probability
normal
5
answers
18
GATE200845
Dijkstra's single source shortest path algorithm when run from vertex $a$ in the above graph, computes the correct shortest path distance to only vertex $a$ only vertices $a, e, f, g, h$ only vertices $a, b, c, d$ all the vertices
commented
Feb 18
in
Algorithms

4.8k
views
gate2008
algorithms
graphalgorithms
normal
4
answers
19
GATE2006IT25
Consider the undirected graph $G$ defined as follows. The vertices of $G$ are bit strings of length $n$. We have an edge between vertex $u$ and vertex $v$ if and only if $u$ and $v$ differ in exactly one bit position (in other words, $v$ can be obtained from $u$ by flipping a single ... $\left(\frac{1}{n}\right)$ $\left(\frac{2}{n}\right)$ $\left(\frac{3}{n}\right)$
commented
Feb 13
in
Graph Theory

2.1k
views
gate2006it
graphtheory
graphcoloring
normal
2
answers
20
GATE19903xi
Choose the correct alternatives (More than one may be correct). A graph is planar if and only if, It does not contain subgraphs homeomorphic to $k_{5}$ and $k_{3, 3}$. It does not contain subgraphs isomorphic to $k_{5}$ or $k_{3, 3}$. It does not contain a subgraph isomorphic to $k_{5}$ or $k_{3, 3}$ It does not contain a subgraph homeomorphic to $k_{5}$ or $k_{3, 3}$.
commented
Feb 13
in
Graph Theory

1k
views
gate1990
normal
graphtheory
graphplanarity
5
answers
21
ISRO20157
If half adders and full adders are implements using gates, then for the addition of two 17 bit numbers (using minimum gates) the number of half adders and full adders required will be 0,17 16,1 1,16 8,8
commented
Feb 11
in
Digital Logic

4.8k
views
isro2015
digitallogic
adder
halfadder
1
answer
22
GATE2011GGGA8
Three sisters $(R, S,$ and $T)$ received a total of $24$ toys during Christmas. The toys were initially divided among them in a certain proportion. Subsequently, $R$ gave some toys to $S$ which doubled the share of $S$. Then $S$ in turn gave some of her ... exchanges, the three sisters were left with equal number of toys. How many toys did $R$ have originally? $8$ $9$ $11$ $12$
commented
Jan 27
in
Numerical Ability

451
views
gate2011gg
logicalreasoning
numericalability
1
answer
23
test series
plz help me . how to solve that type of question
answered
Jan 27
in
Algorithms

62
views
algo
2
answers
24
GATE20022.2
Consider the following multiplexer where $I0, I1, I2, I3$ are four data input lines selected by two address line combinations $A1A0=00,01,10,11$ respectively and $f$ is the output of the multiplexor. EN is the Enable input. The function $f(x,y,z)$ implemented by the above circuit is $xyz'$ $xy + z$ $x + y$ None of the above
commented
Jan 27
in
Digital Logic

2.6k
views
gate2002
digitallogic
circuitoutput
normal
1
answer
25
arun sharma
commented
Jan 26
in
Numerical Ability

111
views
numericalability
number
system
1
answer
26
ethernet
if an ethernet station collide 4 times to try to transmit a single frame .How long might it wait to be before the next attempt if time slot 51.2 micro sec ...................micro sec. a. 768 b. 819.2 c.409.6 d. none
commented
Jan 26
in
Computer Networks

116
views
ethernet
1
answer
27
time complexity
time complexity questions like : h(n)=O(n2); f(n)= O(logn); g(n)=omega(n2); what is the complexity of :::: 1. h(n)g(n)=?? 2. h(n)f(n)=??? elaborate plz
commented
Jan 22
in
Algorithms

112
views
timecomplexity
asymptoticnotations
3
answers
28
GATE2016Session1GA9
If $\large q^{a} = \dfrac{1}{r}$ and $\large r^{b} = \dfrac{1}{s}$ and $\large s^{c} = \dfrac{1}{q}$, the value of $abc$ is ________. $\left(rqs\right)^{1}$ $0$ $1$ $r+q+s$
comment moved
Jan 22
in
Numerical Ability

402
views
gate2016session1aptitude
numericalability
fractions
1
answer
29
gateforum test series
answer given is : 0.153
commented
Jan 21
in
Probability

139
views
gateforumtestseries
probability
0
answers
30
ACE Test Series
commented
Jan 21
in
Probability

96
views
0
answers
31
Nielt ques
commented
Jan 21
in
Probability

42
views
0
answers
32
Declarartion
Void fun(){ int i=0; Printf("%d", i); Static in j=12; // this is error to declare here right????? J=j+1; }
commented
Jan 18
in
Programming

92
views
programminginc
0
answers
33
Associative mapping
If the main memory is of 128 K byte and the cache memory is of 16 byte line . It uses associative mapping . Then the tag bits for cache blocks are......... 11 bit 21bits 16bits 20 bits
asked
Jan 18
in
CO & Architecture

120
views
coandarchitecture
0
answers
34
Test series
How to calculate number of stalls here I m confused
commented
Jan 17
in
CO & Architecture

72
views
0
answers
35
associative mapping
if the main memory is of 8Kbyte and the cache memory 2K word .it uses associative mapping .then each word of cache memory shall be ................................. ans::::: 16 bits how????????????????????
commented
Jan 17
in
CO & Architecture

340
views
coandarchitecture
0
answers
36
database
what is the concept of nested loop join in database????????? link plz or give any example.
asked
Jan 12
in
Databases

27
views
rdbmstables
0
answers
37
networking
Consider the effect of using slow start on a line with 10 msec round trip time. The receiver window and the size of congestion window are set to 38 KB and 36 KB respectively. Sender side threshold is set to 18 KB. After 8 transmission a timeout occurs, after ... to send first full window of 18 KB is____________ (in msec). Assume window size at the start of slow start phase is 2 KB.
asked
Jan 11
in
Computer Networks

31
views
computernetworks
2
answers
38
Graph theory
How many simple graph are possible on six vertices in which the number of edge is odd??
commented
Jan 10
in
Mathematical Logic

133
views
graphtheory
0
answers
39
Ptobability
In any given year the probability of an earthquake greater the magnitude 6 occurring in the Himalaya is 0.04 .the average time between successive occurrence of such earthquake is.........year.?
asked
Jan 1
in
Verbal Ability

96
views
0
answers
40
linear algebra
The number of linearly independent eigen vectors of a scalar matrix of order ‘ n ‘ is / are (A)1 (B)2 (C)n1 (D)n
commented
Dec 30, 2017
in
Mathematical Logic

30
views
engineeringmathematics
44,074
questions
49,595
answers
162,959
comments
65,791
users