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 stblue
User stblue
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User stblue
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+2
votes
1
Number of Essential prime implicants
answered
Oct 15
in
Digital Logic

51
views
digitallogic
primeimplicants
kmap
minimization
+1
vote
2
set associative
Computer has 256KB 8 way set associative cache memory.The number of tag bits in its physical address format is 6 bits then size of the physical memory is __________mega bye
answered
Oct 14
in
CO & Architecture

37
views
0
votes
3
Modified Binary Search
Suppose the first step in binary search algorithm is changed to M = (9L+R)/10, we know that the complexity of binary search is log(n). What will be the complexity of modified search? a) log(n) b) n c) n$\log 9/10(n)$ d) 2nlog(n)
answered
Oct 10
in
DS

302
views
modifiedbinarysearch
binarysearch
+1
vote
4
Complement
State True or False 1. 128 can be represented in 1's complement 8 bit number 2. 128 can be represented in 2's complement 8 bit number
answered
Oct 9
in
CO & Architecture

17
views
co&architecture
+2
votes
5
made easy test series
answered
Oct 2
in
Operating System

74
views
operatingsystem
+1
vote
6
Ace test series database
answered
Oct 2
in
Databases

94
views
bcnfdecomposition
acetestseries
databases
+2
votes
7
GATE 2005 #CACHE #PAGE REPLACEMENT
answered
Oct 2
in
Operating System

35
views
#os
#gate
gate2005
+1
vote
8
Depth first Search
What should be the answer?? Key is given as opttion B. . !! I was getting D) None
answered
Sep 30
in
Programming

121
views
+1
vote
9
madeeasytestseries operatingsystem
answered
Sep 30
in
Operating System

81
views
madeeasytestseries
operatingsystem
+1
vote
10
madeeasytestseries operatingsystem
answered
Sep 30
in
Operating System

53
views
madeeasytestseries
operatingsystem
+3
votes
11
Parsing_LR(1)Items
answered
Sep 29
in
Compiler Design

40
views
parsing
0
votes
12
Gate 2008
answered
Sep 29
in
Programming

40
views
0
votes
13
gate overflow
A DMA module is transferring bytes to memory using cycle stealing mode from a device transmitting at 16 KB/s. The processor is fetching instructions at the rate of 1 MB/s. The percentage by which the processor will be slowed down due to the DMA activity is ______
answered
Sep 29
in
CO & Architecture

14
views
0
votes
14
gateoverflow test
QConsider the following two types of Cache Designs : Cache 1 : It is a directmapped cache with eight 1word cache lines. The miss penalty is 8 clock cycles. Cache 2 : It is a twoway associative cache with 1word cache lines. It can ... C. Cache 1 spends 56 cycles and Cache 2 spends 60 cycles D. Cache 1 spends 56 cycles and Cache 2 spends 70 cycles
answered
Sep 29
in
CO & Architecture

15
views
+2
votes
15
UGCNETjune200711
The following loop in ‘C’: int i=0; While(i++<0)i; (A) will terminate (B) will go into an infinite loop (C) will give compilation error (D) will never be executed
answered
Sep 28
in
Programming

58
views
programminginc
+2
votes
16
testseries
L,L3 is which type of language ?are L3,L CFL ?????
answered
Sep 28
in
Theory of Computation

34
views
+4
votes
17
madeeasytestseries theoryofcomputation
answered
Sep 28
in
Theory of Computation

71
views
madeeasytestseries
theoryofcomputation
0
votes
18
UGCNETjune2008ii14
Function overloading is a concept in which: (A) a function is used to implement lots of tasks at the same time. (B) a function is called too many number of times by another function. (C) a function provides common ... carry out possibly different functions in each call. (D) a function is computationally too expensive for the system to handle.
answered
Sep 27
in
Programming

30
views
ugcnetjune2008ii
0
votes
19
Size of Tag directory
Consider a machine with 4way set associative data cache of size 32 Kbytes and block size 8 byte. The cache is managed using 32 bit virtual addressed and page size is 5 Kbytes. What is the total size of the tags in the cache directory is _________ (in K bits). Given answer is 76 I am getting 19.
answered
Sep 27
in
CO & Architecture

32
views
co&architecture
cachememory
memoryinterfacing
+2
votes
20
Semaphores
s = 0 initially A : down(s) B : down(s) CS CS up(s) up(s) C : down(s) D : up(s) CS CS up(s) down(s) E : up(s) F : up(s) CS CS down(s) down(s) What is the maximum value of s? Doubt : I think max value of s should be 1 as P and V are atomic operations. Also nowhere the value of s is stored in memory here. But the answer given is 3. What concept am I missing?
answered
Sep 27
in
Operating System

41
views
operatingsystem
semaphores
0
votes
21
UGCNETdec2008ii32
Suppose R is a relation schema and F is a set of functional dependencies on R. Further, suppose R1 and R2 form a decomposition of R. Then the decomposition is a lossless join decomposition of R provided that: (A) R1∩R2→R1 is in F+ ... C) both R1∩R2→R1 and R1∩R2→R2 functional dependencies are in F+ (D) at least one from R1∩R2→R1 and R1∩R2→R2 is in F+
answered
Sep 26
in
Databases

29
views
ugcnetdec2008ii
0
votes
22
digital logic
answered
Sep 26
in
Digital Logic

28
views
0
votes
23
digital logic
F = w'xz + w'yz + x'yz' + wxy'z d = wyz The minimum no of nand and nor gate required to implement the above function respectively are :
answered
Sep 26
in
Digital Logic

42
views
+2
votes
24
testseries
answered
Sep 26
in
Databases

37
views
0
votes
25
UGCNETdec2008ii14
The characteristic equation of D flipflop is: (A) Q=1 (B) Q=0 (C) Q=D’ (D) Q=D
answered
Sep 25
in
Digital Logic

30
views
ugcnetdec2008ii
0
votes
26
UGCNETdec2008ii2
The graph K3,4 has: (A) 3 edges (B) 4 edges (C) 7 edges (D) 12 edges
answered
Sep 25
in
Graph Theory

26
views
ugcnetdec2008ii
0
votes
27
UGCNETdec2008ii12
A relation R in {1,2,3,4,5,6} is given by {(1,2),(2,3),(3,4),(4,4),(4,5)}. This relation is: (A) reflexive (B) symmetric (C) transitive (D) not reflexive, not symmetric and not transitive
answered
Sep 25
in
Set Theory & Algebra

30
views
ugcnetdec2008ii
0
votes
28
UGCNETdec2008ii13
The dual of the switching function x+yz is: (A) x+yz (B) x’+y’z’ (C) x(y+z) (D) x’(y’+z’)
answered
Sep 25
in
Digital Logic

36
views
ugcnetdec2008ii
0
votes
29
Digital(Boolean Algebra)
The maximum number of boolean expressions that can be formed for the function f(x,y,z) satisfying the relation f(x',y,z')=f(x,y,z) is _____________
answered
Sep 25
in
Digital Logic

34
views
digitallogic
0
votes
30
Aptitude: Profit and Loss: Arun Sharma
answered
Sep 24
in
Numerical Ability

69
views
numericalability
profitloss
+1
vote
31
#bit stuffing
answered
Sep 24
in
Computer Networks

25
views
+1
vote
32
finite automata
Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. For examples, 001110 and 011001 are in the language, but 100010 is not. All strings of length less than 3 are also in the language. A partially completed DFA that accepts this language is shown below. The missing arcs in the DFA are
answered
Sep 24
in
Theory of Computation

20
views
0
votes
33
Doubt in counter
Somebody please explain me about free running and self starting counter?
answered
Sep 24
in
Digital Logic

29
views
digitallogic
digitalcounter
+1
vote
34
NFA state
If all states of an NFA are accepting states then the language accepted by the NFA is $\sum$* true or false
answered
Sep 24
in
Theory of Computation

32
views
0
votes
35
UGC Net 2016 August
Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, _____ number of page faults occur with the reference string. 0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1 (1) 11 (2) 12 (3) 10 (4) 9
answered
Aug 29
in
Operating System

113
views
netexam
+1
vote
36
Computer Networks
A 20 Kbps Satellite link has a propagation delay of 400 ms. The transmitter employs the "go back n ARQ" scheme with n set to 10. Assuming that each frame is 100 bytes long, what is the maximum data rate possible ? a) 5 Kbps b)10 Kbps c) 15 Kbps d) 20 Kbps Do explain your Answer.
answered
Aug 26
in
Computer Networks

134
views
sliding
slidingwindow
computernetworks
+2
votes
37
Regular expressions
(a (ba)* (a + bb) + b (ab)* (b + aa)) (a+b)* = (a+b)* (aa+bb) (a+b)*. how???
answered
Aug 25
in
Theory of Computation

67
views
theoryofcomputation
regularexpressions
+1
vote
38
anyone who can solve this i know how to solve but i have a doubt ?
answered
Aug 21
in
Mathematical Logic

91
views
0
votes
39
Context free languages and Regular Languages
answered
Aug 20
in
Theory of Computation

29
views
theory
theoryofcomputation
contextfreelanguage
+1
vote
40
#TOC what will be the R.E of this DFA?
answered
Aug 20
in
Theory of Computation

127
views
finiteautomata
regularexpressions
Page:
1
2
next »
27,422
questions
35,273
answers
84,587
comments
33,511
users