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 myList ▪A copy constructor list 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 elements in listmyList.reverse() ▪Merge with another ordered listmyList.merge(aList) Write a thorough test program for this class. Create a Loom video in which you run your program and offer a brief explanation of your implementation. Time analysis should be included. Your video should not exceed 4 minutes in length. Play your video before you submit to ensure that the quality is acceptable. Videos with sound issues will not be considered. Submit the following in LoudCloud: •All code in a single zipped file

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
icon
Concept explainers
Question
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 elements in listmyList.reverse()
▪Merge with another ordered listmyList.merge(aList)
Write a thorough test program for this class. Create a Loom video in which you run your program and offer a brief explanation of your implementation. Time analysis should be included. Your video should not exceed 4 minutes in length. Play your video before you submit to ensure that the quality is acceptable. Videos with sound issues will not be considered.
Submit the following in LoudCloud:
•All code in a single zipped file
Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Types of Linked List
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education