No full-text available
To read the full-text of this research,
you can request a copy directly from the authors.
Exercise sequence adaptation in programming education
Abstract
There exist many kinds of exercise sequences to teach the fundamental contents of C programming, and each student's understanding can be affected by the sequence choice. However, in programming education today, teachers usually give same exercise problems to all students, yet often in the same order. Therefore, many students on a programming course suffer from the difference between their own levels of acquiring programming skills and the progress of the course. Some of them feel it difficult to catch up with the progress. On the other hand, students with a high aspiration toward learning are not always satisfied with the slowness of the progress. To solve this problem, the paper proposes a procedure to produce an appropriate exercise sequence, depending on the degree of understanding by the student. The exercise sequence would suit each student because its selection is based on information not only about a single student, but also about students learning in the same environment. We have developed a questionnaire for students of a C programming course. From the questionnaire results, it has been found that a student's attitude to learning is important information, as well as the degree of understanding, for selecting an appropriate exercise sequence.
ResearchGate has not been able to resolve any citations for this publication.
The majority of current web-based learning systems are closed learning environments where courses and learning materials are fixed and the only dynamic aspect is the organization of the material that can be adapted to allow a relatively individualized learning environment. In this paper, we propose an evolving web-based learning system which can adapt itself not only to its users, but also to the open Web. More specifically, the novelty with respect to the system lies in its ability to find relevant content on the web, and its ability to personalize and adapt this content based on the system's observation of its learners and the accumulated ratings given by the learners. Hence, although learners do not have direct interaction with the open Web, the system can retrieve relevant information related to them and their situated learning characteristics.
Recommender systems apply knowledge discovery techniques to the problem of making personalized recommendations for information, products or services during a live interaction. These systems, especially the k-nearest neighbor collaborative filtering based ones, are achieving widespread success on the Web. The tremendous growth in the amount of available information and the number of visitors to Web sites in recent years poses some key challenges for recommender systems. These are: producing high quality recommendations, performing many recommendations per second for millions of users and items and achieving high coverage in the face of data sparsity. In traditional collaborative filtering systems the amount of work increases with the number of participants in the system. New recommender system technologies are needed that can quickly produce high quality recommendations, even for very large-scale problems. To address these issues we have explored item-based collaborative filtering techniques. Itembased techniques first analyze the user-item matrix to identify relationships between different items, and then use these relationships to indirectly compute recommendations for users. In this paper we analyze different item-based recommendation generation algorithms. We look into different techniques for computing item-item similarities (e.g., item-item correlation vs. cosine similarities between item vectors) and different techniques for obtaining recommendations from them (e.g., weighted sum vs. regression model). Finally, we experimentally evaluate our results and compare them to the basic k-nearest neighbor approach. Our experiments suggest that item-based algorithms provide dramatically better performance than user-based algorithms, while at the same time p...
An electronic book may be viewed as an application with a multimedia database. We define an electronic textbook as an electronic book that is used in conjunction with instructional resources such as lectures. We propose an electronic textbook data model with topics, topic sources, metalinks (relationships among topics), and instructional modules, which are multimedia presentations possibly capturing real-life lectures of instructors. Using the data model, the system provides users a topic-guided multimedia lesson construction. We concentrate, in detail, on the use of one metalink type in lesson construction, namely, prerequisite dependencies, and provide a sound and complete axiomatization of prerequisite dependencies. We present a simple automated way of constructing lessons for users where the user lists a set of topic names (s)he is interested in, and the system automatically constructs and delivers the "best" user-tailored lesson as a multimedia presentation, where "best" is characterized in terms of both topic closures with respect to prerequisite dependencies and what the user knows about topics. We model and present sample lesson construction requests for users, discuss their complexity, and give algorithms that evaluate such requests. For expensive lesson construction requests, we list heuristics and empirically evaluate their performance. We also discuss the worst-case performance guarantees of lesson request algorithms.
Collaborative filers help people make choices based on the opinions of other people. GroupLens is a system for collaborative filtering of netnews, to help people find articles they will like in the huge stream of available articles. News reader clients display predicted scores and make it easy for users to rate articles after they read them. Rating servers, called Better Bit Bureaus, gather and disseminate the ratings. The rating servers predict scores based on the heuristic that people who agreed in the past will probably agree again. Users can protect their privacy by entering ratings under a pseudonym, without reducing the effectiveness of the score prediction. The entire architecture is open: alternative software for news clients and Better Bit Bureaus can be developed independently and can interoperate with the components we have developed.
Summary form only given. Many of college students learning in C language programming courses suffer from difference of their own acquisition level of programming skills from progresses of the courses. Some of them feel difficulties to catch up the progress. On the contrary, who are eager for programming are not always satisfied with slowness of the progress. We illustrate learning plans and personal data. We explain a personalized programming course system based on the recommendation engine. In this course, the recommendation engine selects an explanation method of examples and exercises suitable for each student. The recommendation engine consults personal data of many students who have been taught in the course. It searches past students whose tendency is similar to the concerned student, assuming that they stay in a similar acquiring level of C programming skill.
A Support System Based on a Bug Factor for Programming and its Effectiveness
- A Takamoto
- M Fujii
- N Izumi
- M Tanaka
Exercise Server for Programming Practice
- N Takeda
- K Kawaguchi
- M Asami
- N Sagou