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
Exam Category
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
GATE1995_22
How many minimum spanning trees does the following graph have? Draw them. (Weights are assigned to edges).
commented
10 hours
ago
in
Algorithms

488
views
gate1995
algorithms
graphalgorithms
spanningtree
easy
0
answers
2
Cache Organization
commented
1 day
ago
in
CO & Architecture

55
views
coandarchitecture
cachememory
2
answers
3
GATE200531
Consider the following Cprogram: void foo (int n, int sum) { int k = 0, j = 0; if (n == 0) return; k = n % 10; j = n/10; sum = sum + k; foo (j, sum); printf ("%d,",k); } int main() { int a = 2048, sum = 0; foo(a, sum); printf("%d\n", sum); } What does the above program print? 8, 4, 0, 2, 14 8, 4, 0, 2, 0 2, 0, 4, 8, 14 2, 0, 4, 8, 0
commented
1 day
ago
in
Algorithms

1.1k
views
gate2005
algorithms
identifyfunction
recursion
normal
5
answers
4
GATE2016235
The following function computes $X^{Y}$ for positive integers $X$ and $Y$. int exp (int X, int Y) { int res =1, a = X, b = Y; while (b != 0) { if (b % 2 == 0) {a = a * a; b = b/2; } else {res = res * a; b = b  1; } } return res; } Which one of the following ... $X^{Y} = a^{b}$ $(res * a)^{Y} = (res * X)^{b}$ $X^{Y} = res * a^{b}$ $X^{Y} = (res * a)^{b}$
commented
1 day
ago
in
Programming

1.3k
views
gate20162
programming
loopinvariants
normal
0
answers
5
Self Doubt in Regular Language TOC
commented
2 days
ago
in
Theory of Computation

114
views
theoryofcomputation
regularlanguages
0
answers
6
Functions
Consider the two functions F(x) = 2 logex G(x) = logex2 Both functions are identical or not??
asked
2 days
ago
in
Set Theory & Algebra

52
views
functions
1
answer
7
gatebook
commented
3 days
ago
in
Databases

83
views
1
answer
8
Compiler Design Test Series Question
commented
4 days
ago
in
Compiler Design

60
views
4
answers
9
GATE20151_41
Consider an EntityRelationship (ER) model in which entity sets E$_{1}$ and E$_{2}$ are connected by an m:n relationship R$_{12}$. E$_{1}$ and E$_{3}$ are connected by a 1 : n (1 on the side of E$_{1}$ ... model is derived from the above ER model, then the minimum number of relations that would be generated if all relation are in 3NF is________________.
commented
5 days
ago
in
Databases

1.9k
views
gate20151
databases
erdiagram
normal
numericalanswers
0
answers
10
SR,RR conflicts
commented
6 days
ago
in
Compiler Design

30
views
compilerdesign
parsing
1
answer
11
No.of no negative integer solutions
commented
6 days
ago
in
Linear Algebra

33
views
linearalgebra
1
answer
12
WIFI madeeasy
commented
6 days
ago
in
Computer Networks

235
views
computernetworks
wifi
2
answers
13
GATE2016254
For the IEEE 802.11 MAC protocol for wireless communication, which of the following statements is/are TRUE? (I) At least three nonoverlapping channels are available for transmissions. (II) The RTSCTS mechanism is used for collision detection. (III) Unicast frames are ACKed. All I, II, and III I and III only II and III only II only
commented
Nov 17
in
Computer Networks

2.2k
views
gate20162
computernetworks
wifi
normal
2
answers
14
Masters theorem
answer selected
Nov 17
in
Algorithms

74
views
1
answer
15
Pipelining with floating point operation..!!
commented
Nov 15
in
CO & Architecture

37
views
coandarchitecture
pipelining
0
answers
16
Number of comparisons
commented
Nov 13
in
Algorithms

72
views
0
answers
17
#PROBABILITY
Is there any relation between independent events and mutually exclusive events?
commented
Nov 13
in
Probability

28
views
probability
1
answer
18
Digital
If A and B are 4 bit Binary numbers given to a 4 bit comparator, then the number of combinations for which A > B is _______. (A) 120 (B) 160 (C) 116 (D) 140
commented
Nov 12
in
Digital Logic

53
views
comparator
digitallogic
1
answer
19
Count the Number of Dfa's
How many DFA's can be constructed with 3 states and 2 input symbols which accept empty language?
commented
Nov 12
in
Theory of Computation

51
views
theoryofcomputation
numberofdfa
dfa
0
answers
20
Classroom notes
PLease help me , i have seen the same questions in many places but didnt understand the solution .
commented
Nov 12
in
Theory of Computation

65
views
theoryofcomputation
numberofdfa
2
answers
21
NUMBER OF STATES IN DFA
commented
Nov 12
in
Theory of Computation

76
views
dfa
theoryofcomputation
finiteautomata
numberofstates
1
answer
22
Ace question prepositional logic
commented
Nov 11
in
Mathematical Logic

37
views
acetestseries
0
answers
23
self doubt
bootp is which layer protocol?
commented
Nov 11
in
Computer Networks

26
views
0
answers
24
main memory
1) Consider a system having 4 processes each take 0.6 fraction of time for I/O processing then CPU utilization. Main memory large enough to allocate all processes is _____________
commented
Nov 10
in
Operating System

41
views
3
answers
25
The number of essential prime implicates of F(A,B,C,D)=∑m(0,1,5,7,10,14,15)are
commented
Nov 10
in
Digital Logic

53
views
digitallogic
1
answer
26
aptitude
answer selected
Nov 10
in
Numerical Ability

46
views
0
answers
27
Exponential Back off Algorithm
Assume that X and Y are the only two stations on an ethernet. Each has a steady queue of frames to send. Both X and Y attempt to transmit a frame, collide and Y wins the first backoff race. At the end of this successful transmission by Y ... second backoff race is I think it should be 0.03125 or 1/32. But the answer given is 0.125 or 1/8.
commented
Nov 10
in
Computer Networks

39
views
computernetworks
exponentialbackoffalgorithm
1
answer
28
dirty bit
Dirty bit in page table is used for 1.implementing NRU page replacement 2.implementing optimal page replacement
commented
Nov 10
in
Operating System

40
views
1
answer
29
C Output
answer selected
Nov 10
in
Programming

47
views
1
answer
30
Please solve this Q
Question: 6 Given the following functional dependencies {X → W, X → Y, Y → Z, Z → PQ} Consider the FD set implied using above FD set. Implied FD set = {X → Z, X → WY, X → WZ, X → YQ, Y → P} The number of functional dependencies in implied FD set are invalid are _________.
commented
Nov 10
in
Databases

32
views
dbms
functionaldependencies
0
answers
31
Maths: maxima  minima (global minmum vs local minimum)
commented
Nov 9
in
Calculus

54
views
calculus
engineeringmathematics
maximaminima
0
answers
32
Turn Variable
Turn is shared variable but the values are not shared. Explain?
commented
Nov 9
in
Operating System

30
views
turnvariable
operatingsystem
processsynchronization
1
answer
33
Matrices  LU Decompostion
Is LU Decomposition possible for every matrix ?
commented
Nov 9
in
Linear Algebra

43
views
matrices
engineeringmathematics
linearalgebra
0
answers
34
UGCNETNov2017II09
Negation of the proposition ⱻ x H(x) is: 1) ⱻ x ¬H(x) 2) Ɐ x ¬H(x) 3) Ɐ x H(x) 4) ¬ x H(x)
commented
Nov 9
in
Mathematical Logic

42
views
ugcnetnov2017ii
mathematicallogic
0
answers
35
UGCNETNov2017II8
commented
Nov 9
in
Mathematical Logic

22
views
1
answer
36
UGCNETNov2017II21
Consider an array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored at index i of the array (i<= n), the index of the parent is: A. floor((i+1)/2) B. ceiling((i+1)/2) C. floor(i/2) D. ceiling(i/2)
commented
Nov 9
in
DS

39
views
ugcnetnov2017ii
datastructure
1
answer
37
computer networks syllabus
token bucket and leaky bucket algo are out of syllabus in gate 2018?
commented
Nov 8
in
Computer Networks

49
views
2
answers
38
Stack
Consider an efficient implementation of a data structure STACKMAX that support an operation max( ) that reports the current maximum among all elements in the stack. Normal stack operations i.e., push, pop are also to be supported. The size of above data ... , pop, pop, max, push (5) is ________ (in bytes). Assume that an integer can be stored in 4 bytes.
commented
Nov 7
in
DS

55
views
datastructure
stack
0
answers
39
TUring Machine
S1: Can a Turing machine ever write a blank symbol on its tape. S2: Any Turing machine must have at least two states which of above statements are true???
asked
Nov 7
in
Theory of Computation

33
views
1
answer
40
TOC_PDA
answer selected
Nov 6
in
Theory of Computation

75
views
29,153
questions
36,971
answers
92,116
comments
34,815
users