Claim Missing Document
Check
Articles

Found 2 Documents
Search

KAJIAN PENERAPAN MATRIKS DALAM KEHIDUPAN SEHARI-HARI UNTUK MENINGKATKAN MOTIVASI BELAJAR: A Literature Review on the Application of Matrices in Daily Life to Enhance Learning Motivation Yahya, Muhammad Hamdi; Raharjo, Karunia; Ammarulloh, Satriaji; Putri, Adhysta Az-zahra; Himawan, Inggil
Al-Aqlu: Jurnal Matematika, Teknik dan Sains Vol. 3 No. 2 (2025): Juli 2025
Publisher : Yayasan Al-Amin Qalbu

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59896/aqlu.v3i2.296

Abstract

This article is a literature review aimed at analyzing how the application of matrix concepts in real-life contexts can influence students’ motivation to learn mathematics. The main issue addressed is the lack of student interest due to the abstract nature of matrix material, which is often disconnected from their daily experiences. To address this, the study synthesizes findings from previous academic works and analyzes the effectiveness of contextual approaches in mathematics education. The review reveals that learning strategies such as Problem-Based Learning (PBL), Realistic Mathematics Education (PMRI), and Contextual Teaching and Learning (CTL) significantly enhance students' conceptual understanding and engagement. When matrix concepts are presented through familiar situation such as scheduling, task allocation, or simple data processing students become more confident, involved, and interested in learning. In conclusion, aligning mathematical content with everyday experiences provides a more relevant and enjoyable learning process that fosters stronger learning motivation and a better appreciation for the practical use of mathematics.
STUDI PERBANDINGAN ALGORITMA PENCARIAN BINARY, JUMP, INTERPOLATION, DAN FIBONACCI: EFISIENSI MEMORI DAN WAKTU EKSEKUSI Fachri Ariza, Said; Majid, Abdul; Hamdi Yahya, Muhammad; Himawan, Inggil; Ardhiartha P.U., Surya; Prayogo Pujiono, Imam
JATI (Jurnal Mahasiswa Teknik Informatika) Vol. 9 No. 4 (2025): JATI Vol. 9 No. 4
Publisher : Institut Teknologi Nasional Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36040/jati.v9i4.14360

Abstract

Penelitian ini membahas efisiensi empat algoritma pencarian Binary Search, Jump Search, Interpolation Search, dan Fibonacci Search dalam aspek waktu eksekusi dan penggunaan memori. Masalah utama yang diangkat adalah perlunya identifikasi algoritma pencarian yang paling optimal pada data terurut dengan volume berbeda. Tujuan penelitian ini adalah membandingkan performa keempat algoritma dalam pengolahan data numerik acak yang telah diurutkan. Metode yang digunakan melibatkan pengujian algoritma menggunakan bahasa C++ terhadap tiga skala dataset (100, 1.000, dan 10.000 elemen), masing-masing diuji sebanyak tiga kali untuk menjaga konsistensi hasil. Hasil penelitian menunjukkan bahwa Interpolation Search paling efisien dari segi waktu (300–400 ns) dan memori (24–34,67 byte), terutama saat data terdistribusi merata. Binary Search konsisten dengan performa baik di berbagai kondisi. Sebaliknya, Jump Search mencatat waktu eksekusi paling lama (3.233,33–3.866,67 ns), sedangkan Fibonacci Search mencatat penggunaan memori tertinggi (61,33–74,67 byte). Kesimpulan menunjukkan bahwa pemilihan algoritma pencarian harus disesuaikan dengan distribusi dan ukuran data untuk mencapai efisiensi optimal.