Notice
Recent Posts
Recent Comments
Link
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | |||
| 5 | 6 | 7 | 8 | 9 | 10 | 11 |
| 12 | 13 | 14 | 15 | 16 | 17 | 18 |
| 19 | 20 | 21 | 22 | 23 | 24 | 25 |
| 26 | 27 | 28 | 29 | 30 | 31 |
Tags
- dataStructure
- exam
- 빅데이터 커리어 가이드북
- hash
- Data Analyst
- priority queue
- 빅데이터 지식
- binary search tree
- Newyork
- Linked List
- data
- HEAPS
- 빅데이터
- 데이터 엔지니어
- data scientist
- Binary Tree
- Study
- Computer Science
- Preparing for the Google Cloud Professional Data Engineer Exam
- Heap
- 뉴욕 화장실
- algorithm
- 화장실 지도
- Computer Organization
- Data Structure
- 데이터 분석가
- Data Engineer
- Algorithms
- BST
- Restroom
Archives
- Today
- Total
목록Computer Science (1)
Jaegool_'s log
IT 279: Algorithms and Data Structures, Week 5 Hash Tables
Progress Check 11 on Hash Tables 1. Insertion and searching in a search tree dictionary has a best case of O(log(n)) and we sometimes aren't even that lucky. What is the best search time that we can reasonably achieve in a hash table? O(1), constant time search 2. Which of the following hash functions is correct for an integer key being stored in a dictionary of size tableSize? hash(key) = key %..
Courses
2023. 10. 5. 11:33