CSCI 3236, Spring 2017
Posted: Jan. 16
Assignment 1
Due before 11:00pm, Friday, Feb. 3, 2017
Upload to Assignment 1 folder in Folio Dropbox with file name Lastname ID.pdf.
(Mandatory assignment cover-sheet; without it, your work will not be marked.)
Submi
CIE 272
Mid-Term Exam #2
11/11/02
1. (a) Count the number of times each value was observed:
Chloride
Concentration
(mg/L)
Number of
Observations
60
61
62
63
64
65
66
67
68
69
70
1
1
2
3
5
5
4
2
3
3
1
The histogram is a bar chart of these values:
6
5
4
3
2
CIE 272
Mid-Term Exam #2
November 17, 2003
1. (a) P(Z -1.77) = 0.03836. read directly from standard normal table.
(b) Find 0.015 in the standard normal table; it is very close to z = -2.17
(c) P(0.51 Z 2.00) = P(Z 2.00) P(Z 0.51)
Use the standard normal t
Problem. 1 New booklet please. [10 points]
Design and analyze a linear time algorithm for the following problem.
The input consists of a directed graph, encoded in the usual adjacency list
representation, along with two distinguished vertices s and t. The
Exam 1 Solutions Math 215 Fall 2005
1. A(100,3) 100 1.07 3 122.50 , so after three years my $100 has grown to $122.50.
2. (a)
f
2 x 6 ; this describes how quickly f changes as x increases by one unit (and y is
x
held constant).
f
3 y 2 12 ; this describ
May 14, 2007
CS211 Final Exam
Page 1 of 10
1. (14 points) Fill in the following table of asymptoptic complexities for each of the
given data structures and operations.
Sorted singlylinked list
nding the
smallest element
nding the largest
element
searching
Name: ANSWERS
.
CIE 272
Exam 1
14 October 2003
Directions. This is a 2-hour, open-book examination. There are eight pages. You are expected
to do your own work. Answer the questions on the exam sheets. Partial credit will be given
only if I can understand
CIE 27 2
Exam 1
15 October 2002
Directions. This is a 2-hour, open-book examination. There are ten pages. You are expected to
do your own work. Answer the questions on the exam sheets. Partial credit will be only if I can
understand how you arrived at you
CSCI 3236 Quiz #2
Prove by induction that for all n N+ ,
n
X
i3 =
i=1
n(n + 1)
2
2
.
Proof:
Base case: n = 1,
LHS =
1
X
3
i =1=
i=1
1 (1 + 1)
2
2
= RHS.
Inductive step: Assume n 1 and the equation holds for all k n. For n + 1,
n+1
X
i3 =
i=1
n
X
i3 + (n +
CODI
SORDELE
T
6612 Tee Bow CT, Lithonia, GA 30038 | (C) (770)3781299 |
[email protected]
Professional summary
Driven to exceed expectations and build long term relationships within a professional
environment. Delivers positive experiences th