 | | Home : Math : Higher Mathematics : Discrete Mathematics : Rosen, Discrete Mathematics and Its Applications, 6th Edition : Chapter 10 | | LINKS: |  | |
Pages: 1 2 3 [>>] | - Page 683 - Section 10.1
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 683 - Section 10.1
Names Beginning with B -- You can find biographies of eight members of the Bernoulli family at the MacTutor History of Mathematics Archive, University of St. Andrews, Scotland. To find these biographies, look at the index page of names that begin with the letter B.
http://www-groups.dcs.st-and.ac.uk/history/Indexes/B.html
(Added: Fri Jul 28 2006)
- Page 686 - Section 10.1
Information on Binary Trees -- Detailed information on binary trees is provided here.
http://www.theory.csc.uvic.ca/~cos/inf/tree/BinaryTrees.html
(Added: Fri Jul 28 2006)
- Page 688 - Section 10.1
Arthur Cayley -- You can find biographical information about Arthur Cayley at the MacTutor site of biographical information about mathematicians.
http://www-gap.dcs.st-and.ac.uk/~history/Mathematicians/Cayley.html
(Added: Fri Jul 28 2006)
- Page 690 - Section 10.1
Example of Structural Induction -- Proofs of three properties of binary trees using structural induction can be found here.
http://sciris.shu.edu/Resources/Cs/c2113/notes11d.htm
(Added: Fri Jul 28 2006)
- Page 690 - Section 10.1
Exercises for the Reader -- Exercises asking for proofs using structural induction concerning binary trees can be found here. Click on the up button for a list of topics on this website.
http://www-2.cs.cmu.edu/afs/cs/academic/class/15671-f95/www/handouts/induction/node5.html#SECTION00050000000000000000
(Added: Fri Jul 28 2006)
- Page 690 - Section 10.1
Proving a Theorem by Structural Induction -- The method of proving theorem about binary trees by structural induction is illustrated here.
http://www-2.cs.cmu.edu/afs/cs/academic/class/15671-f95/www/handouts/induction/node4.html
(Added: Fri Jul 28 2006)
- Page 690 - Section 10.1
Structural Induction Example - Binary Trees -- An example of proof by structural induction of a result concerning binary trees can be found here.
http://www.cs.sfu.ca/~cameron/Teaching/384/99-3/tree-induction.html
(Added: Fri Jul 28 2006)
- Page 695 - Section 10.2
Simple Binary Search Tree Applet -- You can find a demonstration of operations on binary search trees here.
http://www.ibr.cs.tu-bs.de/courses/ss98/audii/applets/BST/BST-Example.html
(Added: Fri Jul 28 2006)
- Page 695 - Section 10.2
Binary Search Trees -- You can learn more about binary search trees here.
http://www.cs.nyu.edu/algvis/java/bst.html
(Added: Fri Jul 28 2006)
- Page 695 - Section 10.2
Java Models -- An applet illustrating the behavior of binary search trees can be found here.
http://webpages.ull.es/users/jriera/Docencia/AVL/AVL%20tree%20applet.htm
(Added: Fri Jul 28 2006)
- Page 695 - Section 10.2
Binary Search Trees -- Consult the Wikipedia article to learn more about binary search trees.
http://en.wikipedia.org/wiki/Binary_search_tree
(Added: Fri Jul 28 2006)
- Page 698 - Section 10.2
12-coins problem -- You can learn more about the 12-coins problem and related problems here.
http://www.iwriteiam.nl/Ha12coins.html
(Added: Fri Jul 28 2006)
- Page 698 - Section 10.2
Recent Puzzles -- The Grey Labyrinth Puzzle site describes a puzzle for finding a counterfeit coin mixed in with seven other coins.
http://www.greylabyrinth.com/Puzzles/puzzle019.htm
(Added: Fri Jul 28 2006)
- Page 699 - Section 10.2
sorting complexity - tree stuff -- You can find information on the computational complexity for different kinds of sorts here.
http://www.cs.miami.edu/~vjm/csc517/11.txt
(Added: Fri Jul 28 2006)
- Page 701 - Section 10.2
Geometric Paper Folding -- David Huffman of Huffman coding fame has been creating some complex and original folded structures. Examples of his work can be found here. Try creating some of the designs on the webpage.
http://www.sgi.com/grafica/huffman/
(Added: Fri Jul 28 2006)
- Page 701 - Section 10.2
Data Compression -- 3 -- Information on Huffman coding and other data compression techniques can be found here.
http://www.ics.uci.edu./~dan/pubs/DC-Sec3.html#Sec_3.2
(Added: Fri Jul 28 2006)
- Page 701 - Section 10.2
Practical Huffman Coding -- Here is a website that focuses on practical issues you need to know for writing a fast and efficient Huffman coder. What is the maximum length of a Huffman code?
http://www.compressconsult.com/huffman/
(Added: Fri Jul 28 2006)
- Page 701 - Section 10.2
When Fibonacci and Huffman meet by Arturo Campos -- Tips for implementing Huffman coding can be found here.
http://www.arturocampos.com/ac_fib_huffman.html
(Added: Fri Jul 28 2006)
- Page 701 - Section 10.2
Huffman Encoding -- To learn more about Huffman coding and to see an animation of how it works, go here.
http://www.cs.auckland.ac.nz/software/AlgAnim/huffman.html
(Added: Fri Jul 28 2006)
- Page 702 - Section 10.2
David A. Huffman -- A biography of David Huffman can be found here on Wikipedia.
http://en.wikipedia.org/wiki/David_A._Huffman
(Added: Fri Jul 28 2006)
- Page 702 - Section 10.2
David Huffman -- An obituary of David Huffman can be found here.
http://www.ucsc.edu/news_events/press_releases/archive/99-00/10-99/huffman.htm
(Added: Fri Jul 28 2006)
- Page 704 - Section 10.2
Minimax with Alpha-Beta Cutoff -- Information about the minmax strategy and alpha-beta pruning in game trees can be found here.
http://www.cis.temple.edu/~ingargio/cis587/readings/alpha-beta.html
(Added: Fri Jul 28 2006)
- Page 704 - Section 10.2
Topic #11 Game trees. Alpha-beta search -- Information about alpha-beta pruning can be found here. Try out the interactive Java applet.
http://www.cs.mcgill.ca/~cs251/OldCourses/1997/topic11/
(Added: Fri Jul 28 2006)
- Page 704 - Section 10.2
Game Trees -- An excellent discussion of the use of trees to study games can be found on the Principles and Practice of Mathematics On-line website.
http://www.webpearls.com/products/demos/pap/comap/chapter5/sec4/node2.html
(Added: Fri Jul 28 2006)
| |
Pages: 1 2 3 [>>] | |
