National Tsing Hua University ® copyright OIA National Tsing Hua University HSA HW2.

Slides:



Advertisements
Similar presentations
Problem Solving 5 Using Java API for Searching and Sorting Applications ICS-201 Introduction to Computing II Semester 071.
Advertisements

Announcements Homework #8 due Monday at 6:00pm Reference implementation coming soon! Upcoming office hours: Tomorrow: Chris 1:30-3pm, Swati 6:30-7:30pm.
Main Index Contents 11 Main Index Contents Week 10 – Recursive Algorithms.
Final Exam Preview Chapter 4,5,6,7,8,9. Remember to evaluate CS221  Go to  Ends tonight.
C++ data types. Structs vs. Classes C++ Classes.
COMS S1007 Object-Oriented Programming and Design in Java July 15, 2008.
Homework #5, Binary Trees CS-2301 B-term Homework #5 Binary Trees CS-2301, System Programming for Non-majors (Slides include materials from The C.
CS211 Data Structures Sami Rollins Fall 2004.
Discussion 2: PA1 Siarhei Vishniakou CSE 100 Summer 2014.
CS 101 Problem Solving and Structured Programming in C Sami Rollins Spring 2003.
1 Project 7: Huffman Code. 2 Extend the most recent version of the Huffman Code program to include decode information in the binary output file and use.
Operating System Program 5 I/O System DMA Device Driver.
CS162B: Assembly and C Jacob T. Chan. Objectives ▪ System calls ▪ Relation of System calls to Assembly and C ▪ Special System Calls (exit, write, print,
2012/06/22 Contents  GPU (Graphic Processing Unit)  CUDA Programming  Target: Clustering with Kmeans  How to use.
Data Structures - CSCI 102 Binary Tree In binary trees, each Node can point to two other Nodes and looks something like this: template class BTNode { public:
Computer Architecture B-tree construction & Traversal YongSoo Bae Room 236, Engineering Building [Project 1]
Review for Final Andy Wang Data Structures, Algorithms, and Generic Programming.
Data Structures and Algorithm Analysis Trees Lecturer: Jing Liu Homepage:
CSC 221: Recursion. Recursion: Definition Function that solves a problem by relying on itself to compute the correct solution for a smaller version of.
Instructor: Alexander Stoytchev CprE 185: Intro to Problem Solving (using C)
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
Final Exam Review CS Total Points – 60 Points Writing Programs – 50 Points Tracing Algorithms, determining results, and drawing pictures – 50.
HW4: Due Nov 24th 23:59 1.Describe test cases to reach full path coverage of the triangle program by completing the path condition table below. Also, draw.
CS 1308 Exam 2 Review. Exam Format 110 Total Points 24 Points Short Answer 28 Points Fill in the Blank 16 Points T/F 36 Points Multiple Choice The above.
Instructor: Alexander Stoytchev CprE 185: Intro to Problem Solving (using C)
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
CPSC 871 John D. McGregor Module 8 Session 3 Assignment.
1 Project 3 String Methods. Project 3: String Methods Write a program to do the following string manipulations: Prompt the user to enter a phrase and.
Homework 1 (due:April 10th) Deadline : April 10th 11:59pm Where to submit? eClass 과제방 ( How to submit? Create a folder. The name.
Homework 1 (due:April 8th) Deadline : April 8th 11:59pm Where to submit? eClass “ 과제방 ” ( How to submit? Create a folder. The name.
National Tsing Hua University ® copyright OIA National Tsing Hua University HSA HW1.
Final Exam Review CS Total Points – 20 Points Writing Programs – 65 Points Tracing Algorithms, determining results, and drawing pictures – 50.
GPU Programming Contest. Contents Target: Clustering with Kmeans How to use toolkit1.0 Towards the fastest program.
1 Project 5: Leap Years. 222 Leap Years Write a program that reads an integer value from the user representing a year and determines if the year is a.
1 Project 4: Computing Distance. 222 Computing Distance Write a program to compute the distance between two points. Recall that the distance between the.
Homework 2 (due:April 17th) Deadline : April 17th 11:59pm Where to submit? eClass “ 과제방 ” ( How to submit? Create a folder. The.
Semantic Analysis. Find 6 problems with this code. These issues go beyond syntax.
Homework 1 (due:April 13th) Deadline : April 13th 11:59pm Where to submit? eClass 과제방 ( How to submit? Create a folder. The name.
C++ Memory Management – Homework Exercises
NFV Compute Acceleration APIs and Evaluation
Homework 1 Simple code generator
Homework 3 (due:May 27th) Deadline : May 27th 11:59pm
Instructor: Alexander Stoytchev
Homework Assignment #1 J. H. Wang Oct. 11, 2016.
Lab. on Finite State Machine
CMPT 238 Data Structures Instructor: Tina Tian.
Easy way to debug with VCS
Homework 3 (due:June 5th)
106 Data Structure Homework 1
Discussion Section 3 HW1 comments HW2 questions
Instructor: Alexander Stoytchev
Instructor: Alexander Stoytchev
Fall 2009 B+ Tree Recitation
Operation System Program 4
ICS 143 Principles of Operating Systems
Announcements Homework #7 due Monday at 3:00pm
Chapter 19 Binary Search Trees.
Determining Compliance
Lists in Python Outputting lists.
Binary Trees: Motivation
Warm up Do Problems 20 and 22.
Homework 2 (due:May 15th) Deadline : May 15th 11:59pm
Homework 1 (due:April 17th)
Final Review Bina Ramamurthy 4/15/2019 BR.
Homework 2 (due:May 5th) Deadline : May 5th 11:59pm
105-1 Data Structure Homework 1
HW4: Due Nov 22nd 23:59 Describe test cases to reach full path coverage of the triangle program by completing the path condition table below. Also,
Homework 2 (due:May 13th) Deadline : May 11th 11:59pm
107-1 Data Structure Homework 2
CS 11 – April 1 Review steps for lab #3
Presentation transcript:

National Tsing Hua University ® copyright OIA National Tsing Hua University HSA HW2

National Tsing Hua University ® copyright OIA National Tsing Hua University HW1 In this homework, we want you to write Binary Search Tree in OpenCL. – You need to implement your program by SVM API. And also you need to write a makefile to compile your program. We want you to get input data by environment argument. – Ex../a.out input1.txt search_data.txt

National Tsing Hua University ® copyright OIA National Tsing Hua University Input data In the input file, the first number will be the number of elements. – For example : In search key, there is a element we want to search. And you need to build your own Binary Tree via SVM API on GPU side.

National Tsing Hua University ® copyright OIA National Tsing Hua University Output format You need to print the traverse order of your binary tree. Assume we want to search element 4. Print : 0 -> 1 -> 4 If no element found. Print : element not found.

National Tsing Hua University ® copyright OIA National Tsing Hua University HW2 We want you to write not only GPU part, but a CPU side to verify the answer of GPU. Please register your final project and teammate. Don't copy others code, you will get 0 points. DEADLINE : 4/6 11:55pm