Question Discussion & Solution

The correct answer is Boy pushing wall in a room.

Key Points

• Boy pushing the wall in the room is not an example of work done.
  • When a boy pushes a wall, he is applying force on the wall. We see that the wall shows no displacement.
  • Work is given as the product of the forces and the displacement in the same direction.
  • Hence the work done is zero.

Additional Information

• Work is done when a force moves. Everyday examples of work include walking up a flight of stairs, lifting heavy objects, pulling a sled and pushing a shopping trolley, Applying pressure on a pebble lying on the surface, raising a book to a height.
  • Work is not done when holding a bag stationary or a book at arm's length because although a force is being applied, the force does not move.

The correct answer is Zila Parishad → Panchayat Samiti → Village Panchayat.

Key Points

• Panchayati Raj
  • Panchayati Raj is the system of local self-government of villages in rural India as opposed to urban and suburban municipalities.
  • It consists of the Panchayati Raj Institutions (PRIs) through which the self-government of villages is realized.
  • They are tasked with "economic development, strengthening social justice and implementation of Central and State Government Schemes including those 29 subjects listed in the Eleventh Schedule."
  • ​Part IX of the Indian Constitution is the section of the Constitution relating to the Panchayats.
  • It stipulates that in states or Union Territories with more than two million inhabitants there are three levels of PRIs:
    • Zilla Parishad at the District Level
    • Panchayat Samiti at the Block Level
    • Gram/Village Panchayat at the Village Level

 Additional Information

• The Panchayat Raj system was first adopted by the state of Rajasthan in Nagaur district on 2 Oct 1959 but first started by Andhra Pradesh.
• During the 1950s and 60s, other state governments adopted this system as laws were passed to establish panchayats in various states.
• The modern Panchayati Raj system was introduced in India by the 73rd constitutional amendment in 1993.

Functional cohesion:

A module is said to possess functional cohesion, if different functions of the module co-operate to complete a single task.

Example of Functional cohesion

A module containing all the functions required to manage employees’ pay-roll displays functional cohesion

Concept:

​Simple Pendulum:

• A simple pendulum consists of a small metallic ball or a piece of stone suspended from a rigid stand by a thread.
  The metallic ball is called Bob.
• A pendulum swings from one extreme position to another and comes back to the same position, this completes one oscillation. 
• One oscillation can also be defined as the pendulum starting from the mean position, going to one extreme, and coming back to the same mean position. 
• The time duration to compete for one oscillation is called time period and the is reciprocal of time period is frequency. 
• Frequency: The number of oscillations per unit time is called frequency. 

\(frequncy =\frac{Oscillation}{Time}\)

Calculation:

Given that : Frequency = 2 hz and time = 16 sec.

In a sec pendulum completes 2 oscillations per second.

⇒ Oscillations = Frequency × time

⇒ Oscillations = 2×16

⇒ Oscillations = 32

Additional Information

The time period of a simple pendulum depends upon on the length of the string and acceleration due to gravity.

\(T = 2 \pi \sqrt{\frac{l}{g}}\)

l is length, g is acceleration due to gravity. 

Binary search algorithm:

Binary search algorithm is used to find an element in an already sorted array.

STEPS 1:

It finds the middle element of the array and compare the element with the element to be searched, if

it matches then return true.

STEPS 2:

If not, then divide the array into two halves in which if element to be search is less than middle

element then search takes place in left part otherwise search in right half.

STEP 3:

Repeat this process, until you get the element.

Explanation:

Best case of Binary search occurs when element to be searched is the middle element of the array.

Then in that case, it just simply compares the element with the middle element, if matches then return

true.  Comparing with the one element will take only O(1) time complexity.

Best Case: Search 35 in below give array

T(n) = O(1)