Summary
samenvatting datastructuren
- Course
- Institution
Samenvatting van het vak Datastructuren zoals het gegeven wordt bij Informatica aan de Universiteit Leiden.
[Show more]
1 review
By: peternagels • 4 year ago
Seller
Follow
tpakats
Reviews received
Content preview
Samenvatting DatastructurenTimo Kats, Informatica en Economie
1
,Indeling:
1. Basic Datastructures
2. Tree Traversal
3. Binary Search Trees
4. Balancing Binairy trees
5. Priority Queues
6. B-Trees
7. Graphs
8. Hash Tables
9. Data Compression
10. Pattern Matching
(ADT’s zijn rood omdat ze letterlijk teruggevraagd worden in het TT, de andere onderwerpen moet je
vooral kunnen toepassen)
2
,1: Basic Datastructures:
Wat is een ADT (Abstract Data Structure)?
Een abstracte datastructuur is een beschrijving van een datastructuur, met
de specificatie van wat er opgeslagen wordt (de data en hun structuur) en
welke operaties op de data zijn toegestaan.
Stack:
• LIFO, data wordt bovenaan de ‘Stack’ toegevoegd.
• ADT Stack:
▪ INITIALIZE: construct an empty sequence ().
▪ ISEMPTY: check whether there the stack is empty, i.e., contains
no elements).
▪ SIZE: return the number of elements, the length of the
sequence(x1,...,xn).
▪ TOP: returns the top xn of the list (x1,...,xn). Undefined on the
empty sequence.
▪ PUSH(x): add the given element x to the top of the sequence
(x1,...,xn), so afterwards the sequence is (x1,...,xn,x).
▪ POP: removes the topmost xn element of the sequence
(x1,...,xn), so afterwards the sequence is (x1,...,xn−1).
Undefined on the empty sequence.
3
, Queue:
• FIFO, data wordt opgeslagen in dezelfde volgorde als het wordt
toegevoegd.
• ADT Queue:
▪ INITIALIZE: construct an empty sequence ().
▪ ISEMPTY: check whether there the queue is empty, i.e., contains
no elements).
▪ SIZE: return the number of elements, the length of the
sequence(x1,...,xn).
▪ FRONT: returns the first element x1 of the sequence (x1,...,xn).
Undefined on the empty sequence.
▪ ENQUEUE(x): add the given element x to the end/back of the
sequence (x1,...,xn), so afterwards the sequence is (x1,...,xn,x).
▪ DEQUEUE: removes the first element of the sequence (x1,...,xn), so
afterwards the sequence is (x2,...,xn). Undefined on the empty
sequence.
List:
• Slaat lineaire sequenties van elementen op.
• ADT List:
▪ INITIALIZE: construct an empty List().
▪ EMPTY TEST: check whether there the stack is empty, i.e., contains
no elements).
▪ RETRIEVAL: Get an element from the List
▪ CHANGE and DELETION of the value stored at a certain position
▪ ADDITION(x) of a new value "in between" two existing values, as
well as before the first or after the last position.
4
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 tpakats. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $5.89. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
70055 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now