Design and Analysis of Algorithms
Szerzők
- Battyányi Péter, Herendi Tamás
Típus
- elektronikus könyv
Elektronizálás módja
- DocBook XML
Terjedelem
- 250.000 leütés
Digitális elemek
- 300 kép
Tartalom
Mathematical backgrounds: sets, relations, and principles of induction; The syntax and of a simple imperative programming language; Semantics of imperative languages: operational semantics, denotational semantics and axiomatic semantics; Program correctness: the Floyd-Naur partial correctness proof; The axiomatic method of Hoare; Dijkstra's weakest precondition; Hoare's logic for recursive programs; Various programming paradigms: nondeterminism and parallel programs; Dijkstra's guarded commands; Owicki-Gries' method and Stirling's method for verifying parallel programs; Various topics and remarks.
Kurzus
MI BSc: Algorithm Design and Analysis, Algoritmusok tervezése és elemzése, INGK451-K5, INDK451-K5