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();

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 2PE

See similar textbooks

Similar questions

5. Construct a function C(V) that counts the number of basic operations for the following algorithm. Then place the algorithm in a time efficiency class. State any assumptions you make. public static ArrayList topologicalSort(Graph dag) { Queue q = new LinkedList(); ArrayList sortOrder = new ArrayList(); int[] inEdgeCounts = new int[dag.size()]; for(int i = 0; i < inEdgeCounts.length; i++) { inEdgeCounts[i] = 0; } for(int i = 0; i < inEdgeCounts.length; i++) { dag.getAdjList(i).stream().forEach((x) -> inEdgeCounts[x]++); } // Identify sources for(int i = 0; i < inEdgeCounts.length; i++) { if(inEdgeCounts[i] == 0) { q.add(i); } } while(!q.isEmpty()) { int currVertex = q.remove(); sortOrder.add(currVertex); ArrayList adjList = dag.getAdjList(currVertex); // Remove edges for this node for(Integer adjVertex:…
1. Implement a function insertBook(Book newBook) to add a book at the end of thelinked list.a. Ask the librarian to input all the necessary book information.b. Use the information to create a Book objectc. Pass through the Book object as the parameter to the functiond. Store the Book object into the Node objecte. “Link” the object with the rest of the linked list2. Implement a function insertBefore(Book newBook, int bookID) to add a book infront of another book given its bookID.a. Ask the librarian to input all the necessary book information.b. Use the information to create a Book objectc. Pass through the Book object and bookID as the parameter to the functiond. Search for the matching Book objecte. Store the Book object into the Node objectf. “Link” the object with the rest of the linked list3. Implement a function searchBook(int bookID) to search for a book by its bookIDcode and return the book object.a. Ask the librarian to input the bookID.b. If the book doesn’t exist display an…
SOB 22 – (Block 2)Write up what the properties of sets, lists, vectors and strings are and whether they are mutable or immutable. Then consider the class of problems that they are best for and use some code to illustrate your points. E.g., if you have a function that solves a problem using lists, then you can say why you can/can’t use vectors for it or sets etc.
compare and contrast static array-based unsorted list and static array-based sorted list, There is a function binary search in the sorted list one. Which two public functions are using the binary search function so that it can be faster than utilizing a linear search?
Let xHead, yHead and zHead be the head pointers of 3 linked lists of integers (called X-list, Y-list and Z-list, respectively, from here). X-list and Y-list are each sorted (in non-decreasing order) in itself and each may be empty. Z-list is initially empty (i.e., zHead initially contains the null pointer). Develop and test a recursive C++ function called Merge2AscListsRecur that combines the nodes in X-list and Y-list into Z-list such that, after calling the function, Z-list is a sorted list (in non-decreasing order) containing all the nodes initially contained in X-list and Y-list – X-list and Y-list should both be empty after the call. Other specifications/requirements: ● Each node of the list has the following structure: struct Node{ int data; Node *link;}; ● The function should: ► Have only three parameters (each a pointer-to-Node) and no return value (be a void function). ► Not use any global variables or static local…
Consider the following function that takes reference to head of a Doubly Linked List as parameter. Assume that anode of doubly linked list has previous pointer as prev and next pointer as next.void fun(struct node **head_ref){struct node *temp = NULL;struct node *current = *head_ref;while (current != NULL){temp = current->prev;current->prev = current->next;current->next = temp;current = current->prev;}if(temp != NULL )*head_ref = temp->prev;}Assume that reference of head of following doubly linked list is passed to above function 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6. What should be the modified linked list after the function call? Note: solve as soon as possible
SOB 22 – (Block 2) Write up what the properties of sets, lists, vectors and strings are and whether they are mutable or immutable. Then consider the class of problems that they are best for and use some code to illustrate your points. E.g., if you have a function that solves a problem using lists, then you can say why you can/can’t use vectors for it or sets etc. Note: I need code examples.
Suppose you have two objects of Doubly Linked List D1 and D2. Each object is representing a different Doubly Linked List. Write a function to concatenate both doubly linked lists. The concatenation function must return the address of head node of concatenated Doubly Linked List, and it must take two Node* parameters. You need to keep in mind all exceptional cases for example what if either one of the doubly linked lists is empty? Perform this task on paper, take a clear picture of solution and paste it in answer section.
Create a function set(v, i, j) that makes vector v contain the integers i through j. The original contents of v is deleted. The vector is left empty ifj < i. The argument v is a vector of integers.
okl ook sk ook ok o st s ook skl ok sk s ki sl ok sk ok sk s ok ks ok sk ok ook ok 01 (A) Create the following matrix K K= K = 0.25 0.5 0:75 1:0 125 15 1:75 2 4 6 8 10 12 14 25 30 35 40 45 50 55 And answer the following: (a) Create a matrix Ga such that its first row includes the elements of the second column of K followed by the elements of the fifth column of K, the second row of Ga include the first six elements of the second row of K, and the third row of Ga includes the last six elements of the third row of K. (b) Create a matrix Gb in which the first two rows and columns 3 through 6 of K.
Let xHead, yHead and zHead be the head pointers of 3 linked lists of integers (called X-list, Y-list and Z-list, respectively, from here). X-list and Y-list are each sorted (in non-decreasing order) in itself and each may be empty. Z-list is initially empty (i.e., zHead initially contains the null pointer). Develop and test a recursive C++ function called SortedMergeRecur that combines the nodes in X-list and Y-list into Z-list such that, after calling the function, Z-list is a sorted list (in non-decreasing order) containing all the nodes initially contained in X-list and Y-list – X-list and Y-list should both be empty after the call. Other specifications/requirements: ● Each node of the list has the following structure: struct Node{ int data; Node *link;}; ● The function should: ► Have only three parameters (each a pointer-to-Node) and no return value (be a void function). ► Not use any global variables or static local…
USING C++ Find and delete the node with the smallest info in the list. (Delete only the first occurrence and traverse the list only once.) Add these as abstract functions in the class linkedListType and provide the definitions of these functions in the class unorderedLinkedList. Also, write a program to test these functions. PLS USE THIS CLASS TYPES