Faculty of Computer and Mathematical Sciences (FSKM) consists of two (2) departments namely Department of Computer Science (DCS) and Department of Mathematic and Statistics (DMS). Assume that all courses offered by DCS starts with "CSC" and courses offered by DMS starts with "MAT". The following LinkedList ADTS are used to represent the information of courses offered by both departments: Lecture, ArrayList and public class Lecture private String CourseCode; private String day; private String time; private String venue; private int numOfStudent; //csc238, MAT183, etc //Monday, Tuesday, etc //8.00am,2.30pm, etc //BK1, LT5, etc //30, 50, 100, 150, etc public Lecture ( String, String, String, String, int ) {.….} public String getCode () {...} public String getDay () {...} public String getTime () {….} public String getVenue () {...} public int getNoStudent (){..} public String toString () {...} public class ArrayList public void get(); public void add (Object elem); public Object remove () ; public int size(); public class LinkedList private Node first, last; public void insertAtFront (Object elem); public Object removeFromFront (); public Object getFirst (); public Object getNext(); public boolean isEmpty();
Faculty of Computer and Mathematical Sciences (FSKM) consists of two (2) departments namely Department of Computer Science (DCS) and Department of Mathematic and Statistics (DMS). Assume that all courses offered by DCS starts with "CSC" and courses offered by DMS starts with "MAT". The following LinkedList ADTS are used to represent the information of courses offered by both departments: Lecture, ArrayList and public class Lecture private String CourseCode; private String day; private String time; private String venue; private int numOfStudent; //csc238, MAT183, etc //Monday, Tuesday, etc //8.00am,2.30pm, etc //BK1, LT5, etc //30, 50, 100, 150, etc public Lecture ( String, String, String, String, int ) {.….} public String getCode () {...} public String getDay () {...} public String getTime () {….} public String getVenue () {...} public int getNoStudent (){..} public String toString () {...} public class ArrayList public void get(); public void add (Object elem); public Object remove () ; public int size(); public class LinkedList private Node first, last; public void insertAtFront (Object elem); public Object removeFromFront (); public Object getFirst (); public Object getNext(); public boolean isEmpty();
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
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
a) move all “CSC” course into a linked list named CSC_LL and “MAT” course into a linked list named MAT_LL.
b) Count and display the number of “MAT” lectures that has more than 100 students.
Transcribed Image Text:Faculty of Computer and Mathematical Sciences (FSKM)
consists of two (2) departments namely Department of
Computer Science (DCS) and Department of Mathematic
and Statistics (DMS). Assume that all courses offered by
DCS starts with "CSC" and courses offered by DMS starts
with "MAT". The following Lecture,
LinkedList ADTS are used to represent the information of
courses offered by both departments:
ArrayList and
public class Lecture
private String CourseCode;
private String day;
private String time;
private String venue;
private int numOfStudent;
//csc238, MAT183, etc
//Monday, Tuesday, etc
//8.00am, 2.30pm, etc
//BK1, LT5, etc
//30, 50, 100, 150, etc
public Lecture ( String, String, String, String, int ) {.….}
public String getCode () {...}
public String getDay() {...}
public String getTime ( {...}
public String getVenue () {...}
public int getNoStudent(){...}
public String toString () {...}
public class ArrayList
|{
public void get();
public void add (Object elem);
public Object remove ();
public int size ();
public class LinkedList
private Node first, last;
public void insertAtFront (Object elem);
public Object removeFromFront ();
public Object getFirst ();
public Object getNext ();
public boolean isEmpty () ;
Assume that an arraylist named LectureList has been
inserted with 10 objects, write program fragment for each of
the following tasks:
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 1 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
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education