Here, we will create a queue using the Queue collection class and get the sum of queue items from the queue using the sum() method, and print the result on the console screen.
The Queue is a linear data structure, It follows the First In First Out (FIFO) property. We can insert and remove the item in the queue from different ends of the queue.
The source code to calculate the sum of all queue elements is given below. The given program is compiled and executed on the ubuntu 18.04 operating system successfully.
// Scala program to calculate the
// sum of all queue elements
import scala.collection.mutable._
object Sample {
// Main method
def main(args: Array[String]) {
var queue = Queue(60, 25, 23, 40, 50);
var sum = queue.sum;
println("Sum of queue elements is: " + sum);
}
}
Output:
Largest element is: 60
Explanation:
Here, we used an object-oriented approach to create the program. And, we imported Collection classes using the below statement,
import scala.collection.mutable._
And, we also created a singleton object Sample and defined the main() function. The main() function is the entry point for the program.
In the main() function, we created a queue queue using the Queue collection class. Then we got the sum of items of queue using the sum() method and printed the result on the console screen.
Program/Source Code:
The source code to calculate the sum of all queue elements is given below. The given program is compiled and executed on the ubuntu 18.04 operating system successfully.
Output:
Explanation:
Here, we used an object-oriented approach to create the program. And, we imported Collection classes using the below statement,
And, we also created a singleton object Sample and defined the main() function. The main() function is the entry point for the program.
In the main() function, we created a queue queue using the Queue collection class. Then we got the sum of items of queue using the sum() method and printed the result on the console screen.
need an explanation for this answer? contact us directly to get an explanation for this answer