Diploma in Computer Science & Engineering SBTE, Bihar

Curriculum

of

Diploma Programme

in

Computer Science & Engineering

State Board of Technical Education (SBTE)

Bihar
Diploma in Computer Science & Engineering SBTE, Bihar

Semester – IV
Teaching & Learning Scheme
Teaching & Learning Scheme
Board of Study (Hours/Week)
Course CourseTitles Classroom Instruction Lab Notional Total Total
Codes (CI) Instruction Hours Hours Credits
L T (LI) (TW+ SL) (CI+LI+TW+SL) (C)
2418401 Java Programming 3 - 4 2 9 6

2418402 Theory of Computation 2 1 - 2 5 4

2418403 Database Management System 3 - 4 2 9 6

2418404 Computer Organization & 2 1 - 2 5 4

Architecture
2418405 Computer Troubleshooting and 3 - 4 2 9 6
Maintenance
2400006 Environmental Education and 1 - 1 1 3 2
Sustainable Development
(Common for All Programmes)
2400408 Employability Skills Development 1 - - - 1 1
(Common for All Programmes)
2400110 Community/ Society Development 1 - - - 1 1
(Non-exam course)
(AIML, AE, CSE, ELX (R), CHE, EE, ME,
ME (Auto), MIE, FTS, CACDDM,)
Total 16 2 13 11 42 30

Legend:
CI: Classroom Instruction (Includes different instructional/implementation strategies i.e. Lecture (L), Tutorial (T), Case method, Demonstrations, Video demonstration, Problem based
learning etc. to deliver theoretical concepts)
LI: Laboratory Instruction (Includes experiments/practical performances /problem-based experiences in laboratory, workshop, field or other locations using different
instructional/Implementation strategies)
Notional Hours: Hours of engagement by learners, other than the contact hours for ensuring learning.
TW: Term work (includes assignments, seminars, micro projects, industrial visits, any other student activities etc.)
SL: Self Learning, MOOCs, spoken tutorials, online educational resources etc.
C: Credits = (1 x CI hours) + (0.5 x LI hours) + (0.5 x Notional hours)
Note:
TW and SL have to be planned by the teacher and performed by the learner under the continuous guidance and feedback of teacher to ensure outcome of learning.
Diploma in Computer Science & Engineering SBTE, Bihar

Semester - IV
Assessment Scheme
Assessment Scheme (Marks)
Theory Term work & Lab Assessment

Total Marks (TA+TWA+LA)

Assessment Self-Learning (LA)
(TA) Assessment
(TWA)
Board of
Study Course Codes Course Titles

End Theory

Progressive Lab

End Laboratory
Assessment

Assessment
Progressive

Assessment
Assessment
(ETA)

External
Internal
Theory

(PTA)

(ELA)
(PLA)
2418401 Java Programming 30 70 20 30 20 30 200

2418402 Theory of Computation 30 70 20 30 - - 150

2418403 Database Management System 30 70 20 30 20 30 200

2418404 Computer Organization & 30 70 20 30 - - 150

Architecture
2418405 Computer Troubleshooting and 30 70 20 30 20 30 200
Maintenance
2400006 Environmental Education and 15 - 10 - 10 15 50
Sustainable Development
(Common for All Programmes)
2400408 Employability Skills Development 25 - - - - - 25
(Common for All Programmes)
2400110 Community/ Society Development 25 - - - - - 25
(Non-exam course)
(AIML, AE, CSE, ELX (R), CHE, EE,
ME, ME (Auto), MIE, FTS, CACDDM,)
Total 215 350 110 150 70 105 1000

Legend:
PTA: Progressive Theory Assessment in class room (includes class test, mid-term test and quiz using online/offline modes)
PLA: Progressive Laboratory Assessment (includes process and product assessment using rating Scales and rubrics)
TWA: Term work & Self Learning Assessment (Includes assessment related to student performance in assignments, seminars, micro projects, industrial visits, self-learning, any other student activities etc.
Note:
• ETA & ELA are to be carried out at the end of the term/ semester.
• Term Work is to be done by the students under the guidance of internal faculty but its assessment will be done internally (40%) as well as externally (60%). Assessment related to planning and execution of Term
Work activities like assignment, micro project, seminar and self-learning is to be done by internal faculty (Internal Assessment) whereas assessment of output/product/ presentation related to these activities will be
carried out by external faculty/expert (External Assessment). However, criteria of internal as well as external assessment may vary as per the requirement of respective course. For valid and reliable assessment, the
internal faculty should prepare checklist & rubrics for these activities.
Diploma in Computer Science & Engineering Semester - IV SBTE, Bihar

A) Course Code : 2418401 (T2418401/P2418401/S2418401)

B) Course Title : Java Programming
C) Pre- requisite Course(s) : ICT Tools
D) Rationale
Java is platform independent, open-source object-oriented programming language enriched with free and
open source libraries. In current industrial scenario Java has the broad industry support and is prerequisite
with many allied technologies like Advanced Java, Java Server Pages, and Android Application Development.
Thus. Current industrial trends necessitate acquiring Java knowledge for Computer Engineering and
Information Technology graduates. This course develops necessary skills in students to apply object-oriented
programming techniques in Java so that students will be able to develop complete applications using core
Java.

E) Course Outcomes (COs): After the completion of the course, teachers are expected to ensure the
accomplishment of following course outcomes by the learners. For this, the learners are expected to perform
various activities related to three learning domains (Cognitive, Psychomotor and Affective) in classroom/
laboratory/ workshop/ field/ industry.

After completion of the course, the students will be able to-

CO-1 Implement Control structure in Java using concept of Class and Object
CO-2 Develop programs using Constructor and String Class
CO-3 Apply concept of inheritance for code reusability.
CO-4 Implement Exception Handling and multithreading
CO-5 Develop programs for handling I/O and file streams.

F) Suggested Course Articulation Matrix (CAM):

Programme Outcomes Programme
(POs) Specific
Course Outcomes*
Outcomes (PSOs)
(COs) PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PSO-1 PSO-2
Basic and Problem Design/ Engineering Engineering Project Life Long
Discipline Analysis Development Tools Practices for Management Learning
Specific of Solutions Society,
Knowledge Sustainability
and
Environment
CO-1 1 - - - - 1
CO-2 - 1 - 1 - - -
CO-3 - 2 1 1 - - 1
CO-4 2 1 1 1 - - -
CO-5 1 1 1 1 - - -
Legend: High (3), Medium (2), Low (1) and No mapping (-)
* PSOs will be developed by respective programme coordinator at institute level. As per latest NBA guidelines, formulating PSOs is
optional

Page- 1
 Diploma in Computer Science & Engineering Semester - IV SBTE, Bihar
G) Teaching & Learning Scheme:
Scheme of Study
(Hours/Week)
Board Course Course Classroom Lab Notional Total Total
of Code Title Instruction Instruction Hours Hours Credits
Study (CI) (LI) (TW+ SL) (CI+LI+TW+SL) (C)
L T
Computer
Java
Science and 2418401 03 - 04 02 09 06
Programming
Engineering
Legend:
CI: Classroom Instruction (Includes different instructional/implementation strategies i.e. Lecture (L), Tutorial (T), Case
method, Demonstrations, Video demonstration, Problem based learning etc. to deliver theoretical concepts)
LI: Laboratory Instruction (Includes experiments/practical performances /problem-based experiences in laboratory, workshop,
field or other locations using different instructional/Implementation strategies)
Notional Hours: Hours of engagement by learners, other than the contact hours for ensuring learning.
TW: Term Work (includes assignments, seminars, micro projects, industrial visits, any other student activities etc.)
SL: Self Learning, MOOCs, spoken tutorials, online educational resources etc.
C: Credits = (1 x CI hours) + (0.5 x LI hours) + (0.5 x Notional hours)
Note: TW and SL have to be planned by the teacher and performed by the learner under the continuous guidance and feedback
of teacher to ensure outcome of learning.

H) Assessment Scheme:

Assessment Scheme (Marks)

Theory Term Work & Lab Assessment

Total Marks (TA+TWA+LA)

Assessment Self-Learning (LA)
(TA) Assessment
Board of (TWA)
Course Title
Course Code

Study
Progressive Theory

End Laboratory
Progressive Lab
End Theory
Assessment

Assessment
Assessment

Assessment
(ETA)

External
Internal

(ELA)
(PLA)
(PTA)

Computer
Science and 2418401 Java Programming 30 70 20 30 20 30 200
Engineering
Legend:
PTA: Progressive Theory Assessment in class room (includes class test, mid-term test and quiz using online/offline modes)
PLA: Progressive Laboratory Assessment (includes process and product assessment using rating Scales and rubrics)
TWA: Term work & Self Learning Assessment (Includes assessment related to student performance in assignments, seminars,
micro projects, industrial visits, self-learning, any other student activities etc.
Note:
• ETA & ELA are to be carried out at the end of the term/ semester
• Term Work is to be done by the students under the guidance of internal faculty but its assessment will be done internally (40%) as
well as externally (60%). Assessment related to planning and execution of Term Work activities like assignment, micro project,
seminar and self-learning is to be done by internal faculty (Internal Assessment) whereas assessment of output/product/
presentation related to these activities will be carried out by external faculty/expert (External Assessment). However, criteria of
internal as well as external assessment may vary as per the requirement of respective course. For valid and reliable assessment,
the internal faculty should prepare checklist & rubrics for these activities.

Page- 2
Diploma in Computer Science & Engineering Semester - IV SBTE, Bihar
I) Course Curriculum Detailing: This course curriculum detailing depicts learning outcomes at course level
and session level and their attainment by the students through Classroom Instruction (CI), Laboratory
Instruction (LI), Sessional Work (SW) and Self Learning (SL). Students are expected to demonstrate the
attainment of Theory Session Outcomes (TSOs) and Lab Session Outcomes (LSOs) leading to attainment
of Course Outcomes (COs) upon the completion of the course. While curriculum detailing, NEP 2020
related reforms like Green skills, Sustainability, Multidisciplinary aspects, Society connect, Indian
Knowledge System (IKS) and others must be integrated appropriately.

J) Theory Session Outcomes (TSOs) and Units: T2418401

Major Theory Session Outcomes (TSOs) Units Relevant
COs
Number(s)
TSO 1a. Write programs to create classes and Unit-1.0 Basic Syntactical Constructs in Java CO-1
objects for the given problem.
TSO 1b. Explain the characteristics of the specified 1.1 Java Features and the Java Programming Environment
Java token. 1.2 Object-Oriented Paradigm:-
- Objects & Classes
TSO 1c. Explain the function of the given operator
- Data Abstraction
with example. - Data Encapsulation
TSO 1d. Develop the programs using relevant - Inheritance
control structure to solve the specified - Polymorphism
problem. 1.3 Benefits of OOP
TSO 1e. Explain the functioning of Java Virtual 1.4 Applications of OOP
Machine 1.5 Java History
1.6 Java Features
TSO 1f. Explain the function of specified built-in
- Simple small & Familiar
Java Package - Compiled or Interpreted
- Platform independent
- Portable
- Object Oriented
- Robust & Secure
- Distributed
- Multithreaded & Interactive
- Ease of development

1.7 Java vs C
1.8 Java vs C++
1.9 Java Environment
- Java Development Kit (JDK)
- Java Development Tool
1.10 Application Programming Interface
- Language Support Package
- Utilities Package
- Input/output Package
- AWT Package
- Applet Package
- Networking Package
1.11 Simple Java Program
- Class Declaration
- Opening & Closing Braces
- Main line
- Output line
- Creating object
1.12 Java Programming with multiple Statement
- Application with two classes
- Accessing class members

Page- 3
Diploma in Computer Science & Engineering Semester - IV SBTE, Bihar
Major Theory Session Outcomes (TSOs) Units Relevant
COs
Number(s)
- Use of Math Function
- Comments
1.13 Java Program Structure
- Document Section
- Package statement
- Import Statement
- Interface Statements
- Class Definitions
- Main method Class
1.14 Java Tokens
- Reserved Keywords
- Identifiers
- Literals
- Operators
- Separators
1.15 Compiling the Program
- Java Compiler javac
1.16 Running the Program
- Java Interpreter
1.17 Java Virtual Machine
- Byte Code
1.18 Command line Arguments
1.19 Constant & Variables
1.20 Data Types
- Primitive Data Types
- Non Primitive Data Types
1.21 Operators:-
- Arithmetic Operators
- Relational Operators
- Logical Operators
- Increment & Decrement
- Conditional Operators
- Bit wise Operator
- Dot Operators
- Ternary Operator

1.22 Expressions:-
- Operator precedence
- Associativity

1.23 Decision Statement:-

- if statement
- if else statement
- nested if else statement
- if else if ladder
- switch statement

1.24 Loop Statement:-

- While statement
- Do while statement
- for statement
- for-each statement.

1.25 Control Statement:-

- Break

Page- 4
Diploma in Computer Science & Engineering Semester - IV SBTE, Bihar
Major Theory Session Outcomes (TSOs) Units Relevant
COs
Number(s)
- Continue
- Return statement
TSO 2a. Use Constructors for the given Unit 2. Derived Syntactical Constructs in Java: CO-2
programming problem. 2.1 Constructors
TSO 2b. Identify scope and lifetime of a variable in - Default
the given program code. - Parameterized
TSO 2c. Describe the given visibility control with - Non parameterized
example. 2.2 ‘this’ keyword
TSO 2d. Write the programs by implementing 2.3 Command line arguments
arrays to solve the given problem. - Varargs: variable-length arguments
2.4 Visibility Control:
- Public
- Private
- Protected
- Default

2.5 Arrays
- Types of arrays
- Declaration of Arrays
- Creating an arrays
- Initialization of Arrays

2.6 Strings
- String classes
- String Buffer
Unit 3. Inheritance, Interface and Package: CO-3
TSO 3a. Apply the identified type of inheritance 3.1 Inheritance : Concept of Inheritance
for the given programming problem. 3.2 Types of Inheritance
TSO 3b. Differentiate between overloading and - Single Inheritance
overriding for the given example. - Multiple
TSO 3c. Develop program using the specified - Multilevel Inheritance
interface. - Hierarchical Inheritance
TSO 3d. Create user defined package for the
given problem. 3.3 Interface
- Defining interface
- Extending interface
- Implementing interface

3.4 Method overloading and overriding

3.5 Package
- Define package
- Types of package
- Naming and creating packages
- Accessing package
- Using a Package
- Import statement

Unit 4. Errors & Exception Handling, Multithreading: CO-4

TSO 4a. Distinguish the errors and exceptions (if 4.1 Errors
any) in the given example. - Introduction
4.2 Types of Errors

Page- 5
Diploma in Computer Science & Engineering Semester - IV SBTE, Bihar
Major Theory Session Outcomes (TSOs) Units Relevant
COs
Number(s)
TSO 4b. Develop program for handling the given - Compile-Time Errors
exception. - Run-Time Errors
TSO 4c. Crate threads to run the given multiple 4.3 Exceptions
processes in the given program. - try and catch statement
TSO 4d. Explain the function of the specified - nested try statement,
phase in thread life cycle using the given - throws and Finally statement
example. 4.4 Built-in exceptions

4.5 Multithreaded Programming

- Creating a Thread: By extending to thread class
- Creating a thread by implementing runnable Interface

4.6 Life cycle of thread:

- New State
- Runnable State
- Running State
- Blocked State
- Dead State
4.7 Thread Methods:
- wait ()
- sleep()
- notify()
- resume()
- suspend()
- stop()
TSO 5a. Use I/O stream classes in a program to Unit 5. Managing Input/Output/Files in Java: CO-5
solve the given problem. 5.1 Introduction and Concept of Streams.
TSO 5b. Write programs for reading and writing 5.2 Stream Classes.
character streams to and from the 5.3 Byte Stream Classes:
given file. - Input Stream Classes
TSO 5c. Write programs for reading and writing - Output Stream Classes.
bytes to and from the given file. 5.4 Character Stream Classes:
TSO 5d. Write program to demonstrate use of - Using Reader Stream classes
primitive Data types with the specified - Using Writer Stream classes
stream. 5.5 Using File Class:
- I/O Exceptions
- Creation of Files
- Reading/Writing Bytes
- Handling Primitive Data types.
Note: One major TSO may require more than one Theory session/Period.

K) Suggested Laboratory (Practical) Session Outcomes (LSOs) and List of Practical: P2418401

Relevant
S.
Practical/Lab Session Outcomes (LSOs) Laboratory Experiment/Practical Titles COs
No. Number(s)
1. a) Setup a Java Programming CO-1
development environment by using:
• Command prompt( Classpath and
path setup)
LSO 1.1. Install Java IDE.
• Any IDE (Eclipse, Jcreator etc.)
b) Test the JDE Setup by implementing a
small Program

Page- 6
Diploma in Computer Science & Engineering Semester - IV SBTE, Bihar
Relevant
S.
Practical/Lab Session Outcomes (LSOs) Laboratory Experiment/Practical Titles COs
No. Number(s)
LSO 2.1. Develop program using decision-making 2. Write programs to demonstrate use of if CO-1
Control Statements in Java. statement, if else, nested if statement for
decision making.
LSO 4.1. Develop program in Java using loop 3. Write programs to demonstrate use of CO-1
statements to solve iterative problems. for loops and do-while loop.
LSO 5.1. Implement constructor in Java 4. Develop a program for implementation of- CO-2
• Constructors
• Parameterized constructor
• Non parameterized constructor
LSO 6.1. Use different functions available in java 5. Develop program demonstrating CO-2
String Class implementation of different String Class
functions.
LSO 7.1. Implement single and multidimensional 6. Develop program for implementation of CO-2
array in Java Arrays in Java

LSO 8.1. Implement Overloading, Overriding 7. Develop programs to demonstrate CO-3

concepts in Java implementation of overloading and
overriding concepts

LSO 9.1. Implement concept of code reusability 8. Develop programs for implementation of: CO-3
using inheritance in Java • single inheritance
• multiple Inheritance
• multilevel Inheritance
• hierarchical Inheritance
LSO 10.1. Apply the concepts of Errors & 9. Develop program to implement try-catch CO-4
Exceptional Handling block
LSO 11.1. implement concept of File handling 10. Develop program to demonstration CO-5
using I/O stream implementation of I/O stream classes
LSO 12.1 implement concept of File handling using 11. Develop program to demonstrate CO-5
file stream implementation of file stream classes

L) Suggested Sessional Work and Self Learning: S2418401

a. Assignments: Questions/Problems/Numerical/Exercises to be provided by the course teacher in line with

the targeted COs.

b. Micro Projects:
1. Simple Calculator Application
2. Attendance Management System
3. Library book issuing System
4. Travel ticket booking System
5. Stock management in Medical shop

c. Other Activities:
1. Seminar Topics: -
• Importance of OOPS Paradigm
• Concept of Inheritance and interface
• Importance of Packages
• Exception handling techniques
• File handling using Java

Page- 7
Diploma in Computer Science & Engineering Semester - IV SBTE, Bihar
2. Self-learning topics:

• Various Java API

• Various Java Packages

M) Suggested Course Evaluation Matrix: The course teacher has to decide and use the appropriate assessment
strategy and its weightage in theory, laboratory and sessional work for ensuring CO attainment. The
response/performance of the student in each of these designed activities is to be used to calculate CO
attainment.
Course Evaluation Matrix
Theory Assessment (TA)** Term Work Assessment (TWA) Lab Assessment (LA)#
Progressive End Theory Term Work & Self Learning
Theory Assessment Assessment Progressive Lab End Laboratory
Assessment (ETA)
COs Assessment Assessment
(PTA)
Assignments Micro Other (PLA) (ELA)
Class/Mid
Sem Test Projects Activities*
CO-1 25% 25% 25% 20% 20% 25% 25%
CO-2 20% 20% 20% 20% 20% 20% 20%
CO-3 20% 20% 20% 20% 20% 20% 20%
CO-4 20% 20% 20% 20% 20% 20% 20%
CO-5 15% 15% 15% 20% 20% 15% 15%
Total 30 70 20 20 10 20 30
Marks
50
Legend:
*: Other Activities include self- learning, seminar, visits, surveys, product development, software development etc.
**: Mentioned under point- (N)
#: Mentioned under point-(O)
Note:
• The percentage given are approximate
• In case of Micro Projects and End Laboratory Assessment (ELA), the achieved marks will be equally divided in all those COs mapped
with total experiments.
• For CO attainment calculation indirect assessment tools like course exit survey need to be used which comprises of questions related
to achievement of each COs.

N) Suggested Specification Table for End Semester Theory Assessment: Specification table represents the
reflection of sample representation of assessment of cognitive domain of full course.
Unit Title and Number Total Relevant Total ETA (Marks)
Classroom COs Marks Remember Understanding Application
Instruction Number(s) (R) (U) & above
(CI) (A)
Hours
Unit 1.0 Basic Syntactical 12 CO-1 18 6 4 8
Constructs in Java
Unit 2.0 Derived Syntactical 8 CO-2 14 4 6 4
Constructs in Java
Unit 3.0 Inheritance, Interface 10 CO-3 14 4 4 6
and Package
Unit 4.0 Errors & Exception 10 CO-4 14 4 4 6
Handling,
Multithreading
Unit 5.0 Managing Input/ 8 CO-5 10 2 2 6
Output/ Files in Java
Total 48 - 70 20 20 30

Note: Similar table can also be used to design class/mid-term/ internal question paper for progressive assessment.

Page- 8
Diploma in Computer Science & Engineering Semester - IV SBTE, Bihar
O) Suggested Specification Table for Laboratory (Practical) Assessment:
PLA /ELA
S. No. Relevant COs Performance Viva-
Laboratory Practical Titles
Number(s) PRA* PDA** Voce
(%) (%) (%)
1. c) Setup a Java Programming development environment by CO-1 80 10 10
using:
• Command prompt( Classpath and path setup)
• Any IDE (Eclipse, Jcreator etc.)
d) Test the JDE Setup by implementing a small Program
2. Write programs to demonstrate use of if statement, if else, nested if CO-1 40 50 10
statement for decision making.
3. Write programs to demonstrate use of CO-1 40 50 10
for loops and do-while loop.
4. Develop a program for implementation of- CO-2 40 50 10
• Constructors
• Parameterized constructor
• Non-parameterized constructor
5. Develop program demonstrating implementation of different CO-2 40 50 10
String Class functions.

6. Develop program for implementation of Arrays in Java CO-2 40 50 10

7. Develop programs to demonstrate implementation of CO-3 40 50 10

overloading and overriding concepts

8. Develop programs for implementation of: CO-3 40 50 10

• single inheritance
• multiple Inheritance
• multilevel Inheritance
• hierarchical Inheritance
9. Develop program to implement try-catch block CO-4 50 40 10

10. Develop program to demonstration implementation of I/O stream CO-5 40 50 10

classes
11. Develop program to demonstrate implementation of file stream CO-5 40 50 10
classes
Legend:
PRA*: Process Assessment
PDA**: Product Assessment
Note: This table can be used for both end semester as well as progressive assessment of practical. Rubrics need to beprepared by
the course teacher for each experiment/practical to assess the student performance.

P) Suggested Instructional/Implementation Strategies: Different Instructional/ Implementation Strategies

may be appropriately selected, as per the requirement of the content/outcome. Some of them are Improved
Lecture, Tutorial, Case Method, Group Discussion, Industrial visits, Industrial Training, Field Trips, Portfolio
Based, Learning, Role Play, Live Demonstrations in Classrooms, Lab, Field Information and Communications
Technology (ICT)Based Teaching Learning, Blended or flipped mode, Brainstorming, Expert Session, Video
Clippings, Use of Open Educational Resources (OER), MOOCs etc.

Page- 9
Diploma in Computer Science & Engineering Semester - IV SBTE, Bihar
Q) List of Major Laboratory Equipment, Tools and Software:
S. Name of Equipment, Broad Specifications Relevant
No Tools and Software Experiment/Practical
. Number
1 Computer System Any General-purpose Computer with 4GB
RAM/500GB HDD with JDK1.8 or above 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11
2 IDE for Java Programming Eclipse, Jcreator

R) Suggested Learning Resources:

(a) Books:
S. Titles Author(s) Publisher and Edition with ISBN
No.
1 Programming with JAVA Balagurusamy E. McGraw Hill Education (India) Private
Limited, New Delhi,5th Edition
ISBN-13:978-93-5134-320-2
2 Java Complete Reference JAVA 2 Schildt Herbert McGraw Hill Education (India) Private
Limited,New Delhi,10TH Edition
ISBN:9789339212094
3 Head First Java Kathy Sierra & Bert O'Reilly Media 1st Edition
Bates ISBN: 978-0596004651

(b) Online Educational Resources:

1. http://cse.iitkgp.ac.in/~dsamanta/java.html
2. https://www.tutorialspoint.com/java/
3. http://cse.iitkgp.ac.in/~dsamanta/java.html
4. https://www.youtube.com/watch?v=J_d1fJy90GY&list=PLbRMhDVUMngcx5xHChJ-f7ofxZI4JzuQR

Note: Teachers are requested to check the creative commons license status/ financial implications of the suggested, online
educational recourses before use by the students

(c) Others:
1. Learning Inbuilt Packages

******

Page- 10
Diploma in Computer Science & Engineering Semester - IV SBTE, Bihar

A) Course Code : 2418402(T2418402/S2418402)

B) Course Title : Theory of computation (AIML, CSE)
C) Pre- requisite Course(s) :
D) Rationale :
Theory of Computation is a broad field of study focused on creating more efficient algorithms and other
computational processes. This course equips students with essential theoretical knowledge in areas such as
automata theory, formal languages, computability, and complexity theory.
This course prepares students to comprehend the capabilities and limitations of computer systems,
enabling them to develop critical thinking and problem-solving skills necessary in algorithm design and
computational problem-solving within various engineering domains including artificial intelligence.

E) Course Outcomes (COs): After the completion of the course, teachers are expected to ensure the
accomplishment of the following course outcomes by the learners. For this, the learners are expected to
perform various activities related to three learning domains (Cognitive, Psychomotor, and Affective) in the
classroom/ laboratory/ workshop/ field/ industry.

After completion of the course, the students will be able to-

CO-1 Establish Relationship between grammar and language in the context of Theory of Computation.
CO-2 Apply finite automata, regular expressions, and regular grammar to recognize and generate regular
languages.
CO-3 Analyze context-free languages and pushdown automata to determine their equivalence with context-
free grammars.
CO-4 Evaluate Turing machines to solve problems considering their capabilities and limitations.
CO-5 Apply Rice's theorem to demonstrate undecidable problems about languages.
CO-6 Transforming one problem into another problem using reduction algorithm.

F) Suggested Course Articulation Matrix (CAM):

Programme Programme Specific
Outcomes(POs) Outcomes*
Course (PSOs)
Outcomes PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PSO-1 PSO-2
(COs) Basic and Problem Design/ Engineering Engineering Project Life Long
Discipline Analysis Development Tools Practices for Management Learning
Specific of Solutions Society,
Knowledge Sustainability
and
Environment
CO-1 1 - - - - - 1
CO-2 2 2 2 1 - - 1
CO-3 2 2 2 1 - - -
CO-4 2 2 2 1 - - -
CO-5 2 2 2 - - - -
CO-6 1 2 1
Legend: High (3), Medium (2), Low (1) and No mapping (-)
* PSOs will be developed by respective programme coordinator at institute level. As per latest NBA guidelines, formulating PSOs is
optional

Page 1
Diploma in Computer Science & Engineering Semester - IV SBTE, Bihar
G) Teaching & Learning Scheme:
Scheme of Study
(Hours/Week)
Board Classroo Lab Notional Total Total
Course Course
of m Instruction Hours Hours Credits
Code Title
Study Instructi (LI) (TW+ SL) (CI+LI+TW+SL) (C)
on
(CI)
L T
Theory of
AIML 2418402 02 01 - 02 05 04
Computation
Legend:
CI: Classroom Instruction (Includes different instructional/implementation strategies i.e. Lecture (L), Tutorial (T), Case method,
Demonstrations, Video demonstration, Problem based learning etc. to deliver theoretical concepts)
LI: Laboratory Instruction (Includes experiments/practical performances /problem-based experiences in laboratory, workshop,
field or other locations using different instructional/Implementation strategies)
Notional Hours: Hours of engagement by learners, other than the contact hours for ensuring learning.
TW: Term Work (includes assignments, seminars, micro projects, industrial visits, any other student activities etc.)
SL: Self Learning, MOOCs, spoken tutorials, online educational resources etc.
C: Credits = (1 x CI hours) + (0.5 x LI hours) + (0.5 x Notional hours)
Note: TW and SL have to be planned by the teacher and performed by the learner under the continuous guidance and feedback of
teacher to ensure outcome of learning.

H) Assessment Scheme:

Assessment Scheme (Marks)

Theory Assessment Term Work & Lab Assessment

Total Marks (TA+TWA+LA)

(TA) Self-Learning (LA)
Assessment
Board (TWA)
Course Title
Course Code

of
Progressive Theory

End Laboratory
Progressive Lab

Study
End Theory
Assessment

Assessment
Assessment

Assessment
(ETA)

External
Internal

(ELA)
(PLA)
(PTA)

Theory of
AIML 2418402 30 70 20 30 - - 150
computation

Legend:
PTA: Progressive Theory Assessment in class room (includes class test, mid-term test and quiz using online/offline modes)
PLA: Progressive Laboratory Assessment (includes process and product assessment using rating Scales and rubrics)
TWA: Term work & Self Learning Assessment (Includes assessment related to student performance in assignments, seminars, micro
projects, industrial visits, self-learning, any other student activities etc.
Note:
● ETA & ELA are to be carried out at the end of the term/ semester.
● Term Work is to be done by the students under the guidance of internal faculty but its assessment will be done internally (40%) as
well as externally (60%). Assessment related to planning and execution of Term Work activities like assignment, micro project,
seminar and self-learning is to be done by internal faculty (Internal Assessment) whereas assessment of output/product/
presentation related to these activities will be carried out by external faculty/expert (External Assessment). However, criteria of
internal as well as external assessment may vary as per the requirement of respective course. For valid and reliable assessment,
the internal faculty should prepare checklist & rubrics for these activities.

Page 2
Diploma in Computer Science & Engineering Semester - IV SBTE, Bihar
I) Course Curriculum Detailing: This course curriculum detailing depicts learning outcomes at course level and
session level and their attainment by the students through Classroom Instruction (CI), Laboratory Instruction
(LI), Sessional Work (SW) and Self Learning (SL). Students are expected to demonstrate the attainment of
Theory Session Outcomes (TSOs) and Lab Session Outcomes (LSOs) leading to attainment of Course Outcomes
(COs) upon the completion of the course. While curriculum detailing, NEP 2020 related reforms like Green
skills, Sustainability, Multidisciplinary aspects, Society connect Indian Knowledge System (IKS) and others must
be integrated appropriately.

J) Theory Session Outcomes (TSOs) and Units: T2418402

Major Theory Session Outcomes (TSOs) Units Relevant
COs
Number(s)
TSO 1a. Explain the fundamental concepts of Unit-1.0 Introduction to Theory of Computation CO-1
alphabets, languages, and grammar, and
their role in the theory of computation. 1.1 Alphabet, Languages, and Grammar:
- Introduction to Alphabet: Set of Symbols or
TSO 1b. Apply productions and derivations to Characters
generate and manipulate strings within a -Exploration of the languages: Sets of strings
given language. -Introduction to grammar: Set of rules, -
TSO 1c. Compare different types of languages Structure, and formation of valid strings.
based on their grammatical structures and Productions and derivations
complexities. 1.2 Productions and Derivations:
TSO 1d. Explain the significance and implications of - Concept of production in the grammar.
the Chomsky Hierarchy in classifying - Explanation of the derivation to generate a
languages and understanding their string.
computational power. 1.3 Chomsky Hierarchy of Languages:
- Introduction to Chomsky Hierarchy.
- Levels of formal language category:
Type-3 (Regular), Type-2 (Context-Free), Type-
1 (Context-Sensitive), and Type-0
(Unrestricted).

TSO 2a. Explain the concept of regular expressions Unit-2.0 Regular languages and Finite Automata CO-2
and their role in defining regular languages.
TSO 2b. Compare nondeterministic finite automata 2.1 Regular expressions and languages.,
(NFA) with DFA and establish their Deterministic finite automata (DFA) and
equivalence. equivalence with regular expressions.
TSO 2c. Explain the relationship between regular
2.2 Nondeterministic finite automata (NFA) and
grammars and finite automata and
demonstrate their equivalence. equivalence with DFA,
TSO 2d. Prove laws related to properties of regular 2.3 Regular grammars and equivalence with finite
languages, such as closure under union, automata, Properties of regular languages,
intersection, and complementation. Pumping lemma for regular languages,
TSO 2e. Apply the pumping lemma for regular 2.4 Minimization of finite automata.
languages to prove the non-regularity of 2.5 Mealy and Moore machine
specific languages.
TSO 2f. Compare the characteristics of Mealy and
Moore Machine.

TSO 3a. Explain the concept of context-free Unit 3. Context-Free Languages and Pushdown CO-3
grammars (CFG) and their role in defining Automata
context-free languages (CFL).
TSO 3b. Converts a Chomsky normal form into 3.1 Context-free grammars (CFG) and languages
Greibach Normal Form (CFL)
TSO 3c. Establish the equivalence between 3.2 Chomsky and Greibach normal forms
nondeterministic pushdown automata
3.3 Nondeterministic pushdown automata (NPDA)
(NPDA) and context-free grammars.

Page 3
Diploma in Computer Science & Engineering Semester - IV SBTE, Bihar
Major Theory Session Outcomes (TSOs) Units Relevant
COs
Number(s)
TSO 3d. Apply the pumping lemma for context-free and equivalence with CFG
languages to prove the non-context- 3.4 Parse trees and ambiguity in CFG
freeness of specific languages. 3.5 Pumping lemma for context-free languages
3.6 Deterministic pushdown automata and closure
properties of CFLs.
Unit 4. Context-Sensitive Languages and Turing CO-4
TSO 4a. Explain the concept of context-sensitive Machines
grammars (CSG) and their role in defining
context-sensitive languages (CSL). 4.1 Context-sensitive grammars (CSG) and
TSO 4b. Analyze equivalence between linear languages
bounded automata (LBA) and context- 4.2 Linear bounded automata (LBA) and
sensitive grammars.
equivalence with context-sensitive grammar
TSO 4c. Explain the basic model of Turing machines
(TM) and their computational capabilities 4.3 The basic model for Turing machines (TMs)
with example. 4.4 Turing-recognizable (recursively enumerable)
TSO 4d. Differentiate between Turing-recognizable and Turing-decidable (recursive) languages
(recursively enumerable) and Turing- and their closure properties
decidable (recursive) languages. 4.5 Variants of Turing machines, including
TSO 4e. Establish equivalence of different turning nondeterministic TMs and equivalence with
machine variants.
deterministic TMs
TSO 4f. Explain the concept of unrestricted
grammars and establish their equivalence 4.6 Unrestricted grammars and equivalence with
with Turing machines. Turing machines
TSO 4g. Explain the role of Turing machines as 4.7 TMs as enumerators.
enumerators in the computation of
languages.
TSO 5a. Explain the Church-Turing thesis and its Unit 5. Undecidability CO-5
significance in defining the concept of CO-6
computability. 5.1 Church-Turing thesis and universal Turing
TSO 5b. Establish reduction techniques between machine
different languages. 5.2 Diagonalization languages and reduction
TSO 5c. Prove the Rice's theorem of undecidable between languages, Reduction Theorem,
problems about languages. Properties of Reduction
TSO 5d. Differentiate between the complexity 5.3 Rice's theorem and undecidable problems
classes P, NP, NP-complete, and NP Hard. about languages
TSO 5e. Apply reduction techniques and complexity 5.4 P, NP, NP-complete, and NP Hard class of
analysis to classify problems within the P, problems
NP, NP-complete, and NP Hard classes.
Note: One major TSO may require more than one Theory session/Period.

K) Suggested Laboratory (Practical) Session Outcomes (LSOs) and List of Practical: (Not Applicable)

L) Suggested Term Work and Self Learning: S2418402 Some sample suggested assignments, micro project
and other activities are mentioned here for reference.

a. Assignments: Questions/Problems/Numerical/Exercises to be provided by the course teacher in line

with the targeted COs.

b. Micro Projects:
1. Regular Expression Matcher: Create a program that can match regular expressions against input
strings. You can implement this using the Thompson's construction algorithm for NFA from regex.

Page 4
Diploma in Computer Science & Engineering Semester - IV SBTE, Bihar
2. Pushdown Automaton Visualizer: Develop a graphical tool that visualizes the operation of a
pushdown automaton (PDA) on input strings. This can help users understand how PDAs process
input.
3. Context-Free Grammar Parser: Create a program that parses and validates context-free grammars.
Users can input a grammar, and the program should check if it's in the correct format.
4. Comparative Analysis of Complexity Classes: Create an informative chart comparing the complexity
classes P, NP, NP-complete, and NP Hard. Include a detailed explanation of each class, examples of
problems belonging to each class, and their relationship with each other. Highlight the significance
of these complexity classes in understanding the computational difficulty of problems.

b. Other Activities:

1. Seminar Topics:
• Automata Theory and Applications: Explore the basics of automata theory, its types (finite automata,
pushdown automata, Turing machines), and practical applications in computer science.
• Complexity Theory: Investigate the different complexity classes (P, NP, NP-complete, PSPACE, etc.),
their relationships, and their implications in solving computational problems efficiently.
• Formal Languages and Grammars: Discuss formal language theory, context-free grammars, regular
expressions, and their relevance in programming languages and compiler design.
• Decidability and Undecidability: Explore the concept of decidability, undecidability, and examples of
undecidable problems in computer science.
• Reduction Techniques in Computational Complexity: Investigate various reduction techniques, such
as polynomial-time reductions and Cook-Levin reductions, and their applications in proving NP-
completeness.

2. Self-learning topics:
• Non-standard computational models like quantum Turing machines, cellular automata.
• Relationship between computational complexity theory and cryptography.
• Theory of Computation in Machine Learning.

M) Suggested Course Evaluation Matrix: The course teacher has to decide and use the appropriate assessment
strategy and its weightage in theory, laboratory and sessional work for ensuring CO attainment. The
response/performance of the student in each of these designed activities is to be used to calculate CO
attainment.
Course Evaluation Matrix
Theory Assessment (TA)** Term Work Assessment (TWA) Lab Assessment (LA)#
Progressive End Theory Term Work & Self Learning
Theory Assessment Assessment Progressive Lab End Laboratory
Assessment (ETA)
COs Assessment Assessment
(PTA)
Assignments Micro Other (PLA) (ELA)
Class/Mid
Sem Test Projects Activities*
CO-1 20% 20% 20% - 15% - -
CO-2 20% 20% 20% 20% 20% - -
CO-3 20% 20% 20% 20% 20% - -
CO-4 20% 20% 20% 20% 20% - -
CO-5 15% 15% 15% 20% 20% - -
CO-6 5% 5% 5% 20% 05% - -
Total 30 70 20 20 10 - -
Marks 50

Page 5
Diploma in Computer Science & Engineering Semester - IV SBTE, Bihar
Legend:
*: Other Activities include self- learning, seminar, visits, surveys, product development, software development etc.
**: Mentioned under point- (N)
#: Mentioned under point-(O)
Note:
• The percentage given are approximate
• In case of Micro Projects and End Laboratory Assessment (ELA), the achieved marks will be equally divided in all those COs mapped
with total experiments.
• For CO attainment calculation indirect assessment tools like course exit survey need to be used which comprises of questions related
to achievement of each COs.

N) Suggested Specification Table for End Semester Theory Assessment: Specification table represents the
reflection of sample representation of assessment of cognitive domain of full course.
Unit Title and Number Total Relevant Total ETA (Marks)
Classroom COs Marks Remember Understanding Application
Instruction Number(s) (R) (U) & above
(CI)
(A)
Hours
Unit-1.0 Introduction 9 CO-1 14 4 6 4

Unit-2.0 Regular languages and 10 CO-2 14 4 4 6

Finite Automata

Unit 3.0 Context-free languages 11 CO-3 14 4 4 6

and pushdown
automata
Unit 4.0 Context-sensitive 10 CO-4 14 4 6 4
languages and Turing
machines
Unit 5.0 Undecidability 8 CO-5 14 4 4 6
CO-6
Total 48 - 70 20 24 26

Note: Similar table can also be used to design class/mid-term/ internal question paper for progressive assessment.

O) Suggested Assessment Table for Laboratory (Practical): (Not Applicable)

P) Suggested Instructional/Implementation Strategies: Different Instructional/ Implementation Strategies may

be appropriately selected, as per the requirement of the content/outcome. Some of them are Improved
Lecture, Tutorial, Case Method, Group Discussion, Industrial visits, Industrial Training, Field Trips, Portfolio
Based, Learning, Role Play, Live Demonstrations in Classrooms, Lab, Field Information and Communications
Technology (ICT)Based Teaching Learning, Blended or flipped mode, Brainstorming, Expert Session, Video
Clippings, Use of Open Educational Resources (OER), MOOCs etc.

Q) List of Major Laboratory Equipment, Tools and Software: (Not Applicable)

R) Suggested Learning Resources:

(a) Books :
S. Titles Author(s) Publisher and Edition with ISBN
No.
1 Theory of Computation (with Formal R.B. Patel 2nd Edition”, Khanna Book
Languages) Publishing 2020

Page 6