exam2_solution - COP 3530 Midterm, Part 2 (Mar 5, 2008)...

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

View Full Document Right Arrow Icon
COP 3530 Midterm, Part 2 (Mar 5, 2008) NAME: . 1. (24 points) For each of the following operations, state the best-case (Ω( ... )) and worst-case ( O ( ... )) run time. Assume that the data structure contains n objects. Assume that a singly linked list has a reference to the head, but not the tail (just like the book). (a) Given an index i , find the i th item in a singly linked list. Solution: Ω(1) and O ( n ). Alternatively, Ω( i ) and O ( i ); either solution (or combination of solutions) is fine. (b) Given an index i , find the i th item in an ArrayList. Solution: Ω(1) and O (1). (c) Given a new node t and a node p already in the list, insert t just before node p in a singly linked list. Solution: Ω(1) and O ( n ). Alternatively, Ω( i ) and O ( i ); either solution (or combination of solutions) is fine. (d) Given a new node t and a node p already in the list, insert t just after node p in a singly linked list. Solution: Ω(1) and O (1). (e) Given a new node t and a node p already in the list, insert t just before node p in a circular doubly linked list. Solution: Ω(1) and O (1). (f) Given a new node
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 test prep was uploaded on 04/18/2008 for the course COP 3530 taught by Professor Davis during the Spring '08 term at University of Florida.

Page1 / 3

exam2_solution - COP 3530 Midterm, Part 2 (Mar 5, 2008)...

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