Scribd
Upload
24 views3 pages

CD3281 - DSA Rubrics

Uploaded by

Yobu D Job
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
24 views3 pages

CD3281 - DSA Rubrics

Uploaded by

Yobu D Job
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/ 3

ACADEMIC YEAR 2024 – 2025 ODD SEMESTER

Department Name COMPUTER SCIENCE AND ENGINEERING

Year & Semester II & 3rd SEMESTER

Name of the Lab Course CD3281- DATA STRUCTURE & ALGORITHMS LABORATORY

Name of the Evaluator MR.YOBU

Name of the Student


Marks Scored out of 40

RUBRICS ASSESSMENT FOR LAB COURSE

Performance Index (PIs)


Performance Factors Level 1 Level 2 Level 3 Level 4
PIs
/ Description 1 Mark 2 Marks 3 Marks 4 Marks
The fundamental The fundamental The fundamental The fundamental
understanding of understanding of pre- understanding of understanding of pre-
Basic Knowledge of pre-lab questions lab questions and pre-lab questions and lab questions and
PI-1
the Experiment and objectives of objectives of the objectives of the objectives of the
the exercise is not exercise is Partially exercise is exercise is Highly
Satisfactory Satisfactory Satisfactory Satisfactory
The fundamental The fundamental The fundamental The fundamental
understanding of understanding of understanding of understanding of
program like program like algorithm, program like program like
Writing Code /
PI-2 algorithm, flowchart flowchart and algorithm, flowchart algorithm, flowchart
Program
and execution of the execution of the and execution of the and execution of the
exercise is not exercise is Partially exercise is exercise is Highly
Satisfactory Satisfactory Satisfactory Satisfactory
Test Case of the Test Case of the
Test Case of the Test Case of the
program feed to the program feed to the
program feed to the program feed to the
input from low, input from low,
Test Case input from low, input from low,
PI-3 average and high average and high
Verification average and high average and high
values of the values of the exercise
values of the exercise is values of the exercise
exercise is not is Highly
Partially Satisfactory is Satisfactory
Satisfactory Satisfactory
Viva voce / Oral Viva voce / Oral Viva voce / Oral Viva voce / Oral
Viva voce / Oral presentation of the presentation of the presentation of the presentation of the
PI-4
Presentation exercise is not exercise is Partially exercise is exercise is Highly
Satisfactory Satisfactory Satisfactory Satisfactory
Awareness of the Awareness of the usage Awareness of the Awareness of the
Usage of this
usage of this of this exercise into usage of this exercise usage of this exercise
experiment into the
PI-5 exercise into the the real time into the real time into the real time
Real Time
real time application application is Partially application is application is Highly
Application
is not Satisfactory Satisfactory Satisfactory Satisfactory
ASSESSMENT SHEET

Ex. Page
Date Name of the experiment No.
PI-1 PI-2 PI-3 PI-4 PI-5 Total Sign
No.
1. Implement simple ADTs as Python
classes
a) Implementation of Recursive
2. Algorithm (Factorial)
b) Implementation of Recursive
Algorithm (Fibonacci Series)
Average
3.
List ADT using Python Arrays
(a) Implementation of Singly Linked List
(b) Implementation of Doubly Linked
4.
List
(c) Implementation of Circular Linked
List
Average
5. Implementation of Stack
Implementation of Queue
Average
Applications of List
6.
Applications of Stack
Applications of Queue
Average
Implementation of Merge Sort
7. Implementation of Quick Sort
Implementation of Linear Search
Implementation of Binary Search
Average
8.
Implementation of Hash Table
9. Implementation of Tree Representation
and Traversal Algorithm
10.
Implementation of Binary Search Tree
11.
Implementation of Heap

12. Implementation of Breadth First Search

Implementation of Depth First Search


13. Implementation of Single Source
Shortest Path Algorithm
14. Implementation of Minimum Spanning
Tree
Total marks

Internal Marks = (Total marks / No. of experiment) X 2

Marks Scored out of 40 =


Signature of the Evaluator

You might also like