Sample Midterm Exam: CS549 Cryptography and Network Security
5PM6:15PM, Sample!
Name
Section
Instructions:
The exam is an closed book and closed notes exam. You cannot use any help to nish the exam; you can
not discuss anything with your classmates.
If
CS 672 Neural Networks Fall 2010
Instructor: Marc Pomplun
Practice Midterm Exam Sample Solutions
Duration: 75 minutes
No calculators, no books, and no notes are allowed (in the actual exam).
Question 1: _ out of _ points
Question 2: _ out of _ points
Ques
The University of Utah ECE 6962-003: Fundamentals of Wireless Networking, Spring 2007 Midterm I Practice Exam
SOLUTIONS
Time: 80 minutes
Instructions: This is a closed book exam, you are allowed to have one sheet of notes (no photocopies or print-outs, bo
Network Industries [Econ 490(2)]: Midterm exam (2008/10/22)
Abbreviated Solution
Page 1 of 4
(1a) [7 points] Each resident takes the demand by all other residents qj for i = j as given and chooses
her Internet usage level qi to maximize the above utility.
KINGDOM OF SAUDI ARABIA
Ministry of Higher Education
Princess Norah University
College of Computer and
Information Sciences
" !
& %$
(
Mid-Term Exam 03
High Speed Networks (NET 456)
NO Authorized Document
Duration: 75 minutes
Dr. Anis Koubaa
Questi
KINGDOM OF SAUDI ARABIA
Ministry of Higher Education
Princess Norah University
College of Computer and
Information Sciences
Mid-Term Exam 02
High Speed Networks (NET 456)
NO Authorized Document
Duration: 75 minutes
Dr. Anis Koubaa
Questions are gener
Data Networks Summer 2007
Midterm Exam
Name: _
Email: _
Student ID: _
Problems
Points
1
2
3
4
5
Total
1
1 (20 points) Circuit switching vs datagram packet switching.
(a) State two reasons why circuit switching can provide more predictable communication
pe
Midterm Exam
CMPSCI 453: Computer Networks
Fall 2011
Prof. Jim Kurose
Instructions:
There are 4 questions on this exam.
Please use two exam blue books answer questions 1, 2 in one book, and the remaining
two questions in the second blue book.
Put your
Midterm Exam
CMPSCI 453: Computer Networks
Fall 2010
Prof. Jim Kurose
Instructions:
Please use two exam blue books answer questions 1, 2 in one book, and the remaining
two questions in the second blue book.
Put your name and student number on the exam b
CSc 74010 Fall 2011, Homework 10
1. Describe how you could program an agent to use active reinforcement learning to learn how to act in the
environment in the gure below.
Assume an underlying transition model like that from Lecture 8, Slide 8 (though the
CSc 74010 Fall 2011, Homework 9
1. The following table gives some examples of recent book selections I have made on the Orinoco website
(Orinoco is the worlds least well known online bookstore).
Examples
X1
X2
X3
X4
X5
X6
X7
X8
X9
X10
X11
X12
New
N
N
Y
N
Graph and Network Algorithms Spring 2006
Assignment II - Solutions
Problem:
Let G be a simple undirected graph with n vertices.
A matching in G is a set of edges such that any 2 edges in the set do not share a vertex. A
maximum matching in G is the matchi
Graph and Network Algorithms
Greedy Vertex Coloring
Let G = (V, E ) be a simple and undirected graph with n 1 vertices: V = cfw_1, 2, . . . , n. G is
represented by an adjacency n n matrix A of 0 and 1. For any 1 u, v n, A[u, v ] = 1 if there
is an edge c
Dr. Amotz Bar-Noys
Compendium of Algorithms Problems
Problems, Hints, and Solutions
Chapter 1
Searching and Sorting Problems
1
1.1
1.1.1
Array with One Missing
Problem
Let A = A[1], . . . , A[n] be an array of n distinct integers, in which each integer is
Dr. Amotz Bar-Noys
Compendium of Algorithms Problems
Problems, Hints, and Solutions
Chapter 1
Searching and Sorting Problems
1.1
Problems
1.1.1
Sum from Sorted Arrays (Fall 2002 Midterm)
Consider the following problem:
Input: A positive integer x > 0 and
CSc 74010 Fall 2011, Homework 2
1. Which, if any, of the following sentences is a proposition? In each case, justify your answer.
(a)
(b)
(c)
(d)
(e)
(f)
Twice two is four.
The square root of ten is three.
5>6
Please write a specimen of your signature in
CSc 74010 Fall 2011, Homework 3
1. Prove (p, p q, p r)
r using resolution.
(10 points)
2. Prove (p q, p (r s)
r using resolution.
(10 points)
3. Using the predicates P (x) to denote x is a politician, R(x) to denote x is rich, L(x) to denote x is
a lobbyi
CSc 74010 Fall 2011, Homework 4
1. Represent the following information in logic. You should try to ensure that your representation allows the
appropriate inferences to be made. You are free to interpret the scenario in any reasonable way, but write
down a
CSc 74010 Fall 2011, Homework 5
1. From the joint distribution on page 31 of the notes, compute:
(a) P (cavity )
(b) P(T oothache).
(c) P(T oothache|cavity ).
(d) P (catch cavity )
(e) P(Cavity |toothache catch)
Recall what the dierence is between P and P
CSc 74010 Fall 2011, Homework 6
The rst few questions make use of the Bayesian network in Figure 1.
1. How many numbers do we need to specify all the necessary probability values for the network in Figure 1?
How many would we need if there were no conditi
CSc 74010 Fall 2011, Homework 7
1. Consider the umbrella world example from the lecture. The notes explain the computation of the ltered
probability of rain on days 1 and 2 given the observation on an umbrella on days 1 and 2.
Extend the calculation to da