This study compared student learning engagement from two UK departments exploring their participation in face-to-face and synchronous online learning environments. Overall, 446 undergraduate students from Psychology (soft/non-Science, Technology, Engineering, and Mathematics (STEM) discipline) and Electrical Engineering and Electronics (EEE) (hard/STEM discipline) completed an online questionnaire over the second semester of the 2020–2021 academic year, where the teaching was mainly online. The questionnaire included validated scales regarding teaching and students’ characteristics and an open-ended question regarding the role of learning environments. There was a significant difference between the two learning environments in both departments, with most of the students believing that they were better engaged with their learning process in face-to-face environments (quantitative analysis). Additionally, the thematic analysis of student qualitative responses revealed that online student engagement was influenced by (1) Behaviour, (2) Affective, and (3) Cognitive challenges (i.e., additional workload, lack of communication and distractions in the home environment) and opportunities (i.e., the effective use of study time and online content through interactive learning environments). This study could assist academics, university policymakers, and researchers to understand student engagement alongside learning environments, reconsidering the opportunities and challenges that were gained from online learning due to the COVID-19 pandemic.
Bayesian approaches to decision trees (DTs) using Markov Chain Monte Carlo (MCMC) samplers have recently demonstrated state-of-the-art accuracy performance when it comes to training DTs to solve classification problems. Despite the competitive classification accuracy, MCMC requires a potentially long runtime to converge. A widely used approach to reducing an algorithm’s runtime is to employ modern multi-core computer architectures, either with shared memory (SM) or distributed memory (DM), and use parallel computing to accelerate the algorithm. However, the inherent sequential nature of MCMC makes it unsuitable for parallel implementation unless the accuracy is sacrificed. This issue is particularly evident in DM architectures, which normally provide access to larger numbers of cores than SM. Sequential Monte Carlo (SMC) samplers are a parallel alternative to MCMC, which do not trade off accuracy for parallelism. However, the performance of SMC samplers in the context of DTs is underexplored, and the parallelization is complicated by the challenges in parallelizing its bottleneck, namely redistribution, especially on variable-size data types such as DTs. In this work, we study the problem of parallelizing SMC in the context of DTs both on SM and DM. On both memory architectures, we show that the proposed parallelization strategies achieve asymptotically optimal time complexity. Numerical results are presented for a 32-core SM machine and a 256-core DM cluster. For both computer architectures, the experimental results show that our approach has comparable or better accuracy than MCMC but runs up to 51 times faster on SM and 640 times faster on DM. In this paper, we share the GitHub link to the source code.