{"id":2188,"date":"2023-01-13T22:37:00","date_gmt":"2023-01-13T14:37:00","guid":{"rendered":"http:\/\/maarifah.sch.id\/?page_id=2188"},"modified":"2023-02-14T23:12:34","modified_gmt":"2023-02-14T15:12:34","slug":"osn-informatika","status":"publish","type":"page","link":"https:\/\/maarifah.sch.id\/id\/osn-informatika\/","title":{"rendered":"OSN Informatika"},"content":{"rendered":"\n<figure class=\"wp-block-image size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"223\" height=\"226\" src=\"http:\/\/maarifah.sch.id\/wp-content\/uploads\/2023\/01\/osn-ksm.png\" alt=\"\" class=\"wp-image-2191\"\/><\/figure>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Pembina<\/li>\n\n\n\n<li>Peserta<\/li>\n\n\n\n<li>Silabus<\/li>\n\n\n\n<li>Materi<\/li>\n\n\n\n<li>Soal dan pembahasan\n<ul class=\"wp-block-list\">\n<li><a href=\"https:\/\/maarifah.sch.id\/contoh-soal-informatika-materi-uji-aritmetika\/\" title=\"\">Materi Uji Aritmetika<\/a><\/li>\n\n\n\n<li>Materi Uji Analitik dan Logika<\/li>\n\n\n\n<li>Materi Uji Algoritma<\/li>\n\n\n\n<li>Materi Uji Programming<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li>Link Terkait\n<ul class=\"wp-block-list\">\n<li><a href=\"https:\/\/osn.toki.id\/OSN2022\/peraturan\" title=\"\">Olimpiade sains Nasional bidang Informatika<\/a><\/li>\n\n\n\n<li><a href=\"https:\/\/osn.toki.id\/arsip\" title=\"\">Arsip Soal<\/a><\/li>\n\n\n\n<li><a href=\"https:\/\/osn.toki.id\/silabus\" title=\"\">Silabus<\/a><\/li>\n<\/ul>\n<\/li>\n<\/ul>\n\n\n\n<p>Pembina : <\/p>\n\n\n\n<ul class=\"wp-block-list\" type=\"1\" start=\"1\">\n<li><strong>Peserta<\/strong>\n<ul class=\"wp-block-list\">\n<li>Nama Siswa<\/li>\n\n\n\n<li>Nama Siswa<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n\n\n\n<ol class=\"wp-block-list\" type=\"1\" start=\"1\">\n<li><strong>Dasar-dasar Pemrograman<\/strong>\n<ul class=\"wp-block-list\">\n<li>Sintaks dan semantik dasar dari bahasa yang diperbolehkan pada OSN yang bersangkutan<\/li>\n\n\n\n<li>Variabel, tipe data, ekspresi, dan&nbsp;<em>assignment<\/em><\/li>\n\n\n\n<li>Masukan dan keluaran dasar<\/li>\n\n\n\n<li>Percabangan dan perulangan<\/li>\n\n\n\n<li>Fungsi dan parameter<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Operasi Logika dan Bitwise<\/strong>\n<ul class=\"wp-block-list\">\n<li>Operator logika dasar (konjungsi, disjungsi, implikasi, biimplikasi, disjungsi eksklusif)<\/li>\n\n\n\n<li>Tabel kebenaran<\/li>\n\n\n\n<li>Modus Ponens dan modus Tollens<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Aritmetika<\/strong>\n<ul class=\"wp-block-list\">\n<li>Bilangan bulat, operasi (termasuk perpangkatan), perbandingan<\/li>\n\n\n\n<li>Sifat-sifat bilangan bulat (tanda, paritas, keterbagian)<\/li>\n\n\n\n<li>Operasi-operasi modular dasar (penjumlahan, pengurangan, perkalian)<\/li>\n\n\n\n<li>Perpangkatan modular<\/li>\n\n\n\n<li>Bilangan prima<\/li>\n\n\n\n<li>Bilangan pecahan, persentase<\/li>\n\n\n\n<li>Teori bilangan<\/li>\n\n\n\n<li>Teori himpunan<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Aturan Berhitung<\/strong>\n<ul class=\"wp-block-list\">\n<li>Aturan penjumlahan dan perkalian<\/li>\n\n\n\n<li>Barisan aritmetika dan geometri<\/li>\n\n\n\n<li>Bilangan Fibonacci<\/li>\n\n\n\n<li>Permutasi dan kombinasi<\/li>\n\n\n\n<li>Probabilitas<\/li>\n\n\n\n<li><em>Pigeonhole principle<\/em><\/li>\n\n\n\n<li>Prinsip inklusi dan eksklusi<\/li>\n\n\n\n<li>Segitiga Pascal, teorema binomial<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Rekursi<\/strong>\n<ul class=\"wp-block-list\">\n<li>Konsep rekursi<\/li>\n\n\n\n<li>Fungsi matematis rekursi<\/li>\n\n\n\n<li>Prosedur rekursi sederhana<\/li>\n\n\n\n<li><em>Divide-and-conquer<\/em><\/li>\n\n\n\n<li><em>Backtracking<\/em><\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Pencarian dan Pengurutan<\/strong>\n<ul class=\"wp-block-list\">\n<li><em>Linear search<\/em><\/li>\n\n\n\n<li><em>Binary search<\/em><\/li>\n\n\n\n<li><em>Bubble sort<\/em>,&nbsp;<em>insertion sort<\/em><\/li>\n\n\n\n<li><em>Quicksort<\/em>,&nbsp;<em>merge sort<\/em>,&nbsp;<em>heapsort<\/em><\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Strategi Pemecahan Masalah<\/strong>\n<ul class=\"wp-block-list\">\n<li><em>Brute-force<\/em><\/li>\n\n\n\n<li><em>Greedy<\/em><\/li>\n\n\n\n<li><em>Divide-and-conquer<\/em><\/li>\n\n\n\n<li><em>Backtracking<\/em>&nbsp;(rekursif dan bukan rekursif)<\/li>\n\n\n\n<li><em>Dynamic programming<\/em><\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Struktur Data<\/strong>\n<ul class=\"wp-block-list\">\n<li>Tipe data primitif (<em>boolean<\/em>,&nbsp;<em>integer<\/em>,&nbsp;<em>character<\/em>,&nbsp;<em>floating point numbers<\/em>)<\/li>\n\n\n\n<li><em>Array<\/em>&nbsp;(termasuk multidimensi)<\/li>\n\n\n\n<li><em>String<\/em>&nbsp;dan operasinya<\/li>\n\n\n\n<li><em>Stack<\/em>&nbsp;dan&nbsp;<em>queue<\/em><\/li>\n\n\n\n<li><em>Binary heap<\/em><\/li>\n\n\n\n<li><em>Disjoint set<\/em><\/li>\n\n\n\n<li><em>Segment tree<\/em>&nbsp;(<em>point update range query<\/em>)<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Graf dan Tree<\/strong>\n<ul class=\"wp-block-list\">\n<li><em>Tree<\/em>&nbsp;dasar (termasuk&nbsp;<em>rooted tree<\/em>)<\/li>\n\n\n\n<li>Graf berarah dan graf tak berarah<\/li>\n\n\n\n<li>Graf berbobot dan graf tak berbobot<\/li>\n\n\n\n<li>Representasi graf (<em>adjacency List<\/em>,&nbsp;<em>adjacency matrix<\/em>,&nbsp;<em>edge list<\/em>)<\/li>\n\n\n\n<li>Penjelajahan graf (BFS, DFS, keterhubungan)<\/li>\n\n\n\n<li><em>Shortest path<\/em>&nbsp;(algoritma Dijkstra, algoritma Bellman-Ford, algoritma Floyd-Warshall)<\/li>\n\n\n\n<li><em>Minimum spanning tree<\/em>&nbsp;(algoritma Jarn\u00edk-Prim, algoritma Kruskal)<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Geometri Dasar<\/strong>\n<ul class=\"wp-block-list\">\n<li>Garis, segmen garis, sudut<\/li>\n\n\n\n<li>Segitiga, persegi, persegi panjang, lingkaran<\/li>\n\n\n\n<li>Titik, koordinat pada bidang Kartesius 2 dimensi<\/li>\n\n\n\n<li>Jarak Euclidean<\/li>\n\n\n\n<li>Teorema Pythagoras<\/li>\n\n\n\n<li><em>Convex Hull<\/em>&nbsp;(algoritma Graham scan, algoritma Monotone chain)<\/li>\n<\/ul>\n<\/li>\n<\/ol>\n\n\n\n<p><a href=\"https:\/\/osn.toki.id\/arsip\">Soal dan pembahasan<\/a><\/p>\n\n\n\n<p><a href=\"https:\/\/maarifah.sch.id\/soal-osn-informatika-1\/\">Conto Soal (1)<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Pembina : Soal dan pembahasan Conto Soal (1)<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-2188","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/maarifah.sch.id\/id\/wp-json\/wp\/v2\/pages\/2188","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/maarifah.sch.id\/id\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/maarifah.sch.id\/id\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/maarifah.sch.id\/id\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/maarifah.sch.id\/id\/wp-json\/wp\/v2\/comments?post=2188"}],"version-history":[{"count":8,"href":"https:\/\/maarifah.sch.id\/id\/wp-json\/wp\/v2\/pages\/2188\/revisions"}],"predecessor-version":[{"id":2621,"href":"https:\/\/maarifah.sch.id\/id\/wp-json\/wp\/v2\/pages\/2188\/revisions\/2621"}],"wp:attachment":[{"href":"https:\/\/maarifah.sch.id\/id\/wp-json\/wp\/v2\/media?parent=2188"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}