Term 2-1 (2019) I111 Algorithms and Data Structures
This is a support web page for
I111 Algorithms and Data Structures held in term 2-1, 2019 in Ishikawa
Campus, JAIST.
This page is maintained by Ryuhei UEHARA,
and the course is taught by Prof. Ryuhei UEHARA
and Prof. Giovanni Viglietta.
Information
- Basic Information
-
- Syllabus
- Archives
- Classroom: Main hall of Information Science
- Lectures: Mondays (9:00-10:40) and Wednesdays (10:50-12:30)
- Tutorial Hour: Mondays (13:30-15:10)
- Schedule and Slides
-
- 10/16(Wed) 1.Basic Programming : Computing largest element, sum of input data
(Slides)
- 10/21(Mon) 2.Foundation of Algorithms : importance of analysis
(Slides)
- 10/23(Wed) 3.Searching(1): Sequential search, m-block and double m-block algorithms
(Slides)
- 10/28(Mon) 4.Searching(2): Searching (2): Binary Search and Hash Method
(Slides)
- 10/30(Wed) 5.Data Structures (1): Linked List and Binary Search Tree
(Slides)
- 11/06(Wed) 6. Data Structures (2): Stack, Queue, and Heap
(Slides)
- 11/11(Mon) 7. Data Structure(3): Binary Search Tree and its balancing
(Slides)
- 11/11(Mon) Mid-term examination at tutorial hour (13:30-15:10).
- 11/13(Wed) 8. Sorting(1): Bubble, insertion, and heap Sort
(Slides)
- 11/18(Mon) 9. Sorting(2): Merge sort, quick sort, analysis, and counting sort
(Slides)
- 11/20(Wed) 10. Graph Algorithms(1): Graph Representations, Breadth-First Search, and Depth-First Search
(Slides)
- 11/25(Mon) 11. Advanced Algorithm: Dynamic Programming
(Slides)
- 11/27(Wed) 12.Numerical Algorithms (1): Basic Arithmetic Operations
(Slides)
- 11/28(Thu;9:00-10:40) 13. Numerical Algorithms (2)
(Slides)
- 12/02(Mon) 14. Numerical Algorithms (3)
(Slides
and source code in C)
- 12/4(Wed) 10:50-12:30 Final examination.
- Reports and etc.
-
- Schedules for cancelations
-
- Misc.
-
- 2019/10/08: This page is on public on the Web.
Last modified: Thu May 28 15:17:24 JST 2015
by Ryuhei Uehara (uehara@jaist.ac.jp)
|
|