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 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
0
votes
1
What will be the minimum value within a given range? GATEFORUM_MOCKS
answered
Jan 31, 2016
in
Calculus

147
views
calculus
maximaminima
engineeringmathematics
testseries
0
votes
2
Finding maximum size of file
Given answer: 128 Please explain how to solve this problem
answered
Jan 29, 2016
in
Operating System

94
views
operatingsystem
memorymanagement
+4
votes
3
VIRTUALGATE II Q.29 L is surely decidable if 
answered
Jan 27, 2016
in
Theory of Computation

149
views
virtualgate
decidability
theoryofcomputation
+1
vote
4
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
answered
Jan 24, 2016
in
Algorithms

61
views
0
votes
5
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
+1
vote
6
ME_Test_Series  CO : Cache Memory
answered
Jan 22, 2016
in
CO & Architecture

260
views
madeeasytestseries
testseries
co&architecture
+2
votes
7
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).
answered
Jan 21, 2016
in
Operating System

114
views
processschedule
+1
vote
8
madeeasytest COA Adv : Practice Test  27 q11
answered
Jan 21, 2016
in
CO & Architecture

197
views
co&architecture
madeeasytestseries
testseries
0
votes
9
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

394
views
gateec2014
expectation
+1
vote
10
How many 4 digit integers are there with digit 6 appearing exactly once
answered
Jan 11, 2016
in
Combinatory

105
views
permutationsandcombinations
0
votes
11
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

68
views
0
votes
12
How to evaluate the given series ?
answered
Jan 11, 2016
in
Set Theory & Algebra

64
views
+1
vote
13
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

67
views
0
votes
14
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

65
views
0
votes
15
Volume generated by parabola about line [Gate 94]
answered
Jan 9, 2016
in
Calculus

170
views
calculus
integration
parabola
+3
votes
16
Topology
How many topological sorts of the following directed graph are possible?
answered
Jan 8, 2016
in
Algorithms

280
views
topologicalsort
0
votes
17
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

798
views
gate2002
algorithms
recurrence
normal
+2
votes
18
Problem on Round Robin scheduling with scheduling overhead given
answered
Jan 6, 2016
in
Operating System

189
views
operatingsystem
processschedule
0
votes
19
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

277
views
0
votes
20
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

52
views
tifr2016
23,428
questions
30,143
answers
67,576
comments
28,472
users