4. (a) Consider two already created singly linked lists List_A and List_B. Define pseudocode/algorithm for two functions i.e., differenceAB( ) and intersectAB ( ), wherein the function differenceAB( ) generates the list which contains the nodes only in List_A and not in List_B. Whereas the function intersectAB( ) generates the resultant list which contains the nodes common in both List_A and List_B. (b) Given five memory partitions of 200 KB, 600 KB, 300 KB, 400 KB and 700 KB. How would the first-fit, best-fit, worst-fit and next-fit algorithms place processes of 312 KB, 517 KB, 212 KB and 526 KB.

4. (a) Consider two already created singly linked lists List_A and List_B. Define pseudocode/algorithm for two functions i.e., differenceAB( ) and intersectAB ( ), wherein the function differenceAB( ) generates the list which contains the nodes only in List_A and not in List_B. Whereas the function intersectAB( ) generates the resultant list which contains the nodes common in both List_A and List_B. (b) Given five memory partitions of 200 KB, 600 KB, 300 KB, 400 KB and 700 KB. How would the first-fit, best-fit, worst-fit and next-fit algorithms place processes of 312 KB, 517 KB, 212 KB and 526 KB.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter3: Data Representation

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

To add the two polynomials, assume that the singly linked lists' nodes are sorted in decreasing order of the variable x's exponents.The goal is to generate a new list of nodes representing the sum of P1 and P2. This is accomplished by combining the COEFF fields of nodes with identical powers of variable x in lists P1 and P2, and then creating a new node in the resultant list P1 + P2. The procedure's crux is presented below.P1 and P2 are the start pointers of the singly linked lists that represent polynomials P1 and P2. PTR1 and PTR2 are two temporary pointers that are initially set to P1 and P2, respectively. Make procedural code.
Consider two already created singly linked lists List_A and List_B. Define pseudocode/algorithm for function i.e., differenceAB( ) wherein the function differenceAB( ) generates the list which contains the nodes only in List_A and not in List_B. Also write the code for the same in C language. which sorting algorithm is adaptable for singly linked list and why ? Answer the question correctly and in detail and please attempt complete question.
Question #2 Consider there is a list i.e. listA = {20, 10, 5, 15, 3} Write python code that: a. Creates a function updateListA(), which takes listA as input parameter, adds 30 after 20, and adds 40 at the end of the listA. [Hint: create a parameterized function] b. Creates a function newList(), which takes listA as input parameter and creates a new list newList with same elements as listA but in reverse order. c. If there is a function defined as below: def example(par1, par2=30): print(‘valid’) From the following function calls: i. example(par1=1) ii. example(1, 2) iii. example(par2=1) iv. example(par1=5, par2=6) Which call is valid? Write the values of par1 and par2 if a call is valid? Suggest corrections if a call is invalid.
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…
To add the two polynomials, we assume that the singly linked lists' nodes are organized in decreasing order of the variable x's exponents.The goal is to generate a new list of nodes reflecting the sum of P1 and P2. This is accomplished by combining the COEFF fields of nodes with comparable powers of variable x in lists P1 and P2, and then adding a new node in the resultant list P1 + P2. The procedure's core is presented below.P1 and P2 are the beginning pointers of the singly linked lists that symbolize polynomials P1 and P2. Furthermore, PTR1 and PTR2 are two temporary pointers that are originally set to P1 and P2, respectively. Procedure code should be written.
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…
develop a linked-list processing function IsolateTargetSoloAsTail that is to process a linked list as follows. ● If target cannot be found on the given list, a new node containing target is created and added to the end (made the new tail node) of the list. ► This includes the case where the given list is empty, in which case the new tail node added is also new head node. (This is so because the only node in a 1-node list is both the head and tail node of the list.) ● If target appears only once on the given list, the target-matching node is moved to the end (made the new tail node) of the list. ► In case the target-matching node is already the tail node (of the given list), then nothing needs to be done. ● If target appears multiple times on the given list, the first target-matching node is moved to the end (made the new tail node) of the list, and all other target-matching nodes are to be deleted from the list. ► Note that although…
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…
Haskell The "scalar product" of two lists of integers "xs" and "ys" of length "n" is given by the sum of the products of corresponding integers in slide 21 for chapter 5. In a similar manner to "chisqr" (below), show how a list comprehension can be used to define a function "scalarproduct :: [Int] -> [Int] -> Int" that returns the scalar product of two lists. For example (in GHCi): > scalarproduct [1,2,3] 14,5,6] 32 Note that the mathematical equation for computing the "chi-square statistic" at the beginning of subsection "Cracking the cipher" in section 5.5 of the Haskell textbook is literally "zipping" a pair of lists "oe" and "es", and can hence be represented in Haskell as: chisqr :: [Float] -> [Float] -> Float chisqr os es = sum ((o-e) ^2)/e | (o,e)
You are to work to develop a linked-list processing function IsolateTargetSoloAsTail that is to process a linked list as follows. ● If target cannot be found on the given list, a new node containing target is created and added to the end (made the new tail node) of the list. ► This includes the case where the given list is empty, in which case the new tail node added is also new head node. (This is so because the only node in a 1-node list is both the head and tail node of the list.) ● If target appears only once on the given list, the target-matching node is moved to the end (made the new tail node) of the list. ► In case the target-matching node is already the tail node (of the given list), then nothing needs to be done. ● If target appears multiple times on the given list, the first target-matching node is moved to the end (made the new tail node) of the list, and all other target-matching nodes are to be deleted from the list. ►…
This is assignment used C++. Develop a linked-list processing function, IsolateTargetSoloAsTail, to process a linked list as follows. ● If a target cannot be found on the given list, a new node containing the target is created and added to the list's end (made the new tail node). ► This includes the case where the given list is empty, in which the new tail node added is also the new head node. (This is so because the only node in a 1-node list is the list's head and tail node.) ● If the target appears only once on the given list, the target-matching node is moved to the list's end (made the new tail node). ► Nothing needs to be done if the target-matching node is already the tail node (of the given list). ● If the target appears multiple times on the given list, the first target-matching node is moved to the list's end (made the new tail node), and all other target-matching nodes are to be deleted from the list. ► Note that although…
For Exercises 1–7, show the threaded BST that results from right-threading the binary search tree. Exercises 6 and 7 ask you to write functions for right-threaded BSTs. You should also test your functions with driver programs as instructed in Programming Problems 28 and 29 at the end of this chapter. Write a function to implement the inorder traversal algorithm for a right-threaded BST given in the text.