Faculty Profile

Grant Braught

Professor of Computer Science (1997)

Contact Information

on sabbatical Spring 2017


Tome Scientific Building Room 234


His current research interests are in the area of artificial life. In particular his research focuses on the interactions between learning and evolution. His other research interests include social, evolutionary and developmental robotics; swarm intelligence and biologically inspired artificial intelligence. He is also active in computer science education, focusing most recently on evaluating the effects of pair programming on student programming ability in the first computer science course.


  • B.S., Dickinson College, 1990. M.S., Pennsylvania State University, 1995
  • Ph.D., Nova Southeastern University, 2005

2015-2016 Academic Year

Fall 2015

COMP 132 Computer Science II w/Lab
A problem-solving course that utilizes object-based software design using Java. Topics include code modularity and reusability, recursion, data storage, and the empirical and theoretical comparison of elementary algorithms. The lab component focuses on programming as a tool for solving problems and simulating real-world events. Prerequisite: 131 or one year of object oriented programming in Java and instructor's permission. Three hours classroom and two hours laboratory a week. Offered every semester.

COMP 203 Robotics
This course aims to provide an exciting and engaging introduction to mobile robotics. It takes a heavily hands-on approach in which you will be programming robots to complete challenges. Only the technical details necessary to get started with each hands-on challenge will be presented in lecture format. The majority of your learning will occur through conversation, discussion, research and programming the robots. Supplemental readings will be used to develop a broader view of the field of mobile robotics.

COMP 251 Computer Organization
Completion of both COMP 251 and COMP 332 fulfills the WR Requirement.

Spring 2016

COMP 232 Data Struct & Problem Solving
An advanced problem-solving course that focuses on the design and analysis of data structures including lists, stacks, queues, trees, and hash tables. Concepts in generic programming are also introduced. The lab component focuses on the implementation of data structures and their application to solving complex problems. Prerequisite: 132. Three hours of classroom and two hours laboratory a week. Offered every spring.