NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 12 results Save | Export
Peer reviewed Peer reviewed
Direct linkDirect link
Chun Yan Enoch Sit; Siu-Cheung Kong – Journal of Educational Computing Research, 2024
Educational process mining aims (EPM) to help teachers understand the overall learning process of their students. Although deep learning models have shown promising results in many domains, the event log dataset in many online courses may not be large enough for deep learning models to approximate the probability distribution of students' learning…
Descriptors: Learning Processes, Learning Analytics, Algorithms, Guidelines
House, Garvey; Zelhart, Paul F. – 1994
The complexity (fractal dimension value) of responses to the Rey-Osterrieth Complex Figure Test (ROCFT) between 10 undergraduate students with learning disabilities and a comparison group of 10 students without learning disabilities were compared. The fractal value of responses was assessed under three conditions (copy, immediate, and delay) by…
Descriptors: Algorithms, Comparative Analysis, Fractals, Higher Education
Peer reviewed Peer reviewed
Ben-Zeev, Talia; Star, Jon R. – Cognition and Instruction, 2001
This study investigated whether undergraduate students encode spurious correlations in memory and exhibit them during the learning process leading to ineffectual problem solving. Findings suggested that even experienced students relied on surface-structure feature-algorithm correlations for solving new problems. Findings pose implications for…
Descriptors: Algorithms, Correlation, Encoding (Psychology), Error Patterns
Gerlach, Vernon S.; Schmid, Richard F. – 1978
This experiment was conducted to determine the efficiency of three forms of an algorithm of known effectiveness and the effects of its availability following initial instruction. The dependent variable was time to solve computational problems requiring rule application. The algorithm was presented in three forms: prose, flowchart, and gradual…
Descriptors: Algorithms, Computation, Educational Research, Flow Charts
Kokoski, Teresa M.; Housner, Lynn Dale – 1994
The present study was an exploratory study of the content-specific knowledge structures of three teacher educators (two in math and one in science). Pathfinder, a method for eliciting associative memory networks, was used to describe the knowledge structures of the teacher educators. Pathfinder was also used to determine changes in knowledge…
Descriptors: Academic Achievement, Algorithms, Cognitive Structures, Higher Education
Dimitrov, Dimiter M. – 1994
An approach is described that reveals the hierarchical test structure (HTS) based on the cognitive demands of the test items, and conducts a linear trait modeling by using the HST elements as item difficulty components. This approach, referred to as the Hierarchical Latent Trait Approach (HLTA), employs an algorithm that allows all test items to…
Descriptors: Algorithms, Cognitive Processes, Difficulty Level, Higher Education
Peer reviewed Peer reviewed
Johnson, Jeffrey G.; And Others – Educational and Psychological Measurement, 1996
The extent to which adolescents diagnosed with one or more personality disorders through the Personality Diagnostic Questionnaire-Revised were at an elevated risk of substance abuse was studied with 441 undergraduates. Those with one or more personality disorders showed higher levels of psychiatric symptomatology and substance use. (SLD)
Descriptors: Adolescents, Algorithms, At Risk Persons, Behavior Disorders
Peer reviewed Peer reviewed
Scanlan, David A. – Computers in the Schools, 1989
Describes two studies of undergraduates that examined learner and gender preferences for structured flowcharts versus pseudocode in the comprehension of short, complex algorithms. Research dealing with algorithm comprehension and flowcharts is reviewed, hypotheses tested are explained, implications for instructors and instructional materials are…
Descriptors: Algorithms, Comprehension, Computer Science Education, Flow Charts
Roos, Linda L.; And Others – 1992
Computerized adaptive (CA) testing uses an algorithm to match examinee ability to item difficulty, while self-adapted (SA) testing allows the examinee to choose the difficulty of his or her items. Research comparing SA and CA testing has shown that examinees experience lower anxiety and improved performance with SA testing. All previous research…
Descriptors: Ability Identification, Adaptive Testing, Algebra, Algorithms
Peer reviewed Peer reviewed
Song, Xueshu – International Journal of Instructional Media, 1992
Describes the development and validation of a microcomputer software system that enhances undergraduate students' interests in becoming engineering graduate students. The development of a database with information on engineering graduate programs is discussed, and a model that matches individual and institutional needs using Southwell's Relaxation…
Descriptors: Academic Advising, Algorithms, College Programs, Computer Software Development
Peer reviewed Peer reviewed
Kann, Charles; Lindeman, Robert W.; Heller, Rachelle – Computers & Education, 1997
In the past, algorithm animation has yielded mixed results as a teaching tool in computer science. This article presents a study in which undergraduates at George Washington University (DC) viewed algorithm animations and then programmed the same algorithms. Results suggest that combing the two is an effective way to use animation and to produce…
Descriptors: Algorithms, Animation, Computer Science, Computer Uses in Education
Shermis, Mark D.; And Others – 1992
The reliability of four branching algorithms commonly used in computer adaptive testing (CAT) was examined. These algorithms were: (1) maximum likelihood (MLE); (2) Bayesian; (3) modal Bayesian; and (4) crossover. Sixty-eight undergraduate college students were randomly assigned to one of the four conditions using the HyperCard-based CAT program,…
Descriptors: Adaptive Testing, Algorithms, Bayesian Statistics, Comparative Analysis