e-lecturer note

Algorithms

---

These notes assume the reader has mastered the material covered in the first two years
of a strong undergraduate computer science curriculum, and that they have the intellectual
maturity to recognize and repair any remaining gaps in their mastery. In particular, for most
students, these notes are not suitable for a first course in data structures and algorithms. Specific
prerequisites include the following:
• Discrete mathematics: High-school algebra, logarithm identities, naive set theory, Boolean
algebra, first-order predicate logic, sets, functions, equivalences, partial orders, modular
arithmetic, recursive definitions, trees (as abstract objects, not data structures), graphs.
• Proof techniques: direct, indirect, contradiction, exhaustive case analysis, and induction
(especially “strong” and “structural” induction). Lecture 0 requires induction, and whenever
Lecture n

---

Ketersediaan

Tidak ada salinan data

Informasi Detail

Judul Seri

-

No. Panggil

-

Penerbit

: http://www.cs.illinois.edu/~jeffe/teaching/algorithms/., 2014

Deskripsi Fisik

-

Bahasa

English

ISBN/ISSN

-

Klasifikasi

-

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

MATEMATIKA

Info Detail Spesifik

-

Pernyataan Tanggungjawab

agus

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar