Claim Missing Document
Check
Articles

Found 2 Documents
Search

Analysis of the Feasibility Level of the Moodle Integrated WordPress-Based Chemistry Learning Website to Improve Student Learning Outcomes on the Elements Periodic System Material Nur Huda; Kholifatur Rosyidah; Faiz Rizky Nur Awwaludin; Kusumawati Dwiningsih
Jurnal Pendidikan dan Pembelajaran Kimia Vol 10, No 3 (2021): Jurnal Pendidikan dan Pembelajaran Kimia
Publisher : Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

This study aims to determine the feasibility of a WordPress-based integrated chemistry learning website Moodle to improve student learning outcomes on the material of the periodic system of elements seen from content and construct validity. The type of research used is Research and Development (RD) with a 4D development model, namely Define, Design, Develop and Disseminate. In this study, the development model is limited to the development stage. This research was conducted using a learning website review sheet instrument and a learning website validation sheet divided into a content validity sheet and a construct validity sheet. The results of expert validation, data obtained if the average percentage of content and construct conformity is 89.59% and 86.67%, respectively, in the very valid category. Based on these results, the chemistry learning website generated from this research is valid and feasible to use as a learning medium.Keywords: Learning website, WordPress, Moodle, learning outcomes. DOI: 10.23960/jppk.v10.i3.2021.04
Analysis Super (a; d)-S3 Antimagic Total Dekomposition of Helm Graph Connektive for Developing Ciphertext Kholifatur Rosyidah; Dafik Dafik; Susi Setiawani
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 1, No 1 (2020): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1521.163 KB) | DOI: 10.25037/cgantjma.v1i1.7

Abstract

Covering of G is H = fH1; H2; H3; :::; Hkg subgraph family from G with every edges on G admit on at least one graph Hi for a i 2 f1; 2; :::; kg. If every i 2 f1; 2; :::; k g, Hi isomorphic with a subgraph H, then H said cover-H of G. Furthermore, if cover-H of G have a properties is every edges G contained on exactly one graph Hi for a i 2 f1; 2; :::; kg, then cover-H is called decomposition-H. In this case, G is said to contain decomposition-H. A graph G(V; E) is called (a; d)-H total decomposition if every edges E is sub graph of G isomorphic of H. In this research will be analysis of super (a; d)-S3 total decomposition of connective helm graph to developing ciphertext.Key Word : Super (a; d)-S3, Dekomposisi, Graf helm, dan Ciphertext