# Class Notes for CSE 214 at Stony Brook University (SBU)

- 43 Results
- About SBU

## CSE 214 Lecture Notes - Lecture 77: Hash Table, Double Hashing, Linear Probing

25

Data records are stored in a hash table. Position of a data record in the has table is determined by its key. A hash function maps the keys to position

View Document## CSE 214 Lecture Notes - Lecture 1: Addison-Wesley, Backtracking, Big O Notation

10

Office hours - 12:00 pm - 1:00 pm. Data abstraction and problem solving with java, walls, and mirrors. Policy: up to one week after homework is graded

View Document## CSE 214 Lecture Notes - Lecture 33: Linked List, Nodeb, Adjacency Matrix

4

A graph g = (v,e) is a set of verticies v and a collection of edges e. An edge e = (x,y) is said to connect vertext x to vertex y and vice versa. An ed

View Document## CSE 214 Lecture 27: Midterm Review

14

Always has a base case to prevent the loop from going into an infinite loop. Have multiple components that make up the activation record. This will alw

View Document## CSE 214 Lecture 11: Stack Algorithms

16

[] --> [(] -> [ (( ] => [ {(( ] -> [ (( ] -> [(] -> [] false since it is not balanced with 1 extra parenthesis on the right. Each time the iterator run

View Document## CSE 214 Lecture 13: Queues

17

This data structure is fifo, which is first in first out similar to the lines you stand on for waiting. Just be careful of the order of complexity of f

View Document## CSE 214 Lecture 6: More ADT and LinkedLists

6

Class wide variables/methods that do not need to be instantiated with an object in order to be used. Static variables that are created will share that

View Document## CSE 214 Lecture Notes - Lecture 18: Array Data Structure, Dynamic Programming, Fibonacci Number

12

This way is written to find the most efficient method of finding the answer. The fibonacci function has a lot of steps when recursion is used and a tre

View Document## CSE 214 Lecture 10: Stacks

7

With tail - o(n) since there is no tail reference which must point to the node before the tail since to remove the node, you must set the link or the n

View Document## CSE 214 Lecture 33: Quicksort

2

If the pivot falls in the beginning, it would be o(n) since it must compare with every single other element in the array. If the pivot falls in the mid

View Document