Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Dhananjay
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Dhananjay
28
votes
1
GATE CSE 2014 Set 1 | Question: 47
A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true? There exists a $y$ in the interval $(0,1)$ such that $f(y) = f(y+1)$ For every $y$ ... the function in the interval $(0,2)$ is $1$ There exists a $y$ in the interval $(0,1)$ such that $f(y)$ = $-f(2-y)$
answered
in
Calculus
Jan 28, 2015
16.1k
views
gatecse-2014-set1
calculus
continuity
normal
6
votes
2
GATE CSE 2000 | Question: 2.4
A polynomial $p(x)$ satisfies the following: $p(1) = p(3) = p(5) = 1$ $p(2) = p(4) = -1$ The minimum degree of such a polynomial is $1$ $2$ $3$ $4$
answered
in
Set Theory & Algebra
Jan 24, 2015
5.6k
views
gatecse-2000
set-theory&algebra
normal
polynomials
2
votes
3
GATE CSE 2014 Set 2 | Question: GA-10
At what time between $6$ a. m. and $7$ a. m. will the minute hand and hour hand of a clock make an angle closest to $60^{\circ}$? $6: 22$ a.m. $6: 27$ a.m. $6: 38$ a.m. $6: 45$ a.m.
answered
in
Quantitative Aptitude
Jan 23, 2015
8.2k
views
gatecse-2014-set2
quantitative-aptitude
normal
clock-time
1
vote
4
GATE CSE 2014 Set 3 | Question: 6
If $\int \limits_0^{2 \pi} |x \: \sin x| dx=k\pi$, then the value of $k$ is equal to ______.
answered
in
Calculus
Jan 22, 2015
8.6k
views
gatecse-2014-set3
calculus
integration
limits
numerical-answers
easy
34
votes
5
GATE IT 2004 | Question: 5
What is the maximum number of edges in an acyclic undirected graph with $n$ vertices? $n-1$ $n$ $n+1$ $2n-1$
answered
in
Graph Theory
Jan 20, 2015
5.5k
views
gateit-2004
graph-theory
graph-connectivity
normal
3
votes
6
GATE CSE 2014 Set 1 | Question: 6
Let the function ... $\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
answered
in
Calculus
Jan 19, 2015
10.2k
views
gatecse-2014-set1
calculus
differentiation
normal
41
votes
7
GATE CSE 2013 | Question: 7
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of $n$ nodes? $O(1)$ $O(\log n)$ $O(n)$ $O(n \log n)$
answered
in
DS
Jan 18, 2015
9.4k
views
gatecse-2013
data-structures
easy
binary-search-tree
25
votes
8
GATE CSE 2011 | Question: 34
A deck of $5$ cards (each carrying a distinct number from $1$ to $5$) is shuffled thoroughly. Two cards are then removed one at a time from the deck. What is the probability that the two cards are selected with the number on the first card being one higher than the number ... $\left(\dfrac{4}{25}\right)$ $\left(\dfrac{1}{4}\right)$ $\left(\dfrac{2}{5}\right)$
answered
in
Probability
Jan 18, 2015
14.0k
views
gatecse-2011
probability
normal
14
votes
9
GATE CSE 1998 | Question: 2.2
Consider the following determinant $\Delta = \begin{vmatrix} 1 & a & bc \\ 1 & b & ca \\ 1 & c & ab \end{vmatrix}$ Which of the following is a factor of $\Delta$? $a+b$ $a-b$ $a+b+c$ $abc$
answered
in
Linear Algebra
Jan 18, 2015
5.4k
views
gate1998
linear-algebra
matrix
normal
17
votes
10
GATE IT 2008 | Question: 44
When $n = 2^{2k}$ for some $k \geqslant 0$, the recurrence relation $T(n) = √(2) T(n/2) + √n$, $T(1) = 1$ evaluates to : $√(n) (\log n + 1)$ $√(n) \log n$ $√(n) \log √(n)$ $n \log √n$
answered
in
Algorithms
Jan 7, 2015
13.1k
views
gateit-2008
algorithms
recurrence-relation
normal
10
votes
11
GATE CSE 2006 | Question: 85
The grammar $S\rightarrow AC\mid CB$ $C\rightarrow aCb\mid \epsilon$ $A\rightarrow aA\mid a$ $B\rightarrow Bb\mid b$ generates the language $ L=\left \{ a^{i}b^{j}\mid i\neq j \right \}$. In this grammar what is the length of the derivation (number of steps starting from $S$) to generate ... $l\neq m$ $\max (l,m) + 2$ $l + m + 2$ $l + m + 3$ $\max (l,m) + 3$
answered
in
Compiler Design
Jan 7, 2015
5.4k
views
gatecse-2006
compiler-design
grammar
normal
15
votes
12
GATE CSE 2006 | Question: 84
Which one of the following grammars generates the language $ L=\left \{ a^{i}b^{j}\mid i\neq j \right \}$? $S\rightarrow AC\mid CB$ $C\rightarrow aCb\mid a\mid b$ $A\rightarrow aA\mid \varepsilon$ $B\rightarrow Bb\mid \varepsilon$ ... $S\rightarrow AC\mid CB$ $C\rightarrow aCb\mid \varepsilon$ $A\rightarrow aA\mid a$ $B\rightarrow Bb\mid b$
answered
in
Compiler Design
Jan 7, 2015
10.2k
views
gatecse-2006
compiler-design
grammar
normal
theory-of-computation
2
votes
13
GATE IT 2008 | Question: 71
A Binary Search Tree (BST) stores values in the range $37$ to $573$. Consider the following sequence of keys. $81, 537, 102, 439, 285, 376, 305$ $52, 97, 121, 195, 242, 381, 472$ $142, 248, 520, 386, 345, 270, 307$ ... list nodes in the order in which we could have encountered them in the search? II and III only I and III only III and IV only III only
answered
in
DS
Jan 7, 2015
11.3k
views
gateit-2008
data-structures
binary-search-tree
normal
–3
votes
14
GATE IT 2008 | Question: 16
A paging scheme uses a Translation Look-aside Buffer (TLB). A TLB-access takes $10$ ns and the main memory access takes $50$ ns. What is the effective access time(in ns) if the TLB hit ratio is $\text{90%}$ and there is no page-fault? $54$ $60$ $65$ $75$
answered
in
Operating System
Dec 11, 2014
11.4k
views
gateit-2008
operating-system
virtual-memory
normal
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...
@Aakash_Bhardwaj all the best bro . For your...