Data Structure

자료구조 복습을 위한 코딩 레포입니다.

스케쥴에 제시된 회차에 맞춰 알고리즘을 코딩해 올려주시면 됩니다.

요일: 화 / 목
시간: 11시 ~
장소: 도서관 스터디실 및 카페

스터디 방식 : 코딩 및 깃으로 제출, 주석 처리, 리뷰

자료구조 스터디 일정(매주 화, 목)

###1주차(1/3, 1/5)

####Tue

• Selection sort
• Binary search&Recursive binary search
• Recursion(Permutation)

####Thu

• Polynomial
• Stack

###2주차(1/10, 1/12)

####Tue

• Circular Queue
• A Maze Problem

####Thu

• Postfix Evaluation
• Multiple Stacks

###3주차(1/17, 1/19)

####Tue

• Singly Linked list
• Multiple linked stacks
• Multiple linked queue

####Thu

• Linked Polynomial
• Circular list& Recycle list
• Doubly linked list

###4주차(1/24, 1/26)

####Tue

• Binary Trees(Postorder, Inorder, Preorder, Level Order)
• Copy Tree
• Evaluation Tree

####Thu

• Threaded Binary Tree
• Heap(Max, Min, Insertion, Deletion)

###5주차(1/31, 2/2)

####Tue

• Binary Search Tree
• AVL Tree

####Thu

• Depth First search
• Breadth-First Search

###6주차(2/7, 2/9)

####Tue

• Dijkstra’s algorithm

####Thu

• Floyd-Warshall algorithm
• Bubble Sort
• Insertion Sort

###7주차(2/14, 2/16)

####Tue

• Quick Sort
• Heap Sort
• Merge Sort(Downward/Upward pass for partition)

####Thu

• Radix Sort
• Hashing