Scribd
Upload
11 views1 page

Algo3 Syllabus

This document is a course outline for "CS-261 Algorithm Design and Analysis" taught by Huang Runhe. The goal of the course is to enhance students' knowledge of data structures and skills in applying associated algorithms. It will cover reviewing data structures and algorithms related to trees and graphs, as well as techniques for algorithm analysis and design. Students will learn to lay a good foundation of data structures and algorithms and comprehensively understand algorithm analysis and design skills. The course will be taught through review, introduction of analysis techniques, and design methods for problem solving. Student achievement will be evaluated based on mid-term exercises and a final exam.

Uploaded by

aaroon black
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
11 views1 page

Algo3 Syllabus

This document is a course outline for "CS-261 Algorithm Design and Analysis" taught by Huang Runhe. The goal of the course is to enhance students' knowledge of data structures and skills in applying associated algorithms. It will cover reviewing data structures and algorithms related to trees and graphs, as well as techniques for algorithm analysis and design. Students will learn to lay a good foundation of data structures and algorithms and comprehensively understand algorithm analysis and design skills. The course will be taught through review, introduction of analysis techniques, and design methods for problem solving. Student achievement will be evaluated based on mid-term exercises and a final exam.

Uploaded by

aaroon black
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 1

情報科学部：標準レイアウト｜ 2017/3/15 – 9:24

KA310-【CS-261 】

アルゴリズムの設計と解析

黄潤和
必選区分： ｜ 配当年次／単位：年次／単位 ｜ 開講時期：

【授業の概要と目的（何を学ぶか）】 15 Final review Summary of what learned so


管 理 ID： The goal of this course is to enhance students’ knowledge of far
1706755
data strcture and skill of applying associated algorithms. This 【授業時間外の学習（準備学習・復習・宿題等）】
授業コード：
J0336 course will cover the content review of learned data structures Read related contents and topics from the Internet
and algorithms related tree and graph, and plus algorithm
【テキスト（教科書）】
analysis and design techniques.
"Introduction to
【到達目標】 The design and Analysis of Algorithms", Anany Levitin,
The objectives of this course are to make students firmly laying Pubisher: Pearson,
good foundation of data structures and algorithms, and one- ISBN-13: 978-0-13-231681-1
step further comprehensively understanding algorithm analy-
【参考書】
sis and having design skills and techniques as genral problem
書名: Introduction to Algorithms, Third Edition
solving strategies.
著者: Thomas H. Cormen, Charles E. Leiserson, Ronald L.
【授業の進め方と方法】 Rivest and Clifford Stein
- Review some parts of the content about data structures and 出版社: The MIT Press
algorithms learned previously 出版年: 2009 年
- Introduce some contents on algorithm analysis techniques
【成績評価の方法と基準】
- Learn some design techinqies for problem solving
中間課題 (20%) と定期試験 (80%)
【授業計画】
【学生の意見等からの気づき】
回 テーマ 内容
Interested in students’ requirements
1 Review data Tree structures
structures and -concepte, terms
algorithms (1)
2 Review Search tree
-basic tree -algorithms and analysis
algorithm -demo
3 Other Trees (1) 2-3-4 Tree
-algorithms and analysis
-demo
4 Other Trees (2) Red-Black tree
-algorithms and analysis
-demo
5 Review data Graphs
structures and -concepts, terms,
algorithms (2) -applications
6 Shortest path Weighted graph
problems -one-point shortest path
algorthm problem
-all-pairs shortest paths
algorithm problem
7 Basic gragh DFS and BFS
-properties
-analysis
-demo
8 Mid-term exercises Work in class
-do exercises
-explain solutions
9 Single-source -cooncepts
shortest path -terms
algorthm -Dijkstra’s algorithm
10 All-pairs shortest algorithms and analysis
paths algorithms -multiplication
-Floyd-Washall algorithm
11 Minimal spanning MST algorithms
trees -Prim’s algorithm
-Kruskal’s algorithm
12 Graph application Travel salesman problem
13 Decision Tree Decision tree algorithms
- for sorting
- for searching
14 Limitations of - P and NP problems
algorrtihm power - NP-complete problems

—1—

You might also like