ProgrammiCeck_P1

Cose Utili per l'esame

• [X] Heap Algorithms

Lezione 1

• [X] Body Mass Index calculator
• [X] Celsius-Farenheit conversion

Lezione 2

• [X] Account
• [X] Invoice
• [X] MotorVehicle
• [X] Date
• [X] Remove duplicate
• [X] Target Hearthrate calculator

Lezione 3

• [X] Student*
• [ ] Min/Max number of a sequence
• [X] Palindrome
• [X] Base-10 to Binary
• [X] Binary to Base-10
• [ ] Encrypt data
• [X] Fibonacci sequence
• [X] Triangle printing program
• [ ] Pithagorean Triples
• [X] Egg-timer program
• [X] DollarAmount

Lezione 4

• [X] Insertion Sort*

Lezione 5

• [X] Craps game*

Lezione 6

• [X] Merge Sort
• [X] Quick Sort
• [X] Longest Common Subsequence (LCS)
• [X] Matrix product
• [X] Add to vector without repetition

Lezione 7

• [X] Time*
• [X] Rectangle
• [X] TicTacToe

Lezione 8

• [X] Date
• [X] Polynomial
• [X] Matrix
• [X] Complex

Lezione 9

• [X] Instrument* (dalla repo pub.)
• [X] Employee*
• [X] Polymorph Banking program
• [X] Paper and publication sorter

Lezione 10

• [X] Opefiple1*
• [X] Readfile*
• [X] File-Position-pointers*
• [X] MainArgumentFile*
• [X] Client Data with Database*
• [ ] Magazzino con file
• [X] Dizionario

Lezione 11

• [X] LinkedList*
• [X] LinkedList - size(), operator[]
• [X] LinkedList - Reversal
• [X] GenericLinkedList*
• [X] DoubleLinkedList* (implementare l'overload di <)
• [X] Ordered DoubleLinkedList (vedi bubblesort)
• [X] CircularLinkedList*
• [X] Sparse Matrix

Lezione 12

• [X] MathException

Lezione 13

• [X] ArrayStack*
• [X] ListStack*
• [X] Expression solver*
• [X] Labirinto
• [X] Stock Span Problem
• [X] ArrayQueue
• [X] LinkedQueue
• [X] DoubleLinkedQueue
• [ ] Deque with DoublyLinkedList*

Lezione 14

• [X] Doubly Linked List with iterators*

Lezione 15

• [X] PriorityQueue*
• [X] Heap Sort

Lezione 17

• [X] BinarySearchTree*
• [X] Map with BST
• [ ] ImpiegatiBST
• [X] STLmapExample

Esercizi

Strutture Dati

• [X] Linked List (singly linked)
• [X] Doubly-Linked List
• [X] Circularly-Linked List
• [X] Array Stack
• [X] Linked Stack
• [X] Array Queue
• [X] Linked Queue (with circular lists)
• [ ] Linked Deque
• [X] BinarySearchTree
• [X] Map

Sorting

• [X] Insertion Sort
• [X] Quick Sort
• [X] Merge Sort
• [X] Bubble Sort
• [X] Heap Sort #

*Usato nelle slide, ma non assegnato come esercizio per casa

BTW: Guida pratica a git: https://rogerdudler.github.io/git-guide/index.it.html (meglio tardi che Pokèmon -cit Croix89)