Algorithm starter exam, Study notes of Algorithms and Programming

Download Algorithm starter exam and more Study notes Algorithms and Programming in PDF only on Docsity!

Comp 160: Algorithms Kehao Mei Tufts University, Fall 2019 Homework 0

Question 1: Self introduction

1.1 Photo

a photo of me

1.2 Hobbies

1. soccer
2. piano
3. hiking
4. coffee

Question 2: Previous Knowledge

2.1 Known Topics

Mergesort divides input array in two halves, calls itself for the two halves and then merges the two sorted halves

Quicksort picks an element as pivot and partitions the given array around the picked pivot.

Heapsort is a comparison based sorting technique based on Binary Heap data structure

Selection Sort sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning.

2.2 Familiar Topics

• Euclid’s algoritm
• SVM algoritm

2.3 Unknown Topics

I am looking forward to learn the deep neural network, because it appears to be very effective in solving problems in machine learning. I want to master in this powerful tool.

Question 4: Fun Challenges

4.1 Formula

F ommula = sqrtπ + Ξ 2 Time Tue Wed Thu 12:15 EE104 EE 13:30 Magic Recitation 15:00 Math123 Math 16:30 Magic Magic

4.2 Figure

magic point

4.3 Command

The simpsons package allows us to insert characters from the Simpsons directly.