Sep 22 2014
4541.843
Kyomin Jung
Department of Electrical and Computer Engineering
Seoul National University
Running Time of Quick Sort
If |L|=|R|=n/2, we can obtain a recurrence equation for its
running time that is the same as for the Merge Sort:
b
T (
Cara Kerja
1.1
Uji Zat Warna Poliamida Golongan I
Uji Pencucian
1.
Dimasukkan contoh uji kedalam tabung reaksi yang berisi dengan 4
ml larutan sabun (0,5% sabun netral dan 0,2 % natrium karbonat).
2.
Dipanaskan selama 15 menit, kemudian contoh uji dikelu
Introduction
Note 1
Yunheung Paek
S Optimizations and Restructuring Research Group
Seoul National University
Topics
General course information
TAs, course web site
grading, exams, assignments
objectives of this course
class schedule
Algorithm Analysis
D
Sep 29 2014
4541.843
Kyomin Jung
Department of Electrical and Computer Engineering
Seoul National University
Dynamic Programming
Dynamic programming (DP) is an algorithm design
method used to solve wide variety of discrete
optimization problems such as s
Sep 03 2014
4541.843
Kyomin Jung
Department of Electrical and Computer Engineering
Seoul National University
Algorithms in the real world
In the real world, we want to design algorithms to estimate or
compute good solutions for real world problems.
Web S
Sep 15 2014
4541.843
Kyomin Jung
Department of Electrical and Computer Engineering
Seoul National University
Greedy Algorithm
Many real-world problems are optimization problems that
attempt to find an optimal solution among many possible
candidate soluti
Sep 01 2014
4541.843
Kyomin Jung
Department of Electrical and Computer Engineering
Seoul National University
Logistics
Instructor: Kyomin Jung (301 1005)
Email: [email protected]
Office hours: 16:00-17:00 Mondays and Wednesdays,
by appointment only
Grading
Oct 08 2014
4541.843
Kyomin Jung
Department of Electrical and Computer Engineering
Seoul National University
Dijkstra Algorithm : an Example
Compute the closest node v1 from s among
the revealed nodes.
Update the revealed information.
Compute the 2nd
Oct 06 2014
4541.843
Kyomin Jung
Department of Electrical and Computer Engineering
Seoul National University
Graph Algorithms
Many problems in algorithms can be modeled
by graphs with possible weights assigned to
their vertices or edges:
Hamiltonian
pat
Oct 01 2014
4541.843
Kyomin Jung
Department of Electrical and Computer Engineering
Seoul National University
Dynamic Programming Approach
Let
dij(m) : minimum distance of any path
from node i to node j
that contains at most m edges
Then, we can compute d
Sep 24 2014
4541.843
Kyomin Jung
Department of Electrical and Computer Engineering
Seoul National University
The Heap Data Structure
A heap is a nearly complete binary tree with the
following two properties:
Structural property: all levels are full, exce
Sep 17 2014
4541.843
Kyomin Jung
Department of Electrical and Computer Engineering
Seoul National University
Running Time Analysis
The combine step of merge-sort consists of merging two
sorted sequences takes at most bn steps for some constant b.
Likewis
Pada proses desizing dengan menggunakan oksidator hidrogen peroksida H2O2 dengan cara pad-steam
variasi waktu steam, diperoleh hasil pada persen pengurangan berat lebih besar dilakukan dalam waktu
5 menit yaitu 12.6 %. Dilihat dari variasi waktunya, semak
