R Assignment Solutions
R Assignment Solutions
i=2
sumSeries=1
n=1
while (n<100) {
sumSeries=sumSeries+(1/i)
i=i+2
n=n+1
sumSeries
#########2########
sum_K=0
k=1
while(sum_K<30)
sum_K = sum_K + k
k=k+1
k-1
###########3########
sumSeries_sq=0
i=1
n=1
while (i<=99) {
sumSeries_sq = sumSeries_sq + (-1)^(n+1)*(i*i)
i=i+2
n=n+1
sumSeries_sq
###########4#########
#1 Number of Iterations
for (i in 1:numbiteration) {
return(x2)
x0 <- x1
x1 <- x2
#2 Bisection Method
for (i in 1:num) {
return(x2)
ifelse(sign(f(x2)) == sign(f(x0)),
x0 <- x2,
x1 <- x2)
bisection(f, 1, 2)
###########5#########
x=c(5,7,11,13,17)
y=c(150,392,1452,2366,5202)
n=length(x);
xx=9; Pn=c()
for(i in 1:n){
V=1:n;N=1;D=1
for(j in V[-i]){
N=N*(xx-x[j])
D = D*(x[i]-x[j])
}
Pn[i]=(N/D)*y[i]
sum(Pn)
#############6##########
#1
#Trapezoidal
f=function(x){x/(1+x)}
h <- b - a
return(fxdx)
trapezoid(f, 0, 1)
#Simpson's
f=function(x){x/(1+x)}
h <- (b - a)/6
return(fxdx)
simp(f, 0, 1)
#2 Composite Trapezoidal
f=function(x){x/(1+x)}
ctrapezoid <- function(f, a, b) {
h <- (b - a)/6
return(fxdx)
ctrapezoid(f, 0, 1)
#3 Composite Simpson's
f=function(x){x/(1+x)}
h <- (b - a)/n
x = a +c(1:n)*h
z=f(x)
z0 = z[seq(1,n-1, by = 2)]
z1 = z[seq(1,n-2, by = 2)]
fxdx
########7#######
#1
#I1
f=function(x){1/(1+x^2)}
a=-1
b=1
I=2*f(0)