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 questions tagged isi2011
+2
votes
0
answers
1
ISI2011PCBA4b
Consider the following intervals on the real line: $A_1 = (13.3, 18.3) \: A_3 = (8.3, 23.3) − A_1 \cup A_2$ $A_2 = (10.8, 20.8) − A_1 \: A_4 = (5.8, 25.8) − A_1 \cup A_2 \cup A_3$ where $(a, b) = \{x : a < x < b\}$. Write pseudocode that ... given input $x \in (5.8, 25.8)$ belongs to, i.e., your pseudocode should calculate $i \in \{1, 2, 3, 4\}$ such that $x \in A_i$.
asked
Jun 3, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

107
views
descriptive
isi2011
algorithms
algorithmdesign
+2
votes
0
answers
2
ISI2011PCBA4a
Consider six distinct points in a plane. Let $m$ and $M$ denote the minimum and maximum distance between any pair of points. Show that $M/m \geq \sqrt{3}$.
asked
Jun 3, 2016
in
Numerical Ability
by
jothee
Veteran
(
105k
points)

74
views
descriptive
isi2011
cartesiancoordinates
+2
votes
1
answer
3
ISI2011PCBA3b
The numbers $1, 2, \dots , 10$ are arranged in a circle in some order. Show that it is always possible to find three adjacent numbers whose sum is at least $17$, irrespective of the ordering.
asked
Jun 3, 2016
in
Combinatory
by
jothee
Veteran
(
105k
points)

176
views
descriptive
isi2011
pigeonholeprinciple
+1
vote
0
answers
4
ISI2011PCBA3a
Consider an $m \times n$ integer lattice. A path from $(0, 0)$ to $(m, n)$ can use steps of $(1, 0)$, $(0, 1)$ or diagonal steps $(1, 1)$. Let $D_{m,n}$ be the number of such distinct paths. Prove that $D_{m,n} = \Sigma_k \begin{pmatrix} m \\ k \end{pmatrix} \begin{pmatrix} n+k \\ m \end{pmatrix}$
asked
Jun 3, 2016
in
Combinatory
by
jothee
Veteran
(
105k
points)

119
views
descriptive
isi2011
permutationandcombination
proof
+1
vote
1
answer
5
ISI2011PCBA2b
An $n \times n$ matrix is said to be tridiagonal if its entries $a_{ij}$ are zero except when $i−j \leq 1$ for $1 \leq i, \: j \leq n$. Note that only $3n − 2$ entries of a tridiagonal matrix are nonzero. Thus, an array $L$ of size ... matrix. Given $i, j$, write pseudocode to store $a_{ij}$ in $L$, and get the value of $a_{ij}$ stored earlier in $L$.
asked
Jun 3, 2016
in
Linear Algebra
by
jothee
Veteran
(
105k
points)

244
views
descriptive
isi2011
linearalgebra
matrices
+10
votes
2
answers
6
ISI2011PCBA2a
Give a strategy to sort four given distinct integers $a, b, c, d$ in increasing order that minimizes the number of pairwise comparisons needed to sort any permutation of $a, b, c, d$.
asked
Jun 3, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

565
views
descriptive
isi2011
algorithms
sorting
+2
votes
0
answers
7
ISI2011PCBA1
Let $D = \{d_1, d_2, \dots, d_k\}$ be the set of distinct divisors of a positive integer $n$ ($D$ includes 1 and $n$). Then show that $\Sigma_{i=1}^k \sin^{1} \sqrt{\log_nd_i}=\frac{\pi}{4} \times k$. hint: $\sin^{−1} x + \sin^{−1} \sqrt{1x^2} = \frac{\pi}{2}$
asked
Jun 3, 2016
in
Geometry
by
jothee
Veteran
(
105k
points)

84
views
isi2011
descriptive
proof
trigonometry
nongate
To see more, click for the
full list of questions
or
popular tags
.
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
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
Follow @csegate
Recent questions tagged isi2011
Recent Blog Comments
ONLY T MADE EASY STUDENTS CAN UNDERSTAND,
Yes and few more questions also
nkg_master9 you challenged that dbms query...
@nsaisirisha Yes they will give marks only...
When will the results be declared based on...
50,737
questions
57,352
answers
198,472
comments
105,244
users