Answer:
False
Explanation:
A regular language can be represented by a regular expression. A regular language can be infinite. Let us consider a simple example of an infinite regular language:
a* is a regular language represented by a regular expression.
The languages matches all strings containing or more a's.
Clearly this is an infinite language.
Note that all finite languages are regular but all regular languages need not be finite.
Here you go. I added a constructor and a toString overload to make the object creation and printing as easy as possible.
public class student {
private String _id;
private String _name;
private String _address;
public student(String id, String name, String address) {
_id = id;
_name = name;
_address = address;
}
public String toString() {
return "Id: " + _id + "\nName: " + _name + "\nAddress: "+ _address;
}
public static void main(String[] args) {
student s1 = new student("S12345", "John Doe", "Some street");
System.out.println(s1);
}
}
Answer
Crawler
Explanation
This is a program that go to various website to read their pages and content provided in order to form entries for a search engine index.All search engines have this program called spider or a bot. It acts as an automated script that browses through the internet to scan the web pages and find words contained in the pages and where the words are used.
