CSE 214 Study Guide - Final Guide: Null Graph, Selection Sort, Insertion Sort
11 Jul 2018
School
Department
Course
Professor
10/15/2017
The Guide to
SBU’s
CSE 214
Computer Science II
Meagan Couture
STONY BROOK UNIVERSITY
2
Table of contents:
Unit 1: Specifications, Order of Complexity, Software Development and Abstract Data Types 3-4
Unit 2: Linked Lists 5-6
Unit 3: Stacks 7
Unit 4: Queues 8
Unit 5: Recursion 9
Unit 6: Binary Trees 10-11
Unit 7: Balanced Trees 12-13
Unit 8: Hash Tables and Searching Algorithms 14-15
Unit 9: Data Structures in the Java API N/A
Unit 10: Pointers & Memory Management using C (unit not covered in course) N/A
Unit 11: Sorting Algorithms 16-17
Unit 12: Introduction to Graphs 18-19
Additional Information 20-21
3
Unit 1: Specifications, Order of Complexity, Software
Development and Abstract Data Types ______________________________
Specifications________________________________________ ______________
Specifications indicate the usage of Java Doc, a system of coding notation that you get
very familiar with throughout your homeworks from this point forward as you will always be
using it for every single method that you write, or a similar Java Doc like pseudo code. Java Doc
is used in order to inform a reader of the code what each method does in a simple manner.
(Note: a short cut to activate Java Doc in Eclipse is /** [enter])
The order of Java Doc is always as follows:
- Short introduction//summary of the method
- Description of parameters
- Preconditions
- Postconditions or Returns
- Exceptions thrown
- Special notes on usage
Continue onto next page…_______________________________________________________
Example 1 (From my Homework 3) (Java Doc):
/**
* method specifically created for the floor stack that pushes Package x onto the top of the backing
* data structure
* @param x
* the Package item x that is to be pushed onto the backing data structure
* @throws FullStackException
* Throws FullStackException if the stack is at full capacity
*/
Example 2 (From my Homework 3) (Java Doc):
/**
* method that returns the topmost Package from the stack without changing the stack
* @return
* the topmost Package item from the stack
* @throws EmptyStackException
* Throws EmptyStackException if the stack is empty
*/
Example 3 (From Lecture Slides Unit 1, Slide 4) (Pseudo Code):
area
public static double area(double radius)
Parameters:
radius – radius of a circle in inches
Preconditions:
radius > 0
Returns:
Returns the area of the circle with the given radius.
Throws: IllegalRadius
Indicates that the radius is non positive
Document Summary
Unit 1: specifications, order of complexity, software development and abstract data types. Unit 8: hash tables and searching algorithms. Unit 9: data structures in the java api. Unit 10: pointers & memory management using c (unit not covered in course) Java doc is used in order to inform a reader of the code what each method does in a simple manner. (note: a short cut to activate java doc in eclipse is /** [enter]) The order of java doc is always as follows: Example 1 (from my homework 3) (java doc): * method specifically created for the floor stack that pushes package x onto the top of the backing. Example 2 (from my homework 3) (java doc): * @throws fullstackexception the package item x that is to be pushed onto the backing data structure. Throws fullstackexception if the stack is at full capacity the topmost package item from the stack.
