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 almak input >number >word;
in bitince
n.close();
To clear
Sabanci University
Faculty of Engineering and Natural Sciences
Mathematics
MATH 203, Final Exam
May 23, 2015, 9:30 - 11:30
Name:
Student Number:
Q1
Q2a
Q2b
Q2c
Q2d
Q3a
Q3b
Q3c
Q4
Q5a
Q5b
Q5c
Total
2
2
3
3
3
3
2
2
3
2
2
3
Max = 30
There are ve questions w
#include <iostream>
#include "date.h"
using namespace std;
Date mybirthday(int year)
cfw_
Date d(12,21,year);
cout<d.DayName()<" ";
return d;
int main()
cfw_
int year1,year2,currentyear;
cout<"Please enter year";
cin>year1>year2;
for(year1; year1<
Sabanci University
Faculty of Engineering and Natural Sciences
Mathematics
MATH 203, Final Exam
January 2, 2015, 9:00 - 11:00
Name:
Student Number:
Q1
Q2a
Q2b
Q3
Q4
Q5
Q6a
Q6b
Q7
Q8a
Q8b
Total
4
4
4
4
4
3
3
4
4
3
3
Max = 40
There are eight questions with
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
May 6, 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 and c
CS 201 (Introduction to Computing)
Fall 2013
Sabanc University - Sample Questions and
Solutions 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,
CS201 (Intro. to Computing) MIDTERM II
SAMPLE QUESTIONS Fall 2013
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
CS 201 (Introduction to Computing)
Fall 2013
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 covere
May 6, 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 and c
December 19, 2011
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 120 minutes.
c) Closed-book, closed-notes, no calculators and compu
ECON 201 Alkan
FINAL EXAM
Jan 10, 2012
1. A FIRM faces a potential RIVAL who can choose to EN T ER or N OT
EN T ER. If RIVAL chooses EN T ER, then FIRM chooses to F IGHT or N OT
F IGHT .
RIVAL prefers EN T ER to N OT EN T ER if FIRM would not N OT F IGHT
ECON 201B Spring 2012 Alkan
FINAL EXAM
150 minutes
1. (i) (5 pts) What is a Game in Normal Form ?
(ii) (5 pts) What is a Nash Equilibrium ?
2. (30 pts) Consider a game where an INCUMBENT faces two CHALLENGERs in two dierent locations sequentially. In each
11/01/1985 M Gregory Green
1/5/1980 M Nicholas Cox
8/11/1995 m Harry KANE
14/2/1991 m Dennis REED
11/3/1985 M Jose Mourinho
09/8/2008 F Evelyn Carter
17/6/1997 m Ronaldo Luis Nazario de Lima
10/2/2000 f Elizabeth TAYLor Smith
14/4/1994 F Beverly Lopez
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
Sabanci University
Faculty of Engineering and Natural Sciences
Mathematics
MATH 203, Midterm Exam I
March 5, 2015, 19:40 - 21:40
Name:
Student Number:
Q1
Q2
Q3
Q4
Q5
Q6
Q7
Q8
Q9
Q10
Total
2
2
2
2
2
2
4
6
4
4
Max = 30
There are ten questions, pages are nu
CS201 - Fall 2015 - Sabanc University
Homework #6 Due: November 30, 2015, Monday, 19:00
Birthday Database Search
Brief Description
First let us start with a brief definition of the Database concept. A database is a collection of data records
stored in a c
January 11 1985 Friday Gregory Green
November 8 1995 Wednesday Harry Kane
February 14 1991 Thursday Dennis Reed
March 11 1985 Monday Jose Mourinho
June 17 1997 Tuesday Ronaldo Luis Nazario De Lima
September 27 1994 Tuesday Paul Alexander The Great
January
const-reference =parameters avoid copies, but cannot be
changed in the function
Heuristic=Set of guidelines and policies
Cohesion= classes do one application
Coupling=functions are in interation
Behaviour= member functions
State=Private part
Linking phase
#include <iostream>
#include <string>
#include "strutils.h"
using namespace std;
string revstring (string s)/ post: returns reverse of the string s
cfw_
int k = s.length() - 1;
string rev = ";
/ starting with an empty string
while (k >= 0)
cfw_
rev = rev