Information

Algorithms and Data Structures (laboratory)

  nr:     Notes from classes  
  1.
  2.
  3.
    ads_03   Classes and objects, methods. Arrays.
  4.
    ads_04   The Bubble Sort, Insertion Sort, Sorting Objects.
  5.
    ads_05   Stack, Queues and Priority Queues.
  6.
    ads_06   Single-ended (singly linked) list. Abstract Data Types: stack, queue (double-ended list). Doubly linked list.   Code of example 6 .
  7.
    ads_07   Recursion (second time). Sorting by merging.
  8.
    aisd_08   Quicksort, Improving Quicksort, Shell Sort.
  9.
    ads_09   Trees & Traversing Binary Trees.
  10.
    ads_10 Huffman code (a draft of code which can be used in project). Exemplary file which can be encoded with using Huffman algorithm: shesells.txt .
  11.
  12.
  13.
    ads_13   Hash table (open addressing; probing: linear, qudratic, double hashing). Separate chaining.
  14.
  15.
    ads_15   Short overview of C++ STL Containers.