Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Providing a Proof for the Termination of Euclid Algorithm in CSC 490 Fall 2006 - Prof. Gar, Assignments of Computer Science

Information about a written homework assignment for csc 490 – computer science senior seminar i, taught by professor gary locklair in fall 2006. The assignment requires students to provide a proof that the euclid algorithm terminates for all inputs satisfying the initial conditions using appropriate assertions and inductive proofs.

Typology: Assignments

Pre 2010

Uploaded on 07/23/2009

koofers-user-ykt
koofers-user-ykt 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CSC 490 – Computer Science Senior Seminar I Professor Gary
Locklair
Written Homework Assignment #2 Fall
2006
Chapter 10 in The New Turing Omnibus – Program Correctness
assignment: A. Using the same techniques outlined in the chapter, provide a
proof that the “Euclid” algorithm terminates for all inputs satisfying the
initial conditions.
{15 points}
Use appropriate assertions and prove them inductively. Please word-process
or neatly write your answers.
CSC 490 – Computer Science Senior Seminar I Professor Gary
Locklair
Written Homework Assignment #2 Fall
2006
Chapter 10 in The New Turing Omnibus – Program Correctness
assignment: A. Using the same techniques outlined in the chapter, provide a
proof that the “Euclid” algorithm terminates for all inputs satisfying the
initial conditions.
{15 points}
Use appropriate assertions and prove them inductively. Please word-process
or neatly write your answers.

Partial preview of the text

Download Providing a Proof for the Termination of Euclid Algorithm in CSC 490 Fall 2006 - Prof. Gar and more Assignments Computer Science in PDF only on Docsity!

CSC 490 – Computer Science Senior Seminar I Professor Gary Locklair Written Homework Assignment #2 Fall 2006 Chapter 10 in The New Turing Omnibus – Program Correctness assignment: A. Using the same techniques outlined in the chapter, provide a proof that the “Euclid” algorithm terminates for all inputs satisfying the initial conditions. {15 points} Use appropriate assertions and prove them inductively. Please word-process or neatly write your answers. CSC 490 – Computer Science Senior Seminar I Professor Gary Locklair Written Homework Assignment #2 Fall 2006 Chapter 10 in The New Turing Omnibus – Program Correctness assignment: A. Using the same techniques outlined in the chapter, provide a proof that the “Euclid” algorithm terminates for all inputs satisfying the initial conditions. {15 points} Use appropriate assertions and prove them inductively. Please word-process or neatly write your answers.