최신 CCDH CCD-333 무료샘플문제:
1. In a large MapReduce job with m mappers and r reducers, how many distinct copy operations will there be in the sort/shuffle phase?
A) m
B) mr (i.e., m to the power of r)
C) r
D) m+r (i.e., m plus r)
E) mxr (i.e., m multiplied by r)
2. You need a distributed, scalable, data Store that allows you random, realtime read/write access to hundreds of terabytes of data. Which of the following would you use?
A) Hue
B) HBase
C) Oozie
D) Flume
E) Hive
F) Pig
G) Sqoop
3. You need to create a job that does frequency analysis on input data. You will do this by writing a Mapper that uses TextInputForma and splits each value (a line of text from an input file) into individual characters. For each one of these characters, you will emit the character as a key and as IntWritable as the value. Since this will produce proportionally more intermediate data than input data, which resources could you expect to be likely bottlenecks?
A) Processor and RAM
B) Processor and disk I/O
C) Processor and network I/O
D) Disk I/O and network I/O
4. In a MapReduce job, the reducer receives all values associated with the same key. Which statement is most accurate about the ordering of these values?
A) The values are in sorted order.
B) The values are arbitrarily ordered, but multiple runs of the same MapReduce job will always have the same ordering.
C) The values are arbitrarily ordered, and the ordering may vary from run to run of the same MapReduce job.
D) Since the values come from mapper outputs, the reducers will receive contiguous sections of sorted values.
5. You have a large dataset of key-value pairs, where the keys are strings, and the values are integers. For each unique key, you want to identify the largest integer. In writing a MapReduce program to accomplish this, can you take advantage of a combiner?
A) Yes, as long as all the keys fit into memory on each node.
B) Yes, but the number of unique keys must be known in advance.
C) Yes.
D) No, a combiner would not be useful in this case.
E) Yes, as long as all the integer values that share the same key fit into memory on each node.
질문과 대답:
| 질문 # 1 정답: E | 질문 # 2 정답: B | 질문 # 3 정답: B | 질문 # 4 정답: D | 질문 # 5 정답: C |
1088 개 고객 리뷰
품질과 가치ITCertKR 의 높은 정확도를 보장하는 최고품질의 덤프는 IT인증시험에 대비하여 제작된것으로서 높은 적중율을 자랑하고 있습니다.
테스트 및 승인ITCertKR 의 덤프는 모두 엘리트한 전문가들이 실제시험문제를 분석하여 답을 작성한 만큼 시험문제의 적중률은 아주 높습니다.
쉽게 시험패스ITCertKR의 테스트 엔진을 사용하여 시험을 준비한다는것은 첫 번째 시도에서 인증시험 패스성공을 의미합니다.
주문하기전 체험ITCertKR의 각 제품은 무료 데모를 제공합니다. 구입하기로 결정하기 전에 덤프샘플문제로 덤프품질과 실용성을 검증할수 있습니다.
