목록Data Structure (3)

Jaegool_'s log

IT 279: Algorithms and Data Structures, Week 3 Trees recap

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..
Courses 2023. 10. 4. 06:12
IT 279: Algorithms and Data Structures, Week 2 recap

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..
Courses 2023. 10. 3. 05:22
IT 279: Algorithms and Data Structures, Week 1 recap

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) { ..
Courses 2023. 10. 2. 14:04
이전 Prev 1 Next 다음