CS702 Current Papers Solved
1. fractional knapsak psuedo code 5marks
2. strongly connected component algo 5marks
3. prove if a|b . then a|(-b) somthing like that 5marks
5. prive 1f n is devisble by 7. n square also devisible by 7. 10marks
8. prove CLIQUE
Scott Frye
Homework #2
CS 91.503
Algorithms
Due 9/17/2003
Problem 1: p379 16.1-4
Not just any greedy approach to the activity-selection problem produces a maximumsize set of mutually compatible activities. Give an example to show that the approach
of sele
CS 583: Data Structures and Analysis of Algorithms: Fall 2006: D. Kaznachey
Home Work #3
1. (5 points) Suppose there is no way to represent the key -. Rewrite the BinomialHeap-Delete procedure to work correctly in this situation (see exercise 19.2-6) Ensu
Analysis of Algorithms
CS 477/677
Graphs
Instructor: George Bebis
Appendix B4, Appendix B5.1
Chapter 22
Graphs
Definition = a set of nodes (vertices) with
edges (links) between them.
G = (V, E) - graph
V = set of vertices
E = set of edges
V = n
E = m
1
06 1A927407
16.1-2
Suppose that instead of always selecting the first activity to finish, we instead select
the last activity to start that is compatible with all previously selected activities.
Describe how this approach is a greedy algorithm, and prove
Theorem 21.1 : Using the linked-list representation of disjoint sets and the weightedunion heuristic, a sequence of m MAKE-SET, UNION, and FIND-SET operations, n of
which are MAKE-SET operations, takes O(m + n lg n) time.
Proof We start by computing, for
Michael Kaiser
Assignment 2
Comp 510
Fall 2012
16.1-1
Give a dynamic-programming algorithm for the activity-selection problem, based on the
recurrence (16.2). Have your algorithm compute the sizes c[i, j] as defined above and also
produce the maximum-size