Long Jiao, PhD

Comprehensive coverage of all major groups of algorithms, including divide-and-conquer, dynamic programming, greedy, backtracking, branch-and-bound, and parallel algorithms. Discussion of the design and implementation of complex, dynamic data structures. The course also covers an introduction to the functional paradigm.

Comprehensive coverage of all major groups of algorithms, including divide-and-conquer, dynamic programming, greedy, backtracking, branch-and-bound, and parallel algorithms. Discussion of the design and implementation of complex, dynamic data structures. The course also covers an introduction to the functional paradigm.

Comprehensive coverage of all major groups of algorithms, including divide-and-conquer, dynamic programming, greedy, backtracking, branch-and-bound, and parallel algorithms. Discussion of the design and implementation of complex, dynamic data structures. The course also covers an introduction to the functional paradigm.

Comprehensive coverage of all major groups of algorithms, including divide-and-conquer, dynamic programming, greedy, backtracking, branch-and-bound, and parallel algorithms. Discussion of the design and implementation of complex, dynamic data structures. The course also covers an introduction to the functional paradigm.

Evaluation of algorithms concerning their time and space complexity. Complexity hierarchies, axiomatic approach to computational complexity, NP complete problems, approximation algorithms for these problems. Requires pre-knowledge from an undergraduate course on algorithms and data structures.

Department seminar presentations by speakers from industry and academia in addition to UMass Dartmouth faculty, and CIS Master student thesis defense presentations that are scheduled during the seminar course time slot. Students are required to attend these presentations and participate in technical discussions and write a report by the end of the semester.

Department seminar presentations by speakers from industry and academia in addition to UMass Dartmouth faculty, and CIS Master student thesis defense presentations that are scheduled during the seminar course time slot. Students are required to attend these presentations and participate in technical discussions and write a report by the end of the semester.

Department seminar presentations by speakers from industry and academia in addition to UMass Dartmouth faculty, and CIS Master student thesis defense presentations that are scheduled during the seminar course time slot. Students are required to attend these presentations and participate in technical discussions and write a report by the end of the semester.

Department seminar presentations by speakers from industry and academia in addition to UMass Dartmouth faculty, and CIS Master student thesis defense presentations that are scheduled during the seminar course time slot. Students are required to attend these presentations and participate in technical discussions and write a report by the end of the semester.

Prerequisites: Completion of three core courses.   Development of a detailed, significant project in computer science under the close supervision of a faculty member, perhaps as one member of a student team. This project may be a software implementation, a design effort, or a theoretical or practical written analysis. Project report with optional oral presentation must be evaluated by three faculty members including the project supervisor.