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 & Algorithms In C++ - 3-Data Structures (1535FTIDAT) $5.92   Add to cart
Quickly navigate to
Preview
  2.  
  3. Universiteit Antwerpen (UA)
  4.  
  5. Industrieel Ingenieur - Elektronica ICT
  6.  
  7. 3-Data Structures (1535FTIDAT)

Summary

Samenvatting Data Structures & Algorithms In C++ - 3-Data Structures (1535FTIDAT)
 3 views  0 purchase
  • Course
  • 3-Data Structures (1535FTIDAT)
  • Institution
  • Universiteit Antwerpen (UA)
  • Book
  • Data Structures and Algorithms in C++

Het vak 3-Data structures wordt in het Engels gegeven. Deze samenvatting is een werkstuk van eigen notities genomen in de les samen met de powerpoint en het boek in 1 document gegoten.

Preview 3 out of 28  pages

Document information

  • Yes
  • May 21, 2023
  • 28
  • 2022/2023
  • Summary

Subjects

  • oop
  • adt
  • pseudocode
  • primitieve operaties
  • bog o notation
  • list based collections
  • array
  • linked list
  • stack
  • queues
  • searching algorithmes
  • sorting algorithmes
  • maps
  • hashing
  • dictionaries
  • priorit
  • list amp sets

Connected book

book image

Book Title:

Author(s):

  • Edition:
  • ISBN:
  • Edition:

More summaries for

  • Excel in Your Studies with [Data Structures and Algorithms in C++Goodrich,2e] Solutions Manual: The Ultimate Resource for Academic Excellence!
  • Class notes CS102 Data Structures and Algorithms in C++, ISBN: 9780470383278
  • Data Structures and Algorithms in C++, Goodrich - Downloadable Solutions Manual (Revised)
All for this textbook (4)

Written for

  • Universiteit Antwerpen (UA)
  • Industrieel Ingenieur - Elektronica ICT
  • 3-Data Structures (1535FTIDAT)
All documents for this subject (1)

Seller

avatar-seller
robels

Content preview

3-Data structures
Table of Contents
Data structures......................................................................................................................................3
Algorithms............................................................................................................................................3
Benodigdheden van algorithme.......................................................................................................3
OOP......................................................................................................................................................4
ADT (Abstract Data Type)...................................................................................................................4
Algoritmische efficiëntie......................................................................................................................4
Pseudocode...........................................................................................................................................5
Afspraken.........................................................................................................................................5
Belangrijke functies..............................................................................................................................6
Primitieve operaties tellen....................................................................................................................6
Big O Notation.....................................................................................................................................7
Big Omega.......................................................................................................................................7
Big Theta..........................................................................................................................................7
Basic math............................................................................................................................................7
List-based collections...........................................................................................................................8
Arrays...............................................................................................................................................8
Main methods..............................................................................................................................8
Costs............................................................................................................................................9
Grow a array (insert)...................................................................................................................9
Linked List.....................................................................................................................................10
Main methods............................................................................................................................10
Singly linked list.......................................................................................................................10
Costs.....................................................................................................................................11
Double linked List.....................................................................................................................11
Cost.......................................................................................................................................11
Circulary linked List..................................................................................................................11
Stacks.............................................................................................................................................11
Methodes...................................................................................................................................11
Array-based stacks....................................................................................................................12
Queues...........................................................................................................................................12
Methodes...................................................................................................................................12
Searching Algorithms.........................................................................................................................13
Lineair Search................................................................................................................................13
Binairy Search................................................................................................................................13
Sorting Algorithms.............................................................................................................................14
Insertion Sorting Algorithm...........................................................................................................14
Bubble Sort....................................................................................................................................14
Selection Sort.................................................................................................................................14
Quick Sort......................................................................................................................................15
Cost.......................................................................................................................................15
Merge Sort.....................................................................................................................................15
List & sets...........................................................................................................................................15
MAPS.................................................................................................................................................15
Methodes........................................................................................................................................16

1

, Entry ADT......................................................................................................................................16
Opbouw..........................................................................................................................................16
Costs met list-based map...............................................................................................................16
Hashing...............................................................................................................................................17
Soorten hash codes.........................................................................................................................17
Soorten compression functions......................................................................................................17
Collision handeling........................................................................................................................18
Seperate chaining......................................................................................................................18
Open addressing........................................................................................................................18
Linear probing...........................................................................................................................18
Double hashing.........................................................................................................................18
Cost................................................................................................................................................18
Dictionaries.........................................................................................................................................19
Methodes........................................................................................................................................19
Costs met list-based map...............................................................................................................19
Search table....................................................................................................................................19
Binary search.................................................................................................................................20
Priority Queues...................................................................................................................................20
sorted list........................................................................................................................................20
Unsorted list...................................................................................................................................20
Selection sort..................................................................................................................................20
Insertion sort..................................................................................................................................20
Trees...................................................................................................................................................21
Terminologie..................................................................................................................................21
ADT...............................................................................................................................................21
Methodes........................................................................................................................................21
Soorten verplaatsingen...................................................................................................................21
Binary trees....................................................................................................................................22
Proper Binary Trees.......................................................................................................................22
Vb array.....................................................................................................................................22
binary search.............................................................................................................................22
binary insertion.........................................................................................................................22
binary deletion...........................................................................................................................23
Heap...............................................................................................................................................23
Insertion max Heap (upheap)....................................................................................................23
Deletion max Heap (downheap)...............................................................................................23
Sort............................................................................................................................................23
Graphs.................................................................................................................................................24
terminologie...................................................................................................................................24
Edge types......................................................................................................................................24
graph types.....................................................................................................................................24
Terminologie..................................................................................................................................24
Properties.......................................................................................................................................25
Methods.........................................................................................................................................25
Structure.........................................................................................................................................25
graphs.............................................................................................................................................26
DFS (Depth-First Search) & BFS (Breadth-First Search).............................................................27
Directed Graph...................................................................................................................................28
Dijkstra algoritme..........................................................................................................................28



2

, Data structures
DEF: We gebruiken data structuren om ongeorganiseerde data op te slaan als
georganiseerde data om nadien efficiënt te gebruiken.
Gebruik: In een computer programma waar
de Instructies + Data gebruiken. Hier moet de
data georganiseerd beschikbaar zijn en
raadpleegbaar zijn.
Bij grotere applicaties is efficiëntie de sleutel.


Voorbeeld: Array is een voorbeeld van een data structuur.
• Een array plaatsen we in het RAM op een vaste grootte.
• Gemakkelijk om data op te zoeken
• Slecht om te gebruiken wanneer we de array moeten vergroten of verkleinen.
TIP: Ken je limitaties van geheugenopslag.


Algorithms
DEF: Een oplossing voor een algoritmisch probleem. (optellen van
getallen, gemiddelde, fibonachi, …)
Hier hebben we altijd een input dat lijd naar een output.
We kunnen algoritmes schrijven in code maar ook in pseudcode.


Benodigdheden van algorithme

Juistheid Efficiëntie

Concrete stappen
Zekerheid
Niet dubbelzinnig geschreven

Eindigende aantal stappen
Eindigend
Het moet eindigen




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 robels. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $5.92. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

67096 documents were sold in the last 30 days

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

Start selling
$5.92
  • (0)
  Add to cart