Write a program in C++ to insert a new node at the end of a Singly Linked List. Test Data and Expected Output : Input the number of nodes : 3 Input data for node 1: 5 Input data for node 2 : 6 Input data for node 3 : 7 Data entered in the list are : Data - 5 Data - 6 Data - 7 Input data to insert at the end of the list : 8 Data, after inserted in the list are : Data - 5 Data - 6 Data - 7 Data - 8

Define a function named get_unique_sorted(list1, list2) that takes two integer lists as parameters. The function combines the values from the two parameter lists and produces a new list that is sorted and contains no duplicates. For example: Test Result list1 = [3, 5, 1, -4, 2] [3, 5, 1, -4, 2] [1, 7, -2, 6, 9] [-4, -2, 1, 2, 3, 5, 6, 7, 9] list2 = [1, 7, -2, 6, 9] list3 = get_unique_sorted(list1, list2) print(list1, list2, list3) list1 = [13, -5, 14] [13, -5, 14] [38, 14, -2] [-5, -2, 13, 14, 38] list2 = [38, 14, -2] list3 = get_unique_sorted (1list1, list2) print(list1, list2, list3)

m = int(temp[1]) IndexError: list index out of range line 3, in <module>    m = int(temp[10])IndexError: list index out of range when i ran this test case  input: 3 jun3 Jin1 Li2 Kitty2 Josh3 Bob1 Dave2 Jose1 David3 Rob3 Anne3 Ann2 Kevin2 Lara1 ALI3 Xin expected output: Li Dave David ALI Kitty Josh Kevin Lara jun Bob Anne Ann Xin

Write a C code that will search an int type target from a dynamic linked list. The linked list contains int type values inside each of the nodes. The “search” function will use following input-output arguments,Input: Pointer to the head of the list that you are searching Target value that you are searchingOutput: Pointer to the node that contains the target if found or, NULL if not found.

This program will use an array implementation of a linked list to keep an ascending sorted list of numbers. The input data consists of two fields: a single character and an integer value. The single character gets interpreted as one of the following: A - represents a value that is to be added to the linked listD - represents a value to be deleted from the linked listP - indicates that all values are to be printed in ascending order The character is only used to determine which process is to be executed; it should not be printed, entered into the linked list, or processed in any way. The main program should be mainly function calls. Process input data until end of file. All output should be sent to an output file and be appropriately formatted and labeled. Keep a running log of everything that is going on in the processing. Input file: A 54A -17A 32 A 81 A -30 A 18 P A 41 A 93 A 65 A 80 A 104 A -20 D 81 D 54 D -30 A 79 A 63 A 77 A –33 D 104 D -20 D 80 D 32 P

Write a program in Java to manipulate a Double Linked List:   Count the number of nodes Insert a new node before the value 7 of Double Linked List Search an existing element in a Double linked list (the element of search is given by the user) Suppose List contained the following Test Data: Input the number of nodes : 4Input data for node 1 : 5Input data for node 2 : 6 Input data for node 3 : 7 Input data for node 4: 9

Write a C program that contains int count_zero(int a[ ][6], int n) function that takes two dimensional array and the number of rows. It should return the number of elements with zero values. Assume that the matrix a is 6 by 6 with integer elements and it should be created in the main function and sent to the count_zero function.   45 5 10 0 6 0 3 2 0 9 4 3 7 3 0 17 43 15 0 12 65 91 25 12 21 41 14 0 0 11 32 0 99 0 14 1

Write C++ code to display all even numbers in the a doubly linked list pointed to by Dlist. Use while loop to scan all nodes from the start to the end. (Each node has three fields: a data field that contains the information, and right and left fields contain pointers to nodes on either side. Ex. p->left represents the address of the node to the left of node p) (any number of nodes in the linked list) Dlist 4 3 8 HIIN 7 1