Find out next state (NS) of T Flip-Flop based on previous state (PS), inputs.
Learn more about T Flip-Flop theory here: T Flip-Flop.
Ps=0, T=1, NS will be 1
Ps=1, T=1, NS will be 0
Ps=0, T=0, NS will be 0
Ps=1, T=0, NS will be 1
Implement simple rotation cypher
sum of non-primes
Replace multiples of 5 with NaN
Maximum value in a matrix
Compute LOG(1+X) in natural log
Check that number is whole number
Add one raw in given matrix as shown in example
Try and Catch Simple Example
Find out characteristics equation of given matrix.
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office