|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Introduction to natural language processing programs and an overview of the field. Topics include syntactic frameworks, parsing, semantics, interpretation, and applications. Prereq: jr st; C or better in CompSci 351(252)(P) & 417(517)(P).
-
3.00 Credits
Algorithms for uncovering useful information from data. Topics include data exploration, association rules, clustering, supervised learning, and mining structured data (e.g., sequences or graphs) Counts as repeat of CompSci 657 with same topic. Prereq: jr st; CompSci 251(P), Math 221(P) or Math 232(P)
-
3.00 Credits
Examination of abstract features of languages. Study of syntactic and semantic models; design and programming in procedural, object-oriented, functional and logical languages. Implementation methods. Prereq: jr st; grade of C or better in CompSci 351(252)(P).
-
1.00 - 6.00 Credits
Software projects involving definition, design, development, documentation and implementation of software systems. May be retaken with change of topic to 6 cr max. Prereq: jr st; C or better in CompSci 251(P).
-
3.00 Credits
Introduction to text retrieval, text classification and their biomedical applications; topics include: indexing, query processing, and document retrieval methods. Jointly offered with & counts as repeat of HCA 444, CompSci 744, & HCA 744. Prereq: jr st; CompSci 351(P) or HCA 442(P).
-
3.00 Credits
Processor organization and design; memory organization; microprogramming and control unit design; I-O organization; case studies of selected machine architectures. Jointly offered with & counts as repeat of ElecEng 458. Prereq: jr st; CompSci 315(215)(P) or ElecEng 354(P).
-
3.00 Credits
Scan-line algorithms, object representation, homogeneous coordinates, geometric transformations, viewing curves, illumination models, interactive input methods, texture mapping. Prereq: jr st; Math 232(P); CompSci 251(P).
-
3.00 Credits
Privacy and authenticity of data and programs, communication, operating systems, network and database security, computer viruses, cryptography, private and public key cryptosystems, protocols. Prereq: jr st; C or better in both CompSci 317(217)(P) & 201(P).
-
3.00 Credits
First-order predicate calculus; formal properties of theoretical systems; chief results of modern mathematical logic; advanced topics such as completeness and computability. CompSci 511, Math 511, & Philos 511 are jointly offered & count as repeat of each other. Prereq: jr st & either Philos 212(P) or 6 cr Math at the 300-level or above; or grad st.
-
3.00 Credits
Layered network architecture, protocols, data transmission, local area networks, multiplexing and switching, routing flow and congestion control, internetworking, wireless networking, network reliability and security. Prereq: jr. st; CompSci 315(215)(P) or CompSci 458(P) or ElecEng 367(P).
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2025 AcademyOne, Inc.
|
|
|