CISP 430 - Data Structures

    Recent Professors
    Iraj Sabzevary
    Recent Semesters
    Spring 2027, Fall 2026, Spring 2026, Fall 2025, Spring 2025
    Class Size
    Not published
    Difficulty
    5.8Demandingout of 10
    Credits
    4
    Prerequisite
    CISP 400 or 401 with a grade of "C" or better
    Spring 2027 Sections
    View Spring 2027 sections of CISP 430
    Transfers To
    CSU
    Description
    This course applies object-oriented techniques for systematic problem analysis and the managing of program complexity using abstraction. Specification, design, coding, testing, and documentation of large multi- file programs are covered. It uses advanced language features such as classes, strings, non-text files, pointers, and recursion. Abstract data types such as stacks, queues, lists, binary trees, heaps/priority queues, hash tables, and graphs are examined. Various sorting and searching algorithms are presented and analyzed using Big-O notation. Computer Information Science 317
    Usually Held
    Mon 3:00pm–4:20pm, Wed 1:30pm–2:20pm, Wed 1:30pm–2:50pm, Wed 10:30am–11:10am