Computer Science - Algorithms - Greedy algorithms - Greedy Problem Solving

8 questions. Q1: Activity selection: [(1,4),(3,5),(0,6),(5,7),(3,9),(5,9),(6,10),(8,11),(8,12),(2,14),(12,16)]. Greedy by earliest end time. First selected? → (1,4). Q2: After selecting (1,4), which activities conflict? → (3,5), (0,6), (3,9), (2,14). Q3: Fractional knapsack: items [(60,10kg), (100,2

Edodovivmagarwal
Computer Science - Algorithms - Greedy algorithms - Greedy Problem Solving
Log in

Preparing your experience...

Loading scripts and resources

Comments (0)

0/5000

Comments are reviewed before appearing publicly.

About this Experience

Computer Science - Algorithms - Greedy algorithms - Greedy Problem Solving

vivmagarwal
vivmagarwalJan 29, 2026

Description

8 questions. Q1: Activity selection: [(1,4),(3,5),(0,6),(5,7),(3,9),(5,9),(6,10),(8,11),(8,12),(2,14),(12,16)]. Greedy by earliest end time. First selected? → (1,4). Q2: After selecting (1,4), which activities conflict? → (3,5), (0,6), (3,9), (2,14). Q3: Fractional knapsack: items [(60,10kg), (100,2

Details

Computer ScienceAlgorithmsClass 12, Class 12, Grade 12, A2 Level, DP Year 2

Engagement

17

Likes

0

Remixes

0

Comments

Browse all experiences