|
|
|
|
|
|
|
|
|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
Problem solving and algorithm development. Organization and characteristics of modern digital computers with emphases on developing good programming habits, building abstractions with procedures and data, and programming in a modern computer language. ( QR) Contact Hour Distribution: 3 hours lecture and 1 lab. Credit Restriction: Students who have received credit for 140 or 160 may not receive subsequent credit for 102 without consent of instructor. Students may not receive credit for both 102 and Electrical and Computer Engineering 206.
-
4.00 Credits
Advanced problem solving and algorithm development, structured programming, data structures and applications, I/O techniques, lists, queues, trees, algorithms, files. Contact Hour Distribution: 3 hours lecture and 1 lab. (RE) Prerequisite(s): 102.
-
4.00 Credits
Number systems, Boolean algebra, combinational and sequential circuits, registers, processor functional units and control, pipelining, memory and caching, stored program computing, memory management, computer system organization, and assembly language programming. Contact Hour Distribution: 3 hours lecture and 1 lab. (RE) Prerequisite(s): 102.
-
1.00 - 3.00 Credits
Topics vary. Programming languages, operating systems, and application software packages. Repeatability: May be repeated. Maximum 9 hours.
-
1.00 Credits
Practical tools available under Unix to enable students to become more efficient in performing labs and research projects. Topics to be covered include - sh, cat/grep/find/sort/at/, ed/sed, awk, perl, python, make, rcs, jgraph, gcc/cpp/purify/quantify. Grading Restriction: Satisfactory/No Credit grading only. (RE) Prerequisite(s): 140.
-
4.00 Credits
Design, analysis, and implementation of fundamental algorithms, such as sorting and searching, and their data structures. Contact Hour Distribution: 3 hours lecture and 1 lab. (RE) Prerequisite(s): 140 and 160.
-
3.00 Credits
Equivalence relations, partial orderings. Combinations, permutations, analysis of algorithms. Finite automata and regular languages. (RE) Prerequisite(s): 140 and Mathematics 300. (DE) Prerequisite(s): 160.
-
4.00 Credits
Principles of analysis and design of information systems. Principles of program design and verification, formal objects, formal specifications. Contact Hour Distribution: 3 hours lecture and 1 lab. (RE) Prerequisite(s): 311.
-
4.00 Credits
For students in the sciences, engineering, or mathematics. Basic ideas of algorithm design and data structures using a high-level technical language in an interactive environment. Topics may include data analysis, plotting and visualization, and numerical computation. Contact Hour Distribution: 3 hours lecture and 1 lab. Credit Restriction: Does not fulfill any requirements for the computer science major. (RE) Prerequisite(s): Mathematics 142.
-
4.00 Credits
Introduction to user-level systems programming, file control, process control, memory management, system utilities, network programming. Contact Hour Distribution: 3 hours lecture and 1 lab. (RE) Prerequisite(s): 302.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Privacy Statement
|
Terms of Use
|
Institutional Membership Information
|
About AcademyOne
Copyright 2006 - 2024 AcademyOne, Inc.
|
|
|