Answer: <em><u> How to code for a database? A database is an organized collection of data, generally stored and accessed electronically from a computer system. Where databases are more complex they are often developed using formal design and modeling techniques. </u></em>
WWW. Wikipedia.com
Explanation: When creating a database first you need to make a software program then you need to start planing on what to do ...
{ A database management program (DBMS) is a software package design designed to manipulate, define, retrieve, and manage data in database.
A DBMS generally manipulates the data itself, the the data format, field names, record structure and file structure.}
<h3><u><em>
HoPe ThIs HeLpS YoU!!</em></u></h3>
<u><em /></u>
Copyright is when someone is given the right to print, publish or make a film.
Answer:
//class Name
class Name {
// attributes gave you 3
String first_name;
String last_name;
int length = 0;
//constructor with 2 parameters
Name(String first_name, String last_name){
}
//methods
public String find_printed_name(){
return first_name + " " + last_name;
}
public void find_sortable_name(){
return last_name + ", " first_name.charAt(0);
}
public static void main(String[] args){
// instantiate the class
Name test_name = new Name("David", "Joyner");
System.out.println(test_name.first_name);
System.out.println(test_name.last_name);
System.out.println(test_name.find_printed_name());
System.out.println(test_name.find_sortable_name());
}
Explanation:
You didn't specify a language so I did it in Java.
You should know how to declare methods in Python.
<h3>What is a Finite automata?</h3>
A finite state machine (FSM) or finite state automaton (FSA), or simply a state machine, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of states at any given time. The FSM may change from one state to another in response to some input; the change from one state to another is called a transition. An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition. Finite-state machines are of two types - deterministic finite-state machines and non-deterministic finite-state machines. A deterministic finite-state machine can be constructed equivalent to any non-deterministic machine.
With that being said, the DFA is equivalent to the expression 10(0+11)0*1 The expression that you've specified requires at least three 1 to be accepted. Breaking it down into parts.
<h3>Writting the automata:</h3>
<em>S0: 1 => S1 ; 1 </em>
<em>S0: 0 => error ; 0 </em>
<em>S1: 0 => S1 ; 10+ </em>
<em>S1: 0 => S2 ; 10(0 </em>
<em>S2: 0 => S2 </em>
<em>S2: 1 => S3 </em>
<em>S3: 1 => S4 </em>
<em>S4: 0 => S4 </em>
<em>S4: 1 => S5 </em>
<em>S5: 1 => S6 (final state) </em>
See more about automata at brainly.com/question/14937298
#SPJ1