Until the assignment is posted on Canvas, this description is subject to change. # Warmup 2 In this assignment, you will implement some crypto-primitives and basic data structures. You will need the code that we provide in this repo. Please follow the instructions. **Notice that this is an individual assignment. You should finish it on […]
# COMP1110/6710 Final Exam 2020 S1 The questions provided here comprise the final exam for COMP1110/6710 in Semester 1 of 2020. These are provided for you as sample questions. Notice that some questions have multiple variations, labelled ‘A’, ‘B’, etc… When you sit a real exam, you would only get one variation. _Please note that
COMP1110 6710 Final Exam 2020 S1 Read More »
# COMP1110/1140/6710 2020 S2 Exam This repo contains an IntelliJ project for the 2020 S2 exam. *Note that you will see multiple versions of many of the questions (eg Q1.1A, Q1.1B, etc). In the actual exam you would be randomly assigned one of the variants. When using this as a practice exam, you should just
COMP1110 1140 6710 2020 S2 Exam Read More »
Project 2A: NGordnet (NGrams) CS 61B Spring 2023 Each assignment will have an FAQ linked at the top. You can also access it by adding “/faq” to the end of the URL. The FAQ for Project 2A is located Introduction # In this project, we will build a browser based tool for exploring the history
CS 61B Project 2A NGordnet NGrams Read More »
COMP3121/9101 23T1 — Assignment 1 (UNSW Sydney) Due Friday 3rd March at 5pm Sydney time In this assignment we review some basic algorithms and data structures, and we apply the divide- and-conquer paradigm. There are three problems each worth 20 marks, for a total of 60 marks. Partial credit will be awarded for progress towards
COMP3121 9101 23T1 — Assignment 1 (UNSW Sydney) Read More »
cs211 Programming assignment 2 (150 points) Programming assignment 2 (150 points) Start Assignment Due Friday by 10pm Points 150 Submitting a file upload File Types tar Available Feb 12 at 12am – Mar 3 at 11:59pm Stacks, Queues, Trees, Graph algorithms in C (150 points, approximately 12.5% of course grade) Prof. Yipeng Huang Rutgers University
CS211 Programming assignment 2 Read More »
Task 1: Reading and recording call events You are now ready to begin writing code! A note about doctests: we’ve omitted doctests from most of the starter code, and you aren’t required to write doctests for this assignment. You will write your tests in pytest instead. This is because, in this assignment, initializing objects for testing
CSC148 Assignment 1 Read More »
Homework 4 | CS 61A Spring 2023 Homework 4: Trees, Data Abstraction Due by 11:59pm on Thursday, March 2 Instructions Download hw04.zip. Inside the archive, you will find a file called hw04.py, along with a copy of the ok autograder. Submission: When you are done, submit the assignment by uploading all code files you’ve edited
CS 61A Spring 2023 Homework 4 Read More »
Question 5 High on higher-order function 1. (10 points) In class, we have seen binary trees, which are fixed to having two subtrees, and n-ary trees, which have a list of subtrees. In this question, we will consider (potentially) infinitely-branching trees, which could furthermore be infinitely deep, too. We define such a tree like this.
ECE391: Computer Systems Engineering Machine Problem 3 Spring 2022 Checkpoint 1: 6pm 3/22 Tuesday Checkpoint 2: 6pm 3/28 Monday Checkpoint 3: 6pm 4/11 Monday Checkpoint 4: 6pm 4/18 Monday Checkpoint 5: 5pm 5/2 Monday Final Demos: TBD 1 Introduction 2 Using the Group Repository 3 Getting Started: Booting and GRUB 4 The Pieces 6 What