<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
<meta name="Generator" content="Microsoft Word 14 (filtered medium)">
<!--[if !mso]><style>v\:* {behavior:url(#default#VML);}
o\:* {behavior:url(#default#VML);}
w\:* {behavior:url(#default#VML);}
.shape {behavior:url(#default#VML);}
</style><![endif]--><style><!--
/* Font Definitions */
@font-face
{font-family:Calibri;
panose-1:2 15 5 2 2 2 4 3 2 4;}
@font-face
{font-family:Consolas;
panose-1:2 11 6 9 2 2 4 3 2 4;}
@font-face
{font-family:"Script MT Bold";
panose-1:3 4 6 2 4 6 7 8 9 4;}
@font-face
{font-family:"Eras Bold ITC";
panose-1:2 11 9 7 3 5 4 2 2 4;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
{margin:0in;
margin-bottom:.0001pt;
font-size:11.0pt;
font-family:"Calibri","sans-serif";}
a:link, span.MsoHyperlink
{mso-style-priority:99;
color:blue;
text-decoration:underline;}
a:visited, span.MsoHyperlinkFollowed
{mso-style-priority:99;
color:purple;
text-decoration:underline;}
p.MsoPlainText, li.MsoPlainText, div.MsoPlainText
{mso-style-priority:99;
mso-style-link:"Plain Text Char";
margin:0in;
margin-bottom:.0001pt;
font-size:11.0pt;
font-family:"Calibri","sans-serif";}
span.PlainTextChar
{mso-style-name:"Plain Text Char";
mso-style-priority:99;
mso-style-link:"Plain Text";
font-family:"Calibri","sans-serif";}
span.EmailStyle19
{mso-style-type:personal-compose;
font-family:"Calibri","sans-serif";
color:windowtext;}
.MsoChpDefault
{mso-style-type:export-only;
font-size:10.0pt;
font-family:"Calibri","sans-serif";}
@page WordSection1
{size:8.5in 11.0in;
margin:1.0in 1.0in 1.0in 1.0in;}
div.WordSection1
{page:WordSection1;}
--></style><!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1027" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]-->
</head>
<body lang="EN-US" link="blue" vlink="purple">
<div class="WordSection1">
<p class="MsoNormal"><!--[if gte vml 1]><v:shapetype id="_x0000_t75" coordsize="21600,21600" o:spt="75" o:preferrelative="t" path="m@4@5l@4@11@9@11@9@5xe" filled="f" stroked="f">
<v:stroke joinstyle="miter" />
<v:formulas>
<v:f eqn="if lineDrawn pixelLineWidth 0" />
<v:f eqn="sum @0 1 0" />
<v:f eqn="sum 0 0 @1" />
<v:f eqn="prod @2 1 2" />
<v:f eqn="prod @3 21600 pixelWidth" />
<v:f eqn="prod @3 21600 pixelHeight" />
<v:f eqn="sum @0 0 1" />
<v:f eqn="prod @6 1 2" />
<v:f eqn="prod @7 21600 pixelWidth" />
<v:f eqn="sum @8 21600 0" />
<v:f eqn="prod @7 21600 pixelHeight" />
<v:f eqn="sum @10 21600 0" />
</v:formulas>
<v:path o:extrusionok="f" gradientshapeok="t" o:connecttype="rect" />
<o:lock v:ext="edit" aspectratio="t" />
</v:shapetype><v:shape id="Double_x0020_Brace_x0020_1" o:spid="_x0000_s1026" type="#_x0000_t75" style='position:absolute;margin-left:-6pt;margin-top:1.6pt;width:172.5pt;height:63.75pt;z-index:-251658752;visibility:visible;mso-width-percent:0;mso-height-percent:0;mso-wrap-distance-left:9pt;mso-wrap-distance-top:0;mso-wrap-distance-right:9pt;mso-wrap-distance-bottom:0;mso-position-horizontal:absolute;mso-position-horizontal-relative:text;mso-position-vertical:absolute;mso-position-vertical-relative:text;mso-width-percent:0;mso-height-percent:0;mso-width-relative:margin;mso-height-relative:margin'>
<v:imagedata src="cid:image001.png@01D286AF.6DB8EBC0" o:title="" />
<o:lock v:ext="edit" aspectratio="f" />
</v:shape><![endif]--><![if !vml]><span style="mso-ignore:vglayout;position:absolute;z-index:251657726;margin-left:-8px;margin-top:2px;width:230px;height:85px"><img width="230" height="85" src="cid:image001.png@01D286AF.6DB8EBC0" v:shapes="Double_x0020_Brace_x0020_1"></span><![endif]><span style="font-size:36.0pt;font-family:"Eras Bold ITC","sans-serif"">
aPECc <o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:36.0pt;font-family:"Eras Bold ITC","sans-serif""><o:p> </o:p></span></p>
<p class="MsoNormal"><span style="font-size:16.0pt;font-family:"Times New Roman","serif"">The Second Annual Programming Efficiency
</span><span style="font-size:10.0pt;font-family:"Times New Roman","serif"">mini </span>
<span style="font-size:16.0pt;font-family:"Times New Roman","serif"">Conference and Challenge<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:12.0pt;font-family:"Times New Roman","serif"">will be held on Friday, 4/14/2017 by the Department of Computer Science and Information Systems at 1:00pm.<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:12.0pt;font-family:"Times New Roman","serif""><o:p> </o:p></span></p>
<p class="MsoNormal"><span style="font-size:12.0pt;font-family:"Times New Roman","serif"">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.<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:12.0pt;font-family:"Times New Roman","serif""><o:p> </o:p></span></p>
<p class="MsoNormal"><b><span style="font-size:14.0pt;font-family:"Times New Roman","serif";color:red;background:yellow;mso-highlight:yellow">LEVEL 1</span></b><span style="font-size:12.0pt;font-family:"Times New Roman","serif""> – Find all the mode(s) in a
huge data set without copying or rearranging the data<o:p></o:p></span></p>
<p class="MsoNormal"><b><span style="font-size:14.0pt;font-family:"Times New Roman","serif";color:red;background:yellow;mso-highlight:yellow">LEVEL 2</span></b><span style="font-size:12.0pt;font-family:"Times New Roman","serif""> – 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.<o:p></o:p></span></p>
<p class="MsoNormal"><b><span style="font-size:14.0pt;font-family:"Times New Roman","serif";color:red;background:yellow;mso-highlight:yellow">LEVEL 3</span></b><span style="font-size:12.0pt;font-family:"Times New Roman","serif""> – 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.<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:12.0pt;font-family:"Times New Roman","serif""><o:p> </o:p></span></p>
<p class="MsoNormal"><span style="font-size:12.0pt;font-family:"Times New Roman","serif"">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.
<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:12.0pt;font-family:"Times New Roman","serif""><o:p> </o:p></span></p>
<p class="MsoNormal"><span style="font-size:12.0pt;font-family:"Times New Roman","serif"">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.<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:12.0pt;font-family:"Times New Roman","serif""><o:p> </o:p></span></p>
<p class="MsoNormal"><span style="font-size:12.0pt;font-family:"Times New Roman","serif"">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:<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:12.0pt;font-family:"Times New Roman","serif""><o:p> </o:p></span></p>
<p class="MsoPlainText"><a href="http://www.tamuc.edu/academics/colleges/scienceEngineeringAgriculture/departments/computerScienceInformationSystems/announcements/aPECc_2017.aspx">http://www.tamuc.edu/academics/colleges/scienceEngineeringAgriculture/departments/computerScienceInformationSystems/announcements/aPECc_2017.aspx</a><o:p></o:p></p>
<p class="MsoNormal"><span style="font-size:12.0pt;font-family:"Times New Roman","serif"">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
<b><span style="color:red;background:yellow;mso-highlight:yellow">March 27, 2017</span></b>.<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-size:12.0pt;font-family:"Times New Roman","serif""><o:p> </o:p></span></p>
<p class="MsoNormal"><span style="font-size:12.0pt;font-family:"Times New Roman","serif"">Happy Problem Solving and Programming,<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-family:"Script MT Bold""><o:p> </o:p></span></p>
<p class="MsoNormal"><span style="font-family:"Script MT Bold"">Daniel Creider</span>, PhD<o:p></o:p></p>
<p class="MsoNormal"><span style="font-family:"Times New Roman","serif"">Associate Professor<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-family:"Times New Roman","serif"">Computer Science and Information Systems<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-family:"Times New Roman","serif"">Texas A&M University-Commerce<o:p></o:p></span></p>
<p class="MsoNormal"><span style="font-family:"Times New Roman","serif"">903-886-5407<o:p></o:p></span></p>
<p class="MsoNormal"><o:p> </o:p></p>
</div>
</body>
</html>