Scribd Logo
Upload

Welcome to Scribd!

  • Course Information

    Uploaded by

    lyhoangkhang831
    5 views7 pages
    This document outlines the syllabus for a course on design and analysis of algorithms. It provides information on lectures, prerequisites, required reading, grading, goals, and topics to be covered including algorithms analysis, sorting algorithms, divide and conquer, greedy algorithms, dynamic programming, backtracking, and branch and bound. The goal is for students to be able to turn algorithm descriptions into code, write code efficiently, and learn theory through coding.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines the syllabus for a course on design and analysis of algorithms. It provides information on lectures, prerequisites, required reading, grading, goals, and topics to be covered including algorithms analysis, sorting algorithms, divide and conquer, greedy algorithms, dynamic programming, backtracking, and branch and bound. The goal is for students to be able to turn algorithm descriptions into code, write code efficiently, and learn theory through coding.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    5 views7 pages

    Course Information

    Uploaded by

    lyhoangkhang831
    This document outlines the syllabus for a course on design and analysis of algorithms. It provides information on lectures, prerequisites, required reading, grading, goals, and topics to be covered including algorithms analysis, sorting algorithms, divide and conquer, greedy algorithms, dynamic programming, backtracking, and branch and bound. The goal is for students to be able to turn algorithm descriptions into code, write code efficiently, and learn theory through coding.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 7

    Design and Analysis of

    Algorithms

    Click to add Text

    Lâm Hoài Bảo - Department of Software Engineering


    lhbao@cit.ctu.edu.vn
    Lectures

     Group 6: 123 Monday morning 205B1


     Group 7: 123 Wednesday morning 302D1
     Group 8: 678 Friday afternoon 205B1
     Group H01: Thursday, Hòa An

     Computer lab on these time slots as well (to be


    later)

    2
    Prerequisites

     Familiarity with C
     CT103 - Data structures: “hard” prerequisites

    3
    Reading

     Cormen, Thomas, Charles Leiserson, Ronald Rivest,


    and Clifford Stein. Introduction to Algorithms. 3rd ed. MIT
    Press, 2009. ISBM: 9780262033848
     Nguyen Van Linh. Phân tích và thiết kế thuật toán. Đại
    học Cần Thơ, 2013

    4
    Grading

     Midterm lab exam: 20%


     Final writing exam: 50%
     Final lab exam: 30%

    5
    Goal

     Turn algorithm descriptions into real code


     Efficiently write code
     Write efficient code
     Learn theory from code

    6
    Syllabus

     Algorithms Analysis
     Sorting Algorithms
     Divide and Conquer
     Greedy
     Dynamic Programming
     Back Tracking
     Branch and Bound

    You might also like