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
0
votes
1
probability
I am fine with (a)...which is 1/3....i am not able to understand b) and c) ....i feel answer as same for all 3 ...but answer given is different ....can anybody tell the difference between a) and b),c)
answered
1 day
ago
in
Numerical Ability

23
views
probability
engineeringmathematics
discretemathematics
aptitude
+1
vote
2
probability
In a bag,there are 4 fair coins and 3 unfair coins.The probability of getting a head in those unfair coins is 1/3 and tail is 2/3.Now if 2 coins are taken from the bag and flipped.What is the probability of getting both as heads ?
answered
2 days
ago
in
Numerical Ability

45
views
probability
engineeringmathematics
discretemathematics
aptitude
+3
votes
3
#probability_doubt_in_basic_concept
answered
2 days
ago
in
Numerical Ability

64
views
probability
engineeringmathematics
discretemathematics
aptitude
numericalability
+3
votes
4
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 ________.
answered
6 days
ago
in
CO & Architecture

722
views
gate20171
co&architecture
cachememory
+1
vote
5
probability
Five people, designated as A, B, C, D, E, are arranged in linear order. Assuming that each possible order is equally likely, what is the probability that (a) there is exactly one person between A and B? (b) there are exactly two people between A and B?
answered
6 days
ago
in
Numerical Ability

36
views
probability
discretemathematics
engineeringmathematics
aptitude
+3
votes
6
probability
How many people have to be in a room in order that the probability that at least two of them celebrate their birthday in the same month is at least $1/2$ ? Assume that all possible monthly outcomes are equally likely.
answered
6 days
ago
in
Numerical Ability

43
views
probability
engineeringmathematics
discretemathematics
aptitude
+3
votes
7
Self Framed
Whats the minimum number of multiplications required to compute $x^{7}$ * $x^{17}$ for any given integer value of 'x' ? A) 4 B) 5 C) 6 D) 7
answered
6 days
ago
in
DS

59
views
dynamic_programming
+2
votes
8
Relations
Let A={1,2,3,4,5,6,7} What will be no of symmetric relations on A that contains exactly 4 ordered pairs?
answered
Feb 20
in
Set Theory & Algebra

66
views
relations
discretemathematics
settheory&algebra
+3
votes
9
GATE2017148
Let $A$ be an array of 31 numbers consisting of a sequence of 0's followed by a sequence of 1's. The problem is to find the smallest index $i$ such that $A\left [i \right ]$ is 1 by probing the minimum number of locations in $A$. The worst case number of probes performed by an optimal algorithm is ____________.
answered
Feb 19
in
Algorithms

955
views
gate20171
algorithms
normal
numericalanswers
+1
vote
10
Congestion avoidance in TCP
During Congestion avoidance(Additive Increase) in tcp when 3 duplicate ACKs arrived then during that arrival phase by which algorithm did the sender window adopt increment procedure? a) Sender window uses additive increase b)Sender window uses slow start which option is correct?
answered
Feb 19
in
Computer Networks

59
views
computernetworks
tcp
congestioncontrol
+4
votes
11
GATE2017135
Consider the following two functions. void fun1(int n) { if(n == 0) return; printf("%d", n); fun2(n  2); printf("%d", n); } void fun2(int n) { if(n == 0) return; printf("%d", n); ... n); } The output printed when $\text{fun1}(5)$ is called is (A) $53423122233445$ (B) $53423120112233$ (C) $53423122132435$ (D) $53423120213243$
answered
Feb 19
in
Programming

733
views
gate20171
programming
normal
tricky
+5
votes
12
GATE2017155
The output of executing the following C program is _______________ . #include<stdio.h> int total(int v) { static int count = 0; while(v) { count += v&1; v >>= 1; } return count; } void main() { static int x=0; int i=5; for(; i>0; i) { x = x + total(i); } printf("%d\n", x); }
answered
Feb 18
in
Programming

840
views
gate20171
programming
programminginc
normal
numericalanswers
+1
vote
13
program output
main() { static char a[3][4] = { "abcd", "efgh", "ijkl"}; putchar(**a); } a) compilation error b) run time error c)garbage d) none of these
answered
Feb 18
in
Programming

32
views
+2
votes
14
Scheduling
Consider N processes are sharing the cpu in round robin fashion. If the context switching time is S. What must be the time quantum 'Q' such that the number of context switches are reduced but at the same time each process is guranteed to get its term jobs at the cpu for every 'T' second time ??
answered
Feb 18
in
Operating System

42
views
operatingsystem
cpuscheduling
processschedule
+3
votes
15
GATE2017108
Consider the C code fragment given below. typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p>next != NULL) { p = p>next; } p>next = m; } Assuming that m and n ... the end of list n. (C) cause a null pointer dereference for all inputs. (D) append list n to the end of list m for all inputs.
answered
Feb 16
in
Programming

1.6k
views
gate20171
datastructure
linkedlists
programming
normal
+4
votes
16
Divide and conquer
Reply with solution @Arjun sir,@habibkhan,@vijaycs
answered
Feb 7
in
Algorithms

84
views
algorithms
divideandconquer
0
votes
17
Graph Theory Me workbook
How S2 is correct ,I can have more than nk edges like if n=7 and k=3 ,then K1(abcde) k2(f() k2(g).K1,k2,k3 are different compoinents i assumes,Now in K1 i can add one more edge between a to c or a to d and still it will be simple graph and it will have 3 components?Please help
answered
Feb 4
in
Set Theory & Algebra

41
views
discretemathematics
graphconnectivity
+4
votes
18
Group Theory discrete maths
A={1,2,3,4,5,6} Given that set A is a group with respect to multiplication mod 7.Is A a cyclic group?If yes,identify the generators. Is there any theorem that i cana pply here to solve without building operation table?
answered
Feb 4
in
Set Theory & Algebra

95
views
discretemathematics
groups
+1
vote
19
Probability
A fair coin is tossed ten times in succession. If the first toss produces a head, then the probability of getting exactly three heads in ten tosses is I am doing like : $\frac{1}{2}*n(9,2)*\frac{1}{2}^2\frac{1}{2}^7$ I am using ... ? After that i will find 2 success if of 9 trials. Please help,that inital (1/2) term above is correct ir should it be 1?
answered
Feb 3
in
Probability

121
views
probability
engineeringmathematics
+2
votes
20
probability
answered
Feb 3
in
Probability

66
views
+3
votes
21
P&C examples : finding no of ways
answered
Feb 2
in
Others

52
views
combinatory
combinations
+3
votes
22
Time Complexity
main() { int (b=1;b<=n;b*=2) { for(i=0;i<b;i++) { for(j=0;j<n;j+=2) { sum+=j; } for(j=0;j<n;j*=2) { sum*=j; } } } what is the complexity? }
answered
Jan 30
in
Algorithms

87
views
timecomplexity
algorithms
asymptoticnotations
+1
vote
23
ME test
In the above given logic circuit A = 1000 and B = 0011 the output DCBA and Cbcd of the circuit is WHat is 9's a?
answered
Jan 28
in
Digital Logic

36
views
+3
votes
24
PTE paging
consider a paging system with 48bit virtual address space.Each address defers to a byte in memory.suppose the size of page is 16KB and the main memory size is 16GB.The minimum size of page table with each entry need 2 protection bits is _____ (in GB) ... i round it to 3bytes and make answer as 48GB or shuld i keep it as it is and write the answer as 44GB?
answered
Jan 28
in
Operating System

99
views
operatingsystem
paging
+4
votes
25
MADE EASY TEST SERIES
Computer A has 30 MB to send on a network and transmits the data in burst at 6 Mbps. The maximum transmission rate across routers in the network is 4 Mbps. If computer A’s transmission is shaped using a leaky bucket. The capacity that the queue in the bucket must hold so that no data is discarded is ______ (in MB) upto 1 decimal place.
answered
Jan 25
in
Algorithms

71
views
+5
votes
26
Virtual GATE test series
Find the 100th term of the series 2, 4, 8, 14, 22, 32, 44....
answered
Jan 23
in
Numerical Ability

104
views
virtualgate
easy
+4
votes
27
Made EasyCBT2017Q52
Consider the following Node definitions of B Tree and B+ Tree Order P for root node between 1 to 2P keys for other nodes between P to 2P keys If disk block size is of 2048B and key is 20B . Block pointer is 30B . Record Pointer is 25B . Difference between order of B tree with B+ Tree is _______
answered
Jan 23
in
Databases

286
views
madeeasy
cbt2017
btree
databases
+7
votes
28
Made Easy Test Series
$L={{0^{l}1^{m}0^{l+m} l, m\geq 0}}$ Is it DCFL? Explain?
answered
Jan 23
in
Theory of Computation

207
views
madeeasy_testseries
toc
dcfl
+6
votes
29
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
Jan 22
in
CO & Architecture

193
views
co&architecture
pipeline
stall
+5
votes
30
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
Jan 22
in
Verbal Ability

107
views
aptitude
numericalability
+7
votes
31
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
Jan 21
in
Programming

110
views
+3
votes
32
Made easy Test series
answered
Jan 21
in
DS

84
views
madeeasy_testseries
linkedlists
datastructure
+1
vote
33
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
Jan 20
in
Verbal Ability

64
views
gate2016session2aptitude
+3
votes
34
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
Jan 18
in
Databases

92
views
databases
transactions
+2
votes
35
Integration
what is the integration of this funcion? f(x)=1−x where −1≤x≤1
answered
Jan 18
in
Calculus

77
views
calculus
integration
+10
votes
36
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
Jan 18
in
Probability

350
views
engineeringmathematics
probability
+2
votes
37
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
Jan 17
in
Programming

134
views
programminginc
madeeasy_testseries
+2
votes
38
quadratic probing collison loop count??
answered
Jan 17
in
DS

79
views
hashing
datastructure
+2
votes
39
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
Jan 17
in
Theory of Computation

284
views
decidability
+4
votes
40
What is the expected length of the cycle containing vertex 1?
answered
Jan 17
in
Graph Theory

226
views
expectation
graphtheory
engineeringmathematics
Page:
1
2
3
4
5
6
...
8
next »
20,933
questions
26,054
answers
59,785
comments
22,209
users