+1 862 207 3288 Submission must be on time as discussed in class. Your grade in all the homework assignments and exams depends on the correctness and
speed of your algorithms. Assigned: 1/19/16 Due: 1/28/16 1. (2.5 points) Singly linked lists. a) Write an algorithm that puts numbers
into a singly linked list, L1, in ascending order. You may use pseudo code or C++. b) Demonstrate its operation (step-by-step) adding
nodes with the following keys: {3, 8, 6, 2}. 2. (2.5 points) Doubly linked lists. a) Write an algorithm that adds a node into the
middle of a doubly linked list, L2. You may use pseudo code or C++. b) Demonstrate its operation (step-by-step) by adding a node with
key ‘5’ to an existing list with the keys: {3, 8, 6, 2}. 3. (2.5 points) Stacks. Reverse the content of stack S1: a) using two
additional stacks (S2 and S3) b) using one additional queue (Q1) c) using one additional stack (S4) and some additional variables. 4.
(2.5 points) Queues. a) Write an algorithm that provides queue functionality using a stack data structure and stack operations. You
should provide operations to enqueue new elements, dequeue elements, peek at the value of the ‘next’ element for dequeuing, and test if
the queue is empty. b) Demonstrate its operation using a small dataset (such as {3, 8, 6, 2}). Submit an archive (zip file) of the word
processing document with your solutions. If you use images of your handwritten solutions, paste them into a single document and then
check to ensure they are oriented correctly and legible. If I can’t read your solutions, I can’t provide maximum credit!
TAKE ADVANTAGE OF OUR PROMOTIONAL DISCOUNT DISPLAYED ON THE WEBSITE AND GET A DISCOUNT FOR YOUR PAPER NOW!
