This paper examines the average page quality over time of pages downloaded during a web crawl of 328 million unique pages. We use the connectivity-based metric PageRank to measure the quality of a page. We show that traversing the web graph in breadth-first search order is a good crawling strategy, as it tends to discover high-quality pages early on in the crawl.

In Bevan et al. (2016), the study of patterns in forests of binary shrubs was introduced. A k-ary heap H is a k-ary tree labeled with {1, . . . , n} such that every child has a larger label than its parent. Given a k-ary heap H , we associate a permutation σH with H by recording the vertex labels as they are encountered in the breadth-first search of the tree. For example, in Figure 1, we pictu...

Misconceptions about the nature of the computing discipline(s) pose a serious problem to faculties that offer computing degrees, as students enrolling on their programmes come to realise that their expectations are not met by reality. This frequently results in the students’ early disengagement from the subject of their degrees which in turn can lead to excessive ‘wastage’, i.e. reduced retenti...