Announcemen
Exam
tsMidterm
July 25th on Monday next week at 19:40 (110 minutes)
Exam classes:
if (true)
cout < " FENS G077 " < endl;
This week recitations, we will solve sample midterm
questions.
Detailed email about the midterm was sent with previous
yea
June 6, 2012
CS201 (Intro. to Computing) FINAL Exam
1
Name
ID
2
3
4
5
6
7
TOTAL
:
:
Notes: a) Please answer the questions only in the provided space after each question.
b) Duration is 120 minutes.
c) Close-book, close-notes, no calculators and computers.
April 9, 2012
CS 201 (Intro. to Computing) MIDTERM I
1
2
3
4
5
6
7
TOTAL
Name and Last Name : Cscan 201olu
ID
:
SUNet Username
:
Notes: a) Please answer the questions only in the provided space after each question.
b) Duration is 100 minutes.
c) Closed-bo
January 22, 2009
CS201 (Intro. to Computing) FINAL Exam
1
2
3
4
5
6
7
8
9
10
TOTAL
Name
:
SUNet Username :
ID
:
Notes: a) Please answer the questions only in the provided space after each question.
b) Duration is 160 minutes.
c) Close-book, close-notes, n
December 19, 2011
CS201 (Intro. to Computing) MIDTERM II
1
Name
ID
2
3
4
5
6
TOTAL
: Solutions
:
Notes: a) Please answer the questions only in the provided space after each question.
b) Duration is 120 minutes.
c) Closed-book, closed-notes, no calculators
January 22, 2008
CS201 (Intro. to Computing) FINAL Exam
1
2
3
4
5
6
7
8
9
TOTAL
Name
:
SUNet Username :
ID
:
Notes: a) Please answer the questions only in the provided space after each question.
b) Duration is 160 minutes.
c) Close-book, close-notes, no c
January 26, 2007
CS201 (Intro. to Computing) FINAL Exam
1
2
Name
ID
3
4
5
6
7
8
9
TOTAL
:
:
Notes: a) Please answer the questions only in the provided space after each question.
b) Duration is 150 minutes.
c) Close-book, close-notes, no calculators and co
CS201 (Intro. to Computing)
Sample Questions for the FINAL Exam
Those questions do not imply any favorite subject or question type for the questions in the
actual exam
Please also review recitation questions, samples covered in the class, homeworks and th
January 22, 2011
CS201 (Intro. to Computing) FINAL Exam
1
Name
ID
2
3
4
5
6
7
8
9
TOTAL
:
:
Notes: a) Please answer the questions only in the provided space after each question.
b) Duration is 160 minutes.
c) Close-book, close-notes, no calculators and co
June 5, 2010
CS201 (Intro. to Computing) FINAL Exam
1
Name
ID
2
3
4
5
6
7
8
TOTAL
:
:
Notes: a) Please answer the questions only in the provided space after each question.
b) Duration is 140 minutes.
c) Close-book, close-notes, no calculators and computer
December 13, 2010
CS201 (Intro. to Computing) MIDTERM II
1
Name
ID
2
3
4
5
6
TOTAL
: Solutions
:
Notes: a) Please answer the questions only in the provided space after each question.
b) Duration is 110 minutes.
c) Closed-book, closed-notes, no calculators
May 13, 2009
CS201 (Intro. to Computing) MIDTERM II
1
Name
ID
2
3
4
5
6
TOTAL
:
:
Notes: a) Please answer the questions only in the provided space after each question.
b) Duration is 100 minutes.
c) Closed-book, closed-notes, no calculators and computers.
December 26, 2008
CS201 (Intro. to Computing) MIDTERM II
1
Name
ID
2
3
4
5
6
TOTAL
:
:
Notes: a) Please answer the questions only in the provided space after each question.
b) Duration is 100 minutes.
c) Closed-book, closed-notes, no calculators and compu
CS 201 (Intro. to Computing) Fall 2007
Sabanc University
Sample Questions for Midterm 1
Those questions do not imply any favorite subject or question type for the questions in the
actual exam
Please also review recitation questions, samples covered in the
December 19, 2009
CS201 (Intro. to Computing) MIDTERM II
1
Name
ID
2
3
4
5
6
7
TOTAL
:
:
Notes: a) Please answer the questions only in the provided space after each question.
b) Duration is 100 minutes.
c) Closed-book, closed-notes, no calculators and com
November 24, 2007
CS 201 (Intro. to Computing) MIDTERM I
1
2
3
4
5
6
7
TOTAL
Name and Last Name : Solve Me Get100
ID
:
SUNet Username
:
Notes: a) Please answer the questions only in the provided space after each question.
b) Duration is 100 minutes.
c) Cl
December 29, 2007
CS201 (Intro. to Computing) MIDTERM II
1
Name
ID
2
3
4
5
6
7
TOTAL
:
:
Notes: a) Please answer the questions only in the provided space after each question.
b) Duration is 100 minutes.
c) Close-book, close-notes, no calculators and compu
Sabanci University
MATH 203, Recitation 9, Fall 2015
1. Use the table on page 3 to nd the probabilities that a random variable Z having the standard normal
distribution will take on a value i. less than - 0.63
ii. between -0.1 and 1.55.
2. If X is a rando
Sabanci University
MATH 203, Recitation 8, Fall 2015
1. Let X and Y be two discrete random variables with the joint probability distribution
f (x, y) =
1
(x + y),
21
for x = 1, 2, 3; y = 1, 2.
Find E(X | Y = 1) and E(Y | X = 2).
2. Let X and Y be two cont
Sabanci University
MATH 203, Recitation 10, Fall 2015
1. Exercise 7.3: If X has the uniform density with the parameters = 0 and = 1, use the distribution
function technique to nd the probability density of the random variable Y = X.
2. Let X be a discrete
Math 203
Semih Sezer (section A), Jaap Geluk (section B)
Fall 2015/16
Ch. 2: Section 1 and 2: Introduction and Sample Spaces.
In the rst subsection the concept of a random experiment by
means of examples is introduced. The exposition is somewhat
more elab
Sabanci University
MATH 203, Recitation 3, Fall 2015
1. Suppose you pick a card at random from a well shufed deck. What is the probability that it is an
Ace given that it is a Diamond?
2. Exercise 2.95: A shipment of 1000 parts contains 1 percent defectiv
Sabanci University
MATH 203, Recitation 2, Fall 2015
1. In a lottery, a player must choose 8 of the numbers from 1 to 40. The lottery
commission then performs an experiment that selects 8 of those 40 numbers.
Assuming that the choice of the lottery commis
Math 203
Semih Sezer (section A), Jaap Geluk (section B)
Fall 2015/16
Ch. 3, Section 1: Random Variables
In Ch. 2 we considered probability spaces
A sample space ,
A set of events F, consisting of subsets of
A probability measure assigned to each event.
Recitation 1
1. Exercise 1.1: An operation consists of two steps, of which the rst can be made in n1 ways. If the rst
step is made in the ith way, the second step can be made in n2i ways.
(a) Use a tree diagram to nd a formula for the total number of ways
Math 203
Semih Sezer (section A), Jaap Geluk (section B)
Fall 2015/16
Chapter 1: cartesian products
Theorem (Cartesian Products)
The number of ordered pairs (xi , yj ) where
xi X = cfw_x1 , x2 , . . . xn , yj Y = cfw_y1 , y2 , . . . ym is n m.
Note that
Sabanci University
Faculty of Engineering and Natural Sciences
Mathematics
MATH 203, Midterm Exam I
October 23, 2014, 19:40 - 21:40
Name:
Student Number:
Q1
Q2
Q3
Q4
Q5
Q6
Q7
Q8
Q9
Q10
Total
4
2
2
4
3
2
4
2
3
4
Max = 30
There are ten questions, pages are