Samenvatting Data Structures and Algorithms in Java
8 views 0 purchase
Course
Algoritme En Datastructuren
Institution
Hanzehogeschool Groningen (Hanze)
Book
Data Structures and Algorithms in Java
Deze samenvatting kan gebruikt worden als voorbereiding op het vak Algoritmiek I aan de Hanzehogeschool. Tijdens dit vak zijn onder andere behandelt: hoe werken algoritmen, hoe wordt bewezen dat de ene sneller is dan de andere, en hoe worden deze in java geimplementeerd.
Wat je gaat leren:
- St...
Solution Manual for Data Structures and Algorithms in Java 6th edition by Michael T. Goodrich
Solution Manual for Data Structures and Algorithms in Java 6th edition by Michael T. Goodrich || A+
Solution Manual for Data Structures and Algorithms in Java 6th Edition by Michael T. Goodrich, Roberto Tamassia, All Chapters | Complete Guide A+
All for this textbook (16)
Written for
Hanzehogeschool Groningen (Hanze)
HBO ICT
Algoritme En Datastructuren
All documents for this subject (2)
Seller
Follow
karsninteman
Content preview
ALGORITMIEK I
ICTVT SE 2.1
Samenvatting
,TABLE OF CONTENTS
1. COMPLEXITEITSANALYSE....................................................................................... 4
ANALYSETYPES ............................................................................................................... 4
VEELVOORKOMENDE MATHEMATISCHE FUNCTIES....................................... 5
DE CONSTANTE FUNCTIE....................................................................................... 5
DE LOGARITMISCHE FUNCTIE .............................................................................. 5
DE LINEARE FUNCTIE ................................................................................................ 5
DE N-LOG-N FUNCTIE ................................................................................................ 5
DE KWADRATISCHE FUNCTIE............................................................................... 6
DE HOGEREMACHTS FUNCTIE.............................................................................. 6
DE EXPONENTIELE FUNCTIE ................................................................................. 6
BIG-OH NOTATIE ............................................................................................................ 7
REKENREGELS v. DOUWES ......................................................................................... 8
2. LOGICA ............................................................................................................................ 9
PROPOSITIELOGICA ...................................................................................................... 9
PREDIKATENLOGICA ..................................................................................................10
3. RECURSIE EN INDUCTIE .........................................................................................12
INDUCTIE .........................................................................................................................12
RECURSIE..........................................................................................................................13
4. ARRAYS EN LINKED LISTS .....................................................................................14
ARRAYS .............................................................................................................................14
LINKED LISTS ..................................................................................................................15
DOUBLY LINKED LISTS...............................................................................................16
CIRCULARLY LINKED LISTS......................................................................................17
5. STACKS, QUEUES EN LIJSTEN ..............................................................................18
STACKS..............................................................................................................................18
QUEUE ...............................................................................................................................19
LIST .....................................................................................................................................19
6. HASH MAPS ..................................................................................................................21
MAP .....................................................................................................................................21
HASH ..................................................................................................................................22
SET.......................................................................................................................................23
7. SORTEREN ....................................................................................................................24
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 karsninteman. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $5.60. You're not tied to anything after your purchase.