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.
Answers by Debashish Deka
User Debashish Deka
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Debashish Deka
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+3
votes
1
Pipeline
Assume that execution of 200 instructions on a 6 staged pipeline where the target address is available at 4th stage.Let X be the probability of an instruction not being branch. The value of X such that speedup is atleast 5 is?
answered
10 hours
ago
in
CO & Architecture

75
views
co&architecture
pipeline
stall
+4
votes
2
Quantative Aptitude
$1+2*\frac{1}{2}+3*\frac{1}{2}^{2}+4*\frac{1}{2}^{3}+5*\frac{1}{2}^{4}$............ Please explain how is this equals to $(1\frac{1}{2})^{2}$
answered
12 hours
ago
in
Verbal Ability

58
views
aptitude
numericalability
+7
votes
3
C Program
#include <stdio.h> char *str[]={"FirstSring","Is","Already","Written"}; char **strp[]={str+3,str+2,str+1,str}; char ***strpp=strp; int main(void) { printf("%s",**++strpp); printf("%s",**++strpp+3); return 0; } Output of this, and the interpretation?
answered
1 day
ago
in
Programming

85
views
+2
votes
4
Made easy Test series
answered
1 day
ago
in
DS

52
views
madeeasy_testseries
linkedlists
datastructure
+1
vote
5
GATE2016Session2GA10
Which of the following curves represents the function $y=In \left( \mid e^{\left[\mid \sin \left( \mid x \mid \right) \mid \right]} \right)$ for $\mid x \mid < 2\pi$? Here, $x$ represents the abscissa and $y$ represents the ordinate.
answered
2 days
ago
in
Verbal Ability

33
views
gate2016session2aptitude
+3
votes
6
Schedule's
$1)$ Consider schedule below. Determine whether schedule is cascadeless or not ? r1(x); r2(z); r1(z); r3(x); r3(y); w1(x); c1; w3(y); c3; r2(y); w2(z); w2(y);c2
answered
4 days
ago
in
Databases

83
views
databases
transactions
+2
votes
7
Integration
what is the integration of this funcion? f(x)=1−x where −1≤x≤1
answered
4 days
ago
in
Calculus

41
views
calculus
integration
+7
votes
8
Maths: Probability Que011
(i) Three identical dice are rolled. the probability that the same number will appear on each of them is___ A. 1/6 B.1/36 C.1/18 D.3/28 (iI) Three Distinct dice are rolled. the probability that the same number will appear on each of them is___
answered
4 days
ago
in
Probability

267
views
engineeringmathematics
probability
+1
vote
9
ouput of program
Consider the following program: void find(struct Node *node) { struct Node *ptr,*q; q = (struct Node *)malloc(sizeof(struct Node)); q>left = NULL; q>right = NULL; if(node == NULL) return; find(nod>left); find( ... passed to the above function, by main function the sum of all the keys in the resultant tree produced by find() is given by___?
answered
5 days
ago
in
Programming

92
views
programminginc
madeeasy_testseries
+1
vote
10
quadratic probing collison loop count??
answered
5 days
ago
in
DS

54
views
hashing
datastructure
+2
votes
11
Self doubt
REF: http://gateoverflow.in/76419/decidability Consider the language: 1) L = {<M> L(M) = $\epsilon$ } 2) L = {<M> M accepts epsilon } Now, lets consider the 1st language: It will contain all TM encodings for TM' ... other question is if we can have finite automata that accepts $\epsilon$, then we can also have TM that accepts $\epsilon$, right?
answered
5 days
ago
in
Theory of Computation

206
views
decidability
+4
votes
12
What is the expected length of the cycle containing vertex 1?
answered
5 days
ago
in
Graph Theory

182
views
expectation
graphtheory
engineeringmathematics
+9
votes
13
Testbook
answered
6 days
ago
in
Graph Theory

202
views
testbook
probability
graphtheory
bst
combinatorics
+4
votes
14
MADE EASY TEST SERIES
Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’. What is the expected number of colliding pairs of elements, if we used simple uniform hashing?
answered
6 days
ago
in
DS

66
views
hashing
+11
votes
15
TestBook2017Test1
The function defined for positive integers by $F\left ( 1 \right )=1 F\left ( 2 \right )=1 F\left ( 3 \right )=1$ and by identites $F\left ( 2k \right )=F\left ( k \right ), F\left ( 2k+1 \right )=F\left ( k \right ) for\; k>=2$ then sum $F\left ... )+F\left ( 2 \right )+F\left ( 3 \right )+....................+F\left ( 100 \right )$ is___ ??
answered
6 days
ago
in
Others

292
views
testbooktestseries
numericalanswers
+2
votes
16
Testbook
int x=0; int A(n) { statement //takes O(1) time if(n==1) return 1; else { X+=8A(n/2)+n3 } return X } What is the time complexity f the above code?
answered
Jan 15
in
Algorithms

122
views
testseries
+5
votes
17
probability
There are 3 fair coins and 1 false coin with tails on both sides. A coin is chosen at random and tossed 4 times. if tail occures in all 4 times, then the probability that the false coin has been chosen for tossing is ?
answered
Jan 15
in
Numerical Ability

96
views
+7
votes
18
GATE200682
Consider the diagram shown below where a number of LANs are connected by (transparent) bridges. In order to avoid packets looping through circuits in the graph, the bridges organize themselves in a spanning tree. First, the root bridge is identified as the bridge with the least serial ... B3, B4, B2 B1, B3, B5, B2, B4 B1, B5, B2, B3, B4 B1, B3, B4, B5, B2
answered
Jan 14
in
Computer Networks

1.8k
views
gate2006
computernetworks
bridges
normal
+5
votes
19
CNTCP
Assume a new TCP connection starts by sending 1 segment and then increases it congestion windows by 1 segment each time it receives an acknowledgement i,e after 1RTT congestion window is 2 segments in slowstart.Assume connection never leaves slow start.Find the number of RTT's it takes to send N segments Given ans is Log2(N+1)
answered
Jan 13
in
Computer Networks

84
views
computernetworks
tcp
congestioncontrol
+3
votes
20
Maths: Group Theorey
A group G in which (ab)2 = a2b2 for all a,b in G is neccessarily A. finite B. cyclic C. of order two D. Abelian please prove it ands: D
answered
Jan 12
in
Set Theory & Algebra

83
views
settheory&algebra
discretemathematics
+1
vote
21
find the output
#include int main() { char *x; x = (char *) &a; a = 512; x[0] = 1; x[1] = 2; printf("%d\n",a); return 0; } What is the output of above program? (a) Machine dependent b) 513 (c) 258 (d) Compiler Error
answered
Jan 11
in
Programming

69
views
programminginc
+8
votes
22
Generating Function
Find the coefficient of x83 in (x5+ x8+ x11+ x14+ x17)10 ?
answered
Jan 11
in
Combinatory

142
views
generatingfunctions
combinatorics
combinatory
+3
votes
23
Poisson Distribution Problem
answered
Jan 11
in
Probability

90
views
+3
votes
24
Character value outout
answered
Jan 11
in
Programming

67
views
+3
votes
25
random variable
answered
Jan 11
in
Mathematical Logic

42
views
+3
votes
26
Time complexity
answered
Jan 10
in
Algorithms

54
views
+4
votes
27
Peterson Solution
How to check the bound waiting progress in Petersn Solution to Critical Problems
answered
Jan 10
in
Operating System

61
views
operatingsystem
processsynchronization
+3
votes
28
Maximum number of Processes
A system has 27 instances of resources 'R' and maximum instances a process can request is 4. Maximum number of processes so that system can be in safe state now? (A) 24 (B) 6 (C) 7 (D) 8
answered
Jan 10
in
Operating System

44
views
operatingsystem
deadlock
+4
votes
29
Regular Expression  Equality
I want to know whether the following Regular Expressions are Equal ? (a+b) * = (a* + b*)* = (a* + b)* = (a + b*)* = (a* b*)* = (b* a*)* = a*(ba*)* = (a*b)*a*
answered
Jan 9
in
Theory of Computation

103
views
regularexpressions
theoryofcomputation
+6
votes
30
Test series
The number of min heap trees are possible with 13 elements such that every leaf node must be greater than all nonleaf nodes of the tree are ___ A. 627 B. 747 C. 657 D. 757
answered
Jan 9
in
Programming

176
views
testseries
+2
votes
31
ME algo doubt
answered
Jan 8
in
Algorithms

82
views
summation
algorithms
timecomplexity
+3
votes
32
SDT evaluation
$\begin{align*} &E\rightarrow E+E \qquad {\color{red}{\text{E.val} = \text{E}_1\text{.val} { \;\;\large + \;\; } \text{E}_2\text{.val}}} \\ &E\rightarrow E*E \; \qquad {\color{red}{\text{E.val} = \text{E}_1\text{.val} { \;\;\ ... \left ( 3*3 \right )+\left ( 3*5 \right )  6 \right ]+7}} \quad \text{is evaluated using above SDT ?} \\ \end{align*}$
answered
Jan 7
in
Compiler Design

173
views
madeeasy_testseries
syntaxdirectedtranslation
+2
votes
33
Division Operation  Relational Algebra
answered
Jan 6
in
Databases

91
views
relationalalgebra
divisionoperation
+6
votes
34
sorted array in dijkstra
What is the time complexity to implement Dijkstra's algorithm using a sorted array instead of heap for a Priority Queue? for sorted array let V be the number of nodes and E be the number of edges 1)extract min operation it will take ... be sorted..so it will take VlogV time if we use merge sort.so ,total time is E*VLOGV please verify this.
answered
Jan 6
in
Algorithms

78
views
algorithms
timecomplexity
+2
votes
35
Floating point
In an enhancement of a design of a CPU, the speed of a floating point unit has been increased by 30% and the speed of a fixed point unit has been increased by 20%. The overall speedup achieved if the ratio of the number of ... operation used to take twice the time taken by fixed point operation in the original design (upto 2 decimal places) is _________.
answered
Jan 6
in
CO & Architecture

91
views
+4
votes
36
GATE200448
Consider two processes $P_1$ and $P_2$ accessing the shared variables $X$ and $Y$ protected by two binary semaphores $S_X$ and $S_Y$ respectively, both initialized to 1. $P$ and $V$ denote the usual semaphore operators, where $P$ decrements the semaphore value, and $V$ increments the ... (S_X), P(S_X); P(S_Y), P(S_Y)$ $P(S_X), P(S_Y); P(S_X), P(S_Y)$
answered
Jan 5
in
Operating System

586
views
gate2004
operatingsystem
processsynchronization
normal
+5
votes
37
multilevel paging
In a 32bit machine we subdivide the virtual address into 4 segments as follows: 10bit 8bit 6bit 8 bit We use a 3level page table, such that the first 10bit are for the first level and so on. What is the size ... a process that has 256K of memory starting at address 0? How to solve such questions?? please someone answer it with proper explanation
answered
Jan 4
in
Operating System

159
views
multilevelpaging
paging
multilevel
operatingsystem
+3
votes
38
Algorithm
answered
Jan 4
in
Algorithms

54
views
+8
votes
39
Computer Architecture Pipelining
answered
Jan 4
in
CO & Architecture

365
views
pipeline
branchconditionalinstructions
co&architecture
+5
votes
40
Combinatorics Doubt
A box contain 10 screws out of which 3 are defective.If two screws are drawn at random WITH REPLACEMENT.What is the probability that no screw is defective? Answer given as 7c2/10C2 my question is ,as its given With Replacement. So why not it is (7/10)*(7/10)
answered
Jan 4
in
Combinatory

104
views
Page:
1
2
3
4
5
6
7
next »
19,238
questions
24,127
answers
53,273
comments
20,327
users