Video
Create Note
Dear user,
with the manuscript function you'll be able to create your own digital lecture manuscript.
However, in order to link all your notes with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.
with the manuscript function you'll be able to create your own digital lecture manuscript.
However, in order to link all your notes with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.
Add a New Marker
Dear user,
with the marker function you'll be able to create your own digital time markers.
However, in order to link all your markers with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.
with the marker function you'll be able to create your own digital time markers.
However, in order to link all your markers with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.
Tag this content
Please enable javascript to use this function.
Dear user,with the tagging function you'll be able to add taggs to videos.
However, in order to link all your tags with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.
Tags added to this content
No tags have been added to this content so far.
Add Link to this content
Please enable javascript to use this function.
Dear user,with the links function you'll be able to add links to other resources to this content.
However, in order to link all your links with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.
Links added to this content
No links have been added to this content so far.
Links added to the series of this content:
Add to my playlist
Dear user,
with the playlist function you'll be able to create your own lecture video playlists.
However, in order to link all your playlists with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.
with the playlist function you'll be able to create your own lecture video playlists.
However, in order to link all your playlists with your user profile it is required that you
login to the tele-TASK portal to use this functionality.
If you don't have an account yet, you may register for a tele-TASK account here.
Playlists
This content is not used in any playlist.
119621321621828728828935235538939144850751752152452556057657859366374774875075675776776877978078779479780180284484585385485589089189289389515731576158115841645164616501651165516571727173017321734173917471748176918101813181918201837184418471865186618671868187320802165236326463048305430813289352839084380
Lecture Structure
- JUnit (00:00:01)
- A te APIs stehen weiter zur Verfügung (00:00:01)
- möglich (00:00:01)
- Damit Ableitung von TestCase nicht mehr nötig (00:00:01)
- Keynote Amage aea ne en Em ugen rene F fm Afw anen Dame m u 5n1 m mm m n vrm Q (00:03:16)
- A te APIs stehen weiter zur Verfügung (00:03:16)
- Damit Ableitung von TestCase nicht mehr nötig (00:03:16)
- Variante 2 wmport static org junit Asser assertEquaIs (00:03:16)
- Weitere Annotationsklassen für fixture (00:03:16)
- z ipse n e am smme Rmmf Nwqm wm Pvuject Run wmuuw Hm 1103 u v Mam v Lm Q ava 7 un aemn mva 7 k mse 7 mw xwm ua umEn wm nm (00:03:33)
- c ipse n e am some ma mf Nawga e sum Pvuject Run wmuuw Ham 1103 Emoz Mam v Lnw C1 SOÖ ava 7 m mem= m m m pse 7 use s uewß unfumenufwnnunm (00:03:36)
- c ipse n e am some ma mf Nawga e sum Pvuject Run wmuuw Ham 1103 Emoz Mam v Lnw C1 SOÖ m 7 un aemo n e v 7 m pse 7 users uew s unmmßnu w (00:03:38)
- mins n e am some ma mf N wgm swm Pvuject Run wmuuw He p 1104 zzmzz Mam v Lnw Q Java 7 un aemo n esmva 7 mum 7 usw w Dommm wo kspm (00:04:47)
- mins n e am some ma mf Nwga e seem Pvuiec Run wmuuw He p 1105 E z Mam v Lnw C1 ent m 7 un nemo n e 1av 7 mms 7 users mewws nn(um =n w n s = (00:05:52)
- mins n e am some ma mf Nwga e seem Pvuiec Run wmuuw He p nos E z Mam v Lnw C1 ent m 7 un nemo n e 1av 7 mms 7 users mewws nn(um =n w n s = (00:05:55)
- i mins n e am some ma mf Nwgm swm Pwjw Run wmauw Ham nos Em ß Mam v Lnw C1 Java 7 un aemo n es ßva 7 mms 7 usw mw n0mm =n w n s = (00:06:29)
- i mins n e am some ma mf Nwgm swm Pwjw Run wmauw Ham nos Emzs Mam v Lnw C1 Java 7 un aemo n es ßva 7 mms 7 usw mw n0mm =n w n s = f äh E (00:06:31)
- JUnit (00:07:28)
- A te APIs stehen weiter zur Verfügung (00:07:28)
- möglich (00:07:28)
- Damit Ableitung von TestCase nicht mehr nötig (00:07:28)
- 6 =ym= @ Amage sea he en Emmg n nme Kamm Am anen Darstem ng vummven mf we m na mvr i m Q (00:08:27)
- Damit Ableitung von TestCase nicht mehr nötig (00:08:27)
- Variante 2 wmpurt static org junit Assert assertEqua s (00:08:27)
- Weitere Annotationsklassen für fixture (00:08:27)
- A te APIs stehen weiter zur Verfügung (00:08:27)
- Deklaration von Testfällen über Java 5 Anr otationen (00:08:27)
- i =y m mag seammn Emmgen rene wmf Am anen Dars em ng vunu wen ms 4 a1 mn mv w C1 (00:08:38)
- maps n e am some Refmm Nawqm sum qm mm wmauw Hu nos @ w M m nw Q u @m1 1w1 u mmms (00:08:41)
- 6 mins n e am some Refacmr Nawgm Senn Pvojec Run w nauw He4p nos c wuv Mam v Lm C1 (00:08:44)
- 6 mins n e am some Refacmr Nawgm Senn Pvojec Run w nauw Hau nos c wuv Mam v Lm C1 m 7 mn m f mv mmse rum xuewm u men w rk m (00:08:45)
- mins n e am some ma mf Nwga e semn Pvuject Run wmuuw Ham 1109 En n Mam v L w Q m 7 un aem= n e mva 7 mms 7 ums mw s nafumen s womspm (00:09:20)
- mins n e am some ma mf Nwgm semn Pvqw Run w nuuw Ham 1109 Emuv Mam v L w C1 ava 7 un aemo e 1av 7 mmsß 7 usw ewß Dn(um =n wo kspa e (00:09:36)
- mins n e am some ma mf Nwga e wm Pvuject Run wmuuw Ham 1109 Elwauv Mam v L w Q (00:09:38)
- mins n e am some ma mf Nwga e sum Pw w Run wmauw Ham 1109 Ewuv Mam v Lnw Q Am 7 un aemo n @ v 7 mmse 7 usw mw s Dommen wo kspm (00:09:53)
- mins n e am some ma mf Nwgam swm Pw w Run wmuuw He p 11 z zzm Mam v Lnw Q Java 7 un aem= n es ßva 7 m use 7 usw uewß nnmmen s wo kspm (00:12:26)
- kyclesofwar public void test 1() demo x (00:12:27)
- public void test 6() (00:12:27)
- Hb ana (00:12:27)
- public void testIncreasing() (00:12:27)
- for (int (00:12:27)
- GSS6f I tqLlül SLJ alt es (00:12:28)
- UDEH Wll 5qU(Jl SL J Open TYDe H erarchy (00:12:30)
- ellosw ng Open With tEquals(l fib v Open Tvpe Hierarchy (00:12:36)
- nun rum (00:12:37)
- Hut (00:12:47)
- nn snn mw 411 s ifc t (00:12:48)
- num an xs rmrm Ju mn (00:12:59)
- z ips n e am smme Refacmr Nwgm swm Pr yect Run w mww Hu 11 L3 m m Mar nv Lnw Q ma 7 un agmo nßva 7 wmf 7 use s ew uummws wor wa (00:13:07)
- i Eclips n e am sonne Refactor Nwgm seam Pw w Run wmuuw Hu 1113 z m Mam v Lm Q (00:13:14)
- z ipse n e am same ma mv N wgm s@ =m Pvuiec Run wmuuw Hm 11 L1 E w ßm Mam v Lnw C1 uub1 c class F b (00:13:17)
- i mins n e am some ma mv Nwgm s =v Pvuject Run wmuuw Ham 11 L1 Elwzsz Mam v L w C1 (00:13:57)
- uu hc dass fm (00:14:04)
- oProblems 22 (00:14:50)
- Ü Errors wl em) (00:14:50)
- Wa n ngs (10 tems) (00:14:50)
- Problems 23 (00:14:15)
- V Ü Errors fl temk (00:14:15)
- P L Warnings (10 tems (00:14:15)
- t t st l btest 1ava 9 (00:14:14)
- Problems E3 (00:14:14)
- V 0 Errors 1 IIEITL (00:14:14)
- Warnings11O tems (00:14:14)
- P 0 Errors 11 xem (00:14:13)
- Wam ngs (10 tams (00:14:13)
- Javadoc Declar t un EC (00:14:05)
- Ü Error l rm (00:14:05)
- Gun (00:14:04)
- i Eclipse n e am some ma mv Nwgam wm Pwjw Run wmuuw Hm um E Man nunw f Q m 7 wn nemn num 7 m mi u w ew u@ umQn wofksnm (00:14:51)
- m im sm nßmv NJW sum mm am www um LL M M m m Q (00:14:52)
- E lips nm am smme Re a nv Nwgam mm Pw m Run wmuuw Ham 1114 @ n Man wLnw Q wm 7 n nwnm n um mm 7 um mw oqmmm w vkßum (00:14:53)
- c ipse n e am same zm mv Nwgm wm Pvulect mm w nuuw Hm 11 L4 @1 u1 Mam v Lnw Q m 7 un aemu u emm same fu mm w nQmmm w m a (00:14:55)
- 6 mins n e am some ma mf N wgm sea m Pwjeu Run w nauw Ham uze czmu Mam v Lnw Q m 7 un nemn mva 7 sd m 7 uw xwm u um wnfksum (00:26:13)
- 6 mins n e am some ma mf N wgm sea m Pwjw Run w nauw Ham nze czmus Mam v Lnw Q ava 7 un aemu u esmva 7 mms 7 usw ums Dn umen sfwo ksua e (00:26:16)
- c ipse n e am some ma mf Nawgm seam Pwjw mm wmauw Ham uze Emus Mam v L w Q (00:26:21)
- c ipse n e am some ma mf Nawgm sea m Pwjw mm wmauw Ham uze Emus Mam v L w Q (00:26:24)
- public void test 1() assertEquals(1 f b vu1ue(1 (00:27:25)
- assertEquu1s(1 hb vuZue(1 (00:27:26)
- public void test l() asser r Equa1s(1 F b va1ue(1 (00:27:30)
- i mi me am muß amm Nmgm sem Pm n mm w mmw H L E um M u w Q (00:27:31)
- n ips me am some Refactnr Nwgm wm Pvqw Run w mww He u 1127 E am Mar v Lnw Q ma 7 n aem u m m mmi 7 um fwuewmnowm n s wuvmms (00:27:36)
- maps n e am some z a mf Nwgam Emu Pvujec Run w mww Hug 1127 E1 am Man v Lm Q m 7 un nemn hm 7 mms 7 u er mewß nu men wurßnm (00:27:37)
- i mins n e am some ma mf N wgm mfm Pwjw Run wmuuw Hua uzs En n Mam v Lnw C1 (00:28:47)
- cc ipse n e am some ma mf N wgm mm Pwjw Run wmuuw Hua uzs En n Manmv Lnw C1 uubl c class f b (00:28:50)
- m Om u Omwlm m um Tm mmfmvQ mmwävfvsxs 5 vi mum (00:28:52)
- i z ipse n e am some Ram nf Nwqm seam Pvujec Run wmuuw He u zs E wnn Mam v Lnw Q (00:28:58)
- i maps me am same ma mf Nawga mm vwjw Run wmauw Hm 1129 Q nn Man v Lm Q m 7 un aemo mvA 7 mms 7 usw ew @mm wur n = (00:29:07)
- z ips n e am some ma mf Nwgm mm Pwjw Run wmuuw Ham 1129 aw m Mam v L w C1 (00:29:25)
- p mhc stnt c mt valueünt n) if(n =1) (00:29:29)
- n ips n e am some Retacmr Nwgam seam Pw w Run wmuuw Hug 1130 z 1 Mam v Lm Q (00:30:10)
- c ips n e am some R vmnf Nawgm wm Pvulect Run wmuuw Ham nau E 1 Mam v Lnw Q uw wew s n ume u wu 2 (00:30:13)
- mins n e am some ma mf N wgm seam Pvuject Run wmauw He u nau Epfns Mam v L w Q (00:30:19)
- mins n e am some ma mf N wgm seam Pvuject Run wmauw He u nau Epfns Mam v L w Q mv 7 un aemo num 7 sd use 7 uw mms u mmm wofk um (00:30:20)
- c ipse n e am some z a mf Nwgm wm Pvulect Run wmuuw He v 1130 fns Mam v Lnw Q (00:30:37)
- mins n e am some ma mf Nwga e wm Pw w Run wmuuw Hu um En ns Mam v Lnw Q ma 7 un nemm ma 7 mum 7 uw mewß uqcumenws wofksum (00:30:44)
- Q vum (00:30:44)
- vwm (00:30:44)
- m= m5 g ggx (00:30:44)
- F b F = new F b() (00:30:44)
- bwurx (00:30:44)
- nn wnmn z sv (00:30:44)
- n mgß (00:30:44)
- zc i se n e am some z fa mf Nwgm swm Pw w Run wmduw He p man ns Mam v Lm Q (00:30:47)
- i c ipse n e am some ma mf N wgm seam vwjw Run wmuuw He u 1130 E w u Mam v L w Q (00:31:05)
- mins n e am smme ma mv Nawgm m m Pw m Run wmauw He 1131 Emu Mamm nw C1 (00:31:06)
- c ips n e am some ma 1m Nwgm sea m Pw w Run wmuuw He p 1131E1 m1 Mam v 1 w1 C1 (00:31:07)
- c ips n e am some ma mf N wgm wm Pw eq Run wmuuw Hu 1131 Ewzm Mam v m Q (00:31:08)
- Safari A mg sea he en Darstem nq Verlauf Le e m m w Emwwckler Fenster H e Debug un mmu nm (00:31:13)
- Programmiertechnik ll (00:34:40)
- Film MIIIB Men in Black III (00:31:13)
- ww a wqmx (00:31:13)
- Wnr ul (00:31:13)
- Sortieren (00:38:52)
- Leistung eines Algorithmus Laufzeit und (00:52:09)
- Hauptsßeichervefbrauch (00:52:09)
- Laufzeit Zahl der Operationen (00:52:09)
- Hauptspeicherverbrauch (00:52:09)
- Ziel Vergleich zweier Mengen auf Gleichheit (00:48:20)
- Sortierung (00:48:20)
- indirektes Sortieren Zum Vertauschen von Elementen werden nur (00:48:20)
- Primitive Operationen von Elementen (00:43:26)
- Primitive Operationen des Containers (00:43:26)
- nicht adaptiver Algorithmus (00:43:26)
- adaptiver Algorithmus (00:43:26)
- Abstrakte Operation (00:38:52)
- internes Sortieren Elemente sind im Hauptspeicher (00:38:52)
- externes Sortieren Elemente werden vom Programm (00:38:52)
- Selection Sort (00:57:07)
- I Finde kleinstes Element k0 (00:57:07)
- 3 Finde nächst kleinstes Element k (00:57:07)
- 4 Vertausche k mit Element mit nächst kleinster Position n (00:57:07)
- 5 Wiederhole 3 und 4 bis alle Elemente auf ihrem Platz sind (00:57:07)
- Auffinden des minimalen Elements muss stets alle (00:57:07)
- verbleibenden Elemente durchmustern (00:57:07)
- gQri@hrfn ist ins abit (ofdgre Elqrrjent wir phrje (00:57:07)
- lnsertion Sort (01:10:36)
Keyword
Please enable javascript to use this function.
Please enable javascript to use this function.