1)Write a Java program which stores three values by using singly linked list. - Node class 1. stuID, stuName, stuScore, //data fields 2. constructor 3. update and accessor methods - Singly linked list class which must has following methods: 1. head, tail, size// data fields 2. constructor 3. update and accessor methods a. getSize() //Returns the number of elements in the list. b. isEmpty( ) //Returns true if the list is empty, and false otherwise. c. getFirstStuID( ), getStuName( ), getFirstStuScore( ) d. addFirst(stuID, stuName, stuScore) e. addLast(stuID, stuName, stuScore) f. removeFirst ( ) //Removes and returns the first element of the list. g. displayList( ) //Displays all elements of the list by traversing the linked list. - Test class – initialize a singly linked list instance. Test all methods of singly linked list class.
1)Write a Java program which stores three values by using singly linked list. - Node class 1. stuID, stuName, stuScore, //data fields 2. constructor 3. update and accessor methods - Singly linked list class which must has following methods: 1. head, tail, size// data fields 2. constructor 3. update and accessor methods a. getSize() //Returns the number of elements in the list. b. isEmpty( ) //Returns true if the list is empty, and false otherwise. c. getFirstStuID( ), getStuName( ), getFirstStuScore( ) d. addFirst(stuID, stuName, stuScore) e. addLast(stuID, stuName, stuScore) f. removeFirst ( ) //Removes and returns the first element of the list. g. displayList( ) //Displays all elements of the list by traversing the linked list. - Test class – initialize a singly linked list instance. Test all methods of singly linked list class.
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter17: Linked Lists
Section: Chapter Questions
Problem 18SA
Related questions
Concept explainers
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
Question
1)Write a Java program which stores three values by using singly linked list.
- Node class
1. stuID, stuName, stuScore, //data fields
2. constructor
3. update and accessor methods
- Singly linked list class which must has following methods:
1. head, tail, size// data fields
2. constructor
3. update and accessor methods
a. getSize() //Returns the number of elements in the list.
b. isEmpty( ) //Returns true if the list is empty, and false otherwise.
c. getFirstStuID( ), getStuName( ), getFirstStuScore( )
d. addFirst(stuID, stuName, stuScore)
e. addLast(stuID, stuName, stuScore)
f. removeFirst ( ) //Removes and returns the first element of the list.
g. displayList( ) //Displays all elements of the list by traversing the linked list.
- Test class – initialize a singly linked list instance. Test all methods of singly linked list class.
- Node class
1. stuID, stuName, stuScore, //data fields
2. constructor
3. update and accessor methods
- Singly linked list class which must has following methods:
1. head, tail, size// data fields
2. constructor
3. update and accessor methods
a. getSize() //Returns the number of elements in the list.
b. isEmpty( ) //Returns true if the list is empty, and false otherwise.
c. getFirstStuID( ), getStuName( ), getFirstStuScore( )
d. addFirst(stuID, stuName, stuScore)
e. addLast(stuID, stuName, stuScore)
f. removeFirst ( ) //Removes and returns the first element of the list.
g. displayList( ) //Displays all elements of the list by traversing the linked list.
- Test class – initialize a singly linked list instance. Test all methods of singly linked list class.
2. Write a Java program which stores three values by using doubly linked list.
- Node class
4. stuID, stuName, stuScore, //data fields
5. constructor
6. update and accessor methods
- Singly linked list class which must has following methods:
4. head, tail, size// data fields
5. constructor
6. update and accessor methods
a. getSize() //Returns the number of elements in the list.
b. isEmpty( ) //Returns true if the list is empty, and false otherwise.
c. getFirstStuID( ), getStuName( ), getFirstStuScore( )
d. addFirst (stuID, stuName, stuScore)
e. addLast(stuID, stuName, stuScore)
f. removeFirst( ) //Removes and returns the first element of the list.
g. removeLast( ) //Removes and returns the first element of the list.
h. displayList( ) //Displays all elements of the list by traversing the linked list.
- Test class – initialize a doubly linked list instance. Test all methods of doubly linked list class.
- Node class
4. stuID, stuName, stuScore, //data fields
5. constructor
6. update and accessor methods
- Singly linked list class which must has following methods:
4. head, tail, size// data fields
5. constructor
6. update and accessor methods
a. getSize() //Returns the number of elements in the list.
b. isEmpty( ) //Returns true if the list is empty, and false otherwise.
c. getFirstStuID( ), getStuName( ), getFirstStuScore( )
d. addFirst (stuID, stuName, stuScore)
e. addLast(stuID, stuName, stuScore)
f. removeFirst( ) //Removes and returns the first element of the list.
g. removeLast( ) //Removes and returns the first element of the list.
h. displayList( ) //Displays all elements of the list by traversing the linked list.
- Test class – initialize a doubly linked list instance. Test all methods of doubly linked list class.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 5 images
Knowledge Booster
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.Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning