CS101
Lab #4: Network Scavenger Hunt
Weve spent the past few days talking about networking at both the LAN
and WAN level. In this lab youll poke around on your computer a bit
to see some of the pieces of both.
Many of these problems require the use of the
CS101
Lab #5: Name That HTML Tag
As you saw in class, we can do quite a bit with just a few basic HTML
tags. In this lab youll play
around a bit with some of the tags that weve already looked at, and
also learn about one or two
additional tags.
You will n
1. The condition on m to ensure each of the requirements is m = 2017. This would ensure that the hash
table is full, there would be no collisions and h would be a bijection.
2. Screenshot of testing and python file included. Tested both UPC numbers and te
1) The method does produce repeating numbers for some seeds. The range of the numbers is from 0 <=
n < 10000. The obtained numbers do appear to be spread out over the range, depending on the seed.
Output of seed = 1996
> test(1996)
4016
8256
1536
9296
561
CAS CS 538: Cryptography. Fall 2016
Instructor: Ran Canetti
Problem Set 2
September 21, 2016
Due: Sunday Sept 25, 12noon
Question 1 (60%): In class we proved that if G is a PRG then the above stream cipher is semantically secure.
Prove the converse. That
CAS CS 538: Cryptography. Fall 2016
Instructor: Ran Canetti
Problem Set 3
September 24, 2016
Due: Sunday Oct 1, 12noon
Definition 1 A function f : cfw_0, 1 cfw_0, 1 is one way if there exists a negligible function () such that for
any polytime adversary A
CAS CS 538: Cryptography. Fall 2016
Instructor: Ran Canetti
Problem Set 1
September 8, 2016
Due: Thursday, Sept 15 12pm
Recall the homework preparation and submission instructions: You are encouraged to collaborate with
your fellow students and consult ex
CAS CS 210 - Computer Systems
Spring 2016
First Examination
Closed Books and Notes
February 25, 2016
YOUR NAME: MATTA
Please write neatly and clearly. Make sure you have 4 questions over 6 pages
(the last page lists some Intel x86-64 instructions). You ha
CAS CS 210 - Computer Systems
Spring 2016
Solution to Sample Second Examination
Closed Books and Notes
March 25, 2016
YOUR NAME: MATTA
Please write neatly and clearly. Make sure you have 5 questions over 8 pages. You
have 75 minutes to answer all question
CS 330: Algorithms
Spring 2016
Lab 6 (Midterm Review)- Solution
Instructor: John Byers
Question 1. You are given n coins. They all look identical. They should all be the same weight, but
one is a fake coin and it is made of a lighter metal. It is your job
AA/EE/ME 548: Linear Multivariable Control
Midterm Exam Solutions
February 21, 2013
Name:
Instructions:
1. This is a take-home exam. You are allowed to use books, as well as lecture and review notes. You are
also allowed to use Matlab/Mathematica to perfo
CS 330 Spring 2016, Midterm Study Questions
Exam will be closed book. Covers material through lecture on 2/25.
Question 1. Suppose you have a set of N gold coins of which all but one have identical weight. The exception is
a single fake coin that weighs l
CS 330: Algorithms
Spring 2016
Lab 4 - Solution
Instructor: John Byers
Question 1. We are going to learn about a new algorithm called the A* algorithm. A* is like Dijkstras
algorithm in that it can be used to find a shortest path. A* is like Greedy Best-F
CS 330 Spring 2016, Assignment 1
Problems due 7PM, Thursday January 28. Please submit a hardcopy in the CS drop box.
Our first homework has several questions that require short proofs. In writing up proofs, try to make sure your
reasoning flows logically
CS 330 Spring 2016, Assignment 1 Solutions
Question 1.
Exercise 1, p. 22: [Carlos Vegeler] The statement is False. Lets say we have a group of two men and two
women with preferences
m: w, w
m: w, w
w: m, m
w: m, m
For this example, we cannot have a stable
CS 330 Spring 2016, Assignment 5
Assignments due in the drop box by 7PM, Thursday, March 31
Question 1 (10 pts). Chapter 6, Exercise 12, on p. 323.
Question 2 (10 pts). Chapter 6, Exercise 15, on p. 325.
Question 3 (10 pts). Exercises 4 and 5 of Chapter 7
CS 330 Spring 2016, Assignment 6
Problems due in the drop-box by 7PM, Thursday, April 14th
Late assignments will only be accepted up until 5PM on Friday, April 15th
Question 1 (10 pts). Chapter 6, Exercise 13, on p. 324. [Hint: Reduce to the negative cycl
CS 330 Spring 2016, Assignment 4
Problems due by 7PM on Thursday, March 17
Late assignments will only be accepted up until 5PM, Friday, March 18
Question 1. Suppose you are choosing between the following three algorithms, all of which have O(1) base cases
CS 330 Spring 2013, Assignment 3
Problems due by 7PM on Thursday, February 25
Late assignments will only be accepted up until 5PM, Friday, February 26
Question 1 (10 pts). In lab 4, we will consider the problem of minimizing the weighted sum of the comple
CAS CS 210 - Computer Systems
Spring 2015
Answers to Problem Set #1 (Logic, Data Representation & Arithmetic)
Due: Friday, February 13, 1:00 pm
To be completed individually. For all questions, show your work in obtaining the
final answers.
Total score: 10
11. public class Program
cfw_
public static void main (string args[])
cfw_
int speed = 20;
int time = 10;
int distance = speed * time;
System.out.println(distance);
12. public class Program
cfw_
public static void main (String args[])
cfw_
double area =
11. public class Program
cfw_
public static void main (string args[])
cfw_
int speed = 20;
int time = 10;
int distance = speed * time;
System.out.println(distance);
12. public class Program
cfw_
public static void main (String args[])
cfw_
double area =
CS112 HW 2
Chapter 3
MC, T/F Problems
7. a 8.d 9.a 10.a 12.c 13.c 14.b 15.c 16.F 17.T 18.T 19.T 20.F 21.T
Find the Error
4. A value should be after the case instead of Boolean expression; variable grade needs to be
declared first; break keyword is needed
A Comparison of the Basic Syntax of Python and Java
Python
Java
Python supports many (but not all) aspects of
object-oriented programming; but it is
possible to write a Python program without
making any use of OO concepts.
Java supports only object-orient
CS112 HW3 Ziliang Gong
Chapter 5
Multiple Choice, T/F: 1-20
1.b 2.d 3.a 4.e 5.b 6.a 7.b 8.d 9.c 10.F 11.T 12.F 13.F 14.F 15.T 16.T 17.F 18.F 19.F
20.T
Find the Error: 1-4
1.Delete the semicolon at the end of the method header.
2. Delete the keywork int in
CS112 HW 2
Chapter 3
MC, T/F Problems
7. a 8.d 9.a 10.a 12.c 13.c 14.b 15.c 16.F 17.T 18.T 19.T 20.F 21.T
Find the Error
4. A value should be after the case instead of Boolean expression; variable grade
needs to be declared first; break keyword is needed
CS112 HW3 Ziliang Gong
Chapter 5
Multiple Choice, T/F: 1-20
1.b 2.d 3.a 4.e 5.b 6.a 7.b 8.d 9.c 10.F 11.T 12.F 13.F 14.F 15.T 16.T 17.F 18.F 19.F
20.T
Find the Error: 1-4
1.Delete the semicolon at the end of the method header.
2. Delete the keywork int in