Introduction to the theory and practice of educational technology. Covers learning theory applicable to educational technology, explains major research findings. Credit not awarded for both CS 4660 and CS 6460.

Proof methods, strategy, correctness of algorithms over discrete structures. Induction and recursion. Complexity and order of growth. Number theoretic principles and algorithms. Counting and computability. Credit not allowed for both CS 2050 and CS 2051.

This course presents an example of applying a database application development methodology to a major real-world project. All the database concepts, techniques and tools that are needed to develop a database application from scratch are introduced along the way when they are needed. In parallel - slightly delayed - learners in the course will apply the database application development methodology, the techniques and the tools to their own major class team project.
In addition to the development methodology, techniques and tools learned in this course will include the Extended Entity Relationship Model, the Relational Model, Relational algebra, calculus and SQL, database normalization, efficiency and indexing. Finally, techniques and tools for metadata management and archival will be presented.

Recitation for CS 1331

Recitation for CS 1331

Recitation for CS 1331

Recitation for CS 1331