diff --git a/ws2019/ipi/uebungen/polynomial.cc b/ws2019/ipi/uebungen/polynomial.cc
new file mode 100644
index 0000000..53c4f7e
--- /dev/null
+++ b/ws2019/ipi/uebungen/polynomial.cc
@@ -0,0 +1,108 @@
+#include <iostream>
+#include <stdio.h>
+#include "simplearray.cc"
+
+template <class T>
+class Polynomial: public SimpleArray<T> {
+    public:
+        // konstruiere Polynom vom Grad n
+        Polynomial<T> (int n);
+
+        // Default-Destruktor ist ok
+        // Default-Copy-Konstruktor ist ok
+        // Default-Zuweisung ist ok
+
+        // Grad des Polynoms
+        int degree();
+
+        // Auswertung
+        T eval (T x);
+
+        // Addition von Polynomen
+        Polynomial<T> operator+ (Polynomial<T> q);
+
+        // Multiplikation von Polynomen
+        Polynomial<T> operator* (Polynomial<T> q);
+
+        // Gleichheit
+        bool operator== (Polynomial q);
+
+        // drucke Polynom
+        void print ();
+};
+
+// Constructor
+template <class T>
+Polynomial<T>::Polynomial(int n)
+    : SimpleArray<T>::SimpleArray(n+1,0.0) {}
+
+// Grad auswerten
+template <class T>
+int Polynomial<T>::degree ()
+{
+    return SimpleArray<T>::maxIndex();
+}
+
+// Addition von Polynomen
+template <class T>
+Polynomial<T> Polynomial<T>::operator+ (Polynomial<T> q) {
+    int nr=degree(); // mein grad
+
+    if (q.degree()>nr) nr=q.degree();
+
+    Polynomial r(nr); // Ergebnispolynom
+
+    for (int i=0; i<=nr; i=i+1)
+    {
+        if (i<=degree())
+            r[i] = r[i]+(*this)[i]; // add me to r
+        if (i<=q.degree())
+            r[i] = r[i]+q[i];       // add q to r
+    }
+
+    return r;
+}
+
+// Multiplikation von Polynomen
+template <class T>
+Polynomial<T> Polynomial<T>::operator* (Polynomial<T> q)
+{
+    Polynomial r(degree()+q.degree()); // Ergebnispolynom
+
+    for (int i=0; i<=degree(); i=i+1)
+        for (int j=0; j<=q.degree(); j=j+1)
+            r[i+j] = r[i+j] + (*this)[i]*q[j];
+
+    return r;
+}
+
+// Drucken
+template <class T>
+void Polynomial<T>::print ()
+{
+    if (degree()<0)
+        std::cout << 0;
+    else
+        std::cout << (*this)[0];
+
+    for (int i=1; i<=SimpleArray<T>::maxIndex(); i=i+1) 
+        std::cout << " + " << (*this)[i] << "*x^" << i;
+
+    std::cout << std::endl;
+}
+
+int main() {
+    Polynomial<float> p(2);
+    p[0] = 1.0;
+    p[1] = 1.0;
+    p.print();
+
+    p = p*p;
+    p.print();
+
+    Polynomial<double> q(3);
+    q[0] = 2.0;
+    q[1] = -1.0;
+    q[3] = 4.0;
+    q.print();
+}
diff --git a/ws2019/ipi/uebungen/simplearray.cc b/ws2019/ipi/uebungen/simplearray.cc
new file mode 100644
index 0000000..9039510
--- /dev/null
+++ b/ws2019/ipi/uebungen/simplearray.cc
@@ -0,0 +1,89 @@
+template <class T>
+class SimpleArray { 
+    public:
+        SimpleArray (int s, T f);
+        SimpleArray (const SimpleArray<T>&);
+        SimpleArray<T>& operator=(const SimpleArray<T>&);
+        ~SimpleArray();
+
+        T& operator[](int i);
+        int numIndices();
+        int minIndex();
+        int maxIndex();
+        bool isMember(int i);
+
+    private:
+        int n;  // Anzahl Elemente
+        T *p;   // Zeiger auf built-in array
+};
+
+// Destruktor
+template <class T>
+SimpleArray<T>::~SimpleArray () { 
+    delete[] p; 
+}
+
+// Konstruktor
+template <class T>
+SimpleArray<T>::SimpleArray (int s, T v) {
+    n = s;
+    p = new T[n];
+    for (int i=0; i<n; i=i+1) p[i]=v;
+}
+
+// Copy-Konstruktor
+template <class T>
+SimpleArray<T>::SimpleArray (const SimpleArray<T>& a) {
+    n = a.n;
+    p = new T[n];
+    for (int i=0; i<n; i=i+1)
+        p[i]=a.p[i];
+}
+
+// Zuweisungsoperator
+template <class T>
+SimpleArray<T>& SimpleArray<T>::operator=(const SimpleArray<T>& a) {
+    if (&a!=this) {
+        if (n!=a.n) {
+            delete[] p;
+            n = a.n;
+            p = new T[n];
+        }
+        for (int i=0; i<n; i=i+1) p[i]=a.p[i];
+    }
+    return *this;
+}
+
+template <class T>
+inline T& SimpleArray<T>::operator[] (int i) { 
+    return p[i];
+}
+
+template <class T>
+inline int SimpleArray<T>::numIndices () { 
+    return n;
+}
+
+template <class T>
+inline int SimpleArray<T>::minIndex () { 
+    return 0; 
+}
+
+template <class T>
+inline int SimpleArray<T>::maxIndex () { 
+    return n-1; 
+}
+
+template <class T>
+inline bool SimpleArray<T>::isMember (int i) {
+    return (i>=0 && i<n);
+}
+
+template <class T>
+std::ostream& operator<< (std::ostream& s, SimpleArray<T>& a) {
+    s << "#( ";
+    for (int i=a.minIndex(); i<=a.maxIndex(); i=i+1)
+        s << a[i] << " ";
+    s << ")" << std::endl;
+    return s;
+}