NotesFAQContact Us
Collection
Advanced
Search Tips
Audience
Practitioners1
Location
Australia1
Laws, Policies, & Programs
What Works Clearinghouse Rating
Showing 1 to 15 of 25 results Save | Export
Peer reviewed Peer reviewed
PDF on ERIC Download full text
Juraj Hromkovic; Regula Lacher – Informatics in Education, 2025
The design of algorithms is one of the hardest topics of high school computer science. This is mainly due to the universality of algorithms as solution methods that guarantee the calculation of a correct solution for all potentially infinitely many instances of an algorithmic problem. The goal of this paper is to present a comprehensible and…
Descriptors: Algorithms, Computer Science Education, High School Students, Teaching Methods
Peer reviewed Peer reviewed
Direct linkDirect link
Thin-Yin Leong; Nang-Laik Ma – INFORMS Transactions on Education, 2024
This paper develops a spreadsheet simulation methodology for teaching simulation and performance analysis of priority queues with multiple servers, without resorting to macros, add-ins, or array formula. The approach is made possible by a "single overtaking" simplifying assumption under which any lower-priority customer may be passed in…
Descriptors: Spreadsheets, Simulation, Teaching Methods, Computer Science Education
Peer reviewed Peer reviewed
PDF on ERIC Download full text
Whitney-Smith, Rachael Margaret – Journal of Pedagogical Research, 2023
As we move further into the digital age, the acquisition of digital literacy (DL) and computational thinking (CT) skills is emerging internationally as an essential goal for students in contemporary school curricula. As the world becomes more uncertain and volatile due to impacts of artificial intelligence (AI), international unrest, climate…
Descriptors: Thinking Skills, Mathematics Curriculum, National Curriculum, Mathematics Instruction
Peer reviewed Peer reviewed
Direct linkDirect link
Erin C. Yang; Robby Divine; Christine S. Kang; Sidney Chan; Elijah Arenas; Zoe Subol; Peter Tinker; Hayden Manninen; Alicia Feichtenbiner; Talal Mustafa; Julia Hallowell; Isiac Orr; Hugh Haddox; Brian Koepnick; Jacob O'Connor; Ian C. Haydon; Karla-Luise Herpoldt; Kandise Van Wormer; Celine Abell; David Baker; Alena Khmelinskaia; Neil P. King – Journal of Chemical Education, 2022
Undergraduate research experiences can improve student success in graduate education and STEM careers. During the COVID-19 pandemic, undergraduate researchers at our institution and many others lost their work-study research positions due to interruption of in-person research activities. This imposed a financial burden on the students and…
Descriptors: Undergraduate Students, Teaching Methods, COVID-19, Pandemics
Peer reviewed Peer reviewed
Scheines, Richard; Spirtes, Peter; Glymour, Clark; Meek, Christopher; Richardson, Thomas – Multivariate Behavioral Research, 1998
The TETRAD for constraint-based aids to causal model specification project and related work in computer science aims to apply standards of rigor and precision to the problem of using data and background knowledge to make inferences about a model's specifications. Several algorithms that are implemented in the TETRAD II program are presented. (SLD)
Descriptors: Algorithms, Computer Science, Inferences, Models
Peer reviewed Peer reviewed
Bookstein, Abraham; Klein, Shmuel T.; Raita, Timo – Information Processing & Management, 1997
Discussion of text compression focuses on a method to reduce the amount of storage needed to represent a Markov model with an extended alphabet, by applying a clustering scheme that brings together similar states. Highlights include probability vectors; algorithms; implementation details; and experimental data with natural languages. (Author/LRW)
Descriptors: Algorithms, Computer Science, Markov Processes, Models
Ginat, David – JCSE Online, 2002
Discusses algorithmic problem solving in computer science education, particularly algorithmic insight, and focuses on the relevance and effectiveness of the heuristic simplifying constraints which involves simplification of a given problem to a problem in which constraints are imposed on the input data. Presents three examples involving…
Descriptors: Algorithms, Computer Science Education, Heuristics, Mathematical Formulas
Wong, Eugene; Youssefi, Karel – 1976
Multivariable queries can be processed in the data base management system INGRES. The general procedure is to decompose the query into a sequence of one-variable queries using two processes. One process is reduction which requires breaking off components of the query which are joined to it by a single variable. The other process,…
Descriptors: Algorithms, Computer Programs, Computer Science, Computers
Peer reviewed Peer reviewed
Schell, George P. – Journal of Educational Technology Systems, 1988
Reviews the development of artificial intelligence systems and the mechanisms used, including knowledge representation, programing languages, and problem processing systems. Eleven books and 6 journals are listed as sources of information on artificial intelligence. (23 references) (CLB)
Descriptors: Algorithms, Artificial Intelligence, Computer Science, Heuristics
Peer reviewed Peer reviewed
Thorburn, Gareth; Rowe, Glenn – Computers & Education, 1997
Unlike most program assessment systems, Program Assessment using Specified Solutions (PASS), evaluates student C programs by assessing the way a problem was solved by performing a comparison of the submitted program with a solution plan. This article describes PASS, its use of instructor specified solution plans, assessment and feedback systems,…
Descriptors: Algorithms, Automation, Computer Science Education, Computer Software Evaluation
Ten Dyke, Richard P. – Creative Computing, 1982
A traditional question is whether or not computers shall ever think like humans. This question is redirected to a discussion of whether computers shall ever be truly creative. Creativity is defined and a program is described that is designed to complete creatively a series problem in mathematics. (MP)
Descriptors: Algorithms, Computer Programs, Computer Science, Computers
Peer reviewed Peer reviewed
Goldberg, Adele – Computers and Education, 1979
Proposes a programing design curriculum based on three conceptual areas: process, symbolic representation, and methods of interpretation; and describes computer games and simulations in which design skills of simple and conditional sequencing, rule or constraint specification, hypothesis testing, and modeling are employed. (Author/CMV)
Descriptors: Algorithms, Computer Assisted Instruction, Computer Science Education, Computer Software
Peer reviewed Peer reviewed
Gonzales, Michael G. – Computer Education, 1984
Suggests a moving pictorial tool to help teach principles in the bubble sort algorithm. Develops such a tool applied to an unsorted list of numbers and describes a method to derive the run time of the algorithm. The method can be modified to run the times of various other algorithms. (JN)
Descriptors: Algorithms, Classification, College Mathematics, Computer Programs
Oberman, Paul S. – JCSE Online, 2001
Describes an assignment for an introductory computer science class that requires the student to write a software program that simulates an automated teller machine. Highlights include an algorithm for the assignment; sample file contents; language features used; assignment variations; and discussion points. (LRW)
Descriptors: Algorithms, Assignments, Computer Science Education, Computer Simulation
Peer reviewed Peer reviewed
Wilcocks, Derek; Sanders, Ian – Computers & Education, 1994
Discussion of how to teach programming skills to novice programmers focuses on the use of a program animator that uses a copies model of recursion to teach the recursive function. Various mental models are reviewed; testing the recursion animator is described; and possibilities for further research are suggested. (12 references) (LRW)
Descriptors: Algorithms, Computer Assisted Instruction, Computer Science Education, Courseware
Previous Page | Next Page ยป
Pages: 1  |  2