[VPAAEtal] aPECc - The Second Annual Programming Efficiency mini Conference and challenge

Academic Affairs vpaaetal at tamuc.edu
Tue Feb 14 10:45:16 CST 2017


  aPECc



The Second Annual Programming Efficiency mini Conference and Challenge

will be held on Friday, 4/14/2017 by the Department of Computer Science and Information Systems at 1:00pm.



This event is open to everyone at TAMUC without charge.  The programming challenge is open to all students, undergraduate and graduate, and the Department encourages students to demonstrate their problem solving and programming skills by competing with other students in the programming challenge.  This year there are three levels in the programming challenge all of which will require the development of an efficient algorithm (solution) and implementation in C/C++.  The programs will be required to process from 1 to 30 million data values that are in random order.



LEVEL 1 - Find all the mode(s) in a huge data set without copying or rearranging the data

LEVEL 2 - Find all the duplicate values in a huge data set and identify the value of the duplicate, the current location (element number in the array) and the location (element number) of the first occurrence of the value.

LEVEL 3 - Find and remove all the duplicate values from a data set with at least 1 million values without changing the order of the remaining values.



On the day of the event, the winners will be announced together with a description of the algorithm used by the winners to solve the problem.  The winners will be selected based on the least amount of time used to process the data and the least amount of work memory used in the algorithm.  The winning solutions selected will be required to be within a maximum time limit.  The time limit will not be announced but details can be obtained from Dr. Creider after a participant has tested their code for correct results.  Speed of the code is very important so a program must not take hours to complete the processing of 30 to 50 million values.  Work memory is defined as memory used to solve the problem in addition to the memory needed to store the original date set.



In addition to the announcement of the winners there will be a  tutorial about the beginning concepts of programming efficiency knows as PrOSC (Programmer Optimized Source Code).  These are  techniques implement by the programmer that can be used to improve the speed of the code which the compiler cannot implement.



Specific details about the programming requirements can be found by selecting the announcements link at the home page of the Department of  Computer Science and Information Systems.  The direct link is:



http://www.tamuc.edu/academics/colleges/scienceEngineeringAgriculture/departments/computerScienceInformationSystems/announcements/aPECc_2017.aspx

All questions about the event and the programming challenge should be directed to Dr. Creider.  The deadline for submitting code for the programming challenge is March 27, 2017.



Happy Problem Solving and Programming,



Daniel Creider, PhD

Associate Professor

Computer Science and Information Systems

Texas A&M University-Commerce

903-886-5407



-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.tamuc.edu/pipermail/vpaaetal/attachments/20170214/e3ae1755/attachment.html>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: image001.png
Type: image/png
Size: 1286 bytes
Desc: image001.png
URL: <http://mailman.tamuc.edu/pipermail/vpaaetal/attachments/20170214/e3ae1755/attachment.png>


More information about the VPAAEtal mailing list