Register

NIELIT Scientific Assistant A 2020 November: 109

• recategorized by
674 views
1 votes
1 votes

A program $\text{P}$ reads in $500$ integers in the range $[0\dots100]$ representing the scores of $500$ students. It then prints the frequency of each score above $50.$ What would be the best way for $\text{P}$ to store the frequencies?

  1. An array of $50$ numbers
  2. An array of $100$ numbers
  3. An array of $500$ numbers
  4. A dynamically allocated array of $550$ numbers
• recategorized by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
gatecse asked Dec 9, 2020
445 views
NIELIT Scientific Assistant A 2020 November: 58
A stack can be implemented using queue, but then we need to use atleast : $3$ queues $2$ queues only one queue is sufficient none of the options
A stack can be implemented using queue, but then we need to use atleast :$3$ queues$2$ queuesonly one queue is sufficientnone of the options
User Avatar
1 votes
1 votes
1 answer
2
gatecse asked Dec 9, 2020
346 views
NIELIT Scientific Assistant A 2020 November: 93
When we perform in order traversal on a binary tree, we get the ascending order array. The tree is: Heap tree almost complete binary tree Binary search tree Cannot be determined
When we perform in order traversal on a binary tree, we get the ascending order array. The tree is:Heap treealmost complete binary treeBinary search treeCannot be determi...
User Avatar
1 votes
1 votes
1 answer
3
gatecse asked Dec 9, 2020
458 views
NIELIT Scientific Assistant A 2020 November: 114
Priority queue is implemented by : Doubly link list Graph Heap Stack
Priority queue is implemented by :Doubly link listGraphHeapStack
User Avatar
1 votes
1 votes
1 answer
4
gatecse asked Dec 9, 2020
388 views
NIELIT Scientific Assistant A 2020 November: 115
A recursive problem like tower of hanoi can be rewritten without recursion using: stack priority queue graph cycles
A recursive problem like tower of hanoi can be rewritten without recursion using:stackpriority queuegraphcycles
User Avatar
Link Copied!