CS 141-Java Programming Computer Science Worksheet- SEU .
College of Computing and Informatics Assignment 2 Deadline: Thursday 18/11/2021 @ 23:59 [Total Mark for this Assignment is 5] Student Details: Name: ### ID: ### CRN: ### Instructions: • • • • • • • • • • You must submit two separate copies (one Word file and one PDF file) using the Assignment Template on Blackboard via the allocated folder. These files must not be in compressed format. It is your responsibility to check and make sure that you have uploaded both the correct files. Zero mark will be given if you try to bypass the SafeAssign (e.g. misspell words, remove spaces between words, hide characters, use different character sets or languages other than English or any kind of manipulation). Email submission will not be accepted. You are advised to make your work clear and well-presented. This includes filling your information on the cover page. You must use this template, failing which will result in zero mark. You MUST show all your work, and text must not be converted into an image, unless specified otherwise by the question. Late submission will result in ZERO mark. The work should be your own, copying from students or other resources will result in ZERO mark. Use Times New Roman font for all your answers. Question One Pg. 01 Learning Outcome(s): LO5 Evaluate data structures for efficient data representation and organization with demonstrable results. Question One 2 Marks Write a Java program to create two stacks and pop the top elements from the two stacks and then do the followings: 12345- Add the top two elements and push the result into a new stack named stack3 Subtract the top two elements and push the result into stack3 Multiply the top two elements and push the result into stack3 Divide the top two elements and push the result into stack3 Find the remainder of the top two elements and push the result into stack3 Sample run: stack1 elements[6, 5, 10] stack2 elements[2, 4, 8] stack3 elements[18, 2, 80, 1, 2] Answer: Question Two Pg. 02 Learning Outcome(s): LO1 Describe basic and advanced data structures such as linked lists, stacks, and queues. Question Two 1 Mark Show the result of inserting 10, 12, 5, 4, 20, 8, and 7 one at a time, into an initially empty binary heap (minheap). Answer: Question Three Pg. 03 Learning Outcome(s): LO4 Demonstrate implemented solution with appropriate data structure and algorithm for the assigned problem. Question Three 2 Marks Write a Java program that prints all the leaf nodes of a binary tree. Use the following binary tree as a sample input. 100 150 70 50 20 300 60 90 Output sample: The Leaf nodes: 20, 90, 300 Answer:
