Data Structures Lab PCCSL 307 KTU BTech 2024 Scheme and Assessment Methods

 

Course Code	PCCSL307	CIE Marks	50
Teaching Hours/Week (L:T:P:R)	0:0:3:0	ESE Marks	50
Credits	2	Exam Hours	2Hrs.30Min.
Prerequisites(if any)	GXEST 204	Course Type	Lab

Course Objectives:

To give practical experience for learners on implementing different linear and nonlinear data structures, and algorithms for searching and sorting.

Course Assessment Method(CIE: 50 marks, ESE: 50 marks)

Continuous Internal Evaluation Marks(CIE):

Attendance	Preparation/Pre-Lab Work experiments, Viva and Timely completion of Lab Reports/Record (Continuous Assessment)	Internal Examination	Total
5	25	20	50

Continuous Assessment (25 Marks)

1. Preparation and Pre-Lab Work (7 Marks)

    ● Pre-Lab Assignments: Assessment of pre-lab assignments or quizzes that test understanding of the         upcoming experiment.

    ● Understanding of Theory: Evaluation based on students’ preparation and understanding of the
        theoretical background related to the experiments.

2. Conduct of Experiments (7 Marks)
    ● Procedure and Execution: Adherence to correct procedures, accurate execution of
        experiments, and following safety protocols.
    ● Skill Proficiency: Proficiency in handling equipment, accuracy in observations, and
        troubleshooting skills during the experiments.
    ● Teamwork: Collaboration and participation in group experiments.

3. Lab Reports and Record Keeping (6 Marks)
    ● Quality of Reports: Clarity, completeness and accuracy of lab reports. Proper documentation
        of experiments, data analysis and conclusions.
    ● Timely Submission: Adhering to deadlines for submitting lab reports/rough record and
        maintaining a well-organized fair record.

4. Viva Voce (5 Marks)
    ● Oral Examination: Ability to explain the experiment, results and underlying principles
        during a viva voce session.

Final Marks Averaging: The final marks for preparation, conduct of experiments, viva,and record are the average of all the specified experiments in the syllabus.

End Semester Examination Marks(ESE):

 

Procedure/ Preparatory work/Design/ Algorithm	Conduct of experiment/ Execution of work/ troubleshooting/ Programming	Result with valid inference/ Quality of Output	Viva voce	Record	Total
10	15	10	10	5	50

●     Submission of Record:Students shall be allowed for the end semester examination only upon submitting the duly certified record.

●     Endorsement by External Examiner:The external examiner shall endorse the record

 

Evaluation Pattern for End Semester Examination (50 Marks)

1. Procedure/Preliminary Work/Design/Algorithm (10 Marks)

    ● Procedure Understanding and Description: Clarity in explaining the procedure and

        understanding each step involved.
    ● Preliminary Work and Planning: Thoroughness in planning and organizing
        materials/equipment.
    ● Algorithm Development: Correctness and efficiency of the algorithm related to the
        experiment.
    ● Creativity and logic in algorithm or experimental design.

2. Conduct of Experiment/Execution of Work/Programming (15 Marks)
    ● Setup and Execution: Proper setup and accurate execution of the experiment or programming
    task.

3. Result with Valid Inference/Quality of Output (10 Marks)
    ● Accuracy of Results: Precision and correctness of the obtained results.
    ● Analysis and Interpretation: Validity of inferences drawn from the experiment or quality of
        program output.

4. Viva Voce (10 Marks)
    ● Ability to explain the experiment, procedure results and answer related questions
    ● Proficiency in answering questions related to theoretical and practical aspects of the subject.

5. Record (5 Marks)
    ● Completeness, clarity, and accuracy of the lab record submitted

Course Outcomes(COs)

 

At the end of the course students should be able to:

Course Outcome		Bloom’s Knowledge Level(KL)
CO1	Model a real world problem using suitable datastructure and implement the solution.	K3
CO2	Compare efficiency of different datastructures in terms of time and space complexity.	K4
CO3	Evaluate the time complexities of various searching and sorting algorithms.	K5
CO4	Differentiate static and dynamic datastructures in terms of their advantages and application.	K3

Note:K1-Remember, K2-Understand, K3-Apply,K4-Analyse,K5-Evaluate,K6-Create

CO-PO Mapping(Mapping of Course Outcomes with Program Outcomes)

	PO1	PO2	PO3	PO4	PO5	PO6	PO7	PO8	PO9	PO10	PO11	PO12
CO1	3	3	3	3				3				3
CO2	3	3	3	3				3				3
CO3	3	3	3	3				3				3
CO4	3	3	3	3				3				3

1:Slight(Low),2:Moderate(Medium),3:Substantial(High),-:NoCorrelation