{"id":436,"date":"2016-09-11T10:42:17","date_gmt":"2016-09-11T03:42:17","guid":{"rendered":"http:\/\/if.itats.ac.id\/?p=436"},"modified":"2016-09-11T10:42:17","modified_gmt":"2016-09-11T03:42:17","slug":"silabus-perancangan-dan-analisa-algoritma","status":"publish","type":"post","link":"https:\/\/itats.ac.id\/teknikinformatika\/silabus-perancangan-dan-analisa-algoritma\/","title":{"rendered":"Silabus Perancangan dan Analisa Algoritma"},"content":{"rendered":"

SILABUS MATA KULIAH<\/strong><\/p>\n

Program Studi \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 :\u00a0\u00a0\u00a0 Teknik Informatika<\/p>\n

Kode \/ Nama Mata Kuliah\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 :\u00a0\u00a0\u00a0 16063303 \/ Perancangan dan Analisa Algoritma<\/p>\n

Jumlah SKS \/ Semseter\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 :\u00a0\u00a0\u00a0 3 SKS \/ III<\/p>\n

Mata Kuliah Pra Syarat\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 :\u00a0\u00a0\u00a0 Pemrograman Terstruktur<\/p>\n

Capaian Pembelajaran Lulusan\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 :<\/p>\n

    \n
  1. Menguasai konsep\u00a0\u00a0 \u00a0dan\u00a0\u00a0 \u00a0teori\u00a0\u00a0 \u00a0dasar\u00a0\u00a0 \u00a0bidang\u00a0\u00a0 \u00a0informatika<\/li>\n
  2. Mampu \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0mengidentifikasi, \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0menganalisis \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0dan \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0menyelesaikan \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0masalah \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0secara \u00a0sistematis\u00a0\u00a0 \u00a0dan\u00a0\u00a0 \u00a0terorganisasi\u00a0\u00a0 \u00a0dalam\u00a0\u00a0 \u00a0bidang\u00a0\u00a0 \u00a0teknologi\u00a0\u00a0 \u00a0informasi\u00a0\u00a0 \u00a0dan\u00a0\u00a0 \u00a0komunikasi<\/li>\n
  3. Mampu menggunakan\u00a0\u00a0 \u00a0dan\u00a0\u00a0 \u00a0menerapkan\u00a0\u00a0 \u00a0konsep-\u00ad\u2010konsep\u00a0\u00a0 \u00a0teoritis\u00a0\u00a0 \u00a0dan\u00a0\u00a0 \u00a0empiris\u00a0\u00a0 \u00a0dalam\u00a0\u00a0 \u00a0menyelesaikan \u00a0masalah\u00a0\u00a0 \u00a0di\u00a0\u00a0 \u00a0bidang\u00a0\u00a0 \u00a0teknologi\u00a0\u00a0 \u00a0informasi\u00a0\u00a0 \u00a0dan\u00a0\u00a0 \u00a0komunikasi<\/li>\n
  4. Mampu \u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0menganalisis \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0kebutuhan \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0sumber \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0daya \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0dalam \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0penyelesaian \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0masalah \u00a0bidang \u00a0teknologi\u00a0\u00a0 \u00a0informasi\u00a0\u00a0 \u00a0dan\u00a0\u00a0 \u00a0komunikasi<\/li>\n
  5. Memiliki kreativitas\u00a0\u00a0 \u00a0dalam\u00a0\u00a0 \u00a0mengembangkan\u00a0\u00a0 \u00a0berbagai\u00a0\u00a0 \u00a0alternatif\u00a0\u00a0 \u00a0solusi<\/li>\n
  6. Mampu \u00a0berkomunikasi\u00a0\u00a0 \u00a0baik\u00a0\u00a0 \u00a0lisan\u00a0\u00a0 \u00a0dan\u00a0\u00a0 \u00a0tulisan<\/li>\n
  7. Bertanggungjawab \u00a0pada\u00a0\u00a0 \u00a0pekerjaan\u00a0\u00a0 \u00a0sendiri<\/li>\n<\/ol>\n

    Capaian Pemebelajaran Mata Kuliah\u00a0 :<\/p>\n

      \n
    1. Mahasiswa mampu\u00a0\u00a0 \u00a0menjelaskan\u00a0\u00a0 \u00a0peranan\u00a0\u00a0 \u00a0algoritma\u00a0\u00a0 \u00a0dalam\u00a0\u00a0 \u00a0komputasi<\/li>\n
    2. Mahasiswa \u00a0 \u00a0mampu \u00a0\u00a0 \u00a0menjelaskan, \u00a0\u00a0 \u00a0merepresentasikan \u00a0\u00a0 \u00a0dan \u00a0\u00a0 \u00a0menghitung \u00a0\u00a0 \u00a0kompleksitas \u00a0algoritma\u00a0\u00a0 \u00a0dalam\u00a0\u00a0 \u00a0notasi\u00a0\u00a0 \u00a0asimtotik\u00a0\u00a0 \u00a0(big-\u00ad\u2010oh,\u00a0\u00a0 \u00a0theta,\u00a0\u00a0 \u00a0little-\u00ad\u2010oh)<\/li>\n
    3. Mahasiswa dapat\u00a0\u00a0 \u00a0menganalisis\u00a0\u00a0 \u00a0kebenaran\u00a0\u00a0 \u00a0menggunakan\u00a0\u00a0 \u00a0loop\u00a0\u00a0 \u00a0invariant\u00a0\u00a0 \u00a0dari\u00a0\u00a0 \u00a0algoritma\u00a0\u00a0 \u00a0straight-\u00ad\u2010forward\/iteratif\u00a0\u00a0 \u00a0dan\u00a0\u00a0 \u00a0divide-\u00ad\u2010conquer<\/li>\n
    4. Mahasiswa \u00a0\u00a0 \u00a0dapat \u00a0\u00a0\u00a0 \u00a0menjelaskan \u00a0\u00a0\u00a0 \u00a0strategi \u00a0\u00a0\u00a0 \u00a0dan \u00a0\u00a0\u00a0 \u00a0analisis \u00a0\u00a0\u00a0 \u00a0rancangan \u00a0\u00a0\u00a0 \u00a0serta\u00a0\u00a0 \u00a0 \u00a0implementasi \u00a0algoritma\u00a0\u00a0 \u00a0rekursif\u00a0\u00a0 \u00a0dan\u00a0\u00a0 \u00a0non\u00a0\u00a0 \u00a0rekursif\u00a0\u00a0 \u00a0untuk\u00a0\u00a0 \u00a0menyelesaikan\u00a0\u00a0 \u00a0problem-\u00ad\u2010problem\u00a0\u00a0 \u00a0real.<\/li>\n
    5. Mahasiswa \u00a0\u00a0\u00a0\u00a0 \u00a0mampu \u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0mewujudkan \u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0abstraksi \u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0persoalan \u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0ke \u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0dalam\u00a0\u00a0 \u00a0 \u00a0suatu \u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0rancangan \u00a0algoritma\u00a0\u00a0 \u00a0dengan\u00a0\u00a0 \u00a0mempertimbangkan\u00a0\u00a0 \u00a0aspek\u00a0\u00a0 \u00a0kebenaran\u00a0\u00a0 \u00a0dan\u00a0\u00a0 \u00a0efisiensi<\/li>\n
    6. Mahasiswa \u00a0mampu \u00a0 \u00a0menyatakan \u00a0 \u00a0analisis \u00a0 \u00a0kebenaran \u00a0 \u00a0dan \u00a0 \u00a0kompleksitas \u00a0 \u00a0secara \u00a0 \u00a0formal \u00a0terhadap \u00a0suatu\u00a0\u00a0 \u00a0rancangan\u00a0\u00a0 \u00a0algoritma<\/li>\n
    7. Mahasiswa \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0dapat \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0mengimplementasikan\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0hasil \u00a0 \u00a0 \u00a0 \u00a0rancangan\u00a0\u00a0 \u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0algoritma \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0dengan\u00a0\u00a0 \u00a0menggunakan \u00a0bahasa\u00a0\u00a0 \u00a0pemrograman<\/li>\n
    8. Mahasiswa \u00a0mampu \u00a0 \u00a0mempresentasikan \u00a0 \u00a0keseluruhan \u00a0 \u00a0tahapan \u00a0 \u00a0rancangan \u00a0 \u00a0dan \u00a0 \u00a0analisis \u00a0algoritma\u00a0\u00a0 \u00a0secara\u00a0\u00a0 \u00a0sistematik\u00a0\u00a0 \u00a0baik\u00a0\u00a0 \u00a0secara\u00a0\u00a0 \u00a0lisan\u00a0\u00a0 \u00a0maupun\u00a0\u00a0 \u00a0tulisan<\/li>\n<\/ol>\n\n\n\n\n\n\n\n\n\n\n
      POKOK BAHASAN<\/strong><\/td>\nALAT\/BAHAN\/SUMBER BELAJAR<\/strong><\/td>\n<\/tr>\n<\/thead>\n
      Definisi \u00a0 algoritma,<\/p>\n

      dasar \u00ad \u2010dasar\u00a0\u00a0 \u00a0 problem \u00a0 solving \u00a0 secara \u00a0 algoritmis, \u00a0 jenis-\u00ad\u2010jenis\u00a0\u00a0 \u00a0 problem \u00a0utama<\/td>\n

      		LCD-Projector , Laptop, \/ – \/ Thomas \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0H. \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Cormen, \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Charles \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0E. \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Leiserson, \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Ronald \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0L. \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Rivest, \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Clifford \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Stein,\u00a0\u00a0 \u00a0\u201cIntroduction\u00a0\u00a0 \u00a0to\u00a0\u00a0 \u00a0Algorithms\u00a0\u00a0 \u00a0Third\u00a0\u00a0 \u00a0Edition\u201d,\u00a0\u00a0 \u00a0MIT\u00a0\u00a0 \u00a0Press,\u00a0\u00a0 \u00a02009<\/td>\n<\/tr>\n
      Notasi \u00a0asimtotik,\u00a0\u00a0 \u00a0notasi\u00a0\u00a0 \u00a0standar,\u00a0\u00a0 \u00a0fungsi-\u00ad\u2010fungsi\u00a0\u00a0 \u00a0umum<\/td>\nLCD-Projector , Laptop, Ms. Visio \/ – \/ Levitin, \u00a0\u00a0 \u00a0Anany, \u00a0\u00a0 \u00a0\u201cIntroduction \u00a0\u00a0 \u00a0to \u00a0\u00a0 \u00a0The\u00a0\u00a0 \u00a0 Design \u00a0\u00a0 \u00a0& \u00a0\u00a0 \u00a0Analysis \u00a0\u00a0 \u00a0Af \u00a0\u00a0 \u00a0algorithms \u00a0\u00a0 \u00a03rd \u00a0\u00a0 \u00a0ed\u201d,\u00a0\u00a0 \u00a0Addison-\u00ad\u2010Wesley,\u00a0\u00a0 \u00a02012<\/td>\n<\/tr>\n
      Algoritma \u00a0dan\u00a0\u00a0 \u00a0kompleksitas<\/td>\nLCD-Projector , Laptop \/ – \/ Thomas \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0H. \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Cormen, \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Charles \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0E. \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Leiserson, \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Ronald \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0L. \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Rivest, \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Clifford \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Stein,\u00a0\u00a0 \u00a0\u201cIntroduction\u00a0\u00a0 \u00a0to\u00a0\u00a0 \u00a0Algorithms\u00a0\u00a0 \u00a0Third\u00a0\u00a0 \u00a0Edition\u201d,\u00a0\u00a0 \u00a0MIT\u00a0\u00a0 \u00a0Press,\u00a0\u00a0 \u00a02009<\/td>\n<\/tr>\n
      Rancangan\u00a0\u00a0 \u00a0dan\u00a0\u00a0 \u00a0analisis\u00a0\u00a0 \u00a0algoritma\u00a0\u00a0 \u00a0yang\u00a0\u00a0 \u00a0memiliki\u00a0\u00a0 \u00a0paradigm\u00a0\u00a0 \u00a0divide\u00a0\u00a0 \u00a0and conquer<\/p>\n
        \n
      • \u00a0Algoritma \u00a0binary\u00a0\u00a0 \u00a0search<\/li>\n
      • Pemrograman \u00a0dinamis\u00a0\u00a0 \u00a0jenis\u00a0\u00a0 \u00a0non\u00a0\u00a0 \u00a0classical<\/li>\n
      • Algoritma \u00a0greedy<\/li>\n<\/ul>\n<\/td>\n
      		LCD-Projector , Laptop \/ – \/ Thomas \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0H. \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Cormen, \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Charles \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0E. \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Leiserson, \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Ronald \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0L. \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Rivest, \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Clifford \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0Stein,\u00a0\u00a0 \u00a0\u201cIntroduction\u00a0\u00a0 \u00a0to\u00a0\u00a0 \u00a0Algorithms\u00a0\u00a0 \u00a0Third\u00a0\u00a0 \u00a0Edition\u201d,\u00a0\u00a0 \u00a0MIT\u00a0\u00a0 \u00a0Press,\u00a0\u00a0 \u00a02009<\/td>\n<\/tr>\n
      Rancangan\u00a0\u00a0 \u00a0dan\u00a0\u00a0 \u00a0analisis\u00a0\u00a0 \u00a0algoritma\u00a0\u00a0 \u00a0pada\u00a0\u00a0 \u00a0struktur\u00a0\u00a0 \u00a0graph<\/p>\n
        \n
      • Minimum \u00a0spanning\u00a0\u00a0 \u00a0tree<\/li>\n
      • All \u00a0pair\u00a0\u00a0 \u00a0shortest\u00a0\u00a0 \u00a0path\u00a0\u00a0 \u00a0dan\u00a0\u00a0 \u00a0single\u00a0\u00a0 \u00a0source\u00a0\u00a0 \u00a0shortest\u00a0\u00a0 \u00a0path<\/li>\n
      • Strongly \u00a0connected\u00a0\u00a0 \u00a0component,\u00a0\u00a0 \u00a0topological\u00a0\u00a0 \u00a0sort\u00a0\u00a0 \u00a0dan\u00a0\u00a0 \u00a02-\u00ad\u2010SAT\u00a0\u00a0 \u00a0problem<\/li>\n
      • Maximum \u00a0flow,\u00a0\u00a0 \u00a0minimum\u00a0\u00a0 \u00a0cut,\u00a0\u00a0 \u00a0dan\u00a0\u00a0 \u00a0bipartite\u00a0\u00a0 \u00a0matching<\/li>\n<\/ul>\n<\/td>\n
      		LCD-Projector , Laptop, Bahasa Pemrograman Java \/ – \/ Levitin, \u00a0\u00a0 \u00a0Anany, \u00a0\u00a0 \u00a0\u201cIntroduction \u00a0\u00a0 \u00a0to \u00a0\u00a0 \u00a0The\u00a0\u00a0 \u00a0 Design \u00a0\u00a0 \u00a0& \u00a0\u00a0 \u00a0Analysis \u00a0\u00a0 \u00a0Af \u00a0\u00a0 \u00a0algorithms \u00a0\u00a0 \u00a03rd \u00a0\u00a0 \u00a0ed\u201d,\u00a0\u00a0 \u00a0Addison-\u00ad\u2010Wesley,\u00a0\u00a0 \u00a02012<\/td>\n<\/tr>\n
      Rancangan\u00a0\u00a0 \u00a0dan\u00a0\u00a0 \u00a0analisis\u00a0\u00a0 \u00a0algoritma\u00a0\u00a0 \u00a0problem\u00a0\u00a0 \u00a0string\u00a0\u00a0 \u00a0matching<\/p>\n

      o \u00a0KMP, \u00a0Boyer\u00a0\u00a0 \u00a0Moore<\/td>\n

      		LCD-Projector , Laptop, Bahasa Pemrograman Java \/ – \/ Robert \u00a0Sedgewick,\u00a0\u00a0 \u00a0Kevin\u00a0\u00a0 \u00a0Wayne,\u00a0\u00a0 \u00a0Algorithms,\u00a0\u00a0 \u00a0 \u00a0\u00a04th\u00a0\u00a0 \u00a0Edition,\u00a0\u00a0 \u00a0Addison\u00a0\u00a0 \u00a0Wesley,\u00a0\u00a0 \u00a02011<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

      Download Silabus<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

      SILABUS MATA KULIAH Program Studi \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 :\u00a0\u00a0\u00a0 Teknik Informatika Kode \/ Nama Mata Kuliah\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 :\u00a0\u00a0\u00a0 16063303 \/ Perancangan dan Analisa Algoritma Jumlah SKS \/ Semseter\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 :\u00a0\u00a0\u00a0 3 SKS \/ III Mata Kuliah Pra Syarat\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 :\u00a0\u00a0\u00a0 Pemrograman Terstruktur Capaian Pembelajaran Lulusan\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 : Menguasai konsep\u00a0\u00a0 \u00a0dan\u00a0\u00a0 \u00a0teori\u00a0\u00a0 \u00a0dasar\u00a0\u00a0 \u00a0bidang\u00a0\u00a0 \u00a0informatika Mampu \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0mengidentifikasi, \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0menganalisis \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0dan…<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"footnotes":""},"categories":[44],"tags":[49,50,51],"class_list":["post-436","post","type-post","status-publish","format-standard","hentry","category-silabus","tag-algoritma","tag-analias","tag-desain"],"_links":{"self":[{"href":"https:\/\/itats.ac.id\/teknikinformatika\/wp-json\/wp\/v2\/posts\/436","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/itats.ac.id\/teknikinformatika\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/itats.ac.id\/teknikinformatika\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/itats.ac.id\/teknikinformatika\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/itats.ac.id\/teknikinformatika\/wp-json\/wp\/v2\/comments?post=436"}],"version-history":[{"count":0,"href":"https:\/\/itats.ac.id\/teknikinformatika\/wp-json\/wp\/v2\/posts\/436\/revisions"}],"wp:attachment":[{"href":"https:\/\/itats.ac.id\/teknikinformatika\/wp-json\/wp\/v2\/media?parent=436"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/itats.ac.id\/teknikinformatika\/wp-json\/wp\/v2\/categories?post=436"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/itats.ac.id\/teknikinformatika\/wp-json\/wp\/v2\/tags?post=436"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}