首页
网站开发
桌面应用
管理软件
微信开发
App开发
嵌入式软件
工具软件
数据采集与分析
其他
首页
>
> 详细
代做COMP2013、代写 c++/java,Python 编程
项目预算:
开发周期:
发布时间:
要求地区:
COMP2013 Data Structures and Algorithms
Programming Assignment 1 Deadline: 10:00am, 25th March, 2024
Instructions
Submit the soft-copy of your program to Learn@PolyU
You can only submit one program file (either C++ or Java or Python),
and the filename must follow the format below.
Language
C++
Java Python
Problem
Filename format mainStudentID.cpp mainStudentID.java mainStudentID.py
Filename example
main10987654d.cpp main10987654d.java main10987654d.py
Section 1:
Input: Output:
An array A[0..n–1] (of comparable elements)
The total number of pairs (i, j) such that i < j and A[i] > A[j].
In this problem, the input can be an array of integers or an array of strings.
(1.1) Comparisonforstrings
We use the lexicographical order to compare strings. Let s[x] denote the x-th letter of the string s.
Given two strings s[0..sL–1] and r[0..rL–1], s>r holdsif
• risaprefixofs(i.e.,rL
r[k] and ∀p=0..k-1 s[p]=r[p]
Examples:
• charge > balance • balance > bal
• bbbbbb > bbbbba
(1.2) Examplesfortheproblem Input
Output Explanation
5 5 pairs satisfy the requirement:
(0,1), (2,3), (2,5), (3,5), (4,5).
5 5 pairs satisfy the requirement: (0,1), (2,3), (2,5), (3,5), (4,5).
Example for an array of integers Example for an array of strings
A[0..6] =
| 31 | 24 | 85 | 76 | 93 | 50 | 93 |
A[0..6] =
| “charge” | “balance” | “wind” | “thunder” | “zoo” | “mile” | “zoo” |
p. 1
Section 2: Input and Output Format
Here are samples of the input file and the output of your program.
Sample input file “file1.txt” The output on screen (stdout)
integer
7
31
24
85 76 93 50 93
5
Sample input file “file2.txt” The output on screen (stdout)
string
7
charge
balance
wind
thunder
zoo
mile
zoo
5
The format of the input file is as follows:
the 1st line shows the type (either integer or string), the 2nd line shows the number of elements,
each subsequent line shows an element.
The number of elements is in the range 1.. 10000000.
For integers, the elements are in the range 1..10000000.
For strings, the elements have length at most 20 and contain lower-case letters only.
We will run your program by a command line like:
Language
C++ (after compilation) Java (after compilation) Python
Command line
./mainStudentID input123.txt
java mainStudentID input123.txt python mainStudentID.py input123.txt
where the argument “input123.txt” is an example of the input filename. Your program should only output the result number.
Please follow the above output format and DO NOT print any extra information.
p. 2
Section 3: Hints
(3.1) Comparisonsforstrings
You are allowed to use operator or standard library function (e.g., in C++, Java, Python) to perform lexicographic comparison for string. Examples:
• C++: https://cplusplus.com/reference/string/string/compare/
• Java: https://docs.oracle.com/javase/tutorial/java/data/comparestrings.html
• Python: https://docs.python.org/3/library/stdtypes.html#comparisons Please test them before using them in your program.
(3.2) Hintsforprogramming
• Use a large enough integer type (e.g., long) to prevent “integer overflow” in counting.
• A simple program is to use nested for-loops. Its time complexity is O(n2). It is acceptable for
small input file but too slow for large input file.
• If you wish to obtain higher marks, try to use the “divide-and-conquer” approach in your
program. It is possible to achieve the time complexity O(n log n) time.
• Some programming tricks can be used to speedup your program by a constant factor.
p. 3
Section 4: Grading Criteria
(4.1) Namingconventions,compilationandexecutioncommands
Before submission, rename your program to mainStudentID.cpp,
OR mainStudentID.java, OR mainStudentID.py,
e.g., main10987654d.cpp e.g., main10987654d.java e.g., main10987654d.py
[C++ and Java only] Make sure that you can compile your program using the command: g++ mainStudentID.cpp -o mainStudentID
OR javac mainStudentID.java
o No marks will be given if your program cannot be compiled.
We will run your program by a command line like: ./mainStudentID input123.txt
OR java mainStudentID input123.txt
OR python mainStudentID.py input123.txt where the argument “input123.txt” is an example of the input filename.
Make sure that you can execute the above commands on the COMP apollo server successfully. Otherwise, no marks will be given. The current versions on apollo are as follows:
g++ (GCC) 4.8.5, javac 1.8.0_20, Python 2.7.5
(4.2) Testfilesforgrading
Total marks: 100%
Your program will be graded by using 10 test files.
• 5 test files for integers
• 5 test files for strings
The running time of your program will be measured on the COMP apollo server.
For each test file,
if your program can produce the correct output within 1 minute, then you get +10 marks.
p. 4
Appendix
(1) How to activate your COMP account?
Please click the following link to activate your COMP account:
https://acct.comp.polyu.edu.hk/ https://acct.comp.polyu.edu.hk/files/COMPStudentAccountSelfActivation.pdf
(2) How to login the COMP apollo server?
according to the instructions in:
[Step 1]
Use PuTTY (or any SSH client program)
Enter the host name
csdoor.comp.polyu.edu.hk
Click the “Open” button.
If you see the message “The host key is not cached for this server...”,
just accept to continue.
p. 5
[Step 2]
Enter your COMP account username and password.
Note that, when you are entering the password, it is not displayed in PuTTY.
[Step 3]
Enter the hostname apollo
Then enter your COMP account password (the same as in Step 2).
[Step 4]
Use WinSCP (or any SFTP client program).
Enter the host name csdoor.comp.polyu.edu.hk Enter your COMP account username and password. Upload your program to the server.
p. 6
软件开发、广告设计客服
QQ:99515681
邮箱:99515681@qq.com
工作时间:8:00-23:00
微信:codinghelp
热点项目
更多
代做ceng0013 design of a pro...
2024-11-13
代做mech4880 refrigeration a...
2024-11-13
代做mcd1350: media studies a...
2024-11-13
代写fint b338f (autumn 2024)...
2024-11-13
代做engd3000 design of tunab...
2024-11-13
代做n1611 financial economet...
2024-11-13
代做econ 2331: economic and ...
2024-11-13
代做cs770/870 assignment 8代...
2024-11-13
代写amath 481/581 autumn qua...
2024-11-13
代做ccc8013 the process of s...
2024-11-13
代写csit040 – modern comput...
2024-11-13
代写econ 2070: introduc2on t...
2024-11-13
代写cct260, project 2 person...
2024-11-13
热点标签
mktg2509
csci 2600
38170
lng302
csse3010
phas3226
77938
arch1162
engn4536/engn6536
acx5903
comp151101
phl245
cse12
comp9312
stat3016/6016
phas0038
comp2140
6qqmb312
xjco3011
rest0005
ematm0051
5qqmn219
lubs5062m
eee8155
cege0100
eap033
artd1109
mat246
etc3430
ecmm462
mis102
inft6800
ddes9903
comp6521
comp9517
comp3331/9331
comp4337
comp6008
comp9414
bu.231.790.81
man00150m
csb352h
math1041
eengm4100
isys1002
08
6057cem
mktg3504
mthm036
mtrx1701
mth3241
eeee3086
cmp-7038b
cmp-7000a
ints4010
econ2151
infs5710
fins5516
fin3309
fins5510
gsoe9340
math2007
math2036
soee5010
mark3088
infs3605
elec9714
comp2271
ma214
comp2211
infs3604
600426
sit254
acct3091
bbt405
msin0116
com107/com113
mark5826
sit120
comp9021
eco2101
eeen40700
cs253
ece3114
ecmm447
chns3000
math377
itd102
comp9444
comp(2041|9044)
econ0060
econ7230
mgt001371
ecs-323
cs6250
mgdi60012
mdia2012
comm221001
comm5000
ma1008
engl642
econ241
com333
math367
mis201
nbs-7041x
meek16104
econ2003
comm1190
mbas902
comp-1027
dpst1091
comp7315
eppd1033
m06
ee3025
msci231
bb113/bbs1063
fc709
comp3425
comp9417
econ42915
cb9101
math1102e
chme0017
fc307
mkt60104
5522usst
litr1-uc6201.200
ee1102
cosc2803
math39512
omp9727
int2067/int5051
bsb151
mgt253
fc021
babs2202
mis2002s
phya21
18-213
cege0012
mdia1002
math38032
mech5125
07
cisc102
mgx3110
cs240
11175
fin3020s
eco3420
ictten622
comp9727
cpt111
de114102d
mgm320h5s
bafi1019
math21112
efim20036
mn-3503
fins5568
110.807
bcpm000028
info6030
bma0092
bcpm0054
math20212
ce335
cs365
cenv6141
ftec5580
math2010
ec3450
comm1170
ecmt1010
csci-ua.0480-003
econ12-200
ib3960
ectb60h3f
cs247—assignment
tk3163
ics3u
ib3j80
comp20008
comp9334
eppd1063
acct2343
cct109
isys1055/3412
math350-real
math2014
eec180
stat141b
econ2101
msinm014/msing014/msing014b
fit2004
comp643
bu1002
cm2030
联系我们
- QQ: 9951568
© 2021
www.rj363.com
软件定制开发网!