|Theory of Automata-II||Hours: 3 0 3|
“Turing machines, decision problems, halting problems, NP-completeness (NP, NP-complete, NP-hard), Godel numbers, and advanced computability topics.
|Pre-requisites: none||Co-requisites: none|
Hours: XYZ where X = Lecture, Y = Lab, Z = Credit
All hours are per week.
3 Lab hours constitute 1 credit hour
1 credit hour implies 1 lecture of 50mins per academic week. 16 weeks in total.
Pre-Requisite courses are courses required to be completed before this course may be taken
Co-Requisite courses are courses required to be taken along with this course