{"id":61,"date":"2013-10-15T13:19:16","date_gmt":"2013-10-15T10:19:16","guid":{"rendered":"http:\/\/www.scozturk.com\/?p=61"},"modified":"2025-08-27T10:17:50","modified_gmt":"2025-08-27T10:17:50","slug":"d-temelleri-2-donguler","status":"publish","type":"post","link":"http:\/\/18.193.70.38\/?p=61&lang=tr","title":{"rendered":"D Temelleri 2 – D\u00f6ng\u00fcler"},"content":{"rendered":"

1- Giri\u015f:<\/strong><\/p>\n

Bu yaz\u0131da D programlama dilindeki d\u00f6ng\u00fclerden bahsedece\u011fiz.<\/p>\n

2- D\u00f6ng\u00fcler:<\/strong><\/p>\n

D programlama dilinde a\u015fa\u011f\u0131daki d\u00f6ng\u00fcler bulunmaktad\u0131r:<\/p>\n

    \n
  1. if-else<\/li>\n
  2. while<\/li>\n
  3. do-while<\/li>\n
  4. for<\/li>\n
  5. foreach<\/li>\n<\/ol>\n

    \u015eimdi de bu d\u00f6ng\u00fcler i\u00e7in birer \u00f6rnek verelim.<\/p>\n

     <\/p>\n

    if-else:<\/em><\/strong><\/p>\n

    \n
      \n
    1. \/\/\u00a0K\u00fct\u00fcphane\u00a0dosyalar\u0131<\/li>\n
    2. import\u00a0std.stdio;\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/\u00a0Basit\u00a0Girdi-\u00c7\u0131kt\u0131<\/li>\n
    3. <\/li>\n
    4. \/\/\u00a0Ana\u00a0fonksiyon<\/li>\n
    5. void\u00a0main(char[][]\u00a0argumanlar)<\/li>\n
    6. {<\/li>\n
    7. int\u00a0sayi\u00a0=\u00a01;<\/li>\n
    8. <\/li>\n
    9. if(sayi\u00a0==\u00a01)<\/li>\n
    10. {<\/li>\n
    11. writef(“Sayi\u00a01’e\u00a0esit!”);<\/li>\n
    12. }<\/li>\n
    13. else\u00a0if(sayi\u00a0==\u00a02)<\/li>\n
    14. {<\/li>\n
    15. writef(“Sayi\u00a02’ye\u00a0esit!”);<\/li>\n
    16. }<\/li>\n
    17. else<\/li>\n
    18. {<\/li>\n
    19. writef(“Sayi\u00a01\u00a0veya\u00a02\u00a0degil!”);<\/li>\n
    20. }<\/li>\n
    21. return\u00a00;<\/li>\n
    22. }<\/li>\n<\/ol>\n<\/div>\n

      Yukar\u0131daki kodu derleyelim. Ard\u0131ndan da \u00e7al\u0131\u015ft\u0131ral\u0131m. Sonucu a\u015fa\u011f\u0131daki resimde g\u00f6rebilirsiniz. Dosya ad\u0131 olarak dt_2.d<\/em> se\u00e7ti\u011fimden derleyiciyi dmd dt_2.d<\/em> \u015feklinde kulland\u0131m. Dosya ad\u0131n\u0131z farkl\u0131 ise dosya ad\u0131n\u0131 de\u011fi\u015ftirmeyi unutmay\u0131n\u0131z.<\/p>\n

      \"dt_2.JPG\"<\/a><\/p>\n

      while:<\/em><\/strong><\/p>\n

      While d\u00f6ng\u00fcs\u00fcn\u00fc a\u015fa\u011f\u0131daki \u00f6rnek ile g\u00f6sterelim.<\/p>\n

      \n
        \n
      1. \/\/\u00a0K\u00fct\u00fcphane\u00a0dosyalar<\/li>\n
      2. import\u00a0std.stdio;\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/\u00a0Basit\u00a0Girdi-\u00c7\u0131kt\u0131<\/li>\n
      3. <\/li>\n
      4. \/\/\u00a0Ana\u00a0fonksiyon<\/li>\n
      5. void\u00a0main(char[][]\u00a0argumanlar)<\/li>\n
      6. {<\/li>\n
      7. int\u00a0sayi\u00a0=\u00a01;<\/li>\n
      8. <\/li>\n
      9. while(sayi\u00a0<=\u00a010)<\/li>\n
      10. {<\/li>\n
      11. writef(“Sayi\u00a0%d’e\u00a0esit!\\n”,sayi);<\/li>\n
      12. sayi++;<\/li>\n
      13. }<\/li>\n
      14. <\/li>\n
      15. return\u00a00;<\/li>\n
      16. }<\/li>\n<\/ol>\n<\/div>\n

        G\u00f6rd\u00fc\u011f\u00fcn\u00fcz gibi \u00f6rnekte 1 den 10\u2032a kadar olan say\u0131lar ekrana bast\u0131r\u0131l\u0131yor. Kodu derleyip\u00e7al\u0131\u015ft\u0131rd\u0131\u011f\u0131m\u0131zda a\u015fa\u011f\u0131dakine benzer bir sonu\u00e7 elde edece\u011fiz:<\/p>\n

        \"dt_2b.JPG\"<\/a><\/p>\n

        do-while:<\/em><\/strong><\/p>\n

        Do-while d\u00f6ng\u00fcs\u00fcn\u00fc a\u015fa\u011f\u0131daki \u00f6rnekle g\u00f6sterelim.<\/p>\n

        \n
          \n
        1. \/\/\u00a0K\u00fct\u00fcphane\u00a0dosyalar<\/li>\n
        2. import\u00a0std.stdio;\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/\u00a0Basit\u00a0Girdi-\u00c7\u0131kt\u0131<\/li>\n
        3. <\/li>\n
        4. \/\/\u00a0Ana\u00a0fonksiyon<\/li>\n
        5. void\u00a0main(char[][]\u00a0argumanlar)<\/li>\n
        6. {<\/li>\n
        7. int\u00a0sayi\u00a0=\u00a01;<\/li>\n
        8. <\/li>\n
        9. do<\/li>\n
        10. {<\/li>\n
        11. writef(“Sayi\u00a0%d’e\u00a0esit!\\n”,sayi);<\/li>\n
        12. sayi++;<\/li>\n
        13. }while(sayi\u00a0<=\u00a010);<\/li>\n
        14. <\/li>\n
        15. return\u00a00;<\/li>\n
        16. }<\/li>\n<\/ol>\n<\/div>\n

          While d\u00f6ng\u00fcs\u00fc \u00f6rne\u011finde oldu\u011fu gibi bu \u00f6rnekte de 1\u2032den 10\u2032a kadar olan say\u0131lar ekrana bas\u0131lmaktad\u0131r. Kodu derleyip \u00e7al\u0131\u015ft\u0131rd\u0131\u011f\u0131m\u0131zda a\u015fa\u011f\u0131dakine benzer bir sonu\u00e7 elde ediyoruz:<\/p>\n

          \"dt_2c.JPG\"<\/a><\/p>\n

          for:<\/strong><\/em><\/p>\n

          \u015eimdi de for d\u00f6ng\u00fcs\u00fcn\u00fc \u00f6rnekleyelim.<\/p>\n

          \n
            \n
          1. \/\/\u00a0K\u00fct\u00fcphane\u00a0dosyalar<\/li>\n
          2. import\u00a0std.stdio;\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/\u00a0Basit\u00a0Girdi-\u00c7\u0131kt\u0131<\/li>\n
          3. <\/li>\n
          4. \/\/\u00a0Ana\u00a0fonksiyon<\/li>\n
          5. void\u00a0main(char[][]\u00a0argumanlar)<\/li>\n
          6. {<\/li>\n
          7. for(int\u00a0sayi\u00a0=\u00a01;\u00a0sayi\u00a0<=\u00a010;\u00a0sayi++)<\/li>\n
          8. {<\/li>\n
          9. writef(“Sayi\u00a0%d’e\u00a0esit!\\n”,sayi);<\/li>\n
          10. }<\/li>\n
          11. <\/li>\n
          12. return\u00a00;<\/li>\n
          13. }<\/li>\n<\/ol>\n<\/div>\n

            Yukar\u0131daki kod yukar\u0131daki d\u00f6ng\u00fc \u00f6rnekleri ile ayn\u0131 i\u015flemi yapmaktad\u0131r. Kodu derleyelim ve \u00e7al\u0131\u015ft\u0131ral\u0131m. A\u015fa\u011f\u0131daki sonu\u00e7 ile kar\u015f\u0131la\u015f\u0131yoruz:<\/p>\n

            \"dt_2d.JPG\"<\/a><\/p>\n

            foreach:<\/strong><\/em><\/p>\n

            Foreach d\u00f6ng\u00fcs\u00fcn\u00fc de a\u015fa\u011f\u0131daki \u00f6rnek ile g\u00f6sterelim.<\/p>\n

            \n
              \n
            1. \/\/\u00a0K\u00fct\u00fcphane\u00a0dosyalar<\/li>\n
            2. import\u00a0std.stdio;\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\/\/\u00a0Basit\u00a0Girdi-\u00c7\u0131kt\u0131<\/li>\n
            3. <\/li>\n
            4. \/\/\u00a0Ana\u00a0fonksiyon<\/li>\n
            5. void\u00a0main(char[][]\u00a0argumanlar)<\/li>\n
            6. {<\/li>\n
            7. int\u00a0a[10];<\/li>\n
            8. <\/li>\n
            9. \/\/\u00a0a\u00a0dizisini\u00a0doldur<\/li>\n
            10. for(int\u00a0i\u00a0=\u00a01;\u00a0i\u00a0<=\u00a010;\u00a0i++)<\/li>\n
            11. {<\/li>\n
            12. a[i-1]\u00a0=\u00a0i;<\/li>\n
            13. }<\/li>\n
            14. <\/li>\n
            15. \/\/\u00a0a\u00a0dizisinin\u00a0elemanlar\u0131n\u0131\u00a0listele<\/li>\n
            16. foreach(int\u00a0sayi;\u00a0a)<\/li>\n
            17. {<\/li>\n
            18. writef(“Sayi\u00a0%d’e\u00a0esit!\\n”,sayi);<\/li>\n
            19. }<\/li>\n
            20. <\/li>\n
            21. return\u00a00;<\/li>\n
            22. }<\/li>\n<\/ol>\n<\/div>\n

              Yukar\u0131daki \u00f6rnekte \u00f6ncelikle bir a dizisi tan\u0131ml\u0131yoruz. Ard\u0131ndan da bu diziyi dolduruyoruz ve son olarak bu diziyi ekrana foreach d\u00f6ng\u00fcs\u00fcn\u00fc kullanarak bast\u0131r\u0131yoruz.<\/p>\n

              \"dt_2e.JPG\"<\/a><\/p>\n

              3- Son:<\/strong><\/p>\n

              Bu yaz\u0131da d\u00f6ng\u00fcleri ve kullan\u0131mlar\u0131n\u0131 birer \u00f6rnek ile g\u00f6rd\u00fck. Bir sonraki yaz\u0131da kar\u015f\u0131la\u015ft\u0131rmalar konusuna de\u011finece\u011fim. Herkese iyi kodlamalar.<\/p>\n","protected":false},"excerpt":{"rendered":"

              1- Giri\u015f: Bu yaz\u0131da D programlama dilindeki d\u00f6ng\u00fclerden bahsedece\u011fiz. 2- D\u00f6ng\u00fcler: D programlama dilinde a\u015fa\u011f\u0131daki d\u00f6ng\u00fcler bulunmaktad\u0131r: if-else while do-while for foreach \u015eimdi de bu d\u00f6ng\u00fcler i\u00e7in birer…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[229,225],"tags":[],"class_list":["post-61","post","type-post","status-publish","format-standard","hentry","category-d-tr","category-programlama-tr"],"_links":{"self":[{"href":"http:\/\/18.193.70.38\/index.php?rest_route=\/wp\/v2\/posts\/61","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/18.193.70.38\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/18.193.70.38\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/18.193.70.38\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/18.193.70.38\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=61"}],"version-history":[{"count":1,"href":"http:\/\/18.193.70.38\/index.php?rest_route=\/wp\/v2\/posts\/61\/revisions"}],"predecessor-version":[{"id":1152,"href":"http:\/\/18.193.70.38\/index.php?rest_route=\/wp\/v2\/posts\/61\/revisions\/1152"}],"wp:attachment":[{"href":"http:\/\/18.193.70.38\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=61"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/18.193.70.38\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=61"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/18.193.70.38\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=61"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}