CS164 PA3

CS164 Programming Languages and Compilers Fall 2024 Programming Assignment 3 Assigned: Nov 4, 2024 Checkpoint: Nov 24, 2024 at 11:59pm Due: Dec 6, 2024 at 11:59pm 1 Overview The four programming assignments in this course will direct you to develop a compiler for ChocoPy, a statically typed dialect of Python. The assignments will cover (1) […]

CS164 PA3 Read More »

CSC 485H 2501H: Computational linguistics, Fall 2024

University of Toronto, Department of Computer Science CSC 485H/2501H: Computational linguistics, Fall 2024 Assignment 3 Due date: 17:00 on Thursday, December 4, 2024. Late assignments will not be accepted without a valid medical certificate or other documentation of an emergency. For CSC485 students, this assignment is worth 30% of your final grade. For CSC2501 students,

CSC 485H 2501H: Computational linguistics, Fall 2024 Read More »

Programming Clean Spec

Programming Languages and Paradigms Assessment Specification 1. Introduction The module is 100% coursework based, and has a single component , weighted at 100% of the module marks. In summary: • You will select a task which is a form of customised board game, following the style of the lab exercises. o You are permitted to

Programming Clean Spec Read More »

isabelle exercises 2024

Isabelle coursework exercises John Wickerson Autumn term 2024 There are six tasks. Tasks 1–5 are worth 15 marks each. Task 6 is worth 25 marks. They appear in roughly increasing order of difficulty. The tasks are inde- pendent from each other, so failure to complete one task should have no bearing on later tasks. Tasks

isabelle exercises 2024 Read More »

COMP1027 CW1

School of Computer Science Module Assessment Sheet for 2024-2025 Module Computer Fundamentals / COMP1027 (CSF) / Semester 1 Module Convenor(s) Tissa Chandesa Assessment Name Coursework 1 Weight Description and Deliverable(s) This coursework has THREE parts, as detailed below: Part 1 focuses on Elementary Logic Gates Part 2 focuses on Combinatorial & Sequential Circuits Part 3

COMP1027 CW1 Read More »

Turing machine

For this problem, the tape can start with 0s and 1s scattered anywhere on the tape – they do not have to be contiguous. Any permutation of 0s, 1s and blanks is a possible starting configuration. Create a Turing machine that when started anywhere on the tape will halt if and only if there is

Turing machine Read More »

PIC18F assembly language

The University of NottinghamNingbo, China Department of Electrical and Electronics Engineering Embedded Computing CW3 Coursework Title: Develop a main program and a subroutine using PIC18F assembly language Coursework Description: In this coursework, students will write a main program and a subroutine in PIC18F assembly language. Students will learn how to assemble and debug the main

PIC18F assembly language Read More »