Basket of No Specialization Electives (for VII, VIII Semesters) BCA7EJ401(1) - Theory of Computation Course Outcomes (CO): Page 159 of 241 Programme BCA Course Code BCA7EJ401(1) Course Title Theory of Computation Type of Course Elective Semester VII Academic Level 400-499 Course Details Credit Lecture per week Tutorial per week Practical per week Total Hours 4 4 - - 60 Pre-requisites 1. Understanding of basic mathematical concepts such as sets, functions, relations, logic and discrete structures. 2. Understanding of fundamental programming constructs such as loops, conditionals, functions, and recursion.
Course Summary This course covers a comprehensive exploration of fundamental concepts in computer science, delving into computational models, formal language theory, and computational complexity. Students learn about various computational models such as finite automata, pushdown automata, and Turing machines, gaining insights into their capabilities and limitations. Through the study of formal languages and grammars, students understand the structure and properties of regular and context-free languages.
CO CO Statement Cognitive Level* Knowledge Category# Evaluation Tools used CO1 To learn and understand fundamental concepts in computational theory, including computational models such as finite automata, pushdown automata, and Turing machines. U P Practical Assignment / Instructor-created exams / Quiz CO2 To be able to classify formal language into regular, context-free, context sensitive and unrestricted languages.
Ap P Practical Assignment / Instructor-created exams / Quiz CO3 To design and analyse Turing machines, their capabilities and limitations Ap P Practical Assignment / Instructor-created exams / Quiz CO4 Construct the abstract machines including finite automata, pushdown automata, and Turing machines from their associated languages and grammar Ap P Practical Assignment / Instructor-created exams / Quiz CO5 Gain insights into decidability and undecidability, and understand the Ap P Practical Assignment /