A program P reads in 500 integers in the range [0..100] representing the scores of 500...

Transcribed Image Text:

A program P reads in 500 integers in the range [0..100] representing the scores of 500 students. It then prints the frequency of each score above 50. What would be the best way for P to store the frequencies? An array of 500 numbers A dynamically allocated array of 550 numbers b. An array of 50 numbers d. An array of 100 numbers A sorting technique which guarantees that records with same primary key occurs in the sorted list as in the original unsorted list is said to be a. stable b. consistent Arrays are best data structures a. where the structure is hierarchical b. for relatively permanent collections of data C. c. external d. linear- c. for the case where the size of the structure and the data in the structure are constantly changing for none of the above situations d. A Priority-Queue is implemented as a Max-Heap. Initially, it has 5 elements. The breadth first traversal of t heap is given below: 10, 8, 5, 3, 2 Two new elements "1" and "7 are inserted in the heap in that order. The breadth first traversal of the hea after the insertion of the elements is: a. 10, 8, 7, 5, 3, 2, 1 b. 10, 8, 7, 1, 2, 3, 5 c. d. 10, 8, 7, 3, 2, 1,5 10, 8, 7, 2, 3, 1,5 Which of the following sorting algorithm is of divide-and-conquer type? c. Quick sort a. All of above b. Insertion sort d. Bubble sort A program P reads in 500 integers in the range [0..100] representing the scores of 500 students. It then prints the frequency of each score above 50. What would be the best way for P to store the frequencies? An array of 500 numbers A dynamically allocated array of 550 numbers b. An array of 50 numbers d. An array of 100 numbers A sorting technique which guarantees that records with same primary key occurs in the sorted list as in the original unsorted list is said to be a. stable b. consistent Arrays are best data structures a. where the structure is hierarchical b. for relatively permanent collections of data C. c. external d. linear- c. for the case where the size of the structure and the data in the structure are constantly changing for none of the above situations d. A Priority-Queue is implemented as a Max-Heap. Initially, it has 5 elements. The breadth first traversal of t heap is given below: 10, 8, 5, 3, 2 Two new elements "1" and "7 are inserted in the heap in that order. The breadth first traversal of the hea after the insertion of the elements is: a. 10, 8, 7, 5, 3, 2, 1 b. 10, 8, 7, 1, 2, 3, 5 c. d. 10, 8, 7, 3, 2, 1,5 10, 8, 7, 2, 3, 1,5 Which of the following sorting algorithm is of divide-and-conquer type? c. Quick sort a. All of above b. Insertion sort d. Bubble sort

Answer rating: 100% (QA)

1 Answer B There are 500 students the score range is 0 to 100 Print the frequency of those student w... View the full answer