Scandal at Chi's birthday... part 2!

Okay... kahit wala nang paper cranes. WIN na 'to e. May nagche-check pa ba ng Multiply? BBoys lang ang tagged ha!

Scandal at Chi's birthday... part 1!

I NEED HELP FROM ANYBODY WHO CAN GET THROUGH TO EMERGENCY NUMBERS. My family's stranded at home (70 St Therese Rd Provident Villages), the water's at the second floor, and the water is still rising. They need rescue. PLEASE PLEASE inform authorities.

I just really want to share something infuriating about blind rudeness. 'Cept I have to go home already.

Michael Shimamoto - Take Me Out of the Dark

ES26 grades out

06 April 2009: First chart of grades

Temporary chart of grades for ES26. The column that states 00 denotes those who do not have grades yet for one of the following reasons

• he/she has not yet taken the final exam
• he/she has not yet demo-ed his/her program
  
• he/she has a failing standing
  

At the moment, there's only one who has a failing standing after everything has been considered. One student has already received an INC mark for failing to submit a problem set, machine exercises, and the big machine problem.

Oh yeah, after considering all the bonus stuff I gave out and the 92-minimum to get a 1.0... parang umulan. That might be the last time I do that. Go check CRS to find out your own grade.

So now you resort to blackmail?

One more thing about this ES26 drama?  Blackmail.  Really now?  You'll resort to blackmailing me about my past when I'm already an open book anyway?  First off, you've already seen that I am not moved by bribery — much less blackmail.

For the benefit of those who are going to be reading this, I have been told that if I pursued giving a requirement that I gave anyway to persons who plagiarized my own work and submitted to myself, something that I've never mentioned since college will be revealed.

Well... unahan lang 'yan para mawala ang power ng blackmail mo.  Sure, I've been ashamed that I had to do it, but you have to realize that my source of income back then was just paltry change from quiz contests sponsored by orgs and measly stipends from my scholarship.

Yeah, so I figured in an adult video ...and that is particularly why I am opposed to the industry and how I have since forgotten about it.  The physical hurt isn't even as bad as the emotional scars I've experienced in the one and only time I was tempted to it and agreed to it.  I do not believe in regret, but I believe that one should live up to every consequence of every choice one makes.

I've never been one to back down from a challenge like this.  AHS boys know how for my very first long test, 13 students got suspended... for something much smarter than plagiarizing me.

Now question is: how did you find about the cheap movie?  You're patrons of depravity, aren't you?  You do realize that you're just as sick as those participating in this trade of flesh and fantasy.  At least I look good enough to appear in one of these.  What about you, tubby?

As for the video, here it is... of course with the appropriate parts bleeped, blurred, or cut.

ES26: List of students who have to demo their program

Since the deadline for the later submission has passed already, below is what many are waiting for...

Here are the unfortunate souls who will still have to demo their work prior to finishing ES26 this semester.    If you are already done with your demo, please email me FOLLOWING THE INSTRUCTIONS BELOW.  I am currently ignoring the inbox of my mail and focusing on this.  ONLY GRADUATING STUDENTS WILL BE ALLOWED TO DEMO ON SATURDAY.  You may find me at Coffee Bean and Tea Leaf at the Ayala Technohub on Saturday, 1.00p to 6.00p.  I am turning off my SMS filter for graduating students only (student numbers <= 2005) so you can contact me by mobile.  Tell me if and when you're coming.  You may bring your own notebook/laptop if you want.  Demos for graduating students (who are not exempted) will be accommodated until 02 April.  Everybody else may demo until 04 April.

xxxx-xx006 (done)
xxxx-xx076 (done)
xxxx-xx092
xxxx-xx097
xxxx-xx213 (done)
xxxx-xx266 (done)
xxxx-xx309
xxxx-xx329
xxxx-xx425 (done)
xxxx-xx478
xxxx-xx550
xxxx-xx632 (done)
xxxx-xx682 (done)
xxxx-xx823 (done)
xxxx-xx824 (done)
xxxx-xx880 (done)
xxxx-xx954 (done)
xxxx-xx966 (done)
xxxx-xx975 (done)
xxxx-xx982
xxxx-xx997 (done)

THIS LIST DOES NOT INCLUDE THOSE WHO WILL HAVE TO WORK ON mobwars.c.  If you are going to submit mobwars.c (due to unfortunate reasons we know have already happened and are ready to put behind us), you definitely have to demo and defend your work.

Guidelines for demo-ing your program: you'll be given 30 minutes for your demonstration.  First, compile your work.  Show that it runs.  I will ask for you to do some actions to prove your program is running well.  After, I will ask you to open your code and data files.  I will generate five (5) to seven (7) random numbers that correspond to lines in your program.  I wil ask you questions based on what are on these lines or around them.  This will validate that you understood what you (presumably you) did.  I will then change one of the segments of code on your program.  You must then predict what will happen to your program.  Good luck everyone!

Final exam scores and statistics

Student number	Male crush	Female crush	CB	Chosen letters	LB	Score
xxxx-xx006	xxxx-xx982	xxxx-xx308	0.0	ABCDEFGHIJKLMNOPQRSTUVWXYZ	0	37.0
xxxx-xx076	xxxx-xx315	xxxx-xx880	2.0	ABCDEFGHIJKLMNOPQRSTUVWXYZ	0	39.0
xxxx-xx083	— none —	— none —	0.0	AERSTN	0	71.0
xxxx-xx092	— none —	— none —	0.0	— none —	0	57.0
xxxx-xx093	xxxx-xx837	xxxx-xx093	0.0	IJKYZ	0	70.0
xxxx-xx102	— none —	— none —	0.0	RBPIS	0	49.0
xxxx-xx118	— none —	xxxx-xx431	2.0	BLU	0	85.0
xxxx-xx129	— none —	— none —	0.0	ACDEGKLI	0	75.0
xxxx-xx170	xxxx-xx315	xxxx-xx478	2.0	LJC	0	81.0
xxxx-xx174	xxxx-xx823	xxxx-xx702	0.0	ABCDEFGHIJKLMNOPQRSTUVWXYZ	0	79.0
xxxx-xx180	xxxx-xx252	xxxx-xx388	0.0	JXMQWC	0	50.0
xxxx-xx207	— none —	xxxx-xx309	0.0	— none —	0	75.0
xxxx-xx209	xxxx-xx315	— none —	2.0	ACEGIUNOQSVWY	0	71.0
xxxx-xx213	xxxx-xx118	xxxx-xx753	0.0	DMAB	0	47.0
xxxx-xx229	xxxx-xx229	xxxx-xx702	0.0	MCARSH	0	71.0
xxxx-xx237	xxxx-xx837	xxxx-xx425	0.0	ABCDJOVIRSEMNKLU	0	54.0
xxxx-xx252	xxxx-xx315	xxxx-xx702	2.0	ABCDEFGHIJKLMNOPQRSTUVWXYZ	0	67.0
xxxx-xx258	xxxx-xx092	xxxx-xx258	0.0	ABCDEFGHIJKLMNOPQRSTUVWXY	0	60.0
xxxx-xx266	— none —	— none —	0.0	QAC	0	44.5
xxxx-xx281	xxxx-xx092	xxxx-xx281	0.0	ILJYU	0	72.0
xxxx-xx290	xxxx-xx837	xxxx-xx431	2.0	WQXZY	0	64.0
xxxx-xx308	xxxx-xx229	xxxx-xx431	2.0	— none —	0	78.0
xxxx-xx329	xxxx-xx517	xxxx-xx425	0.0	QKVJMU	0	31.0
xxxx-xx388	xxxx-xx517	xxxx-xx388	0.0	ABCDEFGHIJKLMNOPQRSTUVWXYZ	0	62.0
xxxx-xx400	xxxx-xx837	xxxx-xx388	0.0	ABCDEVWXYZ	0	69.0
xxxx-xx425	xxxx-xx517	xxxx-xx329	0.0	XYZQV	0	34.0
xxxx-xx431	— none —	xxxx-xx431	2.0	ABCDEFGHIJKLMNOPQRSTUVWXYZ	0	64.0
xxxx-xx454	xxxx-xx315	xxxx-xx207	2.0	— none —	0	57.0
xxxx-xx478	xxxx-xx837	xxxx-xx431	2.0	N	0	41.0
xxxx-xx479	xxxx-xx479	xxxx-xx258	0.0	ABCDEFGHIJKLMNOPQXYZ	0	68.0
xxxx-xx517	xxxx-xx517	xxxx-xx329	0.0	BCDEFGHIJKLMNOPQRSTUVWXY	0	75.0
xxxx-xx550	xxxx-xx837	xxxx-xx093	0.0	DIVKN	0	23.0
xxxx-xx585	xxxx-xx129	xxxx-xx702	0.0	Q	0	61.0
xxxx-xx615	xxxx-xx837	xxxx-xx478	0.0	G	0	51.0
xxxx-xx622	xxxx-xx315	xxxx-xx431	10.0	AEIOU	0	78.0
xxxx-xx632	xxxx-xx315	xxxx-xx315	2.0	T	0	54.0
xxxx-xx661	— none —	xxxx-xx431	2.0	JAYMIEBRLNDXTOSV	0	68.0
xxxx-xx664	xxxx-xx315	xxxx-xx315	2.0	A	0	75.0
xxxx-xx668	— none —	xxxx-xx664	0.0	FXWJNOAIQT	0	49.0
xxxx-xx682	xxxx-xx682	— none —	0.0	ABCDEFGHIJKLMNOPQRSTUVWXYZ	0	50.0
xxxx-xx687	xxxx-xx174	xxxx-xx083	0.0	AEIOU	0	73.0
xxxx-xx702	xxxx-xx315	xxxx-xx431	10.0	OAGHELBETP	0	76.0
xxxx-xx703	xxxx-xx174	xxxx-xx093	0.0	ABCDEFGHIJKLMNOPQRSTUVWXYZ	0	81.0
xxxx-xx717	xxxx-xx315	— none —	2.0	EUXSVANJBCDFGHIKLMNOPQRS	0	76.0
xxxx-xx753	xxxx-xx837	xxxx-xx093	0.0	PEARL	0	78.0
xxxx-xx754	xxxx-xx083	xxxx-xx083	0.0	FKWPA	0	64.0
xxxx-xx758	xxxx-xx229	— none —	0.0	RENZV	0	68.0
xxxx-xx819	xxxx-xx315	xxxx-xx315	2.0	BCDEFGHIJKLMNOPQRSTUVWXYZ	0	61.0
xxxx-xx823	xxxx-xx315	xxxx-xx478	2.0	FJQRV	0	31.0
xxxx-xx824	xxxx-xx824	xxxx-xx824	0.0	HRVDSEK	0	56.0
xxxx-xx837	xxxx-xx837	xxxx-xx431	2.0	ACEGIKMOQSUWY	0	69.0
xxxx-xx880	xxxx-xx076	xxxx-xx880	0.0	AEIOU	0	44.0
xxxx-xx884	xxxx-xx837	xxxx-xx308	0.0	AXYQK	0	52.0
xxxx-xx903	xxxx-xx824	xxxx-xx431	2.0	WQ	0	56.0
xxxx-xx954	xxxx-xx229	xxxx-xx431	2.0	ABCDEFGHIJKLMNOPQRTUVWXYZ	0	16.0
xxxx-xx963	xxxx-xx517	xxxx-xx180	0.0	AEIOU	0	64.0
xxxx-xx966	— none —	— none —	0.0	— none —	0	43.0
xxxx-xx975	xxxx-xx229	xxxx-xx329	0.0	ABCDEFGHIQ	0	57.0
xxxx-xx982	xxxx-xx315	xxxx-xx880	2.0	QF	0	58.0
xxxx-xx991	xxxx-xx315	xxxx-xx207	2.0	FQRSW	0	69.0
xxxx-xx997	xxxx-xx315	xxxx-xx702	2.0	B	0	36.0

Scores and statistics
Mean score: -x-
Median score: -o-
Standard deviation: -x-
Cardinality: -o-
Number of failures: -x-

Graph with nine stubs

Graph with seven stubs

Still being updated.

To all my good ES26 students...

Okay... here's the big thing. There were people who submitted MY code back to me and claimed it as THEIR work. Now, without pause or apology, I want to ask: HOW STUPID IS THAT? Also, HOW STUPID DO YOU THINK I AM? Do you really think me to be caught unawares that what you submitted is actually not mine — nyet, YOURS? What's even more insulting is you attempt to demo the program to me and think I will not know that you did not do it yourself. Oh, one more thing: you try to make up excuses for your program not being perfect, when I did it in about a half-hour just to be able to provide those who worked at the lab something to base their work on.

Let's forget the fact that there was one person who copied the source code from the desktop of one of the units on Fedora. He's apologetic enough to admit to his/her fault. What I don't understand is the gall of these people to submit MY work back to ME. Now turning the tables, you might be the brainless sap that you may have thought I am. Seriously. That's my indention style. My flawed quick escape code writing. My comment format. My choice variables. And all of you would make it appear that the code that I made was yours? Come on. You're smarter than that, I think. You got into UP. Or was that a farce, too?

Now, I even bet that people will act adversarial to this message. Why? Because they'd get insulted in turn when in all actuality my intelligence was insulted first.

Anywho (yes, that's not a real word if you'd like to think of me as a stupid redneck hick), here's the new deal. If you did the linear regression problem with sorting, searching, and writing capability, YOU MAY BE EXEMPT FROM THE DEMO if the total score for your two exams will amount to at least a minimum amount to be determined later (I'm thinking 80% of the aggregate perfect scores). Otherwise, you have to catch me during the next two weeks either on a Tuesday, Thursday, or Friday either at the Department of Computer Science or at a café to be specified later on. (It's no secret to my students that I like to work out — "work out" being my term for working outside the office.) You are no longer expected to do the Mob Wars scenario. I will not punish the offending parties, but you get a reprieve from the task. So in a way, you might want to thank them.

Those who haven't submitted anything yet, you may work on the first problem (linear regression) and the third problem, but that wouldn't be a bonus item anymore.  You are free to format the last problem's data file any which way you like.

Now my best students: those who had the audacity to submit MY program back to me. Let's forget about what you did and invalidate MY own program as a submission. (I hope I don't have to remind you that academic dishonesty, plagiarism being the least, merits a one-year suspension at the least.) After allowing everyone to collaborate freely with ANYONE in three different sections, former students, Computer Science majors, even pay professional programmers to do your work for you; AND YOU STILL DID WHAT YOU DID, you have to make the Mob Wars program from scratch. No aid from me anymore. I know I promised structures and functions, but what use will that be for just a small group as yours? You will still have to demo your program. Remember that during the demo, I will ask you to explain random lines of code, make you compile and run the program, and I will make modifications to the code then you will have to predict the effect.

Deadlines? To those who passed Problem 1 already: no more deadline for files! To those who are still going to submit Problem 1 and 3: 25 March 2009, 11.59p. To my beloved students who will be doing the Mob Wars scenario: you're free to submit any time until the fourth of April and demo before then, too.

I hope you realize I'm not a victim of plagiarism here. It's not me who had the raw end of a good deal.

...and just in case you didn't know that the work you plagiarized was mine, check if you used the pinili variable, indention for each level by two spaces, and used #define three times. I know some of those who submitted my work back to me wouldn't even be able to explain #define because I didn't teach that to people I think wouldn't need it.

Term-end schedule for ES26 students

Machine Problem Set deadline
15 March 2009, 12.00n
Problem 2 deadline: 23 March 2009, 12.00n (two guaranteed points for each day ahead)

Final exam
16 March 2009, 5.00p, P&G Auditorium

Machine Problem demonstration
PLEASE NOTE: only the first and the last problem (bonus) will be demo-ed!
18 to 20 March 2009, pick your 15-minute schedule from the slots below, DCS Rm316

Time slot	18 Mar (Wed)	19 Mar (Thu)	20 Mar (Fri)
10.00a	MIGUEL Philip John Bell S	CLOSED	— new open slot —
10.15a	— new open slot —	CLOSED	JACINTO Czarra Pamela T
10.30a	— new open slot —	CLOSED	LLANES Camille Hyacinth Shaye C
10.45a	— new open slot —	CLOSED	CARIÑO Miguel Isidro Edrico V
11.00a	RAMO Felipe Jr Z	CLOSED	GOTTER Gabriel
11.15a	— none —	CLOSED	FELIZCO Eileen Josef E
11.30a	— none —	CLOSED	PATACSIL Carla Monica A
11.45a	— none —	CLOSED	FAVILA Christopher John P
12.00n	— new open slot —	CLOSED	— new open slot —
12.15p	— new open slot —	CLOSED	— new open slot —
12.30p	BREAK!
1.00p	DIONISIO Renz Vicson L	CLOSED	HIPOL Emil Lorenzo M
1.15p	HERNANDEZ Virgilio Jr R	CLOSED	LLANERA Jaymie N
1.30p	BONDOC Kenneth Francis C	CLOSED	MATIONG Hansel Paul E
1.45p	PADERNA  Jenniza Khae E	CLOSED	BHOGAL Parminderjit Kaur M
2.00p	PASTORIL John Maynard P	CLOSED	GUINTO Ruth B
2.15p	LUSTRO Julius Rhoan T	CLOSED	DIAMANTE Aimee Rose R
2.30p	DELOS SANTOS Izy B	CLOSED	UY Darryl L
2.45p	BULALAQUE Pearl B	CLOSED	ROBLES Mariecor Elaine B
3.00p	ALBERTO Niña Desiree May G	CLOSED	LAGARDE John Aldrin M
3.15p	SY Marc Rainier E	CLOSED	LAIGO Antonette R
3.30p	RESURRECCION Roland Christopher C	CLOSED	DEL ROSARIO Anna Madeline L
3.45p	CASTRO Rellan F	CLOSED	DIZON Nicolette C
4.00p	LOPEZ Darryl Philip T	PARAS Christine Gale M	ACHANZAR Nathanielle H
4.15p	GALVAN Mitch-Irene Kate N	CLOSED	SAMSON Jovi Rose S
4.30p	CAÑAVERAL Jessa Andrea A	CLOSED	RAMOS Edward Vincent E
4.45p	— none —	CLOSED	— none —
5.00p	— none —	CLOSED	IGOS Diana V
5.15p	— none —	CLOSED	— none —

39 students scheduled

ES26: Term-end Machine Problems

ES26: Introduction to Computer Programming
Machine Problem Set    

For all your programs, please provide COMPLETE documentation. I will no longer ask for printed documents, but make sure your program’s code is formatted well.  Deductions will be made for programs that are not neat (meaning hard to read).  Comments embedded in your code will help you lots.

Sorted Linear Regression (with search capability) - sortedLR.c (score: 25 pts)
Create a program that first clears your screen and presents a menu to the user.  The menu should ask if the user wants to (a) read a data file that follows the prescribed format shown below and then sort the data depending on either co-dependent variable (x or y); (b) read a data file that follows the prescribed format and then identify whether a particular value of x appears in the ordered pairs (search linear); or (c) create a data file that follows the prescribed format based on input to be keyed in by the user.

If the user selected the first option, the program should ask for the filename and then ask whether the data will be sorted by x or by y values and whether the sort should be ascending or descending.  After doing so, the program must display the results ON SCREEN in increments of 16 (16 ordered pairs at a time) then the user is given a choice whether to display the next few.  After displaying the ordered pairs, the regression formula is displayed.

If the user selected the second option, the program should ask for the filename and then ask for a value of x.  The program should check for ALL the values in x that match the one given by the user and all the matching y values.  After that, the program should then display the y value if the regression formula were to be used on the value given by the user.

Finally, if the user selected the third option, the program will ask the number of ordered pairs to be saved onto the file, keep asking for values in the ordered pairs, and then save it to a filename specified by the user.

File format: the first line will ALWAYS contain the number of ordered pairs saved in the file.  It is no longer a fixed amount of 30.  However, a restriction for this value will be helpful.  Limit the possible value of the number of ordered pairs to 200.

200
80    127.02
49    212.21
170    -121.04
157    -85.58
53    200.83
37    244.94
25    277.98
…
74    140.19
93    87.02
34    251.88    Number of lines
x1    y1
x2    y2
x3    y3
x4    y4
x5    y5
x6    y6
x7    y7
…
x198    y198
x199    y199
x200    y200
Do not worry about having two numbers on one line.  The code from before should be able to read THAT part of the file.


Mob Wars Helper simulator - mobwars.c (score: 80 pts)
Write a program that reads and/or writes to several data files to be able to help you gather crucial information for playing Mob Wars on Facebook.

What data do you need to read/store from/to the data files?
    Properties that can be bought in the city (props.dat)
•    Property number (an integer)
•    Property name (a string)
•    Cost of a property (use an unsigned int because this will possibly reach billions)
•    Required property (an integer)
►    0 if the property does not require anything to be bought
►    otherwise, the property number of the requirement
•    Income for a property (an integer)
    Items that can be bought for your stockpile (items.dat)
•    Item number (an integer)
•    Item name (a string)
•    Cost of an item (an integer)
•    Required item (an integer)
►    0 if the property does not require anything to be bought
►    otherwise, the item number of the requirement
•    Attack bonus of an item
•    Defense bonus of an item
•    Upkeep of the item (an integer) - this is the maintenance cost for each item
    Amount of each property that the user owns (city.dat)
    Amount of each item that the user owns (items.dat)
    User information (user.dat)
•    User type (a character)
►    Tycoon (T)
►    Bulletproof (B)
►    Insomniac (I)
•    Boss name (a string)
•    Amount of money the user has on hand
•    Amount of money the user has in the bank

What information do you need to generate?
    Current inflated cost of a property (an unsigned int)
•    Inflation in Mob Wars means an item is more expensive as you have more of it
•    Think of it as diminishing returns
•    Formula is a tenth of the base cost (cost to buy one when you don’t have any yet) multiplied by the number of the items you own added to the base cost
•      where   is the base cost and   is the number of items owned
    Aggregate cost of a property (an unsigned int)
•    This is the sum of the cost of the property and the sum of the costs of all the requirements
•    For the sake of simplicity, each property only has one requirement
    Return of investment (ROI) for each property (a double or a float)
•    You can represent this in two ways, but both being a result of division of the aggregate cost of the property and its income (or vice versa)
    Hourly income
    Hourly upkeep
    Net hourly income

When the program first runs, it should already be able to initialize all your data elements.  That means all the files have been read and the data represented/stored in your data structures.

Display the user information and create a menu that asks the user what he wants to do from the following:
01    List all properties
02    List all items
03    Buy (a) new propert(y/ies)
04    Buy (a) new item(s)
05    Deposit money to the bank
06    Withdraw money from the bank
07    Exit

When the properties are listed, display the names of the property and cost on one line, the requirement property and aggregate cost on the next, and ROI and the number of this item you can buy on the third line.  (The number of items one can buy in one go is at most 10.)  For example:
Casino (Cost: 40000000)
Needs: Downtown Square; Aggregate cost: 41000000
ROI: 1.804; Able to buy 10

Ask the user if he/she wants to display the properties in a different order or to return to the main menu.  Possible arrangements for the properties are by ROI, Cost, or alphabetically.

When the items are listed, display the items and their properties in groups of 10.  Ask the user after each batch whether to proceed to list the next 10, sort the items in a different manner, or go back to the main menu.

When you buy a new property, the user may buy up to a maximum of ten items in one purchase.  The maximum is implemented, because the inflation rate does not take effect on the individual properties.  The amount that the user has should be decreased and the number of the property owned should be increased in the appropriate data files.

When you buy a new item, the user does not have a maximum number that he/she may buy.  Just make sure that the user has enough money on hand to be able to make the purchase.

When depositing money to the bank, the bank will charge a 10% storage fee to the amount being stored.  Withdrawing the money does not incur any such penalty.  The maintaining balance at the bank is a constant 10000 USD.  The minimum deposit is 2000 USD and the minimum withdrawal is 2000 USD.

For extra 10 points: Insert a new menu item to allow the users to modify the database of items and properties.  Mob Wars is an evolving game and is rebalanced occasionally.  Whenever the game needs rebalancing, some changes are made to the costs of items, jobs, and properties.  Sometimes, even new items, jobs, and properties are introduced.  Make your program flexible that it could write to props.dat or items.dat and update the database.


Bonus program (for fun)
Murphy’s Law - murphy.c, changem.c, murphy.dat (score: 15 pts)
Write two programs that depend on the file murphy.dat.  The first program should be able to generate a random Murphy’s Law stored inside murphy.dat.  The second program should allow the user to delete one of the laws stored in the file or add a new one.  Your separator token should be “~~” for uniformity and so it will run okay during the demo.


Please keep visiting the project page on Multiply and feel free to discuss and collaborate there.  Questions may be posted there that may be answered by other students or other persons who visit my site or even myself!  The files for problem number 2 (Mob Wars Helper simulator) will be placed there and wait for working versions of all programs (in EXE format).  For problem number 3 (Murphy’s Law), look for your own laws.  There are a whole lot of them on the Web.  Have fun creating the programs and remember to be creative.

Attachment: LRfile.txt
Attachment: Machine Problem Set.pdf

American Idol Season 8 media

These are the media related to American Idol Season 8, both from the official site and those constructed/edited by myself. New material will be posted here instead of on a new album.

Long exam scores and statistics

Student number	Score	Percentage
XXXX-XX006	16.5	20.63%
XXXX-XX076	50.5	63.13%
XXXX-XX083	62.0	77.50%
XXXX-XX092	50.0	62.50%
XXXX-XX093	82.0	102.50%
XXXX-XX097	52.0	65.00%
XXXX-XX102	72.0	90.00%
XXXX-XX118	78.0	97.50%
XXXX-XX129	76.0	95.00%
XXXX-XX170	69.0	86.25%
XXXX-XX174	88.0	110.00%
XXXX-XX180	60.5	75.63%
XXXX-XX207	71.0	88.75%
XXXX-XX209	68.5	85.63%
XXXX-XX213	57.5	71.88%
XXXX-XX229	85.0	106.25%
XXXX-XX237	65.0	81.25%
XXXX-XX252	86.0	107.50%
XXXX-XX258	53.0	66.25%
XXXX-XX266	55.0	68.75%
XXXX-XX281	75.0	93.75%
XXXX-XX290	66.0	82.50%
XXXX-XX308	80.0	100.00%
XXXX-XX309	47.5	59.38%
XXXX-XX329	51.0	63.75%
XXXX-XX388	52.5	65.63%
XXXX-XX400	72.0	90.00%
XXXX-XX425	53.0	66.25%
XXXX-XX431	70.5	88.13%
XXXX-XX454	58.0	72.50%
XXXX-XX478	60.5	75.63%
XXXX-XX479	66.0	82.50%
XXXX-XX517	76.5	95.63%
XXXX-XX550	30.5	38.13%
XXXX-XX585	68.5	85.63%
XXXX-XX615	58.5	73.13%
XXXX-XX622	78.0	97.50%
XXXX-XX632	52.5	65.63%
XXXX-XX661	56.5	70.63%
XXXX-XX664	83.5	104.38%
XXXX-XX668	72.0	90.00%
XXXX-XX682	54.0	67.50%
XXXX-XX687	77.5	96.88%
XXXX-XX702	78.0	97.50%
XXXX-XX703	72.0	90.00%
XXXX-XX717	61.5	76.88%
XXXX-XX753	72.5	90.63%
XXXX-XX754	68.5	85.63%
XXXX-XX758	58.5	73.13%
XXXX-XX819	62.5	78.13%
XXXX-XX823	60.0	75.00%
XXXX-XX824	40.0	50.00%
XXXX-XX837	72.0	90.00%
XXXX-XX880	54.5	68.13%
XXXX-XX884	82.0	102.50%
XXXX-XX903	76.0	95.00%
XXXX-XX954	21.5	26.88%
XXXX-XX963	62.5	78.13%
XXXX-XX966	52.5	65.63%
XXXX-XX975	36.0	45.00%
XXXX-XX982	43.5	54.38%
XXXX-XX991	68.5	85.63%
XXXX-XX997	29.0	36.25%

Scores and statistics
Mean score: 62.3651
Median score: 62.5
Standard deviation: 15.4389
Cardinality: 63
Number of failures: 8

Graph with nine stubs

Graph with seven stubs

A guide to the graphs: The actual instances of the scores are plotted as the frequencies below.  Higher concentrations and instances means there are clusterings of scores there.  The graphs are based on frequency distribution tables each with a different number of stubs.  The two vertical lines represent the passing score and the perfect score.  Engineering students, you should know that the area beneath the line can be taken using integration.