Discrete Mathematics & Computing: A Set of Lectures

This Text Is A Semester Course In The Basic Mathematical And Theoretical Foundations Of Computer Science. Students Who Make Heavy Use Of Computing Should Learn These Foundations Well, Setting A Base For A Follow-on Course In Algorithms. A Solid Theoretical And Algorithmic Foundation In Computer Science Sets The Stage For Developing Good Programs, Programs That Work, Always And Efficiently.each Chapter Is A Lecture That Has Been Taught As Such. Part I Starts With Basic Logic, Proofs And Discrete Mathematics, Including: Induction, Recursion, Summation, Asymptotics And Number Theory. We Then Continue With Graphs, Counting And Combinatorics, And Wrap Up The Coverage Of Discrete Mathematics With Discrete Probability. Part Ii Presents The Blockbuster Application Of Discrete Mathematics: The Digital Computer And A Theory Of Computing. The Goal Is To Understand What A Computer Can And Cannot Do. We Start Small, With Automata, And End Big With Turing Machines.our Approach Is Socratic. The Reader Is Encouraged To Participate Actively In The Learning Process By Doing The Quizzes And Exercises That Are Liberally Sprinkled Through The Text. The Pace And Level Is Appropriate For Readers With One Year Of Training In Programming And Calculus (college Sophomores).