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 vijaycs
User vijaycs
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User vijaycs
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
GATE200881
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 ... there is a subset whose elements sum to $W$? $X[1, W]$ $X[n, 0]$ $X[n, W]$ $X[n1, n]$
commented
Apr 18
in
Algorithms

690
views
gate2008
algorithms
normal
dynamicprogramming
3
answers
2
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
Apr 5
in
CO & Architecture

2.9k
views
gate20143
co&architecture
cachememory
numericalanswers
normal
1
answer
3
What will be the output of the following C program? If you think it will give a runtime error, you need to mention it.
commented
Apr 2
in
Programming

123
views
programminginc
1
answer
4
TIFR2017B8
For any natural number $n$, an ordering of all binary strings of length $n$ is a Gray code if it starts with $0^n$, and any successive strings in the ordering differ in exactly one bit (the first and last string must also differ by ... two strings are separated by $k$ other strings in the ordering, then they must differ in exactly $k$ bits none of the above
commented
Mar 31
in
Digital Logic

184
views
tifr2017
digitallogic
binarycodes
graycode
3
answers
5
TIFR2017A11
Let $f \: \circ \: g$ denote function composition such that $(f \circ g)(x) = f(g(x))$. Let $f: A \rightarrow B$ such that for all $g \: : \: B \rightarrow A$ and $h \: : \: B \rightarrow A$ we have $f \: \circ \: ... surjective) $f$ is onetoone (injective) $f$ is both onetoone and onto (bijective) the range of $f$ is finite the domain of $f$ is finite
commented
Mar 31
in
Set Theory & Algebra

511
views
tifr2017
settheory&algebra
functions
1
answer
6
Synchronization  SelfDoubt
1. Does starvation freedom imply bounded waiting ? 2. Does bounded waiting imply starvation freedom ? Explain with example.
commented
Mar 28
in
Operating System

287
views
processsynchronization
deadlock
2
answers
7
ISRO201160
A total of 9 units of a resource type available, and given the safe state shown below, which of the following sequence will be a safe state? Process Used Max $P_1$ 2 7 $P_2$ 1 6 $P_3$ 2 5 $P_4$ 1 4 $\langle P_4, P_1, P_3, P_2\rangle$ $\langle P_4, P_2, P_1, P_3\rangle $ $\langle P_4, P_2, P_3, P_1\rangle $ $\langle P_3, P_1, P_2, P_4 \rangle$
commented
Mar 28
in
Operating System

1.1k
views
isro2011
operatingsystem
resourceallocation
3
answers
8
GATE2017127
A multithreaded program P executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are nonreentrant, i.e., if a thread holds a lock $l$, then it cannot reacquire lock $l$ without ... 2 (B) $x$ = 2, $y$ = 1 (C) $x$ = 2, $y$ = 2 (D) $x$ = 1, $y$ = 1
commented
Mar 27
in
Operating System

2.8k
views
gate20171
operatingsystem
processsynchronization
normal
1
answer
9
made easy
commented
Mar 26
in
Programming

130
views
madeeasytestseries
datastructure
1
answer
10
complexity
Let there are n elements in array and number of sorted subarray is log n of size n/ log n each then what is the time complexity to sort given array
commented
Mar 26
in
Algorithms

69
views
4
answers
11
GATE2017242
The next state table of a 2bit saturating upcounter is given below. $\begin{array}{cccc} Q_1 & Q_0 & Q_1^+ & Q_0^+ \\ \hline \\ 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 0 \\ 1 & 0 & 1 & 1 \\ 1 & ... = \bar{Q_1} + \bar{Q_0}$ $T_1 = Q_1+Q_0, \quad T_0= \bar{Q_1} \bar{Q_0}$ $T_1 = \bar{Q_1}Q_0, \quad T_0= Q_1 + Q_0$
commented
Feb 14
in
Digital Logic

1.1k
views
gate20172
digitallogic
digitalcounter
4
answers
12
GATE2017223
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .
answer selected
Feb 14
in
Graph Theory

1.8k
views
gate20172
graphtheory
numericalanswers
degreeofgraph
7
answers
13
GATE2017238
Consider the following C function int fun(int n) { int I, j; for(i=1; i<=n; i++) { for (j=1; j<n; j+=i) { printf(ā%d %dā, I, j); } } } Time complexity of $fun$ in terms of $\theta$ notation is $\theta(n \sqrt{n})$ $\theta(n^2)$ $\theta(n \: \log n)$ $\theta(n^2 \log n)$
answer selected
Feb 14
in
Algorithms

1.5k
views
gate20172
algorithms
timecomplexity
4
answers
14
GATE2017227
If $w, x, y, z$ are Boolean variables, then which one of the following is INCORRECT? $wz+w(x+y)+x(x_y) = x+wy$ $\overline{w \bar{x}(y+\bar{z})} + \bar{w}x = \bar{w} + x + \bar{y}z$ $(w \bar{x}(y+x\bar{z}) + \bar{w} \bar{x}) y = x \bar{y}$ $(w+y)(wxy+wyz) = wxy+wyz$
answer edited
Feb 14
in
Digital Logic

1.4k
views
gate20172
digitallogic
booleanexpressions
normal
2
answers
15
GATE200761
Consider the table employee(empId, name, department, salary) and the two queries $Q_1, \, Q_2$ below. Assuming that department 5 has more than one employee, and we want to find the employees who get higher salary than anyone in the ... query $Q_2$ is the correct query Both $Q_1$ and $Q_2$ produce the same answer Neither $Q_1$ nor $Q_2$ is the correct query
commented
Feb 9
in
Databases

2.3k
views
gate2007
databases
sql
normal
verbalability
2
answers
16
the gatebook mock 2
actually i don't understand the part "what are the meant by process is in 1st frame..." i don't know why but i m a bit confuse with this qn. please help...
comment edited
Feb 7
in
CO & Architecture

308
views
1
answer
17
Divide and conquer
Reply with solution @Arjun sir,@habibkhan,@vijaycs
answer selected
Feb 7
in
Algorithms

185
views
algorithms
divideandconquer
2
answers
18
gate me 2017 paper
answer selected
Feb 7
in
Numerical Ability

265
views
0
answers
19
Vgate2
here SJF is given as well as priorities are given, given answer followes only priority scheduling but i think priority is used in case where there is a tie between two processes in SJF what is the correct approach?
commented
Feb 4
in
DS

152
views
2
answers
20
GATE200476
In an $M \times N$ matrix all nonzero entries are covered in $a$ rows and $b$ columns. Then the maximum number of nonzero entries, such that no two are on the same row or column, is $\leq a +b$ $\leq \max(a, b)$ $\leq \min(Ma, Nb)$ $\leq \min(a, b)$
commented
Jan 31
in
Linear Algebra

1k
views
gate2004
linearalgebra
normal
matrices
1
answer
21
2s complement Notation
What is the difference betwen 2s complent of a number and 2s complement representation of a number .
commented
Jan 31
in
Digital Logic

255
views
numberrepresentation
2
answers
22
UGCNETDEC2016III50
Consider a disk queue with I/O requests on the following cylinders in their arriving order: 6, 10, 12, 54, 97, 73, 128, 15, 44, 110, 34, 45 The disk head is assumed to be at cylinder 23 and moving in the direction ... cylinders. Total number of cylinders in the disk is 150. The disk head movement using SCANscheduling algorithm is: 172 173 227 228
commented
Jan 31
in
Others

759
views
ugcnetdec2016iii
2
answers
23
UGCNETDEC2016III10
For a database relation R(A,B,C,D) where the domains of A, B, C and D include only atomic values, only the following functional dependencies and those that can be inferred from them are: $A \rightarrow C$ $B \rightarrow D$ The ... normal form Second normal form but not in third normal form Both in second normal form as well as in third normal form
answer selected
Jan 31
in
Others

135
views
ugcnetdec2016iii
2
answers
24
Complexity
int loop(int n) { for(int i=1;i<=n;i++) { for(int j=1;j<n;j+=i) { O(1) } } } What is the time complexity of above code segment?
answer selected
Jan 30
in
DS

230
views
timecomplexity
algorithms
1
answer
25
Time Complexity of the given code ?
commented
Jan 29
in
Algorithms

185
views
timecomplexity
algorithms
programminginc
1
answer
26
Pipeline : ans should be 13 or 14?
commented
Jan 29
in
CO & Architecture

137
views
pipelining
0
answers
27
DBMS is it 1 or 2
S : R1(x ) R2(x ) W1(x ) W2(x); Transactions can commit any place after their last operation executed. The number of statements are correct schedule (s) __________. 1. S is conflict serializable schedule. 2. S ... serializable schedule 3. S is recoverable schedule 4. S is cascadeless Rollback, Recoverable schedule 5. S is strict recoverable schedule.
commented
Jan 28
in
Databases

38
views
databases
2
answers
28
PTE paging
consider a paging system with 48bit virtual address space.Each address defers to a byte in memory.suppose the size of page is 16KB and the main memory size is 16GB.The minimum size of page table with each entry need 2 protection bits is _____ (in GB) ... i round it to 3bytes and make answer as 48GB or shuld i keep it as it is and write the answer as 44GB?
commented
Jan 28
in
Operating System

143
views
operatingsystem
paging
2
answers
29
MadeEasy Test Series
Consider the following schedule S : r1(A) w2(A) r3(A) w4(A) r5(A) w6(A) The number of schedules equal to given schedule(s) which not conflict equal to schedule(s) are _______.
commented
Jan 28
in
Databases

250
views
databases
transactions
2
answers
30
GATE2016Session7GA4
(x % of y) + (y % of x) is equivalent to ________. 2 % of xy 2 % of (xy/100) xy % of 100 100 % of xy
answer selected
Jan 26
in
Verbal Ability

67
views
gate2016session7aptitude
numericalability
percentage
0
answers
31
MadeEasy  Synchronization
How option B would confirm  Bounded waiting.??
asked
Jan 26
in
Operating System

133
views
madeeasytestseries
processsynchronization
2
answers
32
Gatebook
Consider languages L1 and L2 over {0,1) alphabet. L2= {w/w contains some x as a substring and x belongs to L1} Which of the following must be true? I. If L1 is regular, L2 is also regular II. If L1 is CFL, L2 is also CFL III. If L1 is recursive, L2 is also recursive (A). I and II only (B). I, II, III only (C). I and III only (D). II and III only
commented
Jan 25
in
Theory of Computation

247
views
gatebook_toc
theoryofcomputation
regularlanguages
0
answers
33
MADE EASY TEST SERIES
Consider the following C program segment: struct node What is the output of above C program when it runs on a root node of a binary tree? prints nodes at K distance from root node. print nodes of Kth level of binary tree. Both (a) and (b) None of these
commented
Jan 25
in
DS

135
views
binarytree
3
answers
34
GATE BOOK
Maximum number of keys a BTree of order 5 and height 4 can have ? Note: An order P BTree can have at most P1 keys in a node. (A) 2500 (B) 3905 (C) 3124 (D) 4500
answer selected
Jan 25
in
Databases

98
views
1
answer
35
GATEBOOK
answer selected
Jan 25
in
DS

56
views
3
answers
36
GATE2016Session4GA4
The number that least fits this set: (324, 441, 97 and 64) is ________. 324 441 97 64
answer selected
Jan 25
in
Numerical Ability

207
views
gate2016session4aptitude
oddone
numericalability
2
answers
37
Time Complexity
Suppose that each row of an n x n array A consists of 1's and 0's such that in any row of A, all the 1's come before any 0's in that row. Assuming A is already in memory, what is the complexity of the most efficient algorithm for finding the row of A that contains the most 1's? A. $O(n2)$ B. $O(logn)$ C. $O(n)$ D. $O(nlogn)$
answer selected
Jan 25
in
Algorithms

196
views
timecomplexity
algorithms
asymptoticnotations
1
answer
38
Testbook live Testseries
Which of the following statements are false ? $1.$ A depthfirst search of a directed graph always produces the same number of tree edges (i.e., independent of the order in which the vertices are provided and independent of ... two vertices will not change. $4.$ Dijkstra's algorithm may not terminate if the graph contains negative weight edges.
commented
Jan 24
in
Algorithms

301
views
algorithms
testseries
1
answer
39
Gate Practice Question
int j=0; for(i=0;i<n;i++) { for(i=0;i<2n;i++) { while(j<n) { j++; } } } time complexity.? a.$O(n^{2})$ b.$O(n^{4})$ c.$O(n^{3})$ d.$O(n)$
answer selected
Jan 23
in
Algorithms

84
views
timecomplexity
asymptoticnotations
1
answer
40
No. of injective functions ( TestBook Test Series 2 )
answer selected
Jan 23
in
Set Theory & Algebra

132
views
functions
discretemathematics
27,351
questions
35,209
answers
84,265
comments
33,328
users