UTexas

Search Results

Search Results for "C S 331"

Computer Science: Integrated Program (BSCompSci/MSCompSci)

https://catalog.utexas.edu/undergraduate/programs/computer-science-integrated-program-bscompsci-mscompsci/

Undergraduate

The Department of Computer Science offers integrated programs to enable currently enrolled, highly motivated undergraduate students with strong intellectual capacities to earn a Bachelor of Science and a Master of Science in Computer Science within a five-year period. The integrated program is designed to prepare students for competitive doctoral programs and provide strong leadership skills and technical depth to students entering professional positions.

Computer Science, Turing Scholars Honors (BSCompSci)

https://catalog.utexas.edu/undergraduate/programs/computer-science-turing-scholars-honors-option-bscompsci/

Undergraduate

The Department of Computer Science offers a comprehensive honors degree program for highly motivated and talented students. The key features of the program are an intensive, accelerated freshman- and sophomore-year program; special Turing Scholars sections of many advanced computer science courses; a second-semester freshman-year course that introduces students to the research activities of the department; and at least two semesters of supervised research and writing. Upon completion of both a sequence of Turing Scholars courses, approved by the program director, and an approved thesis, students graduate as Turing Scholars in Computer Science.  Students in the Turing Scholars program pursue the Bachelor of Science in Computer Science. 

Social Work (BSW)

https://catalog.utexas.edu/undergraduate/programs/social-work-bsw/

Undergraduate

This program offers basic courses designed to provide students with concentrated and in-depth educational experience combining social work knowledge and practice skills. The requirements are designed to give the student an opportunity for integrated, nonrepetitive learning. The prescribed work provides the liberal arts base for the social work curriculum. 

C S X31 C S 331  Algorithms and Complexity  3 Hours

4 Lecture Hours  0 Lab Hours  
An investigation of algorithmic paradigms: divide and conquer, dynamic programming, greedy algorithms, graph algorithms, randomized algorithms, undecidability, NP-completeness, and approximation algorithms. Only one of the following may be counted: Computer Science 331, 331H, 378 (Topic: Algorithms and Complexity). Three lecture hours and one discussion hour a week for one semester.
Pre/Corequisites: The following coursework with a grade of at least C-: Computer Science 429 or 429H; Mathematics 362K or Statistics and Data Sciences 321; and credit with a grade of at least C- or registration for: Mathematics 340L, 341, or Statistics and Data Sciences 329C.  
Grading: Student Option  
Repeatable for credit: No  
Academic Level: Upper Division