11. An ordered linked list of characters has been constructed using the array-based mplementation. The following diagram has a linked list pointed by first where items are in alphabetical order and another linked list pointed by free that has available pool of nodes. Node data next iv. first-3 free = 5 first-3 0 free = 5 1 2 first-3 3 free = 5 4 5 Node 0 1 Write in order the contents (data) of the nodes of the linked list pointed by first. 2 List the address (index) of the nodes in the storage pool pointed by free in the order in which they are linked together. iii. Show the changes in the data and next members of the nodes and the values of first and free after the letter D is inserted in the linked list so that the linked list is still in alphabetical order. Make changes in this figure where necessary 3 4 5 Node 0 1 2 H 3 X 4 P E F 5 B 7 C M data H X P E F Show the changes in the data and next members of the nodes and the values of first and free after the front item of the linked list pointed by first (node index #3) is deleted. Make changes in this figure where necessary. B C M data H 2 6 X 0 1 P E F 4 B C -1 M next 2 6 0 1 4 next 7 2 6 0 1 4 -1

11. An ordered linked list of characters has been constructed using the array-based mplementation. The following diagram has a linked list pointed by first where items are in alphabetical order and another linked list pointed by free that has available pool of nodes. Node data next iv. first-3 free = 5 first-3 0 free = 5 1 2 first-3 3 free = 5 4 5 Node 0 1 Write in order the contents (data) of the nodes of the linked list pointed by first. 2 List the address (index) of the nodes in the storage pool pointed by free in the order in which they are linked together. iii. Show the changes in the data and next members of the nodes and the values of first and free after the letter D is inserted in the linked list so that the linked list is still in alphabetical order. Make changes in this figure where necessary 3 4 5 Node 0 1 2 H 3 X 4 P E F 5 B 7 C M data H X P E F Show the changes in the data and next members of the nodes and the values of first and free after the front item of the linked list pointed by first (node index #3) is deleted. Make changes in this figure where necessary. B C M data H 2 6 X 0 1 P E F 4 B C -1 M next 2 6 0 1 4 next 7 2 6 0 1 4 -1

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 5SA

See similar textbooks

Similar questions

Q#03: Consider a queue that is a Queue-Type object and the size of the array implementation of aqueue is 200. In addition, consider that the value of Queue-Front is 199 and the value of Queue-Rear is 125. a. After adding an element to queue, what will be the values of Queue-Front and Queue-Rear?b. After removing an element from queue, what will be the values of Queue-Front and Queue-Rear?
Q #3. Apply concepts of Advanced Data Structures to implement a Students Book as adoubly linked list. Each node in the Student Book will contain ‘Name’, ‘RegNumber’,‘CGPA and ‘Age’ of the student. Following operations can be performed on the StudentBook.• Constructor to create and Destructor to destroy the Student Book• Add a Student if it is not already present in the Book.• Delete a Student from the Book.• Search a Student in the Student Book using Name or Reg. Number. If founddisplay its details. If not found, display ‘Student not found’.• Display the Student details in forward and reverse order• In main (), define an object of type StudentBook. Get details of 10 student fromthe user and add to the StudentBook. Ask the user, if the user wants to display,search or delete a student and perform the required actions, accordingly.
Q 4 Computer Science Write a Java generic Class with user-defined method(s) to exchange the positions of two different elements in an Array List.
Add a new public member function to the LinkedList class named reverse() which reverses the items in the list. You must take advantage of the doubly-linked list structure to do this efficiently as discussed in the videos/pdfs, i.e. swap each node’s prev/next pointers, and finally swap headPtr/tailPtr. Demonstrate your function works by creating a sample list of a few entries in main(), printing out the contents of the list, reversing the list, and then printing out the contents of the list again to show that the list has been reversed. Note: your function must actually reverse the items in the doubly-linked list, not just print them out in reverse order! Note: we won't use the copy constructor in this assignment, and as such you aren't required to update the copy constructor to work with a doubly-linked list. This is what I have so far but its not working! template<class ItemType>void LinkedList<ItemType>::reverse(){ Node<ItemType>*curPtr,*prev,*next;…
1. A polynomial can be represented as a linked list, where each node called a polyNode contains the coefficient and the exponent of a term of the polynomial. For example, the polynomial 4x³ + 3x² - 5 would be represented as the linked list: 43 3 4x3 I 2 % 3x² Write a Polynomial class that has methods for creating a polynomial, reading and writing a polynomial, and adding a pair of polymomials. -50 -5x° In order to add 2 polynomials, traverse both lists. If a particular exponent value is present in either one, it should also be present in the resulting polynomial unless its coefficient is zero.
A1 Write a function Connected Component (G,v) which takes as in- put a dictionary representing a graph G, and one of its vertices v, and returns a set of nodes representing the connected com- ponent of v, implementing the method given in the notes. Hint: Create and update lists called visitednodes repres- enting previously visited nodes, latestnodes representing the most recently visited nodes, and newnodes representing nodes neighbouring those in latestnodes and not included in either of the previous categories. A2 Write a function NumberOfComponents (G) which takes as in- put a dictionary representing a graph G and returns a positive integer representing its number of connected components. A3 Recall that an ordinary (unweighted) graph can be considered a weighted graph by assigning every edge weight 1. The "shortest path" from a to b in this interpretation is simply the path from a to b with the fewest edges. This makes Dijkstra's algorithm simpler as the shortest path from a to b…
Introduction For this assignment, you are to write a program which implements a Sorted List data structure using a circular array-based implementation and a driver program that will test this implementation. The Sorted List ADT is a linear collection of data in which all elements are stored in sorted order. Your implementation has to store a single int value as each element of the list and support the following operations: 1. add(x) – adds the integer x to the list. The resulting list should remain sorted in increasing order. The time complexity of this operation should be 0(N), where N is the size of the list. 2. removefirst() - deletes the first integer from the list and returns its value. The remaining list should remain sorted. Time complexity of this operation should be 0(1). 3. removelast() – deletes the last integer from the list and returns its value. The remaining list should remain sorted. Time complexity of this operation should be 0(1). 4. exists(x) – returns true if the…
Using C languge, implement programmer defined-data types with linked lists. A set of integers may be implemented using a linked list.Implement the following functions given the definition:typedef struct node* nodeptr;typedef struct node{int data;nodeptr next;}Node;typedef Node* Set;Set initialize();- simply initialize to NULLvoid display(Set s);- display on the screen all valid elements of the listSet add(Set s, elem);- simply store elem in the listint contains(Set s, int elem);- search the array elements for the value elemSet getUnion(Set result, Set s1, Set s2);- store in the set result the set resulting from the union of s1 and s2- x is an element of s1 union s2 if x is an element of s1 or x is an element of s2Set intersection(Set result, Set s1, Set s2);- store in the set result the set resulting from the intersection of s1 and s2- x is an element of s1 intersection s2 if x is an element of s1 and x is an element of s2Set difference(Set result, Set s1, Set s2);- store in the set…
For this assignment, you need to implement link-based List and derivative ADTs in Java. To complete this, you will need the following: A LinkNode structure or class which will have two attributes - a data attribute and a pointer attribute to the next node. The data attribute of the LinkNode should be the Money class of Lab 1. A Singly Linked List class which will be composed of three attributes - a count attribute, a LinkedNode pointer/reference attribute pointing to the start of the list and a LinkedNode pointer/reference attribute pointing to the end of the list. Since this is a class, make sure all these attributes are private. The attribute names for the Node and Linked List are the words in bold in #1 and #2. For the Linked List, implement the most common linked-list behaviors as explained in class - getters/setters/constructors/destructors for the attributes of the class, (a) create new list, (b) add data, (c) delete data, (d) find data, (e) count of data items in the…
09.Given a linked list of N nodes such that it may contain a loop. A loop here means that the last node of the link list is connected to the node at position X(1-based index). If the link list does not have any loop, X=0. Remove the loop from the linked list, if it is present, i.e. unlink the last node which is forming the loop. Example 1: Input: N = 3 value[] = {1,3,4} X = 2 Output: 1 Explanation: The link list looks like 1 -> 3 -> 4 ^ | |____|
Computer Science Java Programming ******* Write a Java application that will, given an appropriate data structure, will be able to track the following module and its dependencies as well as implement an appropriate search algorithm to create the correct graph for any given module. The graph will show all the corresponding dependent modules in their correct order of dependency. Must use Stack, either Double ArrayList or Linked List, and simple search to implement this. Module A: Dependencies: B D E K L Module B: Dependencies: F G M Module C: Dependencies: F Module D: Dependencies: G Module E: Dependencies: B A Module F: Dependencies: B Module G: Dependencies: NONE Module K: Dependencies: M Module L: Dependencies: Q Module M: Dependencies: A Module Q: Dependencies: NONE Ensure that dependencies are only visited only once. To test: Input A Your Output: Module A. Dependencies: B F G M D E K M L Q
Both array lists and linked lists are examples of how a list may be implemented. Discuss a scenario when a linked list might be preferable than a list stored in an array. Explain your reasoning in each situation.