Scribd
Upload
4 views1 page

DSA 2022 Minor Project 1

The document outlines a minor project for a Data Structures and Algorithm course, requiring the creation of a Singly Linked List with specific operations. The project includes a menu-driven program to display the list, find the second largest element, search for occurrences of an element, remove duplicates, and count unique elements. Additionally, students must prepare a description file documenting the process and output, and submit it in a compressed package named after their registration number.

Uploaded by

Subrat Kumar Behera
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
4 views1 page

DSA 2022 Minor Project 1

The document outlines a minor project for a Data Structures and Algorithm course, requiring the creation of a Singly Linked List with specific operations. The project includes a menu-driven program to display the list, find the second largest element, search for occurrences of an element, remove duplicates, and count unique elements. Additionally, students must prepare a description file documenting the process and output, and submit it in a compressed package named after their registration number.

Uploaded by

Subrat Kumar Behera
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/ 1

Data Structures and Algorithm (DSA)

Minor Project-1 (2022)


(Last Date of Submission: 04/07/2021)
*************************************************************************************
Problem Definition: To create a Singly Linked List and perform different operations on it.

Problem Description: Create a Singly Linked List with the following Node structure.
public class Node {
int info;
Node link;
}
Write a menu driven program to perform the following operations.
1. To display the linked list. [1 Points]
2. To find 2nd largest element. [2 Points]
3. To display the reference of all occurances of an element. [3 Points]
4. To remove all nodes with duplicate elements. [5 Points]
5. To count the number of unique elements. [4 Points]

The method headers are:


 void create()
 void display()
 int find2ndMax()
 void search(int)
 void removeDuplicate()
 int countUnique()

(Moreover you can add extra methods if required.)

Note: Create the required classes in a package named same as your registration number.
Prepare a description file (word file) to show the process and output of your project. Save the
description file in the same package. Compress the package and submit.

******

You might also like