George Washington University
Department of Computer Science
Csci 3212 - Exam 1
75 Minutes (Closed Books)
September 27, 2011
1. (5 pts each) Consider the following list: A = cfw_62, 25, 29, 14, 39, 86. (Show all your works.)
(a) Apply the Mergesort algorit
George Washington University
Department of Computer Science
Csci 3212 - Exam 2
75 Minutes (Closed Books)
November 3, 2011
1. Given an edge-weighted undirected graph G with the vertex set V = cfw_1, 2, , n, nd a shortest
path between every pair of nodes in
Department of Computer Science - George Washington University
CSCI-3212 Algorithms
Fall 2013
Section 30
Solution to HW 5
Khanh Nguyen
1
1.1
Problem 1
Floyds algorithm All pair shortest path algorithm (2pt)
First, construct the adjacency matrix W using the
George Washington University
Department of Computer Science
Csci 3212 - Exam 3
75 Minutes (Closed Books)
December 8, 2011
1. (10 pts.) Design a Human code for the following 6 letters a1 , , a6 with p1 = 30, p2 = 20,
p3 = 20, p4 = 15, p5 = 10, p6 = 5 in wh
CSCI 3212-10, Algorithms
Lecture Note
1
Introduction
Algorithm
What is algorithm?
Validation or correctness
Analysis of complexity (time and space)
How good is the approximation algorithm?
Oine or online algorithms
Centralized or distributed algori