Question
Which sorting algorithm has a worst-case time complexity
of O(n²)?Solution
Bubble Sort has a worst-case time complexity of O(n²), making it inefficient for large datasets.
How much energy is consumed by a 100 W bulb in 2 hours?
In a plane electromagnetic wave. the electric field oscillates sinusoid ally at a frequency of 3 × 108 Hz and amplitude 36 V/m. Find the am...
A sound wave has a frequency of 500 Hz and wavelength of 0.68 m. What is the speed of sound?
When white light passes through a glass prism, which color deviates the least?
What is the magnitude of magnetic force per unit length on a wire carrying a current of 10 A and making an angle of 30° with the direction of a unif...
A particle dropped from the top of a tower uniformly falls on ground at a distance which is equal to the height of tower. Which of the following paths ...
A particle moving in a straight line with uniform acceleration covers distances 5 m, 9 m, and 13 m in the 1st, 2nd, and 3rd second of motion respectivel...
A car increases its speed from 10 m/s to 30 m/s in 5 seconds. What is its acceleration? Â
The unit of measurement of noise is –
How does the angle of minimum deviation of a glass prism of refractive index 1.5 change, if it is immersed in a liquid of refractive index 1.25?
Relevant for Exams:
