Answer:
There are no drawbacks
Explanation:
People just think 3D is more modern-ish. I liked 2D better, but whatever- things are changing.
Answer:
data link layer
Explanation:
you answer is data link layer
Cams always us to see things that happen when we are not there
Answer: In external hashing the hash table is in disk where each slot of the page table holds multiple entries which refers to pages on the disk organised in the form of buckets.
B-trees are self balancing trees which contains sorted data and allows insertion, deletion, traversals
Traversal is the process of visiting the nodes of the tree data structure.
Explanation:
External hashing is different from internal hashing and it refers to concepts in database management systems. Internal hashing stores only single record maintained in page table format, whereas external hashing holds multiple entries.
B-trees are generalisation of binary trees where it can have more than 2 children.
Traversal of trees helps in insertion, deletion, modification of nodes in tree data structure
First of all, we will need a function that checks if a number is prime or not:
boolean isPrime(int n){
for(int i=2; i<=math.sqrt(n); i++){
if(n % i == 0) return false;
}
return true;
}
Then, in the main program, we will call this function with all the desired inputs, and we will print the prime numbers:
for(int n=100; n<= 1000; n++){
if(isPrime(n)) print(n);
}
