Summary
Samenvatting IPRO2 2019/2020
- Course
- Institution
Samenvatting IPRO2 2019/2020 met Big O, debuggen/unit testen, recursie, soorten sort, lists, stack, queue, hash table, binaire bomen
[Show more]
Seller
Follow
molodo
Content preview
SAMENVATTING IPRO2PERIODE 2
LEERJAAR 2(2019/2020)
,Inhoud
Week 1 .................................................................................................................................................... 2
Big O .................................................................................................................................................... 2
Wat is log: ....................................................................................................................................... 3
Binair zoeken:...................................................................................................................................... 3
Problem solving: ................................................................................................................................. 4
Week 2 .................................................................................................................................................... 4
Testing VS Debugging:......................................................................................................................... 4
Debuggen ............................................................................................................................................ 4
Unit testen .......................................................................................................................................... 5
Week 3 .................................................................................................................................................... 7
Recursie............................................................................................................................................... 7
Bubble sort: ......................................................................................................................................... 7
Merge sort: ......................................................................................................................................... 8
Week 4 .................................................................................................................................................... 9
Enkel Gelinkte lijst (lineaire lijst)......................................................................................................... 9
Dubbel Gelinkte lijst ............................................................................................................................ 9
Week 5 .................................................................................................................................................. 10
Stack .................................................................................................................................................. 10
Queue................................................................................................................................................ 11
Hash table ......................................................................................................................................... 12
Week 6 .................................................................................................................................................. 13
Bomen ............................................................................................................................................... 13
Binaire zoekboom ......................................................................................................................... 14
Expressieboom .............................................................................................................................. 15
1
, Week 1
Big O
Big o is een notatie waarmee je de performance van een algoritme aantoont. Het geeft de tijd en de
ruimte van de slechtste complexiteit aan.
Worst case opties:
tijdcomplexiteit: Hoe traag is een algoritme
ruimtecomplexiteit: Hoe veel ruimte gebruikt mijn algoritme
Hoe noteer je een Big O notatie: je kijkt naar het aantal stappen wat je code doorloopt om aan het
einde te komen dit noteer je als N
Voorbeeld: zoek Z (A D F G H K M O P Z) hier is N = 11 (hij heeft 11 stappen nodig om bij Z te komen)
en notatie is O(n) = Linear zoeken.
Linear zoeken is het aantal stappen die toenemen op hoe groot het gene wat die uitvoert;
Constant zoeken is wanneer het altijd hetzelfde aantal uitvoert ongeacht wat jij meegeeft aan de
functie.
2
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller molodo. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $5.57. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
64257 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 15 years now