Essays about: "Computer course"

Showing result 1 - 5 of 120 essays containing the words Computer course.

  1. 1. OpenCourse: Gamification in Computer Science Education

    University essay from Göteborgs universitet/Institutionen för data- och informationsteknik

    Author : Gustaf Bodin; Elias Ekroth; Tobias Engblom; Filip Linde; Anwarr Shiervani; [2023-03-03]
    Keywords : Gamification; Education; Heuristic Evaluation; Desktop Application Development; Spelifiering; Utbildning; Heuristisk Utvärdering; Datorapplikationsutveckling;

    Abstract : Academic degrees in computer science suffer from the highest dropout rates among universities. As a result, there is a lack of technical professionals, which could threaten the digital infrastructure. READ MORE

  2. 2. Optimizing course scheduling

    University essay from Umeå universitet/Institutionen för datavetenskap

    Author : Victor Åström; [2023]
    Keywords : ;

    Abstract : Many Computer Science courses at Umeå University run at 50%-pace and students take two courses simultaneously. Lectures are held in one of four time-slots: Mondays and Thursdays or Tuesdays and Fridays, morning or afternoon. This results in four scheduling categories and courses from different categories can be taken together. READ MORE

  3. 3. Spatiotemporal Selves on a Location-Based Social Network : A Postphenomenological Autoethnography of Snap Map

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Adam Särnell; [2023]
    Keywords : postphenomenology; autoethnography; spatiotemporality; performativity; location-based social networks; postfenomenologi; autoetnografi; spatiotemporalitet; performativitet; platsbaserade sociala nätverk;

    Abstract : The location-based social network (LBSN) Snapchat allows millions of users to share their locations to others through Snap Map: a digital map that updates their position each time they open the app. While social science studies have explored sentiments, behaviors and norms among Snap Map users, there is limited research on this type of location-based social network in the field of human-computer interaction (HCI), indicating a need for expanding the understanding of the roles that this technology and its design play in shaping the experiences and interactions among users. READ MORE

  4. 4. Automatic Analysis of Peer Feedback using Machine Learning and Explainable Artificial Intelligence

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Kevin Huang; [2023]
    Keywords : Text classification; Peer feedback; Explainable Artificial Intelligence; BERT; RoBERTa; DistilBERT; Decision Tree; MLP; CSCL; STEM education; Textklassificering; Feedback till kamrater; Förklarig Artificiell Intelligens; BERT; RoBERTa; DistilBERT; Decision Tree; MLP; CSCL; STEM-utbildning;

    Abstract : Peer assessment is a process where learners evaluate and provide feedback on one another’s performance, which is critical to the student learning process. Earlier research has shown that it can improve student learning outcomes in various settings, including the setting of engineering education, in which collaborative teaching and learning activities are common. READ MORE

  5. 5. An operator theoretic approach to the Riemann Hypothesis

    University essay from Lunds universitet/Matematik (naturvetenskapliga fakulteten); Lunds universitet/Matematikcentrum

    Author : Ramon Arjan van de Scheur; [2023]
    Keywords : Riemann hypothesis; Prime number theorem; Prime number theorem for arithmetic progressions; operator theoretic equivalent; compact operator; prime-counting function; Chebyshev function; Laplace transform; Fourier transform; convolution operator; weak topology; strong topology; compact perturbation; Tauberian theorem; Poisson kernel; holomorphic; self-adjoint; spectrum; trace; Mathematics and Statistics;

    Abstract : In 2023 an operator theoretic approach to the Prime Number Theorem was introduced by Olsen. In this thesis this approach is examined and applied to give a new, operator theoretic, proof of a different version of the Prime Number Theorem and of the Prime Number Theorem for arithmetic progressions. READ MORE