|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
1.00 Credits
No course description available.
-
3.00 Credits
A study of the design, maintenance, and use of databases. Topics include relational modeling, normaliza-tion, query languages, and programming APIs for database access. Students will design their own data-base and write a database-driven application that uses it. Offered fall semesters. Lecture portion cross-listed as CIS 356. Prerequisite: CS 120 or consent of the instructor. 3 lecture and 2 laboratory hours.
-
1.00 Credits
No course description available.
-
3.00 Credits
This course is a study of the relationship between hardware and software. It includes an introduction to assembly lan-guage and the design of digital logic circuits. Additionally, this class covers the organization of central processor in-cluding instruction sets, register transfer operations, control microprogramming, data representation, and arithmetic algorithms. Prerequisites: CS 232 or consent of the instructor. Offered spring semesters. 3 lecture and 2 laboratory hours.
-
1.00 Credits
No course description available.
-
3.00 Credits
This course provides a hands-on experience in software maintenance. Students will use modern tools of the trade to effect changes in existing code bases while working together with faculty members and other students. This class can be repeated for credit. Open to junior and senior Computer Science majors upon approval of the Chairperson or Pro-gram Director.
-
3.00 Credits
This courses introduces the design and implementation issues of contemporary programming languages. Topics cov-ered include programming paradigms, the syntax and semantics of programming language constructs, and formal lan-guages. Several different languages are introduced and examined to illustrate these topics. Offered every other year. Prerequisites: CS 233.
-
3.00 Credits
This course is an introduction to the techniques for designing efficient computer algorithms, proving their correctness, and analyzing their running times. General topics include asymptotics, solving summations and recurrences, algorithm design techniques (such as divideand- conquer, dynamic programming, and greedy algorithms), analysis of data structures, sorting, searching and selection, and an introduction to NP-completeness. Offered Fall semesters. Prerequisites: CS*233 and MATH*235 or consent of the instructor.
-
3.00 Credits
This course is a study of the theoretical underpinnings of computing devices. Topics include classes of formal lan-guages (regular, context-free, and recursively enumerable), systems for generating strings in those languages (regular expressions, context-free grammars), and machines for recognizing these languages (finite-state automata, pushdown automata, Turing machines). Questions of computability (what problems are computer incapable of solving?) and complexity (what problems can computers solve only with great effort?) will be addressed. Offered every other year. Prerequisites: MATH 235.
-
3.00 Credits
This course presents an introduction to the major concepts of modern operating systems. Topics include operating system structure, process and thread management, inter-process communication and synchronization, scheduling, memory management, input/output operations, and fi le systems. Prerequisites: CS 232, or consent of the instructor.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|