GATE CSE
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.
Recent activity by akash.dinkar12
User akash.dinkar12
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User akash.dinkar12
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
algorithm
worst case time complexity of job sequencing with deadline using greedy algorithm
answered
1 day
ago
in
Algorithms

15
views
4
answers
2
GATE1996_1.1
Let $A$ and $B$ be sets and let $A^c$ and $B^c$ denote the complements of the sets $A$ and $B$. The set $(AB) \cup (BA) \cup (A \cap B)$ is equal to $A \cup B$ $A^c \cup B^c$ $A \cap B$ $A^c \cap B^c$
answered
2 days
ago
in
Set Theory & Algebra

259
views
gate1996
settheory&algebra
easy
sets
4
answers
3
GATE20082
If $P, Q, R$ are subsets of the universal set U, then $$(P\cap Q\cap R) \cup (P^c \cap Q \cap R) \cup Q^c \cup R^c$$ is $Q^c \cup R^c$ $P \cup Q^c \cup R^c$ $P^c \cup Q^c \cup R^c$ U
answered
2 days
ago
in
Set Theory & Algebra

440
views
gate2008
normal
settheory&algebra
sets
3
answers
4
GATE2006IT23
Let P, Q and R be sets let Δ denote the symmetric difference operator defined as PΔQ = (P U Q)  (P ∩ Q). Using Venn diagrams, determine which of the following is/are TRUE? PΔ (Q ∩ R) = (P Δ Q) ∩ (P Δ R) P ∩ (Q ∩ R) = (P ∩ Q) Δ (P Δ R) I only II only Neither I nor II Both I and II
answered
2 days
ago
in
Set Theory & Algebra

445
views
gate2006it
settheory&algebra
normal
sets
3
answers
5
GATE200622
Let $E, F$ and $G$ be finite sets. Let $X = (E ∩ F)  (F ∩ G)$ and $Y = (E  (E ∩ G))  (E  F)$. Which one of the following is true? $X ⊂ Y$ $X ⊃ Y$ $X = Y$ $X  Y ≠ \phi$ and $Y  X ≠ \phi$
answered
2 days
ago
in
Set Theory & Algebra

228
views
gate2006
settheory&algebra
normal
sets
0
answers
6
Theory of computation by daniel cohan
commented
4 days
ago
in
Theory of Computation

88
views
theoryofcomputation
finiteautomata
0
answers
7
suggestion
in gate few questions came frm generating functions how to solve them ????
commented
4 days
ago
in
Mathematical Logic

12
views
0
answers
8
process schedule
commented
5 days
ago
in
Operating System

14
views
operatingsystem
processschedule
1
answer
9
Macros
# include <stdio.h> # define scanf "%s GeeksQuiz" int main() { printf(scanf, scanf); return 0; } (A) Compiler Error (B) %s Geeks Quiz (C) Geeks Quiz (D) %s Geeks Quiz Geeks Quiz
answered
6 days
ago
in
Programming

60
views
3
answers
10
GATE2014251
A cycle on $n$ vertices is isomorphic to its complement. The value of $n$ is _____.
commented
Jul 18
in
Graph Theory

914
views
gate20142
graphtheory
numericalanswers
normal
graphisomorphism
4
answers
11
GATE2006IT46
Which of the following is the correct decomposition of the directed graph given below into its strongly connected components? {P, Q, R, S}, {T}, {U}, {V} {P,Q, R, S, T, V}, {U} {P, Q, S, T, V}, {R}, {U} {P, Q, R, S, T, U, V}
commented
Jul 16
in
Algorithms

757
views
gate2006it
algorithms
graphalgorithms
normal
1
answer
12
COA problem in pipelining
Consider a 4 stage pipeline with stages named S1,S2,S3,S4. Let I1,I2,I3,I4 be 4 instructions and the number of clockcycles needed by each instruction in each stage is given below. The number of clockcycles needed to complete the instruction cycle of the 4 instructions is ___.
comment edited
Jul 16
in
CO & Architecture

46
views
co&architecture
pipelining
1
answer
13
GATE2007IT3, UGCNETJune2012III34
commented
Jul 15
in
Algorithms

797
views
gate2007it
algorithms
graphalgorithms
normal
ugcnetjune2012iii
1
answer
14
computer network
In bit stuffing protocol for frame synchronisation, if stuff bit pattern is 011110 then how many zero bits stuffed by transmitter while transmitting given frame (except start of transmission and end of transmission) DATA FRAME : 1011101111011111110
commented
Jul 7
in
Computer Networks

34
views
1
answer
15
computer org
A 32 bit machine processor has 32 registers, each of it is 16 bit long.Each instruction is specified with 4 fields, namely operation part, immediate operand in addition to 2 register operands. Assume that immediate operand ... in immediate operand field is +4095 Max number of instructions that can be permitted by this processor is _______________________
commented
Jul 6
in
CO & Architecture

29
views
10
answers
16
GATE 2016139
Let G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5, and 6. The maximum possible weight that a minimum weight spanning tree of G can have is __________
commented
Jul 5
in
Algorithms

3.6k
views
gate20161
algorithms
spanningtree
normal
numericalanswers
1
answer
17
Relations
Please tell me how to calculate total number of symmetric relations on a set of 5 elements. I know the answer but want the proof.
commented
Jul 5
in
Set Theory & Algebra

28
views
relations
settheory&algebra
discretemathematics
2
answers
18
Shortest Path Algorithms
For a given undirected weighted graph G with V number of vertices, if you want to find all pair shortest paths then which one of the following is true ? a) run dijkstra's shortest path algorithm only once. b) run dijkstra's shortest path algorithm V times. What if the given graph is directed ?
answered
Jul 4
in
Algorithms

61
views
algorithms
graphalgorithms
shortestpath
1
answer
19
Minimal DFA
answered
Jul 1
in
Theory of Computation

18
views
4
answers
20
GATE 2016132
The stage delays in a $4$stage pipeline are $800, 500, 400$ and $300$ picoseconds. The first stage (with delay $800$ picoseconds) is replaced with a functionality equivalent design involving two stages with respective delays $600$ and $350$ picoseconds. The throughput increase of the pipeline is ___________ percent.
answered
Jun 29
in
CO & Architecture

2.9k
views
gate20161
co&architecture
pipelining
normal
numericalanswers
1
answer
21
Bitwise operation
#include <stdio.h> int main() { unsigned int m = 0; m = 0xA38; printf("%x\n",m(m1)); printf("%x\n",( (m(m1)) + 1 ) & m ); } Find the output ?
commented
Jun 28
in
Programming

40
views
programminginc
bitwise
1
answer
22
Test Series
Consider the following function Worst case complexity of fun() ?
commented
Jun 22
in
Algorithms

55
views
3
answers
23
CONFLICT SERIALIZABLE
What is the answer?
answered
Jun 21
in
Databases

37
views
1
answer
24
gate 2017
in set 1 of gate 2017, few questions like "birthday attack" , question from vector space algebra was out of syllabus/not expected. can we expect same in gate 2018?
commented
Jun 20
in
GATE

74
views
2
answers
25
Computer Networks Ethernet
what is the mean of this equation in Ethernet ? Transmission Time >= 2*Propagation Time
commented
Jun 18
in
Computer Networks

68
views
computernetworks
network
5
answers
26
GATE2017125
Consider a twolevel cache hierarchy with $L1$ and $L2$ caches. An application incurs $1.4$ memory accesses per instruction on average. For this application, the miss rate of $L1$ cache is $0.1$; the $L2$ cache experiences, on average, $7$ misses per $1000$ instructions. The miss rate of $L2$ expressed correct to two decimal places is ________.
commented
Jun 18
in
CO & Architecture

1.2k
views
gate20171
co&architecture
cachememory
3
answers
27
Candidate key
how many number of candidate keys in the following relation r = (a, b, c, d, e, h) on which the following functional dependencies hold: {a →bc, c d→ e, e → c,d → aeh,abh→ bd, dh → bc}. what are the candidate keys r?
commented
Jun 15
in
Databases

56
views
2
answers
28
Programmin
main() { char check ='a'; switch(check) { case 'a'1:printf("gats"); case 'b'  2: printf("quiz"); break; default :printf("Gatesquiz"); } } a)gates b)gatesquiz c)gatesquizgatesquiz d)compiler error
answer edited
Jun 15
in
Programming

42
views
1
answer
29
Programming
Main() { unsigned int x[4][3]={{1,2,3},{4,5,6},{7,8,9},{10,11,12}}; printf("%u %u %u",x+3,*(x+3),*(x+2)+3); } A) 2036,2036,2036 b)2012,4,2204 c)2036,10,10 d)2012,4,6
commented
Jun 14
in
Programming

23
views
0
answers
30
ISRO 2017
Will I clear the written test round for ISRO 2017 recruitment exam for 'SC'(CSE) with a score of 137 in general category?
commented
Jun 11
in
Others

58
views
1
answer
31
SQL Query
Select operation in SQL is a a) Data query language b) Data definition language c) Data manipulation language d) Data control language Confused between option a) and option c) .
answered
Jun 11
in
Databases

28
views
2
answers
32
Computer network
Which layer of tcp/ip is responsible for getting data to its destination?. 1. Link layer 2.application layer 3.network layer 4.transport layer
commented
Jun 10
in
Computer Networks

148
views
0
answers
33
Gate200021
(a) Suppose you are given an empty B+ tree where each node (leaf and internal) can store up to 5 key values. Suppose values 1, 2,.....10 are inserted, in order, into the tree. Show the tree pictorially after 6 insertions, and after ... approximately is the average number of keys in each leaf level node. in the normal case, and with the insertion as in (b).
commented
Jun 7
in
Databases

45
views
2
answers
34
C Programming
What is the o/p of following code? #include <stdio.h> int main(void) { int arr[5]={1,2,3,4,5}; int i; for(i=2;i<=5;i++) printf("%d ",arr[i*10]); return 0; }
commented
Jun 7
in
Programming

88
views
programminginc
output
gate
1
answer
35
ternary operator
How to solve ij&&ji ?????????
answered
Jun 6
in
Programming

25
views
2
answers
36
ugc net july 2016
33. Consider a weighted complete graph G on the vertex set {ν1 , ν2 , …. νn } such that the weight of the edge (νi , νj ) is 4  i – j. The weight of minimum cost spanning tree of G is : (1) 4n2 (2) n (3) 4n – 4 (4) 2n – 2
commented
Jun 5
in
Graph Theory

42
views
3
answers
37
c input output problem
int A(int m,int n) { if(!m) return n+1; if(!n) return A(m1,1); return A(m1,A(m,n1)); } int main() { printf("A(1,2)=%d",A(1,2)); } what will be the output and how?
answered
Jun 5
in
Programming

34
views
1
answer
38
GATE 2017 EC Set1
Trucks(10 m long) and cars (5m long) go on a single lane bridge. There must be a gap of at least 20m after each truck and a gap of at least 15m after each car. Trucks and cars travel at a speed of 36 km/h. If cars and trucks go alternately. What is the maximum number of vehicles that can use the bridge in one hour? (a)1440 (b) 1200 (c)720 (d)600
answered
Jun 5
in
Numerical Ability

120
views
gate2017
speedtimedistance
numericalability
2
answers
39
normal form
answer edited
Jun 5
in
Databases

42
views
2
answers
40
Probability of dice
If 4 dice tossed together , what is the probability of sum of these dice will be exactly 20? (want to see some shortcut procedure)
commented
Jun 5
in
Probability

175
views
probability
24,089
questions
31,062
answers
70,677
comments
29,400
users