New User Special Price Expires in

Let's log you in.

Sign in with Facebook


Don't have a StudySoup account? Create one here!


Create a StudySoup account

Be part of our community, it's free to join!

Sign up with Facebook


Create your account
By creating an account you agree to StudySoup's terms and conditions and privacy policy

Already have a StudySoup account? Login here

Data Structures and Algorithms II

by: Kieran Flatley

Data Structures and Algorithms II CS 241

Kieran Flatley
CSU Pomona
GPA 3.5

Fang Tang

Almost Ready


These notes were just uploaded, and will be ready to view shortly.

Purchase these notes here, or revisit this page.

Either way, we'll remind you when they're ready :)

Preview These Notes for FREE

Get a free preview of these Notes, just enter your email below.

Unlock Preview
Unlock Preview

Preview these materials now for free

Why put in your email? Get access to more of this material and other relevant free materials for your school

View Preview

About this Document

Fang Tang
Class Notes
25 ?




Popular in Course

Popular in ComputerScienence

This 5 page Class Notes was uploaded by Kieran Flatley on Saturday October 3, 2015. The Class Notes belongs to CS 241 at California State Polytechnic University taught by Fang Tang in Fall. Since its upload, it has received 38 views. For similar materials see /class/218311/cs-241-california-state-polytechnic-university in ComputerScienence at California State Polytechnic University.

Similar to CS 241 at CSU Pomona

Popular in ComputerScienence


Reviews for Data Structures and Algorithms II


Report this Material


What is Karma?


Karma is the currency of StudySoup.

You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!

Date Created: 10/03/15
C5241 Homework Assignments Winter 201 1 C524 1 home page ScheduleZNotes Assignments Subject to change Check back frequently for updates Date 24 Due Dates and Late Submission Project report and the Java source files java should be submitted via email due at 235959 on the assigned due date Each late submission will incur a 10 points penalty per day The final project must be turned in on time No late project will be accepted for the final one Any project violates the above rules will receive zero credit Do39s and Don39ts 9 Your source code must be java files You do not need to copy them into your project report Your project report must be either word document or pdf document DO NOT createuse your own package in your Java files All the source code must be compilable when I run quotjavac javaquot using Commend Prompt To do this you can declare your other classes to be non public such as quotclass Set quot instead of quotpublic class Set quot and declare your class with the main function as public When you are done programming and ready to submit it create a directory with your first name last name and project number for example my project 2 directory would be called quotdaisytangZquot Copy all the java files program output and your project report into this directory DO NOT copy extra junk files such as your class files Zip the files in the directory so that when I unzip it a directory with your name that contains all your files will appear Sorry files with rar postfix will NOT be accepted It is important that you include your output files usually in the form of txt with your program If your program uses an interactive way for the user to enter data please make it as friendly as possible Commenting your code high level commenting is preferred for example each class should have a comment introducing the functionality of this class and each method should have a comment just before it to introduce the inputoutput and its functionality Make appropriate inline comments Standard Project Format adapted from Dr Hillam All work except code listings and program output must be done using a word processor Handwritten projects will not be accepted Use a standard font such as courier Times Roman etc at 12 point Italic fonts bold fonts and script fonts are not acceptable Black ink is required The one exception is that many context free editors output code and comments in different colors This deviation is acceptable Each project is to begin with a title page One third the way down and centered is the project number project title and class on separate lines and in that order Two thirds the way down and centered is your name your email address and the due date on separate lines The next portion of your project is in an essay format It must be done on standard paper as noted above It is composed of the following sections Section 1 Project description Section 2 Project specification Section 3 Testing methodology Section 4 Lessons learned Section 5 Analysis of output Project dependent The section names as listed above including the word Section are part of the format and head each section The project description will usually be provided as part of the project handout The specification includes the requirements for the project and how your project meets them Testing methodology includes what you did to insure correctness This section would outline what you used to verify code correctness including but not limited to test data and description of the test drivers It would include a listing of pathological case and how you handled them This testing strategy would test every method and user defined or raised exception if relevant Lessons learned describes what doing and analyzing the project taught you if anything Some projects may be in the form of numerical or programming experiments In that case the project description would suggest questions this section must answer Please be concise make your project report between 1 2 pages long Focus on your testing methodology and lessons learned After the essay portion attach the output generated by your program The appearance of your Output must look professional Landscape is okay for your output If you are printing tables the columns must be vertical You are studying to be professionals Your work should look professional Remember Title page Written description in correct form Program output Project Grading 1 5 Prog ram write u p 70 Program Output and correctness If your program does not compile you get a zero here 15 Program Efficiency of your program How well your program is organized does the listing look professional are comments appropriate are class design done to promote correctness Last updated Jan 2011 C8241 Lecture Notes Final Review Daisy Tang Back To Lectures Notes A general study guide for your nal The nal exam is comprehensive with a focus on the materials we covered after midterm You are allowed to bring a lpage cheat sheet lettersize with you to the nal exam Formats TrueFalse questions Shortanswer questions Java programming TreeGraph related drawing problems Contents Trees Treerelated concepts and terminologies root leaf parent child depth subtree etc De nitions of various types of trees emptytree binarytree heap BST full binary tree complete binary tree selfbalancing BST AVL tree and Btree Understand how to represent a tree with either 1 array or 2 node Understand how to perform three types of tree traversals Understand the Btree 23 tree rules Be able to evaluate whether a given tree is a Btree 23 tree or not Be able to build a heap and a 23 tree given a series of values Be able to delete from a 23 tree and still maintain the 23 tree structure Understand the time analysis for BST heap Btree and AVL tree etc Graphrelated concepts and terminologies vertex edge undirected graph directed graph weighted graph loop path simple graph etc Understand three different ways to represent a graph and their pros and cons Be able to perform the two graph traversal algorithms breadth rst and depth rst Understand the singlesource shortestpath problem and the allpairs shortest path problem Given a directed graph be able to nd the shortest path from a source vertex to all other vertices step by step via Dijkstra s algorithm Given a directed graph be able to generate the allpairs shortest path matrix step by step via Floyd Warshall s algorithm Understand the de nition of a minimumcost spanning tree Be able to perform Prim s algorithm and Kruskal s algorithm to generate the minimumcost spanning tree Sorting algorithms Understand the timespace complexity of each sorting algorithm Be able to write Javapseudocode to perform a particular sorting Be able to simulate the quicksort process Be able to simulate the heapsort process Last updated Mar 2011 C8241 Lecture Notes Midterm Review Daisy Tang Back To Lectures Notes A general study guide for your midterm You can bring one page of cheat sheet Formats TrueFalse questions De nitions Shortanswer questions Java programming short Be able to build a speci c type of tree given inputs Contents Be able to give examples of linear data structures and nonlinear data structures Understand how to select the right data structure De nition of algorithm and the algorithm development process Treerelated concepts and terminologies root leaf parent child depth subtree etc De nitions of various types of trees emptytree binarytree heap BST full binary tree complete binary tree selfbalancing BST AVL tree and Btree Understand how to represent a tree with either 1 array or 2 node Understand how to perform the three types of tree traversals Understand the rules of building a BST a heap an AVL tree and a Btree Know how to build a BST a heap an AVL tree and a 23 tree with a series of input values and the insertion deletion of a value Understand the potential problem with a BST Be able to analyze the time complexities of inserting deleting or searching on a BST a heap an AVL tree and a 23 tree Exercises Shortanswer questions How do we choose the right data structures for a particular problem What is the time complexity of nding a speci c key in a BST What data structure do we usually use to implement a general tree structure What data structure do we usually use to implement a binary heap Java coding Write a method for inorder traversal of a BST Write a method to count the total number of nodes in a BST Write a method to perform insertion on a binary heap Build a BST with the following values quot quot Remove quot quot from the tree Build a heap with the following values quot l with a series of insertion 2 with the optimal method Perform 2 removals Build an AVL tree with the following values quot quot You need to show the tree after each insertion before and after rotation Remove quot quot from the tree Build a 23 tree with the following values quot Show every step Remove quot quot from the tree Last updated Oct 2010


Buy Material

Are you sure you want to buy this material for

25 Karma

Buy Material

BOOM! Enjoy Your Free Notes!

We've added these Notes to your profile, click here to view them now.


You're already Subscribed!

Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'

Why people love StudySoup

Bentley McCaw University of Florida

"I was shooting for a perfect 4.0 GPA this semester. Having StudySoup as a study aid was critical to helping me achieve my goal...and I nailed it!"

Janice Dongeun University of Washington

"I used the money I made selling my notes & study guides to pay for spring break in Olympia, Washington...which was Sweet!"

Steve Martinelli UC Los Angeles

"There's no way I would have passed my Organic Chemistry class this semester without the notes and study guides I got from StudySoup."

Parker Thompson 500 Startups

"It's a great way for students to improve their educational experience and it seemed like a product that everybody wants, so all the people participating are winning."

Become an Elite Notetaker and start selling your notes online!

Refund Policy


All subscriptions to StudySoup are paid in full at the time of subscribing. To change your credit card information or to cancel your subscription, go to "Edit Settings". All credit card information will be available there. If you should decide to cancel your subscription, it will continue to be valid until the next payment period, as all payments for the current period were made in advance. For special circumstances, please email


StudySoup has more than 1 million course-specific study resources to help students study smarter. If you’re having trouble finding what you’re looking for, our customer support team can help you find what you need! Feel free to contact them here:

Recurring Subscriptions: If you have canceled your recurring subscription on the day of renewal and have not downloaded any documents, you may request a refund by submitting an email to

Satisfaction Guarantee: If you’re not satisfied with your subscription, you can contact us for further help. Contact must be made within 3 business days of your subscription purchase and your refund request will be subject for review.

Please Note: Refunds can never be provided more than 30 days after the initial purchase date regardless of your activity on the site.