lecture 01 -- Inductive Sets of Data - annotated

lecture 01 -- Inductive Sets of Data - annotated -...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
10/10/2010 1 T. METIN SEZGIN SEPT 29 2010 Lecture 1 Recursive Procedures Lecture Overview Recursively specified data Inductive data specification Defining sets using grammars Induction Recursively specified programs Smaller sub-problem principle (wishful thinking) Examples Auxiliary procedures Why? Procedures Data
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
10/10/2010 2 Recursion Recursion is important Syntax in programming languages is nested Data definitions can be recursive Procedure definitions can be recursive Recursion example Inductive specification of a subset of natural numbers Which subset of N is this? Is 6 in S?
Background image of page 2
10/10/2010 3 Simple procedure for testing membership Write a procedure that follows the definition Remember the definition And the procedure Simple procedure for testing membership More about the procedure Contract Domain Co-Domain (range) Usage Argument
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 Alternative definition of S
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/13/2011 for the course ENGR 301 taught by Professor Raultekin during the Spring '10 term at Boğaziçi University.

Page1 / 14

lecture 01 -- Inductive Sets of Data - annotated -...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online