Algorithms and Datastructures (INF1, Autumn'05)
Lecture 1
Main topic:
Introduction to the course, algorithmic problems, searching.
Lecture Plan
- organization of the course
- introduction to the topic of the course and motivation
- discussion about the notion of algorithm
- data structures vs. algorithms
- easy problems, hard problems and unsolvable problems
- linear serching
- searching in ordered sequences: binary search
Reading
- Chapter 1 of Algorithmics: The Spirit of Computing by David Harel
(available in the course folder for photocopying)
- Have a look at this funny reading about undecidablity of the
halting problem:
Scooping the Loop Snooper by
Geoffrey K. Pullum
(gzipped PDF file).