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
Chat
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.
Questions by srestha
User srestha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User srestha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
0
answers
1
How to approach?
A spider is at the bottom of a cliff, and is n inches from the top. Every step it takes brings it one inch closer to the top with probability 1/3, and one inch away from the top with probability 2/3, unless it is at the bottom in which case ... reach the top as a function of n? a)Never reach to the top b)Linear to n c)Polynomial to n d)Exponential to n
asked
Apr 12
in
Combinatory

71
views
engineeringmathematics
+1
vote
1
answer
2
C Programming(interview)
Write an algorithm of the given problem Given a chess board of order NxM and source points (s1,s2) and destination points (d1,d2), Your task to find min number of moves required by the Knight to go to the destination cell.
asked
Mar 23
in
Programming

136
views
programminginc
cprogramming
+1
vote
2
answers
3
C Programming (interview)
WAP where smallest subarrays with sum greater than x? Say an array={1,5,6,2,45,17}; Now, x=60 Now we have to find smallest subarray which is greater than x
asked
Mar 23
in
Programming

127
views
programminginc
output
cprogramming
0
votes
0
answers
4
IITM interview
Lets say we have a 32bit instruction using immediate addressing mode, where the opcode is say 22bits, and u have to store a 32bit operand inside the remaining 10bits of the instruction. How would u do it?
asked
Mar 15
in
CO & Architecture

204
views
interview
iitminterview
0
votes
1
answer
5
Program (ritchie)
Write a program to determine the ranges of char, short, int, and long variables, both signed and unsigned, by printing appropriate values from standard headers and by direct computation. Harder if you compute them: determine the ranges of the various floatingpoint types.
asked
Mar 15
in
Programming

48
views
programminginc
+5
votes
4
answers
6
GATE2017153
Consider the following C program. #include<stdio.h> #include<string.h> void printlength(char *s, char *t) { unsigned int c=0; int len = ((strlen(s)  strlen(t)) > c) ? strlen(s) : strlen(t); printf("%d\n" ... defined in string.h as returning a value of type size_t, which is an unsigned int. The output of the program is __________ .
asked
Feb 14
in
Programming

1.7k
views
gate20171
programming
programminginc
numericalanswers
signedunsignedcomparison
normal
+4
votes
2
answers
7
GATE2017155
The output of executing the following C program is _______________ . #include<stdio.h> int total(int v) { static int count = 0; while(v) { count += v&1; v >>= 1; } return count; } void main() { static int x=0; int i=5; for(; i>0; i) { x = x + total(i); } printf("%d\n", x); }
asked
Feb 14
in
Programming

1k
views
gate20171
programming
programminginc
normal
numericalanswers
+3
votes
1
answer
8
DS......
Consider a data type whose elements are integers and whose operations are INSERT, DELETE, and FINDCLOSEST, with FINDCLOSEST(y) deﬁned to be some element x in the current set such thatxy ≤ xiy for all xi in the current set. Let where denotes the ... use in order to minimizeT? (A) A sorted list (B) An unordered list (C) An implicit heap (D) An AVL tree
asked
Feb 7
in
DS

589
views
datastructure
0
votes
0
answers
9
Semaphore
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
asked
Feb 5
in
Operating System

62
views
semaphore
operatingsystem
+1
vote
1
answer
10
Number of Different Minimal Cover
asked
Feb 5
in
Databases

84
views
dbms
minimalcover
0
votes
1
answer
11
Output
What will be output?
asked
Feb 4
in
DS

72
views
datastructure
+1
vote
1
answer
12
Pipeline
The following sequence of instruction is executed in a basic 5 stage pipelined processor (S1, S2, S3, S4, S5). Assume that data dependency present in the program is resolved by operand forwarding techniques. Load instruction output present in 4th ... ,R_{4}$ What is the number of instructions must be inserted to achieve CPI = 1 by using operand forwarding.
asked
Feb 4
in
CO & Architecture

157
views
co&architecture
pipeline
operandforwarding
+2
votes
1
answer
13
number of schedules conflict equivalent schedule
asked
Feb 3
in
Databases

163
views
databases
+1
vote
0
answers
14
Dirac Theorem
If d(V) ≥ n/2 for each vertex V in G, then G is hamiltonian. [d(V) is the degree of a vertex V] True/False explain:
asked
Feb 2
in
Graph Theory

46
views
0
votes
1
answer
15
Numerical
Consider a bitstring of length 10 containing only 0 and 1. The number of string contain 3 consicutive 0’s or 3 consicutive 1’s are ________
asked
Feb 2
in
Numerical Ability

46
views
+1
vote
2
answers
16
Mathematics
In how many different ways 10 identical ball can be distributed among 3 children, if each receives atleast 2 balls and no more than 4 balls?
asked
Feb 2
in
Combinatory

317
views
testseries
+1
vote
1
answer
17
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?
asked
Jan 30
in
DS

104
views
timecomplexity
algorithms
+1
vote
1
answer
18
Complexity of modified quick sort
asked
Jan 30
in
DS

65
views
algorithms
timecomplexity
+1
vote
1
answer
19
RE or Non RE
1) Language describing the ambiguity of CFG is RE or Non RE? 2) Language describing the nonambiguity of a CFG (whether a given CFG is nonambiguous) and complement of the language of ambiguity of CFG are RE or Non RE? 3) Inherent Ambiguity of CFL is RE or Non RE? 4) Is language of the complement of Ambiguity and the language of nonambiguity of CFG same?
asked
Jan 30
in
Theory of Computation

112
views
theoryofcomputation
recursiverecursivelyenumerable
+1
vote
1
answer
20
Pipeline : ans should be 13 or 14?
asked
Jan 29
in
CO & Architecture

106
views
pipeline
+2
votes
0
answers
21
is the expaination correct?
is the explaination of given question correct? Explanation: Result of inner query is non empty because even no record satisfy where condition of inner query count(*) produces 1 record. So, every record of R where condition true My question: how count getting 1 record?
asked
Jan 28
in
Databases

56
views
dbms
0
votes
1
answer
22
CPI.......
Is CPI of non pipeline processor 6, means non pipeline processor has 6 stages?  ... average CPI of 6. System is enhanced to a 8 stage pipelined processor. The clock rate is reduced to 2 GHz in the new processor. Speedup of a pipelined processor is _________.
asked
Jan 28
in
CO & Architecture

72
views
pipeline
co&architecture
0
votes
0
answers
23
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.
asked
Jan 28
in
Databases

33
views
databases
0
votes
0
answers
24
PDA..
Plz describe your ans too
asked
Jan 28
in
Theory of Computation

34
views
pushdownautomata
+2
votes
1
answer
25
Reducable
Consider the language L : L={<M>  M is a Turing Machine and $L(M)\leq_{p}$$\left \{ 0^{p}.1^{2p}p> 0 \right \}$} where $\leq_{p}$ refers to polynomial time reducable. Which of the following TRUE ? a) $L$ is undecidable b) $L$ is decidable c) $L$ is regular d) None of these
asked
Jan 24
in
Theory of Computation

62
views
theoryofcomputation
+1
vote
1
answer
26
Countable and Reducable
Consider the following statements: $S_{1}$ : For any two sets A and B, if A is uncountably infinite and B is countably infinite, then $A\cap B$ is countably infinite. $S_{2}$ : For any two language A and B, if $A\subseteq B$, then $A$ is reducable to $B$. The number of incorrect statement are _________________________
asked
Jan 24
in
Theory of Computation

69
views
theoryofcomputation
0
votes
1
answer
27
TOCNULL Production
TRUE / FALSE All ∈productions can be removed from any context free grammar.
asked
Jan 21
in
Theory of Computation

51
views
theoryofcomputation
+1
vote
1
answer
28
Serializability
Consider the following schedule S : r1(A) w2(A) commit2, w1(A) w3(A) commit3, commit1 Which of the following is true? a) Schedule is view serializable schedule and strict recoverable schedule b) Schedule ... Schedule is non serializable schedule and not strict recoverable schedule d)Schedule is serializable schedule and not strict recoverable schedule
asked
Jan 18
in
Databases

148
views
databases
view_serializable
0
votes
1
answer
29
No of Candidate key
Given relation R(A, B, C, D, E) and set of functional dependencies F = {AB → C, AB → D, D → A, BC → D, BC → E} Number of candidate key in the following relation have?
asked
Jan 18
in
Databases

95
views
databases
candidatekeys
+3
votes
1
answer
30
MST..
Let G(V, E) be an undirected graph with positive edge weights. What is the worst case time complexity to find minimum spanning tree using Kruskal algorithm is implemented using array data structure ? a) O(E+V log V) b) O(V log V) c) O(V2) d) O(V log2V)
asked
Jan 16
in
Algorithms

68
views
mst
algorithms
Page:
1
2
3
4
5
6
next »
22,147
questions
28,138
answers
63,516
comments
24,290
users