Thank you for registering.

One of our academic counsellors will contact you within 1 working day.

Please check your email for login details.
MY CART (5)

Use Coupon: CART20 and get 20% off on all online Study Material

ITEM
DETAILS
MRP
DISCOUNT
FINAL PRICE
Total Price: Rs.

There are no items in this cart.
Continue Shopping

An n- bit string is n- digit "word" , each digit of which is either 0 or 1. Find the no. of n- bit strings containing both the digit zero and one.

An n- bit string is n- digit "word" , each digit of which is either 0 or 1.


Find the no. of n- bit strings containing both the digit zero and one.

Grade:12

1 Answers

Badiuddin askIITians.ismu Expert
147 Points
11 years ago

Dear Sanchit

Each position of n digit string can be filled by 2 ways either 0 or 1

so total number os such word is 

     =2*2*2*2*2 .......n times

      =2n

 but it include that case also which has 0 at all position and 1 at all position

So total number of desired way =2n-2


Please feel free to post as many doubts on our discussion forum as you can.
 If you find any question Difficult to understand - post it here and we will get you the answer and detailed solution very quickly.
 We are all IITians and here to help you in your IIT JEE  & AIEEE preparation.

 All the best.
 
Regards,
Askiitians Experts
Badiuddin


Think You Can Provide A Better Answer ?

Provide a better Answer & Earn Cool Goodies See our forum point policy

ASK QUESTION

Get your questions answered by the expert for free