The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
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
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Questions by cse23
User cse23
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User cse23
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
0
answers
1
MADE EASY..IMP
Consider a disk drive with the following specifications. 16 surfaces, 128 tracks / surfaces, 256 sectors / track, 512 B / sector, rotations speed 3600 rpm. The disk is operated in cycle stealing mode whereby whenever one byte word is ready it is sent to ... reads a 5 byte word from the memory in each DMA cycle. Memory cycle time is 50microsec percentage for which CPU is blocked??
asked
Feb 5, 2017
in
CO & Architecture

123
views
0
votes
1
answer
2
GEEKS_MOCK
asked
Feb 2, 2017
in
Numerical Ability

43
views
0
votes
0
answers
3
GEEKS_MOCK
Find the maximum value of the expression (x+y+k) where (x,y) satisfies the equation (x2)2 + (y3)2 = 25 A (5+k) + 5√2 B 5+k C 5 + √k D 2+k
asked
Feb 2, 2017
in
Numerical Ability

54
views
0
votes
0
answers
4
GEEKS_MOCK
The value of the following Integral is:
asked
Feb 2, 2017
in
Numerical Ability

47
views
0
votes
1
answer
5
GEEKS_MOCK
Suppose there are two teams A and B. Both of them are competing with each other on a racing track of 1 km. But team A has got the advantage of starting the race from 280 m from the starting point. If the ratio of speed of A to B is 3:4. Select the correct option from the ... given below: A Team A will win by 20m B Team B will win by 20m C Team A will win by 40m D Team B will win by 40m
asked
Feb 2, 2017
in
Numerical Ability

115
views
+1
vote
2
answers
6
virtual gate
How many minimum bits are required to represent 16 in 2's complement form
asked
Jan 31, 2017
in
Digital Logic

104
views
virtualgate
0
votes
0
answers
7
DIRECTION QUESTION
X IS 1KM NORTHEAST OF Y. Y IS 1KM SOUTHEAST OF Z. W IS 1KM WEST OF Z. P IS 1KM SOUTH OF W. Q IS 1KM EAST OF P. WHAT IS DISTANCE BETWEEN X AND Q IN KM?? A. 1 B. SQUARE ROOT(2) C. SQUAREROOT(3) D. 2 i AM GETTING C as answer...please verify
asked
Jan 31, 2017
in
Numerical Ability

345
views
0
votes
1
answer
8
self doubt
We know Relational algebra(RA) and Relational calculas(RC) are equivalent in power...Can we say power of SQL and relational algebra are same?? I think no because we have some aggegate function, order by etch which is not done by relational algebra but all the RA operations can be done in SQL so can say SQL has highest power than RA/RC????
asked
Jan 31, 2017
in
Databases

56
views
0
votes
1
answer
9
COA_plz answer
A certain processor takes 10 ns on a cache hit and 500 μs on a cache miss to read on instruction. 10% of the time the read request is found in the cache. What is the average access time ? a. 400.01 μs b. 450.01 μs c. 510.01 μs d. None of these i think none of these with simultaneous access but answer given is b ..
asked
Jan 29, 2017
in
CO & Architecture

43
views
0
votes
1
answer
10
MADE EASY_COMPILER
Which of the following is correct? a. One of the purposes of using intermediate code in compilers is to improve the register allocation. b. Leaf node of the tree always have only inherited atrribute. c. The difference between assembly code generation ... used by both of them to hold the intermediate results. d. The output of intermediate code generation is machine dependent.
asked
Jan 28, 2017
in
Compiler Design

149
views
0
votes
1
answer
11
COMPILERS_DESIGN
Consider the following grammar: E>E+T  T T>T*F  F F>(E)  id A string (id + id ∗ id) is parsed using above grammar. Which of the following statement is correct with respect to above parsing? a. “E+F ∗” is a viable prefix b. “E+F ∗” is a handle c. “T ∗ F” is a viable prefix d. “T ∗ F” is not a handle
asked
Jan 28, 2017
in
Compiler Design

123
views
+1
vote
1
answer
12
GATE_BOOK Q
A privileged instruction may be executed only while the hardware is in kernel mode. Which of the following is LEAST likely to be a privileged instruction? (A) An instruction that changes the value of the program counter (B) An instruction that sends output to a printer (C) An instruction that halts the CPU (D) An instruction that resets the computer’s timeofday clock
asked
Jan 28, 2017
in
CO & Architecture

240
views
+1
vote
1
answer
13
DS ..Linked List
In double linked list organization, insertion and deletion of a record involves maximum modification of number of pointers respectively a. Four, Two b. Two, Two c. Four, Four d. Two, Four
asked
Jan 26, 2017
in
Programming

62
views
+3
votes
0
answers
14
quick sort..plz tell the algo also
Which of the following cannot be the intermediate sequence if we apply quick sort on 9,8,7,6,5,4,3,2,1? Assume the pivot is always the first element A) 1,8,7,6,5,4,3,2,9 B) 1,2,3,6,5,4,7,8,9 C) 1,2,7,6,5,4,3,8,9 D) 1,2,3,5,4,6,7,8,9
asked
Jan 25, 2017
in
Algorithms

168
views
0
votes
1
answer
15
circular linked list_doubt
Given a head pointer what is the time complexity: 1. To insert the element at front 2.To delete the element at front 3.To insert the element at end 4.To delete the element at front 5.To insert the element at the middle To delete the element at the middle
asked
Jan 24, 2017
in
Programming

190
views
0
votes
1
answer
16
Maths
A=[1 2 3 1 5 1 3 2 1] The eigen value of matrix A are equal to roots of a cubic equation x3 + bx2 + cx + d = 0, the value of b – c + d = __________.
asked
Jan 23, 2017
in
Mathematical Logic

50
views
0
votes
1
answer
17
Made easy
int CALL(int K) { if(K<3) return 1; else CALL(K1) + CALL(K3) +1; } value returned by CALL(CALL(5))is.............
asked
Jan 21, 2017
in
Programming

38
views
0
votes
1
answer
18
Graph_Theory
A graph has a degree sequence <1,1,2,2,3,3,3,3> the number of edges in the graph? a) 18 b)9 c)36 d)8
asked
Jan 20, 2017
in
Graph Theory

95
views
0
votes
1
answer
19
no. of edges
A graph G has k isolated vertices and n + k vertices. The maximum number of edges graph G can have? a) n(n1) b)n(n1)/2) c) n(nk+1)/2 d) n(n+k1)/2
asked
Jan 20, 2017
in
Graph Theory

147
views
0
votes
1
answer
20
Graphs
A sequence d = is graphic if there is a simple nondirected graph with degree sequence d then which one of the following sequences is graphic? a) (2, 3, 3, 4, 4, 5) b) (1, 3, 3, 3) c) (2, 3, 3, 4, 5, 6, 7) d) (2, 3, 3, 3, 3)
asked
Jan 20, 2017
in
Graph Theory

169
views
+1
vote
1
answer
21
Graph
1. Suppose that G is a nondirected graph with 12 edges. Suppose that G has 6 vertices of degree 3 and the rest have degrees less than 3. The minimum number of vertices G can have? a) 2 b) 0 c)1 d)3 I am getting 3..plz verify
asked
Jan 20, 2017
in
Graph Theory

566
views
0
votes
1
answer
22
GRAPH_degree seq
Is there any simple graph with degree sequence <1,1,1,1,2,2,3,3,3,3>
asked
Jan 20, 2017
in
Graph Theory

48
views
0
votes
1
answer
23
self_doubt plz answer
can we say languages which are not R.E as undecidable but partially decidable?? example: sigma={0,1] and L={<M> M is a TM that accepts a string of length 2014 } a/c to rice theoram it should be non R.E (Tyes is subset of Tno)but answer is ... L= {<M>  L is regular?} etc I know all are undecidable but how they are partially decidable if they are not even R.E
asked
Jan 19, 2017
in
Theory of Computation

58
views
+1
vote
1
answer
24
COA_RAW DEPENDENCY
Assume that ADD x, y, z; denotes x ← y + z, SUB x, y, z; x ← y – z and MUL x, y, z; denotes x ← y ∗ z. Consider the following assembly code. I1: SUB R1,R2,R3 I2:ADD R2,R1 R3 I3:ADD R3 R1 R2 I4:SUB R1 R2 R2 Find the number of RAW dependencies in the above assembly code. a. 2 b. 5 c. 3 d. 6
asked
Jan 18, 2017
in
CO & Architecture

88
views
–1
vote
0
answers
25
Doubt
Cylinder a disk queue with requests for I/OI/O to blocks on cylinders 47,38,121,191,87,11,92,10.47,38,121,191,87,11,92,10. The CSCAN scheduling algorithm is used. The head is initially at cylinder number 6363, moving towards larger ... pass. The cylinders are numbered from 00 to 199199. The total head movement (in number of cylinders) incurred while servicing these requests is__________.
asked
Jan 18, 2017
in
Operating System

51
views
0
votes
1
answer
26
MADE EASY COA
consider a cache memory which is 30 times faster than the main memory and uses 90% of the total time. what is the speedup gain by the cache memory
asked
Jan 17, 2017
in
CO & Architecture

197
views
0
votes
1
answer
27
self doubt
we know jhonson counter does mod(2N) counting and ring does mod(N) counting with N no. of FF's then can some one tell about ripple counter.....is it mod(2^N)???
asked
Jan 16, 2017
in
Digital Logic

52
views
0
votes
1
answer
28
Made Easy
Given relation R(A, B, C, D, E) and set of functional dependencies F = {AB → C, AB → D, D → A, BC → D, BC → E} What will be the highest normal form satisfied by R ? a. 1 NF b. 2 NF c. 3 NF d. BCNF
asked
Jan 14, 2017
in
Databases

71
views
+3
votes
1
answer
29
Made Easy
Consider the following relation: R (A1, A,2, ....., An) and Every (n – 2) attributes of R forms Candidate key. Which of the following represents the number of super keys are there in R ? a. nCn–2 * 22 b. nCn–2 + n + 1 c. nCn–2 * [3] d. nCn–2
asked
Jan 14, 2017
in
Databases

80
views
0
votes
0
answers
30
self_doubt
Type of Acknowledgment used by: 1.Go back N(is it only cumulative or both independent and cumulative)? 2.SR(only independent) 3.TCP(both) Please verify
asked
Jan 5, 2017
in
Computer Networks

126
views
Page:
1
2
3
4
next »
46,762
questions
51,218
answers
176,457
comments
66,579
users