Register

TIFR CSE 2021 | Part A | Question: 15

• recategorized by
489 views
2 votes
2 votes

Let $P$ be a convex polygon with sides $5, 4, 4, 3$. For example, the following:

Consider the shape in the plane that consists of all points within distance $1$ from some point in $P$. If $\ell$ is the perimeter of the shape, which of the following is always correct?

  1. $\ell$ cannot be determined from the given information.
  2. $20\leq \ell < 21$
  3. $21\leq \ell< 22$
  4. $22\leq \ell< 23$
  5. $23\leq \ell< 24$
• recategorized by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

844
views
1 answers
1 votes
soujanyareddy13 asked Mar 25, 2021
844 views
TIFR CSE 2021 | Part A | Question: 6
A matching in a graph is a set of edges such that no two edges in the set share a common vertex. Let $G$ be a graph on $n$ $\textit{vertices}$ in which there is a subset $M$ ... \right )^{m}$1-\left ( 1-p\left ( 1-p \right ) \right )^{m}$
User Avatar
630
views
1 answers
3 votes
soujanyareddy13 asked Mar 25, 2021
630 views
TIFR CSE 2021 | Part B | Question: 12
Let $G$ be an undirected graph. For any two vertices $u, v$ in $G$, let $\textrm{cut} (u, v)$ be the minimum number of edges that should be deleted from $G$ so that there is ... $\textrm{cut} (b,c) = 2$ and $\textrm{cut} (c,d) = 1$
User Avatar
658
views
1 answers
2 votes
soujanyareddy13 asked Mar 25, 2021
658 views
TIFR CSE 2021 | Part B | Question: 13
Let $A$ be a $3 \times 6$ matrix with real-valued entries. Matrix $A$ has rank $3$. We construct a graph with $6$ vertices where each vertex represents distinct ... size $3$.The graph has a cycle of length $4$.The graph is $3$-colourable.
User Avatar
797
views
2 answers
3 votes
soujanyareddy13 asked Mar 25, 2021
797 views
TIFR CSE 2021 | Part B | Question: 14
Consider the following greedy algorithm for colouring an $n$-vertex undirected graph $G$ with colours $c_{1}, c_{2}, \dots:$ consider the vertices of $G$ in any sequence and assign ... \right ) = nr$m\left ( n, r \right ) = n\binom{r}{2}$
User Avatar
Link Copied!