YouTube links for Information System Technology Lecture (Python, C++)
|
Lecture (Python) |
Address |
|
(POSTECH IST: Python 1) Basic |
|
|
(POSTECH IST: Python 2) String |
|
|
(POSTECH IST: Python 3) List & Tuple |
|
|
(POSTECH IST: Python 4) Function |
|
|
(POSTECH IST: Extra) Knapsack Problem |
|
|
(POSTECH IST: Python 5) Generator |
|
|
(POSTECH IST: Python 6) Object-Oriented Programming |
|
|
(POSTECH IST: Python 7) Class, Module, Speed |
|
|
(POSTECH IST: Python 8) Exception Handling |
|
|
(POSTECH IST: Python 9) File I/O |
|
|
(POSTECH IST: Python 10) Data Structure |
|
|
(POSTECH IST: Python 11) NumPy |
|
|
(POSTECH IST: Python 12) Pandas |
|
|
(POSTECH IST: Python 13) Graph |
|
|
(POSTECH IST: Python 14) Graph (기온데이터 분석) |
|
|
(POSTECH IST: Python 15) Graph (인구데이터 분석) |
|
|
(POSTECH IST: Extra) Traveling Salesman Problem |
|
|
(POSTECH IST: Python 16) GUI |
|
|
(POSTECH IST: Python 17) Ch3. Algorithm Analysis |
|
|
(POSTECH IST: Python 18) P, NPC, NP-hard |
|
|
(POSTECH IST: Python 19) Ch2. Software Development |
|
|
(POSTECH IST: Python 20) Ch4. Recursion |
|
|
(POSTECH IST: Python 21) Ch5. Array Based Sequence |
|
|
(POSTECH IST: Python 22) Ch6. Stacks |
|
|
(POSTECH IST: Python 23) Ch6. Queues and Deques |
|
|
(POSTECH IST: Extra) Shortest Path Problems |
|
|
(POSTECH IST: Python 24) Ch7. Linked Lists |
|
|
(POSTECH IST: Python 25-1) Ch8. Trees (General Trees) |
|
|
(POSTECH IST: Python 25-2) Ch8. Trees (Binary Trees) |
|
|
(POSTECH IST: Python 25-3) Ch8. Trees (Implementing) |
|
|
(POSTECH IST: Python 25-4) Ch8. Trees (Traversal) |
|
|
(POSTECH IST: Python 26-1) Ch9. Priority Queues |
|
|
(POSTECH IST: Python 26-2) Ch9. Adaptable Priority Queues |
|
|
(POSTECH IST: Python 27-1) Ch14. Graph Data Structure |
|
|
(POSTECH IST: Python 27-2) Ch14. Graph Algorithms |
|
|
(POSTECH IST: Python 28) Ch10. Maps & Hash Tables | https://youtu.be/y-bM1Y91ER0
|
|
(POSTECH IST: Python 29) Ch11. Binary Search Trees |
|
|
(POSTECH IST: Python 30) Ch11. Balanced Search Trees |
|
|
(POSTECH IST: Python 31) Web Crawling |
|
Lecture (C++) | Address |
(1-1) HelloWorld, Function Overloading, Namespace | |
(1-2) HelloWorld, Function Overloading, Namespace | |
(2) Pointer, Reference, New | |
(3) Recursive Function | |
(4-1) Class | |
(4-2) Constructor, Destructor | |
(5) Copy Constructor | |
(6) Friend, this, Declaration | |
(7) Vector Basic | |
(8-1) IOstream | |
(8-2) IOStream2 | |
(9) Parameter passing to main, time measure | |
(10) Operator Overloading | |
(11) Template | |
(12) Exception Handling | |
(13-1) Inheritance | |
(13-2) Inheritance, pointer | |
(13-3) Inheritance, Overriding | |
(14) STL | |
(15) STL – Iterator | |
(16) STL-Algorithms | |
(17) STL-Containers | |
(SP-1) Shortest Path(Dijkstra Algorithm) | |
(SP-2) Network Representation | |
(SP-3) A* Algorithm | |
(NP-1) Performance Analysis-Intro | |
(NP-2) Performance Analysis-Step Count | |
(NP-3) Performance Analysis-Mergesort Complexity | |
(NP-4) Performance Analysis-Asymptotic Bounds | |
(NP-5) NP-Complete | |
(NP-6) NP Complete Problems And Accurate Time Measure | |
(DS-1) Data Structure | |
(DS-2) Linear List-Array | |
(DS-3-1) Linear List-Linked List(1) | |
(DS-3-2) Linear List-Linked List(2) | |
(DS-4) Stack | |
(DS-5-1) Queues(1) | |
(DS-5-2) Queues(2) | |
(DS-6-1) Dictionaries | |
(DS-6-2) Hashing | |
(DS-7-1) Tree And Binary Tree(1) | |
(DS-7-2) Tree And Binary Tree(2) | |
(DS-8-1) Priority Queue(1) | |
(DS-8-2) Priority Queue(2) | |
(DS-9) Binary Search Tree | |
(DS-10) Balanced Binary Search Trees | |
(DS-11-1) Graphs(1) | |
(DS-11-2) Graph Spanning Tree(2) |