This video is part of my lecture course on Algorithms at the University of Cambridge.
Having discussed primitive types and then arrays, records and pointers, we now give a quick tour of some fundamental data structures: list, tree, stack, queue, double ended queue, dictionary (with and without a total order defined on its keys).
We use abstract data types to describe the functionality of a data structure without committing to how it is implemented.
It is crucial to understand that, at the processor level, manipulating linked data structures made of records and pointers may have surprising side effects that higher level languages might attempt to shield you from. Be aware that this may be the source of insidious bugs.
Many thanks to those of you who are giving thumbs up to these videos and subscribing to the channel. Your support is greatly appreciated and it causes Youtube to offer this material to more viewers who might like it.
Course web page:
https://www.cl.cam.ac.uk/teaching/current/Algorithms/
Course handout:
https://www.cl.cam.ac.uk/teaching/2021/Algorithms/2020-2021-stajano-algs-handout.pdf
My home page:
http://frank.stajano.com
Add comment