Electrical and Information Technology

Faculty of Engineering LTH | Lund University


What's new???  

  • 2019-10-29: First lecture: Tue Nov 5, 15.15 in E:C. 
  • 2019-10-29: There will an exam for exchange students returning home before Christmas on December 19, 10.00-15. 
  • 2019-11-11: This week's lectures on Tuesday and Wednesday are both cancelled! Next lecture Thursday 8-10.
  • 2019-11-19: Ad for a short talk for those interested, aimed for an audience of 3rd year cs students.

    Docent Jakob Nordström

    Tuesday Nov 26, 13.25-13.55, E:1144 (20 minutes+Q&A)

    Title: Algorithm complexity and its practical implications

    This is a part of a lecture at the course on algorithms, data structures and complexity for D-line students. This lecture is on algorithm complexity and concentrates mainly on time complexity. In this lecture, introduce to students algorithm complexity measures and illustrate them with practical examples. The presentation should also lead to introduction of complexity classes and practical consequences for algorithms. The students should also be exposed to limitations of algorithmic solutions for typical standard problems, for example to the notions of tractable and intractable problems.