Lecture Notes and Handouts

Lecture notes are placed in here for your reference.  Some interesting Web resources are placed in the reference page.

Lecture Notes

• Lecture00: Course information (00CourseInfo.pdf)
• Lecture01: Basic concepts (01BasicConcepts.pdf)
• Lecture02: C++ review (02CppReview.pdf)
• Lecture03: Arrays (03Arrays.pdf)
• Lecture04: Stacks and Queues (04StacksAndQueues.pdf)
• Lecture05: Linked Lists (05LinkedLists.pdf)
• Lecture06: Trees (06Trees.pdf)
• Lecture07: Graphs (07Graphs.pdf)
• Lecture08: Sorting1: Internal Sorting (08Sorting1.pdf)
• Lecture09: Sorting2: External Sorting (09Sorting2.pdf)

Articles

• Padillo, F., Luna, J.M., Cano, A., Ventura, S. (2016). A Data Structure to Speed-Up Machine Learning Algorithms on Massive Datasets. In: Martínez-Álvarez, F., Troncoso, A., Quintián, H., Corchado, E. (eds) Hybrid Artificial Intelligent Systems. HAIS 2016. Lecture Notes in Computer Science, vol 9648. Springer, Cham. (https://doi.org/10.1007/978-3-319-32034-2_31)
• Matthew Hutson (2023). DEEPMIND AI IMPROVES DATA-SORTING ALGORITHMS. Nature 618, 443-444, 2023. (https://doi.org/10.1038/s41586-023-06004-9)
• Mankowitz, D.J., Michi, A., Zhernov, A. et al. (2023). Faster sorting algorithms discovered using deep reinforcement learning. Nature 618, 257-263, 2023. (https://doi.org/10.1038/s41586-023-06004-9)