35 courses with the subject CO, each shown exactly as we captured it from the college's catalog, with every element we hold. Where the wording looks broken, that is our reading of the catalog, not the college's text.
CM--- Electives in Communications Media 15sh Table of Contents | Index of Courses This information is maintained by the Office of the Registrar, with approval from the University Senate. Last Modified at 1:08 PM on 7/21/98.
3c-0l-3sh This is the first course for Computer Science majors. It is required of all Computer Science students and is appropriate for other Natural Sciences and Mathematics students. Topics include the fundamental concepts of computer architecture, algorithm development and analysis, programming languages, software engineering, data organization and representation, and systems software. Hands-on introduction to computer usage with an emphasis on terminology and the underlying connections within the discipline.
3c-0l-3sh (For Science, Mathematics, and Computer Science majors, and for others who have a sufficiently quantitative orientation) Basic structure of modern digital computers; problem analysis and computer solution using flowcharting and the C++ language. Exemption or credit by examination possible.
(identical to BE/CM/CO/IM/LB 201) 3
Free Electives: 2-4 Total Degree Requirements: 124 (*) See requirements leading to teacher certification in the catalog section on Academic Policies, Admission to
3c-0l-3sh Structured programming principles and techniques, as implemented through the ANS COBOL language; program design using top-down techniques; program and project documentation; introduction to sequential file algorithms.
Foreign Language Intermediate Level (1) 0-6sh Free Electives: 19-28 Total Degree Requirements: 124 (1) Intermediate-level Foreign Language may be included in Liberal Studies electives. (2) A student may select courses to fulfill requirements for specialized track. a. Actuarial/Statistics: MA363, MA364, MA421, MA422, MA446, MA465 b. Scientific/Engineering: MA241, MA342, MA363, MA364, MA371, MA423, MA445, MA446, MA451 c. Math Analyst: MA241, MA342, MA363, MA364, MA371, MA445 or MA446, MA476, CO minor Table of Contents | Index of Courses This information is maintained by the Office of the Registrar, with approval from the Unive at 9:10 PM on 7/26/97 rsity Senate. Last Modified
var-1-3sh Special topics are offered on an experimental or temporary basis to explore topics that are not included in the established curriculum. A given topic may be offered under any special topic identity no more than three times. Special topics numbered 281 are offered primarily for lower-level undergraduate students.
3c-0l-3sh Examination of structure and languages of machines; representation of data, addressing techniques, symbolic coding, assemblers, macros, etc.; problem solution using assembly language.
3c-0l-3sh Basic concepts of data; storage systems and structures; lists, arrays, strings, hashing techniques; searching and sorting techniques; data structures in programming languages; string processing. Programming in a object-oriented language.
3c-0l-3sh
3c-0l-3sh Includes the collection of tools, procedures, methodologies, and accumulated knowledge about the development of the software life cycle; current methodologies, tools, and techniques being applied to each phase will be discussed in depth with localized exercises given to reinforce learning of concepts.
1c-2d-3sh Planning, design, and implementation of large software systems using software engineering techniques. Students work in project teams on real or realistic software development projects. Credit for either CO320 or CO493 may count toward computer science major requirements for graduation but not both; the other course credits are free electives.
3c-0l-3sh Communication of digital data between computers and to and from terminals and other peripherals; computer networks; small design projects or term paper.
2c-1l-3sh The use of computer graphics hardware and software. An overview of current applications and experience with representative software will introduce current practice. Foundations in primitives, geometry, and algorithms of passive computer graphics are the principal focus of the course. A brief introduction to interactive computer graphics will be included.
1c-0l-1sh Detailed study of the job control language (JCL) of the IBM OS operating system; comparison of OS with the locally available DEC operating system, VAX VMS.
3c-0l-3sh An introduction to the history, features, syntax, and applications of UNIX and C. Lectures, reading, and hands-on projects. Coverage includes two or more command interfaces, variations in C, and portability issues. UNIX is a trademark of Bell Laboratories.
0c-1d-1sh Reading, review, and discussion of the current literature of computer science and industry trade journals; effective oral presentations; employment prospects. Should be taken the semester before an internship or the first semester of the senior year. Should not be taken at the same time as CO480.
3c-0l-3sh An introduction to the field of artificial intelligence, i.e., the study of ideas that enable computers to process data in a more intelligent way than conventional practice allows. The course covers many information representation and information processing techniques. Students will explore the underlying theory including matching, goal reduction, constraint exploration, search, control, problem solving, and logic.
3c-0l-3sh The logical description of computer processor structure (architecture), with emphasis on the microprogramming approach. Project assignments using minicomputer.
3c-0l-3sh Introduction to the Ada programming language as a tool of the software engineer. Projects will use the advanced programming constructs resident in Ada, including packages, multi-tasking, generic units, exception handlers, and concurrent programming.
3c-0l-3sh Comparative study of the properties and applications of a range of modern higher-level programming languages, including Ada, APL, C, LISP, LOGO, Pascal, PROLOG, and SNOBOL. Comparison with older languages such as ALGOL, BASIC, COBOL, FORTRAN, and PL/I.
3c-0l-3sh Relates the formal concepts of automata and language theory to the practicality of constructing a high-level language translator. The structures and techniques used in lexical analysis, parsing, syntax directed translation, intermediate and object code generation, and optimization are emphasized.
3c-0l-3sh Concepts and techniques of systems programming with an emphasis on assembly, linking, loading, and macro processing for user programs. Overview of higher-level language translation and system control. Programming and research projects.
3c-0l-3sh Introduction to the principles of operating system design and implementation. Topics include interrupt service, process states and transitions, spooling, management of memory and disk space, virtual storage, scheduling processes and devices, and file systems.
3c-0l-3sh Review of data base concepts. Detailed study of data base management approaches. Comparative study of commercially available data base management systems. Project on the locally available data base systems.
Language 3sh
3c-0l-3sh Polynomial approximations using finite differences, with applications in numerical integration and differentiation. Numerical solution of initial value ordinary differential equations. The APL language will be introduced and used, along with FORTRAN, in programming selected algorithms.
3c-0l-3sh Supercomputers make use of special computer architectures—vector and parallel processors—in order to achieve the fastest processing speed currently available. Students will be introduced to these features and will learn how numerical algorithms can be constructed to exploit supercomputers’ capabilities. Students will gain practical experience in programming for the Cray, YMP, in incorporating existing scientific software packages into user-written programs, in submitting remote jobs to the Pittsburgh Supercomputer Center, and in producing animated graphical output to summarize the typically large volume of output data generated by large scientific programs. (Also offered as MA451; may not be taken for duplicate credit)
3c-0l-3sh Formal methods for describing and analyzing programming languages and algorithms. Backus-Naur forms; productions; regular expressions; introduction to automata theory; Turing machines; recent concepts in algorithm theory computability.
Controlled electives: Select 9sh (1)
(as approved for majors) 1-4sh
Upper Level Electives by Categories: Select 3sh (4) Computer Architecture: CO410 Data Base Management: CO444 Theory of Languages: CO419, CO420, CO424, CO460 Systems Programming: CO430, CO432 Numerical Methods: CO450, CO451 Artificial Intelligence: CO405 Other Requirements: 6-22 Additional Writing:
var-12sh Arrangements for selection of a specific topic must be made.
Controlled electives: Select 6sh (3)
Source: Indiana University of Pennsylvania-Main Campus's catalog, linked per course · table learning_unit · CourseShelf publish 59
