Abstract
Učbenik Aplikacije računalniški algoritmov je namenjen študentom prve stopnje študijskega programa računalništvo in informacijske tehnologije s ciljem, spoznati algoritme, ki jih uporabniki pri svojem delu pogosto uporabljajo. Z implementacijo teh algoritmov bodo študentje pri prepotrebno rutino za za vstop v umetnost programiranja univerzalnega stroja, to je računalnika. Učbenik prinaša naslednje vsebine: urejanje podatkov v linearnem času, iskanje vzorcev v nizih, iskanje minimalne razdalje urejanja, preproste šifrirnike, metode brezizgubnega stiskanja podatkov, metode transformacije nizov, priponska polja in priponska drevesa ter algoritme v rastrskem prostoru (verižne kode in krivulje polnjenja prostora).
Keywords
računalniški algoritmi;urejanje podatkov v linearnem času;iskanje vzorcev v nizih;iskanje minimalne razdalje urejanja;brezizgubno stiskanje podatkov;transformacije nizov;priponska polja;priponska drevesa;verižne kode;krivulje polnjenja prostora;učbeniki;
Data
Language: |
Slovenian |
Year of publishing: |
2023 |
Typology: |
2.03 - Reviewed University, Higher Education or Higher Vocational Education Textbook |
Organization: |
UM FERI - Faculty of Electrical Engineering and Computer Science |
Publisher: |
Univerza v Mariboru, Univerzitetna založba |
UDC: |
004.021(0.034.2) |
COBISS: |
156306435
|
ISBN: |
978-961-286-752-2 |
Views: |
71 |
Downloads: |
23 |
Average score: |
0 (0 votes) |
Metadata: |
|
Other data
Secondary language: |
English |
Secondary title: |
Applications of Computer Algorithms |
Secondary abstract: |
Textbook Applications of Computer Algorithms is dedicated to the BSc students of Computer Science with the aim of get familiar with the algorithms, used almost everyday by the users. By implementing those algorithms the students shell obtain the necessary routine to enter into the art of programing of the universal machine, i.e. computer. The textbook contains the following chapters: sorting in linear time, pattern matching in strings, minimum editing distance, basic cryptographic algorithms, lossless data compression, string transformations, prefix arrays and prefix trees, and algorithms in raster space (chain codes and space filling curves). |
Secondary keywords: |
sorting in linear time;pattern matching in strings;minimum editing distance;lossless data compression;string transformations;prefix arrays and prefix trees;chain codes;space filling curves; |
Type (COBISS): |
Higher education textbook |
Pages: |
1 spletni vir (1 datoteka PDF (IV, 197, [1] str.)) |
DOI: |
10.18690/um.feri.6.2023 |
ID: |
19346575 |