CSTA K-12 Repository: Item 2378/232

	Home

Browse
	Communities & Collections
	Titles
	Authors
	By Date

Sign on to:
	My DSpace authorized users
	Receive email updates
	Edit Profile


	About DSpace

CSTA K-12 Repository >
CSTA Source: K-12 Repository >
Level 2: Computer Science in the Modern World >
L2 A: Topics >
L2 A 02: Algorithmic Problem Solving >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2378/232

Title:	Thinking about Algorithms
Authors:	Goldman, Kenneth J
Keywords:	algorithm stable marriage square root root finding GCD greatest common divisor halting problem
Issue Date:	18-Jul-2006
Abstract:	Introduces the idea of an algorithm through discussing interesting problems in computer science. These problems include the Stable Marriage problem, finding square roots, finding the greatest common divisor (GCD), and the halting problem.
URI:	http://hdl.handle.net/2378/232
Appears in Collections:	L2 A 02: Algorithmic Problem Solving L3 A 07: Limits of computing L3 A 01: Program design & problem solving

Files in This Item:

File	Description	Size	Format
105_Thinking_About_Algorithms.pdf		63Kb	Adobe PDF	View/Open

All items in DSpace are protected by copyright, with all rights reserved.

DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard

or broken NS 4.x --%>