[Subject home], [FAQ], [progress],   Bib', Alg's,  C , Java - L.A., Sunday, 28-Nov-2021 05:19:07 AEDT
Instructions: Topics discussed in these lecture notes are examinable unless otherwise indicated. You need to follow instructions, take more notes & draw diagrams especially as [indicated] or as done in lectures, work through examples, and do extra reading. Hyper-links not in [square brackets] are mainly for revision, for further reading, and for lecturers of the subject.

CSE2304: Admin

Algorithms and Data Structures:   Introduction

An Abstract Data Type (ADT) specifies ideal properties

You must revise
prefix, infix, postfix and breadth-first tree [traversal] from 1st year.

The ADT `Tree'.

NB. These are rooted, binary trees.   There are also unrooted and other kinds of Trees (later).
You must revise the [Stack] and [Queue] from the ADT point of view.
If and when you get stuck on notation, remember the [glossary].

On ADT notation.

©
L
.
A
l
l
i
s
o
n

Grammar for arithmetic expressions:

Notation . . .
[lecturer: do examples; class: take notes!]
Grammars can be used for parsing

e.g. x + y * z

          Exp(+)
         .  .
        .    .                 -- Parse Tree
       .      .
      .       Term(*)
     .        .  .
    .        .    .
   .        .      .
  x        y        z

See a small [Parser in C]. Must understand (left | right)- associativity.

Example

Summary:

We covered:

Prepare:

© L.Allison, Sunday, 28-Nov-2021 05:19:07 AEDT users.monash.edu.au/~lloyd/tilde/CSC2/CSE2304/Notes/01intro.shtml
Computer Science, Software Engineering, Science (Computer Science).