implement the following linked list us

Write a Python function shuffle(myList) that scrambles a list into a random order, like shuffling a deck of cards.

Question : Write a program to remove duplicates from a doubly linked list. e.g (1,2,3,4,5,2) (you will remove the 2nd duplicate) and then swap two data items in a doubly linked list. swap  address of node 2 with node 4.

Use python only.

Write a BCPL program that reads a sequence of strings typed by the user and creates a linked list containing them all. But there will be some special command words. These should be obeyed but not inserted into the list An input of END will be used to mark the end of the input sequence. The progrm should stop. An input of ALL means that the whole list should be printed. It is perfectly OK for the list to come out backwards. An input of DELETE means that the next word is to be removed from the list and its memory (for the link object and for the string) must be recycled with freevec (even though freevec doesn't do anything yet). Remember you will need to implement and use strdup(). Remember that strings are packed, four bytes per word, into an array. You use the "byte N of S" syntax to access the individual bytes. Also remember that an extra 0 byte is added to mark the end of the string. Example run: $ run hw4 Enter the strings and deletions: > hello > this > program > works…

C++Create 1 million integers randomly and store them in an array. Find the 100 smallest integers and print them. Use a Priority Queue implemented by Heap using array, and print the execution time too.

can I have the solution for this question in Java coding please? Write an algorithm for the following to swap two adjacent elements by adjusting only the links (and not the data) using: Singly-linked lists. Doubly linked lists.

Write a program that maintains a personal phone book in C. The program allows to:▪ Add and Delete entries from the phone book,▪ Search the phone book for a specific entry by last name or by phone number, and▪ Print out the entire entries in the phone book.The data in the phone book is maintained by storing in memory with the use of a singly linked list, withone list node per entry. Each node contains members for storing a person’s family name, first name, address,and the phone number. Use strings to store this information. The linked list must be kept in increasingalphabetical order, sorted by family name. There are no duplicate entries with the same family nameallowed in the phone book. This program should be menu driven, with the user being offered a choice of the following commandsdescribed below:▪ Insert a new entry into the phone book.The program should prompt the user for a new family name and first name, an address and a phonenumber. This information should be placed in a new…