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.
From what my teacher taught us it would be c.
Answer:
1. Input() is the correct answer
2.Most programming languages have a data type called a string, which is used for data values that are made up of ordered sequences of characters, such as "hello world". A string can contain any sequence of characters, visible or invisible, and characters may be repeated. ... A string can be a constant or variable .
3.The int() function converts the specified value into an integer number.
4.CandyCost = int(input("How much is the candy?"))
5.int()
ANSWERS
Hello!
The considerations that go into representing data digitally is that the data can be easily sent and interprated to people all over the world. However, one of the trade-offs of representing data digitally is that the information loses a "human" aspect. Instead of experimenting the data, you are simply reading it.
I hope you found this helpful! :)
Answer:
I don't think so. In today's computer era, many different solution directions exist for any given problem. Where OOP used to be the doctrine of choice, now you would consider it only when the problem at hand fits an object-oriented solution.
Reason 1: When your problem can be decomposed in many different classes with each many instances, that expose complex interactions, then an OO modeling is justified. These problems typically produce messy results in other paradigms.
Reason 2: The use of OO design patterns provides a standardized approach to problems, making a solution understandable not only for the creator, but also for the maintainer of code. There are many OO design patterns.
