Programming Assignment #1

Transcription

1 Due: Nov 3 (11:59pm). Pogamming Assignment #1 CMSC 351 Fall 2014 Rules 1) You may only use C/C++, Java. 2) You pogam should use the standad input/output. Fo example C/C++ uses should use scanf/pintf/cin/cout and Java uses should use system.in/system.out. Fo moe infomation, you may ead this: 3) You pogam should not use moe than 128MB of memoy. 4) Fo each test case, you pogam may only un fo 5 seconds. Theefoe, you need to design efficient algoithms. The untime equiements ae explained in the poblem statements. 5) You can only use the basic libaies fo eading and stoing data. You cannot use any of the soted containes, linked lists, o algoithms in the standad libaies. You should implement them youselves. Fo example, you can use Aays, AayLists, Vectos. Howeve, you may "not" use LinkedList, QList, Sets, Maps, Hashmaps, o soting algoithms in the libaies. 6) All pogams should be coded only by youself. You may discuss poblems with othe students as long as thee ae no witten notes. All the souce codes submitted by the students will be checked with each othe automatically using a softwae plagiaism detecto. Please be awae of consequences of cheating, fabication, facilitation, and plagiaism by eading the following website 7) The pogamming assignments ae going to be gaded by an automatic gade. The automatic gade is a pogam that compaes the output of you pogam fo a single test case against the coect output. As the automatic gade is a compute pogam, it is sensitive to the fomatting, spelling, spacing, and etc. of you outputs. In fact, the pesentation of you output has to be exactly the same as what is descibed in the poblem statement. The gade fo each test case of a poblem is only 0 o 1, and thee is no patial cedit. 8) Submitting: Fo each poblem thee is a poject in the submit seve (submit.cs.umd.edu). You will submit only one file fo each poblem which is the souce code. Fo each poblem, the name of the file is specified in the poblem statement. 9) If you need moe info, please send me an to mgholami@cs.umd.edu (Milad Gholami) o come to my office hous (Thusdays 2-4).

2 Pactice Poblem: Sum (0% of the total gade) Submit you pogam as: sum.cpp o sum.java Given two numbes and, wite a pogam which calculates +. Input Desciption The fist line of the input has two numbes <100,000 and <100,000. Output Desciption The output is a single intege which is

3 Poblem 1: Pais (1% of the total gade) Submit you pogam as: pais.cpp o pais.java Given a sequence of n distinct integes (,,, ) find the numbe of pais (, ) such that 2 3 =. Fo example, if =5 then list (1,3,2,7,5) contains 3 such pais (2,3),(7,3),(5,5) such that 2 3 =5. Input Desciption The fist line of the input has two numbes <500,000 and <500,000,000. Next line contains integes 0 100,000,000. Output Desciption The output is a single intege which is the numbe of pais, such that 2 3 =. Gading Guide If you pogam unning time is ( log ), you will pass 100% of the test cases. If you pogam unning time is wose than Θ( ), you might pass some test cases based on you unning time

4 Poblem 2: Binay Tee (1.5% of the total gade) Submit you pogam as: btee.cpp o btee.java Given a peode tavesal of a binay seach tee, wite a pogam which calculates the sum of node values at even levels. We define the level of a node as its distance fom the oot, e.g., oot is at level 0. As an example conside peode tavesal (8, 5, 1, 7, 11, 10, 19). This peode tavesal epesents the following binay seach tee and the sum of node values at even levels is: = 45. Input Desciption The fist line of the input contains <500,000, the numbe of nodes in the binay seach tee. Next line contains n numbes which ae values of nodes in the peode tavesal of the tee. Each value is an intege less than 500,000,000. Output Desciption The output is a single line containing the sum of node values at even levels

5 Poblem 3: Quatile (Bonus: 2% of the total gade) Submit you pogam as: quatile.cpp o quatile.java A steam of andom integes is coming. Wite a pogam which can epot the fist quatile of the input steam at any point. The fist quatile (Q1) is defined as the middle numbe between the smallest numbe and the median of the data set when soted. In paticula, the fist quatile of a sequence of numbes would be the -th smallest element in the sequence. Input Desciption Input consists of multiple lines and each line is a command. Thee ae thee types of commands: end Fist command means intege 0 1,000,000,000 is seen in the steam. Afte you pogam should epot the fist quatile of the numbes seen so fa. end means the end of all commands. The input file has at most 500,000 lines. Output Desciption Fo each in the input you should pint a numbe in a line which is the fist quatile of all numbes at the time that command was seen. i 9 i 3 i 6 i 4 i 5 i 8 i 2 i 1 i 10 end //note that the sequence is <9, 3, 6, 4, 5> at this point //note that the sequence is <9, 3, 6, 4, 5, 8> at this point //note that the sequence is <9, 3, 6, 4, 5, 8, 2, 1> at this point //note that the sequence is <9, 3, 6, 4, 5, 8, 2, 1, 10> at this point