-
-
-
-
Recursive function to compute the number of sequences of n binary digits.
How to Write a recursive function to compute the number of sequences of n binary digits that do not contain two 1s in a row. Write a main function to test this function. Input:Input consists of the number of binary digits in the sequence.Output:Output consists of the number of sequences of given binary digits that do not contain two 1s in a rowSample Input:Enter the number of binary digits in the sequence:5Sample...
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
string2: "def"
the occurrence of 'a' will be replaced by 'd' , 'b' will be replaced by 'e' , 'c' will be replaced by 'f'
AND for less complexity assume the string1 and string2 are of same size">Write a program to get strings and to substitute character from string1 to string2(equv to UNIX command tr)for example:string1: "abc"string2: "def"the occurrence of 'a' will be replaced by 'd' , 'b' will be replaced by 'e' , 'c' will be replaced by 'f'AND for less complexity assume the string1 and string2 are of same size
-
C Interview Questions
Ans