Consider the Java code given below that should print the names of students whose grades are between 70.0 and 90.0 (both inclusive). import java.util.; class Student { String name; double grade; public Student(String n, double g) { name = n; grade = g; } } public class TestGrades { public static void main(String[] args) { List students = new ArrayList<>(); students.add(new Student("Anu", 85.5)); students.add(new Student("Bindu", 92.0)); students.add(new Student("Hari", 78.0)); students.add(new Student("David", 70.0)); students.add(new Student("Hasan", 65.0)); //CODE BLOCK } } Choose the correct option(s) to fill in place of CODE BLOCK to obtain the right answer.

(A) students.stream()\ .map(s -> s.grade >= 70.0 \&\& s.grade \ System.out.println(s.name));

(B) students.stream()\ .filter(s -> s.grade >= 70.0 \&\& s.grade \ System.out.println(s.name));

(C) students.stream()\ .filter(s -> s.grade >= 70.0)\ .filter(s -> s.grade \ System.out.println(s.name));

(D) students.stream()\ .filter(s -> s.grade >= 70.0)\ .map(s -> s.grade \ System.out.println(s.name));

Consider the Java code given below. import java.util.; public class PalindromeChecker { public static boolean isPalindrome(String str) { Stack s = new Stack<>(); Deque d = new ArrayDeque<>(); for (char ch : str.toCharArray()) { s.push(ch); d.add(ch); } // CODE BLOCK return true; } public static void main(String[] args) { String word1 = "level"; String word2 = "hello"; System.out.println("Is word1 a palindrome? " + isPalindrome(word1)); System.out.println("Is word2 a palindrome? " + isPalindrome(word2)); } } Choose the correct option to fill in place of CODE BLOCK so that the output is: Is word1 a palindrome? true Is word2 a palindrome? false Please note the following methods from type Stack and Deque: pop(): Removes the object at the top of this stack and returns it. poll(): Retrieves and removes the head of this deque, or returns null if empty. peek(): Retrieves, but does not remove, the head of this deque, or returns null if empty.

(A) while (!s.isEmpty()) {\ if (s.pop().equals(d.peek())) {\ return false;\ }\ }

(B) while (!s.isEmpty()) {\ if (s.pop().equals(d.poll())) {\ return false;\ }\ }

(C) while (!s.isEmpty()) {\ if (!s.pop().equals(d.poll())) {\ return false;\ }\ }

(D) while (!s.isEmpty()) {\ if (!s.pop().equals(d.peek())) {\ return false;\ }\ }

Java Quiz 2: 23 November 2025 (September 2025 term)

Question 1

+7 marksOne or more correct options

Consider the Java code given below that should print the names of students whose grades are between 70.0 and 90.0 (both inclusive).

java

1import java.util.*;
2class Student {
3    String name;
4    double grade;
5    public Student(String n, double g) {
6        name = n;
7        grade = g;
8    }
9}
10public class TestGrades {
11    public static void main(String[] args) {
12        List<Student> students = new ArrayList<>();
13        students.add(new Student("Anu", 85.5));
14        students.add(new Student("Bindu", 92.0));
15        students.add(new Student("Hari", 78.0));
16        students.add(new Student("David", 70.0));
17        students.add(new Student("Hasan", 65.0));
18        //CODE BLOCK
19    }
20}

Choose the correct option(s) to fill in place of CODE BLOCK to obtain the right answer.

Select all that apply.

A
students.stream()
.map(s -> s.grade >= 70.0 && s.grade <= 90.0)
.forEach(s -> System.out.println(s.name));
B
students.stream()
.filter(s -> s.grade >= 70.0 && s.grade <= 90.0)
.forEach(s -> System.out.println(s.name));
C
students.stream()
.filter(s -> s.grade >= 70.0)
.filter(s -> s.grade <= 90.0)
.forEach(s -> System.out.println(s.name));
D
students.stream()
.filter(s -> s.grade >= 70.0)
.map(s -> s.grade <= 90.0)
.forEach(s -> System.out.println(s.name));

Question 2

+5 marksOne correct option

Consider the code given below.
interface Vehicle {
public abstract double getFuelEfficiency();
}
class Car implements Vehicle, Cloneable {
protected double fuelCapacity;
protected double mileage;
public Car(double fuel, double m) {
fuelCapacity = fuel;
mileage = m;
}
public double getFuelEfficiency() {
return fuelCapacity * mileage;
}
public Car clone() throws CloneNotSupportedException {
return (Car) super.clone();
}
}
class ElectricCar extends Car {
public ElectricCar(double batteryCapacity, double mileage) {
super(batteryCapacity, mileage);
}
public ElectricCar clone() throws CloneNotSupportedException {
return (ElectricCar) super.clone();
}
}
public class VehicleTest {
public static void main(String[] args) {
try {
ElectricCar e1 = new ElectricCar(50, 2);
ElectricCar e2 = e1.clone();
e1.fuelCapacity = 100;
System.out.print(e1.getFuelEfficiency() + e2.getFuelEfficiency());
} catch (CloneNotSupportedException e) {
System.out.println("Cloning not supported");
}
}
}
What will the output be?

A
200.0
B
300.0
C
400.0
D
Cloning not supported

Question 3

+7 marksOne correct option

Consider the Java code given below.

java

1import java.util.*;
2public class PalindromeChecker {
3    public static boolean isPalindrome(String str) {
4        Stack<Character> s = new Stack<>();
5        Deque<Character> d = new ArrayDeque<>();
6        for (char ch : str.toCharArray()) {
7            s.push(ch);
8            d.add(ch);
9        }
10        // CODE BLOCK
11        return true;
12    }
13    public static void main(String[] args) {
14        String word1 = "level";
15        String word2 = "hello";
16        System.out.println("Is word1 a palindrome? " + isPalindrome(word1));
17        System.out.println("Is word2 a palindrome? " + isPalindrome(word2));
18    }
19}

Choose the correct option to fill in place of CODE BLOCK so that the output is:

text

1Is word1 a palindrome?  true
2Is word2 a palindrome?  false

Please note the following methods from type Stack and Deque:

pop(): Removes the object at the top of this stack and returns it.

poll(): Retrieves and removes the head of this deque, or returns null if empty.

peek(): Retrieves, but does not remove, the head of this deque, or returns null if empty.

A
while (!s.isEmpty()) {
if (s.pop().equals(d.peek())) {
return false;
}
}
B
while (!s.isEmpty()) {
if (s.pop().equals(d.poll())) {
return false;
}
}
C
while (!s.isEmpty()) {
if (!s.pop().equals(d.poll())) {
return false;
}
}
D
while (!s.isEmpty()) {
if (!s.pop().equals(d.peek())) {
return false;
}
}

12 more questions in this paper

Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.

More on the Java Quiz 2 23 Nov 2025 paper

The IIT Madras BS Programming Concepts using Java (Java) Quiz 2 paper sat on 23 Nov 2025, in the September 2025 term: 15 questions for 100 marks in 120 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.

Feature	Java Quiz 2 23 Nov 2025 at a glance
Term	September 2025 term
Subject	Programming Concepts using Java
Course code	BSCS2005
Questions	15
Marks	100
Duration	120 min
MSQ	4
MCQ	11
Official paper	IIT M DIPLOMA AN EXAM QDD2 23 Nov 2025 NEW
Negative marking	No negative marking.
Updated	25 Sept 2026