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
Chat
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 Vikram Bhat
User Vikram Bhat
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Vikram Bhat
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
3
answers
1
ME_Test_Series  CO : Cache Memory
commented
Sep 17, 2016
in
CO & Architecture

232
views
madeeasy
testseries
co&architecture
2
answers
2
Time Quantum Overhead1.1
Consider 4 processes sharing the CPU in a round robin fashion. Assuming that each process takes 5 seconds. What must be the maximum quantum size P. Such that the overhead resulting from process switching is minimized but at same time each process is guaranteed to gets its turn at CPU atleast every 40 seconds ________ (upto 2 decimal place).
commented
May 7, 2016
in
Operating System

106
views
processschedule
2
answers
3
GATE 2016213
Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in the ascending order, which of the following are TRUE? Quicksort runs in $\Theta (n^2)$ time Bubblesort runs in $\Theta (n^2)$ time Mergesort ... sort runs in $\Theta (n)$ time I and II only I and III only II and IV only I and IV only
commented
Feb 26, 2016
in
Algorithms

1.5k
views
gate20162
algorithms
sorting
timecomplexity
normal
ambiguous
1
answer
4
What will be the minimum value within a given range? GATEFORUM_MOCKS
answered
Jan 31, 2016
in
Calculus

138
views
calculus
maximaminima
engineeringmathematics
mocktest
1
answer
5
Finding maximum size of file
Given answer: 128 Please explain how to solve this problem
answered
Jan 29, 2016
in
Operating System

89
views
operatingsystem
memorymanagement
1
answer
6
Made Easy FLT
Assume Am × n, Bn × p and Cp × q are matrices where m > n > p > q. How many minimum number of multiplications are required to perform the following operation? Am × n × Bn × p × Cp × q [= (A B C)m × q] a) mnp+npq b) mnp+mpq c)mnq+npq d) mnq+mpq
answer edited
Jan 29, 2016
in
Algorithms

59
views
1
answer
7
VIRTUALGATE II Q.29 L is surely decidable if 
commented
Jan 29, 2016
in
Theory of Computation

147
views
virtualgate
decidability
theoryofcomputation
1
answer
8
Consider an L1 cache with an access time of 1 ns and a hit ratio of H 0.95.
commented
Jan 25, 2016
in
CO & Architecture

388
views
cachememory
1
answer
9
Number of tokens
commented
Jan 24, 2016
in
Compiler Design

189
views
tokens
lexeme
compilerdesign
acetestseries
1
answer
10
Pipelining1.1
For an unpipelined multicycle CPU clock cycle time = 10 ns. Memory operation, branch operation and ALU operations with instruction frequencies 40%, 20% and 40% respectively. If pipelining adds 2ns to the CPU cycle time then what is speed up in instruction executing from pipeline (assume each operation take 5 cycles)
commented
Jan 24, 2016
in
CO & Architecture

39
views
2
answers
11
Modulus of counter1.1
Please Explain the inverted clock. How is the first Flip flop getting the Clock input? What Cr(complement) means? And how to judge MSB LSB
answered
Jan 24, 2016
in
Digital Logic

45
views
counter
2
answers
12
madeeasytest COA Adv : Practice Test  27 q11
commented
Jan 21, 2016
in
CO & Architecture

183
views
co&architecture
madeeasy
testseries
1
answer
13
linked list
What does the following function do for a given Linked List with first node as head? void fun1(struct node* head) { if(head == NULL) return; fun1(head>next); printf("%d ", head>data); } will it print 54321 or 4321 if i/p is 12345?Will the last 5 get printed or not , due to return;
commented
Jan 21, 2016
in
Programming

114
views
linkedlists
0
answers
14
Threads
Q12). Consider the following statments. $S1$ : A thread running in critical section may get context switched . $S2$ : Hardware access to devices is usually unavailable in user mode. $S3$ : Modification to page tables are only possible in kernel mode, Which of ... S3$ d). $S1,S2,S3$ Is the statement S1 correct?? ans given is D but according to me it should be B
commented
Jan 14, 2016
in
Operating System

60
views
3
answers
15
GATE20002.3
Let S = $\sum_{i=3}^{100} i \log_{2} i$, and T = $\int_{2}^{100} x \log_{2}x dx$. Which of the following statements is true? S > T S = T S < T and 2S > T 2S ≤ T
commented
Jan 13, 2016
in
Calculus

496
views
gate2000
calculus
integration
normal
3
answers
16
GATE200582a
Let $s$ and $t$ be two vertices in a undirected graph $G=(V,E)$ having distinct positive edge weights. Let $[X,Y]$ be a partition of $V$ such that $s \in X$ and $t \in Y$. Consider the edge $e$ having the minimum weight amongst all ... spanning tree of G the weighted shortest path from s to t each path from s to t the weighted longest path from s to t
commented
Jan 12, 2016
in
Algorithms

723
views
gate2005
algorithms
graphalgorithms
normal
5
answers
17
expectation
A fair coin is tossed repeatedly till both head and tail appear atleast once. Average no of tosses required is ?
answered
Jan 12, 2016
in
Probability

347
views
gateec2014
expectation
3
answers
18
how many ways 10 persons can be divided into 5 teams of 2 each ?
commented
Jan 11, 2016
in
Combinatory

203
views
2
answers
19
How many 4 digit integers are there with digit 6 appearing exactly once
answered
Jan 11, 2016
in
Combinatory

98
views
combinatorics
2
answers
20
permutation
for aaaabbbcccdde find no of permutation such that 1)no two c are together 2)no 3 c are consecutive
answered
Jan 11, 2016
in
Combinatory

67
views
2
answers
21
How to evaluate the given series ?
answer edited
Jan 11, 2016
in
Set Theory & Algebra

63
views
2
answers
22
permutation
consider a stack A with 4 elements a,b,c,d with a being top of the stack . satck B is empty . an element popped out of stack A printed imidiatly or pushed to stack B. an entry popped out of stck B can only be printed . in tis arrangement how many numbers of possible permutation will be there to print output?
answered
Jan 10, 2016
in
Numerical Ability

63
views
2
answers
23
co
A computer has a cache, main memory and a hard disk used for virtual memory. If referenced word is in cache, 20 ns are required to access it. If it is in main memory but not in cache 60 ns are needed to load it into cache and ... hit ratio is 0.6. The average time in nano seconds required to access a referenced word on this system is ___________. Solution: 480026
commented
Jan 10, 2016
in
CO & Architecture

111
views
4
answers
24
complement of every contet free language is recursive ? or recursive enumerable? or both?
commented
Jan 10, 2016
in
Theory of Computation

663
views
1
answer
25
OS
Consider a 32 bit virtual address is used for paging with page size 1024 B.Two level paging is implemented with equal number of entries in every page table of the system. If page table entry size is 2 B , the maximum size of main memory supported by the above system _______________
answered
Jan 9, 2016
in
Operating System

64
views
2
answers
26
Volume generated by parabola about line [Gate 94]
answered
Jan 9, 2016
in
Calculus

150
views
calculus
integration
parabola
1
answer
27
Topology
How many topological sorts of the following directed graph are possible?
answered
Jan 8, 2016
in
Algorithms

258
views
topologicalsort
0
answers
28
virtual gate 2016 Disk size
A disk has 16 equidistant tracks. The diameters of the outermost and innermost tracks are 16 cm and 1 cm respectively. The innermost track has got the capacity of 20 MB. The total amount of data which can be stored on ... (integer value only). {capacity of each track is equal or outermost track has capacity greater than innermost track?? }
commented
Jan 7, 2016
in
CO & Architecture

98
views
track
co&architecture
2
answers
29
GATE20021.3
The solution to the recurrence equation $T(2^k) = 3T(2^{k1})+1, T(1) =1$ is $2^k$ $\frac{(3^{k+1}1)}{2}$ $3^{\log_2 k}$ $2^{\log_3 k}$
answered
Jan 7, 2016
in
Algorithms

733
views
gate2002
algorithms
recurrence
normal
1
answer
30
Problem on Round Robin scheduling with scheduling overhead given
answered
Jan 6, 2016
in
Operating System

167
views
operatingsystem
processschedule
3
answers
31
Data Link Layer
Compute the fraction of the bandwidth that is wasted on overhead (headers and retransmissions) for protocol 6 on a heavily loaded 50 kbps satellite channel with data frames consisting of 40 header and 3960 data bits. Assume that the signal ... for data frames is 1% and the error rate for NAK frames is negligible. The sequence numbers are 8 bits.
commented
Jan 6, 2016
in
Computer Networks

443
views
computernetworks
2
answers
32
Pipeline
give proper explanation. confusing. Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, ... this program, the time (in ns) needed to complete the program is : 1. 165 2. 190 3. 215 4.328
answered
Jan 6, 2016
in
CO & Architecture

253
views
1
answer
33
number of states of minimal nfa accepting strings of length n
commented
Jan 6, 2016
in
Theory of Computation

447
views
1
answer
34
can we find out minimum numbers of states in DFA if NFA has n states
commented
Jan 6, 2016
in
Theory of Computation

409
views
1
answer
35
TIFR2016B15
Let $G$ be an undirected graph. For a pair $(x, y)$ of distinct vertices of $G$, let $\mathsf{mincut}(x, y)$ be the least number of edges that should be delted from $G$ so that the resulting graph has no $xy$ path. Let $a, b, ... are possible but neither ii nor iii ii and iv are possible but neither i not iii iii and iv are possible but neither i nor ii
answered
Jan 6, 2016
in
Others

43
views
tifr2016
22,147
questions
28,138
answers
63,516
comments
24,290
users