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
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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
Answers by sonu
User sonu
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User sonu
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
1
Programming \ what is the output?
#include<stdio.h> int main() { int a[10][20][30]={0}; printf("%ld",&a+1  &a); return 0; }
answered
May 27, 2016
in
Programming

227
views
programminginc
output
interview
arrays
+19
votes
2
GATE199775
An operating system handles requests to resources as follows. A process (which asks for some resources, uses them for some time and then exits the system) is assigned a unique timestamp are when it starts. The timestamps are monotonically increasing with time. Let us denote the timestamp ... yes, show how. If not prove it. Can a process P ever starve? If yes, show how. If not prove it.
answered
May 27, 2016
in
Operating System

1.3k
views
gate1997
operatingsystem
resourceallocation
normal
+1
vote
3
Virtual gate SQL
Q). Consider the table $employee(empid,name, department ,salary)$ and the two queries Q1,Q2 below .Assuming that department $5$ has more than one employee, and we want to find the employees who get higher salary than anyone in the department $5$ , which one ... Q2 produce the same answer (D) Neither Q1 nor Q2 is the correct query The correct answer is A Is query1 correlated query?
answered
May 27, 2016
in
Databases

149
views
sql
query
virtual
gate
+2
votes
4
CMI2013A10
The below question is based on following program: procedure mystery (A : array [1..100] of int) int i,j,position,tmp; begin for j := 1 to 100 do position := j; for i := j to 100 do if (A[i] > A[position]) then position := i; endfor tmp ... position] := tmp; endfor end The number of times the test $A[i] > A[position]$ is executed is: $100$ $5050$ $10000$ Depends on contents of $A$
answered
May 23, 2016
in
Algorithms

193
views
cmi2013
algorithms
timecomplexity
+18
votes
5
CMI2013A05
You have $n$ lists, each consisting of $m$ integers sorted in ascending order. Merging these lists into a single sorted list will take time: $O(nm \log m)$ $O(mn \log n)$ $O(m + n)$ $O(mn)$
answered
May 23, 2016
in
Algorithms

587
views
cmi2013
algorithms
sorting
+3
votes
6
TestBook Live Test 2 Q 19
I think answer should be 13. We got 13 tokens printf ( "string" ++ & & * * * a ) ;
answered
Jan 19, 2016
in
Compiler Design

310
views
testseries
testbooktestseries
compilertokenization
+1
vote
7
The ALU, the bus and all the register are identical in size. the instruction "memory write"
answered
Dec 7, 2015
in
CO & Architecture

315
views
coandarchitecture
datapath
0
votes
8
Data hazards: RAW,WAR,WAW
Indicate the type of data hazards (RAW, WAR, and WAW) that exist between the following instructions: I1:ADD R1, R2, R3 ; R1 = R2 + R3 I2:ADD R4, R1, R4 ; R4 = R1 + R4 I3:ADD R3, R1, R2 ; R3 = R1 + R2 I4:ADD R1, R1, R4 ; R1 = R1 + ... single instruction?(as in I2 and I4) ii)Do we have to consider only consecutive instructions? (as in I1 and I2) or can it be (I1 and I3) too?
answered
Nov 3, 2015
in
CO & Architecture

850
views
datahazards
pipelining
+5
votes
9
War raw waw
(common data q30_31) A pipelined processor uses a 4 stages instruction pipeline with the following stages. Instructions fetch (IF) , instruction decode (ID), execute (EX) and write back (WB). The arithmetic operations as well as the load and store ... available in rhe resisters ro, r1, r2 and r4 respectively; before the execution of the instruction sequence. Add r5,r0,r1 r5
answered
Nov 3, 2015
in
CO & Architecture

416
views
coandarchitecture
pipelining
datahazards
0
votes
10
dma throughput
A DMA controller transfers $16$ bytes to memory using cycle stealing with frequency $1.2$GHz. The number of clock cycles used for transfer of $16$ bytes is $20$ Clock cycles. Find the throughout?
answered
Oct 31, 2015
in
CO & Architecture

459
views
dma
+1
vote
11
TIFR2012A13
The maximum value of the function. $f\left(x, y, z\right)= \left(x  1 / 3\right)^{2}+ \left(y  1 / 3\right)^{2}+ \left(z  1 / 3\right)^{2}$ Subject to the constraints $x + y + z=1, x \geq 0, y \geq 0, z \geq 0$ is $1 / 3$ $2 / 3$ $1$ $4 / 3$ $4 / 9$
answered
Oct 31, 2015
in
Calculus

209
views
tifr2012
calculus
maximaminima
0
votes
12
microinstruction
answered
Oct 31, 2015
in
CO & Architecture

810
views
microprogramming
+1
vote
13
2 level paging
consider a system using 2 level paging applicable page table is divided into 2K pages each of size 4 KB. if pas is 64 MB which is divided into 16K frames memory is byte addressable . page tabke entry size is 2 bytes in both the levels calculate the length of logical and physical address. total number of entry at second level
answered
Oct 20, 2015
in
Operating System

1.9k
views
operatingsystem
virtualmemory
+10
votes
14
TIFR2011A15
The exponent of $3$ in the product $100!$ is $27$ $33$ $44$ $48$ None of the above.
answered
Oct 19, 2015
in
Numerical Ability

159
views
tifr2011
numericalability
factors
tricky
+7
votes
15
TIFR2011A11
$$\int_{0}^{1} \ln x\, \mathrm{d}x=$$ $1$ $1$ $\infty $ $\infty $ None of the above.
answered
Oct 19, 2015
in
Calculus

322
views
tifr2011
calculus
integration
0
votes
16
data structure in tree
https://gateoverflow.in/?qa=blob&qa_blobid=960122342133549347
answered
Oct 16, 2015
in
DS

111
views
0
votes
17
Memory Management
Consider a system using a sengmented paging architecture. The segment is divided into 8k pages each of size 2k words . The segement table is divided into 256 k pages each of size 512 words. The page table entry size requires 64 bits . the frame number requires 22 bits then calculate logical address (LA) a) 51 bits b) 61 bits c) 33 bits d) 64 bits
answered
Oct 14, 2015
in
Operating System

333
views
memorymanagement
operatingsystem
0
votes
18
Answer to this question is unsafe state.Why unsafe state in this question not leading to dedlock?
answered
Oct 14, 2015
in
Operating System

463
views
0
votes
19
Transmission rate in a 3 node 2 link sliding window system
answered
Oct 6, 2015
in
Computer Networks

955
views
computernetworks
stopandwait
slidingwindow
linearalgebra
0
votes
20
no of state in minimal finite automata that accept the string from alphabet {a,b,c}
answered
Oct 3, 2015
in
Theory of Computation

400
views
–1
vote
21
TIFR2010A1
A box contains $731$ black balls and $2000$ white balls. The following process is to be repeated as long as possible. Arbitrarily select two balls from the box. If they are of the same color, throw them out and put a black ball into the box ( enough extra ... the box The process will stop with a single black ball in the box The process will stop with the box empty None of the above
answered
Oct 2, 2015
in
Numerical Ability

393
views
tifr2010
numericalability
logicalreasoning
0
votes
22
find first repeated element..
given an array of n element, what will be the time complexity to find 1st repeated element when array have more than one repeated elements??
answered
Oct 1, 2015
in
Programming

376
views
+1
vote
23
What is the level number of an element present in an array of n integers interpreted as a complete binary tree?
answered
Sep 30, 2015
in
DS

534
views
binarytree
datastructure
0
votes
24
How can a value of a constant be varied through a pointer ?
answered
Sep 26, 2015
in
Programming

171
views
programminginc
+1
vote
25
How much time will the processor be slowed down due to DMA activity?
answered
Sep 26, 2015
in
CO & Architecture

2.4k
views
0
votes
26
What is the approach to find preorder from given inorder?
answered
Sep 25, 2015
in
Programming

2.7k
views
datastructure
0
votes
27
how many process created?
Consider the following Pseudo code main() { int t1=0,t2=0,t3=0; t1=fork(); t2=fork(); if(t1!=0) { t3=fork(); printf("0"); } } Find the total number of processes that will be created by the above program execution.
answered
Sep 24, 2015
in
Operating System

1.9k
views
operatingsystem
fork
0
votes
28
single source shortest path algorithm
When can we have single source shortest path algorihm runs in Big Oh of number of edges. Options are like weighted graph, undirected graph, undirected and weighted, not possilbe (i dont remember all the options)
answered
Sep 18, 2015
in
Algorithms

270
views
graphalgorithms
+3
votes
29
ISRO20141
Consider a 33MHz cpu based system. What is the number of wait states required if it is interfaced with a 60ns memory? Assume a maximum of 10ns delay for additional circuitry like buffering and decoding. 0 1 2 3
answered
Sep 17, 2015
in
CO & Architecture

5.5k
views
coandarchitecture
isro2014
memoryinterfacing
0
votes
30
regular expression for the following
find RE for L on {a,b} 1.L={w:w mod 3=0} 2.L={w: na(w) mod 3=0} 3 .L={w: na(w) mod 5>0} repeat 1 2 3 for {a ,b,c}
answered
Sep 17, 2015
in
Theory of Computation

1.4k
views
+2
votes
31
Let a cluster of stations share 48 Kbps of pure Aloha channel. Every station outputs frames of length 1024 bits on an average of every 50 seconds. Then what is the maximum value of number of stations?
answered
Apr 8, 2015
in
Computer Networks

504
views
pure_aloha
+10
votes
32
GATE200219
A computer uses $32bit$ virtual address, and $32bit$ physical address. The physical memory is byte addressable, and the page size is $4$ $\text{kbytes}$ . It is decided to use two level page tables to translate from virtual address to physical ... that can be contained in each page? How many bits are available for storing protection and other information in each page table entry?
answered
Dec 1, 2014
in
Operating System

2.6k
views
gate2002
operatingsystem
virtualmemory
normal
descriptive
+7
votes
33
GATE20092
What is the chromatic number of an $n$ vertex simple connected graph which does not contain any odd length cycle? Assume $n > 2$. $2$ $3$ $n1$ $n$
answered
Nov 26, 2014
in
Graph Theory

2.3k
views
gate2009
graphtheory
graphcoloring
normal
+20
votes
34
GATE20091
Which one of the following is NOT necessarily a property of a Group? Commutativity Associativity Existence of inverse for every element Existence of identity
answered
Nov 26, 2014
in
Set Theory & Algebra

997
views
gate2009
settheory&algebra
easy
groups
+3
votes
35
GATE2005IT38
Let $P$ be a nondeterministic pushdown automaton (NPDA) with exactly one state, $q$, and exactly one symbol, $Z$, in its stack alphabet. State $q$ is both the starting as well as the accepting state of the PDA. The stack is initialized with one $Z$ before the start of the ... ^*$. Both $L(P)$ and $N(P)$ are necessarily $Σ^*$. Neither $L(P)$ nor $N(P)$ are necessarily $Σ^*$
answered
Nov 20, 2014
in
Theory of Computation

2k
views
gate2005it
theoryofcomputation
pushdownautomata
normal
+3
votes
36
GATE199824
Four jobs are waiting to be run. Their expected run times are $6, 3, 5$ and $x.$ In what order should they be run to minimize the average response time? Write a concurrent program using $\text{par beginpar end}$ to represent the precedence graph shown below.
answered
Sep 26, 2014
in
Operating System

1.9k
views
gate1998
operatingsystem
processschedule
descriptive
38,115
questions
45,622
answers
132,338
comments
49,309
users