Course Description :
Propositional Logic, Predicates and Quantifiers, Logical Inference, Normal Forms, Sets, Relations, Graphs, Trees, Closure of Relations, Functions, Permutations and Combination, Recurrence Relations, Algebras, Finite State Automaton and Lattices.
Other Resources :
Syllabus | Citation |
Other Computer Science Courses
- XML Foundations By: UC Berkeley
- COMP1917 - Higher Computing By: The University of New South Wales
- Operating Systems and System Programming, Spring 2010 By: UC Berkeley
- Computer Organization By: IIT Madras
- Multimedia in Design Presentation By: The University of New South Wales
- Computer Networks By: IIT Kharagpur
- CSE 8B - Introduction to Computer Science: Java By: UC San Diego
- Structure and Interpretation of Computer Programs By: MIT OCW
- The Structure and Interpretation of Computer Programs, Fall 2009 By: UC Berkeley
- Digital Systems Design By: IIT Kharagpur
Comments
Thank you very nice lectures.I watched lecture 37 and 38 Finite State Automata I and II and they were very helpful.
everything is very helpful for curious student.
but LECTURE NO. 09,11,12,13 are unavailable.
my request is just to add this lecture in the series.
THANK YOU.