## EEE 305 Term Test 3

November 21, 2017
By shp

Date: Tuesday, 21st November 2017 Syllabus: Lecture 7,8, 9, 10 Question: EEE 305 tt3 Marks: sec-2017-eee-305-TT3 result Question solution: EEE 305 tt3 ms

## EEE 306 Lab 12 :

November 8, 2017
By shp

Practise #1 Naive Gauss elimination Practise #2 LU decomposition Practise #3 Single Segment Trapezoidal Task #1 Gauss elimination with pivoting and scaling Task #2 LU decomposition with pivoting and scaling (Chapra pg 282) Task #3 Multi segment Trapezoidal

## Open Methods in Matlab

November 4, 2017
By shp

Task #1 Write a program to use fixed point iteration to solve the equation f(x)=e^(-x) – x where inputs will be the initial guess,  and maximum error (es). If the approximation error (ea) is less than es your program should stop continuing any iterations. Task #2 Write a program to use Newton Raphson Method to

## EEE 306 LAB 10 : Closed roots in Matlab

October 29, 2017
By shp

Problem #1 write a matlab script to find the root of an equation in the for ax^2+bx+c using bisection method Problem #2 write a matlab script to find the root of an equation in the for ax^2+bx+c using false position method inputs: a,b,c, no of iteration, es, initial guesses sample input a=-0.6 b=2.4 c=5.5 xu=10

## EEE 306 Lab 9 : Maclaurin series implementation Matlab

October 12, 2017
By shp

Problem#1 Find the approximation of e^x using maclauren series for %Ea <n   Problem#2 Find the approximation of sine(x) using maclaurin series for %Ea <n   Problem#3 Find the approximation of cosine(x) using maclaurin series for %Ea <n

## EEE 306 Lab 8 : Introduction to Matlab

September 20, 2017
By shp

This Lab is about an introduction to matlab. The objective of this lab is to learn about Basic mathematical and logical operator in matlab Working with Matrix and vector Use of conditional ‘if’ Use of for and while loop Practice script %Basic matrix operation a=[1 2 3;4 5 6;7 8 9] b=[3 2 1;6 5

## EEE 306 Lab 7 : Open methods for finding roots

September 20, 2017
By shp

Task #1 Write a program to use fixed point iteration to solve the equation f(x)=e^(-x) – x where inputs will be the initial guess, maximum number of iterations and maximum error (es). If the approximation error (ea) is less than es your program should stop continuing any iterations. Task #2 Write a program to use

## EEE 306 Lab 6 : Bracketing methods for finding roots

August 23, 2017
By shp

Task #1 Write a program to find root of an equation in the form ax^2+bx+c, where a,b,c, will be taken as input. You have to take input the number of iteration and the termination criterion. Use bisection method to find the root where the upper limit and lower limit will be taken as input.

## EEE 306 Lab 5 : Taylor series sine and cosine

August 9, 2017
By shp

Task #1 Write a program to find an estimate of any value of cos(x). You should take input the value of x in degree, the maximum number of iteration, and the minimum error requirement Sample code #include<stdio.h> #include<math.h> int fact(int n) { if (n==1){return 1;} return n*fact(n-1); } int main() { int i,j, iter, sign=1;