go to start Ex W12
|home |print view |recent changes |changed December 6, 2018 |
exact
|You are 18.205.19.203 <- set your identity!

Sections: Introductory Questions | Managing Objects on the Heap | Shared Pointer to =[this]= | Deduction Guide for =[dynArray]= | Topological Sort | NOTE |

Introductory Questions ^

Managing Objects on the Heap ^

How do you create an instance of the default-constructible type Block on the heap?

How do you delete the instance created on the heap?

What problem arises if you have loops in your object structure and how do you solve this?

Shared Pointer to this ^

How can you access to a shared pointer from within the this object?

Deduction Guide for dynArray ^

Your dynArray class template features a range-constructor. This constructor is a function template itself and there is no direct mapping from the iterator type to the container's element type. Therefore, you need to write a deduction guide in order to omit the class template arguments when constructing a dynArray from a range. Add that deduction guide.

Note: Eclipse CDT/Cevelop does not recognize deduction guides syntactially yet. Therefore, you will need to ingore the syntax error in the editor marked with a questionmark in the orange box. Rely on the compiler regarding error messages in this case.

Topological Sort ^

Solve the exercise from the OO module in C++ using (smart) pointers to build the graph of objects.

output:

1: Math OO
2: DB1 AD1 CPI
3: DB2 SE1 UI1
4: SE2 UI2
5: Thesis

NOTE ^

Optional:

see also skripte server: https://skripte.hsr.ch/Informatik/Fachbereich/Objektorientierte_Programmierung/OO/Fr%c3%bchere_Vorlesung_HS_2017/%c3%9cbungen/08_Collections_TESTAT2/


|home |print view |recent changes |changed December 6, 2018 |
exact
|You are 18.205.19.203 <- set your identity!

Ex W12
go to start