Re: trees?

  • From: "black ares" <matematicianu2003@xxxxxxxxxxx>
  • To: <programmingblind@xxxxxxxxxxxxx>
  • Date: Thu, 21 Oct 2010 21:13:55 +0300

this is yet another individual representing the class of stupid professors.
Please, for the N-queens problem
read about backtracking and you will get the point.
If you read about recursive back tracking you will even get the point regarding the tree representation of this problem. 
How ever, the backtracking programing algorithm
is a static one, by static I mean, that
it has a fixed form where you only change data and a little operation and from a problem you get another. For example if you have a solution for another problem in backtracking, you can simply change somthing little there and you will get the n-queens problem. The recursive backtracking is easier to understand than iterative one, but this is just my point of view. So your problem now is not to understand what a tree is, or how this problem is represented on a tree, now your problem is to learn about back tracking and how to solve that problems. Sighted professors often tend to graphicaly represent all the things even they didn't need to! And also often the graphical representation is most disturbing than explaining. When you will realy need a tree like a abstract data structure, you will understand it very well.
----- Original Message ----- From: "Ken Perry" <whistler@xxxxxxxxxxxxx> 
To: <programmingblind@xxxxxxxxxxxxx>
Sent: Wednesday, October 20, 2010 7:46 PM
Subject: RE: trees?
You know how I did it in my software engineering class before I did the file and outline? I wrote an asm black white tree and followed it in a debugger. 
Hmm is that a little nuts?

Ken

-----Original Message-----
From: programmingblind-bounce@xxxxxxxxxxxxx
[mailto:programmingblind-bounce@xxxxxxxxxxxxx] On Behalf Of Sina Bahram
Sent: Wednesday, October 20, 2010 11:42 AM
To: programmingblind@xxxxxxxxxxxxx
Subject: RE: trees?
I think that you should sit down with either her or someone else who fully 
understands the concept, and concentrate on
understanding how trees work, rather than being hung up on the
representation.

I'll volunteer to offer some info over skype or phone, and there should be
some good websites on this, but concepts like this need
to be explained in person/voice, not just by reading about them, although
you can get a lot that way too.

Take care,
Sina

-----Original Message-----
From: programmingblind-bounce@xxxxxxxxxxxxx
[mailto:programmingblind-bounce@xxxxxxxxxxxxx] On Behalf Of Alex Hall
Sent: Wednesday, October 20, 2010 10:33 AM
To: programmingblind
Subject: trees?

Hi all,
We are doing trees in an algorithms class I am taking. The assignment coming 
up is the "n queens" problem, where you have an n by n
board and must place n queens on the board such that no two queens share the 
same row, column, or diagonal line. To "help" explain
this, the professor is using a tree on the board. I am completely confused! 
She says I do not need to think of it in terms of trees,
yet the only way she explains it is in tree terms, so I am not sure what she 
is talking about. Of course I know about trees, but
when she tries to explain how the code we are looking at relates to the tree 
in terms of what the code is supposed to do, I haven't
a clue as to what she is trying to say. Does anyone have any thoughts on how 
to represent trees, whether in braille or speech, or a
good notation/substitute for a tree? TIA.

--
Have a great day,
Alex (msg sent from GMail website)
mehgcap@xxxxxxxxx; http://www.facebook.com/mehgcap __________ View the
list's information and change your settings at
//www.freelists.org/list/programmingblind

__________
View the list's information and change your settings at
//www.freelists.org/list/programmingblind

__________
View the list's information and change your settings at
//www.freelists.org/list/programmingblind



__________
View the list's information and change your settings at //www.freelists.org/list/programmingblind

Other related posts:

  1. Home
  2. programmingblind
  3. Archive
  4. 10-2010