u/berkaayin r/compsci • Recommends
On “Entertaining CS YouTube channels?”
Not really a channel but Shai Simonson's Discrete Mathematics course is a great source to understand the mechanics of CS.
link to this video
0:00 / 0:00
#discretemathematics#booleanalgebra#formallogic
Arsdigita 02 (Discrete Mathematics) Lecture 1/20
Coba Weel
3.6K subscribers • 1 video on Hallway
- Recommended by 6 people: 6 in engineering communities.
- Presented by Shai Simonson, Instructor at ArsDigita University
Beginner. No background in the topic needed.
340K views14 years ago6 recommendations
Computer scienceMath for programmersComputation and complexity
Shai Simonson introduces discrete mathematics, formal logic, and Boolean algebra in the first lecture of the ArsDigita University course.
Course 02: Discrete Mathematics (Arsdigita University) NOTE: I will delete off-topic comments, especially offensive ones related to the lecturer's religious or purportedly implied political beliefs, so please stop bothering already. This course covers the mathematical topics most directly related to computer science. Topics include: logic, relations, functions, basic set theory, countability and counting arguments, proof techniques, mathematical induction, graph theory, combinatorics, discrete probability, recursion, recurrence relations, and number theory. Emphasis is placed on providing a context for the application of the mathematics within computer science. Instructor: Shai Simonson Text: Discrete Mathematics and its Applications, Rosen. 01 What kinds of problems are solved in discrete math? 02 Boolean Algebra and formal logic 03 More logic: quantifiers and predicates 04 Sets 05 Diagonalization, functions and sums review 06 Basic arithmetic and geometric sums, closed forms. 07 Chinese rings puzzle 08 Solving recurrence equations 09 Solving recurrence equations (cont.) 10 Mathematical induction 11 Combinations and permutations 12 Counting Problems 13 Counting problems 14 Counting problems using combinations, distributions 15 Counting problems using combinations, distributions 16 The pigeonhole principle and examples. The inclusion/exclusion theorem and advanced examples. A combinatorial card trick. 17 Equivalence Relations and Partial Orders 18 Euclid's Algorithm 19 Recitation -- a combinatorial card trick 20 Cryptography More information about this course: archive.org/details/arsdigita_02_discrete_math aduni.org/courses/discrete Licensed under Creative Commons Attribution ShareAlike 2.0: aduni.org/FAQ/#redist1 creativecommons.org/licenses/by-sa/2.0/ ArsDigitaWhy it's here
6 people recommend thisWhat people say. Recommended as an excellent, highly engaging lecture series for learning discrete mathematics and the mathematical foundations of computer science.
u/LithiumToastin r/compsci • Recommends
On “What maths should I start studying?”
Discrete Math. Includes: Logic, relations, functions, basic set theory, countability and counting arguments, proof techniques, mathematical induction, graph theory, combinatorics, discrete probability, recursion, recurrence relations, and number theory. Free Lectures on YouTube
u/pmorrisonflin r/compsci • Recommends
On “What to do if you forgot math?”
I took a long, long break between undergrad and grad school (think decades). I found this GRE math prep book very helpful. (The GRE math section tests high school math knowledge), I'd take the sample tests, see where I fell short, and focus on understanding why. I also found Practical Algebra to be a good review-and-practice guide, for the fundamentals. I boned up on discrete math by buying an old copy of Rosen and the matching solutions guide. And, I watched a bunch of videos of this guy explaining various facets of the math you need for computer science.
u/barsoapin r/compsci • Recommends
On “I am almost top of the class in programming (C, C++) but I completely suck at discrete math and linear. How can I fix this?”
Discrete Maths, you say?
For linear algebra, I'd recommend applications: 3d graphics, linear programming. Once you've got something to use that stuff for, it makes much more sense.
u/barsoapin r/compsci • Recommends
On “Computer Science Major?”
Echoing /u/pridefulpropensity's math focus: Try discrete maths. From a CS perspective, ordinary mathematics is its protoscience (filthy formalists not distinguishing between computable and non-computable things).
As to Biology vs. Chemistry vs. Physics, you really can do any of those and combine them with CS. There's bioinformatics, there's ample of need for computation in all three of them. If you have an interest take either, for a CS focus I'd recommend biology. There's some *really* interesting computational processes going on in all of it.
What happens if you take a frog, cut out an elbow, then turn it around and connect it to lower and upper arm, again? Two new elbows grow for a to…
u/grandzoobyin r/compsci • Recommends
On “Good textbook for learning discrete math?”
This isn't a textbook, but you could look into this old course from Ars Digita University... it was an attempt to pack a CS degree into a year for people who already held a bachelor's degree.
I really enjoyed the videos for the Discrete Math course:
http://aduni.org/courses/discrete/
The videos are on youtube:
link to this video
and on google:
http://adunivids.neocities.org/
u/barsoapin r/compsci • Recommends
On “What's the best into book into Computer Science for absolute beginners?”
SICP (and no use the scheme, not python, version) is a good intro from the programming perspective: Neither too theoretical nor skimping on broad overview of the subject. You'll learn principles, and principles, and principles, making digging into details or other languages that much easier later on. There's also videos of lectures.
When it comes to the more mathy and theoretical side of things I'd recommend the Ardigita Discrete Mathematics lectures as starter. That's "maths as used by CS", "math the CS way" would be type theory. Also very worthwhile learning, but I wouldn't start out with it, same as math education doesn't start out with ZFC set theory axioms: Without some experience…
u/Mentioned_Videosin r/compsci • Recommends
On “Entertaining CS YouTube channels?”
Videos in this thread:
Watch Playlist ▶
VIDEO|COMMENT
-|-
(1) NMCS4ALL: Artificial Life (full version) (2) Lecture 1 Machine Learning (Stanford)|11 - These lectures were great, I learned a lot and I enjoyed listening to this guy talk. It's an MIT course on artificial intelligence. Also, anything you find by Erik Demaine is awesome, he's got stuff on MIT OCW as well, here's one I've been increme...
Creating a Doom-style 3D engine in C|6 - Bisqwit is a really weird but great channel to watch and he has his own strange style that I haven't seen anyone else do. Most of his videos boil down to watching a fast-paced replay of his code with a voice over telling you what he's do…
u/barsoapin r/compsci • Mentions
On “Compsci redditors, please help a programmer to understand the importance of studying the basis of computer science.”
A lot of people here are giving very good answers why it's important in an abstract sense. What I would recommend (hey, for the second time this week) is work through the Wizard Book.
It's not really a book on theoretical CS as such, but it's going to a) blow your mind more than a couple of times and thus b) viscerally tell you that there's a lot of stuff you don't know. You might want to push trough the first chapter(s) rather quickly as you're not a complete beginner, but don't ignore them completely, either.
If that doesn't convince you then you're a hopeless case :)
Generally, just expand a bit. For example, sit down in the evening and watch a lecture from the [ArsDigita Discrete Math…