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
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 rishu_darkshadow
User rishu_darkshadow
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User rishu_darkshadow
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+6
votes
1
GATE2015133
Consider the following pseudo code, where $x$ and $y$ are positive integers. begin q := 0 r := x while r ≥ y do begin r := r  y q := q + 1 end end The post condition that needs to be satisfied after the program terminates is $\{ r = qx + y \wedge r < y\}$ $\{ x = qy + r \wedge r < y\}$ $\{ y = qx + r \wedge 0 < r < y\}$ $\{ q + 1 < r  y \wedge y > 0\}$
answered
Jan 19, 2018
in
Programming

3.1k
views
gate20151
programming
loopinvariants
normal
0
votes
2
GATE2014317
One of the purposes of using intermediate code in compilers is to make parsing and semantic analysis simpler. improve error recovery and error reporting. increase the chances of reusing the machineindependent code optimizer in other compilers. improve the register allocation.
answered
Jan 19, 2018
in
Compiler Design

1.9k
views
gate20143
compilerdesign
intermediatecode
easy
0
votes
3
UGCNETNov2017iii38
answered
Jan 4, 2018
in
Others

52
views
ugcnetnov2017iii
0
votes
4
UGCNETNov2017iii41
answered
Jan 4, 2018
in
Others

43
views
ugcnetnov2017iii
+2
votes
5
UGCNETNov2017ii28
The number of bits used for addressing in Gigabit Ethernet is __________. 32 bits 48 bits 64 bits 128 bits
answered
Jan 4, 2018
in
Others

1.2k
views
ugcnetnov2017ii
computernetworks
ethernet
+7
votes
6
GATE20022.21
Which combination of the following features will suffice to characterize an OS as a multiprogrammed OS? More than one program may be loaded into main memory at the same time for execution If a program waits for certain events such as I/O, another program is immediately scheduled for ... program is immediately scheduled for execution. (a) (a) and (b) (a) and (c) (a), (b) and (c)
answered
Dec 12, 2017
in
Operating System

3k
views
gate2002
operatingsystem
normal
process
+16
votes
7
GATE2014241
Suppose a stack implementation supports an instruction $REVERSE$, which reverses the order of elements on the stack, in addition to the $PUSH$ and $POP$ instructions. Which one of the following statements is TRUE (with respect to this modified stack)? A ... $ENQUEUE$ and $DEQUEUE$ take a single instruction each.
answered
Dec 8, 2017
in
DS

5.6k
views
gate20142
datastructure
stack
easy
+2
votes
8
GATE201010
In a binary tree with $n$ nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child? $0$ $1$ $\frac{(n1)}{2}$ $n1$
answered
Dec 5, 2017
in
DS

3.2k
views
gate2010
datastructure
binarytree
normal
+3
votes
9
GATE201018
Consider a $B^+$tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any nonroot node? $1$ $2$ $3$ $4$
answered
Dec 5, 2017
in
Databases

6k
views
gate2010
databases
btree
easy
+1
vote
10
GATE200919
The coupling between different modules of a software is categorized as follows: Content coupling Common coupling Control coupling Stamp coupling Data coupling Coupling between modules can be ranked in the order of strongest (least desirable) to weakest (most desirable) as follows: IIIIIIIVV VIVIIIIII IIIIVIIIV IVIIVIIII
answered
Dec 4, 2017
in
IS&Software Engineering

1.6k
views
gate2009
is&softwareengineering
normal
+2
votes
11
GATE200940
Let $L = L_1 \cap L_2 $, where $L_1$ and $L_2$ are languages as defined below: $L_1= \left \{ a^m b^mca^nb^n \mid m,n \geq 0 \right \}$ $L_2=\left \{ a^i b^j c^k \mid i,j,k \geq 0 \right \}$ Then $L$ is Not recursive Regular Context free but not regular Recursively enumerable but not context free.
answered
Dec 4, 2017
in
Theory of Computation

2.9k
views
gate2009
theoryofcomputation
easy
identifyclasslanguage
+13
votes
12
GATE2007IT6, ISRO201125
A processor takes $12$ cycles to complete an instruction I. The corresponding pipelined processor uses $6$ stages with the execution times of $3, 2, 5, 4, 6$ and $2$ cycles respectively. What is the asymptotic speedup assuming that a very large number of instructions are to be executed? $1.83$ $2$ $3$ $6$
answered
Nov 17, 2017
in
CO & Architecture

4.2k
views
gate2007it
coandarchitecture
pipelining
normal
isro2011
+4
votes
13
GATE20075
Consider the DAG with $V = \{1,2,3,4,5,6\}$ shown below. Which of the following is not a topological ordering? $1$ $2$ $3$ $4$ $5$ $6$ $1$ $3$ $2$ $4$ $5$ $6$ $1$ $3$ $2$ $4$ $6$ $5$ $3$ $2$ $4$ $1$ $6$ $5$
answered
Nov 17, 2017
in
Algorithms

1.7k
views
gate2007
algorithms
graphalgorithms
–2
votes
14
GATE20065
For which one of the following reasons does internet protocol(IP) use the timetolive(TTL) field in IP datagram header? Ensure packets reach destination within that time Discard packets that reach later than that time Prevent packets from looping indefinitely Limit the time for which a packet gets queued in intermediate routers
answered
Nov 16, 2017
in
Computer Networks

1.5k
views
gate2006
computernetworks
ipv4
ippacket
easy
0
votes
15
GATE200685
Find the grammar that generates the language $ L=\left \{ a^{i}b^{j}\mid i\neq j \right \}$. In that grammar what is the length of the derivation (number of steps starring from $S$) to generate the string $a^{l}b^{m}$ with $l\neq m$ $max (l,m) + 2$ $l + m + 2$ $l + m + 3$ $max (l,m) + 3$
answered
Nov 15, 2017
in
Compiler Design

493
views
gate2006
compilerdesign
grammar
normal
+2
votes
16
GATE200554
Let $N_f$ and $N_p$ denote the classes of languages accepted by nondeterministic finite automata and nondeterministic pushdown automata, respectively. Let $D_f$ and $D_p$ denote the classes of languages accepted by deterministic finite automata and deterministic pushdown automata respectively. ... $D_f = N_f \text{ and } D_p = N_p$ $D_f =N_f \text{ and } D_p \subset N_p$
answered
Nov 15, 2017
in
Theory of Computation

725
views
gate2005
theoryofcomputation
easy
nondeterminism
–1
vote
17
GATE200555
Consider the languages: $L_1 = \left\{ a^nb^nc^m \mid n,m >0\right\}$ and $ L_2 = \left\{a^nb^mc^m\mid n, m > 0\right\}$ Which one of the following statements is FALSE? $L_1 \cap L_2$ is a contextfree language $L_1 \cup L_2$ is a contextfree language $L_1 \text{ and } L_2$ are contextfree languages $L_1 \cap L_2$ is a context sensitive language
answered
Nov 15, 2017
in
Theory of Computation

2.4k
views
gate2005
theoryofcomputation
identifyclasslanguage
normal
0
votes
18
GATE200516, ISRO200918, ISRO20152
The range of integers that can be represented by an $n$ bit $2’s$ complement number system is: $2^{n1} \text{ to } (2^{n1} 1)$ $(2^{n1} 1) \text{ to } (2^{n1} 1)$ $2^{n1} \text{ to } 2^{n1}$ $(2^{n1} +1) \text{ to } (2^{n1} 1)$
answered
Nov 14, 2017
in
Digital Logic

3.8k
views
gate2005
digitallogic
numberrepresentation
easy
isro2009
isro2015
+6
votes
19
GATE2005IT12
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number to be inserted in the tree must be $p$ $p + 1$ $n  p$ $n  p + 1$
answered
Nov 14, 2017
in
DS

2.7k
views
gate2005it
datastructure
normal
binarysearchtree
0
votes
20
GATE200542
Let $R$ and $S$ be any two equivalence relations on a nonempty set $A$. Which one of the following statements is TRUE? $R$ $∪$ $S$, $R$ $∩$ $S$ are both equivalence relations $R$ $∪$ $S$ is an equivalence relation $R$ $∩$ $S$ is an equivalence relation Neither $R$ $∪$ $S$ nor $R$ $∩$ $S$ are equivalence relations
answered
Nov 14, 2017
in
Set Theory & Algebra

1.8k
views
gate2005
settheory&algebra
normal
relations
+1
vote
21
GATE20054
Which one of the following are essential features of an objectoriented programming language? Abstraction and encapsulation Strictlytypedness Typesafe property coupled with subtype rule Polymorphism in the presence of inheritance I and II only I and IV only I, II and IV only I, III and IV only
answered
Nov 14, 2017
in
Object Oriented Programming

1.4k
views
gate2005
programming
normal
objectorientedprogramming
nongate
+1
vote
22
GATE2004IT57
Consider a list of recursive algorithms and a list of recurrence relations as shown below. Each recurrence relation corresponds to exactly one algorithm and is used to derive the time complexity of the algorithm. ... $\text{PIII, QII, RIV, SI}$ $\text{PIV, QII, RI, SIII}$
answered
Nov 13, 2017
in
Algorithms

793
views
gate2004it
algorithms
recurrence
normal
+1
vote
23
GATE2004IT59
What is the output of the following program? #include<stdio.h> int funcf (int x); int funcg (int y); main () { int x = 5, y = 10, count; for (count = 1; count <= 2; ++count) { y += funcf(x) + funcg(x); printf ("%d", y); } } funcf (int x) { int y; y = funcg(x ... ; } funcg (int x) { static int y = 10; y += 1; return (y + x); } $43 \ 80$ $42 \ 74$ $33 \ 37$ $32 \ 32$
answered
Nov 13, 2017
in
Programming

1.8k
views
gate2004it
programming
programminginc
normal
–1
vote
24
GATE200477
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is $2$ $3$ $4$ $5$
answered
Nov 13, 2017
in
Graph Theory

2.3k
views
gate2004
graphtheory
graphcoloring
easy
+5
votes
25
GATE2004IT86
In the TCP/IP protocol suite, which one of the following is NOT part of the IP header? Fragment Offset Source IP address Destination IP address Destination port number
answered
Nov 13, 2017
in
Computer Networks

1.5k
views
gate2004it
computernetworks
ippacket
normal
+5
votes
26
GATE2004IT8
What is the minimum number of $\text{NAND}$ gates required to implement a $2\text{input EXCLUSIVEOR}$ function without using any other logic gate? $2$ $4$ $5$ $6$
answered
Nov 13, 2017
in
Digital Logic

3.5k
views
gate2004it
digitallogic
minnogates
normal
–1
vote
27
GATE2004IT64
A process executes the following segment of code : for(i = 1; i <= n; i++) fork (); The number of new processes created is $n$ $((n(n + 1))/2)$ $2^n  1$ $3^n  1$
answered
Nov 13, 2017
in
Operating System

2.4k
views
gate2004it
operatingsystem
fork
easy
+5
votes
28
GATE2004IT5
What is the maximum number of edges in an acyclic undirected graph with $n$ vertices? $n1$ $n$ $n+1$ $2n1$
answered
Nov 11, 2017
in
Graph Theory

1.8k
views
gate2004it
graphtheory
graphconnectivity
normal
–3
votes
29
GATE2004IT21
Which level of locking provides the highest degree of concurrency in a relational database ? Page Table Row Page, table and row level locking allow the same degree of concurrency
answered
Nov 11, 2017
in
Databases

1.9k
views
gate2004it
databases
normal
transactionandconcurrency
+3
votes
30
GATE20045
The best data structure to check whether an arithmetic expression has balanced parentheses is a queue stack tree list
answered
Nov 11, 2017
in
DS

2.9k
views
gate2004
datastructure
easy
stack
+3
votes
31
GATE200389
Consider the C program shown below: #include<stdio.h> #define print(x) printf("%d", x) int x; void Q(int z) { z+=x; print(z); } void P(int *y) { int x = *y + 2; Q(x); *y = x  1; print(x); } main(void) { x = 5; P(&x); print(x); } The output of this program is: $12 \ 7 \ 6$ $22 \ 12 \ 11$ $14 \ 6 \ 6$ $7 \ 6 \ 6$
answered
Nov 11, 2017
in
Programming

3.2k
views
gate2003
programming
programminginc
normal
+2
votes
32
GATE20011.5
Which of the following statements is true? If a language is context free it can always be accepted by a deterministic pushdown automaton The union of two context free languages is context free The intersection of two context free languages is a context free The complement of a context free language is a context free
answered
Nov 9, 2017
in
Theory of Computation

1.6k
views
gate2001
theoryofcomputation
contextfreelanguage
easy
0
votes
33
GATE20011.6
Given an arbitrary nondeterministic finite automaton (NFA) with $N$ states, the maximum number of states in an equivalent minimized DFA at least $N^2$ $2^N$ $2N$ $N!$
answered
Nov 9, 2017
in
Theory of Computation

4k
views
gate2001
finiteautomata
theoryofcomputation
easy
–2
votes
34
GATE20011.20
Where does the swap space reside? RAM Disk ROM Onchip cache
answered
Nov 9, 2017
in
Operating System

3.7k
views
gate2001
operatingsystem
easy
virtualmemory
+2
votes
35
GATE20012.16
What is the minimum number of stacks of size $n$ required to implement a queue of size $n$? One Two Three Four
answered
Nov 9, 2017
in
DS

5.6k
views
gate2001
datastructure
easy
stack
queues
+1
vote
36
ugc net November 2017
You are given a sequence of n elements to sort. The input sequence consist of n/k subsequences, each containing K elements. The elements in a given sequence are all smaller than the elements in the succeeding and larger than the elements in the preceding subsequence. Thus, all that is needed to ... problem is: 1. Omega (n) 2. Omega (n/k) 3. Omega (n lg k) 4. Omega (n/k lg n/k)
answered
Nov 8, 2017
in
Algorithms

835
views
sorting
algorithms
0
votes
37
UGCNETDec2015III44
In propositional logic, given P and P $\rightarrow$ Q, we can infer ____ $\sim$ Q Q P $\wedge$ Q $\sim$ P $\wedge$ Q
answered
Oct 25, 2017
in
Others

892
views
ugcnetdec2015iii
propositionallogic
–3
votes
38
GATE20001.10
The most appropriate matching for the following pairs $\begin{array}{ll} \text{X: Indirect addressing} & \text{1: Loops } \\ \text{Y: Immediate addressing } & \text{2: Pointers} \\ \text{Z: Auto decrement addressing } & \text{3: Constants } \\ \end{array}$ is $X  3, Y  2, Z  1$ $X  1, Y  3, Z  2$ $X  2, Y  3, Z  1$ $X  3, Y  1, Z  2$
answered
Oct 9, 2017
in
CO & Architecture

2.3k
views
gate2000
coandarchitecture
normal
addressingmodes
–2
votes
39
GATE20002.24
Given the following relation instance. ... $Z \rightarrow Y$ $YZ \rightarrow X$ and $Y \rightarrow Z$ $YZ \rightarrow X$ and $X \rightarrow Z$ $XZ \rightarrow Y$ and $Y \rightarrow X$
answered
Oct 9, 2017
in
Databases

2.5k
views
gate2000
databases
functionaldependencies
easy
+1
vote
40
GATE20001.13
The most appropriate matching for the following pairs $\begin{array}{ll}\hline \text{X: depth first search} & \text{1: heap } \\\hline \text{Y: breadth first search} & \text{2: queue} \\\hline \text{Z: sorting} & \text{3: stack} \\\hline \end{array}$ is: $\text{X  1, Y  2, Z  3}$ $\text{X  3, Y  1, Z  2}$ $\text{X  3, Y  2, Z  1}$ $\text{X  2, Y  3, Z  1}$
answered
Oct 9, 2017
in
Algorithms

1.3k
views
gate2000
algorithms
easy
graphalgorithms
Page:
1
2
3
4
5
6
...
10
next »
49,532
questions
54,126
answers
187,326
comments
71,046
users