i) Create a Node class which will hold two fields i.e an integer element and a reference to the next Node. ii) Create a Linked list Abstract Data Type (ADT)named MyList.The elements in the list are Nodes consisting of an integer type key (all keys are unique) and a reference to the next node. [You are not allowed to use any global variable other than head] If you are using PYTHON, make sure your code has the methods invoked through test statements and proper printing statements according to the tasks. You may create a separate Tester class for this or test the methods within the MyList class. Write a code in python

i) Create a Node class which will hold two fields i.e an integer element and a reference to the next Node. ii) Create a Linked list Abstract Data Type (ADT)named MyList.The elements in the list are Nodes consisting of an integer type key (all keys are unique) and a reference to the next node. [You are not allowed to use any global variable other than head] If you are using PYTHON, make sure your code has the methods invoked through test statements and proper printing statements according to the tasks. You may create a separate Tester class for this or test the methods within the MyList class. Write a code in python

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

See similar textbooks

Similar questions

Exercise B: "Matrix Addition" For this exercise you will design and implement a function that takes two matrix arguments and computes their sum (if and only if a sum can actually be computed, returning an empty list otherwise). Two matrices can only be added together if they have exactly the same dimensions. If the dimensions are acceptable, then the matrix sum will have the same dimensions as either of the operands, and the value of each element in the matrix sum is itself the sum of the corresponding elements in the operand matrices. And although it does makes sense to test rectangularity before attempting addition, you need not perform this step (since you did it above). In order to complete this task, you will need to: ensure you know how matrix addition can be performed² ● Your submission for this exercise:
emacs/lisp function Write a function that takes one parameter that is a list of numbers and returns true (t) if all the elements of the list are multiples of the first one and nil otherwise. This said, a list generated by the function make-multiples could be passed to this new function and the result should be true. On the other hand, show an example of a list that could not have been generated by the first function for which the result is still true.
Write a function count_evens(nums) that takes a list of ints called nums and returns the number of even ints in the given list. Note: the % "mod" operator computes the remainder, e.g. 5 % 2 is 1.
Write the function splitList that takes the first argument list and splits it into two: a list of all the elements that are less than the head (the second argument), and a list of all the elements that are greater than or equal to the head (the third argument): listElementT splitList(listADT list, listADT* ItList, listADT* geList); Note that the head is returned by the function. a) Write this function as a recursive function. b) Write this function as a nonrecursive function.
4. Modify the bracketsBalance function so that the caller can supply the brackets to match as arguments to this function. The second argument should be a list of beginning brackets, and the third argument should be a list of ending brackets. The pairs of brackets at each position in the two lists should match; that is, position 0 in the two lists might have [ and], respectively. You should be able to modify the code for the function so that it does not reference literal bracket symbols, but just uses the list arguments. (Hint: The method index returns the position of an item in a list.) the bracketsBalance function: def bracketsBalance(exp):"""exp is a string that represents the expression""" stk = LinkedStack() for ch in exp: if ch in [’[’, ’(’]: stk.push(ch) elif ch in [’]’, ’)’]: if stk.isEmpty(): # Create a new stack # Scan across the expression # Push an opening bracket # Process a closing bracket# Not balanced return FalsechFromStack = stk.pop()# Brackets must be of…
7. Given two lists A and B, write a function to compute the difference A – B, where A – B is the list of elements that are in A but not in B. For example, if A is '(6 7 8 9) and B is (7 9) then A – B is '(6 8).
Write a function successor(items, target) that finds the first occurrence of target in the list list items and then returns the item immediately after it. If the target item is the last item in the list or is not present in the list, return None. Check the test cases for how the function should work. Note: Your answer must use a for loop. You are not allowed to use a while loop. For example: Test Result nums = [10, 20, 30] 30 next_num = successor(nums, 20) print(next_num) pets = ['dog', 'cat', 'fish', 'cat', 'dog', 'iguana'] fish after_cat = successor(pets, 'cat') print(after_cat) empty = [] after12 = successor(empty, 12) print (after12) None nums = [4, 7, -1, 12, 9, -1, 11, -1, 8] after8 = successor(nums, 8) print (after8) None
Because floating-point numbers are imprecise, it is common to compute data values of type float that are very close but not exactly equal to the value 0.0. a) In Python, Write a function countNZdata that counts number of elements in a list of type float whose absolute value is less than or equal to a positive tolerance parameter. The function takes the list as its first parameter; the second parameter is the positive float value that is the tolerance. Function should return the number of data values that meet this criterion. For example, for the given list: [2.19, -0.04, 1.66, 0.05, 4.70, -6.53, -0.11, -1.07, 1.94, -2.23] and a tolerance = 0.1, the function should return the value 3. b) Demonstrate that the function works by inputting different example values.
Q4. Write a program that read 2 matrices and has a function which finds their sum. Q5. Write a program that read 2 matrices and has a function which finds their multiplication. Q6. Write a program that handles a list of numbers where it has the following functions - Function that finds their average and sum - Function that finds their maximum and minimum - Function that search for a given number in that list. - Function that count the occurrence of a given number in that list. Then the program should do the following: - Read the list - Find the average and the sum of that list - Find the minimum and the maximum of that list - Count the occurrence of a given number in that list.
Problem Statement: Consider an input string PAL of letters ‘P’, ‘A’, and ‘L’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called PAL_TAB. The number of each of these letters is unknown. We have a function, called SWAP(PAL, i, j), which places the ith letter in the jth entry of string PAL and the jth letter in the ith entry of PAL. Note that SWAP(PAL, i, j) is defined for all integers i and j between 0 and length(PAL) – 1, where length(PAL) is the number of letters of PAL. 1. Using our algorithmic language, write an algorithm, called Sort_PAL, which sorts the letters in the array PAL_TAB in a way that all P’s appear first, followed by all A’s, and followed by all L’s. The algorithm Sort_PAL should have one parameter: The array PAL_TAB. Also, your solution is correct only if the four constraints below are satisfied: - Constraint 1: Each letter (‘A’, ‘L’, or ‘P’) is evaluated only once. - Constraint 2: The function SWAP(PAL, i, j) is…
Old MathJax webview Old MathJax webview In Java Some methods of the singly linked list listed below can be implemented efficiently (in different respects) (as opposed to an array or a doubly linked list), others not necessarily which are they and why? b. Implement a function to add an element before the first element. c. Implement a function to add an item after the last one element. d. Implement a function to output an element of the list. e. Implement a function to output the entire list. f. Implement a function to output the number of elements. G. Implement a function to delete an item. H. Implement a function to clear the entire list. I. Implement functionality to search for one or more students by first name, last name, matriculation number or course of study. J. Implement functionality to sort the records of the student, matriculation number and course according to two self-selected sorting methods.
Write a function that takes a nested list of integers and add up the elements from all of the nested lists.