Sarah Miracle portrait

Sarah Miracle

Assistant Professor
Degree
Ph.D., 2015, Algorithms, Combinatorics and Optimization, Georgia Institute of Technology
M.S., 2003, Computer Science, Vanderbilt University
B.E., 2003, Computer Engineering and Math, Vanderbilt University
Office
OSS 411
Phone
(651) 962-5487
Toll Free
(800) 328-6819 ext. 5487
Mail
University of St. Thomas
Mail Number OSS 402
2115 Summit Avenue
St. Paul, MN 55105

Professional Interests

Randomized algorithms, sampling, and Markov chains.

Fall 2018 Courses

Fall 2018 Courses
Course - Section Title Days Time Location
CISC 131 - 02 Intro-Programming&Prob Solving See Details * *

Days of Week:

See Details

Time of Day:

*

Location:

*

Course Registration Number:

41403 (View in ClassFinder)

Credit Hours:

4 Credit Hours

Instructor:

Sarah B. Miracle

This course is designed for students with majors in the Department of Computer and Information Sciences and focuses on logical thinking, the design and implementation of algorithms in a procedural language, testing, correctness, and the use of common programming structures such as arrays. In addition, basic machine concepts are covered including hardware organization and representation of information in the machine. The typical student will be adept at using the computer but will have no prior programming experience. Engineering and science majors should take CISC 130. Please see your academic advisor to ensure you select the appropriate class. Lab included. NOTE: Students who receive credit for CISC 131 may not receive credit for CISC 130 Prerequisite: Placement into MATH 108 or higher or completion of STAT 220 with a C- or better, or completion of one of: MATH 108, 109, 113, 114, or 200

Schedule Details

Location Time Day(s)
OSS 4291215-1320M - W - F - -
OSS 4281330-1510- - - R - - -
CISC 231 - 01 Data Structures-Object Design M - W - F - - 0935 - 1040 OSS 432

Days of Week:

M - W - F - -

Time of Day:

0935 - 1040

Location:

OSS 432

Course Registration Number:

40630 (View in ClassFinder)

Credit Hours:

4 Credit Hours

Instructor:

Sarah B. Miracle

Presents the fundamental suite of data structures and the algorithms used to implement them. Topics include: abstract data types, algorithm development and representation, searching, sorting, stacks, queues, lists, trees, measuring algorithm complexity, object-oriented design and implementation of moderately large and complex systems. Course assumes the student has proficiency in object-oriented specification, design, and implementation. Prerequisites: A minimum grade of C- in CISC 230, and MATH 128 (may be taken concurrently)

Schedule Details

Location Time Day(s)
CISC 380 - D01 Algorithms M - W - F - - 0815 - 0920 OSS 431

Days of Week:

M - W - F - -

Time of Day:

0815 - 0920

Location:

OSS 431

Course Registration Number:

42680 (View in ClassFinder)

Credit Hours:

4 Credit Hours

Instructor:

Sarah B. Miracle

Introduction to the design and analysis of algorithms. Course topics include the following algorithm design paradigms: divide and conquer, graph algorithms, dynamic programming, and greedy algorithms. The course will also give an introduction to computational complexity, including NP-completeness and the P versus NP problem. Prerequisites: MATH 128 and, a C- or better in CISC 231

Schedule Details

Location Time Day(s)

J-Term 2019 Courses

J-Term 2019 Courses
Course - Section Title Days Time Location

Spring 2019 Courses

Spring 2019 Courses
Course - Section Title Days Time Location
CISC 131 - 01 Intro-Programming&Prob Solving See Details * *

Days of Week:

See Details

Time of Day:

*

Location:

*

Course Registration Number:

20517 (View in ClassFinder)

Credit Hours:

4 Credit Hours

Instructor:

Sarah B. Miracle

This course is designed for students with majors in the Department of Computer and Information Sciences and focuses on logical thinking, the design and implementation of algorithms in a procedural language, testing, correctness, and the use of common programming structures such as arrays. In addition, basic machine concepts are covered including hardware organization and representation of information in the machine. The typical student will be adept at using the computer but will have no prior programming experience. Engineering and science majors should take CISC 130. Please see your academic advisor to ensure you select the appropriate class. Lab included. NOTE: Students who receive credit for CISC 131 may not receive credit for CISC 130 Prerequisite: Placement into MATH 108 or higher or completion of STAT 220 with a C- or better, or completion of one of: MATH 108, 109, 113, 114, or 200

Schedule Details

Location Time Day(s)
OSS 4150815-0920M - W - F - -
OSS 4150800-0940- T - - - - -
CISC 380 - D01 Algorithms M - W - F - - 1215 - 1320 OSS 415

Days of Week:

M - W - F - -

Time of Day:

1215 - 1320

Location:

OSS 415

Course Registration Number:

22365 (View in ClassFinder)

Credit Hours:

4 Credit Hours

Instructor:

Sarah B. Miracle

Introduction to the design and analysis of algorithms. Course topics include the following algorithm design paradigms: divide and conquer, graph algorithms, dynamic programming, and greedy algorithms. The course will also give an introduction to computational complexity, including NP-completeness and the P versus NP problem. Prerequisites: MATH 128 and, a C- or better in CISC 231

Schedule Details

Location Time Day(s)