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.
Recent activity by Gabbar
User Gabbar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Gabbar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
4
answers
1
GATE199212b
Let the page reference and the working set window be $c\ c\ d\ b\ c\ e\ c\ e\ a\ d\ $ and $4$, respectively. The initial working set at time $t=0$ contains the pages $\{a,d,e\}$, where $a$ was referenced at time ... $t=2$. Determine the total number of page faults and he average number of page frames used by computing the working set at each reference.
commented
Feb 7
in
Operating System

410
views
gate1992
operatingsystem
memorymanagement
normal
2
answers
2
GATE2008IT38
Assume that EA = (X)+ is the effective address equal to the contents of location X, with X incremented by one word length after the effective address is calculated; EA = −(X) is the effective address equal to the contents of location X, with X decremented by one word length before ... to the stack. ADD (X)−, (X) ADD (X), (X)− ADD −(X), (X)+ ADD −(X), (X)
commented
Feb 7
in
CO & Architecture

764
views
gate2008it
co&architecture
machineinstructions
normal
2
answers
3
GATE1996_23
A file system with a onelevel directory structure is implemented on a disk with disk block size of $4K$ bytes. The disk is used as follows: Diskblock 0 File Allocation Table, consisting of one 8bit entry per data block, representing the ... 3 Datablock 2; etc. What is the maximum possible number of files? What is the maximum possible file size in blocks
answer edited
Feb 7
in
Operating System

792
views
gate1996
operatingsystem
disk
normal
filesystem
2
answers
4
GATE2017 EC Digital
commented
Feb 7
in
Digital Logic

511
views
digitallogic
1
answer
5
GATE2005IT81b
A disk has 8 equidistant tracks. The diameters of the innermost and outermost tracks are 1 cm and 8 cm respectively. The innermost track has a storage capacity of 10 MB. If the disk has 20 sectors per track and is currently at the end of the 5th ... read 1 MB contiguous data starting from the sector 4 of the outermost track? 13.5 ms 10 ms 9.5 ms 20 ms
answer selected
Feb 7
in
Operating System

824
views
gate2005it
operatingsystem
disk
normal
0
answers
6
number of tuples returned by query
commented
Feb 5
in
Databases

82
views
9
answers
7
GATE 2016119
Consider the following code segment. x = u  t; y = x * v; x = y + w; y = t  z; y = x * y; The minimum number of total variables required to convert the above code segment to static single assignment form is __________.
commented
Feb 5
in
Compiler Design

3.2k
views
gate20161
compilerdesign
staticsingleassignment
normal
numericalanswers
2
answers
8
GATE200880
The subsetsum problem is defined as follows. Given a set of n positive integers, $S = \{ a_1, a_2, a_3, \dots , a_n \}$, and positive integer $W$, is there a subset of $S$ whose elements sum to $W$? A dynamic program for solving this problem uses a 2dimensional Boolean array, $X$ ... X[i1, j] \wedge X[i, ja_i]$ $X[i, j] = X[i1, j] \wedge X[i1, ja_i]$
commented
Feb 2
in
Algorithms

681
views
gate2008
algorithms
normal
4
answers
9
GATE200369
The following are the starting and ending times of activities A, B, C, D, E, F, G and H respectively in chronological order: $ a_s \: b_s \: c_s \: a_e \: d_s \: c_e \: e_s \: f_s \: b_e \: d_e \: g_s \: e_e \: f_e ... in a room only if the room is reserved for the activity for its entire duration. What is the minimum number of rooms required? 3 4 5 6
commented
Feb 2
in
Algorithms

458
views
gate2003
algorithms
normal
1
answer
10
GATE2014341
Consider the pseudocode given below. The function $DoSomething()$ takes as argument a pointer to the root of an arbitrary tree represented by the $leftMostChildrightSibling$ representation. Each node of the tree is of type $treeNode$. typedef struct ... the tree. number of nodes without a right sibling in the tree. number of leaf nodes in the tree
commented
Feb 2
in
Algorithms

1.3k
views
gate20143
algorithms
trees
identifyfunction
normal
2
answers
11
GATE200322
The unusual $\Theta(n^2)$ implementation of Insertion Sort to sort an array uses linear search to identify the position where and element is to be inserted into the already sorted part of the array. If, instead, we use binary search to identify the position, the worst ... Theta(n^2)$ become $\Theta(n (\log n)^2)$ become $\Theta(n \log n)$ become $\Theta(n)$
commented
Feb 1
in
Algorithms

830
views
gate2003
algorithms
sorting
timecomplexity
normal
2
answers
12
TIFR2014B11
Consider the following recurrence relation: $T\left(n\right)= \begin{cases} T\left(\frac{n}{k}\right)+ T\left(\frac{3n}{4}\right)+ n & \text{if } n \geq 2 \\ 1& \text{if } n=1 \end{cases}$ Which of the following statements is FALSE? $T(n)$ is $O(n^{3/ ... is $O(n \log n)$ when $k=4$. $T(n)$ is $O(n \log n)$ when $k=5$. $T(n)$ is $O(n)$ when $k=5$.
commented
Feb 1
in
Algorithms

432
views
tifr2014
algorithms
recurrence
2
answers
13
TIFR2015B2
Consider the following undirected connected graph $G$ with weights on its edges as given in the figure below. A minimum spanning tree is a spanning tree of least weight and a maximum spanning tree is one with largest weight. A second ... tree here. There is unique minimum spanning tree, however there is more than one secondbest minimum spanning tree here.
answer edited
Feb 1
in
Algorithms

206
views
tifr2015
minimumspanningtrees
5
answers
14
GATE2006IT46
Which of the following is the correct decomposition of the directed graph given below into its strongly connected components? {P, Q, R, S}, {T}, {U}, {V} {P,Q, R, S, T, V}, {U} {P, Q, S, T, V}, {R}, {U} {P, Q, R, S, T, U, V}
answer edited
Jan 30
in
Algorithms

667
views
gate2006it
algorithms
graphalgorithms
connectedcomponents
normal
1
answer
15
Testbook CN question
A 2kmlong, 10Mbps CSMA/CD LAN (not 802.3) has a propagation speed of 200 m/microsec. Repeaters are not allowed in this system. Data frames are 512 bits long, including 32 bits of header, checksum, and ... The effective data rate is _____________________ Mbps (correct to 2 decimal places), excluding overhead, assuming that there are no collisions?
commented
Jan 26
in
Computer Networks

168
views
testbook
computernetworks
csmacd
effectivedatarate
2
answers
16
GATE2014344
The memory access time is 1 nanosecond for a read operation with a hit in cache, 5 nanoseconds for a read operation with a miss in cache, 2 nanoseconds for a write operation with a hit in cache and 10 nanoseconds for a write ... cache hitratio is 0.9. The average memory access time (in nanoseconds) in executing the sequence of instructions is ______.
commented
Jan 26
in
CO & Architecture

1.6k
views
gate20143
co&architecture
cachememory
numericalanswers
normal
2
answers
17
UGCNETDEC2016III30
A node X on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. Token bucket is initially filled with 16 megabits. The maximum duration taken by X to transmit at full rate of 10 Mbps is ______ secs. 1 2 3 4
commented
Jan 25
in
Others

61
views
ugcnetdec2016iii
3
answers
18
GATE2011_12
Consider a relational table with a single record for each registered student with the following attributes: $\text {Registration_Num:}$ Unique registration number for each registered student $\text {UID:}$ Unique identity number, unique at the national level for each ... $S \cap \text{UID}$ is $\text{NULL}$ then $S \cup \text{UID}$ is also a superkey
commented
Jan 25
in
Databases

529
views
gate2011
databases
normal
1
answer
19
Virtual Gate (Network)
Consider data frames consisting of 20 header and 1980 data bits. Assume headers and retransmissions are overhead, ACK frames are negligible and NAK frames are 20 bits. The error rate for data frames is 2 percent and the error rate for NAK frames is ... Compute the fraction of the bandwidth that is wasted on overhead. (A) 2% (B) 98% (C) 97% (D) 3%
answered
Jan 25
in
Computer Networks

34
views
virtualgate
computernetworks
virtualgate
1
answer
20
UGCNETJune2016II35
Which of the following is false? The grammar $S \rightarrow a \: Sb \mid bSa \mid SS \mid \in$, where $S$ is the only nonterminal symbol and $\in$ is the null string, is ambiguous SLR is powerful than LALR An LL(1) parser is a topdown parser YACC tool is an LALR(1) parser generator
answer selected
Jan 25
in
Others

72
views
ugcnetjune2016ii
1
answer
21
CO Cache Memory Access
In a certain system the main memory access time is 100 ns. The cache is 10 time faster than the main memory and uses the write though protocol. If the hit ratio for read request is 0.92 and 85% of the memory requests generated by the ... the average time consideration both read and write requests is a) 28.95ns b) 348.47ns c) 29.62ns d) 296.2ns
answer selected
Jan 25
in
CO & Architecture

81
views
cachememory
co&architecture
#computerorganisationandarchitecture
2
answers
22
GATE2013_15
An index is clustered, if (A) it is on a set of fields that form a candidate key. (B) it is on a set of fields that include the primary key. (C) the data records of the file are organized in the same order as the data entries of the index. (D) the data records of the file are organized not in the same order as the data entries of the index.
answer selected
Jan 23
in
Databases

857
views
gate2013
databases
indexing
normal
0
answers
23
Testbook
# plz explain??? i am not understand question??
commented
Jan 22
in
Algorithms

54
views
testbook
testseries
2
answers
24
GATE200831
$P$ and $Q$ are two propositions. Which of the following logical expressions are equivalent? $P ∨ \neg Q$ $\neg(\neg P ∧ Q)$ $(P ∧ Q) ∨ (P ∧ \neg Q) ∨ (\neg P ∧ \neg Q)$ $(P ∧ Q) ∨ (P ∧ \neg Q) ∨ (\neg P ∧ Q)$ Only I and II Only I, II and III Only I, II and IV All of I, II, III and IV
answer selected
Jan 22
in
Mathematical Logic

391
views
gate2008
normal
mathematicallogic
1
answer
25
doubt
Q Min no. of state required by DFA to accept the string (a+b)* a(a+b)(a+b)
commented
Jan 19
in
Theory of Computation

59
views
theoryofcomputation
3
answers
26
GATE2005IT32
An unbiased coin is tossed repeatedly until the outcome of two successive tosses is the same. Assuming that the trials are independent, the expected number of tosses is 3 4 5 6
comment edited
Jan 18
in
Probability

1.2k
views
gate2005it
probability
binomialdistribution
expectation
normal
3
answers
27
GATE200824
Let $P =\sum_{\substack{1≤i≤2k \\ i\;odd}} i$ and $Q = \sum_{\substack{1≤i≤2k \\ i\;even}} i$, where $k$ is a positive integer. Then $P = Q  k$ $P = Q + k$ $P = Q$ $P = Q + 2k$
answer selected
Jan 18
in
Combinatory

329
views
gate2008
combinatory
easy
4
answers
28
GATE2008IT24
The exponent of 11 in the prime factorization of 300! is 27 28 29 30
answered
Jan 18
in
Combinatory

662
views
gate2008it
combinatory
normal
1
answer
29
GATE199116,a
Find the number of binary strings $w$ of length $2n$ with an equal number of $1's$ and $0's$ and the property that every prefix of $w$ has at least as many $0's$ as $1's.$
answer selected
Jan 18
in
Combinatory

322
views
gate1991
combinatory
normal
1
answer
30
Pipelining
You are given a nonpipelined processor design which has a cycle time of 10ns and average CPI(cycle per instruction) of 1.4.The designers pipelined it into 5 stages with stage timing of 1ns,1.5ns,4ns,3ns,0.5ns, Each pipelined stage ... for 1 cycle and 5% of time for 2 cycles(these occurrences are disjoint).what is speedup compared to the original processor?
commented
Jan 18
in
CO & Architecture

192
views
1
answer
31
Btree Insertion
An order 3 Btree is an index tree where every node other than root has at most 2 keys and at least one key. Starting with an empty tree if following keys are inserted into the tree 1,2,3,4,5,6,7,8,9,10. (not necessarily in the given order.) What would be the minimum number of node splits possible, if node splitting algorithm is used?
answered
Jan 18
in
Databases

55
views
dbms
btree
0
answers
32
Made Easy  Mock test 1
commented
Jan 18
in
Operating System

86
views
madeeasy_testseries
processsynchronization
semaphore
3
answers
33
Maths: Probability Que011
(i) Three identical dice are rolled. the probability that the same number will appear on each of them is___ A. 1/6 B.1/36 C.1/18 D.3/28 (iI) Three Distinct dice are rolled. the probability that the same number will appear on each of them is___
answer selected
Jan 18
in
Probability

369
views
engineeringmathematics
probability
1
answer
34
multilevel paging
can some one provide me procedure to solve this que?
commented
Jan 17
in
Operating System

108
views
2
answers
35
digital logic
answered
Jan 17
in
Digital Logic

63
views
digitallogic
1
answer
36
maximum weight of minimum spanning tree??
comment moved
Jan 16
in
Algorithms

145
views
algorithms
minimumspanningtrees
0
answers
37
Discrete Maths # Counting
How many ways we can distribut 12 similar items into 5 different boxes so that first two box will contain only even number of items and next three must contain more than 2 and less than 6 items ??
commented
Jan 16
in
Mathematical Logic

61
views
1
answer
38
#digital#counter
I have read somewhere that JK flipflop used as divide by 2 frequency counter is it true ?? if not how to solve given problem??
comment edited
Jan 16
in
Digital Logic

78
views
0
answers
39
Discrete Maths
I have solved it by some legacy method ! i want to know how to solve using combinatorics ??
commented
Jan 15
in
Mathematical Logic

56
views
1
answer
40
Discrete Maths
How many one to one functions are possible from A to B where A =4 and B = 6 such that ith element of A can not match with ith element of B.??
commented
Jan 15
in
Set Theory & Algebra

126
views
21,471
questions
26,802
answers
61,041
comments
23,037
users