Plese Can Somebody Solve This Boolean Question

Discussion in 'General Computer Support' started by adilef2213, Nov 1, 2009.

  1. adilef2213

    adilef2213

    Joined:
    Nov 1, 2009
    Messages:
    1
    Likes Received:
    0
    Hi
    I really need your help to solve this question:

    For the following questions assume that X is a binary number of length N and write relevant answers as Boolean expressions of the bits of X.
    9) How would you efficiently work out if X had the same number of 0 to 1 transitions as 1 to 0 transitions? E.g. 1101 has one 1->0 transition and one 0->1 transition hence the answer in this case would be true.
    10) How would you work out if X was of the form 1*0*, i.e. any number of 1s followed by any number of 0s?
    11) How would you work out if the number had no isolated 0s. E.g. 11001 has no isolated 0s, 1011 does, 01100 also does? How many binary numbers of length N have no isolated 0s?

    plz if you have any idea how to aaproach then plz let me know
    i am looking forward to hear you
     
    adilef2213, Nov 1, 2009
    #1
    1. Advertisements

Ask a Question

Want to reply to this thread or ask your own question?

You'll need to choose a username for the site, which only take a couple of moments (here). After that, you can post your question and our members will help you out.