http://cmp207.pbwiki.com/ RecentChanges for cmp207 ko http://cmp207.pbwiki.com/feedlogo.gif http://pbwiki.com/ PBwiki 1.3.8 support@pbwiki.com http://cmp207.pbwiki.com/KnightsTour email.hidden@example.com (Camron) Camron edited KnightsTour Part 2:
Write a program that will find (if it exists)a solution to a tour of an nXn board with 4 <= n <= 10.
knightsTour.java
moveNode.java
]]> Wed, 14 May 2008 23:12:25 +0000 mod http://cmp207.pbwiki.com/SieveOfEratosthenes email.hidden@example.com (vijay) vijay edited SieveOfEratosthenes Iwas born in 276BC in Cyrene.Iwas not just an ordinary man. He was a mathematician, poet, astronomer, geographer, and athlete. Most importantly,I succeeded as the chief librarian of the Library of Alexandria. Most ofmy discoveries willcontribute to most of the knowledge that that poeple will have in the future. For example,I devised a system for longitude and latitude, calculated the circumference of the Earth, created a map of the world, and devised a very famous algorithm known as the sieve of Eratosthenes, which as you can see, is named after me. Throughout this paper I will be discussing the sieve of Eratosthenes and how it is used.
The sieve of Eratosthenes is an algorithm used to locate all prime numbers from one to a specified maximum number, n. It involves a chart from one to n with x rows and y columns. In order to go through all prime numbers within that range (1 to n, where n is the maximum number) the user must locate and remove from the chart all of the multiples of the numbers in the first ro]]> Tue, 13 May 2008 11:13:19 +0000 mod http://cmp207.pbwiki.com/SieveOfEratosthenes email.hidden@example.com (vijay) vijay edited SieveOfEratosthenes What else is he known for?
The Sieve of Eratosthenes
While researching Eratosthenes (bornIwas born in 276BC in Cyrene, which is modern day Libya) and several works based on him and his discoveries, I became fascinated with his brilliance. He was Cyrene.Iwas not just an ordinary man. He was a mathematician, poet, astronomer, geographer, and athlete. Most importantly, he importantly,I succeeded as the chief librarian of the Library of Alexandria. Most of his ofmy discoveries contribute willcontribute to most of the knowledge that we that poeple will have today. in the future. For example, he example,I devised a system for longitude and latitude, calculated the circumference of the Earth, created a map of the world based on the geographical knowledge of the European people of that time, world, and devised a very]]> Tue, 13 May 2008 11:00:28 +0000 mod http://cmp207.pbwiki.com/SieveOfEratosthenes email.hidden@example.com (vijay) vijay edited SieveOfEratosthenes Part 2:
Write a program implementing the Sieve of Eratosthenes to find all prime numbers less than 32768.
SieveOfEratosthenes.java
]]> Tue, 13 May 2008 10:44:57 +0000 mod http://cmp207.pbwiki.com/TowersOfHanoi email.hidden@example.com (Anonymous) Anonymous edited TowersOfHanoi]]> Tue, 06 May 2008 21:21:15 +0000 mod http://cmp207.pbwiki.com/TowersOfHanoi email.hidden@example.com (Anonymous) Anonymous edited TowersOfHanoi Nyhoff, Larry. ADTs,Data Structures and Problem Solving with C++. Reading: Pearson-Prentice Hall, 2005.
Romik, Dan. “Shortest paths in the Tower of Hanoi graph and finite automata.” SIAM Journal on Discrete Mathematics.2006. EBSCO Databases. Academic Search Premier. Nassau Community College Lib., Garden City, New York. 13 March, 2008 Host Research < http://search.ebscohost.com>
PART2:
Write a program that will solve the problemfor 4 disks and 3 pegs.
//********************************************************************
////********************************************************************// TowersOfHanoi.java
//
// // // Represents the classic Towers of Hanoi puzzle.
//
// puzzle.//// This code was base in the example of Lewis and chase in their
// // book: "Java Software Structures"
//
//******************************************]]> Tue, 06 May 2008 21:19:47 +0000 mod http://cmp207.pbwiki.com/TowersOfHanoi email.hidden@example.com (Anonymous) Anonymous edited TowersOfHanoi Nyhoff, Larry. ADTs,Data Structures and Problem Solving with C++. Reading: Pearson-Prentice Hall, 2005.
Romik, Dan. “Shortest paths in the Tower of Hanoi graph and finite automata.” SIAM Journal on Discrete Mathematics.2006. EBSCO Databases. Academic Search Premier. Nassau Community College Lib., Garden City, New York. 13 March, 2008 Host Research < http://search.ebscohost.com>
pegs. The program must also to be able to find a solution for 4 disks and 4 pegs
//********************************************************************
// TowersOfHanoi.java
//
// Represents the classic Towers of Hanoi puzzle.
//
// This code was base in the example of Lewis and 5 chase in their
// book: "Java Software Structures"
//
//********************************************************************
public class TowersOfHanoi {
private int totalDisks; // total disks and 4 pegs.
Part 2: playing in ]]> Tue, 06 May 2008 21:18:53 +0000 mod http://cmp207.pbwiki.com/FermatsTheorem email.hidden@example.com (Dan) Dan edited FermatsTheorem Fermat’s Last Theorem
My name is Pierre de Fermat and I am being channeled through this student in order to explain the significance of my life and Fermat’s Last Theorem, which has made me famous over the past few centuries. I was born to a wealthy family in August 20, 1601 in Beaumont-de-Lomagne in France. My family pushed for me to enter civil service, so I became a lawyer and eventually councilor. Despite my success in politics I felt a growing interest towards the field of mathematics. Arithmetica is a compilation of 13 books which contains mathematical problems which have only whole number solutions. After reading this through, my passion for number theory was solidified.
260) Thus, Thus Fermat’s Last Theorem arose, and the search for “Fermatean triples” began. began. Do any solutions exist for x, y, and z such that xn + yn = zn, n > 2?
I myself hinted at a solution for n = 4 using the method of infinite descent. By extension this tak]]> Tue, 06 May 2008 16:21:21 +0000 mod http://cmp207.pbwiki.com/FermatsTheorem email.hidden@example.com (Dan) Dan edited FermatsTheorem Fermat’s Last Theorem
My name is Pierre de Fermat and I am being channeled through this student in order to explain the significance of my life and Fermat’s Last Theorem, which has made me famous over the past few centuries. I was born to a wealthy family in August 20, 1601 in Beaumont-de-Lomagne in France. My family pushed for me to enter civil service, so I became a lawyer and eventually councilor. Despite my success in politics I felt a growing interest towards the field of mathematics. Arithmetica is a compilation of 13 books which contains mathematical problems which have only whole number solutions. After reading this through, my passion for number theory was solidified.
solutions.” (Allenbaugh, (Allenbaugh 260) Thus, Fermat’s Last Theorem arose, and the search for “Fermatean triples” began.
I myself hinted at a solution for n = 4 using the method of infinite descent. By extension this takes care of multiples such as n = 8, 12, 16, and so on. (Singh,]]> Tue, 06 May 2008 16:16:35 +0000 mod http://cmp207.pbwiki.com/FermatsTheorem email.hidden@example.com (Dan) Dan edited FermatsTheorem Write a higher level language program that will look for solutions for the equation
for2 <= n <= 10 and 0 <= x,y <= 100
Fermat’s Last Theorem
My name is Pierre de Fermat and I am being channeled through this student in order to explain the significance of my life and Fermat’s Last Theorem, which has made me famous over the past few centuries. I was born to a wealthy family in August 20, 1601 in Beaumont-de-Lomagne in France. My family pushed for me to enter civil service, so I became a lawyer and eventually councilor. Despite my success in politics I felt a growing interest towards the field of mathematics. Arithmetica is a compilation of 13 books which contains mathematical problems which have only whole number solutions. After reading this through, my passion for number theory was solidified.
We all have our bad habits, and I must admit to taunting fellow mathematicians by asking them to prove theorems, some from texts and some of my own, while stating I have]]> Tue, 06 May 2008 16:10:50 +0000 mod http://cmp207.pbwiki.com/FrontPage email.hidden@example.com (Richard Glass) Richard Glass edited FrontPage]]> Fri, 02 May 2008 06:00:20 +0000 mod http://cmp207.pbwiki.com/ZeroIt email.hidden@example.com (Camron) Camron edited ZeroIt XOR ax, ax
What, if any are the differences in the above?
Camron: Each instruction zeros the register in a different way which also results in different flags being set.
MOV ax, 0 puts the binary of the number 0 (which is 0) into the ax register, completely replacing the original value(if any). Does not set any flags.
SUB ax, ax uses arithimetic to subtract the value stored in the ax register by itself which will always result in 0. Sets all flags.
11010110
- 11010110
00000000
XOR ax, ax Performs an 'exlusive or' to itself which will always result in 0. Sets the Overflow and Carry flag to 0, sets the Sign and Zero flags, and leaves the Auxiliary flag unpredictable.
1011
XOR
1011
0000
]]> Thu, 01 May 2008 21:52:41 +0000 mod http://cmp207.pbwiki.com/FrontPage email.hidden@example.com (vijay) vijay edited FrontPage LibraryStuff
Users
VijaySieveOfEratosthenesVijaySieve Of Eratosthenes
sunoh5Eight Queens Problem
RoyRubioCharles Babbage and Ada Lovelace
]]> Mon, 28 Apr 2008 16:55:13 +0000 mod http://cmp207.pbwiki.com/SieveOfEratosthenes email.hidden@example.com (vijay) vijay edited SieveOfEratosthenes]]> Mon, 28 Apr 2008 16:51:31 +0000 mod http://cmp207.pbwiki.com/SieveOfEratosthenes email.hidden@example.com (vijay) vijay edited SieveOfEratosthenes Moulton, J. Paul."Sieve of Eratosthenes."The Gale Encyclopedia of Science.Ed. K. Lee Lerner and Brenda Wilmoth Lerner.Vol. 5. 3rd ed.Detroit: Gale,2004.3632-3633.Gale Virtual Reference Library. Gale.Nassau Community College Library - SUNY.17 Apr. 2008http://go.galegroup.com/ps/start.do?p=GVRL&u=sunynassau.
Baldwin, Doug, and Greg Scragg. Algorithms and Data Structures: The Science of Computing. Charles River Media, 2004.
Part 2:
Write a program implementing the Sieve of Eratosthenes to find all prime numbers less than 32768.
Part 2:
Write a program implementing the Sieve of Eratosthenes to find all prime numbers less than 32768.
]]> Mon, 28 Apr 2008 16:48:58 +0000 mod http://cmp207.pbwiki.com/SieveOfEratosthenes email.hidden@example.com (vijay) vijay edited SieveOfEratosthenes Moulton, J. Paul."Sieve of Eratosthenes."The Gale Encyclopedia of Science.Ed. K. Lee Lerner and Brenda Wilmoth Lerner.Vol. 5. 3rd ed.Detroit: Gale,2004.3632-3633.Gale Virtual Reference Library. Gale.Nassau Community College Library - SUNY.17 Apr. 2008http://go.galegroup.com/ps/start.do?p=GVRL&u=sunynassau.
Baldwin, Doug, and Greg Scragg. Algorithms and Data Structures: The Science of Computing. Charles River Media, 2004.
Part 2:
Write a program implementing the Sieve of Eratosthenes to find all prime numbers less than 32768.
Part 2:
Write a program implementing the Sieve of Eratosthenes to find all prime numbers less than 32768.
]]> Mon, 28 Apr 2008 16:46:54 +0000 mod http://cmp207.pbwiki.com/SieveOfEratosthenes email.hidden@example.com (vijay) vijay edited SieveOfEratosthenes Works Cited
Antonio R. Quesada, “On the K-th extension of the Sieve of eratosthenes,” International Journal of Mathematics and Mathematical Sciences, vol. 18, no. 3, pp. 539-544, 1995. doi:10.1155/S0161171295000688
Gale.Nassau Community Community College Library - SUNY.17 Apr. 2008<http://go.galegroup.com/ps/start.do?p=GVRL&u=sunynassau>. 2008http://go.galegroup.com/ps/start.do?p=GVRL&u=sunynassau.
Baldwin, Doug, and Greg Scragg. Algorithms and Data Structures: The Science of Computing. Charles River Media, 2004.
Part 2:
]]> Mon, 28 Apr 2008 16:45:42 +0000 mod http://cmp207.pbwiki.com/SieveOfEratosthenes email.hidden@example.com (vijay) vijay edited SieveOfEratosthenes Works Cited
Antonio R. Quesada, “On the K-th extension of the Sieve of eratosthenes,” International Journal of Mathematics and Mathematical Sciences, vol. 18, no. 3, pp. 539-544, 1995. doi:10.1155/S0161171295000688
Apr. 2008<http://go.galegroup.com/ps/start.do?p=GVRL&u=sunynassau>. 2008http://go.galegroup.com/ps/start.do?p=GVRL&u=sunynassau.
Baldwin, Doug, and Greg Scragg. Algorithms and Data Structures: The Science of Computing. Charles River Media, 2004.
]]> Mon, 28 Apr 2008 16:44:44 +0000 mod http://cmp207.pbwiki.com/SieveOfEratosthenes email.hidden@example.com (vijay) vijay edited SieveOfEratosthenes]]> Mon, 28 Apr 2008 16:43:15 +0000 mod http://cmp207.pbwiki.com/SieveOfEratosthenes email.hidden@example.com (vijay) vijay edited SieveOfEratosthenes]]> Mon, 28 Apr 2008 16:42:40 +0000 mod