Honors Research

The Commonwealth Honors College thesis or project is intended to provide students with the opportunity to work closely with faculty members to define and carry out in-depth research or creative endeavors. It provides excellent preparation for students who intend to continue their education through graduate study or begin their professional careers. The student works closely with their 499Y Honors Research sponsor to pursue research on a topic or question of special interest to them in preparation for writing a 499T Honors Thesis or completing a 499P Honors Project.

Honors Thesis

Honors Thesis expectations are high. The intended end-product is a traditional research manuscript with accompanying artifact(s), all theses: - are 6 credits or more of sustained research on a single topic, typically conducted over two semesters. - begin with creative inquiry and systematic research. - include documentation of substantive scholarly endeavor. - culminate in an oral defense or other form of public presentation.

Honors Project

Honors Project expectations are high. The intended end-product is a traditional project manuscript with accompanying artifact(s), all projects: - are 6 credits or more of sustained research on a single topic, typically conducted over two semesters. - begin with creative inquiry and systematic research. - include documentation of substantive scholarly endeavor. - culminate in an oral defense or other form of public presentation.

Software Engineering

In this course, students learn and gain practical experience with software engineering principles and techniques. The practical experience centers on a semester-long team project in which a software development project is carried through all the stages of the software life cycle. Topics in this course include requirements analysis, specification, design, abstraction, programming style, testing, maintenance, communication, teamwork, and software project management. Particular emphasis is placed on communication and negotiation skills and on designing and developing maintainable software.

Introduction to Algorithms

The design and analysis of efficient algorithms for important computational problems. Emphasis on the relationships between algorithms and data structures and on measures of algorithmic efficiency. Sorting (heapsort, mergesort, quicksort), searching, graph algorithms. Experimental analysis of algorithms also emphasized. Use of computer required.

Introduction to Algorithms

The design and analysis of efficient algorithms for important computational problems. Emphasis on the relationships between algorithms and data structures and on measures of algorithmic efficiency. Sorting (heapsort, mergesort, quicksort), searching, graph algorithms. Experimental analysis of algorithms also emphasized. Use of computer required.
Subscribe to