<< Chapter < Page | Chapter >> Page > |
Vietnam National University, Hanoi
College of Technology
Data Structures and Algorithms
Student Manual
Office Hour:
8am – 5pm weekdays
Contact: Nguyen Viet Ha
Email: hanv@vnu.edu.vn
Phone: 7549016
Hanoi - 2007
This is the syllabus for Data Structures and Algorithms course intended for undergraduate programs. The following sections provide brief information about Purpose, Description, Objectives, Prerequisites, References Documents and Grades of the course.
This course and this Student Manual reflect a collective effort by your instructor. This
course is an important component of our academic program. Although it has been offered
for many years, this latest version represents an attempt to expand the range of sources of
information and instruction so that the course continues to be up-to-date and the methods
well suited to what is to be learned.
You will be asked from time-to-time to offer feedback on how the Student Manual is
working and how the course is progressing. Your comments will inform the development
team about what is working and what requires attention. Our goal is to help you learn
what is important about this particular field and to eventually succeed as a professional
applying what you learn in this course.
This Student Manual is designed to assist you through the course by providing specific
information about student responsibilities including requirements, timelines and
evaluations.
I hope you enjoy the course.
Contact Information
Faculty Information.
Name:Nguyen Viet HaOffice Location: 309 E3 Building
Email: hanv@vnu.edu.vn
Office Hours: 8am – 5pm weekdays
Support personnel – include all important contact information for:
The purpose of this course is to understand important problems, challenges, concepts and techniques from the field of Algorithms and Data Structures. In order to achieve this, students learn how to design efficient algorithms, evaluate their time and space complexity. More specifically, in this course, students will:
This course introduces base knowledge of algorithm design, elementary analysis of algorithms, and fundamental data structures. The emphasis is on choosing appropriate data structures and designing correct and efficient algorithms to operate on these data structures.
In computer programming, algorithms play an important role. You will learn in this course how to develop efficient algorithms, analyse their running time and implement them efficiently. We discuss sorting algorithms, searching, recursion, dynamic and graph algorithms.
Notification Switch
Would you like to follow the 'Data structures and algorithms' conversation and receive update notifications?