NAC/TLP-

Format No.
07a
Nadar Saraswathi College of Engineering and Technology, Rev. No. 04
Vadapudupatti, Theni - 625 531 Date 19.02.2025
(Approved by AICTE, New Delhi and Affiliated to Anna University,
Total Page 01
Chennai)
Course File Leaf (Theory)
For the Academic Year 2022 - 2023 (Odd/Even Semester)
Staff Name Mrs.G.GEERTHIGA Dept. / Designation AP / AI&DS Strength 27
Course/
B.Tech/ IT Year / Semester II / IV Credit 3
Branch
Course Code/ Subject Theory of Computation
Code/ Choice
CS3452/CS401/PCC Subject Name
 NAC/TLP-
Format No.
07a
Nadar Saraswathi College of Engineering and Technology, Rev. No. 04
Vadapudupatti, Theni - 625 531 Date 19.02.2025
(Approved by AICTE, New Delhi and Affiliated to Anna University,
Total Page 01
Chennai)
Course File Leaf (Theory)
For the Academic Year 2022 - 2023 (Odd/Even Semester)
Staff Name Mrs.G.GEERTHIGA Dept. / Designation AP / AI&DS Strength 27
Course/
B.Tech/ IT Year / Semester II / IV Credit 3
Branch
Course Code/ Subject Theory of Computation
Code/ Choice
CS3452/CS401/PCC Subject Name

S. No. CONTENTS S. No. CONTENTS

1. Syllabus 14. University Questions Bank with Answer Keys
Performance Assessment Documents -Assign-
2. Course plan 15. ments, Tutorials, Quiz, Mini Projects, Case
Study Etc. –with Samples
3. Students Name list 16. CAT / Unit Test Questions
4. Individual Time Table 17. CAT / Unit Test Mark Statement & Analysis
5. Course Materials-Unit I 18. Internal Test Questions and Answer Key
6. Internal Test Answer Papers ( Best, Average,
No. Date Materials-Unit II Done by 19.
Course Remarks Signature
Poor)
7. Internal Mark Statement & Result Analysis
Course Materials-Unit III 20.
Report
* (Verified By Department Audit In charge)
8. Action taken / Impact Analysis on Slow
Course Materials-Unit IV 21.
Learners & Bright Students List.
No. 9. Date Done by Remarks Signature
Course Materials-Unit V 22. Internal Assessment Consolidated Report
Re- Previous CO Attainment Analysis Report, view
10. Content Beyond Syllabus with
Par- 23. CO Attainment Analysis (Current Sem ) & ticu-
Materials & Source
lars: Analysis Report with Proof
Staff 11. Tutorial Sheet(If Applicable) 24. Course Exit Survey ( Indirect Attainment )
University Feedback Summary (with Ques-
12. Exam Cell Question Bank
25. tion), University Mark Statement & Result
(Part-A,B&C)
analysis
13. Question Bank (Two marks POs and COs Attainment (After Publishing
26.
with answers) University Results with Indirect )
Alteration (If any):____________________________ from _________________

Staff In Charge Head of the Department Principal

Format No. NAC/TLP-07a.2

Nadar Saraswathi College of Engineering and Technology, Rev. No. 04
Vadapudupatti, Theni - 625 531 Date 29-11-2019
(Approved by AICTE, New Delhi and Affiliated to Anna University, Chennai) Total Pages 04

Course Plan (Theory)

For the Academic Year 2024 - 25 (OOD/Even Semester)

Staff Name Mrs.G.GEERTHIGA Dept. / Designation AI&DS/AP Strength

Course/Branch B.Tech / IT Year / Semester II/IV Credit 3
Course Code/ Subject Theory of Computation
Code/Choice
CS3452/CS401/PCC Subject Name

I. Objective (5): The student should be made to :

OB1: To understand foundations of computation including automata theory
OB2: To construct models of regular expressions and languages.
OB3: To design context free grammar and push down automata
OB4: To understand Turing machines and their capability
OB5: To understand Undecidability and NP class problems

II. Pre requisites : Student should know about the basic knowledge in computing
III. Guidelines (Paper’s Nature) : Mathematical Notations, grammars

IV. Course Out Come (5) : At the end of this course, the students will be able to
COs Outcomes Bloom’s Taxonomy
C401.1 Construct automata theory using Finite Automata Apply
C401.2 Write regular expressions for any pattern Apply
C401.3 Design context free grammar and Pushdown Automata Understand and Apply
C401.4 Design Turing machine for computational functions Understand and Apply
C401.5 Differentiate between decidable and undecidable problems Understand

V. CO – PO, PSO Mapping: (3- > Strong, 2- > Moderate, 1 – >Low)

CO- PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
PO,PSO
C401.1 1 3 2 3 - - - - 1 1 2 3 1 3 2
C401.2 2 2 3 2 1 - - - 3 3 2 3 3 1 2
C401.3 2 2 3 2 1 - - - 1 3 1 2 1 2 2
C401.4 2 2 2 1 - - - - 1 3 3 2 1 3 2
C401.5 2 2 2 1 1 - - - 1 1 3 2 3 1 3

VI. Books to be Referred (Available in Library):

T1: Hopcroft J.E., Motwani R. & Ullman J.D., "Introduction to Automata Theory, Languages and
Computations", 3rd Edition, Pearson Education, 2008.
T2. John C Martin , "Introduction to Languages and the Theory of Computation", 4th Edition, Tata McGraw
Hill, 2011.
R1:Harry R Lewis and Christos H Papadimitriou , "Elements of the Theory of Computation", 2nd Edition,
Prentice Hall of India, 2015.
R2. Peter Linz, "An Introduction to Formal Language and Automata", 6th Edition, Jones & Bartlett, 2016.

R3. K.L.P.Mishra and N.Chandrasekaran, “Theory of Computer Science: Automata Languages and Computa-
tion”, 3rd Edition, Prentice Hall of India, 2006.

VII. E-Learning Resources :

EL1: https://www.geeksforgeeks.org/introduction-of-theory-of-computation/
EL2: https://www.tutorialspoint.com/what-is-the-theory-of-computation

VIII. Method of Evaluation (Considered for CO Assessment ) :

CO Assessment Direct
CO Evaluation Internal : CO Eval Ext
Int 1,2/ Unit / CAT Case Assign., Seminar Quiz GD RP Project/Lab University
Mod 1,2 Study
Yes No No Yes Yes No No NA NA Yes
CO Assessment Indirect
Course Exit Survey Yes

IX. Co Attainment analysis:

Internal If Class average is less than 60% - If Class average is 60% and above -
Exam** Threshold is 50% Threshold is 60%
Target
University If Class average is less than 70% - If Class average is 70% and above -
Competence
Exam** Threshold is 50% Threshold is 70%
Threshold
Mini Project
(Level) Common Group / Sem Case Study Quiz /GD / RP
Assignment** / Lab
20% 40% 50% 50% 30%
70% Students Got More Than Target Competence Level 3
Benchmark &
60% Students Got More Than Target Competence Level 2
Attainment
50% Students Got More Than Target Competence Level 1
Level
If Students Below 50% of Target Not Met

Attainment Scores in Scale of 3

Direct Attainment of = 0.8 * CO attainment (Direct) + 0.2 * CO
CO Attainment
Cos attainment (In-Direct)
Calculations
Overall Attainment of = 0.5 * CO attainment (Internal Overall) + 0.5 *
CO CO attainment (University)
PO Individual Attainment = Overall Attainment of CO *(Average of CO-PO Mapping Score of
Calculations Individual POs / 3)
PSO Individual Attainment = Overall Attainment of CO *(Average of CO-PSO Mapping Score of
Calculations Individual PSOs / 3)
**varies by subject and also by department
 X. Lesson Plan:

RENTIVE DATE Content Referenc

Deliver e Book No. of
y no. & Periods Cumulativ
S. No. Topic CO BTL
Mode * Page no. / Require e Periods
E- d
sources
UNIT I AUTOMATA AND REGULAR EXPRESSIO
1. 22.02.25 Need for automata CO T1&16 1
L1 BB 1
theory 1
25.02.25 Introduction to formal CO T1&19 2
2. L1 BB 1
proof 1
27.02.25 CO T1&51 3
3. Finite Automata 1
L1 BB 1
01.03.25 Deterministic Finite CO T1&59 4
4. L3 BB 1
Automata 1
05.03.25 Non - deterministic CO T1&69 5
5. L3 BB 1
Finite Automata 1
06.03.25 Equivalence between CO T1&74 6
6. L3 BB 1
NFA and DFA – 1
08.03.25 Finite Automata with CO T1&86 7
7. L3 BB 1
Epsilon Transitions 1
12.03.25 Equivalence of NFAs T1&90 8
CO
8. with and without ε- 1
L3 BB 1
moves
13.03.25 Conversion of NFA CO T1&91 9
9. L3 BB 1
into DFA – 1
15.03.25 Minimization of CO T1&91 10
10. L3 BB 1
DFAs. 1
UNIT-II REGULAR EXPRESSIONS AND LANGUAGES
CO T1&97 1 11
11. 19.03.25 Regular Expressions L2 BB
2
CO T1&98 1 12
12. 20.03.25 Regular Languages L2 BB
2
22.03.25 & FA and Regular Ex- CO T1&103 2 14
13. 2 L3 BB
26.03.25 pressions
CO T1&105 1 15
14. 27.03.25 Regular to NFA L3 BB
2
CO T1&115 1 16
15. 29.03.25 DFA to regular L3 BB
2
02.04.25 Proving Languages not CO T1&140 1 17
16. L3
2 BB
to be regular
03.04.25 & Closure Properties of CO T1&145 2 19
17. L3
2 BB
05.04.25 Regular Languages
UNIT-III CONTEXT FREE GRAMMAR AND PUSH DOWN AUTOMATA
Types of Grammar - WS 1 20
18
.
Chomsky‘s hierarchy CO3 L2 BB
of languages
19. Context-Free CO3 L2 BB T1&183 1 21
 Grammar (CFG) and
Languages
Derivations and Parse T1&187 1 22
20. CO3 L3 BB
trees
Ambiguity in T1&219 1 23
21. grammars and CO3 L3 BB
languages
Push Down Automata T1&233 1 24
(PDA): Definition –
Moves - Instantaneous
22. CO3 L3 BB
descriptions -
Languages of
pushdown automata
Equivalence of T1&251 1 25
23. pushdown automata CO3 L3 BB
and CFG
24. CFG to PDA CO3 L3 BB T1&251 1 26

25. PDA to CFG CO3 L3 BB T1&255 1 27

Deterministic T1&260 1 28
26. CO3 L3 BB
Pushdown Automata
UNIT-IV NORMAL FORMS AND TURING MACHINES
B T1&269 1 2
27. Normal forms for CFG CO4 L2
B 9
Simplification of CFG CO4 B T1&272 1 3
28. L2
B 0
Chomsky Normal CO4 B T1&280 1 3
29. L3 1
Form (CNF) and B
Greibach Normal CO4 B T1&285 1 3
30. L3 2
Form (GNF) B
Pumping lemma for CO4 B T1&288 1 3
31. L3 3
CFL B
Closure properties of CO4 T1&295 1 3
B 4
32. Context Free L3
B
Languages
Turing Machine : CO4 T1&321 1 3
Basic model – 5
definition and
representation – B
33. L3
Instantaneous B
Description –
Language acceptance
by TM –
TM as Computer of CO4 B T1&330 1 3
34. L3 6
Integer functions B
Programming CO4 T1&343 1 3
techniques for Turing B 7
35. L4
machines B
(subroutines).
UNIT-V UN DECIDABILITY
Unsolvable Problems CO5 L PPT T1&381 1 3
36. and Computable 2 8
Functions
PCP-MPCP CO5 L BB T1&404 1 3
37.
3 9
38. Recursive and CO5 L SEM T1&387 1 4
recursively 2 0
 enumerable languages
Properties - Universal CO5 L SEM T1&391 1 4
39. 2 1
Turing machine
Tractable and CO5 L SEM T1&404 1 4
40. 2 2
Intractable problems
P and NP CO5 L SEM T1&427 1 4
41. 2 3
completeness ––
Kruskal’s algorithm CO5 L SEM T1&428 1 4
42.
2 4
Travelling Salesman CO5 L SEM T1&433 1 4
43. 2 5
Problem-
44. 3-CNF SAT problems CO5 L SEM T1&454 1 4
2 6
* BB - Blackboard, VD – Videos, GD – Group Discussion, RP – Role Play, SEM –Seminar, DM-Demo/Lab, WS-Web
Search, MPJ – Mini Project., AS-Assignment, TUT- Tutorial, CO – Course Outcome, BTL- Blooms Taxonomy Level
(L1-L6).
XI. Content Beyond Syllabus:

Total Number of contact hours

Course Syllabus of Tota Contributi
Lectur Tutori Practic l Contributin Source
Code & content beyond ng POs &
e (L) al (T) al (P) Hou g COS
Title syllabus PSOs
rs

Application- Received
Text search PO2,3, from DAC
3 - - 3 CO2 /
PSO 2 Placement
Cell /
Alumni XII.
Lesson Schedule (Planned with Timetable):

No. Unit No / Description Duration (Date) Total Course Remarks

From To No of Outcome (if any
Periods Deviation)
1. Unit1/ AUTOMATA AND REGULAR 10 C401.1 -
EXPRESSIONS
2. Unit2 / REGULAR EXPRESSIONS AND 9 C401.2 -
LANGUAGES
3. Unit3 /CONTEXT FREE GRAMMAR AND 10 C401.3 -
PUSH DOWN AUTOMATA
4. Unit4 /NORMAL FORMS AND TURING 9 C401.4 -
MACHINES
5. Unit5 /UNDECIDABILITY 10 C401.5 -

XIII. Unit Test / CAT Test:

No. Date UNIT / CAT Portion No. Date UNIT / CAT Portion
1 4
2 5
3

XIV. Internal / Model Test:

No. Tentative Date Portion Total Appear Pass %
1 Unit 1,2
2 Unit 3,4
 3 Model(1-5 units)
XV. Activity Based Learning:

Interna Marks Announce Submitte

S.No Type of Course
l Phase Topic Allotte d d
. Activity* Outcome
d Date Date
I Assignmen C01&CO FA Conversion, Regular
1 20
t 2 Expressions
II C05 Recursive and recursively
enumerable,Universal
2 Seminar 20
language,P,NP
Problem,Kruskal Algorithm

* Seminar /Project work / Quiz/ Group Discussion & Role Play, Assignment (Individual /Group) etc.,
XVI. Tutorial: (If Applicable )
Unit Topic * (Questions Course Question
Discussed Date Completed Date
No. /Problem /Exercises) Outcome Count
1.
2.
3.
4.
5.
*Attach Proof of Tutorial Sheets Separate in given Format.

Staff In Charge Head of the Department Principal

Format No. NAC/TLP-07a.2

Nadar Saraswathi College of Engineering and Technology, Rev. No. 04
Vadapudupatti, Theni - 625 531 Date 19.02.2025
(Approved by AICTE, New Delhi and Affiliated to Anna University, Chennai) Total Pages 04

Course Plan (Theory)

For the Academic Year 2022 - 23 (OOD/Even Semester)

Staff Name Mrs.G.GEERTHIGA Dept. / Designation AI&DS/AP Strength

Course/Branch B.Tech / IT Year / Semester II/IV Credit 3
Course Code/ Subject Theory of Computation
Code/Choice
CS3452/CS401/PCC Subject Name

THEORY OF COMPUTATION LTPC

3003
COURSE OBJECTIVES:
 To understand foundations of computation including automata theory
 To construct models of regular expressions and languages.
 To design context free grammar and pushdown automata
 To understand Turing machines and their capability
 To understand Undecidability and NPclass problems

UNIT I AUTOMATA AND REGULAR EXPRESSION 9

Need for automata theory - Introduction to formal proof – Finite Automata (FA) – Deter-
ministic Finite Automata (DFA) – Non-deterministic Finite Automata (NFA) – Equiva-
lence between NFA and DFA – Finite Automata with Epsilon transitions – Equivalence
of NFA and DFA- Equivalenceof NFAs with and without ε-moves- Conversion of NFA
into DFA – Minimization of DFAs.

UNIT II REGULAR EXPRESSIONS AND LANGUAGES 9

Regular expression – Regular Languages- Equivalence of Finite Automata and regular-
expressions – Proving languages to be not regular (Pumping Lemma) – Closure proper-
ties of regular languages.

UNIT III CONTEXT FREE GRAMMAR AND PUSHDOWN AUTOMATA 9

Types of Grammar - Chomsky‘s hierarchy of languages -Context-Free Grammar (CFG)
and Languages – Derivations and Parse trees – Ambiguity in grammars and languages
– Push Down Automata (PDA): Definition – Moves - Instantaneous descriptions -Lan-
guages of pushdown automata – Equivalence of pushdown automata and CFG-CFG to
PDA-PDA to CFG – Deterministic Pushdown Automata.

UNITIV NORMALFORMSANDTURINGMACHINES 9
Normal forms for CFG – Simplification of CFG- Chomsky Normal Form (CNF) and
Greibach NormalForm (GNF) – Pumping lemmafor CFL – Closure properties of Context
Free Languages – Turing Machine :Basic model – definition and representation – In-
stantaneous Description – Language acceptance by TM – TM as Computer of Integer
functions – Programming techniques for Turing machines (subroutines).

UNITV UNDECIDABILITY 9
Unsolvable Problems and Computable Functions –PCP-MPCP- Recursive and recur-
sively enumerable languages – Properties - Universal Turing machine -Tractable and In-
tractable problems - P and NP completeness – Kruskal’s algorithm – Travelling Sales-
man Problem- 3-CNF SAT problems.

COURSEOUTCOMES:
At the end of this course, the students will be able to: CO1:Constructautomatatheoryus-
ingFiniteAutomata
CO2: Write regular expressions for any pattern
CO3:DesigncontextfreegrammarandPushdownAutomata
CO4:DesignTuringmachineforcomputationalfunctions
CO5:Differentiatebetweendecidableandundecidableproblems

TOTAL:45PERIODS
TEXTBOOKS:
1. HopcroftJ.E.,MotwaniR.& Ullman J.D., "Introduction to Automata Theory,Lan-
guages and Computations", 3rd Edition, Pearson Education, 2008.
2. John C Martin , "Introduction to Languages and the Theory of Computation", 4th
Edition, Tata McGraw Hill, 2011.

REFERENCES
1. Harry R Lewis and Christos H Papadimitriou , "Elements of the Theory of Computa-
tion", 2ndEdition, Prentice Hall of India, 2015.
2. Peter Linz, "An Introduction to Formal Language and Automata", 6th Edition, Jones
& Bartlett, 2016.
3. K.L.P.MishraandN.Chandrasekaran,“TheoryofComputerScience:AutomataLan-
guagesand Computation”, 3rd Edition, Prentice Hall of India, 2006.
CO’s-PO’s&PSO’sMAPPING
CO’s PO’s PSO’s
 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
1 1 3 2 3 - - - - 1 1 2 3 1 3 2
2 2 2 3 2 1 - - - 3 3 2 3 3 1 2
3 2 2 3 2 1 - - - 1 3 1 2 1 2 2
4 2 2 2 1 - - - - 1 3 3 2 1 3 2
5 2 2 2 1 1 - - - 1 1 3 2 3 1 3
AVg. 2 2 2 2 1 - - - 1 2 2 2 2 2 2
1-low,2-medium,3-high,‘-“-no correlation

Staff Incharge HOD Vice Principal Principal

Format No. NAC/TLP-08a

Nadar Saraswathi College of Engineering and Technology, Rev. No. 05
Vadapudupatti, Theni - 625 531 Date 19-02-2025
(Approved by AICTE, New Delhi and Affiliated to Anna University,
Total Pages
Chennai)
Course File Leaf (Lab)
For the Academic Year 2024 -25 (Even Semester)

Staff Name Mrs.G.GEERTHIGA Dept. / Designation AI&DS/AP Strength 25

Course/Branch B.TECH/IT Year / Semester III/VI Credit 3

Course Code / Mobile application Development Lab

CS146/IT3681 Laboratory Name
Laboratory Code

S. No. CONTENTS S.No CONTENTS

1. Internal Practical Exam 1, 2 Answer Papers

Syllabus 9.
(Best, Average and Poor)
2. Slow Learners Lists and Action taken / Impact
Course plan 10.
Analysis.
3. Internal Practical Mark Statement &
Students Name List 11.
Result Analysis Report., Sample records.
4. Individual Time Table 12. Internal Assessment Consolidated Report
5. Lab Manual 13. Performance Attainment & Analysis Report
6. Content Beyond Syllabus With Materials 14. Course Exit Survey ( Indirect Attainment )
7. University Practical Mark Statement &
Viva Question and Answers 15.
Result analysis
8. POs and COs Attainment (After Publishing
Internal Practical Exam 1, 2 Question 16.
University Results with Indirect )

Review Particulars:

No. Date Done by Remarks Signature

* For Q.C ONLY (Verified By Quality Audit)

Staff Alteration (If any):____________________________ from ____________________.

Staff In Charge Head of the Department Pricipal

NAC/TLP-
Format No.
Nadar Saraswathi College of Engineering and Technology, 08a.2
Rev. No. 02
Vadapudupatti, Theni - 625 531
(Approved by AICTE, New Delhi and Affiliated to Anna University, Date 29-11-2019
Chennai) Total Pages
Course File Leaf (Lab)
For the Academic Year 2022 - 23 (Odd/Even Semester)

Staff Name Mrs.G.Geerthiga Dept. / Designation AI&DS/AP Strength 25

Course/Branch B.Tech/IT Year / Semester III/VI Credit 3
Course Code / Mobile application Development Lab
CS146/IT3681 Laboratory Name
Laboratory Code

I. Instructional Objective (5) :

● To learn and implement important commands in SQL.
● To learn the usage of nested and joint queries.
● To understand functions, procedures and procedural extensions of databases.
● To understand design and implementation of typical database applications.
● To be familiar with the use of a front end tool for GUI based application development.

II. Pre requisites :

Basic knowledge of HTML, CSS, JavaScript

III. Understanding of Programming Logics and Object-Oriented Concepts

IV. Familiarity with Mobile App UI Design Principles
V. Knowledge of HTTP Requests and API Consumption
VI. Experience with Basic Database Operations (SQLite, Firebase, or equivalent

VII. Course Out Come (5) :

At the end of the course, the student should be able to:

COs Outcomes Bloom’s

Taxonomy
C408.1 L6
The objective of this course is to enable students to:

● Use Flutter/Kotlin multi-platform environment for building cross-platform

mobile applications

C408.2 L6
● Demonstrate the knowledge of different programming techniques and pat-
 terns for mobile application development

C408.3 L6
● Identify the components and structure of mobile application development
frameworks.

C408.4 L6
● Understand the capabilities and limitations of different platforms.
● Design and develop real-time mobile applications.

VIII. CO-PO, PSO Correlation Matrix: (3- > Strong, 2- > Moderate, 1 – >| Low)

CO-PO,PSO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
C408.1

3 3 3 3 - - - - 3 1 3 2 2 3 2

C408.2

2 2 3 2 2 - - - 1 2 3 3 2 1 2

C408.3

3 3 2 1 1 - - - 1 1 1 3 2 3 3

C408.4

1 3 3 3 1 - - - 1 1 3 2 3 1 3

C408.5

3 2 1 1 1 - - - 2 2 3 1 3 1 2

IX. E-Learning Resources :

EL1:www.beginnersbook.com

X. No. of Students/Batch :
S.No Students Register Number Total No of Students Batch Number
1 921022205001-921022205026 25 I
XI. Lab Location: Linus Lab

XII. Method of Evaluation (Considered for CO Assessment) :

 CO Assessment Direct
CO Evaluation Internal : CO Eval Ext
Int 1,2/ Unit / CAT Case Assign., Seminar Quiz GD RP Project/Lab University
Mod 1,2 Study
Yes No Yes No No NO NA NA Yes Yes
CO Assessment Indirect
Course Exit Survey Yes

XIII. Attainment Levels &Calculation :

Internal Others University
Target Competence Threshold
50% 50 Marks and Equivalent to
(Level) 50% Marks
Above [ B / E ] or Higher
Benchmark 70% Students Got More Than Target Competence Level 3
& 60% Students Got More Than Target Competence Level 2
Attainment 50% Students Got More Than Target Competence Level 1
Level If Students Below 50% of Target 0

Attainment Scores in Scale of 3

Direct Attainment of = 0.8 * CO attainment (University) + 0.2 * CO
CO Attainment
COs attainment (Internal Overall)
Calculations
Overall Attainment of = 0.8 * CO attainment (Direct) + 0.2 * CO
CO attainment (In-Direct)
PO Individual Attainment = Overall Attainment of CO *(Average of CO-PO Mapping Score of
Calculations Individual POs / 3)
PSO Individual Attainment = Overall Attainment of CO *(Average of CO-PSO Mapping Score of
Calculations Individual PSOs / 3)

XIV. Experiment Plan:

(Cyclic Order : Yes/ No)
Course Cumulative
S. No. Date Topic BTL
Outcome Periods

Study and installation of Flutter/Kotlin multi-platform

1 environment
C408.1 L6 4

Develop an application that uses Widgets, GUI components,

2 Fonts, and Colors
C408.1 L6 8

3 Develop a native calculator application C408.1 L6 12

4 Develop a gaming application that uses 2-D animations and C408.2 L6

gestures 16
5 Develop a movie rating application (similar to IMDB) C408.2 L6 20

Develop an application to connect to a web service and retrieve

6 data with HTTP
C408.2 L6 24

7 Develop a simple shopping application C408.2 L6 28

8 Design a web server supporting push notifications C408.3 L6 32

9 Develop an application by integrating Google Maps C408.3 L6 36

Mini Projects involving Flutter/Kotlin multi-platform

10 development
C408.3 L6 40

XV. Content Beyond Syllabus :

Total Number of contact hours
Course Code Syllabus of content Lecture Tutorial Practical Total Contributing Contributing
& Title beyond syllabus (L) (T) (P) Hours COS POs & PSOs

ODBC
CS407 CONNECTIVITY
- - 3 - CO5 PSO3

XVI. Internal Practical/ Model Practical Test :

No. Tentative Date Portion Total Appear Pass %

1 1-6 59
2 7-13 59
3 `

Staff In Charge Head of the Department Principal