- Credit Value: 5.0
- Semester: Block 1 of Semester 2, 2023-2024
- Module Leader: Dr. Qi Chen (Qi.Chen02@xjtlu.edu.cn)
This module introduces key concepts in algorithm design and analysis, focusing on:
- Fundamental methods in data structures and algorithms
- Computationally hard problems and solutions
- Application of algorithms in various domains
- Algorithm Classes: Describe different algorithm classes and their design principles.
- Algorithm Design: Apply principles to create efficient algorithms.
- Data Structures: Use basic data structures for solving classical problems.
- Computational Intractability: Understand and demonstrate familiarity with NP-completeness.
- Mon 16:00 – 18:00: TC-AB-2003 / Qi Chen
- Tue 13:00 – 15:00: TC-AB-2003 / Qi Chen
- Wed 10:00 – 12:00: TC-AB-2003 / Qi Chen
- Thu 16:00 – 18:00: TC-E-2032 / Pascal Lefèvre
- Thu 18:00 – 19:00: TC-D-2001 / TC-D-3001 / Pascal Lefèvre
- Week 6, Thu 16:00 – 18:00: TC-E-2032 / Qi Chen
- Exam (60%): 2 hours, Week 6
- Coursework (40%): Deadline March 24th, 2024, 23:59 Beijing Time
- Week 1: Introduction, Growth of Functions, Divide-and-Conquer
- Week 2: Elementary Data Structures, Heapsort, Hash Tables
- Week 3: Dynamic Programming, Greedy Algorithms
- Week 4: Graph Algorithms, Minimum Spanning Trees
- Week 5: String Matching, NP-Completeness
- Week 6: Revision Q&A
- Introduction to Algorithms (3rd Edition), Thomas H. Cormen et al.
- Co-teacher: Dr. Pascal Lefèvre (Pascal.Lefevre@xjtlu.edu.cn)
- Teaching Assistants:
- Tong Chen (Tong.Chen19@student.xjtlu.edu.cn)
- Jingxuan Liu (Jingxuan.Liu19@student.xjtlu.edu.cn)
- Attendance: Required for all sessions; use AMS for recording.
- Coursework Submission: Via Learning Mall before the deadline.
- Academic Integrity: Strict adherence required; no Generative AI allowed.
- Support: Contact your Module Leader or Academic Advisor for assistance.