Math 322: Algorithm Design and Optimization 2 - Revision history

Dac47: /* Title */

2015-05-04T21:07:51Z

‎Title

Dac47: moved Math 322: Computation & Optimization 2 to Math 322: Algorithm Design and Optimization 2

2015-05-04T21:07:17Z

moved Math 322: Computation & Optimization 2 to Math 322: Algorithm Design and Optimization 2

Ls5: moved Math 322 to Math 322: Computation & Optimization 2

2013-04-03T22:19:37Z

moved Math 322 to Math 322: Computation & Optimization 2

Ls5: /* (Credit Hours:Lecture Hours:Lab Hours) */

2012-06-13T21:51:40Z

‎(Credit Hours:Lecture Hours:Lab Hours)

Ls5: /* Description */

2012-06-13T20:12:07Z

‎Description

Ls5: /* Minimal learning outcomes */

2012-06-13T19:51:36Z

‎Minimal learning outcomes

Ls5: /* Minimal learning outcomes */

2012-06-06T19:52:40Z

‎Minimal learning outcomes

Ls5: /* Prerequisites */

2012-06-06T19:51:14Z

‎Prerequisites

Ls5: /* Catalog Information */

2012-06-06T19:51:09Z

‎Catalog Information

Cpg: Created page with "== Catalog Information == === Title === === (Credit Hours:Lecture Hours:Lab Hours) === === Offered === === Prerequisite === === Description === == Desired Learning Outcomes..."

2012-06-06T18:25:55Z

Created page with "== Catalog Information == === Title === === (Credit Hours:Lecture Hours:Lab Hours) === === Offered === === Prerequisite === === Description === == Desired Learning Outcomes..."

New page

== Catalog Information ==

=== Title ===

=== (Credit Hours:Lecture Hours:Lab Hours) ===

=== Offered ===

=== Prerequisite ===

=== Description ===

== Desired Learning Outcomes ==

=== Prerequisites ===

=== Minimal learning outcomes ===

=== Textbooks ===
Possible textbooks for this course include (but are not limited to):

*

=== Additional topics ===

=== Courses for which this course is prerequisite ===

[[Category:Courses|322]]

@@ Line 14: / Line 14: @@
 === Description ===
-A treatment of algorithms used to solve dynamic programming problems and advanced computing problems.  Specific topics include finite-horizon and infinite-horizon dynamic programming, discrete transforms, compressed sensing, heuristics, branch and bound, conditioning and stability.
+Algorithms used to solve dynamic programming problems and advanced computing problems. Topics include finite-horizon and infinite-horizon dynamic programming, discrete transforms, compressed sensing, heuristics, branch and bound, conditioning and stability.
 == Desired Learning Outcomes ==

@@ Line 31: / Line 31: @@
 #*Numerical Techniques
 #*Applications
-#*Discrete Transforms
+#Discrete Transforms
 #*z-Transforms
-# Discrete Cosine Transform
+#* Discrete Cosine Transform
 #*Fast Fourier Transform (FFT) (including convolutions)
 #*Shannon-Nyquist Theorem, including Gibbs Phenomenon

← Older revision		Revision as of 19:52, 6 June 2012
Line 22:		Line 22:

	=== Minimal learning outcomes ===		=== Minimal learning outcomes ===
		+	Students will have a solid understanding of the concepts listed below. They will be able to prove many of the theorems that are central to this material. They will understand the model specifications for the algorithms, and be able to recognize whether they apply in the context of a given application or not. They will be able to perform the relevant computations on small, simple problems. They will be able to describe the algorithms well enough that they could program simple versions of them, and will have a basic knowledge of the computational strengths and weaknesses of the algorithms covered.
		+
		+	# Dynamic Programming
		+	#* Finite-Horizon Problems
		+	#*Infinite-Horizon Problems
		+	#*Uncertain Stopping Times
		+	#*Value and Policy Iteration
		+	#*Numerical Techniques
		+	#*Applications
		+	#*Discrete Transforms
		+	#*z-Transforms
		+	# Discrete Cosine Transform
		+	#*Fast Fourier Transform (FFT) (including convolutions)
		+	#*Shannon-Nyquist Theorem, including Gibbs Phenomenon
		+	#*Discrete Wavelet Transforms
		+	# Advanced Algorithms
		+	#*Compressed Sensing
		+	#*Heuristics, Branch and Bound
		+	# Conditioning and Stability
		+	#*Conditioning
		+	#*Forward Stability
		+	#*Backward Stability

	=== Textbooks ===		=== Textbooks ===

← Older revision		Revision as of 19:51, 6 June 2012
Line 19:		Line 19:

	=== Prerequisites ===		=== Prerequisites ===
		+	[[Math 320]]; concurrent with [[Math 346]], [[Math 323]]

	=== Minimal learning outcomes ===		=== Minimal learning outcomes ===

@@ Line 2: / Line 2: @@
 === Title ===
-Computation and Optimization 2
+Algorithm Design and Optimization 2
 === (Credit Hours:Lecture Hours:Lab Hours) ===

← Older revision	Revision as of 21:07, 4 May 2015
(No difference)

← Older revision	Revision as of 22:19, 3 April 2013
(No difference)

@@ Line 5: / Line 5: @@
 === (Credit Hours:Lecture Hours:Lab Hours) ===
-(3:3:1)
+(3:3:0)
 === Offered ===