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 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
0
votes
1
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 ?
answered
Feb 6
in
Verbal Ability

116
views
+3
votes
2
GATE2017 EC Digital
answered
Feb 6
in
Digital Logic

462
views
digitallogic
+2
votes
3
demand paging
answered
Feb 4
in
Operating System

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

83
views
heap
+1
vote
5
Memory Management
Reply with solution as soon as possible...
answered
Feb 4
in
Operating System

67
views
+1
vote
6
calculate packet transmission time
answered
Feb 4
in
Computer Networks

26
views
computernetworks
0
votes
7
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

59
views
+1
vote
8
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

54
views
+1
vote
9
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

95
views
discretemathematics
groups
+1
vote
10
Higher normal form decomposition
answered
Feb 1
in
Databases

181
views
databasenormalization
databases
decomposition
ermodel
+3
votes
11
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.
answered
Jan 31
in
Operating System

127
views
operatingsystem
0
votes
12
Ravula TestSeries DBMS
How many?
answered
Jan 29
in
Databases

115
views
ravulatestseries
databases
+1
vote
13
Is CFL closed under SelfConcatenation?
answered
Jan 25
in
Theory of Computation

45
views
virtualgate
theoryofcomputation
regularlanguage
cfl
0
votes
14
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

30
views
datastructure
algorithms
binarysearchtree
+1
vote
15
toc  doubt
how (i) is true???
answered
Jan 25
in
Theory of Computation

62
views
theoryofcomputation
0
votes
16
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.
answered
Jan 25
in
Mathematical Logic

56
views
0
votes
17
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

254
views
algorithms
gate1999
0
votes
18
Ace test Series
answered
Jan 18
in
Theory of Computation

62
views
acetestseries
testseries
0
votes
19
ace co numerical
answered
Jan 18
in
CO & Architecture

60
views
0
votes
20
normal forms
State True/False: "A relation must have a composite key if it is in BCNF but not in 4nf".
answered
Jan 15
in
Databases

50
views
0
votes
21
geek mock 2017 #60
Which option is true about the SQL query given below? SELECT firstName, lastName FROM Employee WHERE lastName BETWEEN 'A%' AND 'D%'; A) It will display all the employees having last names starting with the alphabets 'A' till 'D' inclusive ... 'D' excluding the names starting with 'A' and 'D since between is inclusive shouldn't D also to be included
answered
Jan 15
in
Databases

115
views
geekmock2017
databases
Page:
1
2
3
4
next »
20,846
questions
26,001
answers
59,649
comments
22,098
users