CERN Accelerating science

Talk
Title	Algorithms and Data Structures (lecture 2)
Video	If you experience any problem watching the video, click the download button below Download Embed Mp4: Medium (1000 kbps) High (4000 kbps) More.. 800 kbps 800 kbps 800 kbps 1000 kbps 1000 kbps 2000 kbps 2000 kbps 2000 kbps 4000 kbps 4000 kbps Copy-paste this code into your page: <iframe width="640" height="360" frameborder="0" src="https://cds.cern.ch/video/2307403?showTitle=true" allowfullscreen></iframe> Copy-paste this code into your page to include both slides and lecture: <iframe src="https://mediastream.cern.ch/MediaArchive/Video/Public2/weblecture-player/index.html?year=2018&lecture=671879c21" width="1020px" height="600px" allowfullscreen scrolling="no" frameborder="0"></iframe>
Author(s)	Bel, Lennaert (speaker) (Nikhef (NL))
Corporate author(s)	CERN. Geneva
Imprint	2018-03-06. - Streaming video.
Series	(Inverted CSC) (Inverted CERN School of Computing 2018)
Lecture note	on 2018-03-06T10:00:00
Subject category	Inverted CSC
Abstract	Algorithms have existed, in one form or another, for as long as humanity has. During the second half of the 20th century, the field was revolutionised with the introduction of ever faster computers. In these lectures we discuss how algorithms are designed, how to evaluate their speed, and how to identify areas of improvement in existing algorithms. An algorithm consists of more than just a series of instructions; almost as important is the memory structure of the data on which it operates. A part of the lectures will be dedicated to a discussion of the various ways one can store data in memory, and their advantages and disadvantages.
Copyright/License	© 2018-2024 CERN
Submitted by	sebastian.lopienski@cern.ch