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
Recent activity 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
2
answers
1
Exist
commented
May 27, 2016
in
Databases

128
views
exists
1
answer
2
Quadratic sorts behavior
Is below problem meaningful? I am not able to get any logic behind it. Either am missing something or the problem is real crap. Suppose one is applying a particular quadratic sorting algorithm to an array of integers. After four iterations the array ... ? Selection sort that selects the largest element in each iteration Insertion sort i or ii ii only ii only None of these
commented
May 27, 2016
in
Algorithms

129
views
algorithms
1
answer
3
quick sort partition procedure
Is below question and its answer correct? Or its just kind of rubbish? After one pass through the partition procedure of quick sort array stand as below: 2,1,4,5,9,7,8,10 How many possible pivots can you find in the array? (A) 1 (B) 2 (C) 3 (D) ... is once run, one element is at its final position. So if that it is the question shouldn't be the answer (A)? Am I wrong?
commented
May 27, 2016
in
Algorithms

193
views
algorithms
2
answers
4
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

233
views
programminginc
output
interview
arrays
4
answers
5
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.4k
views
gate1997
operatingsystem
resourceallocation
normal
1
answer
6
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
3
answers
7
CMI2012A09
Consider the following programming errors: Type mismatch in an expression. Array index out of bounds. Use of an uninitialized variable in an expression. Which of these errors will typically be caught at compiletime by a modern compiler. I, II and III I and II I and III None of them
commented
May 25, 2016
in
Compiler Design

363
views
cmi2012
compilerdesign
compilationphases
normal
2
answers
8
DB\ ER to relational model
commented
May 24, 2016
in
Databases

259
views
databases
erdiagram
relationalalgebra
4
answers
9
GATE19911,ix
If the binary tree in figure is traversed in inorder, then the order in which the nodes will be visited is ______
commented
May 23, 2016
in
DS

791
views
gate1991
binarytree
easy
datastructure
2
answers
10
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

220
views
cmi2013
algorithms
timecomplexity
2
answers
11
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

675
views
cmi2013
algorithms
sorting
3
answers
12
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
6
answers
13
GATE2012CYGA7
$A$ and $B$ are friends. They decide to meet between 1:00 pm and 2:00 pm on a given day. There is a condition that whoever arrives first will not wait for the other for more than $15$ minutes. The probability that they will meet on that day is $1/4$ $1/16$ $7/16$ $9/16$
commented
Jan 19, 2016
in
Numerical Ability

5.3k
views
gate2012cy
numericalability
probability
6
answers
14
GATE2015336
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a packet $35$ microseconds after it receives the same. If $10000$ bits of data are to be ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______.
comment edited
Dec 24, 2015
in
Computer Networks

7.2k
views
gate20153
computernetworks
normal
numericalanswers
networkswitching
4
answers
15
GATE19951.16
For merging two sorted lists of sizes $m$ and $n$ into a sorted list of size $m+n$, we require comparisons of $O(m)$ $O(n)$ $O(m+n)$ $O(\log m + \log n)$
commented
Dec 17, 2015
in
Algorithms

3.8k
views
gate1995
algorithms
sorting
normal
2
answers
16
Made Easy Test Series
asked
Dec 17, 2015
in
CO & Architecture

159
views
speedup
madeeasytestseries
1
answer
17
Made Easy Test Series
asked
Dec 17, 2015
in
CO & Architecture

128
views
accesstime
2
answers
18
GATE20086
Let $r$ denote number system radix. The only value(s) of $r$ that satisfy the equation $\sqrt{121_r}={11}_r$, is/are decimal $10$ decimal $11$ decimal $10$ and $11$ any value > $2$
commented
Dec 13, 2015
in
Digital Logic

1.8k
views
gate2008
digitallogic
numberrepresentation
normal
1
answer
19
The ALU, the bus and all the register are identical in size. the instruction "memory write"
commented
Dec 8, 2015
in
CO & Architecture

317
views
coandarchitecture
datapath
2
answers
20
GATE2015242
Consider a processor with byteaddressable memory. Assume that all registers, including program counter (PC) and Program Status Word (PSW), are size of two bytes. A stack in the main memory is implemented from memory location $(0100)_{16}$ and it grows upward. The stack pointer (SP) points ... the value of the stack pointer is: $(016A)_{16}$ $(016C)_{16}$ $(0170)_{16}$ $(0172)_{16}$
commented
Dec 7, 2015
in
CO & Architecture

3.3k
views
gate20152
coandarchitecture
machineinstructions
easy
1
answer
21
Consider the following languages
Consider the following languages $A=\left\{ \langle M\rangle \mid \text{ TM M accepts at most 2 distinct inputs} \right\}$ $B=\left\{\langle M \rangle \mid \text{ TM M accepts more than 2 distinct inputs} \right\ ... $B$ is Turing recognizable $A$ is not Turing recognizable Both $A$ and $B$ are Turing recognizable Neither $A$ nor $B$ is Turing recognizable
commented
Dec 2, 2015
in
Theory of Computation

2.7k
views
turingmachine
theoryofcomputation
normal
4
answers
22
GATE2014236
Let $L_1=\{w\in\{0,1\}^*\mid w$ $\text{ has at least as many occurrences of }$ $(110)'$ $\text{s as }$ $(011)'$ $\text{s} \}$. Let $L_2=\{w \in\{0,1\}^*\ \mid w$ $ \text{ has at least as many occurrences of }$ $( ... }$. Which one of the following is TRUE? $L_1$ is regular but not $L_2$ $L_2$ is regular but not $L_1$ Both $L_1$ and $L_2$ are regular Neither $L_1$ nor $L_2$ are regular
commented
Nov 27, 2015
in
Theory of Computation

4.9k
views
gate20142
theoryofcomputation
normal
regularlanguages
5
answers
23
TIFR2012B3
For a person $p$, let $w(p)$, $A(p, y)$, $L(p)$ and $J(p)$ denote that $p$ is a woman, $p$ admires $y$, $p$ is a lawyer and $p$ is a judge respectively. Which of the following is the correct translation in first order logic of the sentence: "All woman who ... L\left(x\right)\right) \Rightarrow \left(\exists y: \left(J\left(y\right) \Lambda A\left(x, y\right)\right)\right)\right]$
commented
Nov 19, 2015
in
Mathematical Logic

553
views
tifr2012
mathematicallogic
firstorderlogic
3
answers
24
Given Language is REC or Non RE
Which of the following is true for the given language? $L=$ {<TM>  TM halts on every input} <TM> is encoding of the Turing machine (A) $L$ is Recursive and $\overline{L}$ is also Recursive (B) $L$ is Recursive ... Enumerable and $\overline{L}$ is Recursive Enumerable (D) $L$ is Non Recursive Enumerable and $\overline{L}$ is Non Recursive Enumerable
commented
Nov 3, 2015
in
Theory of Computation

1.3k
views
theoryofcomputation
difficult
recursiveandrecursivelyenumerablelanguages
decidability
3
answers
25
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?
answer edited
Nov 3, 2015
in
CO & Architecture

851
views
datahazards
pipelining
1
answer
26
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

418
views
coandarchitecture
pipelining
datahazards
3
answers
27
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

469
views
dma
2
answers
28
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

219
views
tifr2012
calculus
maximaminima
3
answers
29
microinstruction
answered
Oct 31, 2015
in
CO & Architecture

818
views
microprogramming
3
answers
30
Give me the formula for write back and write through ( avg access time ) in both parallel and serial
commented
Oct 31, 2015
in
CO & Architecture

4.1k
views
2
answers
31
consider the floating point representation, for each part provide ans as true or false...
commented
Oct 25, 2015
in
CO & Architecture

1k
views
1
answer
32
Minimum and maximum (ve) mantisa range in IEEE 754 32 bit
commented
Oct 25, 2015
in
CO & Architecture

161
views
coandarchitecture
1
answer
33
Limit
Is the following statement correct? If yes, prove it. $$\lim_{x \to 0^+} \log x =  \infty$$
commented
Oct 24, 2015
in
Calculus

129
views
limits
4
answers
34
window size
commented
Oct 23, 2015
in
Computer Networks

182
views
1
answer
35
Unix INODE
Q.1) Consider the Unix inode with 12 Direct Disk Block Addresses(DBA), 1 single indirect DBA, 1 Doubly Indirect DBA and 1 triple indirect DBA. The DBA requires 32 bits and the Disk block size is 1KB. Then what is the maximum file size possible? Vs Q.2) ... is 8 Bytes. What is the maximum possible file size in this file system? Vs What is the Total Size of the File System for both cases?
commented
Oct 21, 2015
in
Operating System

2.2k
views
operatingsystem
unix
inode
1
answer
36
Modulus operator in C
How C will behave with negative operands with modulus operator?
asked
Oct 20, 2015
in
Programming

373
views
programminginc
2
answers
37
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
5
answers
38
A host with IP address 10.100.100.100 wants to use loopback testing,WHAT are the source and destination addresses?
commented
Oct 20, 2015
in
Computer Networks

886
views
networkaddressing
1
answer
39
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

162
views
tifr2011
numericalability
factors
tricky
5
answers
40
GATE200579
Consider the following data path of a CPU. The ALU, the bus and all the registers in the data path are of identical size. All operations including incrementation of the PC and the GPRs are to be carried out in the ALU. Two clock cycles are needed for memory ... R0 <= R0 + R1. The minimum number of clock cycles needed for execution cycle of this instruction is: $2$ $3$ $4$ $5$
commented
Oct 19, 2015
in
CO & Architecture

4.6k
views
gate2005
coandarchitecture
machineinstructions
datapath
normal
40,845
questions
47,507
answers
145,770
comments
62,262
users