The title of the course CS402 is Theory Of Automata. The course level is Undergraduate, and Credit hours for theory are 3. No prerequisites have been defined for this course.
CS402 Course Outline
This is an introduction to the theory of automata. Formal Language and Automata is a notion that is introduced to the students. Recursive definitions of languages, regular grammar, regular expression, context-free grammar, and language are all covered by formal languages.
Students study pushdown automata, transition graphs, and finite automata (deterministic and non-deterministic) (deterministic; non-deterministic). They also study the fundamental ideas behind Moore, Mealy, and Turing machines.
CS402 Handouts
CS402 handouts are available on the link CS402 Handouts
CS402 Past Papers
CS402 Midterm Past Papers
CS402 midterm past papers are available on CS402 Midterm Past Papers
CS402 Final Term Past Papers
CS402 final term past papers are available on CS402 Final Term Past Papers
CS402 Assignments & Solutions
CS402 Assignment 1 Solution
CS402 assignment 1 solution will be available soon.
CS402 Assignment 2 Solution
CS402 assignment 2 solutions will be available soon.
Telegram Link
Join us for more updates: Telegram Link
You can also view other handouts too:
- MCM101 Handouts
- BIF602 Handouts
- MCM301 Handouts
- MGT711 Handouts
- BIF401 Handouts
- ACC311 Handouts
- ACC501 Handouts
- BIO301 Handouts
- CS101 Handouts
- CS201 Handouts
- CS301 Handouts
- CS302 Handouts
- CS304 Handouts
- CS401 Handouts
Apart from handouts, you can also view past papers here: