HW2 - ECE 242 HW#2 Fall 2009 Total points 100pts Appetizers...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
ECE 242 HW#2 Fall 2009 Total points: 100pts Appetizers: Question 0: Consider the fragment of operations below that are being performed on a singly Linked-List X: X.add(new Integer(4)); X.add(new Integer(7)); X.add(new Integer(3)); X.add(new Integer(2)); X.add(new Integer(5)); Object Z=X.remove(new Integer(7)); X.add(new Integer(9)); Part a) Write a method that will compute the sum of the values stored in the nodes of this singly Linked- List. (You do not need to write a complete class file. Just write the method that will perform the desired function). [10] Part b) Write a method that will remove a node from List X based on node value. (Same deal as the previous part. Just write the method). [10] Part c) optional Write a method to find out whether a loop exists in a singly-Linked List. The Main Course: Question 1: Part a) Implement a stack using a singly-Linked List . The bare functionality of your program should be a push, a pop and an isEmpty method. Write in Big-O notation, the time-complexity of each of your methods. Hint: Take a look at the code distributed with the lectures [10]
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/20/2010 for the course ENGINEERIN 242 211 taught by Professor Tessier during the Spring '10 term at UMass (Amherst).

Page1 / 2

HW2 - ECE 242 HW#2 Fall 2009 Total points 100pts Appetizers...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online