Mathematics for Computer Science

ID : 
Κ20α
Semester : 
6
K (new pps): 
A
E1: 
Y
Credit hours (lecture): 
4
Credit hours (discussion): 
1
Credit hours (lab): 
0
Track: 
Core Informatics and Telecommunications

Proof techniques, with emphasis on induction and existence proofs such as diagonalization, pigeonhole principle; probabilistic analysis and techniques; techniques for the design and analysis of algorithms; cryptography and number theory; recurrence relations; elements of graph theory.