Course Number
              CMPSC 130A
          Internal Course Number
              130
          Level
              Undergraduate
          Units
              4
          Faculty
          
      Course Description
              Data structures and applications with proofs of correctness and analysis. Hash Tables, Priority Queues (heaps); Balanced Search Trees. Graph Traversal techniques and their applications.
Prerequisite: Computer Science 40 or Math 8 with a grade of C or better; Computer Science 9 or Computer Science 24 with a grade of C or better; Co-requisite PSTAT 120A or ECE 139; open to computer science, computer engineering, and electrical engineering majors only.