Output of non-deterministic algorithm may be different for different runs with the same input data
Mittedetermineeritud algoritmi tulemus samade lähteandmete korral võib erinevatel
lahenduskordadel olla erinev.
Tõene
Partial algorithm terminates for any set of input data.
Osaline algoritm peatub mistahes sisendandmete korral.
Väär
Average time complexity of binary search is O(log n).
Kahendotsimise keskmine ajaline keerukus on O(log n).
Tõene
Worst case time complexity of merge sort is O(n).
Ühildusmeetodi (merge sort) halvima juhu ajaline keerukus on O(n).
Väär
(it is O(n log n))
Sorting method is quick if it has average time complexity O(n lon n).
Järjestamismeetod on kiire, kui selle keskmine ajaline keerukus on O(n log n).
Tõene
Jah, üldjuhul ei saa kiiremini
Last element added to the stack is removed first .
Magasini (stack) viimati lisatud element eemaldatakse esimesena.
Tõene
LIFO =Last In First Out
Set of possible values is a component of an abstract data type.
Väärtusvaru on üks abstraktse andmetüübi komponent .
Tõene
True, set of operations is another component
Each element of a doubly linked list contains a pointer to the previous element and a pointer to the
next element of the list.
Topeltseotud ahela iga element sisaldab viita nii eelmisele kui ka järgmisele elemendile.
Tõene
That is what "doubly linked" means
Right parenthetic expression becomes Reverse Polish Notation after removing parentheses and
commas.
Avaldise pööratud poola kuju (RPN) saadakse parempoolsest suluesitusest sulgude ja komade
ärajätmise teel.
Tõene
Full graph is a simple graph.
Iga täisgraaf on lihtgraaf.
Tõene
Each weakly connected digraph is strongly connected.
Iga nõrgalt sidus graaf on tugevalt sidus.
Väär
If there is a cycle in a graph it is impossible to find the topological order of vertices.
Kui graafis esineb tsükkel, siis ei saa graafi tippe topoloogiliselt järjestada.
Tõene
It is possible to convert recursion to loops using stack.
Rekursiooni saab magasini abil teisendada tsükliteks.
Tõene
Exhaustive search algorithms tend to have exponential time complexity.
Ammendava otsingu algoritmid on üldjuhul eksponentsiaalse ajalise keerukusega.
Tõene
Smaller height of the binary search tree leads to more effective search.
Mida väiksem on kahendotsimise puu kõrgus, seda efektiivsem on otsimine.
Tõene
It is possible to express the prefix code using code tree.
Koodipuu abil saab kirjeldada prefikskoodi.
Tõene
Set of edges of the null graph is empty.
Nullgraafi servade hulk on tühi.
Tõene
Self-loops are allowed in a simple graph.
Lihtgraafis võivad esineda silmused .
Väär
kiirmeetod Radix sort, O(n) O(n) Stabiilne. positsioonimeetod Merge sort, O(n logn) O(n logn) On enamasti ühildusmeetod stabiilne. Paisktabel, hash O(1) O(1) table Heap sort, O(n logn) O(n logn) kuhjameetod 1. Algoritmi omadused. Algoritmide asümptootiline analüüs: relatsioonid "suur- O", "väike-o", teeta, "suur-oomega" ja "väike-oomega"; nende definitsioonid ning põhiomadused. Mida miski täpselt tähendab. Algoritm on täpne (üheselt mõistetav) juhis antud ülesande lahendamiseks. Algoritm koosneb lõplikust arvust sammudest, millest igaüks on täidetav lõpliku aja jooksul lõplikke ressursse kasutades. Algoritmi rakendatakse teatavale lähteandmete komplektile (sisend)
.................................................................................................................. 4 3 Muudatused etteantud klassides .................................................................................... 4 3.1 Klass Vertex ........................................................................................................... 4 3.2 Klass Graph ............................................................................................................ 5 4 Algoritmi kirjeldus ........................................................................................................ 5 5 Programmi kasutusjuhend ............................................................................................. 6 6 Testimiskava .................................................................................................................. 7 7 Algoritmi testimine suure koguse andmetega ............................................................. 10 Kasutatud allikad .
Byte - collection of 8 bits / is a unit of storage, 8 binary digits long Kilobyte - A unit of storage capacity (1024 bytes ) Megabyte - 1,048,576 bytes Gigabyte - 1,073,741,824 bytes Terabyte - 1 trillion bytes Algorithm - is a step by step method of solving a problem Program - is the expression of an algorithm in a programming language. ALGORITM - kindel eeskirjade jada, mis määrab üheselt ülesande lahenduskäigu. PROGRAMM - programmeerimiskeeles kirja pandud algoritm Greek logicians ( Kreeka loogikud ): Parmenides (5 sajand e.m.a.) : kasutas pikki loogilisi põhjendusi. Zenon Eleast (5 sajand e.m.a.) - apooriad/paradoksid Sofistid - Sokrates (470-399 e.m.a) - Platon (428/427 - 348/347 e.m.a): Aristoteles : väidete struktuur kui iseseisev uurimisobjekt Aristoteles Süllogismide näited: 1. eeldus: iga koer on imetaja. 2. eeldus: mõned neljajalgsed on koerad. järeldus: mõned neljajalgsed on imetajad. 1. eeldus: kõik luiged on valged 2
Games Programming with Java and Java 3D Andrew Davison Dept. of Computer Engineering Prince of Songkla University HatYai, Songkhla 90112 E-mail: [email protected] Draft: 14th January 2003, #2 Abstract This article looks at the advantages and disadvantages of using Java and Java 3D for games programming. It assumes the reader is familiar with Java, but presents short overviews of gaming, the low-level APIs OpenGL and DirectX, and Java 3D. No programming examples are included here, although links to online code are supplied. 1. Background to Gaming Giving a definition for `computer game' is problematic, due to the wide range of game types. For example, the ArcadePod site (http://www.arcadePod.com) divides its hundreds of Java games into more than ten categories: 3D games, multiplayer, action
Thesis “How is it possible to calculate IT security effectiveness?” Kristjan Kivimaa August 2022 1 Abstract In IT Security world, there is lack of available, reliable systems for measuring security levels/posture. They lack the range of quantitative measurements and easy and fast deployment, and potentially affects companies of all sizes. Readily available security standards provide qualitative security levels, but not quantitative results – that would be easily comparable. This deficiency makes it hard for companies to evaluate their security posture accurately. Absence of security metrics makes it complicated for customers to select the appropriate measures for particular security level needed. The research question for this research project is – “How is it possible to calculate IT security effectiveness?”. The aim of this research is to use this reference m
1. Algoritm. Algoritmi keerukus. Ajalise keerukuse asümptootiline hinnang. Erinevad keerukusklassid: kirjeldus, näited. 1.1 Algoritm • Mingi meetod probleemi lahendamiseks, mida saab realiseerida arvutiprogrogrammi abil. • Algoritm on õige, kui kõigi sisendite korral, mis vastavalt algoritmi kirjeldusele on lubatud, lõpetab ta töö ja annab tulemuse, mis rahuldab ülesande tingimusi. Öeldakse, et algoritm lahendab arvutusülesande. • Selline programm, mis annab probleemile õige vastuse piiratud aja jooksul. • Kindlalt piiritletud sisendi korral vastab ta järgmistele kriteeriumitele: o lõpetab töö piiratud aja jooksul; o kasutab piiratud hulka mälu; o annab probleemile õige vastuse. • Parameetrid, mille järgi hinnata algoritmide headust: o vastava mälu hulk; o töötamise kiirus ehk vajatava aja hulk.
number of execution steps in the GUI; and/or user sets a number of stop criteria and breakpoints; simulator makes random choices without user interaction; only the resulting state is shown via the GUI; a simulation report contains results)) 3. A Single-example protocol/ Net structure The transport layer(– ensures reliable transmissions between hosts – the sender transfers data packagets to a receiver – unreliable communication network– use of sequence numbers, acknowledgements, retransmissions) Next to places an inscription determines token colours( colset NO = int) - NO is the sequence number in the protocol - NOxDATA is the product of types NO and DATA - The colour sets are colset DATA = string and colset NOxDATA = product NO * DATA - DATA is the payload - NOxDATA is the
frames > Operation modes:· Normal Response Mode (NRM): Acknowledged ("Type 3"). 2 forms: protocols at the same time Doing it at the network layer would mean adding are pure binary data (no restrictions) inadvertent STX or ETX in payload can cause incorrect the primary station always initiates transfers to the · Push: source initiates transfer and receives ack authentication within IPv4, IPv6, AppleTalk, IPX, behavior. secondary station
Kõik kommentaarid