6 research outputs found

    The structure of permutation graphs

    No full text
    The class of permutation graphs has been studied extensively for more than two decades. The most popular representational tool employed is the permutation or matching diagram. However, the matching-diagram does not capture all the structural information of a permutation graph. The study structures involving vertex ordering in two dimensions that determine adjacency and more generally distance between vertices in a permutation graph. In this context, we explore the Euclidean representation for its power to display these structures of a permutation graph in a two dimensional space. We demonstrate that problems involving adjacency and distance can be easily handled with the Euclidean representation. Hamiltonian path and cycle, and path and cycle toughness are some of the hard problems on permutation graphs. However, the tools provided by the Euclidean representation make it easier to handle these as well as other distance related problems like the clustering problem. Hamiltonian paths and cycles can be constructed in traceable and Hamiltonian permutation graphs respectively which visually traverse the Euclidean representation diagonally along layers of vertices. Path and cycle toughness can be established by identifying specific vertices in the Euclidean representation whose removal divides the graph into connected components. Graphs with specified diameter exhibit distinctive closed geometric shapes which help in the study of clustering problems. We believe that the Euclidean representation provides a powerful tool for revealing the structure of permutation graphs. The Euclidean representation presents an excellent framework for visually exploring a permutation graph. It is expected that the Euclidean representation will help solve a variety of distance and adjacency related problems on permutation graphs

    Academic integrity policies in a computing education context

    No full text
    Academic integrity policies embody widely accepted principles of ethics and behaviour, instantiating in their codes the standards and processes that apply to the institutions enacting them. Application of these principles to the field of computing, which has a variety of distinguishing practices and characteristics, is a non-trivial endeavour. Indeed, a number of computing departments have created their own policies that extend, replace, or interpret their institutional policies in the context of computing education and research. The emphases, development, implementation, and dissemination of institutional, departmental, and even class-level policies vary dramatically among universities and colleges. This paper is offered as a practical guide for computing academics and administrators to better understand their existing policies, how to apply them, and what is involved in crafting and revising them. Included are numerous examples of application of the principles and of policy options that span the needs of a wide range of institutions

    Contributing student pedagogy

    No full text
    <p>A Contributing Student Pedagogy (CSP) is a pedagogy that encourages students to contribute to the learning of others and to value the contributions of others. CSP in formal education is anticipatory of learning processes found in industry and research, in which the roles and responsibilities of 'teacher' and 'student' are fluid. Preparing students for this shift is one motivation for use of CSP. Further, CSP approaches are linked to constructivist and community theories of learning, and provide opportunities to engage students more deeply in subject material.</p> <p>In this paper we advance the concept of CSP and relate it to the particular needs of computer science. We present a number of characteristics of this approach, and use case studies from the available literature to illustrate these characteristics in practice. We discuss enabling technologies, provide guidance to instructors who would like to incorporate this approach in their teaching, and suggest some future directions for the study and evaluation of this technique. We conclude with an extensive bibliography of related research and case studies which exhibit elements of CSP.</p&gt
    corecore