Discrete structures class notes and videos. ) CS173: Discrete Structures Fall 2013 Madhusudan Parthasarathy Lecture Schedule This outline shows what was/will be covered in each lecture, as well as exam dates and similar information. ppt file) Chapter 5: Probability (. Later courses in the computer science curriculum build on the mathematical foundations covered here. ) These notes cover topics in discrete mathematics at a standard undergraduate level. Discrete mathematical structures include objects with distinct values, like graphs, integers, logic-based statements, etc. Apr 24, 2021 · These notes are constantly updated by the author. Discrete probability theory. Ensure that you are registered for the course: CSE191: Discrete Structures Submit a pdf to Homework 0 with the following information: Cultivate a sense of familiarity and ease in working with mathematical notation and common concepts in discrete mathematics. CSE 2315 - Discrete Structures Lecture 1- Fall 2019 Course Details (see also Syllabus) Prerequisites: This course covers many of the theoretical foundations of computer science and provides the basis for many of the later courses (including CSE 3315). I prefer fast pace and normally Professor Dave is my go to but he doesn’t do discrete math. It’s only a one-semester course, so there are a lot of topics that it doesn’t cover or doesn’t cover in much depth. It is recommended to use Kenneth If you dont know how to do something, dont panic, you're learning it's normal to struggle! Join the class discord if there is one and make a few class buds you can study with. You past semesters If Autolab says that you already have an account, click \For-got your password?" and enter your email address. edu This course expects students to attempt the assigned readings before lecture. Follow instructions to reset your password. The video at https:// www. Use multiple colors of pens in your notes and actually refer back to them. Leans in on more of a mathematics course than a CS one. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting Discrete Mathematics is the study of mathematical data structures that are discrete rather than continuous, meaning they consist of distinct and separate values rather than forming a continuum (like in calculus, which involves continuous functions and real numbers. Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, having a one-to-one correspondence with the set of natural This subject offers an interactive introduction to discrete mathematics oriented toward computer science and engineering. ppt file) Chapter 8: Graphs (. ) A one-semester course on Discrete Math taught by Dr. It is also a fascinating subject in itself. To denote membership we use the ∈ symbol, as in 4 ∈ {2, 4, 17, 23}. ppt file) Chapter 2 (. I recommend the textbooks below for further reading; these notes are primarily based on them: Discrete Mathematics with Applications by Epp Building Blocks for Theoretical Computer Science Discrete mathematics is the study of mathematical structures that are countable or are discrete in nature. Students may read over the class notes prior to attending lecture, but it may deviate from the notes somewhat. . See full list on web. This notice includes the date of latest update to this le. It emphasizes mathematical definitions and proofs as well as applicable methods. They do not assume familiarity with anything beyond elementary algebra. CS 205 – Introduction to Discrete Structures I Course Description This course introduces student to the mathematical tools of logic and induction, and to the basic definitions and theorems concerning relations, functions, and sets. For example, the set {2, 4, 17, 23} is the same as the set {17, 4, 23, 2}. com/ watch?v=q4L-wUF3yig defines Discrete Structures in one way: There will be frequent short quizzes (which require little preparation beyond following the lecture) and 4 or 5 longer quizzes. Fundamental concepts of mathematics: Definitions, proofs, sets, functions, relations. Jul 17, 2025 · Introduction This is a course on discrete mathematics as used in Computer Science. If you have not obtained this le from the author’s website, it may be out of date. On the other hand, non-membership is denoted as in 5 6∈ {2, 4, 17, 23}. Discrete structures: graphs, state machines, modular arithmetic, counting. To explore these concepts in detail, we begin with the following core topics. (A linked list is either the null list, or is a node n whose next-pointer points to a linked list. They use a lot of symbols and ideas so write them down and define them in terms you understand. The course covers set theory, combinatorics, recurrence relations, graph theory and group theory Judith Gerstring's book is a perfect introduction to the course for beginners. But the hope is that this will give you a foundation of skills that you can build on as you need to, and particularly to give you a bit of mathematical maturity—the basic understanding of Extensive class notes are also available from the Fall 2017 section of this course. On completion of 6. ppt file) Summary 1 Summary 2 Summary 3 back to CMSC203/0101 Fall 2003 home page A set can be defined by simply listing its members inside curly braces. In this course, we will deal with various types of Discrete mathematics forms the mathematical foundation of computer and information science. Over the course of the quarter, you’ll see some of the most impressive – and intellectually beautiful – mathematical results of the last 150 years. 💡 Embark on an illuminating journey through Discrete Structures and Optimization with our captivating YouTube lecture series, meticulously crafted for UGC NET Computer Science enthusiasts! 🚀 Sep 1, 2025 · Discrete Mathematics is a branch of mathematics that is concerned with "discrete" mathematical structures instead of "continuous" ones. from lecture notes, I taught in of these notes The problems exams. by Kimberly Brehm • Playlist • 80 videos • 5,923,139 views Textbook: Rosen, Discrete Mathematics and Its Applications, 7eTextbook: Rosen, Discrete Mathematics and Its Applications, 7e Play Can you list them?) Discrete Mathematics is the study of mathematical data structures that are discrete rather than continuous, meaning they consist of distinct and separate values rather than forming a continuum (like in calculus, which involves continuous functions and real numbers. Before each lecture, you are expected to do the reading assignment from the textbook. So we have a relatively short amount of lecture (75min per week) which concentrates on concepts that are harder to understand. 042J This course covers elementary discrete mathematics for computer science and engineering. 2. The lecture page for a recent offering shows the sequence of topics, along with our covid-lockdown lecture videos and written-up lecture notes. If you are using these notes for a course, I would be very pleased to hear from you, in order to document for my University the impact of this work. Either that or an online course. ppt file) Chapter 1 part 2 (. Chapter 1 part 1 (. ppt file) Chapter 7: Relations (. 3. youtube. Trefor Bazett Covers: Logical Statements, Logical Operations, Truth Tables, Sets, Functions, Relations, If Autolab says that you already have an account, click \For-got your password?" and enter your email address. Discrete Structures for Computer Science Overview Underlying mathematical rules that govern algorithm design and data structures. It is still tentative and based on what happened last term. The weightage for the different components will be announced later. Learners will become f This class is an introduction to discrete mathematics (mathematical logic, proofs, and discrete structures such as sets, functions, and graphs), computability theory, and complexity theory. Lecture videos will be regularly posted, and the students are expected to watch them within a week of posting. The subject coverage divides roughly into thirds: 1. Ensure that you are registered for the course: CSE191: Discrete Structures Submit a pdf to Homework 0 with the following information: Discrete structures in computer science of unbounded (but finite) size can be defined using recursion. ppt file) Chapter 3 (. ppt file) Chapter 4 (. stanford. Propositional Logic, Proofs, Boolean Algebra, Circuit Reductions, Set theory, Combinatorics, & probability all rolled up in one set of videos. ppt file) Chapter 6 (. Good discrete math videos If someone could recommend some good discrete math videos I would really appreciate it. The notes are based on a section of Discrete Structures (MATH 2710) which I taught spring 2001 (this class is not longer on the books through the ETSU Department of Mathematics and Statistics). 8wr1m iqwxky hhsw xu kbx dy6es tss9 egejvf513 u2uu9y vr