Discrete Mathematical Structure(Crash Course) 3rd Semester
·Make use of propositional and predicate logic in knowledge representation and truthverification.
·Demonstrate the application of discrete structures in different fields of computerscience.
· Solve problems using recurrence relations and generatingfunctions.
· Apply different mathematical proofs, techniques in provingtheorems.
· First, through this course students can develop their mathematical maturity: that is their ability understand and create mathematical arguments.
· Second, discrete mathematics is the gateway to more advanced courses in all parts of the mathematical sciences.
· Discrete mathematics provides the mathematical foundations for many computer science courses including data structures, algorithms, database theory, automata theory, formal languages, compiler theory, computer security, and operating systems.
· Students find these courses much more difficult when they have not had the appropriate mathematical foundations from discrete math.
· A key reason for the growth in the importance of discrete mathematics is that information is stored and manipulated by computing machines in a discrete fashion.