CSE225L – Data Structures and Algorithms Lab Lab 11 Sorted List (linked list based) In today's lab we will design and implement the List ADT where the items in the list are sorted. sortedtype.h template void SortedType::InsertItem (ItemType item) tifndef SORTEDTYPE H INCLUDED NodeType* newNode; NodeType* predLoc; NodeType location; bool moreToSearch; idefine SORTEDTYPE H INCLUDED template class SortedType location = listData; predLoc = NULL; moreTosearch = (location != NULL); while (moreToSearch) struct NodeType ItemType info; NodeType next; if (location->info < item) public: SortedType () ; -SortedType (): bool IsFul1(); int LengthIs (); void MakeEmpty (); void RetrieveItem (ItemTypes, predLoc = location; location = location->next: moreTosearch = (location != NULL); else moreToSearch false; bool&); newNode - new NodeType; newNode->info = item; void InsertItem(ItemType) ; void DeleteItem (ItemType) ; void ResetList (): void GetNextItem (ItemType&); private: NodeType 1ist Data; int length; NodeType current Pos; if (predLoc - NULL) newNode->next = listData; listData = newNode; else newNode->next = location; predLoc->next = newNode; tendif // SsORTEDTYPE H INCLUDED sortedtype.cpp length++; #include "sortedtype.h" tinclude template void SortedType::DeleteItem (ItemType item) using namespace std; NodeType location - listData; template SortedType::SortedType () NodeType* tempLocation; if (item - listData->info) length = 0; listData = NULL; currentPos = NULL; tempLocation = location; listData = listData->next; else template int SortedType:: LengthIs () while (! (item== (location->next)->info)) location = location->next; tempLocation = location->next; location->next = (location->next)->next; return length; template bool SortedType::ISFull () delete tempLocation; length--; NodeType location; try location = new NodeType: delete location; return false; catch (bad_allocs exception) return true;

What is the biggest advantage of linked list over array? Group of answer choices Unlike array, linked list can dynamically grow and shrink With linked list, it is faster to access a specific element than with array Linked list is easier to implement than array Unlike array, linked list can only hold a fixed number of elements

Computer Science lab3.h ------------- #include<stdio.h> #include<stdlib.h> #ifndef LAB3_H #define LAB3_H // A linked list node struct Node { int data; //Data struct Node *next; // Address to the next node }; //initialize: create an empty head node (whose "data" is intentionally missing); This head node will not be used to store any data; struct Node *init () { //create head node struct Node *head = (struct Node*)malloc(sizeof(struct Node)); } //Create a new node to store data and insert it to the end of current linked list; the head node will still be empty and data in the array in "main.c" are not stored in head node void insert(struct node *head, int data) { struct Node *newNode = (struct Node*)malloc(sizeof(struct Node));   new_node->data = data; new_node->next= head; } //print data for all nodes in the linked list except the head node (which is empty) void display (struct Node *head) { struct Node *current_node = head; while ( current_node != NULL) { printf("%d ",…

Using Fundamental Data Structures     Purpose:      The purpose of this: Design and develop Applications that incorporate fundamental data structures such as: Singly Linked Lists Doubly Linked Lists Circularly Linked Lists   Exercise 3   If your first name starts with a letter from A-J inclusively: Implement the clone() method for the CircularlyLinkedList class. Make sure to properly link the new chain of nodes.     If your first name starts with a letter from K-Z inclusively: Let L1 and L2 be two circularly linked lists created as objects of CircularlyLinkedList class from Lesson. Write a method that returns true if L1 and L2 store the same sequence of elements (but perhaps with different starting points). Write the main method to test the new method. Hint: Try to find a matching alignment for the first node of one list.

C++The List class represents a linked list of dynamically allocated elements. The list has only one member variable head which is a pointer that leads to the first element. See the following code for the copy constructor to List. List (const List & list) {          for (int i = 0; i <list.size (); i ++)       {                    push_back (list [i]);           } } What problems does the copy constructor have? Select one or more options: 1. List (const List & list) {} does not define a copy constructor. 2. The list parameter should not be constant. 3. The new elements will be added to the wrong list. 4. Copy becomes shallow rather than deep. 5. The copy will create dangling pointers. 6. Copying will create memory leaks. 7. The condition must be: i <size () 8. head is never initialized.

Project 2: Singly-Linked List The purpose of this assignment is to assess your ability to: ▪Implement sequential search algorithms for linked list structures ▪Implement sequential abstract data types using linked data ▪Analyze and compare algorithms for efficiency using Big-O notation For this assignment, you will implement a singly-linked node class. Use your singly-linked node to implement a singly-linked list class that maintains its elements in ascending order. The SinglyLinkedList class is defined by the following data: ▪A node pointer to the front and the tail of the list Implement the following methods in your class: ▪A default constructor list<T> myList ▪A copy constructor list<T> myList(aList) ▪Access to first elementmyList.front() ▪Access to last elementmyList.back() ▪Insert value myList.insert(val) ▪Remove value at frontmyList.pop_front() ▪Remove value at tailmyList.pop_back() ▪Determine if emptymyList.empty() ▪Return # of elementsmyList.size() ▪Reverse order of…

DS

Make List Items Uppercase 2 in python Define the function make_uppercase(mylist), which takes a list parameter mylist (a list of strings), mutates the list by uppercasing each string in mylist. The function returns None.  For example, if mylist is ['cat', 'Dog', 'frOG'], then the mutated list should  be ['CAT', 'DOG', 'FROG'].    For example: Test Result mylist = ['cat', 'Dog', 'frOG'] result = make_uppercase(mylist) print(mylist) if result != None: print("Error, return value should be None") ['CAT', 'DOG', 'FROG'] mylist = ['baNanas', 'appLes', 'pEAches', 'PEArs'] result = make_uppercase(mylist) print(mylist) if result != None: print("Error, return value should be None") ['BANANAS', 'APPLES', 'PEACHES', 'PEARS']