CIS 55 - Data Structures: Programming

    Recent Professors
    Gabriel J. Solomon, Pragati Dharmale
    Recent Semesters
    Fall 2026, Spring 2026
    Class Size
    35 students
    Difficulty
    4.8Moderateout of 10
    Credits
    3
    Prerequisite
    CIS 024B or CIS 024C or CIS 054 or CIS 084 , all with C or better
    Fall 2026 Sections
    View Fall 2026 sections of CIS 55
    Transfers To
    Not transferable
    Description
    Students will learn a language-independent treatment of topics including computer organization, data formats, recursion, and abstract data types. Data structures covered include abstract data types, arrays, pointers, link lists, stacks, queues, trees, heaps, hash tables, and graphs. Applications of recursion algorithms are discussed in detail. Techniques for sorting algorithms and searching algorithms, as well as measuring algorithm performance and data structure efficiency using Big-O notation, are presented. (C-ID COMP 132)
    Usually Held
    Thu 6:00pm–7:20pm, Tue Thu 1:30pm–3:00pm, Tue Thu 3:10pm–4:00pm