03-31-2011
Binary means two choices; as in left-right, up-down, yes-no, ...
One real-life application is the game '20 questions'. Twenty questions are asked and by the end, there should be a guess (perhaps correct) of the answer.
For instance, guess the state in US:
1) Is the name one word -- NO
2) Does the state border an ocean -- YES
3) Is it an original 13 state -- YES
Without continuing, the answer is -- Rhode Island.
Thus, questions need to be decided, and a matching file created that maps out the YES/NO answers.
Does that make sense?
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
I almost have the entire script written. however the problem is how would i assign the global variable to terminate the process from the bottom up to ensure the child terminates so the parent can.
ex. I am proccess 1
I am proccess 2
etc
Here is the code
$ cat tree.c
... (3 Replies)
Discussion started by: slurpeyatari
3 Replies
2. Solaris
Hi,
I have two Solaris machines.
1. SunOS X 5.8 Generic_108528-29 sun4u sparc SUNW,Sun-Blade-1500
2. SunOS Y 5.8 Generic_108528-13 sun4u sparc SUNW,Ultra-60
I am trying to buiild a project on both these machines. The Binary output file compiled on machine 2 runs on both the machines. Where... (0 Replies)
Discussion started by: scgupta
0 Replies
3. Shell Programming and Scripting
I need to create a binary tree like structure of directories using shell script... does anyone know of any algorithm for this ?
i tried doing a recursive algorithm
function CreateDir
{
level=$1
dirname=$2
mkdir $dirname/sub1/
mkdir $dirname/sub2/
let level=level-1
... (2 Replies)
Discussion started by: macvijay1985
2 Replies
4. UNIX for Dummies Questions & Answers
Hi,
I am working on a program and kind of a stuck,nt getting it done.
"The program should take one command line arguments: number of hierarchy level. The
hierarchy of your program should of that level and each node have two child processes."
Can anyone give me the C code using fork() of this... (1 Reply)
Discussion started by: learneros
1 Replies
5. Shell Programming and Scripting
Hi all,
The following is a script for displaying directory tree.
D=${1:-`pwd`}
(cd $D; pwd)
find $D -type d -print | sort |
sed -e "s,^$D,,"\
-e "/^$/d"\
-e "s,*/\(*\)$,\:-----\1,"\
-e "s,*/,: ,g" | more
exit 0
I am trying to understand the above script.But... (3 Replies)
Discussion started by: ravi raj kumar
3 Replies
6. Shell Programming and Scripting
how to draw a process tree if i know my process id
and how can i identify session leaders (1 Reply)
Discussion started by: annapurna konga
1 Replies
7. Programming
I am writing code for a binary search tree search and when I compile it i am getting strange errors such as, " /tmp/ccJ4X8Xu.o: In function `btree::btree()':
project1.cpp:(.text+0x0): multiple definition of `btree::btree()' "
What does that mean exactly?
tree.h
#ifndef TREE_H
#define... (1 Reply)
Discussion started by: meredith1990
1 Replies
8. Shell Programming and Scripting
Hello *nix specialists,
Im working for a non profit organisation in Germany to transport DSL over WLAN to people in areas without no DSL. We are using Linksys WRT 54 router with DD-WRT firmware There are at the moment over 180 router running but we have to change some settings next time. So my... (7 Replies)
Discussion started by: digidax
7 Replies
9. Programming
I have some questions about certain placement of child nodes since I'm just learning BSTs and it's quite confusing even after reading some sources and doing some online insertion applets. Let's say I want to add nodes 5,7,3,4 to an empty basic BST.
... (1 Reply)
Discussion started by: Jill Ceke
1 Replies
10. Web Development
Database Structure
Root Table
ID Root_ Node Level
1 A 0
2 B 1
3 C 1
Child Table
ID Left_Node Right_Node Root_Node Root_ID
1 B C A 1
... (1 Reply)
Discussion started by: Deepak Tiwari
1 Replies
LEARN ABOUT DEBIAN
tm::tree
TM::Tree(3pm) User Contributed Perl Documentation TM::Tree(3pm)
NAME
TM::Tree - Topic Maps, trait for induced tree retrieval
SYNOPSIS
use TM::Materialized::AsTMa;
my $tm = new TM::Materialized::AsTMa (file => 'old_testament.atm');
Class::Trait->apply ( $tm => 'TM::Tree' );
$tm->sync_in;
# old-testament pedigree
print Dumper $tm->tree (lid => 'adam',
type => 'has-parent',
arole => 'parent',
brole => 'child' );
# new-testament inverse pedigree
print Dumper $tm->tree (lid => 'gw-bush',
type => 'has-parent',
arole => 'child',
brole => 'parent' );
DESCRIPTION
Obviously, topic maps can carry information which is tree structured. A family pedigree is a typical example of it; associations having a
particular type, particular roles and you can derive a tree structure from that.
This is exactly what this operator does: it takes one topic map basis and primed with a starting node, an association type and two roles a
tree will be returned to the caller.
INTERFACE
Methods
tree
$treeref = $tm->tree (
$start_topic,
$type_topic,
$role_topic,
$role_topic,
[ depth => $integer ])
$treeref = $tm->tree_x (
$start_topic,
$type_topic,
$role_topic,
$role_topic,
[ depth => $integer ])
This function will analyze the topic map and will detect all maplets of the given type (direct and indirect ones) having the specified
roles. Starting from the start topic it will so find other topics playing the brole. Those will be used as a next starting point, and
so forth.
To avoid the tree to become too big, you can impose an optional limit. Loops are detected.
Every output tree node contains following fields:
"lid":
the lid of the node
"children":
a list reference of child nodes, there is no specific sort order
"children*":
Note: This is currently deactivated.
for convenience this list reference contains all children, grand-children, grand-grand children.... of this node (this list is
neither sorted nor unique out of performance considerations).
The version "tree_x" does not honor subclassing of roles and type (but "tree" does). This means that is can be considerably faster,
especially if you use it for taxonomy stuff with "isa" and "is-subclass-of".
taxonomy
$treeref = $tm->taxonomy ([ $start_lid ])
This function is a specialization of "tree", in that it looks at a particular association type ("is-subclass-of") and the appropriate
roles ("superclass", "subclass"). Obviously the result is a tree holding all subtypes.
The only optional parameter is a toplet "lid"; that becomes the starting point of the tree. If that parameter is missing, "thing" is
assumed.
SEE ALSO
TM
COPYRIGHT AND LICENSE
Copyright 200[3-6] by Robert Barta, <drrho@cpan.org>
This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself.
perl v5.10.1 2010-02-15 TM::Tree(3pm)