Scribd
Upload
2 views3 pages

Syllabus Form - Algorithm (36h) Progress

The document is a course syllabus for 'Introduction to Algorithm' at the University of Science and Technology of Hanoi, taught by Hoang Do Thanh Tung. It outlines the course structure, including credit points, teaching schedule, prerequisites, objectives, assessment methods, and recommended textbooks. The course aims to introduce students to basic algorithms, their expressions in pseudocode and diagrams, and includes various topics such as algorithm analysis and recursion.

Uploaded by

tuộc bạch
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views3 pages

Syllabus Form - Algorithm (36h) Progress

The document is a course syllabus for 'Introduction to Algorithm' at the University of Science and Technology of Hanoi, taught by Hoang Do Thanh Tung. It outlines the course structure, including credit points, teaching schedule, prerequisites, objectives, assessment methods, and recommended textbooks. The course aims to introduce students to basic algorithms, their expressions in pseudocode and diagrams, and includes various topics such as algorithm analysis and recursion.

Uploaded by

tuộc bạch
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

University of Science and Technology of Hanoi

Address: Building A21, 18 Hoang Quoc Viet, Cau Giay, Hanoi


Telephone/ Fax: +84-4 37 91 69 60
Email: officeusth@[Link]
Website: [Link]

COURSE SYLLABUS
Subject: Introduction to Algorithm Academic field:

Lecturer: Hoang Do Thanh Tung

Phone: 0914344501 E-mail: tunghdt@[Link]

Academic year:

COURSE DESCRIPTION

Credit points 3 ECTS


Level Undergraduate
Teaching time 4/05– 31/6/2022
Location University of Science and Technology of Hanoi
Lecture 26 hrs
Tutorial 0 hrs
Time Commitment
Practice 10 hrs
Total 36 hrs

Prerequisites ICT1.2 Basic programming

Recommended
Structure programming (if not, self-studying)
background knowledge
The course provides “Introduction to Algorithm” which is used
for computer programming. The course helps the students, who
Subject description take the first algorithm course, to imagine what/why/how is
algorithms. Additionally, students will learn how to express an
algorithm as pseudocode and diagram.
Objectives: this course will introduce the students
• Theory: Basic algorithm
• Practice: Express algorithms.
Objectives & Out-come
Outcome:
• Understand basic algorithm
• Know how to express algorithms
Assessment/ Evaluation Attendance/Attitude 10 %
Page 1 / 3
University of Science and Technology of Hanoi
Address: Building A21, 18 Hoang Quoc Viet, Cau Giay, Hanoi
Telephone/ Fax: +84-4 37 91 69 60
Email: officeusth@[Link]
Website: [Link]

Class exercise(s) 20 %
Assignment(s) 20 %
Report(s) 0%
Mid-term test 0%
Final exam 50 %
1. Jeff Erickson. Algorithms. Independently published. 2019.
2. Mark A. Weiss . Data Structures & Algorithm Analysis in
Prescribed Textbook(s)
C++ 4th Edition. Pearson, 2014.

3.

COURSE CONTENTS & SCHEDULE

Hours Ref./
Class

Contents Resource Assignment(


Lect

Exr.

Prc.

s)
.

s
Introduction 2 1
• Why to study algorithm?
1 1
• A few simple examples
• How to study algorithm
Writing down algorithms 2 1 3
2 • How to write down algorithms 1
• Pseudocode
Writing down algorithms 2 1
• Flowcharts
3 1
• Binary search
• Selection sort
Algorithm analysis 2 1 3
4 • Mathematical Background 1, 2

Algorithm analysis 2 1 1 (Mid-term


5 1, 2
• What to Analyse? test)
Algorithm analysis 2 1 2
1 (Mid-term
6 • Running-Time Calculations 1, 2
review)
2 1
7 Recursion 1
Page 2 / 3
University of Science and Technology of Hanoi
Address: Building A21, 18 Hoang Quoc Viet, Cau Giay, Hanoi
Telephone/ Fax: +84-4 37 91 69 60
Email: officeusth@[Link]
Website: [Link]

• What is recursion?
• Tower of Hanoi
Review and Summarize 1 2 2
8 1, 2
Notes:

- Abbreviation: Lect. (Lecture), Exr. (Exercise), Prc. (Practice).


- Assignments may include assignments, practical work, reports, exercises ...for each class
sessions

Reference Literature

[1]. Sanjoy Dasgupta. Algorithms. McGraw-Hill, 2006.

[2]. Cormen, Leiserson, Rivest, Introduction to Algorithms, 2nd Ed., MIT Press, 2001.

Page 3 / 3

You might also like