Let the first row have $n$ children and total rows be $r$. Then the numbers per row form an AP with difference $-3$ and sum $630$:
$\displaystyle \frac{r}{2}\big(2n-3(r-1)\big)=630$ $ \;\Rightarrow\; 1260=r\big(2n-3(r-1)\big)$.
Hence $r\mid1260$. Also the last row must be positive: $n-3(r-1)>0$.
Testing the options (and ensuring $n$ is integer and last term positive):
Therefore, the impossible number of rows is $\boxed{6}$.
Given: 1.15x = 161
x = 140
We separate the integer and fractional parts.
Integer part: $10101_2 = 1\times2^4 + 0\times2^3 + 1\times2^2 + 0\times2^1 + 1\times2^0 $$= 16 + 0 + 4 + 0 + 1 = 21$
Fractional part: $.10101_2 = 1\times2^{-1} + 0\times2^{-2} + 1\times2^{-3} + 0\times2^{-4} + 1\times2^{-5}$
= 0.5 + 0 + 0.125 + 0 + 0.03125
= 0.65625
Therefore, $10101.10101_2 = 21 + 0.65625 = {21.65625}$
A debugger is a tool used to test and debug programs. It allows programmers to pause execution at specific points (breakpoints), run code step-by-step, and inspect variables and registers to find logic or runtime errors.
Hence, the correct option is:
✅ Option 3: allows to set breakpoints, execute a segment of program, and display contents of registers.
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
Online Test Series, Information About Examination,
Syllabus, Notification
and More.