Lecture Notes for Data Structures and Algorithms

← Back to document page

Lecture Notes forData Structures and AlgorithmsRevised each year by John BullinariaSchool of Computer ScienceUniversity of BirminghamBirmingham, UKVersion of 27 March 2019These Notes are currently revised each year by John Bullinaria. They include sections based onnotes originally written by Mart n Escard o and revised by Manfred Kerber. All are membersof the School of Computer Science, University of Birmingham, School of Computer Science, University of Birmingham, UK, 20181Contents1 Algorithms as opposed to programs . . . . . . . . . . . . . . . . . . . . . . . . . Fundamental questions about Algorithms . . . . . . . . . . . . . . . . . . . . . . data Structures , abstract data types, design patterns.

We will not restrict ourselves to implementing the various data structures and algorithms in particular computer programming languages (e.g., Java, C, OCaml), but specify them in simple pseudocode that can easily be implemented in any appropriate language. 1.1 Algorithms as opposed to programs

  Lecture, Notes, Data, Structure, Lecture notes, Java, Data structures