 | | Home : Math : Higher Mathematics : Discrete Mathematics : Rosen, Discrete Mathematics and Its Applications, 6th Edition : Chapter 10 : Page 2 | | LINKS: |  | |
Pages: [<<] 1 2 3 [>>] | - Page 707 - Section 10.2
IBM Research Home - Deep Blue -- Information about Deep Blue can be found here.
http://www.research.ibm.com/deepblue/
(Added: Fri Jul 28 2006)
- Page 710 - Section 10.3
Tree Traveral -- A brief description of preorder, inorder, and postorder traversals and code that can be used for each of these traversals can be found here.
http://www.nist.gov/dads/HTML/treetravrsl.html
(Added: Fri Jul 28 2006)
- Page 720 - Section 10.3
RPN -- Details about how calculators use reverse Polish notation can be found at the online HP Museum of Calculators. In particular, consult the RPN (or postfix) page here.
http://www.hpmuseum.org/rpn.htm
(Added: Fri Jul 28 2006)
- Page 720 - Section 10.3
The Evolution of RPN and Numeric Entry -- For more information about reverse Polish notation consult here.
http://www.hpmuseum.org/rpnvers.htm
(Added: Fri Jul 28 2006)
- Page 721 - Section 10.3
Jan Lukasiewicz -- You can learn more about Jan Lukasiewicz at the Polish philosophy site here.
http://eber.kul.lublin.pl/~polhome/PolPhil/Lukas/Lukas.html
(Added: Fri Jul 28 2006)
- Page 721 - Section 10.3
Jan Lukawiewicz -- A brief biography and a photograph of Jan Lukawiewicz can also be found at the MacTutor History of Mathematics Archive, University St. Andrews, Scotland.
http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Lukasiewicz.html
(Added: Fri Jul 28 2006)
- Page 726 - Section 10.4
Graph Theory Lessons -- Graph theory lessons, based on a software system called Petersen are available at the website of Christopher Mawata at the University of Tennessee, Chattanooga who developed this system. The software can draw, edit and manipulate simple graphs, as well as examine properties of graphs, and demonstrate them using computer animation, Among topics addressed are the handshaking theorem, isomorphism of graphs, complete graphs, subgraphs, regular graphs, platonic graphs, adjacency matrices, graph coloring, bipartite graphs, simple circuits, Euler and Hamilton circuits, trees, unions and sums of graphs, complements of graphs, line graphs, spanning trees, plane graphs, shortest paths, and minimal spanning trees. To find these lessons, go here.
http://www.utc.edu/~cpmawata/petersen/
(Added: Fri Jul 28 2006)
- Page 726 - Section 10.4
Lecture 16 - applications of DFS and BFS -- Some applications of breadth first search (BFS), depth first search (DFS) as well as information on strongly connected components can be found here.
http://www.cs.sunysb.edu/~algorith/lectures-good/node16.html
(Added: Fri Jul 28 2006)
- Page 726 - Section 10.4
Searching a Graph -- Information on breadth-first and depth-first searches, as well as topological sorting and reachability, can be found here.
http://www.cs.rochester.edu/users/faculty/nelson/courses/csc_173/graphs/search.html
(Added: Fri Jul 28 2006)
- Page 726 - Section 10.4
CCAA - Tree Algorithms -- Links to source code and animations of algorithms on trees, including breadth-first search and depth-first search can be found at a Complete Collection of Algorithm Animations.
http://www.cs.hope.edu/~alganim/ccaa/tree.html
(Added: Fri Jul 28 2006)
- Page 726 - Section 10.4
The JAWAA Hompage -- Animations of breadth-first search and depth-first search can be found at the Java and Web based Algorithm Animation (JAWAA) site.
http://www.cs.duke.edu/csed/jawaa2/
(Added: Fri Jul 28 2006)
- Page 726 - Section 10.4
Depth-First Search -- A detailed description of the depth-first search algorithm and a Java applet animating this algorithm can be found here.
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic26/#dfs
(Added: Fri Jul 28 2006)
- Page 726 - Section 10.4
IP Multicast -- To learn more about IP multicasting, consult this article in Wikipedia.
http://en.wikipedia.org/wiki/IP_Multicast
(Added: Fri Jul 28 2006)
- Page 729 - Section 10.4
Graph Theory Lessons -- Graph theory lessons, based on a software system called Petersen are available at the website of Christopher Mawata at the University of Tennessee, Chattanooga who developed this system. The software can draw, edit and manipulate simple graphs, as well as examine properties of graphs, and demonstrate them using computer animation, Among topics addressed are the handshaking theorem, isomorphism of graphs, complete graphs, subgraphs, regular graphs, platonic graphs, adjacency matrices, graph coloring, bipartite graphs, simple circuits, Euler and Hamilton circuits, trees, unions and sums of graphs, complements of graphs, line graphs, spanning trees, plane graphs, shortest paths, and minimal spanning trees. To find these lessons, go here.
http://www.utc.edu/~cpmawata/petersen/
(Added: Fri Jul 28 2006)
- Page 729 - Section 10.4
Lecture 16 - applications of DFS and BFS -- Some applications of breadth first search (BFS), depth first search (DFS) as well as information on strongly connected components can be found here.
http://www.cs.sunysb.edu/~algorith/lectures-good/node16.html
(Added: Fri Jul 28 2006)
- Page 729 - Section 10.4
Searching a Graph -- Information on breadth-first and depth-first searches, as well as topological sorting and reachability, can be found here.
http://www.cs.rochester.edu/users/faculty/nelson/courses/csc_173/graphs/search.html
(Added: Fri Jul 28 2006)
- Page 729 - Section 10.4
CCAA - Tree Algorithms -- Links to source code and animations of algorithms on trees, including breadth-first search and depth-first search can be found at a Complete Collection of Algorithm Animations.
http://www.cs.hope.edu/~alganim/ccaa/tree.html
(Added: Fri Jul 28 2006)
- Page 729 - Section 10.4
The JAWAA Hompage -- Animations of breadth-first search and depth-first search can be found at the Java and Web based Algorithm Animation (JAWAA) site.
http://www.cs.duke.edu/csed/jawaa/JAWAA.html
(Added: Fri Jul 28 2006)
- Page 729 - Section 10.4
Lecture Notes on Algorithm Analysis and Complexity Theory -- Ian Parberry of University of North Texas provides useful useful material on many topics in discrete mathematics with these lecture notes. You will need a PDF viewer to read these notes.
http://www.eng.unt.edu/ian/books/free/lnoa.pdf
(Added: Fri Jul 28 2006)
- Page 731 - Section 10.4
Combinatorial Object Server -- The Combinatorial Object Server, developed by Frank Ruskey, provides interactive programs for generating all the permutations, all the k-permutations, all the combinations, and all the combinations with at most k elements of a set with n elements, where n and k cannot exceed some reasonable large values. It also has programs for generating all the permutations and combinations of a multiset, which can be used to generate permutations and combinations when repetition of objects is allowed. Source code in C and/or Pascal can be downloaded for many of these programs. You can generate all the solutions to the n-queens problem in this section of the text.
http://www.theory.cs.uvic.ca/~cos/cos.html
(Added: Fri Jul 28 2006)
- Page 731 - Section 10.4
Solving the N-Queens Problem -- A Java applet for solving the n-queens problem can be found here.
http://www.apl.jhu.edu/~hall/NQueens.html
(Added: Fri Jul 28 2006)
- Page 731 - Section 10.4
The N by N Queens Problem -- A discussion and an interactive applet for solving the n-queens problem can be found on Pete Alfeld's Web pages at the University of Utah.
http://www.math.utah.edu/~alfeld/queens/queens.html
(Added: Fri Jul 28 2006)
- Page 731 - Section 10.4
Solving the N-Queens Problem -- A Java applet for solving the n-queens problem can be found at Marty Hall's Web pages, of Johns Hopkins University.
http://www.apl.jhu.edu/~hall/NQueens.html
(Added: Fri Jul 28 2006)
- Page 737 - Section 10.5
Minimal Spanning Trees -- Consult this page to learn more about minimal spanning trees.
http://www.cs.usask.ca/resources/tutorials/csconcepts/1999_2/tutorial/minSpanningTree1.html
(Added: Fri Jul 28 2006)
- Page 738 - Section 10.5
5.4.1 Prim’s Algorithm -- A description of Prim’s algoritm and animations of how it works can be found here.
http://students.ceid.upatras.gr/~papagel/project/prim.htm
(Added: Fri Jul 28 2006)
| |
Pages: [<<] 1 2 3 [>>] | |
