The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
4
answers
1
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 ... to memory if the cache has a writethrough policy? $a) 0$ $b) 256$ $c) 1,024$ $d) 2,048$
commented
Sep 17, 2016
in
CO and Architecture

795
views
madeeasytestseries
coandarchitecture
cachememory
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

282
views
processscheduling
4
answers
3
GATE2016213
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 runs in $\Theta (n)$ time Insertion 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

4.6k
views
gate20162
algorithms
sorting
timecomplexity
normal
ambiguous
1
answer
4
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

251
views
calculus
maximaminima
engineeringmathematics
testseries
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

191
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

111
views
1
answer
7
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
commented
Jan 29, 2016
in
Theory of Computation

313
views
theoryofcomputation
decidability
virtualgatetestseries
1
answer
8
Consider an L1 cache with an access time of 1 ns and a hit ratio of H 0.95.
Consider an L1 cache with an access time of 1 ns and a hit ratio of H 0.95. Suppose that we can change the cache design (size of cache, cache organization) such that we increase H to 0.97, but ... so we have to search throught the cache which wiill increase the cache accees time ..and performance will decreases.....
commented
Jan 25, 2016
in
CO and Architecture

1.2k
views
cachememory
1
answer
9
Ace Test Series: Compiler Design  Lexical Analysis
commented
Jan 24, 2016
in
Compiler Design

408
views
acetestseries
compilerdesign
lexicalanalysis
tokens
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 and Architecture

80
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

139
views
digitalcounter
2
answers
12
MadeEasy Test Series: CO & Architecture  Instruction Format
The format of a double operand instruction of a CPU consist of 4 bit opcode and 4 bits for source and destination. 12 double operand instructions and 24 single operand instructions must be implemented. Opcode ... three groups of noperand instructions. Calculate the total number of zero operand instructions that can be implemented?
commented
Jan 22, 2016
in
CO and Architecture

840
views
madeeasytestseries
coandarchitecture
instructionformat
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

1.3k
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 the above statement are ... $S1,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

838
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

2.3k
views
gate2000
calculus
integration
normal
7
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 those edges that have one ... 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

3.7k
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

1.9k
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

1.6k
views
2
answers
19
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

398
views
combinatory
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

113
views
2
answers
21
How to evaluate the given series ?
2/2(2)+3/2(3)+4/2(4) +.......
answer edited
Jan 11, 2016
in
Set Theory & Algebra

102
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

121
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 then reference is ... memory 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 and Architecture

939
views
5
answers
24
General Doubt
the complement of every contextfree language is recursive ? or recursive enumerable? or both?
commented
Jan 10, 2016
in
Theory of Computation

4.9k
views
generaltopicdoubt
theoryofcomputation
closureproperty
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

90
views
2
answers
26
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 yaxis 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.8k
views
calculus
integration
1
answer
27
Topology
How many topological sorts of the following directed graph are possible?
answered
Jan 8, 2016
in
Algorithms

466
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 the disk if the ... MB (integer value only). {capacity of each track is equal or outermost track has capacity greater than innermost track?? }
commented
Jan 7, 2016
in
CO and Architecture

183
views
coandarchitecture
disks
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

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

725
views
operatingsystem
processscheduling
52,345
questions
60,522
answers
201,950
comments
95,372
users