CSCE 411 Homework 4
Natalie Cluck
February 19, 2016
1
22.2-7
There are two types of professional wrestlers: babyfaces (good guys) and
heels (bad guys). Between any pair of professional wrestlers, ther
CSCE 411: Design and Analysis of Algorithms
Homework #2
Due Date: June 13, 2014
Directions. Please answer all questions below. Please make sure your handwriting is legible.
Unreadable answers will be
CSCE 411: Design and Analysis of Algorithms
Homework #1
Due Date: June 10, 2014
Directions. Please answer all questions below. Please make sure your handwriting is legible.
Unreadable answers will be
Dalton Harris
CSCE 411.502 - Homework 3
Due: Wednesday, September 28, 2016
Sources: Rochester Institute of Technology Slides (cs.rit.edu)
Colleagues:
Solution 1. .
The number of keys in each node n[x]
CSCE 411.502-F16:
Homework 2
Due: In class on Wednesday, Sep. 21, 2016
Instructions:
Type your answers, print them out, and turn in that paper copy (neat pictures may be hand-drawn and scanned)
On t
CSCE 411.502-F16:
Homework 4
Due: In class on Wednesday, Oct. 5, 2016
Max Score: 100
Instructions:
Type your answers, print them out, and turn in that paper copy (neat pictures may be hand-drawn and
CSCE 411: Design and Analysis of Algorithms
Exact String Matching
Dr. Tiffani L. Williams
Department of Computer Science & Engineering
Texas A&M University
Spring 2017
Exact String Matching: Definitio
CSCE 411: Design and Analysis of Algorithms
Merge-Sort execution and recursion tree analysis
February 24, 2017
1
Tracing the execution of the Merge-Sort algorithm
Below is an annotated trace of the Me
CSCE 411: Design and Analysis of Algorithms
Spring 2017
January 18, 2017
Instructor:
Email:
Lecture:
Office Hours:
1
Dr. Tiffani L. Williams, HRBB 328C (office), 845-7977 (phone)
[email protected]
MWF
CSCE 411: Design and Analysis of Algorithms
Study Guide for Exam #2
April 16, 2017
1. Exam Format. There are two parts to Exam #1.
Part I. The first part of the exam will be Friday, April 21st. The e
Dalton Harris
CSCE 411.502 - Homework 6
Due: Wednesday, October 26, 2016
Sources: West Virginia University CSEE, Harvard EECS
Colleagues:
Solution 1. .
With von Neumann, we approach this problem with
Dalton Harris
CSCE 411.502 - Homework 7
Due: Wednesday, November 2, 2016
Sources: cs.helsinki.fi, mason.gmu.edu, csie.ntu.edu.tw
Colleagues:
Solution 1. .
No. The time complexity of the operations wou
CSCE 411: Design and Analysis of Algorithms
Matrix Multiplication Algorithms
March 7, 2017
1
A Divide-and-Conquer Algorithm
Below, is a divide-and-conquer algorithm for multiplying two n n matrices. P
CSCE 411: Design and Analysis of Algorithms
Transform-and-Conquer
Dr. Tiffani L. Williams
Department of Computer Science & Engineering
Texas A&M University
Spring 2017
General Idea of Transform & Conq
CSCE 411: Design and Analysis of Algorithms
Final Class
Dr. Tiffani L. Williams
Department of Computer Science & Engineering
Texas A&M University
Spring 2017
We covered a lot of material!
Algorithms:
CSCE 411: Design and Analysis of Algorithms
Dynamic Programming
Dr. Tiffani L. Williams
Department of Computer Science & Engineering
Texas A&M University
Spring 2017
Fibonacci Numbers
Recursive formul
CSCE 411: Design and Analysis of Algorithms
Asymptotic Analysis, Back Substitution, and the Master Theorem
Dr. Tiffani L. Williams
Department of Computer Science & Engineering
Texas A&M University
Spr
CSCE 411: Design and Analysis of Algorithms
Induction Proofs
March 27, 2017
1
Induction Proofs and Ladders
When you think of induction, one of the best analogies to think about is a ladder. When you c
CSCE 411: Design and Analysis of Algorithms
NP-Completeness Proof for 3-SAT
April 30, 2017
1
SAT p 3-SAT
Theorem. 3-SAT is NP-Complete.
Proof. First, we show that 3-SAT is in NP. Then, we prove that i
CSCE 411: Design and Analysis of Algorithms
How to Design Algorithms
Spring 2017
Note: The following material was extracted almost verbatim from The Algorithm Design Manual [2], pages 356360.
1
Introd
CSCE 411: Design and Analysis of Algorithms
Repeated (or back) substitution and mathematical induction
March 22, 2017
1
How to use repeated substitution to solve a recurrence exactly.
Suppose we want
Dalton Harris
CSCE 411.502 - Homework 5
Due: Wednesday, October 19, 2016
Sources: Journey to the 4.0s Blogspot, UT Arlington Lecture Slides, Brazil
Departmento de Informatica, University of Pittsburgh
This document is protected by copyright.
You are not allowed to distribute share or copy any portion of it without consent.
Isaac Bustos
EXAM 1 Review
Musical Terms and Definitions
Intervals
Melody
Di
BCChew2013
Verbs used to construct a good research objective for Undergraduate or
Postgraduate Dissertation
Knowledge
cite
count
define
describe
draw
identify
indicate
list
name
point
quote
read
recit
CSCE 411 Homework 13
Natalie Cluck
April 28, 2016
1
34.2-10
This is the same to showing P = N P , which implies N P = co N P .
Assume P = N P . Let L co N P . L0 N P , but since NP = P, L0 P .
L = L00
CSCE 411 Homework 6
Natalie Cluck
March 3, 2016
1
23-3 (a)
A bottleneck spanning tree T of an undirected graph G is a spanning tree of G
whose largest edge weight is minimum over all spanning trees of
CSCE 411 Homework 7
Natalie Cluck
March 24, 2016
1
26.1-7
Suppose that, in addition to edge capacities, a flow network has vertex capacities. That is each vertex v has a limit l(v) on how much flow ca