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

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers by resuscitate
User resuscitate
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User resuscitate
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+4
votes
1
MadeEasy Test Series: CO & Architecture  Cache Memory
Suppose that in $250$ memory references, there are $30$ misses in first level cache and $10$ misses in second level cache. Assume that miss penalty from the L2 cache memory $50$ ... are $1.25$ memory references per instruction, then the average stall cycles per instruction is ________. answer given is $4$
answered
Jan 27, 2016
in
CO and Architecture

185
views
madeeasytestseries
coandarchitecture
cachememory
multilevelcache
+1
vote
2
Virtual Gate Test Series: Discrete Mathematics  Graph Theory (Matching Number)
Find the matching number for the given graph
answered
Jan 27, 2016
in
Graph Theory

286
views
discretemathematics
graphtheory
graphmatching
virtualgatetestseries
+5
votes
3
MadeEasy Test Series: Theory Of Computation  Finite Automata
Let L = {(aP)*⎪P is a prime number} and Σ={a}. The minimum number of states in NFA that accepts the language L are ________. i don't think it is even a regular language. then how can NFA be generated?
answered
Jan 21, 2016
in
Theory of Computation

140
views
madeeasytestseries
theoryofcomputation
finiteautomata
+2
votes
4
MadeEasy Test Series: Theory Of Computation  Regular Languages
Which of the following is a nonregular language? $L = \{wxwy \mid x,y,w \in (a+b)^+\}$ $L = \{xwyw \mid x,y,w \in (a+b)^+\}$ $L = \{wxyw \mid x,y,w \in (a+b)^+\}$ All of these
answered
Jan 21, 2016
in
Theory of Computation

929
views
madeeasytestseries
theoryofcomputation
regularlanguages
0
votes
5
Ace Test Series: Computer Networks  Bit Stuffing
Why answer is not C?
answered
Jan 20, 2016
in
Computer Networks

379
views
acetestseries
computernetworks
bitstuffing
+1
vote
6
IPv6
answered
Jan 15, 2016
in
Computer Networks

1.1k
views
ipv6
+3
votes
7
tcpmax no of segments
Let a file of 16 GB has to be transferrred from host A to host B. Assume an MSS size of 2048B. Then what is maximum number of segments that can be transferred such that TCP sequence no don't get exhausted.Assume TCP sequence field 32 bits a)2^21 b)2^23 c)2^11 d)none
answered
Jan 13, 2016
in
Computer Networks

74
views
+4
votes
8
MadeEasy Test Series: Digital Logic  Carry Generator
The number of AND gates are present inside a 5bit carry look ahead generator circuit are ______.
answered
Jan 13, 2016
in
Digital Logic

290
views
digitallogic
carrygenerator
madeeasytestseries
0
votes
9
Computer Arch.
Given a 32 bit processor with 16 MB main memory, 32 KB 4 way set associative on chip cache and block size of 16 words, The number of tag bits in memory address format are : ? Here we will take the length of instruction as 32 bits or 24 ? Why ?
answered
Jan 11, 2016
in
CO and Architecture

91
views
coandarchitecture
+9
votes
10
Size of Comparator?
answered
Jan 11, 2016
in
CO and Architecture

1.3k
views
coandarchitecture
cachememory
+10
votes
11
Conservative 2 phase locking.
Is it Conservative 2 Phase locking (C2PL) ? T1 LOCKX (A) LOCKS (B) R(A) R(B) W(A) UNLOCK (A) COMMIT UNLOCK (B)
answered
Jan 10, 2016
in
Databases

709
views
databases
transactions
+4
votes
12
Fork query what will be the effect of t3= 1 here?
answered
Jan 10, 2016
in
Operating System

290
views
fork
operatingsystem
+3
votes
13
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
answered
Jan 10, 2016
in
CO and Architecture

764
views
+4
votes
14
Consider the following ERModel
answered
Jan 8, 2016
in
Databases

357
views
erdiagram
databases
+2
votes
15
MadeEasy Test Series: Set Theory & Algebra  Relations
Given relation is reflexive or not. I think it is reflexive. and equivalence relation.
answered
Jan 7, 2016
in
Set Theory & Algebra

135
views
settheory&algebra
relations
madeeasytestseries
+1
vote
16
Virtual Gate Test Series: Algorithms  Hashing
Consider a hash table with $8$ slots with hash function: key$\%$ size of the table, using linear probing. Now you insert elements in the order $10,5,15$ in the hash table. How many collisions does occur?
answered
Jan 7, 2016
in
Algorithms

119
views
algorithms
hashing
linearprobing
virtualgatetestseries
+3
votes
17
virtual gate 2016 pipeline
There are two processor M1 and M2. M1 uses four pipeline stages with the delay of respectively stage as 6 ns, 4 ns, 7 ns, 5 ns. M2 has got 7 pipeline stages with the delay of cache stage 4 ns. Then pick the correct option for executing 200 instructions on M1 and M2. (A) M2 is faster by 600 ns (B) M2 is faster by 595 ns (C) M2 is faster by 610 ns (D) M2 is faster by 513 ns
answered
Jan 7, 2016
in
CO and Architecture

170
views
coandarchitecture
+2
votes
18
MadeEasy Test Series: Combinatory  Permutation And Combinations
5 member commities are to be formed out of 10 people. The names are written in chits of paper and put into 6 boxes. Atleast _______ chits go into the same box.
answered
Jan 7, 2016
in
Combinatory

228
views
permutationandcombination
madeeasytestseries
0
votes
19
average memory access time
Caption
answered
Jan 6, 2016
in
CO and Architecture

165
views
+6
votes
20
CO: Cache set Associative
A two way set associative cache has lines of 16 byte and a total cache size of 8 K bytes. The 256 M byte main memory is byte addressable. Which one of the following main memory block is mapped on to the set ‘0’ of the cache memory? A) (CFED09B)16 B) (FCED90C)16 C) (CFED00B)16 D) (FECD10C)16
answered
Jan 5, 2016
in
CO and Architecture

692
views
cachememory
coandarchitecture
+5
votes
21
Ethernet
if an ethernet station collide 4 time in trying to transmit a single frame how long might it be before the next attempt? a)768 microsec b)819.2 microsec c)409.6 microsec d)none
answered
Jan 5, 2016
in
Computer Networks

516
views
ethernet
+2
votes
22
Number of different possible orders for traversing to a particular node in a Binary Search Tree
answered
Jan 5, 2016
in
DS

188
views
permutationandcombination
binarytree
0
votes
23
Binary exponential backoff
if 50 stations are there and if each slot contain 25 microsec then what would be max waiting time for a station for safe transmission a)200 b)300 c)250 d)400
answered
Jan 4, 2016
in
Computer Networks

228
views
+6
votes
24
Is this language DCFL
Hi , my question is : is this language D ( w x wR ) DCFL or Non deterministic CFL ?
answered
Jan 4, 2016
in
Theory of Computation

443
views
theoryofcomputation
+1
vote
25
Fragmentation
header size not given.
answered
Jan 4, 2016
in
Computer Networks

925
views
+1
vote
26
TCP MSS
answered
Jan 4, 2016
in
Computer Networks

114
views
+1
vote
27
Slow start
my ans 65ms
answered
Jan 4, 2016
in
Computer Networks

225
views
+4
votes
28
Distance vector routing
answered
Jan 4, 2016
in
Computer Networks

933
views
computernetworks
distancevectorrouting
+1
vote
29
number of WAR dependencies
answered
Jan 3, 2016
in
CO and Architecture

1.9k
views
coandarchitecture
datadependences
+3
votes
30
Sliding window
consider sliding window algorithm with Ws =9 and Wr=7 and no out of order arrivals .what is smallest value of Max sequence number? a) 7 b)15 c)8 d )16
answered
Jan 3, 2016
in
Computer Networks

243
views
slidingwindow
+1
vote
31
Sliding Window Protocol
Assume that SWP is designed for a 1mbps point to point link to the moon which has 1 way latency(delay) of 1.25sec Assuming that each frame carry 1KB of data, find 1. number of sequence number required 2. number of bits required to represent sequence number. for 1st question i got ans 306.17, is it accepted or we have to round it as 307 plz clarify
answered
Jan 3, 2016
in
Computer Networks

210
views
+10
votes
32
BTree / possible records
answered
Jan 3, 2016
in
Databases

314
views
btree
databases
indexing
+1
vote
33
Chromatic number
What is the chromatic number of Kn  e (complete graph with an edge removed)?
answered
Jan 2, 2016
in
Set Theory & Algebra

341
views
engineeringmathematics
settheory&algebra
+2
votes
34
Cidr
answered
Jan 2, 2016
in
Computer Networks

640
views
subnetting
0
votes
35
Set Theory
answered
Jan 2, 2016
in
Set Theory & Algebra

119
views
settheory&algebra
+2
votes
36
Group theory
The set of matrices $S = \left \{ \begin{bmatrix} x&x \\ x&x \end{bmatrix}  0 \neq x \in R \right \}$ forms a group under matrix multiplication operation with identity element : a) $\begin{bmatrix} 0&1 \\ 1&0 \end{bmatrix}$ ... $\begin{bmatrix} \frac{1}{2}&\frac{1}{2} \\ \frac{1}{2}&\frac{1}{2} \end{bmatrix}$
answered
Jan 1, 2016
in
Set Theory & Algebra

1k
views
settheory&algebra
groups
+4
votes
37
How many safe sequences possible for the given processes?
answered
Jan 1, 2016
in
Operating System

427
views
operatingsystem
deadlock
0
votes
38
quadruple notation
answered
Jan 1, 2016
in
Compiler Design

372
views
compilerdesign
intermediatecode
0
votes
39
Identify LL(1) or not
answered
Jan 1, 2016
in
Compiler Design

414
views
compilerdesign
ll1
0
votes
40
Uniform distribution
answered
Dec 31, 2015
in
Databases

97
views
Page:
1
2
next »
50,645
questions
56,601
answers
195,852
comments
102,211
users