CSC 461-01
Eustrat Zhupa
|
This course presents the fundamental concepts of database design and use. It provides a study of data models, data description languages, and query facilities including relational algebra and SQL, data normalization, transactions and their properties, physical data organization and indexing, security issues and object databases. It also looks at the new trends in databases. The knowledge of the above topics will be applied in the design and implementation of a database application using a target database management system as part of a semester-long group project.
- Location
|
CSC 462-1
Joseph Ciminelli
MWF 9:00AM - 11:50AM
|
This course will cover foundational concepts in descriptive analyses, probability, and statistical inference. Topics to be covered include data exploration through descriptive statistics (with a heavy emphasis on using R for such analyses), elementary probability, diagnostic testing, combinatorics, random variables, elementary distribution theory, statistical inference, and statistical modeling. The inference portion of the course will focus on building and applying hypothesis tests and confidence intervals for population means, proportions, variances, and correlations. Non-parametric alternatives will also be introduced. The modeling portion of the course will include ANOVA, and simple and multiple regression and their respective computational methods. Students will be introduced to the R statistical computing environment. This course is FULLY ONLINE and ASYNCHRONOUS.
PREREQUISITES: MATH 150 or MATH 150A; and MATH 142 or MATH 161 or MATH 171 (or equivalent discrete mathematics and calculus)
- Location
|
CSC 480-01
Monika Polak
|
This course studies fundamental computer models and their computational limitations. Finite-state machines and pumping lemmas, the context-free languages, Turing machines, decidable and Turing-recognizable languages, undecidability, NP-completeness.
- Location
|
CSC 480-02
Monika Polak
|
This course studies fundamental computer models and their computational limitations. Finite-state machines and pumping lemmas, the context-free languages, Turing machines, decidable and Turing-recognizable languages, undecidability, NP-completeness.
- Location
|
CSC 495-01
Chenliang Xu
|
No description
- Location
|
CSC 595-1
Aaron White
|
No description
- Location
|
CSC 595-4
Chen Ding
|
Blank Description
- Location
|