Question

(Programming) Use p2-1 linkedListClass as a reference, add the following operations in the class LinkedList Find the average data values of the linked list. Find the item with largest key, and then delete the node. Test ALL operations in the Main method. (Also display the average of the data values of the linked list, the largest key, the linked list before and after deleting the node with the largest key 6. 7. (Programming) Modify p2-1 SingleLinedList programs so that it handles employee objects. Make your program menu-driven. The class employee is the same as in Assignment 2: laport Java.util.scaner pubiic class esployee public int Ld public String nane public double salary public vold Input O Systen.out.printin( "Enter nane:) nane- new Scanner(Systos.in) nextLine Systes.out.printin("Enter 0 d-Integer parsetat (new sanner (Systes.In) nextin) Systee.out.printinf Enter Salary alary Double.parseboublenow Scanner(Syston.1n).nextl)) public vold Output Systen.out.printane: iSs, 10: 25, Grade: ass"nane, 10, salary) blic String tostring

P1 is below

package p6_linkedList;

import java.util.*;

public class LinkedList

{

public Node header;

public LinkedList()

{

header = null;

}

public final Node Search(int key)

{

Node current = header;

while (current != null && current.item != key)

{

current = current.link;

}

return current;

}

public final void Append(int newItem)

{

Node newNode = new Node(newItem);

newNode.link = header;

header = newNode;

}

public final Node Remove()

{

Node x = header;

if (header != null)

{

header = header.link;

}

return x;

}

public final Node searchPrevious(int key)

{

if (header == null)

{

return header;

}

else

{

Node current = header;

while (!(current.link == null) && (current.link.item != key))

{

current = current.link;

}

return current;

}

}

public final void Insert(int newItem, int preKey)

{

Node current;

Node newNode = new Node(newItem);

current = Search(preKey);

if (current == null)

{

System.out.println("there is no such preKey!");

}

else

{

newNode.link = current.link;

current.link = newNode;

}

}

public final void Delete(int key)

{

if (header == null) // The list is empty!

{

System.out.println("The list is empty!");

}

else

{

if (header.item == key) // The only node in the list is to be deleted.

{

header = header.link;

}

else // The list has more than one node.

{

Node p = searchPrevious(key);

if (p.link == null)

{

System.out.println("There is no such item!");

}

else

{

p.link = p.link.link;

}

}

}

}

public final void ShowLinkedList()

{

if (header == null)

System.out.println("The list is empty!");

else

{

Node current = header;

System.out.printf("%1$s->", current.item);

while (!(current.link == null))

{

current = current.link;

System.out.printf("%1$s->", current.item);

}

System.out.printf("null");

System.out.println();

}

}

public final void PrintList()

{

if (header == null)

{

System.out.println("The list is empty!");

}

else

{

Node current = header;

System.out.println(current.item);

while (!(current.link == null))

{

current = current.link;

System.out.println(current.item);

}

}

}

}

Answer 1

Explanation:

Below is the C# code for above problem with proper description provided within comments itself. Below code some sample output screenshots are attached.

C# code :

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace SingleLinkedListAllinOne
{
class Node
{
public int element;
public Node link;

public Node()
{
element = -1;
}

public Node(int n)
{
element = n;
}

}

class LinkedList
{
public Node header;
public LinkedList()
{
header = null;
}

// -------------------------------------------------------------
public bool isEmpty() // true if no nodes
{
return header == null;
}
// -------------------------------------------------------------

public Node Search(int KEY)
{
Node current = header;
while (current != null && current.element != KEY)
current = current.link;
return current;
}

public void ShowLinkedList()
{
if (header == null)
Console.WriteLine("The list is empty!");
else
{
Node current = header;
Console.Write("{0}->", current.element);
while (!(current.link == null))
{
current = current.link;
Console.Write("{0}->", current.element);

}
Console.Write("null");
Console.WriteLine();
}
}

public Node searchPrevious(int KEY)
{
if (header == null)
return header;
else
{
Node current = header;
if (current.element == KEY)
return null;
while (!(current.link == null) && (current.link.element != KEY))
current = current.link;
return current;
}
}

public void Insert(int newItem, int preKey)
{
Node current;
Node newNode = new Node(newItem);
current = Search(preKey);
newNode.link = current.link;
current.link = newNode;
}

public void Delete(int KEY)
{
if (header.element == KEY)
header = header.link;
else
{
Node p = searchPrevious(KEY);
if (p.link == null)
Console.WriteLine("there is no such item.");
if (!(p.link == null))
p.link = p.link.link;
}
}

public void Append(int newItem)
{
Node newNode = new Node(newItem);
newNode.link = header;
header = newNode;
}

public void Remove()
{
if (header != null)
header = header.link;
}

// function to find the average of all data values
public float averageDataValues() {
// check whether list is empty or not
if (header == null) {
Console.WriteLine("The list is empty!");
return 0;
}
else
{
Node current = header;
// intial count and total is 0
int total = 0, count = 0;
// loop for find total or all data values and total number of data values
while (current != null) {
// add current element in total
total = total + current.element;
// increament the count
count++;
// proceed to next link
current = current.link;
}

// return average
return total/count;
}
}

// function to find avergae of all data values and delete the aprticular item
public void findLargestAndDelete() {
// check whether list is empty or not
if (header == null)
Console.WriteLine("The list is empty!");
else
{
Node current = header;
// initial largest value
int largest = header.element;
// loop to find largest element
while (current != null) {
// check largest b/w current element and largest one
if(largest < current.element) {
// set to largest
largest = current.element;
}
// next link
current = current.link;
}
// call for delete the largest element
Delete(largest);
}
}

}

class SingleLinkedList
{
static int ShowMenu()
{
Console.WriteLine("\n\tLinked List Testing Program\n");
// add two sub menu also
Console.WriteLine("\nEnter the operation number: \n(1)Output\n(2)Insert\n(3)Search\n(4)Remove\n(5)Deletion\n(6)Append\n(7)Avergae Data value\n(8)Find largest key element & Delete it\n(9)Exit\n\n");
return int.Parse(Console.ReadLine());
}
static void Main(string[] args)
{
LinkedList LL = new LinkedList();

int sel = 0;
// increase 2 sub menu so now 7 to 9
while (sel != 9)
{
sel = ShowMenu();
switch (sel)
{
case 1: //Output
Console.WriteLine("The current data in the list: ");
LL.ShowLinkedList();
break;
case 2: //Insert
if (LL.isEmpty())
{
Console.WriteLine("Empty list...Append first!");
break;
}
Console.WriteLine("Before insert: ");
LL.ShowLinkedList();
Console.Write("Enter a value to insert: ");
int x = int.Parse(Console.ReadLine());
Console.Write("Enter where to insert: ");
int pos = int.Parse(Console.ReadLine());
LL.Insert(x, pos);
Console.WriteLine("After insert: ");
LL.ShowLinkedList();
break;
case 3: //Search
Console.Write("Enter target to search for: ");
int target = int.Parse(Console.ReadLine());
Node found = LL.Search(target);
if (found != null)
Console.WriteLine("{0} is found.", found.element);
else
Console.WriteLine("{0} is not found.", target);
break;
case 4: //Remove
Console.WriteLine("Before remove: ");
LL.ShowLinkedList();
LL.Remove();
Console.WriteLine("After remove: ");
LL.ShowLinkedList();
break;
case 5:
Console.WriteLine("Before delete: ");
LL.ShowLinkedList();
Console.WriteLine("Enter the number to delete: ");
int d = int.Parse(Console.ReadLine());
LL.Delete(d);
Console.WriteLine("After delete: ");
LL.ShowLinkedList();
break;
case 6:
Console.Write("Enter value to append: ");
int x_appd = int.Parse(Console.ReadLine());
LL.Append(x_appd);
LL.ShowLinkedList();
break;
// case for find averageDataValues
case 7:
// call function averageDataValues()
float value = LL.averageDataValues();
Console.WriteLine("Avergae of data values is : {0}" , value);
break;
// case to delete largest node
case 8:
// call function findLargestAndDelete
LL.findLargestAndDelete();
Console.WriteLine("Largest key element deleted.");
break;
case 9:
Console.WriteLine("End of the testing. Goodbye!\a\a");
break;

default: Console.WriteLi
ne("Invalid input!");
break;
}
}

///////////////////////////////////////////////////////////////

}
}
}

Sample Output :

--------------------------------------------------------End-------------------------------------------------