Ad:

C++ Discussion Thread
Unsolved
Views: 1150

Sep 17th, 2006

Algorithm doubt

Expand Post »

Hi can anyone help me in doing the following

Given n Boolean variables x1,x2,…..xn, we wish to print all possible combinations of truth values they can assume. For instance, if n=2, there are four possibilities : true, true; false, false; false, true; true, false;:-|

Similar Threads

Eigenface Algorithm in Computer Science
round robin algorithm in Computer Science
Selling text links, harm your ranking? in Advertising Sales Strategies
Round Robin Algorithm Simulation in C++
Algorithm for checking contiguous blocks in C

Karthi Msc

Reputation Points: 14

Solved Threads: 0

Newbie Poster

Offline

2 posts
since Sep 2006

Permalink

Sep 17th, 2006

Re: Algorithm doubt

Simple. Just use nested for loops.

C++ Syntax (Toggle Plain Text)
 bool x1[2] = {true, false}
bool x2[2] = {true, false}
for ( i = 0 ; i < 1; i++ )
          for ( j = 0 ; j < 1; j++ )
                  print x1[i], x2[j];
 bool x1[2] = {true, false}
bool x2[2] = {true, false}
for ( i = 0 ; i < 1; i++ )
          for ( j = 0 ; j < 1; j++ )
                  print x1[i], x2[j];

will print the answer for two variables. Expand it for n variables.

WolfPack

Moderator

Reputation Points: 572

Solved Threads: 115

Mentally Challenged Mod.

Offline

1,559 posts
since Jun 2005

Permalink

Sep 17th, 2006

Re: Algorithm doubt

Maybe something like this which will implement a basic AND logic will help you understand the thing better:

C++ Syntax (Toggle Plain Text)
int main ()
{
    bool first [] = {true, false} ;
    bool second [] = {true, false} ;
 
    for (int i = 0; i < 2; ++i) {
        for (int j = 0; j < 2; ++j) {
            cout << boolalpha << first [i] << "  AND  " << second [j] << "  =>  " << (first[i] && second [j]) ;
            cout << endl ;
        }
    }
    return 0 ;
}
int main ()
{
    bool first [] = {true, false} ;
    bool second [] = {true, false} ;

    for (int i = 0; i < 2; ++i) {
        for (int j = 0; j < 2; ++j) {
            cout << boolalpha << first [i] << "  AND  " << second [j] << "  =>  " << (first[i] && second [j]) ;
            cout << endl ;
        }
    }
    return 0 ;
}

Hope it helped, bye.

~s.o.s~

Super Moderator

Featured Poster

Reputation Points: 3241

Solved Threads: 719

Failure as a human

Offline

8,873 posts
since Jun 2006

Permalink

Sep 17th, 2006

Re: Algorithm doubt

for ( i = 0 ; i < 1<<N ; i++ )
Just print out the binary representation of i to N bits of precision.
Easy money.

Salem

Team Colleague

Reputation Points: 5862

Solved Threads: 950

Posting Sage

Offline

7,164 posts
since Dec 2005

This thread is more than three months old

No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.

Previous Thread in C++ Forum Timeline: Help with the execution of this program

Next Thread in C++ Forum Timeline: Determine if a certain ivalue is in a string

DaniWeb Message

Cancel Changes

User Name
Password