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 Vijay Thakur
User Vijay Thakur
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Vijay Thakur
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
ISRO 2012  Mech: Matrices
rank of given matrix is a) 0 b) 1 c) 2 d) 3
answered
Mar 8
in
Linear Algebra

39
views
engineeringmathematics
isro
isromech
2
answers
2
ISRO 2008 ECE PROM
A programmable device (PROM) is (a) programmable OR and fixed AND array (b) programmable AND and fixed OR array (c) programmable AND and programmable OR array (d) none
answered
Mar 2
in
Digital Logic

26
views
isro
isroece
digitallogic
1
answer
3
gatebook mt2
A certain pipelined RISC machine has 8 generalpurpose registers R0, R1, . . . , R7 and supports the following operations. ADD Rs1, Rs2, Rd /* Add Rs1 to Rs2 and put the sum in Rd */ MUL Rs1, Rs2, Rd /* Multiply Rs1 by Rs2 and put the product in ... cycles required for an operation sequence that computes the value of AB + ABC + BC ? (A) 5 (B) 6 (C) 7 (D) 8
commented
Feb 7
in
CO & Architecture

110
views
machineinstructions
#computerorganisationandarchitecture
clockcycle
0
answers
4
GATE 2017: Maths: LA
Is manual calculation required to solve this question, or there is some properties can be applied here, btw please solve it.
commented
Feb 6
in
Linear Algebra

118
views
gate_2017
linearalgebra
engineeringmathematics
1
answer
5
Gate 2017 ME
In a company 45 people earn Rs. 20,000 per month, 25 people earn Rs. 30,000 per month, 20 people earn Rs. 40,000, 8 people earns Rs. 60,000 per month and 2 people earn Rs. 150,000 per month. Find median ?
commented
Feb 6
in
Verbal Ability

131
views
2
answers
6
GATE2017 EC Digital
answered
Feb 6
in
Digital Logic

518
views
digitallogic
1
answer
7
demand paging
answer selected
Feb 5
in
Operating System

65
views
memorymanagement
demandpaging
1
answer
8
Gate Practice Question
A binary minheap contains keys 1,2,3,4.....2047,2048 What is smallest key that can be at leaf node.??
answer edited
Feb 4
in
Algorithms

100
views
heap
2
answers
9
Memory Management
Reply with solution as soon as possible...
answered
Feb 4
in
Operating System

82
views
5
answers
10
GATE2008IT63
Consider the following three schedules of transactions T1, T2 and T3. [Notation: In the following NYO represents the action Y (R for read, W for write) performed by transaction N on object O.] (S1) 2RA 2WA 3RC 2WB 3WA 3WC 1RA 1RB 1WA ... to each other S2 is conflict equivalent to S3, but not to S1 S1 is conflict equivalent to S2, but not to S3
answer edited
Feb 4
in
Databases

644
views
gate2008it
databases
transactions
normal
1
answer
11
calculate packet transmission time
answered
Feb 4
in
Computer Networks

31
views
computernetworks
1
answer
12
MADE EASY TEST SERIES
Which of the following statement false for Btree and B+ tree index. 1> B+ tree index faster for range queries compare to B tree index. 2> If disk block allocated for B+ tree index and same size disk block allocated for B tree ... index less than equal to I/O cost of B+ tree index for random access of some key from set of distinct keys.
answered
Feb 4
in
Databases

67
views
1
answer
13
Time to build a heap
If you are given a sorted list with n elements in ascending order. Then what will be the Time complexity to build a Min heap from the given array?
commented
Feb 4
in
Algorithms

97
views
algorithms
heap
timecomplexity
1
answer
14
TOC turing machine
If in a turing machine we take away its ink so that it can not write on the input tape. Then it becomes __________ A) LBA B) DPDA C) DFA D) 2DPDA
answered
Feb 4
in
Theory of Computation

58
views
2
answers
15
Group Theory discrete maths
A={1,2,3,4,5,6} Given that set A is a group with respect to multiplication mod 7.Is A a cyclic group?If yes,identify the generators. Is there any theorem that i cana pply here to solve without building operation table?
answered
Feb 4
in
Set Theory & Algebra

118
views
discretemathematics
groups
1
answer
16
Maths: Propositional Logic
Option B says, there is some y for every x such that x > y. Hence it should be false because there is no such y.
asked
Feb 3
in
Mathematical Logic

59
views
mathematicallogic
discretemathematics
propositionallogic
firstorderlogic
1
answer
17
Maths: Linear Algebra Que01
commented
Feb 2
in
Linear Algebra

100
views
engineeringmathematics
linearalgebra
2
answers
18
Higher normal form decomposition
commented
Feb 1
in
Databases

232
views
databasenormalization
databases
decomposition
ermodel
3
answers
19
SemaphorBlocked processes
Let S be the binary semaphore variable S = 0 initially. Assume that no blocked processes exist in the system. The following signal (V), wait (P) operations are performed. The number of blocked processes at the end are _________. 4 P, 6 V, 9 P, 13 V, 14 P Answer given is 13 How? I am getting 8.
commented
Feb 1
in
Operating System

152
views
operatingsystem
3
answers
20
Ravula TestSeries DBMS
How many?
commented
Jan 29
in
Databases

127
views
ravulatestseries
databases
0
answers
21
Maths: Relations Que01
Empty set ∅ is equivalence relation? True/False
commented
Jan 28
in
Set Theory & Algebra

45
views
discretemathematics
settheory&algebra
1
answer
22
Maths: Limits Que03
given answer is (B) why continuous and differential on 0 ONLY?
commented
Jan 28
in
Calculus

85
views
engineeringmathematics
calculus
differentiability
continuity
1
answer
23
Maths: Limit Que02
lim x>0 xx y = xx logy = xlogx = $\frac{logx}{\frac{1}{x}}$ my question is when this equation not in the form of 0/0 or inf/inf then how can I apply L'Hospital's Rule??
commented
Jan 28
in
Calculus

76
views
limits
engineeringmathematics
calculus
1
answer
24
Is CFL closed under SelfConcatenation?
commented
Jan 26
in
Theory of Computation

50
views
virtualgate
theoryofcomputation
regularlanguage
cfl
4
answers
25
GATE200723
Which of the following graphs has an Eulerian circuit? Any $k$regular graph where $k$ is an even number. A complete graph on 90 vertices. The complement of a cycle on 25 vertices. None of the above
commented
Jan 26
in
Graph Theory

982
views
gate2007
graphtheory
normal
1
answer
26
Proposition
Consider the following set of propositions 1. I carry an umbrella only if it rains. 2. If I carry an umbrella I use it. 3. I get wet in rain only if I don't use umbrella. 4. It rains today. Possible Conclusion is: A. I will not get wet today. B. I will get wet today. C. I might get wet today. D. None of the above.
answer edited
Jan 26
in
Mathematical Logic

69
views
1
answer
27
Made easy
Consider we have an algorithm which generate preorder of any tree in Ο(log n) time, we have to create a Binary Search Tree with n distinct element. Which of the following will represents the worst case time complexity ? Ο(n) Ο(n log n) Ο(n2) Ο(1)
answered
Jan 25
in
Algorithms

39
views
datastructure
algorithms
binarysearchtree
1
answer
28
toc  doubt
how (i) is true???
answered
Jan 25
in
Theory of Computation

74
views
theoryofcomputation
1
answer
29
GATE20001.15
Let S be a sorted array of n integers. Let t(n) denote the time taken for the most efficient algorithm to determined if there are two elements with sum less than 1000 in S. Which of the following statement is true? t (n) is 0(1) n ≤ t(n) ≤ n log2 n n log2 n ≤ t(n) < $\frac{n}{2}$ t(n) = $\left (\frac{n}{2} \right)$
commented
Jan 25
in
Algorithms

419
views
gate2000
easy
algorithms
2
answers
30
GATE201034
The weight of a sequence $a_0,a_1, \dots, a_{n1}$ of real numbers is defined as $a_0+a_1/2+ \dots + a_{n1}/2^{n1}$. A subsequence of a sequence is obtained by deleting some elements from the sequence, keeping the order of the remaining elements the same. Let $X$ ... {n1}$. Then $X$ is equal to $max(Y, a_0+Y)$ $max(Y, a_0+Y/2)$ $max(Y, a_0 +2Y)$ $a_0+Y/2$
answer edited
Jan 24
in
Algorithms

1.3k
views
gate2010
algorithms
normal
2
answers
31
GATE 1999  Time Complexity
Match the following 1.T(n) = T(n1) +n a. O(n) 2. T(n) = T(n/2) +n b.O(nlogn) 3.T(n) = T(n/2) +nlogn c.O(n^2) 4.T(n) = T(n1) + logn d.O(log^2 n) The first one I did by substitution ... solve no 4,i tried it by substitution i got log(n!) by using stirling approx which is nlogn also,as it is a gate qs,pls someone give me detailed solution.
answered
Jan 24
in
Algorithms

270
views
algorithms
gate1999
1
answer
32
GATE20022.14
Which of the following is true? The complement of a recursive language is recursive The complement of a recursively enumerable language is recursively enumerable The complement of a recursive language is either recursive or recursively enumerable The complement of a contextfree language is contextfree
commented
Jan 22
in
Theory of Computation

292
views
gate2002
theoryofcomputation
easy
2
answers
33
GATE2013CE6
answer selected
Jan 20
in
Numerical Ability

65
views
gate2013ce
numericalability
2
answers
34
Made Easy: Digital Logic: Number of minimum terms
edited
Jan 19
in
Digital Logic

138
views
digitallogic
combinational
circuits
kmap
madeeasytestseries
1
answer
35
DAA: Time Complexity: Master Theorem
edited
Jan 19
in
Algorithms

102
views
timecomplexity
algorithms
1
answer
36
Digital: KMAP
Given a KMAP of a 10variable Boolean Function and a particular prime implicant on the KMap contains 64 minterms. How many literals are there in the product term corresponding to that prime implicant??
edited
Jan 19
in
Digital Logic

114
views
digitallogic
kmap
1
answer
37
Digital: Circuit
Any easy way to solve this question, when i am expending it, it keeps on increasing.. 1. A+B+C 2. A(B+C) 3. B(C+A) 4. C(A+B)
edited
Jan 19
in
Digital Logic

77
views
digitallogic
kmap
combinational
2
answers
38
Compiler: Viable Prefixes
Consider the following grammaer: S>0S1  01 How many of the following are the viable prefixes of the grammar? i. 01 ii. 001 iii. 00011 iv. 00S1 PS: given answer i, ii and iv , please explain!
edited
Jan 19
in
Compiler Design

197
views
compilerdesign
parsing
viableprefix
2
answers
39
Apti: Mixture Que01
In a mixture, Initially the ratio of milk and water is 7:5. Now 9 litre is removed from the mixture. how many litre of water we should add into the mixture so that ratio of milk and water becomes 7:9??
edited
Jan 19
in
Verbal Ability

74
views
aptitude
mixture
2
answers
40
Aptitude: Train Speed
Two trains Train1 and Train2 from Howrah to Patna, and Patna to Howrah leave at the same time from their respective station. They meet somewhere on the way. After their meeting point, Train1 takes 9 hours to reach Patna and Train2 takes 12hours to reach Howrah. Find the speed ratio of Train1 and Train2?
edited
Jan 19
in
Verbal Ability

77
views
aptitude
speeddistance
21,519
questions
26,847
answers
61,164
comments
23,187
users