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 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
1
answer
1
GATE20152_25
A computer system implements a 40bit virtual address, page size of 8 kilobytes, and a 128entry translation lookaside buffer (TLB) organized into 32 sets each having 4 ways. Assume that the TLB tag does not store any process id. The minimum length of the TLB tag in bits is ____.
commented
8 hours
ago
in
Operating System

1.2k
views
gate20152
operatingsystem
virtualmemory
easy
numericalanswers
2
answers
2
Calculating branch frequency when speedup is given
commented
9 hours
ago
in
CO & Architecture

166
views
co&architecture
pipeline
madeeasy
2
answers
3
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?
commented
9 hours
ago
in
CO & Architecture

75
views
co&architecture
pipeline
stall
1
answer
4
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}$
commented
12 hours
ago
in
Verbal Ability

58
views
aptitude
numericalability
1
answer
5
General Doubt In rice theorem
If we are not able to apply nonmonote property ,then is it always true that it is RE but not REC,are there any scenarios where we can't apply nonmonotone property but still language is NOT RE. Say,L={TM L(TM) has atleast one ... not REC. P.S: By (i) and (ii) ,i mean the definitions mentioned here.(http://gatecse.in/ricestheorem/)
commented
13 hours
ago
in
Theory of Computation

27
views
theoryofcomputation
ricetheorem
decidability
2
answers
6
GATE2004IT87
A TCP message consisting of 2100 bytes is passed to IP for delivery across two networks. The first network can carry a maximum payload of 1200 bytes per frame and the second network can carry a maximum payload of 400 bytes per frame, ... . What is the total IP overhead in the second network for this transmission? 40 bytes 80 bytes 120 bytes 160 bytes
commented
13 hours
ago
in
Computer Networks

1.4k
views
gate2004it
computernetworks
networkflow
normal
3
answers
7
reducibility
given a decidable language L1 and some other language L2. can we decide whether L2 is reducible to L1? is the problem decidable?
commented
14 hours
ago
in
Theory of Computation

201
views
theoryofcomputation
1
answer
8
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?
answer edited
1 day
ago
in
Programming

85
views
0
answers
9
Evaluation order in return statement
comment edited
1 day
ago
in
Programming

130
views
programminginc
1
answer
10
C programming
#include <stdio.h> int f(int *a,int b) { b = b1; if(b == 0) return 1; else { *a = *a+1; return *a + f(a,b) ; } } int main() { int X = 5; printf("%d\n",f(&X,X)); } Predict the output If the return statement was return f(a,b)+ *a ; What would have been the output here ? Explain why there is change in output (if any)
commented
1 day
ago
in
Programming

183
views
programminginc
1
answer
11
Made easy Test series
commented
1 day
ago
in
DS

52
views
madeeasy_testseries
linkedlists
datastructure
1
answer
12
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
0
answers
13
quick sort
If we use quicksort algorithm to sort the elements: $16, 13, 14, 12, 21, 16, 23$ and $15$ in ascending order, what is the output after the first pass of quicksort? (Assume pivot element is beginning of an array)
commented
2 days
ago
in
Algorithms

49
views
algorithms
quicksort
sorting
0
answers
14
made easy algo complexity
What is the complexity of this code..??
closed
2 days
ago
in
Algorithms

43
views
1
answer
15
probability
Consider four coins, three of which are fair, that is they have heads on one side and tails on the other and both are equally likely to occur in a toss. The fourth coin has tails on both sides. Given that one coin amongst the four is picked at random and is tossed, and the outcome is seen to be tail, what is the probability that its other side is heads
commented
2 days
ago
in
Probability

42
views
probability
engineeringmathematics
2
answers
16
GATE20152_49
Consider a typical disk that rotates at 15000 rotations per minute (RPM) and has a transfer rate of $50 \times 10^6$ bytes/sec. If the average seek time of the disk is twice the average rotational delay and the controller's transfer time is ... disk transfer time, the average time (in milliseconds) to read or write a 512byte sector of the disk is _____.
answer edited
2 days
ago
in
Operating System

1.2k
views
gate20152
operatingsystem
disk
normal
numericalanswers
1
answer
17
Token Bucket  Gate 2016 Question
commented
2 days
ago
in
Computer Networks

189
views
tokenbucket
computernetworks
1
answer
18
number of BST
The number of BST possible with 6 nodes numbered 1, 2, 3, 4, 5 and 6 with exactly one leaf node __________
commented
2 days
ago
in
Algorithms

29
views
1
answer
19
Recursion
Consider the following recursive function which is used by dynamic programming. Assume for every function call T(i) it checks the table first, if its value is already computed it retrieves the value from table. Otherwise it calls a recursive ... of function calls that need the support of stack to complete the execution of the function T(12) are __________ .
commented
3 days
ago
in
Programming

244
views
4
answers
20
GATE200867
A processor uses 36 bit physical address and 32 bit virtual addresses, with a page frame size of 4 Kbytes. Each page table entry is of size 4 bytes. A three level page table is used for virtual to physical address translation, where the virtual address ... of the first, second and third level page tables are respectively 20,20,20 24,24,24 24,24,20 25,25,24
commented
3 days
ago
in
Operating System

4.4k
views
gate2008
operatingsystem
virtualmemory
normal
1
answer
21
testbook
Q,R,S are true for sure but how p is true ???
commented
4 days
ago
in
Digital Logic

61
views
testbook
testseries
digitallogic
1
answer
22
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
answer edited
4 days
ago
in
Databases

83
views
databases
transactions
1
answer
23
Pipelining
You are given a nonpipelined processor design which has a cycle time of 10ns and average CPI(cycle per instruction) of 1.4.The designers pipelined it into 5 stages with stage timing of 1ns,1.5ns,4ns,3ns,0.5ns, Each pipelined stage ... for 1 cycle and 5% of time for 2 cycles(these occurrences are disjoint).what is speedup compared to the original processor?
commented
4 days
ago
in
CO & Architecture

152
views
2
answers
24
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
2
answers
25
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?
commented
4 days
ago
in
Theory of Computation

206
views
decidability
3
answers
26
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___
commented
4 days
ago
in
Probability

267
views
engineeringmathematics
probability
2
answers
27
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
answer
28
quadratic probing collison loop count??
answer edited
5 days
ago
in
DS

54
views
hashing
datastructure
2
answers
29
What is the expected length of the cycle containing vertex 1?
answer edited
5 days
ago
in
Graph Theory

182
views
expectation
graphtheory
engineeringmathematics
1
answer
30
Testbook
answered
6 days
ago
in
Graph Theory

202
views
testbook
probability
graphtheory
bst
combinatorics
1
answer
31
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
2
answers
32
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___ ??
edited
6 days
ago
in
Others

292
views
testbooktestseries
numericalanswers
0
answers
33
TLB and EMAT
comment moved
6 days
ago
in
CO & Architecture

36
views
1
answer
34
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
2
answers
35
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
1
answer
36
toc doubt
comment edited
Jan 15
in
Theory of Computation

421
views
theoryofcomputation
decidability
recursiverecursivelyenumerable
1
answer
37
GATE200683
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 ... host H1 send out a broadcast ping packet. Which of the following options represents the correct forwarding table on B3?
answer selected
Jan 15
in
Computer Networks

186
views
gate2006
computernetworks
bridges
normal
4
answers
38
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
answer edited
Jan 14
in
Computer Networks

1.8k
views
gate2006
computernetworks
bridges
normal
1
answer
39
Effective CPU time
Consider a processor with an ideal CPI without memory stalls for each instruction type as follows: $$\begin{align*} \begin{matrix} &\text{ALU} &= 1 \\ &\text{Load/Store} &= 1.5 \\ &\text{Branch}&=1.5 \\ &\ ... instruction cache is $50$ cycles, then calculate the effective CPU time? A] $8.25$ B] $9.25$ C] $8.625$ D] $9.34$
edited
Jan 14
in
CO & Architecture

308
views
co&architecture
effectivecputime
2
answers
40
decidabilitytoc
Which of the following is not decidable problem? (a) A sting is generated by C.N.F or Not? (b) A given nonterminal A in a given grammar CFG is ever used in the generation of word (c) Given contextfree Grammar generates an infinite language or a finite language (d) None of the above
answer edited
Jan 13
in
Theory of Computation

120
views
19,238
questions
24,127
answers
53,273
comments
20,327
users