CS 6601 Artificial Intelligence Spring 2023 Midterm Exam Weight: 15% of your final grade Duration of Exam: 27 Feb 2023, 8:00 AM (EDT) – 6 Mar 2022, 8:00 AM (EDT) Before solving the exam, you should read the Ed posts for any updated information or clarifications on the exam. You have an unlimited number of […]
CS 6601 Midterm Exam Read More »
eecs2001-P Practice Questions 1 Relevant topics All topics from Lectures 0 − 12 are relevant for the midterm, including regular expressions (but not including the pumping lemma). You should, in particular be comfortable with all questions that have appeared in the first two assignments, or have been solved during the tutorials. Below, I am listing
eecs2001 Midterm Practice Read More »
In the lecture and Lab C we looked at Rust class called sharing of data across two or more threads pub struct SharedData { value: u32 impl SharedData { pub fn new() -> SharedData { SharedData { value: 0 pub fn update(&mut self) { let local_value = self.value; std::thread::sleep(std::time::Duration::new(1,0)); self.value = local_value + 1; pub
# Data Area buffer: .space 100 input_prompt: .asciiz “Enter string:\n” output_prompt: .asciiz “Output:\n” convention: .asciiz “Convention Check\n” newline: .asciiz “\n” # DO NOT MODIFY THE MAIN PROGRAM la $a0, input_prompt # prompt user for string input li $v0, 8 # take in input la $a0, buffer li $a1, 100 move $s0, $a0 # save string
MIPS Assembly Swap Case Task 3: Swap Case (worth 40 pts) Involved skeleton file (MIPS assembly): swap_case.asm In this task, you will implement the SwapCase function in swap_case.asm using the MIPS Calling Convention. The function SwapCase takes one argument: 1. The address of a string of characters, held in $a0. The main purpose of the
MIPS Assembly Swap Case Read More »
CUDA MatrixMult Design and implement C and CUDA programs that called MatrixMult.c, MatrixMultNaive.cu, and MatrixMultTiled.cu. The MatrixMult.c, MatrixMultNaive.cu, and MatrixMultTiled.cu programs will use a command line argument that corresponds to the row/column length to multiply two square matrices with random single precision numbers (i.e., floats). They will then output 1) the entire execution time in
COMP3121/9101 22T3 — Assignment 4 (UNSW Sydney) Due 12th November 2022 at 11:59pm Sydney time Your solutions must be typed, machine readable PDF files. All submissions will be checked for plagiarism! For each question requiring you to design an algorithm, you must justify the correctness of your algorithm. If a time bound is specified in
COMP3121 COMP9101 22T3 Assignment 4 Read More »
COMP3121/9101 22T2 — Assignment 4 (UNSW Sydney) Due 28th July 2022 at 4pm Sydney time In this assignment we apply dynamic programming. There are four problems each worth 20 marks, for a total of 80 marks. Your solutions must be typed, machine readable PDF files. All submissions will be checked for plagiarism! For each question
COMP3121 9101 22T2 — Assignment 4 (UNSW Sydney) Read More »
Assignment 3 Due: July 27 at noon sharp You have five problems, marked out of a total of 100 marks. NOTE: Your solutions must be typed, machine readable .pdf files. All sub- missions will be checked for plagiarism! 1. Boolean operators NAND and NOR are defined as follows true f alse true f alse true
COMP9101 COMP3121 A3 Read More »
COMP3121/9101 Term 2, 2021 Assignment 4 Due date Friday, August 6, 2021 at 8 PM sharp. You have four problems, marked out of a total of 100 marks. NOTE: Your solutions must be typed, machine readable .pdf files. All submis- sions will be checked for plagiarism. 1. There are N computers in a network, labelled
COMP3121 COMP9101 A4 Read More »