Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged isi2011
2
votes
0
answers
1
ISI2011-PCB-A-4b
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 pseudo-code that ... given input $x \in (5.8, 25.8)$ belongs to, i.e., your pseudo-code should calculate $i \in \{1, 2, 3, 4\}$ such that $x \in A_i$.
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 \cu...
go_editor
443
views
go_editor
asked
Jun 3, 2016
Algorithms
descriptive
isi2011
algorithms
algorithm-design
+
–
2
votes
0
answers
2
ISI2011-PCB-A-4a
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}$.
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}$.
go_editor
366
views
go_editor
asked
Jun 3, 2016
Quantitative Aptitude
descriptive
isi2011
cartesian-coordinates
+
–
2
votes
1
answer
3
ISI2011-PCB-A-3b
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.
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$, irrespec...
go_editor
782
views
go_editor
asked
Jun 3, 2016
Combinatory
descriptive
isi2011
pigeonhole-principle
+
–
1
votes
0
answers
4
ISI2011-PCB-A-3a
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}$
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 ...
go_editor
546
views
go_editor
asked
Jun 3, 2016
Combinatory
descriptive
isi2011
combinatory
proof
+
–
1
votes
2
answers
5
ISI2011-PCB-A-2b
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 non-zero. Thus, an array $L$ of size ... matrix. Given $i, j$, write pseudo-code to store $a_{ij}$ in $L$, and get the value of $a_{ij}$ stored earlier in $L$.
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 −...
go_editor
791
views
go_editor
asked
Jun 3, 2016
Linear Algebra
descriptive
isi2011
linear-algebra
matrix
+
–
10
votes
2
answers
6
ISI2011-PCB-A-2a
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$.
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 ...
go_editor
1.5k
views
go_editor
asked
Jun 3, 2016
Algorithms
descriptive
isi2011
algorithms
sorting
+
–
2
votes
0
answers
7
ISI2011-PCB-A-1
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{1-x^2} = \frac{\pi}{2}$
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_...
go_editor
309
views
go_editor
asked
Jun 3, 2016
Geometry
isi2011
descriptive
proof
trigonometry
non-gate
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register