1
CS4335 Assignment 1
Student ID:53092051
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (8 dollars, 5 pounds), (4 dollars, 4 pounds), (4 dollars, 2 pounds), (10 dollars, 10 pounds) and (17 dollars, 3 pounds)
and the thief can take at most 11.9 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (12, 16), (11, 14), (8, 12), (9, 10), (7, 10), (11, 13), (4, 9), and (1, 6). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53659115
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (5 dollars, 1 pounds), (17 dollars,
10 pounds), (10 dollars, 4 pounds), (12 dollars, 4 pounds) and (20 dollars, 6 pounds) and
the thief can take at most 20.0 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (10, 12), (1, 6), (9, 11), (8, 12), (4, 7), (2, 3), (7, 10), and (11, 15). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53546458
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (11 dollars, 2 pounds), (11
dollars, 8 pounds), (19 dollars, 3 pounds), (13 dollars, 10 pounds) and (15 dollars, 8 pounds)
and the thief can take at most 30.3 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (12, 16), (6, 9), (2, 4), (5, 7), (12, 17), (12, 17), (1, 3), and (4, 9). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53090752
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (11 dollars, 9 pounds), (4 dollars,
7 pounds), (14 dollars, 4 pounds), (17 dollars, 3 pounds) and (2 dollars, 1 pounds) and the
thief can take at most 20.5 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (11, 14), (5, 6), (5, 10), (4, 5), (6, 7), (12, 14), (10, 12), and (7, 12). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53043880
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (11 dollars, 10 pounds), (5
dollars, 9 pounds), (6 dollars, 3 pounds), (9 dollars, 2 pounds) and (14 dollars, 2 pounds)
and the thief can take at most 15.6 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (5, 8), (8, 10), (9, 14), (7, 9), (11, 12), (6, 7), (10, 12), and (8, 13). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53090463
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (18 dollars, 8 pounds), (9 dollars,
6 pounds), (8 dollars, 1 pounds), (2 dollars, 3 pounds) and (5 dollars, 8 pounds) and the
thief can take at most 4.2 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (3, 5), (3, 8), (8, 9), (6, 8), (3, 5), (4, 7), (6, 10), and (12, 14). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53088283
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (10 dollars, 2 pounds), (6 dollars,
8 pounds), (19 dollars, 8 pounds), (12 dollars, 3 pounds) and (3 dollars, 2 pounds) and the
thief can take at most 16.5 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (7, 8), (6, 10), (8, 11), (5, 6), (2, 6), (7, 8), (10, 11), and (10, 12). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53072285
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (15 dollars, 3 pounds), (17
dollars, 8 pounds), (7 dollars, 2 pounds), (5 dollars, 3 pounds) and (9 dollars, 9 pounds)
and the thief can take at most 22.4 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (9, 10), (9, 11), (9, 12), (2, 7), (1, 5), (12, 17), (10, 13), and (7, 9). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53084014
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (8 dollars, 5 pounds), (10 dollars,
4 pounds), (12 dollars, 3 pounds), (6 dollars, 7 pounds) and (18 dollars, 3 pounds) and the
thief can take at most 5.9 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (8, 10), (2, 4), (10, 11), (11, 12), (11, 12), (9, 13), (12, 14), and (12, 15). Give the
schedule that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53371039
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (7 dollars, 10 pounds), (14
dollars, 3 pounds), (13 dollars, 6 pounds), (10 dollars, 8 pounds) and (19 dollars, 6 pounds)
and the thief can take at most 29.6 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (8, 9), (11, 14), (6, 9), (12, 13), (8, 12), (4, 5), (1, 3), and (4, 9). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53091078
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (7 dollars, 1 pounds), (1 dollars, 8 pounds), (17 dollars, 5 pounds), (17 dollars, 3 pounds) and (13 dollars, 6 pounds)
and the thief can take at most 13.6 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (5, 6), (1, 6), (4, 9), (6, 11), (7, 10), (1, 2), (1, 2), and (7, 10). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53079599
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (12 dollars, 5 pounds), (11
dollars, 2 pounds), (13 dollars, 3 pounds), (6 dollars, 7 pounds) and (2 dollars, 9 pounds)
and the thief can take at most 15.9 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (11, 13), (11, 12), (4, 5), (9, 14), (8, 12), (9, 13), (9, 13), and (8, 10). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53149188
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (3 dollars, 6 pounds), (19 dollars,
8 pounds), (1 dollars, 1 pounds), (3 dollars, 8 pounds) and (20 dollars, 4 pounds) and the
thief can take at most 19.7 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (11, 13), (11, 16), (4, 6), (6, 11), (2, 7), (2, 7), (12, 15), and (8, 11). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53088130
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (3 dollars, 6 pounds), (19 dollars,
7 pounds), (10 dollars, 4 pounds), (12 dollars, 5 pounds) and (7 dollars, 10 pounds) and the
thief can take at most 8.2 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (6, 8), (4, 9), (11, 15), (5, 6), (6, 9), (5, 7), (2, 5), and (9, 10). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53092769
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (18 dollars, 4 pounds), (5 dollars,
1 pounds), (4 dollars, 9 pounds), (6 dollars, 8 pounds) and (3 dollars, 5 pounds) and the
thief can take at most 19.9 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (6, 11), (7, 10), (1, 6), (9, 12), (3, 8), (2, 6), (2, 6), and (11, 16). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:52910029
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (13 dollars, 3 pounds), (18
dollars, 7 pounds), (13 dollars, 4 pounds), (20 dollars, 9 pounds) and (12 dollars, 7 pounds)
and the thief can take at most 4.4 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (9, 12), (8, 10), (10, 14), (3, 7), (4, 7), (4, 7), (5, 7), and (4, 9). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:52640142
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (12 dollars, 10 pounds), (2
dollars, 4 pounds), (3 dollars, 8 pounds), (8 dollars, 7 pounds) and (5 dollars, 7 pounds)
and the thief can take at most 9.9 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (5, 9), (11, 14), (4, 7), (5, 10), (7, 11), (2, 6), (8, 10), and (8, 9). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53064064
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (11 dollars, 8 pounds), (4 dollars,
5 pounds), (5 dollars, 9 pounds), (1 dollars, 4 pounds) and (18 dollars, 7 pounds) and the
thief can take at most 30.1 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (8, 10), (6, 8), (11, 14), (11, 15), (10, 12), (2, 6), (6, 8), and (1, 4). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53089488
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (11 dollars, 4 pounds), (5 dollars,
1 pounds), (12 dollars, 1 pounds), (17 dollars, 9 pounds) and (1 dollars, 2 pounds) and the
thief can take at most 13.2 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (2, 5), (11, 14), (3, 7), (10, 14), (3, 7), (7, 11), (7, 8), and (3, 7). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53155343
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (13 dollars, 7 pounds), (4 dollars,
2 pounds), (6 dollars, 9 pounds), (15 dollars, 7 pounds) and (6 dollars, 2 pounds) and the
thief can take at most 17.8 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (6, 11), (2, 3), (2, 3), (8, 10), (1, 4), (10, 13), (5, 7), and (3, 8). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53075921
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (17 dollars, 2 pounds), (18
dollars, 3 pounds), (3 dollars, 1 pounds), (15 dollars, 7 pounds) and (13 dollars, 9 pounds)
and the thief can take at most 9.9 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (2, 4), (9, 10), (8, 13), (2, 5), (2, 5), (11, 15), (4, 6), and (1, 6). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53082266
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (12 dollars, 7 pounds), (6 dollars,
7 pounds), (15 dollars, 4 pounds), (2 dollars, 8 pounds) and (13 dollars, 8 pounds) and the
thief can take at most 19.2 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (12, 14), (9, 12), (9, 11), (6, 11), (9, 10), (2, 3), (6, 11), and (6, 10). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53419248
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (19 dollars, 2 pounds), (20
dollars, 1 pounds), (18 dollars, 1 pounds), (17 dollars, 6 pounds) and (19 dollars, 5 pounds)
and the thief can take at most 9.3 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (3, 4), (11, 12), (5, 7), (8, 13), (7, 11), (5, 7), (6, 8), and (4, 7). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53063079
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (8 dollars, 10 pounds), (6 dollars,
4 pounds), (1 dollars, 1 pounds), (12 dollars, 5 pounds) and (11 dollars, 9 pounds) and the
thief can take at most 25.8 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (5, 6), (10, 14), (11, 14), (10, 12), (1, 2), (12, 17), (9, 14), and (5, 8). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
2
1
CS4335 Assignment 1
Student ID:53088928
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (15 dollars, 6 pounds), (17
dollars, 1 pounds), (17 dollars, 6 pounds), (3 dollars, 8 pounds) and (3 dollars, 4 pounds)
and the thief can take at most 13.5 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (7, 11), (5, 10), (3, 6), (7, 10), (11, 15), (6, 7), (10, 12), and (10, 13). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53654838
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (4 dollars, 9 pounds), (2 dollars, 5 pounds), (12 dollars, 3 pounds), (3 dollars, 9 pounds) and (10 dollars, 7 pounds)
and the thief can take at most 5.7 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (7, 9), (3, 4), (5, 9), (7, 8), (2, 5), (7, 9), (12, 13), and (6, 11). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53646328
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (1 dollars, 4 pounds), (7 dollars, 3 pounds), (10 dollars, 4 pounds), (1 dollars, 4 pounds) and (11 dollars, 4 pounds)
and the thief can take at most 6.4 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (4, 6), (6, 11), (8, 13), (3, 8), (9, 10), (6, 8), (12, 16), and (9, 14). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53277727
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (2 dollars, 8 pounds), (12 dollars,
7 pounds), (1 dollars, 10 pounds), (1 dollars, 8 pounds) and (16 dollars, 9 pounds) and the
thief can take at most 30.4 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (7, 8), (8, 11), (8, 11), (9, 13), (4, 9), (9, 12), (8, 11), and (5, 10). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53043658
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (5 dollars, 10 pounds), (13
dollars, 6 pounds), (15 dollars, 6 pounds), (8 dollars, 1 pounds) and (20 dollars, 5 pounds)
and the thief can take at most 23.5 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (12, 13), (2, 3), (7, 8), (1, 3), (10, 15), (10, 14), (5, 6), and (10, 15). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53063368
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (20 dollars, 3 pounds), (14
dollars, 1 pounds), (14 dollars, 4 pounds), (1 dollars, 10 pounds) and (4 dollars, 7 pounds)
and the thief can take at most 13.1 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (7, 8), (6, 10), (2, 6), (10, 15), (11, 12), (11, 12), (3, 6), and (4, 9). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53060920
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (2 dollars, 6 pounds), (4 dollars, 6 pounds), (19 dollars, 9 pounds), (6 dollars, 1 pounds) and (15 dollars, 10 pounds)
and the thief can take at most 8.2 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (10, 14), (1, 4), (5, 10), (8, 11), (7, 9), (9, 14), (2, 4), and (1, 5). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53660593
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (11 dollars, 10 pounds), (2
dollars, 2 pounds), (14 dollars, 9 pounds), (12 dollars, 9 pounds) and (18 dollars, 7 pounds)
and the thief can take at most 29.6 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (11, 16), (9, 10), (10, 13), (2, 5), (8, 12), (11, 14), (5, 9), and (2, 7). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53062808
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (7 dollars, 3 pounds), (2 dollars, 6 pounds), (17 dollars, 8 pounds), (14 dollars, 10 pounds) and (2 dollars, 9 pounds)
and the thief can take at most 31.6 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (9, 10), (8, 10), (11, 13), (6, 10), (2, 6), (6, 10), (3, 8), and (6, 10). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53057337
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (13 dollars, 7 pounds), (4 dollars,
5 pounds), (8 dollars, 8 pounds), (4 dollars, 8 pounds) and (2 dollars, 7 pounds) and the
thief can take at most 26.1 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (9, 10), (12, 15), (7, 12), (6, 10), (11, 13), (12, 13), (5, 10), and (4, 6). Give the
schedule that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53672555
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (4 dollars, 6 pounds), (14 dollars,
5 pounds), (13 dollars, 7 pounds), (7 dollars, 7 pounds) and (6 dollars, 6 pounds) and the
thief can take at most 30.0 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (9, 12), (9, 13), (11, 12), (4, 6), (6, 7), (6, 8), (2, 5), and (2, 3). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53079262
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (6 dollars, 9 pounds), (9 dollars, 7 pounds), (1 dollars, 2 pounds), (15 dollars, 5 pounds) and (17 dollars, 1 pounds) and
the thief can take at most 17.3 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as fol-
2
lows: (5, 9), (4, 9), (6, 11), (8, 11), (7, 8), (5, 8), (9, 10), and (9, 12). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53573320
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (4 dollars, 2 pounds), (10 dollars,
3 pounds), (5 dollars, 2 pounds), (11 dollars, 2 pounds) and (12 dollars, 9 pounds) and the
thief can take at most 8.0 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (4, 8), (10, 11), (10, 12), (6, 7), (12, 14), (5, 6), (10, 15), and (7, 9). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53084339
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (13 dollars, 3 pounds), (9 dollars,
1 pounds), (17 dollars, 7 pounds), (19 dollars, 6 pounds) and (10 dollars, 3 pounds) and the
thief can take at most 4.8 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (8, 12), (9, 13), (2, 3), (1, 6), (3, 4), (10, 11), (3, 5), and (9, 10). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53085281
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (19 dollars, 2 pounds), (10
dollars, 6 pounds), (6 dollars, 8 pounds), (20 dollars, 9 pounds) and (19 dollars, 7 pounds)
and the thief can take at most 26.5 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (11, 14), (3, 5), (10, 15), (1, 3), (5, 6), (1, 5), (7, 9), and (5, 8). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53075619
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (10 dollars, 3 pounds), (13
dollars, 10 pounds), (19 dollars, 8 pounds), (3 dollars, 2 pounds) and (6 dollars, 8 pounds)
and the thief can take at most 19.3 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (10, 15), (4, 8), (10, 12), (1, 4), (11, 14), (12, 17), (3, 6), and (11, 12). Give the
schedule that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53092200
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (8 dollars, 3 pounds), (6 dollars, 3 pounds), (19 dollars, 2 pounds), (5 dollars, 9 pounds) and (1 dollars, 9 pounds) and
the thief can take at most 23.2 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (11, 12), (3, 4), (2, 4), (3, 5), (7, 9), (12, 15), (8, 10), and (8, 9). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53086683
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (14 dollars, 10 pounds), (17
dollars, 6 pounds), (15 dollars, 2 pounds), (4 dollars, 4 pounds) and (3 dollars, 10 pounds)
and the thief can take at most 30.9 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (5, 8), (7, 9), (4, 7), (6, 7), (2, 3), (7, 8), (8, 13), and (2, 5). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:52711298
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (9 dollars, 1 pounds), (9 dollars, 5 pounds), (14 dollars, 3 pounds), (10 dollars, 4 pounds) and (14 dollars, 6 pounds)
and the thief can take at most 7.6 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (7, 9), (7, 9), (7, 8), (4, 6), (3, 7), (4, 5), (7, 12), and (10, 15). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53062697
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (20 dollars, 5 pounds), (14
dollars, 6 pounds), (10 dollars, 5 pounds), (16 dollars, 4 pounds) and (12 dollars, 4 pounds)
and the thief can take at most 4.3 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (1, 6), (8, 13), (3, 8), (5, 9), (10, 15), (11, 16), (7, 12), and (10, 11). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53062532
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (13 dollars, 7 pounds), (17
dollars, 8 pounds), (5 dollars, 4 pounds), (12 dollars, 2 pounds) and (1 dollars, 9 pounds)
and the thief can take at most 23.8 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (11, 15), (2, 7), (1, 4), (1, 6), (7, 10), (3, 8), (8, 13), and (8, 9). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53092850
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (2 dollars, 4 pounds), (17 dollars,
6 pounds), (3 dollars, 3 pounds), (2 dollars, 4 pounds) and (10 dollars, 8 pounds) and the
thief can take at most 11.4 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (12, 17), (6, 8), (12, 17), (10, 13), (6, 8), (12, 15), (8, 10), and (5, 7). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:52631932
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (11 dollars, 9 pounds), (12
dollars, 9 pounds), (16 dollars, 10 pounds), (8 dollars, 1 pounds) and (10 dollars, 6 pounds)
and the thief can take at most 22.5 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (9, 13), (8, 10), (3, 7), (1, 2), (11, 15), (1, 6), (3, 6), and (3, 8). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53043799
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (11 dollars, 1 pounds), (8 dollars,
10 pounds), (14 dollars, 1 pounds), (8 dollars, 8 pounds) and (1 dollars, 3 pounds) and the
thief can take at most 8.7 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (9, 12), (2, 4), (3, 4), (3, 5), (4, 6), (5, 9), (7, 9), and (8, 11). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:51839905
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (6 dollars, 2 pounds), (18 dollars,
2 pounds), (19 dollars, 6 pounds), (18 dollars, 1 pounds) and (19 dollars, 6 pounds) and the
thief can take at most 5.4 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (8, 13), (1, 6), (10, 12), (11, 13), (12, 14), (9, 10), (12, 13), and (8, 10). Give the
schedule that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53012319
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (11 dollars, 2 pounds), (18
dollars, 3 pounds), (15 dollars, 9 pounds), (3 dollars, 3 pounds) and (10 dollars, 1 pounds)
and the thief can take at most 16.6 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (11, 12), (10, 14), (1, 3), (8, 9), (9, 10), (8, 12), (3, 8), and (6, 10). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53013494
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (1 dollars, 10 pounds), (10
dollars, 8 pounds), (17 dollars, 8 pounds), (6 dollars, 2 pounds) and (4 dollars, 2 pounds)
and the thief can take at most 24.1 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (7, 12), (9, 12), (2, 7), (10, 14), (2, 7), (11, 15), (7, 12), and (4, 6). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53090635
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (5 dollars, 5 pounds), (11 dollars,
5 pounds), (5 dollars, 10 pounds), (13 dollars, 3 pounds) and (12 dollars, 6 pounds) and the
thief can take at most 4.9 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (1, 2), (10, 12), (6, 11), (4, 6), (6, 10), (1, 3), (9, 13), and (3, 6). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53086591
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (1 dollars, 10 pounds), (8 dollars,
5 pounds), (7 dollars, 10 pounds), (2 dollars, 9 pounds) and (5 dollars, 9 pounds) and the
thief can take at most 35.3 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (8, 11), (11, 16), (5, 7), (1, 3), (4, 5), (9, 13), (5, 6), and (8, 9). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53023254
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (17 dollars, 4 pounds), (12
dollars, 8 pounds), (1 dollars, 1 pounds), (18 dollars, 4 pounds) and (7 dollars, 6 pounds)
and the thief can take at most 10.6 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (12, 16), (10, 13), (1, 6), (7, 9), (1, 6), (7, 9), (2, 7), and (11, 16). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:52641937
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (3 dollars, 2 pounds), (2 dollars, 5 pounds), (14 dollars, 3 pounds), (9 dollars, 6 pounds) and (11 dollars, 5 pounds)
and the thief can take at most 4.3 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (10, 13), (4, 6), (10, 14), (4, 9), (8, 9), (9, 11), (11, 12), and (10, 13). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:52187693
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (9 dollars, 6 pounds), (5 dollars, 4 pounds), (1 dollars, 4 pounds), (13 dollars, 6 pounds) and (11 dollars, 3 pounds)
and the thief can take at most 5.5 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (7, 11), (7, 11), (6, 11), (2, 3), (11, 16), (6, 9), (12, 13), and (5, 10). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53196915
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (4 dollars, 4 pounds), (16 dollars,
10 pounds), (13 dollars, 2 pounds), (9 dollars, 6 pounds) and (2 dollars, 4 pounds) and the
thief can take at most 13.5 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (11, 15), (2, 4), (2, 6), (3, 7), (9, 12), (6, 8), (5, 10), and (9, 12). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
2
1
CS4335 Assignment 1
Student ID:53077858
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (11 dollars, 3 pounds), (10
dollars, 3 pounds), (20 dollars, 10 pounds), (17 dollars, 7 pounds) and (3 dollars, 4 pounds)
and the thief can take at most 11.4 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (9, 14), (1, 5), (11, 16), (4, 5), (5, 7), (2, 3), (11, 15), and (8, 12). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53084364
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (8 dollars, 2 pounds), (5 dollars, 3 pounds), (9 dollars, 5 pounds), (9 dollars, 3 pounds) and (3 dollars, 10 pounds) and
the thief can take at most 22.5 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (1, 6), (5, 10), (12, 13), (8, 11), (1, 5), (2, 3), (1, 3), and (11, 16). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53271030
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (19 dollars, 9 pounds), (13
dollars, 1 pounds), (7 dollars, 9 pounds), (3 dollars, 9 pounds) and (19 dollars, 4 pounds)
and the thief can take at most 22.4 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (11, 15), (9, 12), (7, 11), (1, 3), (2, 4), (11, 13), (5, 6), and (5, 9). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53569828
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (13 dollars, 1 pounds), (9 dollars,
5 pounds), (11 dollars, 9 pounds), (16 dollars, 9 pounds) and (13 dollars, 2 pounds) and the
thief can take at most 14.4 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (11, 12), (9, 11), (6, 7), (10, 14), (12, 17), (11, 16), (6, 10), and (7, 11). Give the
schedule that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53092106
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (4 dollars, 9 pounds), (12 dollars,
10 pounds), (19 dollars, 3 pounds), (2 dollars, 4 pounds) and (18 dollars, 6 pounds) and the
thief can take at most 27.9 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (3, 5), (7, 9), (4, 9), (8, 9), (5, 7), (6, 7), (12, 14), and (1, 2). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53655061
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (18 dollars, 1 pounds), (8 dollars,
2 pounds), (3 dollars, 1 pounds), (18 dollars, 9 pounds) and (6 dollars, 4 pounds) and the
thief can take at most 14.1 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (4, 8), (9, 13), (3, 8), (10, 15), (10, 14), (12, 14), (11, 14), and (10, 12). Give the
schedule that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53020633
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (10 dollars, 9 pounds), (19
dollars, 6 pounds), (18 dollars, 6 pounds), (17 dollars, 9 pounds) and (11 dollars, 8 pounds)
and the thief can take at most 23.8 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (4, 9), (6, 10), (3, 4), (7, 9), (2, 3), (2, 7), (12, 13), and (9, 14). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53186960
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (11 dollars, 6 pounds), (3 dollars,
7 pounds), (17 dollars, 10 pounds), (20 dollars, 1 pounds) and (18 dollars, 4 pounds) and
the thief can take at most 13.1 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (5, 8), (1, 6), (1, 6), (2, 7), (8, 9), (8, 11), (1, 2), and (12, 17). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53891740
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (18 dollars, 1 pounds), (14
dollars, 5 pounds), (5 dollars, 7 pounds), (12 dollars, 3 pounds) and (11 dollars, 9 pounds)
and the thief can take at most 4.9 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (4, 7), (3, 4), (4, 6), (6, 8), (2, 5), (9, 13), (5, 6), and (5, 9). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53086498
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (15 dollars, 8 pounds), (7 dollars,
9 pounds), (13 dollars, 4 pounds), (19 dollars, 5 pounds) and (18 dollars, 2 pounds) and the
thief can take at most 24.1 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (2, 6), (7, 8), (8, 12), (5, 10), (3, 4), (12, 13), (2, 4), and (1, 6). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53461069
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (13 dollars, 9 pounds), (11
dollars, 6 pounds), (17 dollars, 8 pounds), (7 dollars, 10 pounds) and (16 dollars, 6 pounds)
and the thief can take at most 29.4 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (4, 9), (10, 15), (6, 8), (9, 11), (3, 6), (3, 5), (3, 4), and (9, 14). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53653400
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (16 dollars, 4 pounds), (12
dollars, 3 pounds), (3 dollars, 5 pounds), (1 dollars, 2 pounds) and (7 dollars, 4 pounds)
and the thief can take at most 4.9 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (8, 11), (7, 12), (11, 12), (5, 7), (8, 10), (8, 12), (1, 6), and (1, 5). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53084898
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (17 dollars, 6 pounds), (15
dollars, 3 pounds), (20 dollars, 8 pounds), (4 dollars, 10 pounds) and (13 dollars, 2 pounds)
and the thief can take at most 4.4 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (1, 4), (1, 4), (1, 6), (7, 11), (5, 10), (10, 14), (4, 6), and (11, 13). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:52909909
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (18 dollars, 10 pounds), (17
dollars, 1 pounds), (12 dollars, 1 pounds), (16 dollars, 6 pounds) and (3 dollars, 3 pounds)
and the thief can take at most 8.8 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (4, 6), (3, 5), (1, 3), (1, 2), (10, 13), (2, 3), (2, 4), and (6, 11). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53674260
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (2 dollars, 9 pounds), (14 dollars,
3 pounds), (3 dollars, 4 pounds), (14 dollars, 9 pounds) and (20 dollars, 7 pounds) and the
thief can take at most 14.4 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (3, 8), (8, 10), (4, 9), (4, 6), (9, 11), (10, 14), (12, 17), and (4, 5). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53117178
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (17 dollars, 6 pounds), (13
dollars, 8 pounds), (14 dollars, 2 pounds), (6 dollars, 3 pounds) and (5 dollars, 3 pounds)
and the thief can take at most 16.9 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (10, 15), (11, 14), (4, 9), (10, 15), (3, 6), (12, 13), (2, 7), and (9, 14). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53084106
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (7 dollars, 1 pounds), (20 dollars,
7 pounds), (18 dollars, 4 pounds), (2 dollars, 3 pounds) and (6 dollars, 1 pounds) and the
thief can take at most 6.2 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (3, 4), (11, 15), (2, 7), (5, 6), (5, 9), (6, 11), (5, 9), and (5, 7). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:52912662
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (2 dollars, 9 pounds), (20 dollars,
8 pounds), (20 dollars, 4 pounds), (3 dollars, 5 pounds) and (14 dollars, 9 pounds) and the
thief can take at most 19.6 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (1, 2), (1, 5), (12, 15), (3, 5), (12, 16), (6, 7), (9, 14), and (12, 13). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53087286
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (12 dollars, 8 pounds), (20
dollars, 1 pounds), (3 dollars, 3 pounds), (3 dollars, 1 pounds) and (16 dollars, 3 pounds)
and the thief can take at most 10.3 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (2, 4), (9, 11), (4, 8), (5, 10), (6, 10), (4, 8), (9, 13), and (9, 12). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53078228
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (5 dollars, 2 pounds), (20 dollars,
1 pounds), (2 dollars, 1 pounds), (15 dollars, 1 pounds) and (11 dollars, 8 pounds) and the
thief can take at most 7.2 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (4, 5), (3, 7), (1, 2), (11, 14), (6, 8), (2, 6), (3, 5), and (12, 14). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53645971
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (14 dollars, 4 pounds), (15
dollars, 4 pounds), (12 dollars, 8 pounds), (14 dollars, 1 pounds) and (20 dollars, 6 pounds)
and the thief can take at most 19.6 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (6, 10), (2, 6), (1, 2), (12, 14), (1, 3), (12, 14), (3, 7), and (1, 6). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53081509
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (2 dollars, 7 pounds), (19 dollars,
7 pounds), (5 dollars, 1 pounds), (16 dollars, 1 pounds) and (3 dollars, 4 pounds) and the
thief can take at most 19.2 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (11, 13), (2, 5), (4, 9), (12, 17), (6, 11), (1, 2), (6, 8), and (8, 12). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53645958
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (3 dollars, 7 pounds), (1 dollars, 1 pounds), (13 dollars, 2 pounds), (2 dollars, 2 pounds) and (17 dollars, 3 pounds) and
the thief can take at most 14.1 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (6, 8), (5, 8), (5, 10), (1, 4), (9, 14), (11, 14), (6, 7), and (5, 8). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53093219
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (15 dollars, 5 pounds), (5 dollars,
1 pounds), (5 dollars, 5 pounds), (18 dollars, 1 pounds) and (13 dollars, 2 pounds) and the
thief can take at most 4.2 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (12, 16), (3, 4), (12, 15), (9, 11), (12, 15), (5, 8), (8, 11), and (8, 9). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53651615
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (8 dollars, 4 pounds), (4 dollars, 1 pounds), (7 dollars, 5 pounds), (16 dollars, 7 pounds) and (13 dollars, 7 pounds) and
the thief can take at most 22.6 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (11, 13), (10, 12), (4, 6), (5, 6), (4, 5), (6, 7), (1, 4), and (12, 15). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53082149
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (6 dollars, 9 pounds), (20 dollars,
10 pounds), (19 dollars, 8 pounds), (5 dollars, 2 pounds) and (18 dollars, 5 pounds) and the
thief can take at most 25.1 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (1, 5), (2, 3), (9, 14), (10, 11), (3, 4), (7, 9), (2, 6), and (1, 4). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53081571
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (16 dollars, 7 pounds), (8 dollars,
3 pounds), (18 dollars, 3 pounds), (11 dollars, 2 pounds) and (10 dollars, 3 pounds) and the
thief can take at most 10.9 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (11, 13), (6, 9), (6, 8), (5, 7), (9, 13), (7, 12), (11, 12), and (8, 10). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53203726
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (7 dollars, 10 pounds), (2 dollars,
2 pounds), (5 dollars, 8 pounds), (8 dollars, 1 pounds) and (7 dollars, 9 pounds) and the
thief can take at most 20.5 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (9, 12), (5, 6), (8, 13), (12, 14), (3, 5), (10, 15), (5, 6), and (6, 9). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53093164
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (15 dollars, 2 pounds), (4 dollars,
9 pounds), (1 dollars, 6 pounds), (2 dollars, 4 pounds) and (10 dollars, 9 pounds) and the
thief can take at most 19.7 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (1, 3), (12, 14), (10, 11), (5, 7), (7, 8), (7, 12), (10, 14), and (5, 7). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53089163
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (7 dollars, 8 pounds), (9 dollars, 1 pounds), (19 dollars, 9 pounds), (10 dollars, 4 pounds) and (8 dollars, 10 pounds)
and the thief can take at most 5.5 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (1, 2), (1, 2), (1, 4), (10, 14), (11, 12), (10, 14), (6, 11), and (5, 9). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53078369
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (1 dollars, 4 pounds), (12 dollars,
6 pounds), (9 dollars, 5 pounds), (4 dollars, 6 pounds) and (15 dollars, 4 pounds) and the
thief can take at most 23.3 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (9, 12), (5, 8), (8, 11), (8, 11), (4, 9), (5, 6), (8, 12), and (2, 7). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53089218
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (7 dollars, 9 pounds), (17 dollars,
2 pounds), (3 dollars, 4 pounds), (16 dollars, 5 pounds) and (4 dollars, 2 pounds) and the
thief can take at most 13.4 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (8, 11), (2, 3), (1, 4), (10, 13), (2, 6), (8, 9), (10, 11), and (5, 7). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53080132
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (17 dollars, 8 pounds), (11
dollars, 1 pounds), (8 dollars, 8 pounds), (17 dollars, 10 pounds) and (2 dollars, 2 pounds)
and the thief can take at most 22.7 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (6, 11), (4, 6), (8, 12), (9, 13), (3, 8), (7, 11), (3, 7), and (9, 14). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53080224
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (19 dollars, 5 pounds), (8 dollars,
4 pounds), (10 dollars, 7 pounds), (10 dollars, 3 pounds) and (4 dollars, 3 pounds) and the
thief can take at most 10.8 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (1, 5), (7, 9), (7, 11), (1, 5), (6, 8), (9, 12), (2, 7), and (5, 10). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53651062
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (1 dollars, 4 pounds), (11 dollars,
4 pounds), (3 dollars, 7 pounds), (16 dollars, 10 pounds) and (2 dollars, 7 pounds) and the
thief can take at most 12.1 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (10, 11), (11, 14), (1, 4), (6, 9), (8, 10), (12, 16), (1, 4), and (4, 6). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53646273
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (12 dollars, 7 pounds), (2 dollars,
6 pounds), (14 dollars, 10 pounds), (4 dollars, 1 pounds) and (20 dollars, 2 pounds) and the
thief can take at most 10.9 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (3, 5), (9, 12), (7, 11), (3, 6), (4, 8), (12, 15), (8, 10), and (10, 13). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53645946
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (15 dollars, 7 pounds), (13
dollars, 2 pounds), (8 dollars, 9 pounds), (5 dollars, 1 pounds) and (1 dollars, 10 pounds)
and the thief can take at most 27.7 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (6, 11), (5, 6), (6, 9), (6, 11), (2, 6), (3, 6), (5, 6), and (3, 5). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53235355
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (2 dollars, 6 pounds), (3 dollars, 6 pounds), (13 dollars, 2 pounds), (18 dollars, 2 pounds) and (7 dollars, 3 pounds) and
the thief can take at most 15.1 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (12, 17), (6, 8), (12, 14), (11, 14), (8, 9), (9, 10), (3, 6), and (9, 11). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53075299
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (20 dollars, 5 pounds), (15
dollars, 2 pounds), (17 dollars, 8 pounds), (7 dollars, 7 pounds) and (9 dollars, 2 pounds)
and the thief can take at most 13.4 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (7, 11), (2, 3), (12, 17), (3, 7), (5, 10), (8, 12), (4, 8), and (10, 12). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53750574
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2
2. For the fractional Knapsack problem, there are 5 items (9 dollars, 2 pounds), (1 dollars, 9 pounds), (9 dollars, 1 pounds), (8 dollars, 1 pounds) and (5 dollars, 4 pounds) and
the thief can take at most 10.9 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (12, 15), (4, 7), (8, 10), (8, 11), (10, 15), (1, 6), (1, 2), and (7, 9). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53284903
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (17 dollars, 3 pounds), (10
dollars, 3 pounds), (19 dollars, 7 pounds), (7 dollars, 8 pounds) and (19 dollars, 10 pounds)
and the thief can take at most 9.5 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (10, 14), (4, 5), (4, 6), (9, 11), (7, 9), (2, 5), (4, 5), and (5, 6). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53091240
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (17 dollars, 8 pounds), (15
dollars, 9 pounds), (14 dollars, 4 pounds), (11 dollars, 2 pounds) and (13 dollars, 10 pounds)
and the thief can take at most 13.9 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (5, 9), (12, 14), (10, 13), (1, 3), (2, 4), (9, 10), (8, 13), and (11, 12). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53081405
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (11 dollars, 7 pounds), (1 dollars,
2 pounds), (16 dollars, 5 pounds), (6 dollars, 3 pounds) and (15 dollars, 2 pounds) and the
thief can take at most 9.9 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (10, 12), (10, 12), (3, 4), (8, 11), (12, 16), (6, 8), (5, 10), and (11, 14). Give the
schedule that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53062126
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (5 dollars, 3 pounds), (17 dollars,
8 pounds), (17 dollars, 10 pounds), (10 dollars, 5 pounds) and (10 dollars, 4 pounds) and
the thief can take at most 25.0 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (5, 7), (11, 14), (5, 8), (3, 7), (12, 15), (10, 15), (11, 14), and (8, 13). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53078241
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (4 dollars, 8 pounds), (16 dollars,
9 pounds), (3 dollars, 4 pounds), (20 dollars, 8 pounds) and (14 dollars, 6 pounds) and the
thief can take at most 32.6 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (3, 5), (9, 11), (7, 9), (8, 9), (11, 16), (1, 3), (9, 13), and (9, 13). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53060864
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (7 dollars, 7 pounds), (8 dollars, 2 pounds), (9 dollars, 10 pounds), (15 dollars, 6 pounds) and (17 dollars, 5 pounds)
and the thief can take at most 24.8 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (1, 2), (1, 3), (9, 14), (9, 11), (9, 14), (9, 12), (12, 14), and (4, 9). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53057859
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (14 dollars, 2 pounds), (12
dollars, 7 pounds), (8 dollars, 7 pounds), (13 dollars, 3 pounds) and (2 dollars, 6 pounds)
and the thief can take at most 4.8 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (10, 13), (1, 2), (9, 12), (2, 5), (2, 5), (9, 11), (9, 11), and (1, 4). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53079077
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (15 dollars, 5 pounds), (20
dollars, 5 pounds), (17 dollars, 6 pounds), (19 dollars, 5 pounds) and (11 dollars, 10 pounds)
and the thief can take at most 29.9 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (2, 3), (7, 9), (3, 6), (2, 6), (3, 6), (9, 14), (6, 10), and (11, 16). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53085268
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (5 dollars, 4 pounds), (20 dollars,
1 pounds), (4 dollars, 8 pounds), (12 dollars, 1 pounds) and (9 dollars, 10 pounds) and the
thief can take at most 18.0 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (12, 17), (7, 10), (11, 15), (7, 10), (7, 8), (12, 15), (10, 11), and (6, 10). Give the
schedule that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53545609
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (12 dollars, 5 pounds), (5 dollars,
4 pounds), (8 dollars, 3 pounds), (13 dollars, 10 pounds) and (11 dollars, 10 pounds) and the
thief can take at most 6.0 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (4, 5), (4, 8), (2, 3), (12, 15), (8, 9), (3, 7), (10, 13), and (12, 14). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53661123
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (4 dollars, 1 pounds), (13 dollars,
9 pounds), (13 dollars, 1 pounds), (10 dollars, 10 pounds) and (11 dollars, 7 pounds) and
the thief can take at most 15.4 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (7, 11), (10, 13), (8, 12), (12, 13), (7, 8), (2, 3), (10, 15), and (11, 14). Give the
schedule that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53081257
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (17 dollars, 9 pounds), (8 dollars,
9 pounds), (20 dollars, 9 pounds), (10 dollars, 2 pounds) and (13 dollars, 5 pounds) and the
thief can take at most 11.6 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (9, 11), (7, 10), (10, 14), (8, 10), (7, 8), (2, 6), (5, 10), and (4, 9). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53117180
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (14 dollars, 5 pounds), (18
dollars, 1 pounds), (16 dollars, 4 pounds), (20 dollars, 6 pounds) and (6 dollars, 9 pounds)
and the thief can take at most 7.5 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (8, 13), (7, 12), (12, 15), (10, 13), (10, 14), (3, 7), (12, 16), and (3, 4). Give the
schedule that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53074266
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (1 dollars, 4 pounds), (15 dollars,
8 pounds), (7 dollars, 3 pounds), (7 dollars, 5 pounds) and (9 dollars, 1 pounds) and the
thief can take at most 5.6 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (1, 5), (7, 10), (8, 9), (8, 11), (10, 15), (8, 11), (1, 3), and (5, 6). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53087298
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (5 dollars, 2 pounds), (3 dollars, 2 pounds), (6 dollars, 9 pounds), (10 dollars, 5 pounds) and (10 dollars, 7 pounds) and
the thief can take at most 18.7 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (5, 6), (11, 14), (5, 10), (4, 6), (4, 6), (10, 11), (1, 5), and (4, 9). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53082790
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (12 dollars, 2 pounds), (18
dollars, 2 pounds), (1 dollars, 2 pounds), (6 dollars, 1 pounds) and (3 dollars, 4 pounds)
and the thief can take at most 4.4 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (10, 15), (8, 11), (2, 4), (1, 6), (1, 6), (4, 6), (1, 3), and (11, 14). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53091183
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (16 dollars, 7 pounds), (13
dollars, 4 pounds), (5 dollars, 10 pounds), (20 dollars, 4 pounds) and (12 dollars, 7 pounds)
and the thief can take at most 26.0 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (4, 9), (4, 5), (7, 9), (11, 12), (1, 6), (11, 12), (7, 9), and (6, 9). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53062882
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (7 dollars, 5 pounds), (14 dollars,
8 pounds), (11 dollars, 10 pounds), (2 dollars, 10 pounds) and (8 dollars, 4 pounds) and the
thief can take at most 14.8 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (7, 9), (1, 4), (8, 13), (11, 14), (3, 7), (6, 9), (12, 14), and (9, 10). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53650090
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (3 dollars, 2 pounds), (10 dollars,
5 pounds), (14 dollars, 1 pounds), (10 dollars, 4 pounds) and (19 dollars, 7 pounds) and the
thief can take at most 15.8 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (9, 11), (5, 6), (8, 13), (5, 8), (4, 8), (4, 5), (1, 3), and (9, 12). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53193570
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (14 dollars, 9 pounds), (20
dollars, 10 pounds), (4 dollars, 8 pounds), (6 dollars, 2 pounds) and (11 dollars, 1 pounds)
and the thief can take at most 16.0 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (8, 10), (7, 9), (7, 10), (5, 7), (9, 13), (12, 13), (2, 4), and (6, 9). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53057374
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (12 dollars, 9 pounds), (20
dollars, 8 pounds), (20 dollars, 8 pounds), (2 dollars, 8 pounds) and (9 dollars, 2 pounds)
and the thief can take at most 29.3 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (1, 6), (5, 7), (1, 6), (8, 9), (10, 14), (5, 7), (2, 6), and (3, 4). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53063798
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (17 dollars, 6 pounds), (2 dollars,
2 pounds), (4 dollars, 3 pounds), (6 dollars, 3 pounds) and (5 dollars, 8 pounds) and the
thief can take at most 10.9 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (6, 11), (9, 10), (2, 7), (6, 9), (11, 15), (3, 4), (11, 12), and (5, 6). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53049976
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (18 dollars, 2 pounds), (8 dollars,
7 pounds), (19 dollars, 7 pounds), (12 dollars, 9 pounds) and (18 dollars, 2 pounds) and the
thief can take at most 17.8 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (4, 6), (9, 12), (9, 10), (9, 13), (11, 12), (9, 10), (10, 13), and (3, 6). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53082217
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2
2. For the fractional Knapsack problem, there are 5 items (15 dollars, 8 pounds), (16
dollars, 1 pounds), (5 dollars, 7 pounds), (10 dollars, 6 pounds) and (11 dollars, 3 pounds)
and the thief can take at most 5.6 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (9, 14), (1, 4), (3, 5), (1, 2), (8, 12), (5, 10), (5, 6), and (3, 4). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53080250
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (11 dollars, 3 pounds), (14
dollars, 6 pounds), (17 dollars, 7 pounds), (13 dollars, 2 pounds) and (6 dollars, 3 pounds)
and the thief can take at most 9.9 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (4, 9), (10, 14), (6, 11), (11, 15), (5, 7), (1, 5), (8, 9), and (4, 7). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53077268
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (14 dollars, 6 pounds), (17
dollars, 5 pounds), (6 dollars, 5 pounds), (7 dollars, 3 pounds) and (16 dollars, 3 pounds)
and the thief can take at most 22.0 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (11, 15), (4, 9), (11, 13), (4, 6), (4, 7), (1, 6), (3, 6), and (2, 6). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53095330
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (9 dollars, 6 pounds), (17 dollars,
2 pounds), (9 dollars, 2 pounds), (10 dollars, 10 pounds) and (2 dollars, 5 pounds) and the
thief can take at most 4.9 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (10, 11), (1, 3), (3, 5), (1, 2), (1, 3), (10, 14), (11, 13), and (2, 3). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53036354
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (8 dollars, 8 pounds), (12 dollars,
2 pounds), (2 dollars, 4 pounds), (12 dollars, 7 pounds) and (14 dollars, 1 pounds) and the
thief can take at most 18.1 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (11, 14), (12, 13), (6, 10), (11, 16), (1, 4), (6, 10), (9, 13), and (9, 13). Give the
schedule that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53079483
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (3 dollars, 5 pounds), (20 dollars,
7 pounds), (15 dollars, 10 pounds), (6 dollars, 10 pounds) and (13 dollars, 1 pounds) and
the thief can take at most 29.7 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (8, 11), (5, 8), (3, 4), (2, 7), (9, 13), (4, 6), (7, 9), and (12, 15). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53081835
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (19 dollars, 9 pounds), (13
dollars, 8 pounds), (10 dollars, 10 pounds), (16 dollars, 8 pounds) and (14 dollars, 2 pounds)
and the thief can take at most 25.8 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (2, 5), (1, 2), (6, 9), (1, 6), (1, 5), (6, 7), (12, 17), and (10, 15). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53075306
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (11 dollars, 4 pounds), (1 dollars,
1 pounds), (4 dollars, 3 pounds), (16 dollars, 6 pounds) and (5 dollars, 4 pounds) and the
thief can take at most 4.1 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (3, 5), (6, 7), (5, 10), (5, 10), (6, 11), (8, 11), (6, 8), and (5, 8). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53079970
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (12 dollars, 5 pounds), (14
dollars, 6 pounds), (15 dollars, 9 pounds), (20 dollars, 5 pounds) and (1 dollars, 3 pounds)
and the thief can take at most 4.1 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (9, 10), (6, 9), (4, 5), (5, 8), (7, 11), (6, 10), (6, 9), and (11, 12). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53077674
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (17 dollars, 9 pounds), (10
dollars, 4 pounds), (19 dollars, 6 pounds), (19 dollars, 4 pounds) and (6 dollars, 9 pounds)
and the thief can take at most 16.5 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (7, 11), (9, 13), (8, 9), (8, 11), (3, 6), (7, 11), (2, 5), and (4, 8). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53673306
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (8 dollars, 6 pounds), (20 dollars,
9 pounds), (18 dollars, 4 pounds), (3 dollars, 5 pounds) and (8 dollars, 7 pounds) and the
thief can take at most 22.9 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (12, 16), (1, 6), (5, 7), (3, 7), (10, 11), (7, 10), (8, 9), and (3, 6). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53076710
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (17 dollars, 7 pounds), (9 dollars,
3 pounds), (6 dollars, 6 pounds), (13 dollars, 8 pounds) and (9 dollars, 6 pounds) and the
thief can take at most 6.5 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (5, 6), (4, 8), (10, 11), (11, 16), (1, 4), (2, 6), (3, 6), and (2, 7). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53648371
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (4 dollars, 9 pounds), (17 dollars,
1 pounds), (7 dollars, 10 pounds), (14 dollars, 5 pounds) and (15 dollars, 1 pounds) and the
thief can take at most 22.5 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (7, 9), (9, 12), (9, 14), (11, 13), (10, 12), (2, 5), (1, 5), and (6, 10). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:52910054
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (19 dollars, 8 pounds), (11
dollars, 5 pounds), (12 dollars, 3 pounds), (2 dollars, 8 pounds) and (4 dollars, 6 pounds)
2
and the thief can take at most 11.4 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (12, 14), (5, 7), (11, 16), (5, 8), (8, 12), (5, 8), (3, 5), and (10, 11). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53652556
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (1 dollars, 5 pounds), (12 dollars,
3 pounds), (7 dollars, 5 pounds), (20 dollars, 2 pounds) and (18 dollars, 6 pounds) and the
thief can take at most 21.0 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (9, 12), (9, 13), (7, 8), (3, 6), (8, 9), (9, 10), (4, 7), and (2, 6). Give the schedule that
minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53085397
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (5 dollars, 4 pounds), (7 dollars, 6 pounds), (7 dollars, 8 pounds), (8 dollars, 9 pounds) and (5 dollars, 6 pounds) and
the thief can take at most 18.6 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (2, 6), (3, 7), (9, 11), (1, 6), (12, 13), (4, 7), (9, 14), and (7, 12). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53081417
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (18 dollars, 9 pounds), (7 dollars,
5 pounds), (18 dollars, 10 pounds), (12 dollars, 8 pounds) and (10 dollars, 4 pounds) and
the thief can take at most 31.6 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (9, 13), (7, 9), (5, 7), (2, 4), (1, 2), (10, 11), (7, 9), and (10, 13). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:52595873
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (18 dollars, 2 pounds), (2 dollars,
6 pounds), (10 dollars, 8 pounds), (19 dollars, 2 pounds) and (4 dollars, 6 pounds) and the
thief can take at most 11.1 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (4, 9), (5, 10), (12, 14), (12, 13), (10, 14), (10, 12), (2, 6), and (11, 15). Give the
schedule that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53095004
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (18 dollars, 9 pounds), (20
dollars, 8 pounds), (3 dollars, 10 pounds), (3 dollars, 8 pounds) and (14 dollars, 3 pounds)
and the thief can take at most 29.5 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (8, 9), (5, 9), (12, 14), (2, 3), (5, 9), (1, 3), (11, 14), and (6, 10). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53062790
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (17 dollars, 7 pounds), (20
dollars, 3 pounds), (10 dollars, 7 pounds), (20 dollars, 6 pounds) and (14 dollars, 1 pounds)
and the thief can take at most 9.6 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (11, 15), (7, 11), (7, 8), (11, 12), (9, 13), (6, 9), (5, 9), and (6, 11). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53825933
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (11 dollars, 2 pounds), (6 dollars,
1 pounds), (19 dollars, 9 pounds), (14 dollars, 9 pounds) and (16 dollars, 6 pounds) and the
thief can take at most 21.1 pounds. Use the greedy algorithm to get the items that maximize
the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (1, 2), (8, 9), (12, 13), (7, 10), (3, 5), (9, 14), (3, 6), and (6, 10). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)
1
CS4335 Assignment 1
Student ID:53083607
Lecturer:Lu Sheng Wang
Each 24 hours late submission halves the score.
Submission: Hardcopy is required.
Due on Oct 16th,2015 12pm
1. Find a minimum spanning tree for the following graph using (1) Kruskal’s algorithm and
(2) Prim’s algorithm. (Intermediate steps are required.) (See Lecture 3) (3) Analyze the
running time complexity of the two algorithms CILO1).
2. For the fractional Knapsack problem, there are 5 items (20 dollars, 3 pounds), (14
dollars, 2 pounds), (13 dollars, 1 pounds), (6 dollars, 8 pounds) and (8 dollars, 6 pounds)
and the thief can take at most 8.7 pounds. Use the greedy algorithm to get the items that
maximize the total value of those items. (See Lecture 2)
3. (Interval Partitioning) There are 8 lectures with starting time and finish time as follows: (8, 12), (4, 8), (1, 5), (2, 4), (7, 9), (10, 11), (8, 10), and (10, 15). Give the schedule
that minimizes the number of classrooms used. (See Lecture 2)