Discrete Mathematics is the basis and foundation of computer sciece
For example, cryptography is based on number theory

A LOT OF THINGS IN COMPUTER SCIENCE ARE RELATED TO DISCRETE MATHEMATICS AND I THINK THAT COMPUTER SCIENCE STUDENTS IN NITERIA STRUGGLE WITH RESEARCH BECAUSE THEY DO NOT UNDERSTAND THIS FACT AND/OR THEIR KNOWLEDGE OF DISCRETE MATHEMATICS IS SUSPECT

The topics to include are:
Discrete Mathematics

Propositional and predicate logic
Boolean algebra
Functions growth of functions big-O notation
Sequences and summations
Integers elementary number theory
Proof techniques direct indirect contradiction induction
Matrices
Counting
Pigeon hole principle
Permutations and combinations
Discrete probability
Recursive definitions recurrence relations
Relations : properties applications representation closures equivalence
Graphs : terminology representation isomorphism connectivity paths

Computer Science Topics

Computers and Computation
Computer System Organization
Abstraction problem solving algorithms
Logic gates and elementary circuits
Algorithm design analysis of simple loops
Representation (ASCII binary two’s complement floating point instructions
Algorithm correctness loop invariants pre-and post-conditions
Machine cycle
More algorithm correctness
Analysis of nested loops
Analysis of recursive algorithms
Run time organization run time stack
Searching and sorting
Trees binary search trees traversals

A LOT OF THINGS IN COMPUTER SCIENCE ARE RELATED TO DISCRETE MATHEMATICS AND I THINK THAT COMPUTER SCIENCE STUDENTS IN NITERIA STRUGGLE WITH RESEARCH BECAUSE THEY DO NOT UNDERSTAND THIS FACT AND/OR THEIR KNOWLEDGE OF DISCRETE MATHEMATICS IS SUSPECT

Absolutely! A solid understanding of discrete mathematics is essential if one wants to be a "real" problem solver/software developer.