COT 6401 The Analysis of Algorithms
Final Test
Open books and notes
Name |- SSN |1. 25, Amortized Analysis In table expansion, we expand the table by allocating
a new table with more slots than the old table had. In the new heuristic, we allocate a
new ta
COT 6401 The Analysis of Algorithms
Programming Project
Due:
December 6, 2001
couples f
g, where and are husband and wife of couple , go to a movie
theater and are seated in one row. Each person, except two seated at the two ends, has two
neighbors. It is
Semi-Heap and Its Applications in Tournament Ranking
Jie Wu
Department of Computer Science and Engineering
Florida Atlantic University
Boca Raton, FL 33431
[email protected]
September 21, 2001
1
1.
Introduction and Motivation
2.
Preliminaries
3.
Semi-Heap
4
COT 6401
The Analysis of Algorithms
Test (March 11, 2009)
Due: midnight of March 12, 2009
Name - SSN 1. (20%) (Greedy) A telecom company needs to install base stations to cover all houses along
a long road. These houses can be sparsely distributed along t
COT 4400: Design and Analysis of Algorithms
Spring 15
Solutions Assignment 5
Problem 1
Show how breadth-first search (BFS) works on the following graph, with vertex i as the source.
Show the d and values that result from running BFS.
Show the elements i
Quiz 1 Solutions
Problem 4 [2D points]
Consider the following
a. Label. the following binary tree with numbers from. the set {5, 22. 9, 14, 13. 11 B}
so that it is a legal binary search tree.
Answer:
b. Label each node in the gure above with r or '
Solutions to Quiz 1
{{Points for a problem are generally equally divided among problem parts.
Answers neednt be as oomplete as here; we give liberal partial credit [or
showing understanding of ideas.}}
Problem 1 [20 points]
Give asymptotically tight up
COT 6401 The Analysis of Algorithms
Midterm Test
Open books and notes
Name |- SSN |1. 25 A k-combination of an n-set S is simply a k-subset of S . For example,
fab; ac; ad; bc; bd; cdg is the 2-combination of the 4-set fa; b; c; dg. Write a pseudocode
to
COT 6401 The Analysis of Algorithms
April 25, 2000
open books and notes
Final Test
Name |- SSN |1. 20 For the following weighted, directed graph
run FASTER-ALL-PARIS-SHORTEST-PATHS algorithm.
run FLOYD-WARSHELL algorithm.
10
a
d
13
2
5
9
1
b
3
c
4
i
quest
COT 6401 The Analysis of Algorithms
Midterm Test
Open books and notes
Name |- SSN |1. 25 Suppose that the function is de ned for all power of 2 and is described by the
following recurrence equation and base case:
F
= , 2 + 2 2
Fn
n
F n=
1 = 1
a Find an e
COT 6401 Analysis of Algorithms
Homework #4
by Changfu Wu
P.1/2
18-2 Making binary search dynamic
[Solution]
a. To perform search operation for this structure, we can just perform binary search
for each of the sorted arrays till we find the data we are se
Analysis of Algorithm, Homework 4
Fei Dai
SS 900-01-9382
November 20, 2001
1. Making binary search dynamic
Binary search of sorted array takes logarithmic search time, but the time to insert a new element
is linear in the size of the array. We can improve
r'tnor mm octets-one 255
Problem 5 [25 points]
This is the same problem as Exercise 23.13. except that in that exercise the
comparators are already sorted.
Professor Bumstead draws an nainput comparison network with or com
parators according to the fol
COT 6401
The Analysis of Algorithms
Presentation Schedule
Final Report Due: April 27
Each report includes a set of presentation slides followed by a report (20-30 pages) with
a minimum of 3 references.
1. April 20: F. Padron, Y. Zhao, and A. Mihnea (20 mi
On Sorting an Intransitive Total Ordered Set Using Semi-Heap
Jie Wu
Department of Computer Science and Engineering
Florida Atlantic University
Boca Raton, FL 33431
[email protected]
Abstract
1
The problem of sorting an intransitive total ordered set,
a gene
COT 6401 The Analysis of Algorithms
Midterm Test
Open books and notes
Name |- SSN |1. 25 Suppose that the function is de ned for all power of 2 and is described by the
following recurrence equation and base case:
F
= , 2 + 2 2
Fn
n
F n=
1 = 1
a Find an e
COT 6401 The Analysis of Algorithms
April 25, 2000
open books and notes
Final Test
Name |- SSN |1. 20 For the following weighted, directed graph
run FASTER-ALL-PARIS-SHORTEST-PATHS algorithm.
run FLOYD-WARSHELL algorithm.
10
a
d
13
2
5
9
1
b
3
c
4
i
quest
COT 6401 The Analysis of Algorithms
Midterm Test
Open books and notes
Name |- SSN |1. 25 A k-combination of an n-set S is simply a k-subset of S . For example,
fab; ac; ad; bc; bd; cdg is the 2-combination of the 4-set fa; b; c; dg. Write a pseudocode
to