# Class Notes for CS 1501 at University of Pittsburgh (U PITT)

PITTCS 1501Michael LipschultzFall

## CS 1501 Lecture Notes - Lecture 10: Extended Euclidean Algorithm, Transposition Cipher, Brute-Force Attack

OC5091603 Page
15 Nov 2016
2
View Document
PITTCS 1501Michael LipschultzFall

## CS 1501 Lecture Notes - Lecture 8: Rolling Hash, Hash Table, Pattern Matching

OC5091602 Page
15 Nov 2016
2
View Document
PITTCS 1501Michael LipschultzFall

## CS 1501 Lecture Notes - Lecture 2: Binary Search Tree, Merge Sort, Linear Search

OC5091604 Page
8 Sep 2016
4
Cs 1501 9/7/16: all logs are base 2 but you need not write because log bas 2 of n = (log(n)/log(2)) which makes the base 2 a multiplicative constant. I
View Document
PITTCS 1501Michael LipschultzFall

## CS 1501 Lecture Notes - Lecture 3: Double Hashing, Linear Probing, Hash Table

OC5091603 Page
22 Sep 2016
7
Cs 1501 9-14: dlb is good if not many children: uses linked list to represent tries, radix has each node has pointer to alphabet references, digital se
View Document
PITTCS 1501Michael LipschultzFall

## CS 1501 Lecture Notes - Lecture 11: Nondeterministic Algorithm, Time Complexity, Search Algorithm

OC5091602 Page
17 Nov 2016
6
Cs 1501 11-16: so(cid:373)e pro(cid:271)le(cid:373)s are unsolvable: example is halting problem, halt test retur(cid:374)s true if it halts, intractabl
View Document
PITTCS 1501Michael LipschultzFall

## CS 1501 Lecture Notes - Lecture 9: Linked List, Ableton, Flow Network

OC5091603 Page
15 Nov 2016
2
View Document
PITTCS 1501Michael LipschultzFall

## CS 1501 Lecture Notes - Lecture 3: Eaves, South Dakota Highway 10, Binary Search Tree

OC5091603 Page
3 Nov 2016
2
View Document
Showing 1 — 7 of 7 results

## Popular Professors

View all professors (1+)

Class Notes (1,100,000)
US (460,000)
Pitt (2,000)
CS (60)
CS 1501 (7)