The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
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
Recent activity by Sukanya Das
User Sukanya Das
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Sukanya Das
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
GATE 2018 GA  9( Electronics and Communication Engineering )
A cab was involved in a hit and run accident at night. You are given the following data about the cabs in the city and the accident. $85\%$ of cabs in the city are green and the remaining cabs are blue. A witness identified the cab ... closest to the probability that the accident was caused by a blue cab? $12\%$ $15\%$ $41\%$ $80\%$
answer edited
Jan 25
in
Numerical Ability

611
views
gate2018
numericalability
normal
2
answers
2
QUEUES
A circular array based queue $q$ is capable of holding $7$ elements. After execution of the following code, find the element at index $'1'$, if the array is initially empty and array has indices from $0$ to $6$. for (x=1; x<=6; x++) q. ... ++) { q.dequeue (); q.enqueue (q.dequeue ()); } Assume enqueue & dequeue are circular queue operations for insertion and deletion respectively.
edited
Jan 22
in
DS

770
views
datastructure
queues
1
answer
3
Given a Turing machine M, does M halt on the empty tape?
Given a Turing machine M, does M halt on the empty tape? reading more and more on TM,i am getting confused.please clarify whther it is R.E or non R.E..?? does empty tape means empty string or NO INPUT??
retagged
Jan 15
in
Theory of Computation

549
views
theoryofcomputation
decidability
2
answers
4
GATE2017152
Consider the expression $(a1) * (((b+c)/3)+d)$. Let $X$ be the minimum number of registers required by an optimal code generation (without any register spill) algorithm for a load/store architecture, in which only load and store instructions can have memory operands and arithmetic instructions can have only register or immediate operands. The value of $X$ is _____________ .
edited
Jan 14
in
Compiler Design

7.2k
views
gate20171
compilerdesign
registerallocation
normal
numericalanswers
1
answer
5
TIFR2019A9
answer edited
Jan 3
in
Others

175
views
tifr2019
2
answers
6
GATEBOOK2019OS120
Consider three processes, all arriving at time zero, with total execution times of $20, 40$ and $60$ units, respectively. Each process spends the first $30 \%$ of its execution time doing computation, next $40\%$ of execution time doing I/O, next $20\%$ of time doing ... as possible. For what percentage of time does the CPU remain idle? $0\%$ $20.67\%$ $26.83\%$ $33.33\%$
answer selected
Dec 29, 2018
in
Operating System

368
views
gb2019os1
processschedule
4
answers
7
TIFR2013A20
Consider a well functioning clock where the hour, minute and the seconds needles are exactly at zero. How much time later will the minutes needle be exactly one minute ahead ($1/60$ th of the circumference) of the hours needle and the seconds needle again exactly at ... multiple of $1/60$ th of the circumference. $144$ minutes $66$ minutes $96$ minutes $72$ minutes $132$ minutes
commented
Nov 29, 2018
in
Numerical Ability

320
views
tifr2013
numericalability
clocktime
1
answer
8
C basic
what is the difference between printf(“\nI am don”) and printf(“%s”, I am don);
answer edited
Nov 21, 2018
in
Programming

45
views
4
answers
9
GATEBOOK2019TOC17
If the language accepted by a DFA contains binary strings divisible by $12$ (in decimal), the minimum number of states in it will be ______
commented
Nov 14, 2018
in
Theory of Computation

520
views
gb2019toc1
numericalanswers
1
answer
10
test series  Testbook
Which of the following functions given by their recurrences grows the fastest asymptotically? $T(n) = 8T(n/4) + 100n^2$ $T(n) = 81T(n/9) + 10n^2$ $T(n) = 16T(n/4)+ 100(n \log n)^{1.99}$ $T(n) = 100T(n/100)+ n \log^2 n$
answered
Nov 13, 2018
in
Algorithms

131
views
asymptoticnotations
recurrence
0
answers
11
Combinatorics with restrictions
commented
Oct 27, 2018
in
Combinatory

102
views
0
answers
12
Second Normal Form
commented
Oct 21, 2018
in
Databases

123
views
databasenormalization
functionaldependencies
databases
1
answer
13
Test Series
From the following statements which of them is/are true about SQL a) All attributes used in the group by clause must appear in the select clause b) An SQL query can contain a having clause only if it has a group by clause c) An SQL query can contain a having ... if it does not have a group by clause d) Not all attributes used in the group by clause need to appear in the select clause
commented
Oct 14, 2018
in
Databases

59
views
sql
1
answer
14
Probability  Gravner3
Toss three fair coins. What is the probability of exactly one Heads$(H)$ ?
answered
Sep 26, 2018
in
Probability

23
views
probability
gravner
engineeringmathematics
3
answers
15
GATE20068
You are given a free running clock with a duty cycle of $50\%$ and a digital waveform $f$ which changes only at the negative edge of the clock. Which one of the following circuits (using clocked D flipflops) will delay the phase of $f$ by $180°$?
answer edited
Jun 28, 2018
in
Digital Logic

5.1k
views
gate2006
digitallogic
normal
digitalcircuits
1
answer
16
GATE19882v
Three switching functions $f_1, \: f_2 \:$ and $f_3$ are expressed below as sum of minterms. $f_1 (w, x, y, z) = \sum \: 0, 1, 2, 3, 5, 12$ $f_2 (w, x, y, z) = \sum \: 0, 1, 2, 10, 13, 14, 15$ $f_3 (w, x, y, z) = \sum \: 2, 4, 5, 8$ Express the function $f$ realised by the circuit shown in the below figure as the sum of minterms (in decimal notation).
edited
Jun 28, 2018
in
Digital Logic

642
views
gate1988
descriptive
digitallogic
easy
circuitoutput
minsumofproductsform
5
answers
17
GATE200347
Consider the following circuit composed of XOR gates and noninverting buffers. The noninverting buffers have delays $\delta_1 = 2 ns$ and $\delta_2 = 4 ns$ as shown in the figure. Both XOR gates and all wires have zero delays. Assume that all gate inputs, outputs, and wires are stable ... change of logic levels) occur(s) at $B$ during the interval from $0$ to $10$ ns? $1$ $2$ $3$ $4$
answer edited
Jun 28, 2018
in
Digital Logic

4.3k
views
gate2003
digitallogic
logicgates
digitalcircuits
2
answers
18
GATE198713a
The below figure shows four Dtype flipflops connected as a shift register using a $XOR$ gate. The initial state and three subsequent states for three clock pulses are also given. State $Q_{A}$ $Q_{B}$ $Q_{C}$ $Q_{D}$ Initial $1$ $1$ $1$ $1$ After the first clock $0$ $1$ ... $0$ $0$ $1$ The state $Q_{A} Q_{B} Q_{C} Q_{D}$ after the fourth clock pulse is $0000$ $1111$ $1001$ $1000$
edited
Jun 27, 2018
in
Digital Logic

729
views
gate1987
digitallogic
circuitoutput
shiftregisters
5
answers
19
GATE200346
Consider the ALU shown below. If the operands are in $2's$ complement representation, which of the following operations can be performed by suitably setting the control lines $K$ and $C_0$ only (+ and  denote addition and subtraction respectively)? $A + B$, and $A  B$, but not $A + 1$ $A + B$ ... $A  B$ $A + B$, but not $A  B$ or $A + 1$ $A + B$, and $A  B$, and $A + 1$
edited
Jun 27, 2018
in
Digital Logic

4.3k
views
gate2003
digitallogic
normal
adder
4
answers
20
GATE2017105
Consider the following table: Algorithms Design Paradigms Kruskal Divide and Conquer Quicksort Greedy FloydWarshall Dynamic Programming Match the algorithms to the design paradigms they are based on. ... $(P) \leftrightarrow (i), (Q) \leftrightarrow (ii), (R) \leftrightarrow (iii)$
edited
Jun 25, 2018
in
Algorithms

2.6k
views
gate20171
algorithms
algorithmdesigntechniques
4
answers
21
GATE20011.16
Let $f(n) = n^2 \log n$ and $g(n) = n(\log n)^{10}$ be two positive functions of $n$. Which of the following statements is correct? $f(n) = O(g(n)) \text{ and } g(n) \neq O(f(n))$ $g(n) = O(f(n)) \text{ and } f(n) \neq O(g(n))$ $f(n) \neq O(g(n)) \text{ and } g(n) \neq O(f(n))$ $f(n) =O(g(n)) \text{ and } g(n) = O(f(n))$
answer edited
Jun 25, 2018
in
Algorithms

2.6k
views
gate2001
algorithms
asymptoticnotations
timecomplexity
normal
3
answers
22
GATE19971.5
The correct matching for the following pairs is All pairs shortest path Greedy Quick Sort DepthFirst Search Minimum weight spanning tree Dynamic Programming Connected Components Divide and Conquer $\text{A2 B4 C1 D3}$ $\text{A3 B4 C1 D2}$ $\text{A3 B4 C2 D1}$ $\text{A4 B1 C2 D3}$
edited
Jun 25, 2018
in
Algorithms

1.1k
views
gate1997
algorithms
normal
algorithmdesigntechniques
3
answers
23
GATE201534
Consider the equality $\displaystyle{\sum_{i=0}^n} i^3 = X$ and the following choices for $X$: $\Theta(n^4)$ $\Theta(n^5)$ $O(n^5)$ $\Omega(n^3)$ The equality above remains correct if $X$ is replaced by Only I Only II I or III or IV but not II II or III or IV but not I
edited
Jun 25, 2018
in
Algorithms

3.1k
views
gate20153
algorithms
asymptoticnotations
normal
3
answers
24
GATE200775
Consider the following Finite State Automaton: The minimum state automaton equivalent to the above FSA has the following number of states: $1$ $2$ $3$ $4$
edited
Jun 25, 2018
in
Theory of Computation

1.1k
views
normal
gate2007
theoryofcomputation
finiteautomata
4
answers
25
GATE200774
Consider the following Finite State Automaton: The language accepted by this automaton is given by the regular expression $b^*ab^*ab^*ab^*$ $(a + b)^*$ $b^*a(a+b)^*$ $b^*ab^*ab^*$
edited
Jun 25, 2018
in
Theory of Computation

2.2k
views
gate2007
theoryofcomputation
finiteautomata
normal
1
answer
26
GATE 2018 GA  6(Electrical Engineering)
An email password must contain three characters. The password has to contain one numeral from $0 \text{ to } 9$, one upper case and one lower case character from the English alphabet. How many distinct passwords are possible? $6,760$ $13,520$ $40,560$ $1,05,456$
commented
Jun 25, 2018
in
Numerical Ability

881
views
gate2018
numericalability
normal
3
answers
27
ISI201712
Which of the following statements is true? $\text{There are three consecutive integers with sum 2015}$ $\text{There are four consecutive integers with sum 2015}$ $\text{There are five consecutive integers with sum 2015}$ $\text{There are three consecutive integers with product 2015}$
commented
Jun 10, 2018
in
Numerical Ability

142
views
isi2017
numericalability
numericalcomputation
4
answers
28
GATE201818
The chromatic number of the following graph is _____
commented
Jun 7, 2018
in
Graph Theory

2.2k
views
graphtheory
graphcoloring
numericalanswers
gate2018
4
answers
29
ISI201721
There are four machines and it is known that exactly two of them are faulty. They are tested one by one in a random order till both the faulty machines are identified. The probability that only two tests are required is $\left(\dfrac{1}{2}\right)$ $\left(\dfrac{1}{3}\right)$ $\left(\dfrac{1}{4}\right)$ $\left(\dfrac{1}{6}\right)$
comment edited
May 16, 2018
in
Probability

376
views
engineeringmathematics
isi2017
probability
1
answer
30
# Self doubt
To get in shape, you have decided to start running to work. You want a route that goes entirely uphill and then entirely downhill so that you can work up a sweat going uphill and then get a nice breeze at the end of your run as you ... Assuming that every road segment is either uphill or downhill, give an efficient algorithm to find out shortest route that meets above specification??
answer selected
Apr 26, 2018
in
Algorithms

92
views
algorithms
2
answers
31
True/False
Which of the following statements related to graphs are True? Minimum Spanning Tree has ALWAYS Minimum weight edge included in it. Minimum Spanning Tree MIGHT have Maximum weight edge weight included in it. Maximum Spanning Tree has ALWAYS Maximum weight edge included ... edge included in it. Longest path from source to destination MAY OR MAY NOT have Maximum weight edge included in it.
answer selected
Apr 12, 2018
in
Graph Theory

175
views
graphs
graphalgorithms
algorithms
3
answers
32
BARC 2018
$\textbf{VPN}$ Works at which layer? Application layer Transport layer Network layer Datalink layer
answer selected
Apr 8, 2018
in
Computer Networks

336
views
computernetworks
networksecurity
barc2018
0
answers
33
Admission Query
Hi, I am 2016 B.Tech pass out.I currently do not have my degree certificate(I will take it from the university in some days). Is it alright to upload my provisional degree certificate in online pg admission forms?
commented
Apr 1, 2018
in
IISc/IITs

53
views
gate2018admissions
1
answer
34
****** Test Series
What will be the output of the following program? Void main() { int a = 5; a >> = 2; a << = 2; printf(“%d”,a); }
commented
Mar 31, 2018
in
Programming

161
views
0
answers
35
geeksforgeeks IP Addressing
An Internet Service Provider (ISP) has the following chunk of CIDRbased IP addresses available with it: $245.248.128.0/20$. The ISP wants to give half of this chunk of addresses to Organization $A$, and a quarter to Organization $B$, while retaining the remaining with itself. ... $245.248.136.0/24 \text{ and } 245.248.132.0/21$
closed
Mar 31, 2018
in
Computer Networks

141
views
computernetworks
ipaddressing
networkaddressing
ip
subnetting
0
answers
36
computer organization
A computer has a cache, main memory and a disk used for virtual memory. If reference word is in cache $15\hspace{0.1cm} ns$ are required to access it. If it is in main memory but not in cache, $50\hspace{0.1cm} nsec$ are needed to load it into cache and ... on this system will be____________. (in μsec) is this correct equation .$90*15 + .10*(.50*(50+15)+.50*(10000000+50))$
edited
Mar 31, 2018
in
CO & Architecture

35
views
coandarchitecture
2
answers
37
Virtual GATE Question
Let $L$ be a given contextfree language over the alphabet $\{a, b\}$. Construct $L1, L2$ as follows. Let $L1 = L − \{xyx \mid x, y \in \{a, b\}^*\}$, and $L2 = L·L$. Then, Both $L1$ and $L2$ are regular. Both $L1$ and $L2$ are context free but not necessarily regular. $L1$ is regular and $L2$ is context free. $L1$ and $L2$ both may not be context free.
edited
Mar 31, 2018
in
Theory of Computation

93
views
virtualgate
testseries
theoryofcomputation
0
answers
38
ME TEST
The format of double operand instruction of a CPU consist of $5$ bits opcode and $6$ bits for source and destination. $26$ double operand instructions and $184$ single operand instructions must be implemented. What will be the total number of zero operand instructions can be implemented? How to solve such questions? I always get confused.
retagged
Mar 31, 2018
in
CO & Architecture

65
views
coandarchitecture
1
answer
39
me test
Let $f (n) = Ο(n), g(n) = \Omega(n)$ and $h(n) = \theta(n)$. Then $g(n) + f(n).h(n)$ is ______ How to solve such examples. Rules for math of asymptotic notations(mul,div,add,sub of diif notations)
retagged
Mar 31, 2018
in
Algorithms

69
views
algorithms
1
answer
40
ugc net 2004
What item is at the root after the following sequence of insertions into an empty splay tree: $1, 11, 3, 10, 8, 4, 6, 5, 7, 9, 2 ?$ $1$ $2$ $4$ $8$
edited
Mar 31, 2018
in
IS&Software Engineering

256
views
datastructure
splaytree
47,922
questions
52,324
answers
182,349
comments
67,780
users