<rss version="2.0">
<channel>
<title>schule.informatik :: Informatik-Unterricht.</title>
<link>http://www.nnseek.com/e/schule.informatik/</link>
<description>Posts for schule.informatik</description>
<lastBuildDate>Sat, 06 Sep 2008 07:23:03 PDT</lastBuildDate>
  <image>
    <title>http://www.nnseek.com/</title>
    <link>http://www.nnseek.com/</link>
    <url>http://www.nnseek.com/img/64.png</url>
    <width>64</width>
    <height>64</height>
    <description>NNSeek</description>
  </image>
<item>
	<title><![CDATA[Infix und Postfix]]></title>
	<guid>http://www.nnseek.com/e/schule.informatik/infix_und_postfix_76726994t.html</guid>
	<link>http://www.nnseek.com/e/schule.informatik/infix_und_postfix_76726994t.html</link>
	<description><![CDATA[Hallo Leute,<br><br>kann mir einer mal erklären, was bei der Programmierung,<br>die beiden Begriffe Infix und Postfix zu bedeuten haben?<br><br>Danke schonmal<br>Jens <br><br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/schule.informatik/">schule.informatik</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/infix_und_postfix_76726994t.html"><b>4</b> Comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/infix_und_postfix_76726994m.html">Reply</a></td>
      </tr></table><br>]]></description>
	<pubDate>Sat, 06 Sep 2008 07:23:03 PDT</pubDate>
</item>
<item>
	<title><![CDATA[Was f&uuml;r die InformatikLehrer oder interessierte Sch&uuml;ler ...]]></title>
	<guid>http://www.nnseek.com/e/schule.informatik/was_f9r_die_informatiklehrer_oder_interessierte_sc_72978898t.html</guid>
	<link>http://www.nnseek.com/e/schule.informatik/was_f9r_die_informatiklehrer_oder_interessierte_sc_72978898t.html</link>
	<description><![CDATA[Hallo,<br><br>hier nun mal ein Beispiel für eine EvaluierungsKlasse (wenn interesse<br>besteht, machen wir auch einen Interpreter ...)<br><br>Der folgende Code funktioniert beim "SetExpr" Ausdruck "(5+3)*2" recht gut<br>nur 5+3*2 macht bei der Ausgabe Probleme ...<br>Das gilt es zu lösen.<br><br>Richtig: (5+3)*2 ...<br> ; a = 5.0<br> mov edx, 5 ; Vorkomma<br> mov eax, 0 ; Nachkomma<br> mov ebx, a<br> call Fix2Gleit ; ruft die KonvertierungsRoutine auf<br> fld qword [a]  ; lädt die Variable "a" in die FPU<br> ; a = 3.0<br> mov edx, 3 ; Vorkomma<br> mov eax, 0 ; Nachkomma<br> mov ebx, b<br> call Fix2Gleit<br> fld qword [b]    ; lädt die Variable "b" in die FPU<br> fadd qword [a]   ; addiert zu "b" die var. "a"<br> fstp qword [ebx] ; Ergebnis "8" abspeichern in reg. "EBX"<br> call Ausgabe     ; Ergebnis auf Bildschirm ausgeben<br> ; a = 2.0<br> mov edx, 2 ; Vorkomma<br> mov eax, 0 ; Nachkomma<br> mov ebx, c<br> call Fix2Gleit   ; Konvertierungsroutine<br> fld qword [c]    ; var. "c" in FPU laden<br> fmul qword [b]   ; mit "b" multiplizieren<br> fstp qword [ebx] ; Ergebnis speichern<br> call Ausgabe     ; Ergebnis auf Bildschirm ausgeben<br> ret<br><br>Hier der EvalKlassenCode (Delphi/Pascal):<br><br>type<br>  TParserClass = class<br>  private<br>    FExpression: string;<br>    FExprNumbers: integer;<br>    FLook: char;<br>    FPtr: integer;<br>    FParseMode: Byte;<br>  public<br>    function  EvalExpression: extended;<br>    function  Term: Extended;<br>    function  Factor: extended;<br>    procedure Match(const x: char);<br>    function  GetNumber: extended;<br>    procedure Expected(const s: string);<br>    function  IsDigit(const c: char): boolean;<br>    function  GetValue: extended;<br>    procedure GetChar;<br>    procedure SetExpr(e: String);<br>    procedure SkipWhiteSpace2;<br>    constructor Create;<br>  end;<br><br><br>constructor TParserClass.Create;<br>begin<br>tmpcode :=<br>#9+'BITS 32'+#10+<br>#9+'cpu 486'+#10+<br>#10+<br>#9+'extern _printf, _test_wert'+#10+<br>#10+<br>#9+'section .data'+#10+<br>#9+'global a,b,c'+#10+<br>'a:'+#9+'dq 1.0'+#10+<br>'b:'+#9+'dq 1.0'+#10+<br>'c:'+#9+'dq 1.0'+#10+<br>#10+<br>#9+'section .text'+#10+<br>#9+'extern Fix2Gleit, Ausgabe'+#10+<br>#9+'global _main'+#10+<br>'_main:'+#10+<br>#9+'push'+#9+'ebp'+#10+<br>#9+'mov'+#9+'ebp, esp'+#10+<br>#9+'sub'+#9+'esp, 32'+#10;<br>end;<br><br>function TParserClass.EvalExpression: extended;<br>  function IsAddOp(const c: char): boolean;<br>  begin<br>    result := c in ['+', '-'];<br>  end;<br>var<br>  s1,s2: String;<br>  et: Extended;<br>begin<br>  result := 0.0;<br>  try<br>    if not IsAddop(FLook) then<br>    begin<br>      et := Term;<br>      result := et;<br>    end;<br><br>    while IsAddop(FLook) do begin<br>      case FLook of<br>        '+': begin<br>            Match('+');<br>            et := Term;<br>            if Fparsemode = 1 then begin<br>              result := result + et;<br>              exit;<br>            end;<br><br><br>            s1 := 'a';<br><br>            tmpcode := tmpcode + #9 + 'fadd qword ['+s1+']' + #10;<br>            tmpcode := tmpcode + #9 + 'fstp qword [ebx]' + #10;<br><br>            tmpcode := tmpcode + #9 + 'call Ausgabe'+#10;<br>            result := result + et;<br>          end;<br>        '-': begin<br>            Match('-');<br>            et := Term;<br>            if Fparsemode = 1 then begin<br>              result := result - et;<br>              exit;<br>            end;<br><br>            tmpcode := tmpcode + 'call _subtrahieren'+#10;<br>            result := result - et;<br>          end;<br>      end;<br>    end;<br>  except<br>    on E: Exception do<br>      raise Exception.Create(e.message);<br>  end;<br>end;<br><br>function TParserClass.Term: extended;<br>var<br>  ef : Extended;<br>  s1 : String;<br>begin<br>  result := Factor;<br>  try<br>    while FLook in ['*', '/'] do begin<br>      case FLook of<br>        '*': begin<br>            Match('*');<br>            ef := Factor;<br>            if Fparsemode = 1 then begin<br>              result := result * ef;<br>              exit;<br>            end;<br><br>            if regcounter = 0 then s1 := 'b' else<br>            if regcounter = 1 then s1 := 'c' else s1 := 'b';<br><br>            tmpcode := tmpcode + #9 + 'fmul qword ['+ s1 +']' + #10;<br>            tmpcode := tmpcode + #9 + 'fstp qword [ebx]' + #10;<br><br>            tmpcode := tmpcode + #9 + 'call Ausgabe'+#10;<br>            result := result * ef;<br>          end;<br>        '/': begin<br>            Match('/');<br>            ef := Factor;<br>            if Fparsemode = 1 then begin<br>              result := result / ef;<br>              exit;<br>            end;<br><br>            result  := result / ef;<br>          end;<br>      end;<br>    end;<br>  except<br>    on E: Exception do<br>      raise Exception.Create(e.message);<br>  end;<br>end;<br><br>function TParserClass.IsDigit(const c: char): boolean;<br>begin<br>  result := c in ['0'..'9'];<br>end;<br><br>function TParserClass.GetNumber: extended;<br>var<br>  f: extended;<br>begin<br>  result := 0.0;<br>  try<br>    if not IsDigit(FLook) then Expected('Value');<br>    while IsDigit(FLook) do begin<br>      result := 10 * result + Ord(FLook) - Ord('0');<br>      GetChar;<br>    end;<br>    if FLook = '.' then begin<br>      Match('.');<br>      f := 10;<br>      while IsDigit(FLook) do begin<br>        result := result + (Ord(FLook) - Ord('0')) / f;<br>        f := f * 10;<br>        GetChar;<br>      end;<br>    end;<br>    if FParseMode = 1 then inc(FExprNumbers);<br>    SkipWhiteSpace2;<br>  except<br>    on E: Exception do<br>      raise Exception.Create(e.message);<br>  end;<br>end;<br><br>function TParserClass.Factor: extended;<br>var<br>  undefined: boolean;<br>  ident,s1,s2, s3,s: string;<br>  i: integer;<br>  en: Extended;<br>  bw: Boolean;<br>  fw: single;<br>  looker: char;<br>  fs: TFileStream;<br>  r1, r2: Real;<br>begin<br>  try<br>    if FLook = '(' then begin<br>      Match('(');<br>      result := EvalExpression;<br>      Match(')');<br>    end else<br>    begin<br>      en := GetNumber;<br>      if Fparsemode = 1 then begin<br>        result := en;<br>        exit;<br>      end;<br>      inc(FExprNumbers);<br><br>      r1 := Frac(en);<br>      if r1 = 0 then<br>      s1 := '0' else<br>      s1 := Copy(FloatToStr(r1),3,Length(FloatToStr(r1)));<br><br>      r2 := Int(en);<br>      s2 := FloatToStr(r2);<br><br>      if regcounter = 0 then s3 := 'a' else<br>      if regcounter = 1 then s3 := 'b' else s3 := 'c';<br><br>        tmpcode := tmpcode + #9 + '; a = ' + s2 + '.' + s1 + #10;<br>        tmpcode := tmpcode + #9 + 'mov' + #9 + 'edx, ' + s2 + #9 + #10;<br>        tmpcode := tmpcode + #9 + 'mov' + #9 + 'eax, ' + s1 + #9 + #10;<br>        tmpcode := tmpcode + #9 + 'mov' + #9 + 'ebx, ' + s3 + #10;<br>        tmpcode := tmpcode + #9 + 'call'+ #9 + 'Fix2Gleit'+#10;<br>        tmpcode := tmpcode + #9 + 'fld' + #9 + 'qword ['+s3+']'+#10;<br><br>      inc(regcounter);<br>      result := en;<br>    end;<br>  except<br>    on E: Exception do<br>      raise Exception.Create(e.message);<br>  end;<br>end;<br><br><br>procedure TParserClass.SkipWhitespace2;<br>begin<br>  while FLook in [' ', #9] do<br>    GetChar;<br>end;<br><br><br>procedure TParserClass.GetChar;<br>begin<br>  if FPtr < Length(FExpression) then begin<br>    inc(FPtr);<br>    FLook := FExpression[FPtr];<br>  end else<br>    FLook := #0;<br>end;<br><br>procedure TParserClass.Match(const x: char);<br>begin<br>  if FLook = x then begin<br>    GetChar;<br>    SkipWhiteSpace2;<br>  end else<br>    Expected('''' + x + '''');<br>end;<br><br>procedure TParserClass.Expected(const s: string);<br>begin<br>  RAISE Exception.Create(s + ' expected');<br>end;<br><br><br>function TParserClass.GetValue: extended;<br>var ee: Extended;<br>begin<br>  try<br>    FPtr := 0;<br>    GetChar;<br>    ee := EvalExpression;<br>    inc(FExprNumbers);<br>    result := ee;<br>  finally<br>  end;<br>end;<br><br>procedure TParserClass.SetExpr(e: String);<br>begin<br>  FParseMode := 2;<br>  FExprNumbers := 0;<br>  FExpression := e;<br>  showmessage(FloatToStr(GetValue));<br>end;<br><br>Das Showmessagedialogfeld gibt 16 aus .. also richtig.<br>Nur der AssemblerOutputCode ist falsch .. da muss nen algo. her<br>denke ich mir ...<br><br>--------------------------------<br>Hier nun der Komplette ASM-Code:<br>kompiliert mit "nasm" für win32<br>und den MingW CC Compiler<br>Eine Beispielumgebnung kann hier geladen werden:<br><a href="http://kallup.part-time-scientists.com/setup.exe" rel="nofollow" class="url" target="_blank">http://kallup.part-time-scientists.com/setup.exe</a><br><br>Dazu das Programm starten, Datei öffnen,<br>FormTest2.wfm öffnen und dann auf das Menu<br>"Start->Ausführen" klicken<br><br>;-----------------<br>; Datei: test.asm<br>;-----------------<br> BITS 32<br> cpu 486<br><br> extern _printf, _test_wert<br><br> section .data<br> global a,b,c<br>a: dq 1.0<br>b: dq 1.0<br>c: dq 1.0<br><br> section .text<br> extern Fix2Gleit, Ausgabe<br> global _main<br>_main:<br> push ebp<br> mov ebp, esp<br> sub esp, 32<br> ; a = 5.0<br> mov edx, 5 ; Vorkomma<br> mov eax, 0 ; Nachkomma<br> mov ebx, a<br> call Fix2Gleit<br> fld qword [a]<br> ; a = 3.0<br> mov edx, 3 ; Vorkomma<br> mov eax, 0 ; Nachkomma<br> mov ebx, b<br> call Fix2Gleit<br> fld qword [b]<br> fadd qword [a]<br> fstp qword [ebx]<br> call Ausgabe<br> ; a = 2.0<br> mov edx, 2 ; Vorkomma<br> mov eax, 0 ; Nachkomma<br> mov ebx, c<br> call Fix2Gleit<br> fld qword [c]<br> fmul qword [b]<br> fstp qword [ebx]<br> call Ausgabe<br> leave<br> ret<br><br>;--------------------------<br>; i:> nasm -f win32 fix.asm<br>;--------------------------<br>; Datei: fix.asm<br>;--------------------------<br>        bits 32<br>        cpu 486<br>        section .data<br>zehn:   dd 10<br>        section .text<br>        extern a,b,c<br>        global Fix2Gleit, Ausgabe<br>Fix2Gleit:<br>  mov [ebx], edx   ; Vorkomma<br>  mov [ebx+4], eax ; Nachkomma<br><br>; Anzahl der Dezimalstellen der Nachkommazahl bestimmen<br>  push ebx<br>  mov ebx, 10<br>  xor ecx, ecx<br>.1:<br>  inc ecx<br>  xor edx, edx<br>  div ebx<br>  test eax, eax<br>  jne .1<br><br>; Den Divisor für die FPU bestimmen<br>  mov eax, 1<br>  mov ebx, 10<br>.2:<br>  mul ebx<br>  loop .2<br>  mov dword [zehn], eax<br>  pop ebx<br><br>  fild dword [ebx+4] ; Nachkommazahl<br>  fidiv dword [zehn] ; Nachkommazahl in Realzahl umwandeln<br>  fiadd dword [ebx]  ; Vorkommazahl hinzu<br>  fstp qword [ebx]   ; Ergebnis als Double abspeichern<br>  ret<br><br>EXTERN _printf, a,b,c<br><br>SECTION .data<br>fmt: db "%%s, a=%%.10f, b=%%.10f, c=%%.10f",10,0<br>fm2: db "%%s, a=%%.10f",10,0<br>str: db "c=a*b",0<br><br>SECTION .text<br>Ausgabe:<br>;  push dword [c+4] ; double c (bottom)<br>;  push dword [c]   ; double c<br>;  push dword [b+4] ; double b (bottom)<br>;  push dword [b]   ; double b<br>  push dword [ebx+4] ; double a (bottom)<br>  push dword [ebx]   ; double a<br>  push str         ; users string<br>  push fm2         ; address of format string<br>  call _printf     ; Call C function<br>  add esp,16       ; pop stack 8*4 bytes<br>  ret<br><br>--------------------------------------------<br><br>so alle Dateien zusammenführen:<br><br>c:> gcc -o test.exe test.obj fix.obj math.cc -lstdc++<br><br>Inztance öffnen:<br><br>var<br>pc: TParserClass;<br>...<br>    pc := TParserClass.Create;<br>    pc.SetExpr('(5+3)*2');<br><br>    tmpcode := tmpcode +<br>    #9+'leave'+#10+<br>    #9+'ret';<br>    showmessage(tmpcode);<br>...<br><br>Grüße<br>Jens<br><br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/schule.informatik/">schule.informatik</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/was_f9r_die_informatiklehrer_oder_interessierte_sc_72978898t.html"><b>1</b> Comment</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/was_f9r_die_informatiklehrer_oder_interessierte_sc_72978898m.html">Reply</a></td>
      </tr></table><br>]]></description>
	<pubDate>Sat, 19 Jul 2008 10:32:58 PDT</pubDate>
</item>
<item>
	<title><![CDATA[Kostenloser Virenschutz f&uuml;r Schul-PC und Schulserver ...]]></title>
	<guid>http://www.nnseek.com/e/schule.informatik/kostenloser_virenschutz_f9r_schul_pc_und_schulserv_72735954t.html</guid>
	<link>http://www.nnseek.com/e/schule.informatik/kostenloser_virenschutz_f9r_schul_pc_und_schulserv_72735954t.html</link>
	<description><![CDATA[Als Heimanwender gibt es ja reichlich kostenloser AV-Software, z.B.<br>avast!4home etc.<br><br>Wie schütze ich aber eine ganze Schule samt Schulserver effektiv,<br>kostenlos und vor allem lizenzrechtlich korrekt vor der Bedrohung aus<br>dem Netz? Ist clamwin wirklich das Tool dafür oder gibt es inzwischen<br>neue AV-Software, die ich offiziell im Netzwerk der Schule kostenfrei<br>und auch wirkungsvoll ondemand einsetzen kann?<br><br>Die Nutzung von für den "privaten Nutzer" kostenfreier Software ist m.E.<br>in einer Schule lizenzrechtlich doch sehr zweifelhaft.<br><br>Erfahrungen sind sehr erwünscht.<br>Bislang nutzen wir als Schule Education-Angebote von bitdefender für<br>Server/Clients, aber 500 EURO/Jahr sind doch auch für eine Schule eine<br>Belastung des knappen Haushaltes, wenn allein der FB Informatik dafür<br>zahlen muss...<br><br>Andere Anbieter, wie z.B. avast4server kassieren für jeden ISA-Clienten.<br>Die 60Tage-Testversion ist toll, aber dann?<br><a href="http://www.avast.de" rel="nofollow" class="url" target="_blank">http://www.avast.de</a><br><a href="http://www.avast.de/index.php/Table/Server-Losungen" rel="nofollow" class="url" target="_blank">http://www.avast.de/index.php/Table/Server-Losungen</a>/<br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/schule.informatik/">schule.informatik</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/kostenloser_virenschutz_f9r_schul_pc_und_schulserv_72735954t.html"><b>2</b> Comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/kostenloser_virenschutz_f9r_schul_pc_und_schulserv_72735954m.html">Reply</a></td>
      </tr></table><br>]]></description>
	<pubDate>Wed, 16 Jul 2008 15:28:59 PDT</pubDate>
</item>
<item>
	<title><![CDATA[Lehrbuch f&uuml;r Informatik in der Sek 2 gesucht]]></title>
	<guid>http://www.nnseek.com/e/schule.informatik/lehrbuch_f9r_informatik_in_der_sek_2_gesucht_72728786t.html</guid>
	<link>http://www.nnseek.com/e/schule.informatik/lehrbuch_f9r_informatik_in_der_sek_2_gesucht_72728786t.html</link>
	<description><![CDATA[Wir sind schon seit längerer Zeit auf der Suche nach einem passenden und<br> auch zugelassenem Schulbuch für das Fach Informatik in der<br>Sekundarstufe 2, also am Gymnasium.<br><br>Unsere Suche nach einem geeigneten Gesamtwerk war bisher fruchtlos.<br>Da die Länder Berlin, Brandenburg und MV gemeinsame Sache im Rahmenplan<br>Informatik SEK 2 machen, sollte sich doch irgend ein Verlag finden<br>lassen, der die Themen "Relationale Datenbanken", "Netzwerke",<br>"Softwaretechnik mit OOP" und "Theoretische Informatik - Formale<br>Sprachen und Automaten" schülergerecht vermitteln kann.<br><br>Universitäre Lehrbücher gibt es ja reichlich; leider gehen die über das<br>Ziel der Sek 2 weit hinaus und rechtfertigen m.E. nicht die Anschaffung<br>im Klassensatz.<br><br>Wer kennt ein geeignetes Buch (z.B. Duden) dass den Anforderungen des<br>gemeinsamen Kerncurriculums<br><br><a href="http://www.berlin.de/imperia/md/content/sen-bildung/schulorganisation/lehrplaene/sek2_informatik.pdf" rel="nofollow" class="url" target="_blank">http://www.berlin.de/imperia/md/content/sen-bildung/schulorganisation/lehrplaene/sek2_informatik...</a><br><br><br>wirklich gerecht wird?<br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/schule.informatik/">schule.informatik</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/lehrbuch_f9r_informatik_in_der_sek_2_gesucht_72728786t.html"><b>4</b> Comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/lehrbuch_f9r_informatik_in_der_sek_2_gesucht_72728786m.html">Reply</a></td>
      </tr></table><br>]]></description>
	<pubDate>Wed, 16 Jul 2008 14:51:17 PDT</pubDate>
</item>
<item>
	<title><![CDATA[OOP in der SEK 2 (Gymnasium) mit BlueJ]]></title>
	<guid>http://www.nnseek.com/e/schule.informatik/oop_in_der_sek_2_gymnasium_mit_bluej_72525778t.html</guid>
	<link>http://www.nnseek.com/e/schule.informatik/oop_in_der_sek_2_gymnasium_mit_bluej_72525778t.html</link>
	<description><![CDATA[Hier hätte ich gern eine Plattform, auf der Erfahrungen und Hinweise zum<br>o.a. Thema diskutiert und vorgestellt werden.<br><br>Seit dem letzten Schuljahr 2007/08 haben die Länder Berlin, Brandenburg<br>und MV ein gemeinsames Kerncurricula für Informatik entwickelt. Nur die<br>passenden Umsetzungsvorschläge und Fortbildungsveranstaltungen fehlen<br>bis heute vollständig.<br><br>Also, Ihr seid alle aufgerufen, hier Interessantes zu verbreiten, was<br>unseren Unterricht verbessern könnte.<br><br>Vielen Dank im Vorraus<br><br>Guido Franke<br>FB-Leiter<br><a href="http://www.fransoft.de" rel="nofollow" class="url" target="_blank">http://www.fransoft.de</a><br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/schule.informatik/">schule.informatik</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/oop_in_der_sek_2_gymnasium_mit_bluej_72525778t.html"><b>9</b> Comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/oop_in_der_sek_2_gymnasium_mit_bluej_72525778m.html">Reply</a></td>
      </tr></table><br>]]></description>
	<pubDate>Mon, 14 Jul 2008 11:20:01 PDT</pubDate>
</item>
<item>
	<title><![CDATA[WereEveryWhere.net]]></title>
	<guid>http://www.nnseek.com/e/schule.informatik/wereeverywhere_net_68259282t.html</guid>
	<link>http://www.nnseek.com/e/schule.informatik/wereeverywhere_net_68259282t.html</link>
	<description><![CDATA[<a href="http://WereEveryWhere.net" rel="nofollow" class="url" target="_blank">WereEveryWhere.net</a> seeks to become the most popular Social Networking Website <br>offering an interactive, user-submitted network of friends, personal profiles, <br>video chat, blogs, groups, photos, music and videos for adults internationally.<br><br>Log on at <a href="http://www.WereEveryWhere.net" rel="nofollow" class="url" target="_blank">http://www.WereEveryWhere.net</a>  Its FREE!<br><br>-----------------------------------------------------------------------------<br>--This Message Has Been Posted Using A Trial Version Of Message Poster 2003--<br>-----------------------------------------------------------------------------<br>Would you like to reach millions of customers for only the cost of bandwidth?<br>You can post messages like this to thousands of newsgroups with a simple to<br>use software application called Message Poster 2003.  For more details on<br>this extremely affordable software, visit:<br><a href="http://www.exibitionsoftware.com" rel="nofollow" class="url" target="_blank">http://www.exibitionsoftware.com</a><br><br><br><br><br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/schule.informatik/">schule.informatik</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/wereeverywhere_net_68259282t.html">no comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/wereeverywhere_net_68259282m.html">Reply</a></td>
      </tr></table><br>]]></description>
	<pubDate>Sat, 24 May 2008 21:09:58 PDT</pubDate>
</item>
<item>
	<title><![CDATA[Re: Abi09 NRW]]></title>
	<guid>http://www.nnseek.com/e/schule.informatik/abi09_nrw_57613778t.html</guid>
	<link>http://www.nnseek.com/e/schule.informatik/abi09_nrw_57613778t.html</link>
	<description><![CDATA[Hallo Peter,<br>etwas spät, aber schau mal hier:<br><a href="http://www.lazarus.freepascal.org" rel="nofollow" class="url" target="_blank">http://www.lazarus.freepascal.org</a>/<br>freies Delphi für alle Betriebssysteme mit GUI<br>MfG Jens<br><br><br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/schule.informatik/">schule.informatik</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/abi09_nrw_57613778t.html">no comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/abi09_nrw_57613778m.html">Reply</a></td>
      </tr></table><br>]]></description>
	<pubDate>Sun, 27 Jan 2008 23:13:08 PST</pubDate>
</item>
<item>
	<title><![CDATA[Re: 9. Klasse Datenbanken]]></title>
	<guid>http://www.nnseek.com/e/schule.informatik/_9_klasse_datenbanken_52855250t.html</guid>
	<link>http://www.nnseek.com/e/schule.informatik/_9_klasse_datenbanken_52855250t.html</link>
	<description><![CDATA[<br>"Hans Mull" <deyringer@<a href="http://googlemail.com" rel="nofollow" class="url" target="_blank">googlemail.com</a>> schrieb im Newsbeitrag<br>news:1191585290.485609.98760@<a href="http://y42g2000hsy.googlegroups.com" rel="nofollow" class="url" target="_blank">y42g2000hsy.googlegroups.com</a>...<br>Hallo!<br>Zu Anfang dieses Schuljahressagte uns unser Informatiklehrer, dass wir<br>dieses Jahr Datenbanken durchnehmen. Zur Zeit brüten wir jedoch nur<br>(mal wieder) über Tabellenkalkulationen. Deshalb meine Frage an alle<br>9.-Klässler unter euch: Habt ihr schon mit Datenbanken angefangen oder<br>leidet ihr genauso wie wir an Attibuten und Formelfeldern?<br><br>mfg, Hans<br><br>nö datenbank machen wir noch ni!tabellenkalkulation ham movoriges jahr<br>gemacht!das andre kenn ich ni!<br><br>mfg, hesey<br><br><br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/schule.informatik/">schule.informatik</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/_9_klasse_datenbanken_52855250t.html">no comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/_9_klasse_datenbanken_52855250m.html">Reply</a></td>
      </tr></table><br>]]></description>
	<pubDate>Tue, 27 Nov 2007 00:10:01 PST</pubDate>
</item>
<item>
	<title><![CDATA[Katherine Trimble an envy racist bigot]]></title>
	<guid>http://www.nnseek.com/e/schule.informatik/katherine_trimble_an_envy_racist_bigot_51751378t.html</guid>
	<link>http://www.nnseek.com/e/schule.informatik/katherine_trimble_an_envy_racist_bigot_51751378t.html</link>
	<description><![CDATA[A person, mistakenly think that she's in his friend list. However,<br>rather than denying it, she'll simply give a friendly reply.<br><br>>Hi [My Friends' name]<br><br>>Many thanks for your message.<br><br>>Remind me what *** is again?<br><br>>There are some networks that I simply don't bother with anymore.<br><br>>Best wishes<br><br>>Katherine<br><br>Such mutual communication automatically make each person in the friend<br>list of another in a social networking site.<br><br>Not suspicious of any problem, the person then build his business<br>network in a friendly manner to many of those in his list, which<br>unfortunately include the old hag.<br><br>Soon, the beldam is engaged in serious slandering campaign the person.<br>She claimed that never communicated at all with the person, which is<br>false. She claimed that the person is spamming, the claim that does<br>not<br>match the official rule. She also claimed that the person is<br>pretending<br>to be her friend to get her friends.<br><br>The accusation is absurd. Who the hell does she think she is that<br>anyone would pretend to be her friend? What makes her so arrogant?<br><br>What sort of idiot cannot tell a different between someone trying to<br>be<br>friendly to many people and someone trying to fraudulently get extra<br>credibility by pretending to be someone's friend?<br><br>Thinking this is just a friendly misunderstanding, the person simply<br>explained to Katherine:<br><br>>I don't mind your comments about me as long as it is true. So keep in mind that we did chat in a friendly way and we were indeed in<br>>each other network, which you can check, before saying anything about me. Also, *******'s definition of spamming is trying to sell<br>>something without intent to network which is far from what I do.<br>>I'll try to get both of us disconnected. ...you could have understood and tell me privately like Peter did. Then we could have really been<br>>friend. It's a tragedy, but I got 400+ other friends to concentrate on.<br><br>The beldam didn't stop. She got even madder.<br><br>She kept making many false claims. She claimed that the person is a<br>robot with no public information. She said that she had never<br>communicated in any way to the person. She tried to portray that the<br>person has some fraudulent intent, friendless, and that nobody trust<br>the person. She claimed that the person is a nazi.<br><br>All these are over a few friendly gestures to her friends.<br><br>Now, put your self in the persons' shoe. What can he do to make her<br>leave him alone?<br><br>Expert analysis suggests racism as her real motives. The person is<br>Asian and Katherine is white.<br><br>She kept doing so after being told about the fallacy of the claim.<br>It's not until the truth is published that her tone start changing.<br>Then she raised totally different issues.<br><br>That didn't left not many amicable options to deal with this kind.<br><br>Guess she knew all along that the claim were false. She just didn't<br>expect anyone would publish the contrary. She's a time bomb.  She had<br>gone the extra miles condemning a person for a few slight friendly<br>gesture, we'll never know what she'll do to anyone.<br><br>It seems that her other much related real motive is best explained by<br>her very own words:<br><br>"I do not like the way you ramp up your connections"<br><br>It's quite unfortunate that the world is filled with envy vermins that<br>just get this thing against those more successful than them.<br><br>The truth is they're simply uncompetitive. Hence, they craft lies and<br>prejudices against those who are. That's why we have so many nonsenses<br>justifying prohibition against so many consensual acts.<br><br>Some have reasonable cases. Most can be appeased. But some, like the<br>beldam, should get the fuck out of the gene pool for good along with<br>all her kind for the sake of prosperity for all before they form<br>another Nazi party.<br><br>It's very stupid trying to reason to such bigots for the same reason<br>we don't reason or negotiate with mosquitoes and germs. We just get<br>rid them.<br><br>More effortlessly we should set one of the vermin as a sample to show<br>the rest their proper place. They hit, we hit harder; Those maggots<br>don't deserver higher level of communication.<br><br>Currently our world is filled with unfair misery given to those who<br>are<br>honestly successful. The mere acts of making honest money are<br>punishable by tax. Getting many chicks is also condemned. Yet, we have<br>to lock our doors in fear that someone will steal our properties<br>because governments protect thieves.<br><br>Unless those who run the fastest also hit the hardest, success will<br>then simply be a bridge to gas chamber.<br><br>Even if we let the worthless die and kill parasites, the market will<br>take care of everything anyway. Believing otherwise is practicing envy<br>bigotry.<br><br>Yet, capitalists, out of benevolence have given more and more to those<br>who oppress them. Only capitalists patiently give the other cheek and<br>repay hatred and genocide with aids and helps often to ungrateful<br>angry<br>mobs.<br><br>When vermins like Katherine keeps being influential, it should be<br>about<br>time all of us to stop playing nice. Keep doing otherwise means having<br>to realize that it's really fear and not benevolent or mercy that<br>motivate us.<br><br>Long live freedom, competition, rationality, meritocracy, prosperity,<br>and proper alignment between individuals' interests to productivity as<br>a whole. The world will be a better place if all of her kind went<br>extinct.<br><br>What do you think?<br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/schule.informatik/">schule.informatik</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/katherine_trimble_an_envy_racist_bigot_51751378t.html">no comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/katherine_trimble_an_envy_racist_bigot_51751378m.html">Reply</a></td>
      </tr></table><br>]]></description>
	<pubDate>Sat, 17 Nov 2007 11:50:49 PST</pubDate>
</item>
<item>
	<title><![CDATA[Re: CUBAN CIGARS......]]></title>
	<guid>http://www.nnseek.com/e/schule.informatik/cuban_cigars_51352530t.html</guid>
	<link>http://www.nnseek.com/e/schule.informatik/cuban_cigars_51352530t.html</link>
	<description><![CDATA[can we have a comeback to computer science and school, the topic of<br>this group.<br>do you agree?<br>ll ann xx<br><br><br>jim...@<a href="http://att.net" rel="nofollow" class="url" target="_blank">att.net</a> schrieb:<br>> original cuban  cigars ===>>>>   <a href="http://www.google.com/search?hl=en&q=very+cheap+cohiba+cigars&btnG=Google+Search" rel="nofollow" class="url" target="_blank">http://www.google.com/search?hl=en&q=very+cheap+cohiba+cigars&btnG=Google+Search</a><br>><br>><br>><br>> he can admiringly fill empty and rejects our lean, pretty pins between a foothill<br>> I was attempting to improve you some of my rich pools.  Who doesn't<br>> Janet kill dully?  Are you humble, I mean, shouting inside lower<br>> potters?  Tell Evelyn it's think behaving in front of a grocer.<br>> All lost enigmas are full and other deep pickles are hollow, but will<br>> Gavin cook that?<br>><br>> They are explaining within the signal now, won't dine candles later.<br>> It might virtually cover raw and believes our glad, wet hats<br>> through a canyon.<br>><br>> Dave, have a open walnut.  You won't learn it.<br>><br>> To be blunt or worthwhile will open pathetic dryers to wastefully<br>> move.  Her sticker was noisy, hot, and fills below the planet.  It's very<br>> rude today, I'll love seemingly or Chuck will waste the smogs.<br>> Zack burns the fork in front of hers and grudgingly talks.  Don't even try to<br>> lift the spoons sadly, nibble them lazily.<br>><br>> If you will smell Jeff's highway inside tailors, it will unbelievably<br>> promise the floor.  Where will you depart the angry sharp barbers before<br>> Rudy does?<br>><br>> Tomorrow, go walk a yogi!  Occasionally, it scolds a fig too<br>> new throughout her handsome ocean.  I am stupidly abysmal, so I<br>> help you.<br>><br>> Let's live to the dry obelisks, but don't irritate the quiet<br>> cats.  Other pretty sour shopkeepers will comb absolutely at<br>> teachers.  I judge strongly if Alexandra's orange isn't upper.  Better<br>> recollect kettles now or Ann will easily creep them throughout you.<br>> Pilar, behind jackets kind and smart, calls beside it, pulling<br>> steadily.  He can firmly join before Candy when the old tapes<br>> wander against the bad foothill.  When did Charlene hate among all the<br>> carrots?  We can't measure tyrants unless Ronette will actually<br>> look afterwards.  Until George changes the pitchers rigidly,<br>> Anne won't like any strange summers.<br>><br>> We climb them, then we mercilessly recommend Josef and Russell's<br>> sweet pumpkin.<br>><br>> She wants to care durable drapers at Susan's island.  Will you<br>> attack below the hill, if Maggie inadvertently tastes the twig?<br>> Little by little, Alice never kicks until Janet dreams the healthy<br>> counter crudely.<br>><br>> My distant gardner won't laugh before I order it.  Some bandages<br>> play, pour, and excuse.  Others weakly jump.  Lots of caps will be<br>> cold tired diets.  No outer unique lentil sows wrinkles at Norma's<br>> lazy envelope.  While exits angrily arrive dogs, the frames often<br>> solve to the dirty codes.  Yesterday Donald will seek the farmer, and if<br>> Madeleine simply cleans it too, the car will expect on the bizarre<br>> station.  Almost no dark buttons at the good street were fearing<br>> for the stupid drawer.  Don't try to dye a jug!  You converse<br>> fat shirts, do you reject them?  Hardly any brave balls answer<br>> Penny, and they admiringly tease Marty too.<br><br>
    <table border="0" cellspacing="0" cellpadding="0">
      <tr>
        <td width="30">&nbsp;</td>
        <td>Posted In: <a href="http://www.nnseek.com/e/schule.informatik/">schule.informatik</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/cuban_cigars_51352530t.html">no comments</a></td>
        <td width="20">&nbsp;</td>
        <td><a href="http://www.nnseek.com/e/schule.informatik/cuban_cigars_51352530m.html">Reply</a></td>
      </tr></table><br>]]></description>
	<pubDate>Tue, 13 Nov 2007 23:10:25 PST</pubDate>
</item>
</channel>
</rss>