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 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
3
answers
1
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
in
Digital Logic

3.6k
views
gate2006
digitallogic
normal
digitalcircuits
1
answer
2
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
in
Digital Logic

511
views
gate1988
descriptive
digitallogic
easy
circuitoutput
minsumofproductsform
5
answers
3
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, ... many transition(s) (change of logic levels) occur(s) at $B$ during the interval from $0$ to $10$ ns? $1$ $2$ $3$ $4$
answer edited
Jun 28
in
Digital Logic

3.2k
views
gate2003
digitallogic
logicgates
digitalcircuits
2
answers
4
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 ... clock $0$ $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
in
Digital Logic

604
views
gate1987
digitallogic
circuitoutput
shiftregisters
5
answers
5
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$, ... but not $A  B$ $A + B$, but not $A  B$ or $A + 1$ $A + B$, and $A  B$, and $A + 1$
edited
Jun 27
in
Digital Logic

3.1k
views
gate2003
digitallogic
normal
adder
4
answers
6
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 (ii), (Q) \leftrightarrow (iii), (R) \leftrightarrow (i) ... R) \leftrightarrow (iii)$ $(P) \leftrightarrow (i), (Q) \leftrightarrow (ii), (R) \leftrightarrow (iii)$
edited
Jun 25
in
Algorithms

2.1k
views
gate20171
algorithms
algorithmdesigntechniques
4
answers
7
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
in
Algorithms

2k
views
gate2001
algorithms
asymptoticnotations
timecomplexity
normal
3
answers
8
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
in
Algorithms

942
views
gate1997
algorithms
normal
algorithmdesigntechniques
3
answers
9
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
in
Algorithms

2.4k
views
gate20153
algorithms
asymptoticnotations
normal
3
answers
10
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
in
Theory of Computation

807
views
normal
gate2007
theoryofcomputation
finiteautomata
3
answers
11
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
in
Theory of Computation

1.6k
views
gate2007
theoryofcomputation
finiteautomata
normal
1
answer
12
GATE 2018 GA  6(Electrical Engineering)
commented
Jun 25
in
Numerical Ability

268
views
gate2018
numericalability
normal
3
answers
13
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
in
Numerical Ability

114
views
isi2017
numericalability
numericalcomputation
4
answers
14
GATE201818
The chromatic number of the following graph is _____
commented
Jun 7
in
Graph Theory

1.5k
views
graphtheory
graphcoloring
numericalanswers
gate2018
4
answers
15
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
in
Probability

274
views
engineeringmathematics
isi2017
probability
1
answer
16
# 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
in
Algorithms

88
views
algorithms
2
answers
17
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
in
Graph Theory

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

204
views
computernetworks
networksecurity
barc2018
0
answers
19
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
in
IISc/IITs

52
views
gate2018admissions
1
answer
20
****** 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
in
Programming

152
views
0
answers
21
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. ... .132.0/22 \text{ and } 245.248.132.0/21$ $245.248.136.0/24 \text{ and } 245.248.132.0/21$
closed
Mar 31
in
Computer Networks

113
views
computernetworks
ipaddressing
networkaddressing
ip
subnetting
0
answers
22
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
in
CO & Architecture

34
views
coandarchitecture
2
answers
23
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
in
Theory of Computation

82
views
virtualgate
testseries
theoryofcomputation
0
answers
24
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
in
CO & Architecture

58
views
coandarchitecture
1
answer
25
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
in
Algorithms

59
views
algorithms
1
answer
26
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
in
IS&Software Engineering

166
views
datastructure
splaytree
1
answer
27
time complexity
let $S$ be a String containing either $0$ or $1$ .further there are no two consecutive $0s$ in $S$. No of solution on an input size $S(N)$ is bounded by $O(n^2)$ $O(nlogn)$ $O(2^n)$ $O(n)$
edited
Mar 31
in
Algorithms

86
views
2
answers
28
time complexity
$t(n)= 2t(\sqrt n) +c $; if $n>2$ $\qquad =1$; if $n<=2$ $O(logn n) $ $O(log log n)$ $O(nlog n)$ $O(n)$
retagged
Mar 31
in
Algorithms

66
views
algorithms
1
answer
29
Test series
$\text{What is three address code representation of this ?}$ a+bc^d^e*fg
edited
Mar 31
in
Compiler Design

136
views
compiler
compilerdesign
2
answers
30
Time & work
$A$ does half as much work as $B$ in threefourths of the time. If together they take $18$ days to complete a work, how much time shall $A$ & $B$ take to do it individually ?
edited
Mar 31
in
Numerical Ability

125
views
numericalability
worktime
1
answer
31
Profit & loss
A cloth merchant announces $25$ percent rebate in prices. If one needs to have a rebate of $Rs. 40$, then how many shirts each costing $Rs. 32$, he should purchase ?
edited
Mar 31
in
Numerical Ability

77
views
numericalability
profitloss
1
answer
32
Radix Sort Problem
The complexity of Radix Sort is $O(wn)$, for $n$ keys which are integers of word size $w$. Here, $w=log_2(n^k)=k\times log_2(n)$ So, the complexity is $O(wn)=O(k\times log_2(n)\times n)$ For instance if size is $n^3$ the complexity ... nlogn)$ Then why we say radix sort sorts the input in linear time? Similar Concept used to solve : https://gateoverflow.in/3353/gate2008it43
retagged
Mar 31
in
Algorithms

86
views
algorithms
radixsort
timecomplexity
sorting
0
answers
33
Sheldon Ross
Determine the number of vectors $\{x_{1}...x_{n}\}$, such that each $x_{i}$ is either $0$ or $1$ and $\displaystyle{\sum_{i=1}^{n}x_{i}\geq k}$
edited
Mar 31
in
Combinatory

105
views
sheldonross
permutationsandcombinations
2
answers
34
For loop
Consider the following pseudo code. What is the total number of multiplications to be performed? D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3 Half of the product of the $3$ consecutive integers Onethird of the product of the $3$ consecutive integers Onesixth of the product of the $3$ consecutive integers None of the above
edited
Mar 31
in
Algorithms

65
views
algorithms
1
answer
35
Self Doubt
What would be the execution order of the below statement? $$A \implies B \implies C$$
edited
Mar 31
in
Mathematical Logic

80
views
discretemathematics
2
answers
36
WebProbability
A candidate is selected for interview of management trainees for $3$ companies. For the first company, there are $12$ candidates, for the second there are $15$ candidates and for the third, there are $10$ candidates. Find the probability that he is ... be selected in each of the interviews, and all candidates appearing for the interview have an equal probability of getting selected.
retagged
Mar 31
in
Probability

59
views
probability
engineeringmathematics
2
answers
37
Theory of Computation Regular Expression
edited
Mar 31
in
Theory of Computation

98
views
theoryofcomputation
2
answers
38
mock test
Given an array $A[1:6,2:10] $. The base address of array is $1000$. If every elements take $4$ Bytes for storage . Then compute the address of element $A[5,7]$. Assume row major storage. $1245$ $1348$ $2434$ $1384$
edited
Mar 31
in
Programming

160
views
multidimensional
arrays
2
answers
39
mock test
Consider following pseudo code : main() { int t1,t2,t3; t1=t2=t3=0; t1=fork(); t2=fork(); if (t1!=0){t3=fork(); printf("Hello");} } How many Hello's are printed when above code get executed. $1$ $2$ $3$ $4$
edited
Mar 31
in
Operating System

181
views
fork
operatingsystem
1
answer
40
Made Easy Test Series
$L2$ is Regular ot not.?Please give proper example. $L_1= \{a^nb^n \mid n\geq 0 \} $ $L_2 = (L_1)^*$
edited
Mar 31
in
Theory of Computation

96
views
theoryofcomputation
38,187
questions
45,688
answers
132,723
comments
49,654
users