a) Graph 1 below represents the runtimes against the input size of two Algorithms A (1000 log N) B (NP/100) solving same

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899603
Joined: Mon Aug 02, 2021 8:13 am

a) Graph 1 below represents the runtimes against the input size of two Algorithms A (1000 log N) B (NP/100) solving same

Post by answerhappygod »

A Graph 1 Below Represents The Runtimes Against The Input Size Of Two Algorithms A 1000 Log N B Np 100 Solving Same 1
A Graph 1 Below Represents The Runtimes Against The Input Size Of Two Algorithms A 1000 Log N B Np 100 Solving Same 1 (129.67 KiB) Viewed 30 times
Q4a,b
a) Graph 1 below represents the runtimes against the input size of two Algorithms A (1000 log N) B (NP/100) solving same problem Algorithm B has a low coefficient 1/100 but why is its run time slower that Algorithm A that has a very high coefficient of 10002 Graph 1 30000 23000 20000 13000 Series2 10000 Series 3000 0 0 20 40 60 20 100 120 140 Major Topic ALGORITHM ANALYSIS Blooms Designation CR Score 8 b) "Queues and stacks are used in many real-life situations”. In you own words, clearly distinguish between queues and stacks, and 6 give one example of real-life situations in which each of them is used.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Post Reply