[go: up one dir, main page]
Scribd
Upload
161 views2 pages

CourseOutcomes FLAT (2021-22)

This document provides the course outcomes for the course "Formal Languages and Automata Theory" offered in the B. Tech in Computer Science & Engineering program for the 2021-2022 academic year. The course aims to help students understand abstract machines and their ability to recognize languages, apply finite state machines to model computing problems, design context-free grammars for formal languages, distinguish between decidability and undesirability, and apply mathematical and formal techniques to solve computer science problems. The document lists the 6 course outcomes and maps them to the program outcomes on a scale of 1 to 3 to indicate the level of mapping between the course and program outcomes.

Uploaded by

nandan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
161 views2 pages

CourseOutcomes FLAT (2021-22)

This document provides the course outcomes for the course "Formal Languages and Automata Theory" offered in the B. Tech in Computer Science & Engineering program for the 2021-2022 academic year. The course aims to help students understand abstract machines and their ability to recognize languages, apply finite state machines to model computing problems, design context-free grammars for formal languages, distinguish between decidability and undesirability, and apply mathematical and formal techniques to solve computer science problems. The document lists the 6 course outcomes and maps them to the program outcomes on a scale of 1 to 3 to indicate the level of mapping between the course and program outcomes.

Uploaded by

nandan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Course Outcomes (COs)

Program Name: B. Tech in Computer Science & Engineering AY 2021-2022


Course Name: FORMAL LANGUAGES AND AUTOMATA THEORY Class / Sem II/II
Faculty Name: B Nandan kumar Regulation R20

Course Outcomes
After completing this course, the student will be able to:
CO CO Statement Taxonomy#
Number
C52231 Describe the concept of abstract machines and their power to Understand
recognize the languages.
C52232 Apply finite state machines for modeling and solving computing
Apply
problems.
C52233 Design context free grammars for formal languages. Create
C52234 Distinguish between decidability and undesirability. Analyze
C52235 Solve mathematical tools and formal methods Apply
C52236 Apply mathematical and formal techniques for solving problems in
Apply
computer science
#
Remember; Understand; Apply; Analyze; Evaluate; Create

CO-PO/PSO MATRIX: (Level of Mapping- 3: High; 2: Moderate; 1-Low; -: Not mapped)


PO 1 PO PO PO PO PO PO PO PO PO PO PO 12 PSO1 PSO2
2 3 4 5 6 7 8 9 10 11
CO1 3 2
CO2 3 2 2 3
CO3 2 3 2 3
CO4 1 2 2 3 2
CO5 1 3 3
CO6 3 2
AVERA 1.66 2.6 2 2.3 3 2.33 2.5
GE
PO1 Engineering Knowledge PO7 Environment & Sustainability

PO2 Problem Analysis PO8 Ethics

PO3 Design / Development of Solutions PO9 Individual & Team Work

PO4 Conduct Investigations of complex problems PO10 Communication Skills


PO5 Modern Tool usage PO11 Project Management & Finance

PO6 Engineer & Society PO12 Life-long Learning

Faculty signature

You might also like