human
Binomial Coefficient | DP | Python program for Optimized Dynamic Programming solution to Binomail Coefficient . This one uses the concept of pascal Triangle and less memory.
since nC0 is 1.
Compute next row of pascal triangle using the previous row.
Driver Code"
Solution in Python:

=====
Give me a code to binomial Coefficient and the other steps required?
assistant
#Here is code to binomial Coefficient and the other steps required.
 def binomialCoeff ( n , k ) :
	C = [ 0 for i in xrange ( k + 1 ) ]
	C [ 0 ] = 1
	for i in range ( 1 , n + 1 ) :
		j = min ( i , k )
		while ( j > 0 ) :
			C [ j ] = C [ j ] + C [ j - 1 ]
			j -= 1
	return C [ k ]
n = 5
k = 2
print " Value ▁ of ▁ C ( % d , % d ) ▁ is ▁ % d " % ( n , k , binomialCoeff ( n , k ) )