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 graded as incorrect.
1. Suppose a CS curriculum consist
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 graded as incorrect.
1. Is 2k+1 = O(2k )? Is 2k = (22k
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 exam will be short
answer and work-out problems. You may
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
Disjunct/Conjunct melodies
Counterpoint
Polyphony
Note/to
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
recite
recognize
record
Relate
(quantitative)
report
select
CSCE 411: Design and Analysis of Algorithms
Course Schedule
Spring 2017
January 23, 2017
Daily Schedule
Below, are the topics that were covered during each day of lecture. For a preview of upcoming course topics
that will be covered, please see the list o
CSCE 411: Design and Analysis of Algorithms
Study Guide for Exam #1
February 24, 2017
1. Exam Format. There are two parts to Exam #1.
Part I. The first part of the exam will be Wednesday, March 1st. The exam will be short
answer and work-out problems. Yo
CSCE 452 Intro to Robotics
CSCE 452: Lecture 1
Introduction,
Homogeneous Transformations,
and Coordinate frames
Introduction
CSCE 452 Intro to Robotics
Robots in movie
2
Modern Robots
Robot in life
CSCE 452 Intro to Robotics
Industry
Medical
3
Modern
Department
of
Statistics
TEXAS A&M UNIVERSITY
STAT 211
Instructor: Keith Hatfield
1
Topic 1: Data collection and
summarization
Populations and samples
Frequency distributions
Histograms
Mean, median, variance and standard
deviation
Quartiles, interquarti
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 3:00pm3:50pm, HRBB 113
WF 11:00am12:00pm and by appoint
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 graded as incorrect.
1. Is 2k+1 = O(2k )? Is 2k = (22k
Dalton Harris
CSCE 411.502 - Homework 1
Due: Monday, September 12, 2016
Sources: Carnegie-Mellon CS Slides, Stony Brook CS Slides
Colleagues: Chris Foy
Solution 1. .
Part 1: By definition of notation, we must find positive constants c and n0
such that:
cg
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 scanned)
On the first page include
Your name
Class a
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 the first page include
Your name
Class and assignment
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] < 2t, so the binary search time for each
node is O(log
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 symmetry. Suppose we flip
a coin twice; if it comes up
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 would depend on the number of
pushes or pops that could be
CSCE 411: Design and Analysis of Algorithms
Elementary Graph Algorithms
Dr. Tiffani L. Williams
Department of Computer Science & Engineering
Texas A&M University
Spring 2017
What is a graph?
A graph G is a pair (V , E ), where V is a set of vertices (or n
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 Merge-Sort algorithm on the input array A[0.7] = [22, 18,
CSCE 411: Design and Analysis of Algorithms
Brute Force and Exhaustive Search Algorithms
Dr. Tiffani L. Williams
Department of Computer Science & Engineering
Texas A&M University
Spring 2017
Introduction
Straightforward way to solve a problem, based on th
CSCE 411: Design and Analysis of Algorithms
Homework #4
Due Date: June 26, 2014
Algorithm Design Requirements
When writing out an algorithm, please give a high-level description/summary. Pseudocode
that resembles code or follows the format in your textboo
CSCE 411: Design and Analysis of Algorithms
Homework #5
Due Date: July 2, 2014
Algorithm Design Requirements
When writing out an algorithm, please give a high-level description/summary. Pseudocode
that resembles code or follows the format in your textbook
CSCE 411: Design and Analysis of Algorithms
Homework #3
Due Date: June 18, 2014 at 11:59 pm
Directions. Please submit this assignment using eCampus.
Objective. The objective of this assignment is implement di erent algorithms for solving
the maximum subar
Solutions to Homework 6
Debasish Das EECS Department, Northwestern University [email protected]
1
Problem 5.24
We want to find light spanning trees with certain special properties. Given is one example of light spanning tree. Input: Undirected graph G
3. 23-4 on Page 577
In this problem, we give pseudocode for three different algorithms. Each one takes a
graph as input and returns a set of edges T. For each algorithm, you must either prove
that T is a minimum spanning tree or prove that T is not a mini
CSE 101: Design and Analysis of Algorithms
Winter 2014
Homework 2
Due: January 30, 2014
1. (CLRS textbook, Exercises 4.1-6 and 4.2-2.) Solve the following recurrences:
(a) T (n) = 2T ( n) + 1
[Hint: Make a change of variables.]
(b) T (n) = T (n/3) + T (2n
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 can pass through
v. Show how to transform a flow network
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 G. We say that
the value of the bottleneck spanning tr
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, there may or
may not be a rivalry. Suppose we have n profes