CSE 551: Foundations of Algorithms - . Module 2 Practice Quiz: CSE 551: Foundations of Algorithms (2

downloaded from

Scholarfriends

https://scholarfriends.com Downloaded by: writerforacademic@gmail.com | https://scholarfriends.com/singlePaper/315725/cse-551-foundations-of-algorithms-arizonastate-university-module-2-practice-quiz-cse-551-foun Distribution of this document is illegal.

19/01/2022, 21:28

Module 2 Practice Quiz: CSE 551: Foundations of Algorithms (2021 Fall)

Module 2 Practice Quiz Due No due date Time Limit None

Points 9 Questions 9 Allowed Attempts Unlimited

Take the Quiz Again

Attempt History LATEST

Attempt

Time

Score

Attempt 1

less than 1 minute

3 out of 9

Submitted Sep 27, 2021 at 9:39pm

0 / 1 pts

Question 1

Can an edge in a weighted, connected graph be such that every MST for the graph contains ? ou Answered

orrect Answer

Yes, if

has the highest weight in the graph.

Yes, if the removal of

would disconnect the graph.

No, not every spanning tree need be connected.

None of the other answers is correct.

Question 2

1 / 1 pts

Suppose that you have been given n intervals to schedule, but are only made aware of each interval when the current time is that interval's start time. For example, for interval [3, 5], then you only are made aware of it when the from current time ison305-01-2023 (at which point This study source was downloaded by 100000861003072 CourseHero.com 03:30:29 GMTyou -05:00know its finish https://asu.instructure.com/courses/95943/quizzes/695405?module_item_id=6315393 https://www.coursehero.com/file/196860543/Module-2-Practice-Quiz-CSE-551-Foundations-of-Algorithms-2021-Fallpdf/

1/5

19/01/2022, 21:28

Module 2 Practice Quiz: CSE 551: Foundations of Algorithms (2021 Fall)

time is 5). From the list below, identify the key challenge that makes a greedy technique difficult to apply to such a situation.

Correct!

If one chooses to schedule a certain interval without first considering all intervals, one might miss the opportunity to make the solution subset larger. For example, perhaps the intervals [3,4] and [4,5] will come in future.

It is actually trivial since the same greedy method for the usual Interval Scheduling problem works in this setting as well.

It is impossible that any greedy algorithm can solve the integral scheduling problem under these circumstances.

Question 3

0 / 1 pts

In Dijkstra’s algorithm, you want an efficient implementation. What is the fastest (asymptotically) method overall to implement Dijkstra’s algorithm? ou Answered

d-way heap.

An array.

Binary heap. orrect Answer

Fibonacci heap.

Question 4

1 / 1 pts

Which of the following is always true about Kruskal’s algorithm?

This study source was downloaded by 100000861003072 from CourseHero.com on 05-01-2023 03:30:29 GMT -05:00

https://asu.instructure.com/courses/95943/quizzes/695405?module_item_id=6315393 https://www.coursehero.com/file/196860543/Module-2-Practice-Quiz-CSE-551-Foundations-of-Algorithms-2021-Fallpdf/

2/5

19/01/2022, 21:28

Correct!

Module 2 Practice Quiz: CSE 551: Foundations of Algorithms (2021 Fall)

It picks the lowest-weight edge in the graph.

It picks the highest-weight edge in the graph.

It picks edges in strictly ascending order of weight.

None of the other answers is correct.

Question 5

0 / 1 pts

Suppose you’ve been given (unweighted) intervals to schedule, and you are allowed to schedule (up to) two intervals at any given time that overlap. I then run the (greedy) algorithm for interval scheduling, remove the intervals found for it, and then run it again on the remaining jobs, if there are any. Does this approach always give the optimal schedule of jobs, like the greedy algorithm did? ou Answered Yes it is optimal, and the proof is the same as for the greedy approach.

None of the other answers is correct.

Yes it is optimal, but the proof uses induction on the number of jobs. orrect Answer

No it is not optimal.

Question 6

0 / 1 pts

In the proof of optimality for the greedy algorithm in minimizing lateness, it is said that if an optimal schedule exists, then there is some optimal schedule without any idle time. Why is this true? ou Answered

None of the other answers is correct.

This study source was downloaded by 100000861003072 from CourseHero.com on 05-01-2023 03:30:29 GMT -05:00

https://asu.instructure.com/courses/95943/quizzes/695405?module_item_id=6315393 https://www.coursehero.com/file/196860543/Module-2-Practice-Quiz-CSE-551-Foundations-of-Algorithms-2021-Fallpdf/

3/5

19/01/2022, 21:28

Module 2 Practice Quiz: CSE 551: Foundations of Algorithms (2021 Fall)

Because no optimal schedule has any idle time.

Because every optimal schedule can have idle time. orrect Answer

Because adding idle time cannot help reduce maximum lateness.

Question 7

0 / 1 pts

In the optimal caching problem, what is a “reduced” schedule? ou Answered A schedule that only inserts an item into the cache in a step before in which that item is requested.

A schedule that only inserts an item into the cache in a step in which that item is requested, and does not insert it again.

A schedule that only inserts an item into the cache in a step after in which that item is requested.

orrect Answer A schedule that only inserts an item into the cache in a step in which that item is requested.

Question 8

0 / 1 pts

In the optimal caching algorithm, what is the difference between LIFO and LRU?

This study source was downloaded by 100000861003072 from CourseHero.com on 05-01-2023 03:30:29 GMT -05:00

https://asu.instructure.com/courses/95943/quizzes/695405?module_item_id=6315393 https://www.coursehero.com/file/196860543/Module-2-Practice-Quiz-CSE-551-Foundations-of-Algorithms-2021-Fallpdf/

4/5

19/01/2022, 21:28

Module 2 Practice Quiz: CSE 551: Foundations of Algorithms (2021 Fall)

ou Answered LIFO evicts a page brought in least recently, and LRU evicts the one whose most recent access was latest.

orrect Answer LIFO evicts a page brought in most recently, and LRU evicts the one whose most recent access was earliest.

LIFO evicts a page brought in least recently, and LRU evicts the one whose most recent access was earliest.

LIFO evicts a page brought in most recently, and LRU evicts the one whose most recent access was latest.

1 / 1 pts

Question 9 In Dijkstra’s algorithm, why is

set to 0, where s is the source

node?

Correct!

Because the distance from one node to itself is always 0 in any weighted graph.

Because an empty set of edges has default weight of 0.

Because edges have nonnegative weight.

None of the other answers is correct.

This study source was downloaded by 100000861003072 from CourseHero.com on 05-01-2023 03:30:29 GMT -05:00

https://asu.instructure.com/courses/95943/quizzes/695405?module_item_id=6315393 https://www.coursehero.com/file/196860543/Module-2-Practice-Quiz-CSE-551-Foundations-of-Algorithms-2021-Fallpdf/ Powered by TCPDF (www.tcpdf.org)

5/5