The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by target2017
User target2017
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User target2017
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
4
answers
1
GATE2017 EC Digital
commented
Feb 7, 2017
in
Digital Logic

1.4k
views
digitallogic
3
answers
2
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, 2017
in
Numerical Ability

800
views
numericalability
1
answer
3
database indexing
Consider a disk with blocksize 1024B . A block pointer 6B and recird pointer 8B . The file has 10000 employee records . Every record is fixed length of 100B . Its key is SSN which is of 2B. the file is not ordered by thr keyfield and want to construct a ... the above file if we make it into multilevel index find out thr no of total blocks required A)102 B) 100 C)119 D) 118
commented
Feb 6, 2017
in
Databases

57
views
0
answers
4
number of tuples returned by query
A) 3 B) 2 C) 1 D) 0
commented
Feb 6, 2017
in
Databases

154
views
1
answer
5
GATE 2017 EC
Q1. Three indian and three chinese split into subgroups having atleast one indian. How many subgroups are possible?
answered
Feb 6, 2017
in
Numerical Ability

3.2k
views
numericalanswers
2
answers
6
Combinations
How many number of 5 letter words that use letters from the 3 letter set {a,b,c} in which each letter occur atleast once?
answered
Feb 4, 2017
in
Mathematical Logic

619
views
permutationandcombination
2
answers
7
MadeEasy CBT 2017: Databases  Er Diagram
Please explain how they merged.(Modified)
commented
Jan 30, 2017
in
Databases

641
views
madeeasytestseries
cbt2017
databases
erdiagram
1
answer
8
Ace Test Series: Algorithms  Time Complexity
Time complexity of the given program is?
commented
Jan 30, 2017
in
Algorithms

88
views
acetestseries
algorithms
timecomplexity
2
answers
9
Ace Test Series: Operating System  Process Schedule
commented
Jan 30, 2017
in
Operating System

216
views
operatingsystem
testseries
acetestseries
roundrobin
processschedule
1
answer
10
database
commented
Jan 25, 2017
in
Databases

42
views
1
answer
11
DatabaseNormalisation
Determine the highest normal for relation R(A,B,C,D) AB →C BC→D
commented
Jan 25, 2017
in
Databases

322
views
databasenormalization
partialdependency
0
answers
12
Made Easy FLT1 Circular Queue
Doubt: dequeue really deletes the element or just moves the pointer? I'm not getting the answer.
asked
Jan 21, 2017
in
DS

252
views
datastructures
queues
circularqueue
2
answers
13
GATE201250
Consider the following relations $A, B$ and $C:$ ... $A$. $(A\cup B)\bowtie _{A.Id > 40 \vee C.Id < 15} C$ $7$ $4$ $5$ $9$
commented
Jan 21, 2017
in
Databases

7.3k
views
gate2012
databases
joins
normal
1
answer
14
Testbook
commented
Jan 18, 2017
in
Probability

102
views
2
answers
15
COMPLEMENT OF CSL
commented
Jan 17, 2017
in
Theory of Computation

221
views
0
answers
16
compiler
commented
Jan 17, 2017
in
Compiler Design

62
views
2
answers
17
2's Comlement
Find the 2's complement pattern for – 113? (1) 0001111 (2) 00001111 (3) 10001111 (4) 1110001 Correct Answer: 3 Status: unattempted
answered
Jan 17, 2017
in
Digital Logic

118
views
2
answers
18
Huffman Coding
What is the time complexity of Huffman coding using heap tree data structure ? a) O(n) b) O(n log n) c) O(log n) d) O(n2)
commented
Jan 16, 2017
in
Algorithms

810
views
huffmancode
algorithms
1
answer
19
MadeEasy Subject Test: Programming & DS  Trees
I think in last level we can't choose any 4.
answer selected
Jan 15, 2017
in
DS

153
views
madeeasytestseries
datastructures
avltree
1
answer
20
ace mock I
commented
Jan 15, 2017
in
Theory of Computation

42
views
2
answers
21
test book test
46 bit Virtual addressing system uses 3 level paging. The page table entry is 32 bits. Size of Page Table is equal to 1 page. The processor uses 1 MB, 16 way set associative cache with 64 block. What is the size of Page Table? a) 2KB b) 4KB c) 8KB d) 16KB
answered
Jan 15, 2017
in
Operating System

267
views
2
answers
22
ace mock I
answered
Jan 15, 2017
in
Programming

49
views
0
answers
23
algorithm
if dijkstra's shortest path algorithm takes 8 seconds for a graph of 1000 nodes then approx. how much time would it take for a graph of 1000000 nodes?
commented
Jan 14, 2017
in
Algorithms

45
views
0
answers
24
Which source of interrupt will have more priority Mouse or keyboard?
Suppose both mouse and keyboard issues interrupt t same time. Which source of interrupt will have more priority Mouse or keyboard? Why?
commented
Jan 13, 2017
in
CO and Architecture

164
views
coandarchitecture
3
answers
25
Time complexity of fractionak knapsack using greedy algorithm is O(n^2)??TRUE/FALSE
commented
Jan 12, 2017
in
Algorithms

4.2k
views
greedyalgorithm
algorithms
0
answers
26
Number of subnets
Finally what we have to do? Number of subnets? 2^n 2 or 2^n, where n is the number of borrowed bits ?
commented
Jan 12, 2017
in
Computer Networks

189
views
computernetworks
1
answer
27
ACE test
Qus 12. A magnitude comparator consists of inputs A[A3 A2 A1 A0] and B[B3 B2 B1 B0]. The total number of comparisons performed for A>B is ______________
commented
Jan 12, 2017
in
Digital Logic

91
views
1
answer
28
Digital Logic
commented
Jan 11, 2017
in
Digital Logic

105
views
combinational
digitalcounter
digitallogic
3
answers
29
Testbook Test Series: Programming & DS  Graphs
comment edited
Jan 11, 2017
in
Programming

137
views
testbooktestseries
testseries
datastructures
dfs
graphs
2
answers
30
doubt
answered
Jan 11, 2017
in
Digital Logic

59
views
digitallogic
1
answer
31
Huffman code
commented
Jan 10, 2017
in
Algorithms

108
views
4
answers
32
Virtual Gate Test Series: Programming & DS  Output Of The Program
What will be the output$?$ int main() { int varl = 35,*var2,*var3; var2 = &var1; //suppose the address of var1 is 1006 var3 = var2; *var2++ = *var3++; var1++; printf("var1 = %d var2 = %d var3 = %d ",var1,var2,var3); return 0; } 36 1010 1010 38 1006 1006 37 1006 1010 38 1010 1006
commented
Jan 10, 2017
in
Programming

149
views
programminginc
output
virtualgatetestseries
1
answer
33
justify the statement
" No Progress Implies Alays Deadlock " "Deadlock implies always No Progress "
commented
Jan 10, 2017
in
Operating System

150
views
operatingsystem
1
answer
34
Compare
Which of the following two is correct? If f(n) = Ο(g(n)) then h(f(n)) = Ο(h(g(n))) If f(n) ≠ Ο(g(n)) then g(n) = Ο(f(n))
commented
Jan 10, 2017
in
Algorithms

75
views
2
answers
35
Minimum states in DFA
Number of final states in minimal DFA where $\sum = \{ a,b \}$ $L = \{ w n_a(w)mod\ 3 \geq n_b(w)mod\ 2\}$
answered
Jan 10, 2017
in
Theory of Computation

352
views
theoryofcomputation
minimalstateautomata
finiteautomata
1
answer
36
Programming
commented
Jan 10, 2017
in
Programming

92
views
2
answers
37
How Q1 and Q2 are Equal ?
Please Explain How Q1 and Q2 are equal using state Minimization Technique State Equivalance Algorithm Table Filling Algorithm a b Q1 Q2 Q1 Q2 Q1 Q2
answered
Jan 9, 2017
in
Theory of Computation

157
views
theoryofcomputation
0
answers
38
Virtual Gate Test Series: Computer Networks  Round Trip Time
But I am getting 5.427 as Answer. And unfortunately that is given incorrect. Kindly Explain. Thnks.
commented
Jan 9, 2017
in
Computer Networks

118
views
computernetworks
roundtriptime
virtualgatetestseries
2
answers
39
Quick Sort
Suppose we have a O(nlogn) time algorithm that finds median of an unsorted array. Now consider a QuickSort implementation where we first find median using the above algorithm, then use median as pivot. What will be the worst case time complexity of this modified ... quick sort. Average case time complexity of modified quick sort is same as that of original quick sort. None of the above
commented
Jan 9, 2017
in
Algorithms

780
views
1
answer
40
2PL Protocol
Which of the following is true? In 2PL protocol if all exclusive lock are acquired by transactions in only increasing order of their addresses then 2PL protocol is deadlock free. In 2PL protocol if all exclusive lock are acquire by transaction in only increasing order of their addresses then 2PL protocol is starvation free. Both (a) and (b) Neither (a) nor (b)
commented
Jan 9, 2017
in
Databases

1.3k
views
databases
50,737
questions
57,324
answers
198,408
comments
105,174
users