|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Lecture, 2 hours; laboratory, 2 hours. Number systems and complement arithmetic, boolean logic, K-maps, combinational circuits, sequential circuits, programmable logic, main memory, timing, control and ALU design, and microprogramming. Laboratory work will include circuit simulation and hands-on work with boards. Prerequisite: MATH 142 or consent of instructor.
-
1.00 - 4.00 Credits
This lower-division course may be repeated with different subject matter. Content will be indicated by the specific topic. Prerequisite: as indicated in the specific topic description or by consent of instructor.
-
3.00 Credits
Lecture, 2 hours; laboratory, 2 hours. Fundamental concepts of data structure design and implementation using the object-oriented paradigm; implementation using static arrays, dynamic arrays, linked lists, trees, binary search trees, balanced trees (AVL, red-black, B-trees), heaps, hashing, and graphs; development of fundamental abstract data types (ADTs) including sets, lists, stacks, queues, priority queues, tables (maps and multimaps), and graphs; introduction to concepts of algorithm analysis. Prerequisites: CS 215 or consent of instructor.
-
3.00 Credits
Current methods for increasing security, protecting privacy, and guaranteeing degrees of confidentiality of computer records; ensuring computer installation safety; protecting software products; preventing and dealing with crime; value systems, ethics, and human factors affecting use and misuse of computers. Discussion of recent technical, legal, and sociopolitical issues influencing computer security problems. Prerequisites: CS 215, 250, and 251, or consent of instructor.
-
2.00 Credits
Laboratory, 2 hours. This course focuses on problem solving and program development in a team programming environment. Topics include: techniques for problem analysis and algorithm design, rapid implementation and pair programming methods, use of standard container classes and library functions. Different types of problems will be selected each semester. May be repeated for credit. A maximum of 3 units can be applied to the Computer Science major. Prerequisite: CS 315 or consent of instructor. SSU students taking this course participate in regional and national programming competitions.
-
3.00 Credits
Instruction set design; memory-processor structures; memory hierarchies: cache, virtual memory and secondary storage; CISC, RISC, stack architectures; pipelining; I/O interfacing; comparative examples of existing architectures. Prerequisites: CS 215, 250, and 251, or consent of instructor.
-
3.00 Credits
Lecture, 2 hours; laboratory, 2 hours. Design and implementation of database management systems. Topics covered include: database architecture, relational algebra, data models, data normalization, SQL, storage structure of databases, security, data integrity, and database administration. Prerequisite: CS 215 or consent of instructor.
-
3.00 Credits
Lecture, 2 hours; Laboratory, 2 hours. Principles of object-oriented programming, including encapsulation, inheritance, and polymorphism, and design patterns for object-oriented programming. Specific applications are developed in one or more object-oriented programming languages and will cover the use of application frameworks and graphical user interfaces based on object-oriented principles. Prerequisites: CS 215 or consent of instructor.
-
3.00 Credits
Lecture, 2 hours; laboratory, 2 hours. A study of the principles, algorithms, and protocols used in computer networks with an emphasis on those used on the Internet. Prerequisites: CS 215, 250 and CS 251, or consent of instructor.
-
3.00 Credits
Lecture, 2 hours; laboratory, 2 hours. Techniques of software design and development. Software lifecycle, requirements, formal specification, metrics, design, functional and structural testing, rapid prototyping, complexity, version control, and team management. Prerequisite: CS 215 or consent of instructor.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|