Computer Science

• • CSCI 110 - Fundamentals of Computer Science

    CSCI 110 - Fundamentals of Computer Science

    3.5 Units (Degree Applicable, CSU, UC)

    Lecture: 54 hours

    Lab: 27 hours

    Prerequisite: MATH 71 or MATH 71B or equivalent

    Advisory: Eligibility for ENGL 1A

    Basic concepts of computer hardware and software. General computer organization and information representation. Binary and hexadecimal number systems. Algorithm design and problem-solving techniques. Introduction to programming using a high level language (C, C++ or Java.)

     

    • Course Outline (Topics to be Covered)
    • Student Learning Outcomes (SLOs) and Course Measurable Objectives (CMOs)
  • CSCI 140 - C++ Language and Object Development

    CSCI 140 - C++ Language and Object Development

    4 Units (CAN CSCI18) (Degree Applicable, CSU, UC)

    Lecture: 54 hours

    Lab: 54 hours

    Prerequisite: CSCI 110 or equivalent programming experience

    For computer science, mathematics, engineering and other science students. Introduction to C++ programming and object-oriented paradigm. Control structures, functions, arrays, pointers and strings, classes and data abstraction, C++ object programming, operator overloading, inheritance, virtual functions and polymorphism, stream input and output, templates, exception handling, file processing. Introduction to data structures in C++, string processing and recursion.

     

    • Course Outlines (Topics to be Covered)
      • Deitel
      • Gaddis
      • zyBooks
    • Student Learning Outcomes (SLOs) and Course Measurable Objectives (CMOs)
  • CSCI 145 - Java Language and Object Oriented Programming

    CSCI 145 - Java Language and Object Oriented Programming

    4 Units (Degree Applicable, CSU, UC)

    Lecture: 54 hours

    Lab: 54 hours

    Prerequisite: CSCI 110

    Introduction to Java language and object oriented programming with Java as well as general concepts and techniques of computer programming. Topics include: Java expressions, flow control, methods and program structure, Java classes, overloading, object references, inheritance, Java library packages, exceptions, file I/O, applets, GUI, and event handling. A course for computer science, engineering, mathematics, and other science students.

     

    • Course Outlines (Topics to be Covered)
      • Hortsmann
      • Lewis
    • Student Learning Outcomes (SLOs) and Course Measurable Objectives (CMOs)
  • CSCI 150 - Assembly Language/Machine Architecture

    CSCI 150 - Assembly Language/Machine Architecture

    3 Units (CAN CSCI10) (Degree Applicable, CSU, UC)

    Lecture: 54 hours

    Prerequisite: CSCI 110

    Organization and operation of real computer systems at the assembly language level using the Intel 80x86 family of processors; mapping statements and constructs in a high-level language onto sequences of machine instructions; internal representations of simple data types and structures; numerical computation, noting various data representation errors and potential procedural errors; investigation of basic principles of operating systems; and programming language translation process.

     

    • Course Outline (Topics to be Covered)
    • Student Learning Outcomes (SLOs) and Course Measurable Objectives (CMOs)
  • CSCI 190 - Discrete Mathematics Applied to Computer Science

    CSCI 190 - Discrete Mathematics Applied to Computer Science

    4 Units (Degree Applicable, CSU, UC)

    Lecture: 72 hours

    Prerequisite: MATH 71 or equivalent

    Provides students with the mathematical background necessary in Computer Science: set theory, logic, modular arithmetic, combinatorics, finite probability and graphs. Topics include propositional and predicate calculus, recursion, binary search trees and counting techniques.

     

    • Course Outline (Topics to be Covered)
    • Student Learning Outcomes (SLOs) and Course Measurable Objectives (CMOs)
  • CSCI 240 - Data Structures and Algorithms

    CSCI 240 - Data Structures and Algorithms

    5 Units (CAN CSCI22) (Degree Applicable, CSU, UC)

    Lecture: 72 hours

    Lab: 54 hours

    Prerequisite: CSCI 140 or CSCI 145

    Abstract data types and algorithm analysis and design. Linear data structures including stacks, queues, vectors, and lists. Non-linear data structures including trees, binary search trees, heaps, priority queues, and graphs. Searching, sorting, and hash tables. Design patterns including divide-and-conquer, greedy method, and dynamic programming.  Memory and disk management techniques.

     

    • Course Outline (Topics to be Covered)
    • Student Learning Outcomes (SLOs) and Course Measurable Objectives (CMOs)

Courses Not Currently Offered

• • CSCI 220 - Data Structures I

    CSCI 220 - Data Structures I

    3 Units (CAN CSCI22) (Degree Applicable, CSU, UC)

    Lecture: 54 hours

    Prerequisite: CSCI 140 or CSCI 145

    Abstract data types and running time analysis tools. Linear data structures including sets, stacks, queues, and linked lists. Trees, binary search trees, heaps, and priority queues. Many procedures are discussed using an algorithmic language and selected problems are programmed in a higher level language.

     

    • Course Outline (Topics to be Covered)
    • Student Learning Outcomes (SLOs) and Course Measurable Objectives (CMOs)
  • CSCI 230 - Data Structures II

    CSCI 230 - Data Structures II

    3 Units (Degree Applicable, CSU, UC)

    Lecture: 54 hours

    Prerequisite: CSCI 220

    Basic searching/sorting algorithms, hashing, graphs, memory/disk management, B-trees, advanced tree structures and analysis.

     

    • Course Outline (Topics to be Covered)
    • Student Learning Outcomes (SLOs) and Course Measurable Objectives (CMOs)