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.

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.

Embedded Computational Systems is a hands-on laboratory for building integrated systems. We develop analytical skills and discuss sensors, motor drivers, I/O, control logic, and operating systems for embedded applications. Students build several individual projects and invent one integrated, semester-long team project.

Embedded Computational Systems is a hands-on laboratory for building integrated systems. We develop analytical skills and discuss sensors, motor drivers, I/O, control logic, and operating systems for embedded applications. Students build several individual projects and invent one integrated, semester-long team project.

Embedded Computational Systems is a hands-on laboratory for building integrated systems. We develop analytical skills and discuss sensors, motor drivers, I/O, control logic, and operating systems for embedded applications. Students build several individual projects and invent one integrated, semester-long team project.

The course introduces and develops methods for designing and implementing abstract data types using the Java programming language. The main focus is on how to implement abstract data collections and their associated operations. Specific implementations include linked structures, recursive structures, binary trees, balanced trees, and hash tables. Algorithm analysis and asymptotic bounding of implementations is a major topic throughout the course. The topics covered in this course are fundamental to programming and are essential to further computer science courses.

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.

An introductory course in problem solving, using the programming language Java. Focuses on the fundamental concepts of problem solving and on computer implementation. Intended for computer science majors or those applying for the major. Satisfactory completion is a prerequisite for all higher-level computer science courses. Use of a laptop computer required. Prerequisite: high school algebra and basic math skills (R1). (Gen.Ed. R2)

Embedded Computational Systems is a hands-on laboratory for building integrated systems. We develop analytical skills and discuss sensors, motor drivers, I/O, control logic, and operating systems for embedded applications. Students build several individual projects and invent one integrated, semester-long team project.

Embedded Computational Systems is a hands-on laboratory for building integrated systems. We develop analytical skills and discuss sensors, motor drivers, I/O, control logic, and operating systems for embedded applications. Students build several individual projects and invent one integrated, semester-long team project.