Lab Report Assignment

Topic: Implementation and Operations of Core Data Structures
Total Marks: 25
Submission Deadline: 20.04.205
Submission Format: Typed report (PDF) with code screenshots and output, or .zip file with code + PDF report.

Objective:

To test your practical understanding of data structure implementation and operations through programming exercises.

You are required to individually implement the following data structures and perform key operations on each. Submit a structured lab report with:

• Source code (with comments)

• Screenshots of execution/output

• Brief explanation of each operation

1. Linked List Implementations (6 Marks)

• Create and display a Singly Linked List – insert at beginning, middle, end – and delete operations. (2 marks)

• Create a Doubly Linked List with insert and delete operations. (2 marks)

• Implement a Circular Linked List and show traversal. (2 marks)

2. Stack and Queue (4 Marks)

• Implement Stack using array or linked list – perform push, pop, and display. (2 marks)

• Implement Queue (linear or circular) – perform enqueue, dequeue, and display. (2 marks)

3. Binary Tree (6 Marks)

• Create a Binary Tree – insert nodes manually or from input. (2 marks)

• Traverse the tree using In-order, Pre-order, and Post-order traversals. (2 marks)

• Show clear output demonstrating the traversals. (2 marks)

4. Binary Search Tree (BST) (6 Marks)

• Create a BST and insert elements. (2 marks)

• Perform search and delete operations. (2 marks)

• Show in-order traversal after insertion and deletion to validate structure. (2 marks)

5. Presentation & Code Clarity (3 Marks)

• Clean, readable code with appropriate comments (1 mark)

• Proper screenshots and formatting (1 mark)

• Explanation of logic used in your own words (1 mark)

Submission Guidelines:

• Submit a single PDF containing:

  • Explanation + Code Snippets (screenshots allowed)

  • Output Screenshots

  • Student Name, ID, and Section

• Optionally submit .zip folder containing full source code.