GT USERNAME:
NAME:
CSE6140 - MIDTERM SOLUTIONS 2015
Instructions: PLEASE WRITE YOUR NAME and GT ACCOUNT ON EACH PAGE. NUMBER EACH
PAGE.
This is an in-class, closed-book exam. However, you are allowed
CSE6140 - Fall 2015
Computational Science & Engineering (CSE)
Algorithms
Homework 4 Solutions
1
Q1: Approximation For Bin Packing (12 points)
a) 4 points - 2 for reduction, 2 for correctness
We prove
Homework 5
November 18, 2015
Problem 1
Let G = (V, E) be a ow network with source s, sink t, and integer capacities. Suppose that we are given a
maximum ow in G.
a) Suppose that the capacity of a sing
CSE 6140 Assignment 1
due Sept. 14, 2015 at 5 pm on t-square
Please upload 1) a PDF with solutions of Problems 1 and 2; 2) a PDF of your
report for Problem 3; 3) a single zip le of your code, README,
CSE 6140 Assignment 1 Solutions
September 30, 2015
1
Greedy
4 points for the correct algorithm
1 point for correct time complexity
2.5 + 2.5 points for the optimal substructure and greedy choice prope
cse6140-f15-hw3-solns
November 2015
NP-Complete [15 points]
NP-membership: 4 points (2 for stating constraints that need to be satised, 2 for polynomial
time argument)
Reduction: 3 points
Poly-time of
Homework 1 Hints
September 11, 2015
1
Greedy
Visualize the leaks as points l1 , l2 .ln lying along a straight line/pipe,
where ln is the location of the nth leak. Let the length of a strip be s.
Des
CSE6140 - Fall 2015
Computational Science & Engineering (CSE)
Algorithms
Homework 4 Solutions
1
Q1: Approximation For Bin Packing (12 points)
a) 4 points - 2 for reduction, 2 for correctness
We prove
CSE 6140 Assignment 1 Solutions
September 30, 2015
1
Greedy
4 points for the correct algorithm
1 point for correct time complexity
2.5 + 2.5 points for the optimal substructure and greedy choice prope
CSE6140 - Fall 2015
Computational Science & Engineering (CSE)
Algorithms
Homework 4
1
Approximation For Bin Packing (12 points)
Suppose that were given a set of n objects, where the size si of the ith
CSE6140 Homework 2
September 2015
1
Scheduling with Weights [10 pts]
The deadline for homework 1 is upon us. The TA sits in front of the computer,
with a mountain of emails from students with doubts.
Homework 3
CSE6140, Fall 2015
October 2015
NP-Complete
Youre conguring a large network of workstations, which well model as an undirected graph G;
the nodes of G represent individual workstations and
Homework 5
November 18, 2015
Problem 1
Let G = (V, E) be a ow network with source s, sink t, and integer capacities. Suppose that we are given a
maximum ow in G.
a) Suppose that the capacity of a sing
CSE 6140: C OMPUTATIONAL S CIENCE AND E NGINEERING A LGORITHMS (FALL 2014)
I NSTRUCTOR : P ROF. B ISTRA D ILKINA
Homework 1: Solutions
P ROBLEM 1: S TRING P ROCESSING (DP)
(a) Let Q(i ) be the segment
CSE 6140
PROJECT
metric Traveling Salesperson Problem
TSP.
Given a set of n cities and a pairwise distance function d(u,
v), is there a tour of length D?
Optimal TSP tour
Reference: http:/www.tsp.gate
CSE 6140
coping with NP-completeness
backtracking
Exact Solution Strategies
exhaustive search (brute force)
useful only for small instances
backtracking
Construct the alternatives component by compone
CSE6140 Homework 2
September 2015
1
Scheduling with Weights [10 pts]
The deadline for homework 1 is upon us. The TA sits in front of the computer,
with a mountain of emails from students with doubts.
CSE 6140:
Computa0onal Science and Engineering
ALGORITHMS
review
Project Presenta0ons
3-4 minutes per team (make sure you do not take more than 4
minutes)
Highlight o
Minimum_strips (L, length)cfw_ /L represents an array which records each length eaks
position on the seam, length represents the length of the water pipe
i <- 0
SLS METHODS
Stochastic Local Search (SLS) is a widely used approach to solving hard
combinatorial optimisation problems. Underlying most, if not all, specific SLS
algorithms are general SLS methods th
CSE6140 Fall2015 Project
November 18, 2015
1
Overview
The Minimum Vertex cover (MVC) problem is a well known NP-complete problem with numerous applications in computational biology, operations researc
CSE 6140 Assignment 3
due Oct 24, 2017 at 6pm on T-Square
(First submission due Oct 22, updates can be done afterwards until deadline)
October 6, 2017
Please read and follow all instructions carefully
CSE 6140 Assignment 1
due Sept. 18, 2017 at 6pm on T-Square
Please upload:
1) a PDF cover letter indicating with whom you worked (if applicable), the
sources you used, and if you wish, your impression
Solutions for Q1-Q3
Zongyi Li
GTid: 903351833
September 18, 2017
1
Q1: Algorithm Design and Complexity
(1) For time complexity O(log(n), we use Binary Search Algorithm to find the
lowest floor.
Steps:
CSE 6140 Assignment 2
due Oct 1st, 2017 at 6pm on T-Square
September 16, 2017
Please upload:
1) a PDF cover letter indicating with whom you worked (if applicable), the
sources you used, and if you wis
CSE 6140 Assignment 2
Zongyi Li
GTid: 903351833
October 1, 2017
1
Scheduling with Weights
a) It is not optimal.
Suppose j=4, and ti = cfw_2, 2, 2, 4, wi = cfw_1, 9, 9, 9.
If we use greedy by smallest