Download presentation
Presentation is loading. Please wait.
Published byAlbert Simmons Modified over 9 years ago
1
National Tsing Hua University ® copyright OIA National Tsing Hua University HSA HW2
2
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
3
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 : 5 1 2 3 4 5 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.
4
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.
5
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
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.