Link to TU homepage

Visit
Apply
Request Info
Give

About the University
Admission & Financial Aid
Academics
Colleges & Schools
Student Life
Campus Living
Research

Visit
Apply
Request Info
Give

Prospective Students
Undergraduate Graduate Law Veterans
Current Students
IT Help Hurricane Hub Login HARVEY (Blackboard) Self Service
Faculty & Staff
Cane Cares Hurricane Hub Human Resources
Alumni & Friends
TUALUMNI.com Homecoming 2022 Make a gift
Parents & Families
Email Updates Explore Tulsa
Community
Employment Event Calendar Contact TU

Filter Results

Common Questions

How much does TU cost?
What majors are offered?
How do I interview for admission?
How do I schedule a visit?
How can I transfer to TU?
Where is the new student checklist?
How do a request a transcript?
Where can I find job listings?
How do I make a gift to TU?
How do I login to the TU Portal?
Where can I find the Course Catalog?
Where is the Academic Calendar?
How do I find out about events at TU?
Where can I find information about disability accommodations?

Colleges

Arts & Sciences
Business
Engineering & Computer Science
Health & Natural Sciences
Graduate School
Law

Resources

News
Events
Subscribe

Link to Facebook
Link to Twitter
Link to Instagram
Link to YouTube
Link to Snapchat
Link to LinkedIn

Resources

Visit
Apply
Offices
News & Media
Contact TU

800 S. Tucker Drive Tulsa, OK 74104

SITE POLICIES

Accreditation
Privacy Policy
Cookie Policy
Social Media Policy

We use cookies on our website to give you the most relevant experience by remembering your preferences and repeat visits. By clicking “Accept”, you consent to the use of ALL the cookies.

Cookie settings ACCEPT

Privacy & Cookies Policy

Privacy Overview

This website uses cookies to improve your experience while you navigate through the website. Out of these cookies, the cookies that are categorized as necessary are stored on your browser as they are essential for the working of basic functionalities of the website. We also use third-party cookies that help us analyze and understand how you use this website. These cookies will be stored in your browser only with your consent. You also have the option to opt-out of these cookies. But opting out of some of these cookies may have an effect on your browsing experience.

Necessary

Always Enabled

Necessary cookies are absolutely essential for the website to function properly. This category only includes cookies that ensures basic functionalities and security features of the website. These cookies do not store any personal information.

Non-necessary

Any cookies that may not be particularly necessary for the website to function and is used specifically to collect user personal data via analytics, ads, other embedded contents are termed as non-necessary cookies. It is mandatory to procure user consent prior to running these cookies on your website.

SAVE & ACCEPT

University of Tulsa

Jan 15, 2025

2021-2022 Undergraduate Bulletin

Select a Bulletin

Global Search Bulletin Search
Choose Search Location

Search Keyword Field

Whole Word/Phrase
Advanced Search

Catalog Navigation

Bulletin Home

All Programs

All Courses

The Henry Kendall College of Arts and Sciences

The Collins College of Business

The College of Engineering and Natural Sciences

The Oxley College of Health Sciences

The College of Law

Undergraduate Interdisciplinary and Pre-professional Programs

Academic Calendar

Accreditation and Assessment

Admission

Undergraduate Education at The University of Tulsa

Academic Policies

Tuition and Fees

Student Services

Student Rights, Freedoms and Responsibilities

Resident Faculty

My Bulletin

HELP

2021-2022 Undergraduate Bulletin [ARCHIVED BULLETIN]

Print-Friendly Page (opens a new window)

Facebook this Page (opens a new window)

Tweet this Page (opens a new window)

Add to Bulletin (opens a new window)

CS 5353 Analysis of Algorithms

(3 hours)

Design and analysis of efficient algorithms. Design techniques including recursion, divide-and- conquer, and dynamic programming. Applications include sorting, searching, dynamic structures, path finding, fast multiplication. Non-deterministic algorithms. Computationally hard problems. NP-completeness. Prerequisites: CS 2123 and CS 3013 .

Facebook this Page (opens a new window)

Tweet this Page (opens a new window)

Add to Bulletin (opens a new window)