Honors Thesis Program
The Honors Thesis Program is a year-long course that provides academically ambitious and motivated undergraduates with the opportunity to conduct and carry out a substantial research project under the supervision of a Government faculty member. Students who successfully complete their thesis and other requirements are eligible for graduation with Departmental Honors/Special Honors in Government.
Admission Requirements for Honors Thesis Program:
-- GPA: 3.50 minimum average in Government coursework
-- GPA: 3.00 minimum overall at the University
-- 15 semester hours of Government courses completed (upon entering the Honors Thesis Program)
-- 60 semester hours completed at the University (upon entering the Honors Thesis Program)
Honors Thesis Program Brochure
2014-2015 Honors Thesis Program Application
The Department of Government also offers honors seminars (GOV 379S) to undergraduates seeking to take more challenging and rigorous courses taught by the most distinguished faculty in the department. These courses are separate from the Honors Thesis Program and do not lead to the Special Honors in Government designation.
GOV 379S courses are usually offered in both Fall and Spring. You do not need to be in the Honors Thesis Program (or LAH) in order to take GOV 379S. However, you must meet the minimum admission requirements AND seek the approval of the departmental advisors. Students interested in enrolling in GOV 379S must visit the Government Undergraduate Advising Office (BAT 2.102) to complete a seat reservation form.
Admission Requirements for Honors Seminars:
--GPA: 3.50 minimum average in Government coursework
--GPA: 3.00 minimum overall at the University
--Minimum of 30 hours of coursework (including 6 semester hours of GOV) --
If you have any questions regarding the Honors Thesis Program or Honors Seminars, please contact the advising office.
2014 William Jennings Bryan Prize Winner For Best Honors Thesis
"Visible Effects of Affirmative Action: An Analysis of Print Media in Brazil"Advisor: Daniel Brinks