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

# Category: Course Update

## CSE 505 Term Test 2

Date: Tuesday, 25th September 2017 18th November 2017 Syllabus: Lecture 4,5,6,7,8 Question:cse-505-TT2 Marks: sec-2017-cse-505-TT2 result Solution:

## CSE 305 Term Test 2

Date: Tuesday, 23rd September 2017 Syllabus: Lecture 4,5,6 Question: CSE-305-TT2 [All 4 sets] Marks: sec-2017-cse-305-TT2 result Solution: CSE-305-TT2_ms

## EEE 305 Term Test 2

Date: Tuesday, 19th September 2017 Syllabus: Up-to Gauss elimination chapter from syllabus of last term test Question: EEE 305 tt2 Marks: sec-2017-eee-305-TT2 result Question solution: EEE 305 tt2 MS

## CSE 506 Lab 7

Practise #1 (Section 6.5) Write a code to take a string input and print the first and last capital letters in the string in alphabatical order //code TITLE First and last capitals .MODEL SMALL ; DIRECTIVE .STACK 100H .DATA ; CR EQU 0DH ; LF EQU 0AH ; ;A DW 2 ; DATA SEGMENT ;B

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

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.

## CSE 506 Lab 6

Practise #1 (Example 6.4) If AX contains a negative number, put -1 In BX; if AX contains 0, put O In BX; if AX contains a positive number, put 1 In BX.ยท mov ax,0FFFBh CMP AX,0 JL NEGATIVE JE ZERO JG POSITIVE NEGATIVE: MOV BX,-1 JMP END_CASE ZERO: MOV BX,0 JMP END_CASEPOSITIVE: MOV BX,1 JMP

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

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;

## CSE 506 Lab 5

Practise #1 (Eg 6.1) Write a code to find the greater signed number of the numbers stored in AX and BX ABC: mov ah, 1 int 21h mov bl, al int 21h mov bh, al cmp bl, bh jG point1 jl point2 point1: mov ah, 2 mov dl, ‘>’ int 21h jmp ABC point2: mov