Scribd
Upload
29 views2 pages

Dsa Itda 225 Lab Project

Uploaded by

cedebat975
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views2 pages

Dsa Itda 225 Lab Project

Uploaded by

cedebat975
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

NATIONAL UNIVERSITY OF MODERN LANGUAGES

FAISALABAD CAMPUS

Faculty of Engineering and Computing


-----------------------------------------------------------------------------
ITDA-225: Data Structures & Algorithms
Spring 2024
Lab Major Project  [Marks: 15]
Due on: 13-05-2024, Monday, 12:00 P.M
_____________________________________________________________________________

Project Title: Implementing a Basic Data Structure and Algorithm

Objective: The objective of this lab project is to reinforce your understanding of fundamental data
structures and algorithms through hands-on coding. You will be required to implement a specific
data structure and a related algorithm, as well as analyze the performance of your implementation.

Instructions

Part 1: Data Structure Implementation


Choose one of the following data structures to implement:
1. Linked List: Implement a singly linked list with basic operations like insertion, deletion,
and traversal.
2. Stack: Implement a stack with push, pop, and peek operations.
3. Queue: Implement a queue with enqueue and dequeue operations.
4. Binary Search Tree (BST): Implement a binary search tree with basic operations like
insertion, deletion, and searching.

Part 2: Algorithm Implementation


Choose one of the following algorithms to implement, which should work with the data structure
you've implemented in Part 1:
1. Search Algorithm: Implement a search algorithm like linear search or binary search.
2. Sorting Algorithm: Implement a sorting algorithm like bubble sort, selection sort, or merge
sort.
3. Traversal Algorithm: Implement an algorithm to traverse your data structure, e.g., in-order
traversal for a binary search tree.
Part 3: Performance Analysis
Conduct a performance analysis of your data structure and algorithm implementation. You should:
1. Measure the time it takes to perform key operations (e.g., insertion, deletion, search,
sorting).
2. Analyze and compare the performance of your implementation under different scenarios,
e.g., for different input sizes.
3. Discuss the time complexity of the operations and how closely your measurements match
the expected time complexities.

Submission Guidelines:
1. Your implementation should be written in a programming language of your choice (e.g.,
C++, Java, Python).
2. Document your code thoroughly with comments.
3. Create a report that includes:
 A description of your data structure and algorithm.
 Implementation details and code snippets.
 Performance analysis results.
 Discussion and conclusions about your analysis.

Grading Criteria:
Your assignment will be graded based on the following criteria:
1. Correctness of the data structure and algorithm implementations.
2. Code quality and documentation.
3. Performance analysis and discussion.
4. Presentation and clarity of the report.

Additional Notes:
 You may seek help from course resources and reference materials but avoid direct copying
of code.
 Submit your project on the specified due date, following your instructor's submission
guidelines.
Please adapt the assignment as needed to align with the specific learning outcomes and
expectations of your course.

Good Luck
**********************************************************

You might also like