Education Games To Learn Basic Algorithm With Near Isometric Projection Method

• URL: http://arxiv.org/abs/2005.13225v1
• Date: Wed, 27 May 2020 08:10:19 GMT
• Title: Education Games To Learn Basic Algorithm With Near Isometric Projection Method
• Authors: Wirawan Istiono, Hijrah, Nur Nawaningtyas.P
• Abstract summary: This study focused on the material Sequencing, Overloading, Procedures, Recursive Loops and Conditionals. Proposed Education Games with Near Isometric Projection method reach 83.87% statement of agreement.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Basic programming and algorithm learning is one of the compulsory subjects required for students majoring in computers. As this lesson is knowledge base, it is very important and essential that before learn programmings languages students must be encourages to learn it to avoid difficulties that by using the algorithm learning games application with Near Isometric Projection, Students or prospective students become more interested in learning algorithms and programming. In this study, basic learning algorithms focused on the material Sequencing, Overloading, Procedures, Recursive Loops and Conditionals, which are made so that it can make it easier for students to learn the basics of programming algorithms. The simulated results show that proposed Education Games with Near Isometric Projection method reach 83.87% statement of agreement that application games to learn basic programming algorithms were interesting and helped them to understand basic algorithm after testing using UAT. Testing with User Acceptance Test for 30 students of Multimedia Nusantara University

Related papers

• Learning-Augmented Algorithms with Explicit Predictors [67.02156211760415]
  Recent advances in algorithmic design show how to utilize predictions obtained by machine learning models from past and present data. Prior research in this context was focused on a paradigm where the predictor is pre-trained on past data and then used as a black box. In this work, we unpack the predictor and integrate the learning problem it gives rise for within the algorithmic challenge.
  arXiv  Detail & Related papers  (2024-03-12T08:40:21Z)
• Executing Natural Language-Described Algorithms with Large Language Models: An Investigation [48.461999568129166]
  We examine the capacity of present-day large language models to comprehend and execute algorithms outlined in natural language. We selected 30 algorithms, generated 300 random-sampled instances, and evaluated whether popular LLMs can understand and execute these algorithms. Our findings reveal that LLMs, notably GPT-4, can effectively execute programs described in natural language, as long as no heavy numeric computation is involved.
  arXiv  Detail & Related papers  (2024-02-23T05:31:36Z)
• Toward Finding and Supporting Struggling Students in a Programming Course with an Early Warning System [1.192436948211501]
  We assess different cognitive skills of students of an introductory programming course. Most of the cognitive skills can predict whether students acquire programming skills to a certain degree. We found a significant positive effect of the syntax drill-and-practice exercises on the success of a course.
  arXiv  Detail & Related papers  (2024-01-25T12:55:27Z)
• Problem-Solving Guide: Predicting the Algorithm Tags and Difficulty for Competitive Programming Problems [7.955313479061445]
  Most tech companies require the ability to solve algorithm problems including Google, Meta, and Amazon. Our study addresses the task of predicting the algorithm tag as a useful tool for engineers and developers. We also consider predicting the difficulty levels of algorithm problems, which can be used as useful guidance to calculate the required time to solve that problem.
  arXiv  Detail & Related papers  (2023-10-09T15:26:07Z)
• JiuZhang: A Chinese Pre-trained Language Model for Mathematical Problem Understanding [74.12405417718054]
  This paper aims to advance the mathematical intelligence of machines by presenting the first Chinese mathematical pre-trained language model(PLM) Unlike other standard NLP tasks, mathematical texts are difficult to understand, since they involve mathematical terminology, symbols and formulas in the problem statement. We design a novel curriculum pre-training approach for improving the learning of mathematical PLMs, consisting of both basic and advanced courses.
  arXiv  Detail & Related papers  (2022-06-13T17:03:52Z)
• The CLRS Algorithmic Reasoning Benchmark [28.789225199559834]
  Learning representations of algorithms is an emerging area of machine learning, seeking to bridge concepts from neural networks with classical algorithms. We propose the CLRS Algorithmic Reasoning Benchmark, covering classical algorithms from the Introduction to Algorithms textbook. Our benchmark spans a variety of algorithmic reasoning procedures, including sorting, searching, dynamic programming, graph algorithms, string algorithms and geometric algorithms.
  arXiv  Detail & Related papers  (2022-05-31T09:56:44Z)
• CrossBeam: Learning to Search in Bottom-Up Program Synthesis [51.37514793318815]
  We propose training a neural model to learn a hands-on search policy for bottom-up synthesis. Our approach, called CrossBeam, uses the neural model to choose how to combine previously-explored programs into new programs. We observe that CrossBeam learns to search efficiently, exploring much smaller portions of the program space compared to the state-of-the-art.
  arXiv  Detail & Related papers  (2022-03-20T04:41:05Z)
• How to transfer algorithmic reasoning knowledge to learn new algorithms? [23.335939830754747]
  We investigate how we can use algorithms for which we have access to the execution trace to learn to solve similar tasks for which we do not. We create a dataset including 9 algorithms and 3 different graph types. We validate this empirically and show how instead multi-task learning can be used to achieve the transfer of algorithmic reasoning knowledge.
  arXiv  Detail & Related papers  (2021-10-26T22:14:47Z)
• Mastering Rate based Curriculum Learning [78.45222238426246]
  We argue that the notion of learning progress itself has several shortcomings that lead to a low sample efficiency for the learner. We propose a new algorithm, based on the notion of mastering rate, that significantly outperforms learning progress-based algorithms.
  arXiv  Detail & Related papers  (2020-08-14T16:34:01Z)
• Strong Generalization and Efficiency in Neural Programs [69.18742158883869]
  We study the problem of learning efficient algorithms that strongly generalize in the framework of neural program induction. By carefully designing the input / output interfaces of the neural model and through imitation, we are able to learn models that produce correct results for arbitrary input sizes.
  arXiv  Detail & Related papers  (2020-07-07T17:03:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.