Like Tree1Likes
  • 1 Post By Elkvis

What topics to cover in a 15 min presentation on recursion?

This is a discussion on What topics to cover in a 15 min presentation on recursion? within the Tech Board forums, part of the Community Boards category; So far, I've chalked out the following: 1.Definition (with the factorial or euclid's algorithm example) 2.Self referential structures. 3.Show intuitively ...

  1. #1
    Registered User manasij7479's Avatar
    Join Date
    Feb 2011
    Location
    Kolkata@India
    Posts
    2,498

    What topics to cover in a 15 min presentation on recursion?

    So far, I've chalked out the following:
    1.Definition (with the factorial or euclid's algorithm example)
    2.Self referential structures.
    3.Show intuitively that recursion is equivalent to iteration.
    4.General approach of Divide and Conquer algorithms.
    5.Show how the stack is used in recursion.
    6.Performance, tail recursion..etc.

    Which among the above do you think should be left out, given the time constrain?
    Anything important I missed?
    Manasij Mukherjee | gcc-4.8.2 @Arch Linux
    Slow and Steady wins the race... if and only if :
    1.None of the other participants are fast and steady.
    2.The fast and unsteady suddenly falls asleep while running !



  2. #2
    Registered User
    Join Date
    Oct 2006
    Posts
    2,266
    don't forget #7: recursion
    manasij7479 likes this.

  3. #3
    Registered User whiteflags's Avatar
    Join Date
    Apr 2006
    Location
    United States
    Posts
    7,625
    I think 1, 3, and 5 are a well rounded presentation; only tack on more points for time. I have never considered self-referential structures to be an example of recursion. Also, ending the presentation threatening to start it again would probably be good humor.

  4. #4
    Master Apprentice phantomotap's Avatar
    Join Date
    Jan 2008
    Posts
    4,147
    Self referential structures.
    O_o

    Recursion is a form of repeating a process; data structures are not processes.

    I know what you are getting at of course; I'm just saying that you need to keep focus on the process.

    Soma

  5. #5
    C++ Witch laserlight's Avatar
    Join Date
    Oct 2003
    Location
    Singapore
    Posts
    21,313
    Who will be your audience and what is the purpose of this presentation?
    C + C++ Compiler: MinGW port of GCC
    Version Control System: Bazaar

    Look up a C++ Reference and learn How To Ask Questions The Smart Way

  6. #6
    Registered User manasij7479's Avatar
    Join Date
    Feb 2011
    Location
    Kolkata@India
    Posts
    2,498
    Quote Originally Posted by laserlight View Post
    Who will be your audience and what is the purpose of this presentation?
    Classmates and a few teachers.
    It is a compulsory part of the semester exams.
    Manasij Mukherjee | gcc-4.8.2 @Arch Linux
    Slow and Steady wins the race... if and only if :
    1.None of the other participants are fast and steady.
    2.The fast and unsteady suddenly falls asleep while running !



  7. #7
    Internet Superhero
    Join Date
    Sep 2006
    Location
    Denmark
    Posts
    964
    You'll have less than 3 minutes for each of those topics, are you sure you can fit all that in such a small time-frame? I'd say you should cut off some of the less important parts, understanding D&Q isn't necessary for understanding recursion, same goes for self-referential structures.

    You could mention how to determine the computational cost using recurrence relations, this probably fits under your #6.
    How I need a drink, alcoholic in nature, after the heavy lectures involving quantum mechanics.

  8. #8
    Registered User manasij7479's Avatar
    Join Date
    Feb 2011
    Location
    Kolkata@India
    Posts
    2,498
    Quote Originally Posted by Neo1 View Post
    You'll have less than 3 minutes for each of those topics, are you sure you can fit all that in such a small time-frame? I'd say you should cut off some of the less important parts, understanding D&Q isn't necessary for understanding recursion, same goes for self-referential structures.
    Hmm, I'll just leave those points by mentioning a few examples.
    You could mention how to determine the computational cost using recurrence relations, this probably fits under your #6.
    Good idea.
    Though I have to make it quick and simplified enough for non-mathematically-oriented people to grasp.
    (I read the chapter on Master theorem in the Cormen book a few days ago, and it sure is a bit whacky)
    Manasij Mukherjee | gcc-4.8.2 @Arch Linux
    Slow and Steady wins the race... if and only if :
    1.None of the other participants are fast and steady.
    2.The fast and unsteady suddenly falls asleep while running !



Popular pages Recent additions subscribe to a feed

Similar Threads

  1. ebook cover design poll
    By webmaster in forum General Discussions
    Replies: 2
    Last Post: 02-28-2012, 01:12 PM
  2. Don't Take Cover under a Table during an Earthquake?
    By alphaoide in forum A Brief History of Cprogramming.com
    Replies: 30
    Last Post: 08-07-2008, 01:29 AM
  3. GPL license: how does it cover the output of a program?
    By psychopath in forum A Brief History of Cprogramming.com
    Replies: 16
    Last Post: 05-25-2006, 01:37 AM
  4. Resizing an Image to Cover Top
    By Speedy5 in forum A Brief History of Cprogramming.com
    Replies: 0
    Last Post: 06-11-2003, 01:34 PM
  5. malloc & cover function
    By Max in forum C Programming
    Replies: 4
    Last Post: 10-04-2002, 08:51 AM

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21