Need help with a 2-part discrete Math Problem involving algorithms: Part 1: Part

Question

Need help with a 2-part discrete Math Problem involving algorithms:

Part 1:

Part 2:

Your job is to write a basic blurring algorithm for a video driver. The algorithm will do the following: it will go through all pixels on the screen and for each pixel, compute the average intensity value (in red, green and blue separately) of the pixel and its 8 neighbors. (At the edges of the screen, there are fewer neighbors for each pixel.) Let's say the number of pixels on the screen is n. Then what is the order of the number of arithmetic operations (additions and divisions) required? The number is order of n 4 . The number is order of n' . O The number is order of n The number is order of n.

Explanation / Answer

Part 1:- The number of order n^3 i.e. Fourth option

for each it calculate the average intensities of red ,green,blue separately i.e it adds three and after divides the sum by 3, so total two additions R +G+B and sum divided by 3, one division total 3 arthimetic operations for each pixel. Therefore order of the number of arthimetic operations required are n^3.

Part 2:- option 1, answer 2

(1920*1080) is multiplied with 2 gives (3840*2160)

Related Questions

Navigate

• Browse (All)
• Browse N
• Subjects

---