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 Saurabh Sharma
User Saurabh Sharma
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Saurabh Sharma
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
GATE201416
Let the function $$f(\theta) = \begin{vmatrix} \sin\theta & \cos\theta & \tan\theta \\ \sin(\frac{\pi}{6}) & \cos(\frac{\pi}{6}) & \tan(\frac{\pi}{6}) & \\ \sin(\frac{\pi}{3}) & \cos(\frac{\pi}{3}) & \tan(\ ... $\theta \in (\frac{\pi}{6},\frac{\pi}{3})$ such that $f'(\theta)\neq 0$ I only II only Both I and II Neither I Nor II
commented
Aug 21, 2016
in
Calculus

1.1k
views
gate20141
calculus
differentiability
normal
4
answers
2
GATE201348
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment. ... preserving correctness. What is the minimum number of spills to memory in the compiled code? 0 1 2 3
commented
Feb 24, 2016
in
Compiler Design

2k
views
outofsyllabusnow
gate2013
normal
compilerdesign
targetcodegeneration
codeoptimization
2
answers
3
GATE2014318
Which of the following statements are CORRECT? Static allocation of all data areas by a compiler makes it impossible to implement recursion. Automatic garbage collection is essential to implement recursion. Dynamic allocation of activation records is essential to ... essential to implement recursion. 1 and 2 only 2 and 3 only 3 and 4 only 1 and 3 only
commented
Jan 2, 2016
in
Compiler Design

774
views
gate20143
compilerdesign
recursion
normal
3
answers
4
GATE200543
Let $f: B \to C$ and $g: A \to B$ be two functions and let $h = f o g$. Given that $h$ is an onto function which one of the following is TRUE? $f$ and $g$ should both be onto functions $f$ should be onto but $g$ need not to be onto $g$ should be onto but $f$ need not be onto both $f$ and $g$ need not be onto
commented
Dec 30, 2015
in
Set Theory & Algebra

545
views
gate2005
settheory&algebra
functions
normal
1
answer
5
GATE200357
Consider the grammar shown below. S $\rightarrow$ C C C $\rightarrow$ c C  d This grammar is LL(1) SLR(1) but not LL(1) LALR(1) but not SLR(1) LR(I) but not LALR(1)
commented
Dec 21, 2015
in
Compiler Design

1.6k
views
gate2003
compilerdesign
grammar
parsing
normal
3
answers
6
GATE20011.10, UGCNETDec2012III36
commented
Nov 26, 2015
in
CO & Architecture

1.2k
views
gate2001
co&architecture
normal
ugcnetdec2012iii
3
answers
7
GATE200667
Consider the relation account (customer, balance) where customer is a primary key and there are no null values. We would like to rank customers according to decreasing balance. The customer with the largest balance gets rank 1. Ties are not broke but ranks are ... using ODBC. Which two of the above statements are correct? 2 and 5 1 and 3 1 and 4 3 and 5
commented
Nov 19, 2015
in
Databases

1.7k
views
gate2006
databases
sql
normal
2
answers
8
GATE2013_29
Consider a hard disk with 16 recording surfaces (015) having 16384 cylinders (016383) and each cylinder contains 64 sectors (063). Data storage capacity in each sector is 512 bytes. Data are organized cylinderwise and the addressing format is <cylinder no ... of the file, if it is stored in a contiguous manner? (A) 1281 (B) 1282 (C) 1283 (D) 1284
commented
Nov 10, 2015
in
Operating System

2.2k
views
gate2013
operatingsystem
disk
normal
2
answers
9
GATE200354
Define languages $L_0$ and $L_1$ as follows : $L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\} $ $L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts on }w\}$ Here $\langle M, w, i \rangle$ is a ... $L'$ is not $L'$ is recursively enumerable, but $ L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable
commented
Nov 6, 2015
in
Theory of Computation

2.2k
views
theoryofcomputation
turingmachine
gate2003
difficult
2
answers
10
GATE20002.16
Let LASTPOST, LASTIN and LASTPRE denote the last vertex visited `in a postorder, inorder and preorder traversal respectively, of a complete binary tree. Which of the following is always true? LASTIN = LASTPOST LASTIN = LASTPRE LASTPRE = LASTPOST None of the above
commented
Aug 13, 2015
in
Algorithms

874
views
gate2000
algorithms
binarytree
normal
6
answers
11
GATE20151_46
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of 3, 7 and 20 ... millisecond and task preemptions are allowed, the first instance of $T_{3}$ completes its execution at the end of_____________________milliseconds.
commented
Jul 27, 2015
in
Operating System

2.5k
views
gate20151
operatingsystem
processschedule
normal
numericalanswers
1
answer
12
Give the result of partitioning the keys after the 1st pass of quicksort.
commented
Jul 22, 2015
in
Algorithms

146
views
sorting
algorithms
quicksort
4
answers
13
GATE200649
An implementation of a queue Q, using two stacks S1 and S2, is given below: void insert (Q, x) { push (S1, x); } void delete (Q) { if (stackempty(S2)) then if (stackempty(S1)) then { print( Q is empty ); return; } else while (!(stackempty(S1))){ x= ... $2m\leq y\leq 2n $ $ 2m\leq x<2n $ and $2m\leq y\leq n+m $ $ 2m\leq x<2n $ and $2m\leq y\leq 2n $
commented
Jul 21, 2015
in
DS

1.5k
views
gate2006
datastructure
queues
stack
normal
1
answer
14
Solve the recurrence
T(n) = T(n  1) + 1/n a) O(1) b) O(n) c) O(log n) d) O(log log n)
asked
Jul 20, 2015
in
Algorithms

187
views
algorithms
recurrence
1
answer
15
GATE200538
Let $G(V,E)$ be an undirected graph with positive edge weights. Dijkstra’s single source shortest path algorithm can be implemented using the binary heap data structure with time complexity: $O\left(V^2\right)$ $O\left(E+V\log V\right)$ $O\left(V\logV\right)$ $O\left(\left(E+V\right)\logV\right)$
commented
Jul 13, 2015
in
Algorithms

891
views
gate2005
algorithms
graphalgorithms
normal
6
answers
16
GATE200539
Suppose there are $\lceil \log n \rceil$ sorted lists of $\lfloor n /\log n \rfloor$ elements each. The time complexity of producing a sorted list of all these elements is: (Hint:Use a heap data structure) $O(n \log \log n)$ $\Theta(n \log n)$ $\Omega(n \log n)$ $\Omega\left(n^{3/2}\right)$
commented
Jul 13, 2015
in
Algorithms

1.6k
views
gate2005
algorithms
normal
2
answers
17
GATE1994_3.3
State True or False with one line explanation A FSM (Finite State Machine) can be designed to add two integers of any arbitrary length (arbitrary number of digits).
commented
Jul 1, 2015
in
Theory of Computation

733
views
gate1994
theoryofcomputation
finiteautomata
normal
4
answers
18
DFA to accept a binary number divisible by 2
commented
May 8, 2015
in
Theory of Computation

2.8k
views
finiteautomata
23,428
questions
30,143
answers
67,576
comments
28,472
users