Channi Studies

Let's go through a case study of data science to understand what is it about. Black Americans Are Much More Likely to Face Tax Audits, Study Finds (Published 2023)A new report documents systemic discrimination in how the I.R.S. selects taxpayers to be audited, with implications for a debate on the agency’s funding.www.nytimes.comNew York times reported said that the IRS seems to be exhibiting s..

Python 함수를 다룰 때에, nested function definition에서 inner function의 함수 프레임에서, 상위 프레임의 변수를 수정하려고 하면 오류가 발생합니다. n을 함수 인자로 받아, n번 특정 문자를 출력해주는 또 다른 함수를 반환하는 print_n_times 함수에 대해서 알아보겠습니다. def print_n_times(n): def a(word): times = n while times: print(word) times -= 1 return a print_n_times(2)("hey")최초 인자로 전달된 n (2)를 times 라는 a 함수 내의 로컬 변수로 복사한 뒤, 해당 변수를 통해 ..

A topological sort of a directed, acyclic graph produces a list of graph's vertices such that for every edge from a vertex X to a vertex Y, X comes before Y in the list. There can be more than one valid topoligcal sort. Again, the graph must be acyclic and riected in order to apply topological sorting. The time complexity and space complexity of topological sorting is O(|V| + |E|).

The Bellman-Ford shortest path algorithm, created by Richard Bellman and Lester Ford, Jr,. determines the shortest path from a start vertex to each vertex in a graph. For each vertex, the Bellman-Ford algorithm determines the vertex's distance and predecessor pointer. A vertex's distance is the shortest path distance from the start vertex. A vertex's predecessor pointer points to the previous ve..