Answers by Vikram Bhat - GATE Overflow

0 votes

1

What will be the minimum value within a given range? GATEFORUM_MOCKS
Which of the following is the right Procedure to get the minimum for f(x)? Procedure 1: This is a closed interval, so we will have to calculate the value including and between [0,π/2]. To get critical ... we supposed to substitute each value in f(x) from options to check which gives the minimum? Which Procedure is right?

answered Jan 31, 2016 in Calculus | 237 views

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 | 172 views

+6 votes

3

Virtual Gate Test Series: Theory Of Computation - Decidable Language
$L$ is surely decidable if (A) both $L$ and its complement are not recognizable (B) $L \subseteq \{0\}^*$ (C) $L \leq_m \{0^n1^n\;\mid\;n\geq0\}$ (D) $L^R$ is decidable

answered Jan 27, 2016 in Theory of Computation | 283 views

+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 | 92 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 | 98 views

+1 vote

6

MadeEasy Test Series: CO & Architecture - Cache Memory
Array A contains 256 elements of 4 bytes each. Its first element is stored at physical address 4,096. Array B contains 512 elements of 4 bytes each. Its first element is stored at physical address 8,192. Assume that only arrays A and B can be cached ... be written to memory if the cache has a write-through policy? a) 0 b) 256 c) 1,024 d) 2,048

answered Jan 22, 2016 in CO and Architecture | 700 views

+3 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 at-least every 40 seconds ________ (upto 2 decimal place).

answered Jan 21, 2016 in Operating System | 261 views

+1 vote

8

MadeEasy Test Series: CO & Architecture - Instruction Format
The format of a double operand instruction of a CPU consist of 4 bit op-code and 4 bits for source and destination. 12 double operand instructions and 24 single operand instructions must be implemented. Op-code ... three groups of n-operand instructions. Calculate the total number of zero operand instructions that can be implemented?

answered Jan 21, 2016 in CO and Architecture | 742 views

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 | 1.4k views

+1 vote

10

How many 4 digit integers are there with digit 6 appearing exactly once
How many 4 digit integers are there with digit 6 appearing exactly once . 6_ _ _ 9 *8*7 _ 6 _ _ 9* 8 * 7 _ _ 6 _ 9*9*7 _ _ _ 6 9*9*8 I'm getting as 2223 . Is my approach correct . In book I'm getting a different ans .

answered Jan 11, 2016 in Combinatory | 340 views

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 | 86 views

0 votes

12

How to evaluate the given series ?
2/2(2)+3/2(3)+4/2(4) +.......

answered Jan 11, 2016 in Set Theory & Algebra | 91 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 | 109 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 | 75 views

0 votes

15

Volume generated by parabola about line [Gate 94]
The volume generated by revolving the area bounded by parabola y^2 = 8x and the line x = 2 about y-axis is.... A) 128π/5 B) 5/128π C) 127/5π D) None EDIT: Following is the area we have to revolve. And answer is given as (A). And kindly explain the methodology to solve such volumetric qstns if you get the answer. Thanx in advance :)

answered Jan 9, 2016 in Calculus | 1.1k views

+3 votes

16

Topology
How many topological sorts of the following directed graph are possible?

answered Jan 8, 2016 in Algorithms | 443 views

+4 votes

17

GATE2002-1.3
The solution to the recurrence equation $T(2^k) = 3T(2^{k-1})+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 | 3.3k views

+3 votes

18

Problem on Round Robin scheduling with scheduling overhead given

answered Jan 6, 2016 in Operating System | 629 views

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, FO, EI and WO are ... execution of 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 and Architecture | 517 views

0 votes

20

TIFR2016-B-15
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 $x-y$ path. Let $a, b, c$ be three ... iv i and iv 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 | 198 views

50,647 questions

56,479 answers

195,421 comments

100,557 users