..

Discrete mathematics

 

  
Code:
 INEA00105
 Supervisor: Czesław Smutnicki, Prof.
   

 

 

Workload
(Hours / sem. (h))
LectureTutorialsLaboratoryProjectSeminar
30150150

 

 

 

Outcome:

Understanding of mathematical foundation for residual processors, cryptography, flows in the computer net, data processing, testing, optimal design of circuits and devices, analysis of algorithms.


Content:

Computational complexity. Combinatory. Numbers theory. Residual arithmetic. Cryptography. Graphs and algorithms. Differential calculus and discrete convolution. Recursive equations, generating functions. Linear programming. Polynomials and matrices. Hardware realization of discrete problems. Selected topics of discrete optimization.

 

Literature:


1. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to algorithms
2. K. H. Rosen, Discrete Mathematics and Its Applications