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 manu00x
User manu00x
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User manu00x
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+3
votes
1
Master theorem details?
There are different versions of master theorem available. I want to know whether the version given in Cormen book is sufficient for GATE?
answered
2 days
ago
in
Algorithms

213
views
algorithms
mastertheorem
0
votes
2
GATE200367
Let G = (V,E) be an undirected graph with a subgraph $G_1 = (V_1, E_1)$. Weights are assigned to edges of G as follows. $$w(e) = \begin{cases} 0 \text{ if } e \in E_1 \\1 \text{ otherwise} \end{cases}$$ A singlesource ... The number of edges in the shortest paths from $v_1$ to all vertices of G $G_1$ is connected $V_1$ forms a clique in G $G_1$ is a tree
answered
2 days
ago
in
Algorithms

1.3k
views
gate2003
algorithms
graphalgorithms
normal
0
votes
3
Is the following language DCFL?
answered
2 days
ago
in
Theory of Computation

37
views
theoryofcomputation
contextfreelanguage
dcfl
+3
votes
4
ternary relationship
Consider the following ER diagram: If A has 100 entities, B has 1000 entities, and C has 10 entities, what is the maximum number of triples of entities that could be in the relationship set for R?
answered
4 days
ago
in
Databases

250
views
ternary
relationship
+1
vote
5
Coreman: Relative Asymptotic growths
answered
5 days
ago
in
Algorithms

36
views
algorithms
asymptoticnotations
timecomplexity
0
votes
6
CN ARQ Protocol
True / False? Selective repeat ARQ requires more number of bits in sequence number as compared to Go Back n ARQ.
answered
5 days
ago
in
Computer Networks

30
views
computernetworks
gobackn
slidingwindow
+1
vote
7
parsing
what is the difference between Handle and Viable prefix??
answered
5 days
ago
in
Compiler Design

31
views
+2
votes
8
Database
Why b/b+ tree used for DB index rather than AVL tree?
answered
6 days
ago
in
Databases

16
views
0
votes
9
Please Solve this Recurrence Relation
answered
6 days
ago
in
Algorithms

19
views
algorithms
timecomplexity
0
votes
10
Forouzan 5th edition ch01 Q112
answered
6 days
ago
in
Computer Networks

21
views
computernetworks
0
votes
11
foruozan 5th edition chapter1 Q113
answered
6 days
ago
in
Computer Networks

26
views
computernetworks
0
votes
12
forouzan 5th edition chapter2 Q23
answered
6 days
ago
in
Computer Networks

50
views
computernetworks
0
votes
13
Find out the throughput of pipelining
answered
6 days
ago
in
CO & Architecture

51
views
pipelining
co&architecture
throughput
0
votes
14
pipelining
answered
6 days
ago
in
CO & Architecture

39
views
+2
votes
15
tannenbaum
Can someone plz explain this highlighted text ? I took it from Tannenbaum. thank you :)
answered
6 days
ago
in
Computer Networks

20
views
#tannenbaum
+1
vote
16
GATE2004IT51
The storage area of a disk has innermost diameter of 10 cm and outermost diameter of 20 cm. The maximum storage density of the disk is 1400bits/cm. The disk rotates at a speed of 4200 RPM. The main memory of a computer has 64bit ... used for data transfer from the disk, the percentage of memory cycles stolen for transferring one word is 0.5% 1% 5% 10%
answered
6 days
ago
in
Operating System

1.4k
views
gate2004it
operatingsystem
disks
normal
0
votes
17
GATE200570
Consider a disk drive with the following specifications: 16 surfaces, 512 tracks/surface, 512 sectors/track, 1 KB/sector, rotation speed 3000 rpm. The disk is operated in cycle stealing mode whereby whenever one 4 byte word is ready it is sent ... time is 40 nsec. The maximum percentage of time that the CPU gets blocked during DMA operation is: 10 25 40 50
answered
Aug 13
in
Operating System

3.5k
views
gate2005
operatingsystem
disks
normal
dma
+1
vote
18
cache
Consider a two level memory hierarchy L1 (cache) has an accessing time of 20 nsec and main memory has accessing time 40 nsec. Writing or updating contents into their memory takes 40 nsec and 50 nsec for L1 and main memory respectively. Assume ... misses 65% of the total time. The average writing time for system (in nsec) if it uses writethrough technique _____.
answered
Aug 13
in
CO & Architecture

28
views
+1
vote
19
SPU Scheduling
What is the correct sequence of the functions Scheduling, dispatching, and context switching.
answered
Aug 13
in
Operating System

27
views
operatingsystem
cpuscheduling
processschedule
0
votes
20
Does anybody have pdf of Schaum's Outline of Operating System?
answered
Aug 12
in
Operating System

39
views
operatingsystem
pdf
+1
vote
21
Basic Optimal page replacement policy doubt.
answered
Aug 11
in
Operating System

21
views
operatingsystem
pagereplacement
optimal
0
votes
22
Set Relation
Answer please explain the ans. R is antisymmetric then aRb, bRa > a=b so ab=0 and 0 is not odd positive then how it is antisymmetric?
answered
Aug 11
in
Set Theory & Algebra

28
views
engineeringmathematics
settheory&algebra
equivalencerelation
partialorder
antisymmetric
0
votes
23
half adder
If only half adder used for addition then the number of half adders required to add two 'm' bit numbers is; A) 2m1 B) 2m1 C) 2m+1 D)2m
answered
Aug 11
in
Digital Logic

31
views
+1
vote
24
How many stacks are formed
F(){ F1(){ F2(){ F3(){ } } } } Here for each function a new stack is used or single stack is used for all the functions As per me Single stack could be enough Can some one please clarify me
answered
Aug 11
in
DS

25
views
0
votes
25
How much time will the processor be slowed down due to DMA activity?
answered
Aug 11
in
CO & Architecture

1.3k
views
0
votes
26
GATE200468
A hard disk with a transfer rate of 10 Mbytes/second is constantly transferring data to memory using DMA. The processor runs at 600 MHz, and takes 300 and 900 clock cycles to initiate and complete DMA transfer respectively. If the size of the ... 20 Kbytes, what is the percentage of processor time consumed for the transfer operation? 5.0% 1.0% 0.5% 0.1%
answered
Aug 11
in
Operating System

1.9k
views
gate2004
operatingsystem
disks
normal
co&architecture
+1
vote
27
TOC Doubt
Write the Regular Expression in which two a's should not come together? Please tell how to write this R.E in a step by step way, thanks!
answered
Aug 10
in
Theory of Computation

65
views
theoryofcomputation
finiteautomata
0
votes
28
Binary search
How to get space complexity of binary search .. I am getting confusion in Space complexity = ip + extra (stack) And ip = nB ( why it is nB) ????? And extra = logn B So nB+ log n B = O(n) ...
answered
Aug 10
in
Algorithms

49
views
algorithms
binarysearch
+2
votes
29
Discrete mathematics example 13 Kenneth rosen
answered
Aug 9
in
Mathematical Logic

52
views
+1
vote
30
#CacheMemory
Can someone explain me: 1) Why we use Multiplexer in Set Associative mapping and not in other mapping techniques ? 2) How to decide that how many and of what size MUX will require on the basis of Tag bits and Set Offset ? 3) How to decide that what should be the size of comparator ? Please ,Explain with Example...
answered
Aug 9
in
CO & Architecture

20
views
0
votes
31
TOC Not RE language Set
Why set of Not RE languages is uncountable infinite ?Not RE is discrete in nature?
answered
Aug 8
in
Theory of Computation

56
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
0
votes
32
Turing machines decidability
Check whether the language below is recursive, recursively enumerable but not recursive, or not recursively enumerable? {⟨M1,M2⟩∣ M1 and M2 are two TMs, and ϵ∈L(M1)∖L(M2)}.
answered
Aug 8
in
Theory of Computation

40
views
theoryofcomputation
turingmachine
decidability
0
votes
33
TOC Turing machines Decidability
answered
Aug 8
in
Theory of Computation

33
views
theoryofcomputation
turingmachine
decidability
0
votes
34
synchronous data transfer
A synchronous transmission T has transfer rate of 100 char/ sec. If T uses some synchronous characters followed by some 8 bit info characters, what is the total number of synchronous bits required where bit rate is 1000 bits/ sec?
answered
Aug 7
in
CO & Architecture

16
views
synchronousdata
transfer
+2
votes
35
Average access time
Consider two level memory systems in which the average access time is 150 ns without level L1 . The level 1 access time is 20 ns . The average access time with L1 is 40 ns. The hit ration of L1 in percengage........ Plz help me to find the correct answer.. I got 88%
answered
Aug 7
in
CO & Architecture

32
views
hitratio
0
votes
36
overflow
how to detect overflow when subtracting two 2's complement number?
answered
Aug 7
in
CO & Architecture

26
views
+2
votes
37
speedup
suppose that execution time for a program is proportional to instruction fetch time ,assume that fetching an instruction from the cache takes 1 time unit ,but fetching it from main memory takes 10 time units.Also,assume that a requested ... fetched from main memory into the cache and then etched from the cache to be exexuted.Compute the speedup ratio?
answered
Aug 7
in
CO & Architecture

18
views
Page:
1
2
3
4
next »
24,935
questions
32,040
answers
74,447
comments
30,127
users