What are iterative methods? Why are these methods more suitable for computer use ?
What are bracketing methods? pg120 (chapra)
What are open methods? Pg 142 (chapra)
What do you mean by convergence and divergence? Pg 144 (chapra)
What are the advantages a
KHALID BIN HUDA
2nd Year Sec : B
1 2 3 4 5 6 7 8 9 10
> A= [55 62 60 61 63 65 62 59 58 56];
> B= [54 59 62 64 68 68 62 59 57 53];
a) Determine How many days the temp of A was above 60 degree.
b) On What day d
Q1. Find out the approximate root of the given equation as f(x) x x10
using false position method (regular falsi method) with initial bounds [1.5, 2]
using the following criteria;
b) Also perform error analysis on the given equa
x 3 , Es= 0.001
out the root of the above polynomial using Newton Raphson method.
Stop the iterative procedure until the following conditions become here;
Compare the efficiency of both errors.
Q1. Find out the root of the equation
-3 using bisection
method with initial bounds (1, 2)
a) Find out the absolute relative error at each iteration, we stop the
iteration procedure when Ea<presperifed tolerance value Es.
Binary Search Tree(BST):
The searching in binary tree data structure is called Binary
searching tree .
Searching operation in binary search tree is O(d).
O is represent the operation .
d is represents the depth .
UNIVERSITY OF KARACHI DEPARTMENT OF COMMERCE Assignment of strategic marketing
Name : Jahan-e-alam Father name : Muhammad jawed Sir name : sir arfeen Subject : Strategic marketing Roll no : 080622 Class : B.S (commerce) Date of submission : 6.2.2010
CIS*3700 (Winter 2007) Assignment One
Instructor: F. Song Due Time: Paper-and-pencil questions due on Feb. 1, right after the class and the implementation questions due on Feb. 4, by midnight. Part I: Paper-and-Pencil Questions (30 marks) 1. Artificial in