| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Diskretne strukture
Authors:ID Peterin, Iztok (Author)
ID Tepeh, Aleksandra (Reviewer)
ID Klavžar, Sandi (Reviewer)
ID Perša, Jan (Technical editor)
Files:.pdf RAZ_Peterin_Iztok_2020.pdf (5,40 MB)
MD5: BD9DBB8968E82D3C7D4EE3F8A7BCB7EB
PID: 20.500.12556/dkum/c755b1eb-1905-424a-8f8b-d1ad45fa3508
 
Language:Slovenian
Work type:Unknown
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V učbeniku so predstavljene nekatere veje diskretne matematike, ki so še posebej uporabne v računalništvu. Tako se sprehodimo skozi logiko, s posebnim poudarkom na dokazu. Sledijo teorije, pri katerih igra poglavitno vlogo matematična indukcija oziroma bolj splošno induktivna posplošitev. Spoznamo osnove kombinatorike in teorije števil. Predstavljene so rekurzivne relacije, s katerimi lahko opišemo ponavljajoče se procese. To nam omogoča tudi vrednotenje algoritmov glede na čas potreben za njegovo izvedbo. Relacije, ki so podmnožice kartezičnega produkta poljubnih množic, predstavljajo širok vir presenetljivih rezultatov. Eden izmed njih rezultira v mrežah in njihovih posebnih predstavnikih Booleovih algebrah. Končamo z grafi, ki predstavljajo neverjetno uporaben matematični model za simuliranje procesov iz realnega življenja.
Keywords:izjavni račun, indukcija, kombinatorika, rekurzivna relacija, časovna zahtevnost, teorija števil, relacija, mreža, Booleova algebra, graf
Place of publishing:Maribor
Place of performance:Maribor
Publisher:Univerzitetna založba Univerze
Year of publishing:2020
Year of performance:2020
PID:20.500.12556/DKUM-78112 New window
ISBN:978-961-286-400-2
UDC:510(075.8)(0.034.2)
COBISS.SI-ID:34068995 New window
DOI:doi.org/10.18690/978-961-286-400-2 New window
NUK URN:URN:SI:UM:DK:CBPPQ9YM
Publication date in DKUM:27.10.2020
Views:2002
Downloads:577
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.
Licensing start date:27.10.2020

Secondary language

Language:English
Title:Discrete Structures
Abstract:This text book brings some branches of Discrete mathematics, which are very applicable in Computer science. As such we start with logic and special emphasis on the proof. The chapter on inductive processes follows. We present the fundamentals of counting and number theory. One part is devoted to recurrence relations, that are a basic tool to describe the processes that are repeating. This enables to quantify the algorithms with respect to the time used by them for their execution. Relations are subsets of the Cartesian product of two sets and present a surprising palette of different results. One direction results in latices and Boolean algebras. We end with graphs. A tool that is incredibly useful mathematical model for all sorts of real life processes.
Keywords:logic, induction, combinatorics, recursive relation, time complexity, number theory, relation, latice, Boolean algebra, graph


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica