Member function eklerken classname:func diye yaz!
Input ama:
in.open(filename.c_str();
if(in.fail()
cout < Fail! < endl;
Satr almak getline(input, line);
Karakter almakinput.get(ch);
Kelime kelime alm
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 th
May 17, 2016
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 150 minutes.
January 14, 2014
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 160 minut
January 15, 2013
CS201 (Intro. to Computing) FINAL Exam
1
Name
ID
2
:
:
3
4
5
6
7
8
TOTAL
SOLUTIONS
Notes: a) Please answer the questions only in the provided space after each question.
b) Duration is
April 20, 2015
CS 201 (Intro. to Computing) MIDTERM II
1 a,b
1c
2
3
4a
4b
5
6
TOTAL
Name and Last Name :
ID
:
SUNet Username
:
Notes: a) Please answer the questions in the provided space after each qu
December 1, 2014
CS201 (Intro. to Computing) MIDTERM II
1
Name
ID
2
3
4
5
6
7
8
TOTAL
: Solutions
:
Notes: a) Please answer the questions only in the provided space after each question.
b) Duration is
December 16, 2013
CS 201 (Intro. to Computing) MIDTERM II
1
2
3
4
5
6
TOTAL
Name and Last Name :
ID
:
SUNet Username
:
Notes: a) Please answer the questions only in the provided space after each quest
CS201 (Intro. to Computing) MIDTERM II
SAMPLE QUESTIONS Fall 2016
Those questions do not imply any favorite subject or question type for the questions in the
actual exam
Please also review recitation
August 25, 2010
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 140 minutes.
January 4, 2016
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 150 minutes.
CS201 (Intro. to Computing) MIDTERM II
SAMPLE QUESTIONS & ANSWERS
Fall 2016
Those questions do not imply any favorite subject or question type for the questions in the
actual exam
Please also review r
#include <iostream>
#include <fstream> / for ifstream
#include <string>
#include "prompt.h"
/ finds the total number of words with more than
/ the average word length in a file
void AverageWordLength
Reference parameters (6.2.3)
We might need a function to return more than one value
Find roots of a quadratic
2 return values. What are they?
Get first and last name of a user and return them
2 r
Announcements
Homework 3 Robot game will be assigned this Friday
Due in 1.5 WEEKS Start EARLY!
Common Questions:
Be aware of the flow of the game, read the document for all details
The flow of the
Announcements
Midterm2 grades were announced
Homework 5 grades were announced
Homework 6 finished
Homework 7 is assigned this week, will be DUE
next week May 24th Wednesday
FINAL exam is on May 29th M
Whats Left in the Course
Arrays and vectors (Chapter 8)
including searching and sorting (partially Chapter 11)
Recursion, scope rules, global and static variables
partially Chapter 10
structs (7.4
#include <iostream>
#include <fstream>
#include <string>
#include "prompt.h"
using namespace std;
/ count # of lines in input file
int main()
cfw_
ifstream input;
string s; / line entered by user
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 , . . .
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 tr
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 sub
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
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.9
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 examp
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 densi
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(