COT 3100 Spring 2010-Midterm2_practice

COT 3100 Spring 2010-Midterm2_practice -...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Name:__________________________________________________ UFID:___________________________ _ 1 COT 3100 Spring 2010 Practice for Midterm 2 For the first two questions #1 and #2, do ONLY ONE of them. If you do both, only question #1 will be graded. 1. (20 pts) Give iterative and recursive algorithms for reversing a bit string. 2. (20 pts) Give iterative and recursive algorithms for calculating the term of the sequence * + where . Which algorithm is more efficient and why? Name:__________________________________________________ UFID:___________________________ _ 2 3. (10 pts.) Use mathematical induction to show that ( ) , whenever n is a positive integer. 4. (20 pts) Let . Use induction to show that a) for . Name:__________________________________________________...
View Full Document

Page1 / 6

COT 3100 Spring 2010-Midterm2_practice -...

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

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