100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Previously searched by you
Previously searched by you
logo
Samenvatting Data Structures and Algorithms in Java $5.40
Add to cart
Quickly navigate to
Preview
  2.  
  3. Hanzehogeschool Groningen (Hanze)
  4.  
  5. Algorithms & Data Structures

Summary

Samenvatting Data Structures and Algorithms in Java
 0 purchase
  • Course
  • Algorithms & Data Structures
  • 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...

[Show more]

Preview 3 out of 27  pages

Document information

  • No
  • 2, 3, 4, 5, 6, 7, 10, 13
  • November 5, 2022
  • 27
  • 2022/2023
  • Summary

Subjects

  • algoritmes

Connected book

book image

Book Title:

Author(s):

  • Edition:
  • ISBN:
  • Edition:

More summaries for

  • Solution Manual for Data Structures and Algorithms in Java 6th edition by Michael T. Goodrich All Chapters Covered ,Latest Edition,
  • 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
All for this textbook (12)

Written for

  • Hanzehogeschool Groningen (Hanze)
  • HBO ICT
  • Algorithms & Data Structures
All documents for this subject (2)

Seller

avatar-seller
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

2

, BUBBLE SORT .................................................................................................................24
MERGE SORT ...................................................................................................................25
SORTEREN MET VERGELIJKINGEN.........................................................................26
QUICK SORT....................................................................................................................26
BUCKET SORT ................................................................................................................27
EINDCONCLUSIE SORTEERALGORITMES...........................................................27




3

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

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

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

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.40. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

69052 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 15 years now

Start selling
$5.40
  • (0)
Add to cart
Added