BCA - BSc Notes (Solapur University)

  Automata – What is it? Automata theory (also known as Theory Of Computation ) is a theoretical branch of Computer Science and Mathematics, which mainly deals with the logic of computation with respect to simple machines, referred to as automata.  Automata* enables scientists to understand how machines compute the functions and solve problems. The main motivation behind developing Automata Theory was to develop methods to describe and analyze the dynamic behavior of discrete systems.  Automata originated from the word “Automaton” which is closely related to “Automation”. An automaton with a finite number of states is called a Finite Automaton (FA) or Finite State Machine (FSM). Related Terminologies  Symbols: Symbols are an entity or individual objects(smallest possible), which can be any letter, alphabet or any picture. Example: 1, a, b, # Alphabet Definition − An alphabet is any finite set of symbols.It is denoted by ∑. Example − ∑ = {a, b, c, d...

    Q. Explain JDK, JRE and JVM?   Q.Why is Java ‘write once and run anywhere’(WORA)? Java applications are called WORA (Write Once Run Anywhere) . This means a programmer can develop Java code on one system and can expect it to run on any other Java-enabled system without any adjustment. This is all possible because of JVM. How Java is WORA: In traditional programming languages like C, C++ when programs were compiled, they used to be converted into the code understood by the particular underlying hardware, so If we try to run the same code at another machine with different hardware, which understands different code will cause an error, so you have to re-compile the code to be understood by the new hardware. In Java, the program is not converted to code directly understood by Hardware, rather it is converted to  bytecode(.class file), which is interpreted by JVM, so once compiled it generates bytecode file, which can be run anywhere (any machine) which has...