Flashcard Set: computer algorithms
| 0 memorized | 254 to go | |
|
|
|
|
New Card Training
These work outs focus on cards you've not yet memorized successfully. Try it - works like a charm.
Review Sessions
These work outs focus on cards you have memorized successfully.
Print This Set
Browse individual flashcards :
Define: symmetric key encryption Define: cipher text Define: asymmetric encryption Define: hash Algorithms: describe insertion sort ... Algorithms: loop invariant Algorithms: selection sort algorithm Algorithms: merge sort Algorithms: performance of insertion... Algorithms: performance of merge sort Algorithms: binary search Algorithms: asymptotic efficiency of... Algorithms: difference between Theta... Algorithms: Special notation to indi... Algorithms: we say that a function f... Algorithms:n! = o( ____ )n! = omega( ... Algorithms: little oh notationo( n^2 ) Algorithms: little omega notation ... Algorithms: master method for solvin... Algorithms: master method for solvin... Algorithms: master method for solvin... Algorithms: describe coupon collecto... Algorithms: binary heap data structure Algorithms: Binary heap structure1.) ... Algorithms: max-heap versus min-heap Algorithms: d-ary heap Algorithms: m x n Young tableau Algorithms: heap-sort algorithm Algorithms: good data structure to ma... Algorithms: meaning of Algorithms: meaning of Algorithms: selection sort algorithm Algorithms: performance of selection ... Algorithms: quicksort's worst case ru... Algorithms: quicksort algorithm Algorithms: In the worst case, any co... Algorithms: partition method for quic... Algorithms: randomized quicksort algo... Algorithms: basic idea behind countin... Algorithms: performance of counting sort Algorithms: radix sort Algorithms: performance of bucket sort Algorithms: bucket sort algorithm Algorithms: the ith order statistic o... Algorithms: define selection problem Algorithms: asymptotic running time f... Algorithm: queue Algorithms: stack Algorithms: stack - insert is often c... Algorithms: queue - insert is often c...
Define: symmetric key encryption Define: cipher text Define: asymmetric encryption Define: hash Algorithms: describe insertion sort ... Algorithms: loop invariant Algorithms: selection sort algorithm Algorithms: merge sort Algorithms: performance of insertion... Algorithms: performance of merge sort Algorithms: binary search Algorithms: asymptotic efficiency of... Algorithms: difference between Theta... Algorithms: Special notation to indi... Algorithms: we say that a function f... Algorithms:n! = o( ____ )n! = omega( ... Algorithms: little oh notationo( n^2 ) Algorithms: little omega notation ... Algorithms: master method for solvin... Algorithms: master method for solvin... Algorithms: master method for solvin... Algorithms: describe coupon collecto... Algorithms: binary heap data structure Algorithms: Binary heap structure1.) ... Algorithms: max-heap versus min-heap Algorithms: d-ary heap Algorithms: m x n Young tableau Algorithms: heap-sort algorithm Algorithms: good data structure to ma... Algorithms: meaning of Algorithms: meaning of Algorithms: selection sort algorithm Algorithms: performance of selection ... Algorithms: quicksort's worst case ru... Algorithms: quicksort algorithm Algorithms: In the worst case, any co... Algorithms: partition method for quic... Algorithms: randomized quicksort algo... Algorithms: basic idea behind countin... Algorithms: performance of counting sort Algorithms: radix sort Algorithms: performance of bucket sort Algorithms: bucket sort algorithm Algorithms: the ith order statistic o... Algorithms: define selection problem Algorithms: asymptotic running time f... Algorithm: queue Algorithms: stack Algorithms: stack - insert is often c... Algorithms: queue - insert is often c...
