Jaegool_'s log

Summary The Data Science Task Categories include: Data Management - storage, management and retrieval of data Data Integration and Transformation - streamline data pipelines and automate data processing tasks Data Visualization - provide graphical representation of data and assist with communicating insights Modelling - enable Building, Deployment, Monitoring and Assessment of Data and Machine L..

Week 1: What Do Data Scientists Do? Data science is the field of exploring, manipulating, and analyzing data, and using data to answer questions or make recommendations. Summary - Data science is the study of large quantities of data, which can reveal insights that help organizations make strategic choices. - There are many paths to a career in data science; most, but not all, involve math, prog..

What is immutable & mutable? An immutable object is an object whose state cannot be modified after it is created. Java Immutable Objects: String, Wrapper Classes(Integer, Double, Float, etc.) Mutable Objects: StringBuilder and StringBuffer, Arrays, Custom Classes C++ Immutable Objects: Const Objects Mutable Objects: Standard Library Containers(std::vector, std::map, etc.), Strings, Custom Classe..

NP Problems What is an "undecidable" problem in computer science? - a problem that can't be solved no matter how much time and memory is provided In computer science in terms like NP-complete or NP-hard, "NP" stands for: - non-deterministic polynomial(비결정성 다항식) True or false: Any problem that can be solved by a deterministic computer in polynomial time can also be solved by a non-deterministic c..

HeapSort Step1: Heapify O(n) Step2: n-1 deleteMax operations O(log n) = (n-1) * O(log n) total: O(n log n) advantages: Guaranteed O(n log n) Space cost of n + 1 disadvantages: Higher overhead than other n log n sorts Not a stable sort ShellSort avg: O(n(logn)^2) worst: O(n^2) inspection gap is reduced at each stage MergeSort We have two sorted lists of equal length. The length is n. What is the ..

Recursion Review what is the output of this program? #include using namespace std; int mysteryFunc(int num1,int num2) { if (num1 == 0) return num2; else return mysteryFunc(num1 / 10,num2*10+num1%10); } int main() { cout 2^2 away, nth collision -> n^2 away - Offset from the current location: currentLocation

Contents Sorting Insertion Sort Selection Sort Merge Sort Quick Sort Heap Sort Shell Sort Disjoint Set - A data structure that keeps track of a set of elements partitioned into a number of disjoint (non-overlapping) subsets Term: Forest Union Find Union by Size + Path Compression Union by Rank/Height Graph Topological Sort: ordering the nodes in a directed acyclic graph Shortest path: Dijkstra's..

Priority Queues could be implemented as a list, but that has efficiency issues. At least one of insertion and deletion will be O(n). Binary heaps are an alternative that offers better performance Min Binary Heap: Min binary tree + a complete tree(insert from the left child) percolate up: when inserting a smaller value in a min binary heap Constant to insert the value at the end. Must swap with a..