Algorithm Design Project 3
Jing Han
JIH75@pitt.edu
1a.
Pseudo Code:
Function iso(int[] degree1,int[] degree2,int l, int num)degree1, degree2 are two arrays of
nodes, l is a number chosed, num is the number of nodes
cfw_
Initialize boolean is = false;
Init

Algorithm Assignment 2
Jing Han
JIH75@pitt.edu
READ NUMBER
IF number is not a decimal number THEN
PRINT Not a decimal number
RETURN
END IF
IF number > 0 THEN
PRINT Positive number
ELSE
IF number < 0 THEN
PRINT Negative number
END IF
SET negativeToken to 0

INFSCI 2591: Algorithm Design
Fall 2015
Due: December 17, 2015
Problem 1: [20 points]
Floyds algorithm is one possible solution to the all-pairs shortest path problem. There are
different approaches to parallelize Floyds algorithm. Suggest one approach fo

Page 49: 36
Consider the following algorithm:
int any_equal ( int n , int A[ ] [ ] ) cfw_
index i , j , k ,m;
for ( i = 1 ; i <= n ; i+)
for ( j = 1 ; j <= n ; j+)
for ( k = 1 ; k <= n ; k+)

INFSCI 2591: Algorithm Design
Assignment#2
Due: October 1, 2015
Write a pseudo-code for a program that reads in a string and indicates:
(a) whether the string is a decimal number or not;
(b) if it is a decimal number, whether the number is positive, negat

INFSCI 2591: Algorithm Design
Project 1
Due: September 24, 2015
Write a program for the Rectangle Multiplication algorithm. You may code the algorithm
in any language of your choice. Your program must allow for both positive and negative
multiplicands and

INFSCI 2591: Algorithm Design
Project 2: Optimization Algorithms
Due: October 15, 2015
The objectives of this project are: (a) to learn designing and implementing optimization
algorithms (greedy and dynamic programming) and (b) to learn designing and impl

INFSCI 2710 Database Management, Fall 2015
Homework 2: SQL
SOLUTION
Section 2, Tuesdays
160 pts
Due Date: Tue 10/13, at the beginning of the class.
Note: Use MySQL to answer all questions. For each question you need to provide the SQL
query and also the s

41. Give an algorithm for the following problem. Given a list of n distinct positive
integers, partition the list into two sublists, each of size n/2, such that the difference
between the sums of the integers in the two sublists is minimized. Determine th