network quiz exam solutions

Jackson State University Department of Computer Science
CSC 435 Computer Networks Spring 2012
http://www.jsums.edu/cms/tues/html/CSC435-Spring2012.html

ECE 3076 Computer Communications
http://www.csc.gatech.edu/~copeland/3076/quizzes/index.html

TCP/IP Protocol Suite,
http://highered.mcgraw-hill.com/sites/0072967722/student_view0/chapter_1_quiz.html

Newton's method

In numerical analysis, Newton's method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real-valued function


Applications

Minimization and maximization problems

Newton's method can be used to find a minimum or maximum of a function. The derivative is zero at a minimum or maximum, so minima and maxima can be found by applying Newton's method to the derivative


Examples
Consider the problem of finding the square root of a number. There are many methods of computing square roots, and Newton's method is one.
For example, if one wishes to find the square root of 612, this is equivalent to finding the solution to

http://en.wikipedia.org/wiki/Newton's_method

Newton's Method: Example
http://www.youtube.com/watch?v=0H7L1m4_qvs


Bisection methods, Newton/Raphson and comparison
Lec 6 | MIT 6.00 Introduction to Computer Science and Programming, Fall 2008
http://www.youtube.com/watch?v=hVHqs38fPe8

Newton-Raphson Method: Example
http://www.youtube.com/watch?v=lFYzdOemDj8&feature=relmfu

Newton's Method 1
http://www.youtube.com/watch?v=_MQi3WntZqQ&feature=related

4-5 Newton's Method Example I
http://www.youtube.com/watch?v=cGTc70yDG6I&feature=related

4-5 Newton's Method Example II
http://www.youtube.com/watch?v=iht6utERkZo&feature=related


Newton's Method
http://www.youtube.com/watch?v=E24zUEKqgwQ&feature=related


Newton's Method Example Excel
http://www.youtube.com/watch?v=5ZRjUdjlVoU

Newton's method in C++
http://www.youtube.com/watch?v=dfg9rVl_Tgc&feature=related


Newton's method in java
http://www.youtube.com/watch?v=BLFkHOeaVMY

binary search

• Binary Search

Binary search relies on a divide and conquer strategy to find a value within an already-sorted collection
http://algorithms.openmymind.net/search/binarysearch.html

• Binary search

A binary search algorithm (or binary chop) is a technique for finding a particular value in a linear array, by ruling out half of the data at each step, widely but not exclusively used in computer science.
A binary search finds the median, makes a comparison to determine whether the desired value comes before or after it, and then searches the remaining half in the same manner.
A binary search is an example of a divide and conquer algorithm (more specifically a decrease and conquer algorithm) and a dichotomic search (more at Search algorithm).
http://www.codecodex.com/wiki/Binary_search

• Binary Search

http://www.youtube.com/watch?v=QJThYHfaZig

• Binary Search (recursive version)

http://www.youtube.com/watch?v=vjdTaI9DlFo

• Binary search (iterative version)

http://www.youtube.com/watch?v=fjlEZWu_c9I

merge sort

• Algorithms Lesson 3: Merge Sort

http://www.youtube.com/watch?v=GCae1WNvnZM

• merge sort with game cards

http://www.youtube.com/watch?v=dVaHHwtf8KM

• Merge Sort Tutorial

http://www.youtube.com/watch?v=ayN8nBiqg5I&feature=related
similar to quick sory
divide and conquer strategy

• Merge sort

Merge sort (also commonly spelled mergesort) is an O(n log n) comparison-based sorting algorithm
Merge sort is a divide and conquer algorithm

Conceptually, a merge sort works as follows
Divide the unsorted list into n sublists, each containing 1 element (a list of 1 element is considered sorted).
Repeatedly Merge sublists to produce new sublists until there is only 1 sublist remaining. This will be the sorted list.

http://en.wikipedia.org/wiki/Merge_sort