- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# Sweety runs around a square park of side $ 75 \mathrm{~m} $. Bulbul runs around a rectangular park with length $ 60 \mathrm{~m} $ and breadth $ 45 \mathrm{~m} $. Who covers less distance?

Given:

Sweety runs around the square park of side $75\ m$. Bulbul runs around the rectangular park with length $60\ m$ and breadth $45\ m$.

To do:

We have to find that who among them covers less distance.

Solution:

The side of square park $ = 75\ m$

We know that,

The perimeter of a square with side $a$ is $4a$.

Therefore,

The perimeter of square park $ = 4\times$ each side of the square park

$= 4\times75$

$= 300\ m$

The distance covered by Sweety is $300\ m$.

The length of the rectangular park $ =175\ m$

The breadth of the rectangular park $ =125\ m$

We know that,

The perimeter of a rectangle of length $l$ and breadth $b$ is $2(l+b)$

Therefore,

The perimeter of the rectangular park $ = 2\times(60+45)$

$= 2\times105$

$= 210\ m$

The distance covered by Bulbul is $210\ m$.

**Hence, Bulbul covers less distance than Sweety.**

- Related Questions & Answers
- Count of numbers satisfying m + sum(m) + sum(sum(m)) = N in C++
- Find a positive number M such that gcd(N^M,N&M) is maximum in Python
- Month ("M", "m") Format Specifier in C#
- M-Coloring Problem
- m-ary tree
- Sum of even numbers from n to m regardless if n<m or n>m JavaScript
- Construct DPDA for a(n+m)bmcn n,m≥1 in TOC
- What are the key assumptions of Modigliani-Miller (M&M) Theorem?
- Construct Pushdown automata for L = {a(2*m)c(4*n)dnbm | m,n = 0} in C++
- Construct Turing machine for L = {an bm a(n+m) - n,m≥1} in C++
- Construct Pushdown automata for L = {0n1m2(n+m) | m,n = 0} in C++
- Largest number with binary representation is m 1’s and m-1 0’s in C++
- C++ Program to Generate N Number of Passwords of Length M Each
- Construct PDA for L = {0n1m2(n+m) | m,n >=1}
- Construct Pushdown automata for L = {0(n+m)1m2n | m, n = 0} in C++
- Construct Pushdown automata for L = {0m1(n+m)2n | m,n = 0} in C++