Answer:
ssume that,
Maximum “students” count can be 10.
*Driver Class*
*Solution class*
import java.util.*;
class Student {
private String name;
private int rollNo;
public String getName() {}
public void setName(String name) {}
public int getRollNo() {}
public void setRollNo(int rollNo) {}
};
class ClassRoom {
private int i;
private Student[] students;
public void addStudent(String name, int rollNo) {}
public Student[] getAllStudents() {}
};
<u>Explanation:</u>
Hey there! you need not to panic about it ,your program didn't have Driver program i.e main program! the correct & working code is given below:
// C++ program to count even digits in a given number .
#include <iostream>
using namespace std;
// Function to count digits
int countEven(int n)
{
int even_count = 0;
while (n > 0)
{
int rem = n % 10;
if (rem % 2 == 0)
even_count++;
n = n / 10;
}
cout << "Even count : "
<< even_count;
if (even_count % 2 == 0 )
return 1;
else
return 0;
}
// Driver Code
int main()
{
int n;
std::cin >>n;
int t = countEven(n);
return 0;
}
Answer:
Extended star topology
Explanation:
The Extended star topology also known as the tree topology comprises of characteristics of the linear bus topology and star topology.
It consist of multiple star connected topologies connected to a linear backbone bus topology. It has a wider communication area than the star topology and uses more cabling length. All the star networks are connected to a central connection which allows to have a full functioning network when others fails.
Answer:
Direct Mapped Cache
Explanation:
Given that a Direct Mapped Cache is a form of mapping whereby each main memory address is mapped into precisely one cache block.
It is considered cheaper compared to the associative method of cache mapping, and it is faster when searching through it. This is because it utilizes a tag field only.
Hence, The method of mapping where each memory location is mapped to exactly one location in the cache is "Direct Mapped Cache"
