UNF Faculty Association

Agenda Item # 1 -FA 07-23: Submitted by the Academic Programs Committee

College of Computing, Engineering, and Construction

Undergraduate- School of Computing

06/07-287

APC 2

CDA 3100

Architechure of Computer Organization

COP 3531 File Structures is being removed from the prerequisite listing for CDA 3100 Architecture of Computer Organization. This removal is due to the fact that File Structure topics are no longer used as a background to the current course topics for CDA3100.
COP 2175 Introduction to Visual and Procedural Programming (3 credit hours) will be used as a new prerequisite for CDA 3100, since it provides an introductory programming background, which is necessary as a background to CDA 3100.

06/07-288

APC 1

CAP 4515

Computational Biology (3 cr hrs)

Prerequisites:	COP 3530 Data Structures or COP 3540 Data Structures using OOP STA 4321 Probability and Statistics or STA 2023 Elementary Statistics for Business.
Corequisites:	None

Course Description: This course is an introduction to the study of algorithmic and computational problems in molecular biology. Computer science concepts are emphasized, such as the improvement in asymptotic running time with better algorithms, the contrast between heuristics and an algorithm with guarantees, and the difficulty posed by NP-complete problems. Algorithms for sequence comparison, alignment, and assembly are covered as well as problems in evolutionary trees and genome rearrangements. Combinatorial methods will be the primary focus. No new faculty or additional resources are required for this course.

06/07-289

APC 1

COT4101

Computational Structures (3 cr hrs)

Prerequisites:	COT 3100 Comp Structures or MAD 3107 Discrete Math.
Corequisites:	None

Course Description: This course covers topics in combinatorial and discrete mathematics, including permutations and combinations, binomial coefficients, recurrence relations, Fibonacci sequences, generating functions, advanced counting techniques such as inclusion exclusion, coding theory, Latin squares, graph theory. Applications to various problems in mathematics and computing will be covered. No new faculty or additional resources are required for this course.