Running head: DATA STRUCTURES IN
JAVA 1
Data Structures Using Java
IT265 – Data Structures for Problem Solving
Clayton Kirby
July 6, 2016
DATA STRUCTURES USING JAVA 2
Abstract
Data Structures Using Java: Identify the different data structures within the java programming
script. This will include the proper use and validation of their use. By understanding the use of
stacks and queues, heaps and trees, sorting algorithms, searching and recursion in java will
increase speed and efficiency of find useful data within systems and programs and make them
retrievable in a productive and efficient manner. Proper planning and layout of these structures
allow businesses to be more agile and cost effective in their data in the hyper competitive
marketplace.
DATA STRUCTURES USING JAVA 3
Table of Contents
Abstract ......................................................................................................................................................... 2
Section 1: Lists, Stacks, and Queues ............................................................................................................. 4
Stacks ........................................................................................................................................................ 4
Queues ...................................................................................................................................................... 4
Section 2: Heaps and Trees ........................................................................................................................... 5
Implement pseudo code for a hash table ................................................................................................. 5
Resolve collisions with a linked list ........................................................................................................... 5
Section 3: Sorting Algorithms ....................................................................................................................... 6
Compare sort algorithms .......................................................................................................................... 6
Section 4: Searching ...................................................................................................................................... 7
Implement pseudo code to search for values in a linked list or array ...................................................... 7
Section 5: Recursion...................................................................................................................................... 9
Implement pseudo code to create a factorial of a number using recursion. ........................................... 9
References: ................................................................................................................................................. 10
DATA STRUCTURES USING JAVA 4
Section 1: Lists, Stacks, and Queues
Stacks
Queues
DATA STRUCTURES USING JAVA 5
Section 2: Heaps and Trees
Implement pseudo code for a hash table
Resolve collisions with a linked list
DATA STRUCTURES USING JAVA 6
Section 3: Sorting Algorithms
Compare sort algorithms
DATA STRUCTURES USING JAVA 7
Section 4: Searching
Implement pseudo code to search for values in a linked list or array
DATA STRUCTURES USING JAVA 8
DATA STRUCTURES USING JAVA 9
Section 5: Recursion
Implement pseudo code to create a factorial of a number using recursion.
DATA STRUCTURES USING JAVA 10
References:
Weiss, Mark A. (2009). Data Structures and Problem Solving Using Java, 4th Edition.
Retrieved from https://bookshelf.vitalsource.com/#/books/9781323417645/
