일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- Computer Science
- Data Analyst
- priority queue
- Algorithms
- exam
- hash
- dataStructure
- Newyork
- data scientist
- 뉴욕 화장실
- 빅데이터 커리어 가이드북
- 화장실 지도
- Binary Tree
- Heap
- Data Structure
- binary search tree
- 데이터 엔지니어
- 빅데이터 지식
- 빅데이터
- Restroom
- Preparing for the Google Cloud Professional Data Engineer Exam
- BST
- Linked List
- Study
- Data Engineer
- Computer Organization
- 데이터 분석가
- HEAPS
- data
- algorithm
- Today
- Total
목록전체 글 (61)
Jaegool_'s log

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 %..

Progress Check on AVL Search Trees 1. Which of the following is NOT true of Abstract Data Types (ADTs)? C a. An ADT can be implemented using a class in C++. b. ADTs describe both data and the operations on the data. c. An ADT is always specific to a particular programming language. d. Dynamic arrays and linked lists are two different ways to implement the LinearList ADT. 2. Which of the followin..

1. What are the height and depth of the J node in the tree above? height = 1, Depth: 2 2. Which of the following is NOT a leaf node? D 3. Which of the following terms best describes the relationship of G to M? Aunt HW 4. More Linked List Practice void doUnion(const list& list1, const list& list2, list& result) { list::const_iterator iter1; list::const_iterator iter2; // your code here -- make su..

Progress Check on Algorithm Analysis 1. Put these in order from lowest to highest. Lowest O(1) O(log n) O(n) O(n log n) O(n2) O(n3) Highest 2. The actual running time of a given function is determined by the expression 3n + 4 + 5n2. What is the Big-Oh notation that accurately describes the function? c. O(n^2) a. O(n) b. O(3n) c. O(n^2) d. O(5n^2) 3. You have analyzed a particular program to be O..
What is a memory leak? - Losing track of dynamically allocated memory so that it is not freed or deallocated. What is a dangling pointer? - A pointer that points at memory that has already been freed (or deallocated). What is the purpose of a destructor in C++? - To free any dynamically allocated memory that the object uses before the object itself is deallocated. Recursion int func1(int num) { ..
Hello, John. This is Jae Woo Kang, a graduate student from Illinois State University. We got your project (Pixel Bit Road) from course IT 495. I hope this message finds you well. I wanted to reach out to ensure that I have a clear understanding of your expectations and requirements for the gaming website project. To ensure a successful development process, could you please provide some additiona..
Memory allocation, C++ When a variable is declared compiler automatically allocates memory for it. This is known as compile-time memory allocation or static memory allocation. Memory can be allocated for data variables after the program begins execution. This mechanism is known as runtime memory allocation or dynamic memory allocation. // static memory allocation: int a; // dynamic memory alloca..
AJAX stands for Asynchronous JavaScript and XML. It is a set of web development techniques used to create interactive and dynamic web applications. AJAX allows web pages to update content asynchronously, meaning data can be retrieved from a server and loaded into a web page without requiring a full page refresh. Here's how AJAX typically works: Asynchronous: AJAX allows data to be fetched from a..