The objective of this assignment is toapply the concepts of threading by developing a simple C++ Pthreads program todiscover the surroundings and the shortest path in a 2D maze
BackgroundThis assignment requires you to write a multi-threaded C/C++ “Pathfinder” program todiscover the surroundings of a jungle maze. Each [x, y] location in the mazerepresents a ‘grid area’ of the jungle terrain. A particular gird area could be
“impassable” (rep. by ‘#’ barrier) ,
containsdanger (rep. by ‘X’ danger area)
·clear, (i.e. allows you totravel)
An example of the jungle maze will be provided to you (see Appendix A,‘mazedata.txt’).Your objective is to explore as much of the jungle maze terrain as possible, andmark the discovered area as barrier (‘#’), or danger (‘X’) accordingly.When your program terminate, it should output a map of the explored jungle maze, aswell as 1 ‘safe’ path, to traverse from Start to End locations.
Task RequirementsA)At startup, your program should read in the 2D maze configuration (“mazedata.txt”)which stores the information about the maze dimensions, barriers, start and endlocations. Please refer to Appendix A for an example.
B)For the purposes of testing your program, a sample of what information should beoutput is shown in Appendix B.C)Before you start developing your program, you should take some time to review theoutput, and analyze the requirements of the Pathfinder program.D)Your program should have at least 2 threads, each thread attempting toexplore surrounding locations to discover whether it contains a barrier (‘#’)or danger (‘X’).
E)Impt1 : your program should maintain a global Maze resource or variable, holdinginformation about all the barriers or danger areas uncovered by your exploringthreads!
F)Impt2 : when a particular thread has encountered a barrier (‘#’) or danger (‘X’),it should …
Recordthe path (history of point locations) it has traversed, since the StartLocation, to reach the barrier / danger areas, and locations of barrier /danger should be marked on your ‘global Maze resource’
The thread ‘loses its life’ (i.e. should be destroyed) if it has encountered adanger area (‘X’) !!G)Whenevera thread is destroyed, your program should create another replacement thread,to traverse the jungle maze beginning from the Start Location again. But thistime, it should access the ‘global Maze resource’ to learn and avoid thebarriers and danger areas discovered by its predecessor threads!
H)In this way, the ‘sacrifice’ of the destroyed threads are not in vain, as itsknowledge (of locations of the barriers / danger areas) have been recorded inthe ‘global Maze resource’ that can be accessed by future generations ofcreated threads to aid their survival in order to discover a path to EndLocation!I)As you probably guess by now, the access to the ‘global Maze resource’ should beprotected via usage of mutex locks. Whether a thread is:
Updatingits discovery of the path to barrier / danger areas OR
Accessingthe ‘global Maze resource’ to learn about the discovered locations of thebarriers / danger areas
Only 1 thread can access itat any one time!J)Oncethe program is completed and tested to be working successfully, you are highlyencouraged to add on “new features” to the program that you feel are applicableto the task of finding the shortest path thru a maze. Additional marks may beawarded subject to the relevancy and correctness of the new functionalities.
K)Yourprogram should be written in C++, and using the library functions available inheader file ‘pthread.h’, to handle all aspects of thread creation, managementand synchronization.
L)Toencourage good program design, you should consider using different *.cpp class filesto encapsulate groups of related methods/functions.
Additional Resources
After all students have gone through thisdocument, your tutor will hold a special session to discuss / elaborate onthe requirements of this assignment.
Inaddition, your tutor will hold a Q & A sessions to clarify any issues/doubtsyou may have on the analysis and design of this multi-threaded program. Toensure a fruitful session, all students must come prepared with their listof questions, so that everybody’s time is efficiently utilized.Deliverables1)Thedeliverables include the following:a)Theactual working shell program (hard+soft copies), with comments on each file,function or block of code to help the tutor understand its purpose.b)Aword document (hard+soft copies) that elaborates on:
(Interpreted)requirements of the program
Diagram/ Illustrations of program design
·Summaryof implementation of each module in your program
·Reflectionson program development (e.g. assumptions made, difficulties faced, what couldhave been done better, possible enhancements in future, what have you learnt,etc)c)Aprogram demo/evaluation during lab session. You must be prepared to performcertain tasks / answer any questions posed by the tutor.2)IMPT:Please follow closely, to the submissioninstructions in Appendix C, which contains detailsabout what to submit, file naming conventions, when to submit, where to submit,etc.3)The evaluation will be held during lab session whereyou are supposed to submit your assignment. Some time will be allocated for youto present / demonstrate your program during the session.GradingStudent’sdeliverable will be graded according to the following criteria:(i)Programfulfills all the basic requirements stipulated by the assignment
Therequirements includes some/all of the following:ability to handle maze of different sizesNo. of danger areas uncovered
No. of barriers uncovered
No. of threads utilizedValidity of the single solution path (a series ofPoint locations leading from Start to End locations
(ii)Successfuldemonstration of a working program, clarity of presentation and satisfactoryanswers provided during Q & A session.
(iii)Additionalefforts in enhancing the program with features over and above taskrequirements, impressive, “killer” presentation and demonstration, etc.
(iv)Afterthe submission of deliverables, students will be required undergo an evaluationprocess (to determine fulfillment of task requirements.) Further instructionswill be given by the Tutor during the subsequent respective labs. Please payattention as failure to adhere to instructionsmay result in deduction of marks.
Tutor’snote:
Inthe real working world, satisfactory completion of your tasks is no longerenough. The ability to add value, communicate and/or demonstrateyour ideas with clarity is just as important as correct functioning of yourprogram. The grading criteria is set to imitate such requirements on a ‘smallerscale’.
APPENDIX A
(Sample contents for Maze‘mazedata.txt’)
Length : 20
Breadth : 10
// ——————————
// —– Start of Maze Data —–
// ——————————
// ‘S’ denotes Starting position
// ‘E’ denotes Ending position
// ‘#’ denotes Barrier
// ‘X’ denotes Danger Area
####################
#S # # #
# # ## ## ######
# # ## E #
## # # X# X## #
# X ######## #
# # # ## ###
# ### ### ## # #####
# # #
####################
APPENDIX B
(Output solutionstored in a generated text, based on the maze configuration in Appendix A)
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # ## # ## # ## # ## # ## # ## # #
1 # S# # #
2 # ## # ## # ## # # #
3 # # # # E#
4 # ## # X# X ## #
5 # X# # ## # ## # #
6 # ## # # ## #
7 # # # ## # ## # ## # ## #
8 # ##
9 # ## # ## # ## # ## # ## # ## # #
_length : 20
_breadth : 10
_startLocation : [ 1, 1 ]
_endLocation : [ 17, 3 ]
No. of paths discovered : 0
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0
1 S
2
3E
4
5
6
7
8
9
_length : 20
_breadth : 10
_startLocation : [ 1, 1 ]
_endLocation : [ 17, 3 ]
No. of paths discovered : 0
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # ## # ## # ## # ## # ## # ## # #
1 # S# # #
2 # ## # ## # ## # # #
3 # # # # E#
4 # ## # X# X ## #
5 # X# # ## # ## # #
6 # ## # # ## #
7 # ## # ## # ## # ## # # #
8 # ##
9 # ## # ## # ## # ## # ## # ## # #
Thread ‘POOH’ has been created !!
Total no. of steps : 1
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 #
1 S
2
3E
4
5
6
7
8
9
Total no. of steps : 1
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 #
1 # S
2
3E
4
5
6
7
8
9
Total no. of steps : 2
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 #
1 # S
2 # 1
3E
4
5
6
7
8
9
Total no. of steps : 3
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 #
1 # S
2 # 1
3 2 E
4 #
5
6
7
8
9
Total no. of steps : 3
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 #
1 # S
2 # 1
3 # 2E
4 #
5
6
7
8
9
Total no. of steps : 5
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 #
1 # S
2 # 14 #
3 # 23 E
4 #
5
6
7
8
9
Total no. of steps : 6
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S5
2 # 14 #
3 # 23 E
4 #
5
6
7
8
9
Total no. of steps : 6
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S5 #
2 # 14 #
3 # 23 E
4 #
5
6
7
8
9
Thread ‘POOH’ hits a DEAD ENDnear [2, 1] !!
Thread ‘TIGGER’ has been created!!
Thread ‘ROO’ has been created !!
===========================================================
Elapsed Time : 0
Latest Update …
===========================================================
Dead End Paths Found : 1
Barriers Discovered : 8
Danger Area Discovered : 0
Total no. of steps : 5
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23 E
4 # 4
5
6
7
8
9
Total no. of steps : 5
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23 E
4 # 4#
5
6
7
8
9
Total no. of steps : 6
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1 #
3 # 23 E
4 # 4#
5 5
6 #
7
8
9
Total no. of steps : 7
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23 E
4 # 4#
5 6 5
6 #
7
8
9
Total no. of steps : 7
01 2 34 5 6 7 8 9 1011 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23 E
4 # 4#
5 # 65
6 #
7
8
9
Total no. of steps : 8
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23 E
4 # 4#
5 # 65
6 # 7#
7
8
9
Total no. of steps : 8
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23 E
4 # 4#
5 # 65
6 # 7#
7
8
9
Total no. of steps : 9
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23 E
4 # 4#
5 # 65
6 # 7#
7 # 8
8
9
Total no. of steps : 9
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23 E
4 # 4#
5 # 65
6 # 7#
7 # 8#
8
9
Total no. of steps : 10
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23 E
4 # 4#
5 # 65
6 # 7#
7 # 8#
8 9
9 #
Total no. of steps : 10
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23E
4 # 4#
5 # 65
6 # 7#
7 # 8#
8 # 9
9 #
Total no. of steps : 11
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23 E
4 # 4#
5 # 65
6 # 7#
7 # 8#
8 # 9 10
9 #
Total no. of steps : 11
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23 E
4 # 4 #
5 # 65
6 # 7#
7 # 8#
8 # 9 10
9 # #
Total no. of steps : 11
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23 E
4 # 4#
5 # 65
6 # 7#
7 # 8#
8 # 9 10#
9 # #
Thread ‘TIGGER’ hits a DEAD ENDnear [2, 1] !!
===========================================================
Elapsed Time : 1
Latest Update …
===========================================================
Dead End Paths Found : 2
Barriers Discovered : 22
Danger Area Discovered : 0
Thread ‘TIGGER’ hits a DEAD ENDnear [2, 8] !!
===========================================================
Elapsed Time : 2
Latest Update …
===========================================================
Dead End Paths Found : 3
Barriers Discovered : 22
Danger Area Discovered : 0
Thread ‘ROO’ hits a DEAD END near[2, 1] !!
===========================================================
Elapsed Time : 3
Latest Update …
===========================================================
Dead End Paths Found : 4
Barriers Discovered : 22
Danger Area Discovered : 0
Total no. of steps : 7
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23E
4 # 4#
5 # 56
6 # #
7 # #
8 # #
9 # #
Total no. of steps : 8
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23 E
4 # 4#
5 # 56
6 # #7
7 # ##
8 # #
9 # #
Total no. of steps : 8
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23 E
4 # 4#
5 # 56
6 # #7
7 # ##
8 # #
9 # #
Total no. of steps : 9
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23 E
4 # 4#
5 # 56
6 # #7 8
7 # ## #
8 # #
9 # #
Total no. of steps : 9
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1 #
3 # 23 E
4 # 4#
5 # 56 X
6 # # 78
7 # ## #
8 # #
9 # #
Thread ‘TIGGER’ stepped intoDANGER at [4, 5] !!
===========================================================
Elapsed Time : 4
Latest Update …
===========================================================
Dead End Paths Found : 4
Barriers Discovered : 26
Danger Area Discovered : 1
Thread ‘TIGGER’ is dead! It’ssacrifice shall not be in vain!
Creating new thread ‘GOLPHER’
Thread ‘GOLPHER’ has been created!!
Thread ‘POOH’ hits a DEAD ENDnear [2, 8] !!
===========================================================
Elapsed Time : 5
Latest Update …
===========================================================
Dead End Paths Found : 5
Barriers Discovered : 26
Danger Area Discovered : 1
Total no. of steps : 10
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23 E
4 # 4#
5 # 56 X
6 # #7 8 9#
7 # ## #
8 # #
9 # #
Total no. of steps : 11
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23 E
4 # 4#
5 # 56 X 10 #
6 # #7 8 9#
7 # ## #
8 # #
9 # #
Total no. of steps : 12
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1#
3 # 23 E
4 # 4# 11 #
5 # 56 X 10 #
6 # #7 8 9#
7 # ## #
8 # #
9 # #
Total no. of steps : 13
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1# #
3 # 23 12 E
4 # 4# 11 #
5 # 56 X 10 #
6 # #7 8 9#
7 # ## #
8 # #
9 # #
Total no. of steps : 13
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1# #
3 # 23 12 # E
4 # 4# 11 #
5 # 56 X 10 #
6 # #7 8 9 #
7 # ## #
8 # #
9 # #
Total no. of steps : 15
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1 #14 #
3 # 23 13 12 # E
4 # 4# 11 #
5 # 56 X 10 #
6 # #7 8 9#
7 # ## #
8 # #
9 # #
Total no. of steps : 15
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # #
1 # S#
2 # 1 #14 #
3 # 23 13 12#E
4 # 4# 11 #
5 # 56 X 10 #
6 # #7 8 9#
7 # # # #
8 # #
9 # #
Total no. of steps : 16
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # ##
1 # S #15
2 # 1 #14 #
3 # 23 13 12 # E
4 # 4# 11 #
5 # 56 X 10 #
6 # #7 8 9#
7 # ## #
8 # #
9 # #
Total no. of steps : 16
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # ##
1 # S #15
2 # 1 #14 #
3 # 23 13 12 # E
4 # 4# 11 #
5 # 56 X 10 #
6 # #7 8 9#
7 # ## #
8 # #
9 # #
Total no. of steps : 17
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # ## #
1 #S # 15 16
2 # 1 #14 #
3 # 23 13 12 # E
4 # 4# 11 #
5 #5 6 X 10 #
6 # #7 8 9#
7 # ## #
8 # #
9 ##
Total no. of steps : 17
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # ## #
1 # S #15 16
2 # 1 #14 #
3 # 23 13 12 # E
4 # 4# 11 #
5 # 56 X 10 #
6 # #7 8 9#
7 # ## #
8 # #
9 # #
Total no. of steps : 17
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # ## #
1 # S #15 16 #
2 # 1 # 14#
3 # 23 13 12 # E
4 # 4# 11 #
5 # 56 X 10 #
6 # # 78 9 #
7 # ## #
8 # #Thread ‘ROO’ hits a DEAD END near [2, 8] !!
9 # #
===========================================================
Elapsed Time : 6
Latest Update …
===========================================================
Dead End Paths Found : 6
Barriers Discovered : 38
Danger Area Discovered : 1
Thread ‘ROO’ hits a DEAD END near[5, 1] !!
===========================================================
Elapsed Time : 7
Latest Update …
===========================================================
Dead End Paths Found : 7
Barriers Discovered : 38
Danger Area Discovered : 1
Total no. of steps : 15
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0 # ## #
1 # S# #
2 # 1# #
3 # 23 13 12 # E
4 # 4 # 1411 #
5 # 56 X 10 #
6 # #7 8 9#
7 # ## #
8 # #
9 # #
Note :
There are many pages of other intermediateoutput that is not feasible to show in this Appendix.
We are now skipping straight to the endingportion of the output.
Below output show the LAST FEW STEPS of thethread exploration leading to the discovery of a single, solution pathfrom Start Location ‘S’ to End Location ‘E’ !!
Total no. ofsteps : 51
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0# # ## # ## # ## # ## #
1 #S # #23 24 25 26 33 34 35 36 37
2# 1 ## # 22# # 27 32 ## # 38 ##
3# 2 3# 21 20 # 28 31# 40 39 50 49 #
4# 4 ## 19 # 29 3041 # # 48 #
5 #5 6 X# # # 18# # # #42 45 46 47 #
6# # 78 9 #17 # #43 44 # #
7# # # #10 ## # 16 ## # ## # #
8# # 11 12 13 14 15 #
9 ## # ## # ## # ## # ## # ##
Thread ‘ROO’ justfound a solution! Well done!!
Finished Findinga SAFE PATH !!
Printingsubmitted maze solution …
Printing solutionfor Tan Ah Beng, id : 1001001
——————————————————————————————–
Total no. ofsteps : 50
01 2 34 5 67 8 9 10 11 12 13 14 15 16 17 18 19
0# # ## # ## # ## # ## #
1# S ## 23 24 25 26 33 34 35 3637
2# 1 ## # 22# # 27 32 ## # 38 ##
3# 2 3# 21 20 # 28 31# 40 39 E 49 #
4# 4 ## 19 # 29 3041 # # 48 #
5# 5 6X # # # 18 ## # # 42 45 46 47 #
6# # 78 9 #17 # #43 44 # #
7# # # #10 ## # 16 ## # ## # #
8# # 11 12 13 14 15 #
9# # ## # # # ## # ## # ## # #
Total no. ofThreads submitting info : 3
Duplicated Paths(to Barriers) submitted : 155
Duplicated Paths(to Danger Area) submitted : 0
Total no. ofBarrier (‘#’) discovered : 90 out of 105 !!
Total no. of DangerArea (‘X’) discovered : 1 out of 3 !!
Printing ThreadStatistics !!
——————————————————————————————–
Stats for ThreadID : 3070360432
Found SolutionPath : No …
UNIQUE Path to barriers discovered : 26
DUPLICATED Pathto barriers submitted : 0
UNIQUE Path to danger areas discovered : 1
DUPLICATED Pathto danger areas submitted : 0
**********************************************************************
Stats for ThreadID : 3061967728
Found SolutionPath : YES !!
UNIQUE Path to barriers discovered : 103
DUPLICATED Pathto barriers submitted : 0
UNIQUE Path to danger areas discovered : 0
DUPLICATED Path todanger areas submitted : 0
**********************************************************************
Stats for ThreadID : 3078753136
Found SolutionPath : No …
UNIQUE Path to barriers discovered : 22
DUPLICATED Pathto barriers submitted : 0
UNIQUE Path to danger areas discovered : 0
DUPLICATED Pathto danger areas submitted : 0
**********************************************************************
APPENDIX C
SubmissionInstructions (V. IMPT!!)
1)Deliverables
a) All submissions should bein softcopy, unless otherwise instructed
b) For the actual files to besubmitted, you typically need to include the following:
– word document report (e.g. *.doc), save as MS Word 97-2003format
– the source file(s), (e.g. *.sh, *.c, *.h,*.o, or *.cpp files)
– the executable file,compile into an executable file with *.exe
(e.g. Assn3.exe). Note: this only applies to non-shell script assignments!
2)How to packageCompress all your assignment files into a single zip file.Please use the following naming format: <FT/PT_Assn3_
Example: FT_Assn3_1234567_JohnDoeAnderson. zip
–<FT/PT Use “FT” for Full-Time student, “PT”if you are Part-Timestudent
–Assn3 if you are submitting assignment 3, Assn1if submitting assignment 1 etc.
–number (e.g. 1234567)
–registered name (e.g. JohnDoeAnderson)
3)Where to submit
Please email your single zip file to your tutor at :
[email protected] for FULLTIME students
(To be announced) forPART TIME students
In your email subject line,type in the following information :
<FT/PT <studentnumber and <name.
Example:
To : tutor’semail (see above)
Subject : FT Assn31234567JohnDoeAnderson
Note 1 : Thetimestamp shown on tutor’s email Inbox will be used to determine if the assignmentis late or not.
Note 2 : After email submission, yourmailbox’s sent folderwould have a copy(record) of your sent email, please do not deletethat copy !! It could be used toprove your timely submission, in case the Tutor did not receive youremail!
4)When to submit
a)Ignore the instructions in b) and c), ONLY IFyour tutor/lecturer has already explicitlyinformed you of the submission date-time for the assignment, duringyour lessons.Otherwise, you are to follow the submissioninstructions below strictly!
b)Pleaserefer to the following table on the different submission events and deadlines
Assignment
EmailSubmisson to reach Tutor’s Inbox by :
AssignmentEvaluation (Tasks)
EmailEvaluation files by :
1
Night before Lab – 2(PT), 3(FT)
Lab 2(PT), 3(FT)
End of Lab 2(PT), 3(FT)
2
Night before Lab – 3(PT), 4(FT)
Lab 3(PT), 4(FT)
End of Lab 3(PT), 4(FT)
3
Night before Lab – 4(PT), 5(FT)
Lab 4(PT), 5(FT)End of Lab 4(PT), 5(FT)Note: (PT) = Part Time Students, (FT)= Full Time Students !c)For example, for Full Time (FT) students submitting Assignment 3, if Lab 5falls on 29 / 01 / 2014, then
–Emailyour zip file to Tutor by 28 / 01 / 2014,2359 hrs (nite b4 Lab 5)
–Setupyour program for evaluation on 29 / 01 / 2014 (Lab 5)
–Finishevaluation tasks, email files on 29 / 01/ 2014 (end of Lab 5)
5)Please help by paying attention to the following …
! VERY IMPORTANT !
PLEASE FOLLOW THE GUIDELINES IN ALLASSIGNMENT APPENDICES !!
PLEASE FOLLOW THE SUBMISSIONINSTRUCTIONS FROM 1 TO 4 !!
IF YOU ARE NOT SURE,
PLEASE CHECK WITH YOURTUTOR DURING LABS / LECTURES !
OR …
PLEASE EMAIL YOURENQUIRIES TO YOUR TUTOR !
MARKS WILL BE DEDUCTED IF YOU FAIL TO FOLLOW INSTRUCTIONS!!
Example :
·Yourreport document or zip file does not follow naming convention
·Youremail address does not include your name (i.e. cannot be used to identifysender)
·Youhave no email subject
·Wrongnaming or misleading informationgiven
(e.g. putting “Assn2” in emailsubject, when you are submitting “Assn1”)
(e.g. naming “Assn1” in your zip file,but inside contains Assn2 files )
·Yoursubmission cannot be downloaded and unzipped
·Yourreport cannot be opened by Microsoft Word / Access
·Yourprogram cannot be re-compiled and/or executable file cannot run
6)Re-submission administration
If for some reason, student needs tore-submit their files, please adhere to the following instructions carefully:
<Step1
Zip up for re-submission filesaccording to the following format :
<FT/PT_Assn3_Resubmit_v1_
Example : FT _ Assn3_Resubmit_v1_1234567_JohnDoeAnderson. zip
–<FT/PT Use “FT” for Full-Time student, “PT”if you are Part-Timestudent
–Assn3 if you are submitting assignment 3, Assn1if submitting assignment 1 etc.
–Resubmit_v1 if this is your 1st re-submission
–Resubmit_v2 if this is your 2nd re-submission
–number (e.g. 1234567)
–registered name (e.g. JohnDoeAnderson)
–V. IMPT – To prevent Tutor’s Inbox from blowing upin his face, each student is only allowed to re-submit twice, for eachassignment only!
<Step2
Please email your single zip file to your tutor’s email(refer to section 3) – Where to submit)
In your email subject line,type in the following information :
<FT/PT
Example:
To :tutor’s email (refer tosection 3) – Where to submit)
Subject : FT Assn3Resubmit_v1 1234567 JohnDoeAnderson
Reviews
There are no reviews yet.