Object Oriented Programming Though Java Syllabus(VR23): Click Here
Unit-1 : 1st Part Notes Click Here
Unit-1 : 2nd Part Notes Click Here
Unit- 2 : Packages & Interfaces Notes Available
Unit-2 : Java.io Package See Here
Unit-3 Hand written Notes Click Here
Unit-4 Collection Framework PPT Download
Java.io PPT Download
JDBC Connectivity PPT Downlaod
import java.util.*;
abstract class Shape {
int length, breadth, radius;
Scanner input = new Scanner(System.in);
abstract void printArea();
}
class Rectangle extends Shape {
void printArea() {
System.out.println("*** Finding the Area of Rectangle ***");
System.out.print("Enter length and breadth: ");
length = input.nextInt();
breadth = input.nextInt();
System.out.println("The area of Rectangle is: " + length * breadth);
}
}
class Triangle extends Shape {
void printArea() {
System.out.println("\n*** Finding the Area of Triangle ***");
System.out.print("Enter Base And Height: ");
length = input.nextInt();
breadth = input.nextInt();
System.out.println("The area of Rectangle is: " + (length * breadth) / 2);} } class Cricle extends Shape
{
void printArea() {
System.out.println("\n*** Finding the Area of Cricle ***");
System.out.print("Enter Radius: ");
radius = input.nextInt();
System.out.println("The area of Rectangle is: " + 3.14f * radius * radius);
}
}
public class AbstractClassExample {public static void main(String[] args)
{
Rectangle rec = new Rectangle();
rec.printArea();
Triangle tri = new Triangle();
tri.printArea();
Cricle cri = new Cricle();
cri.printArea();
}
}
Students blog for Happy Learning
Java Programming Syllabus(R18-CSE-JNTUH): Click Here
Object Oriented Programming Through Java Syllabus(R18-EIE-JNTUH): Click Here
Unit-1 : 1st Part Notes Click Here
Unit-1 : 2nd Part Notes Click Here
Unit Wise Important Questions: Download
Objective Questions :Download
Chomsky Hierarchy
Chomsky Hierarchy represents the class of languages that are
accepted by the different machine. The category of language in Chomsky's
Hierarchy is as given below:
This
is a hierarchy. Therefore every language of type 3 is also of type 2, 1 and 0.
Similarly, every language of type 2 is also of type 1 and type 0, etc.
Type 0 grammar is known as
Unrestricted grammar. There is no restriction on the grammar rules of these
types of languages. These languages can be efficiently modeled by Turing
machines.
For example:
1. bAa → aa
2. S → s
Type 1 grammar is known as
Context Sensitive Grammar. The context sensitive grammar is used to represent
context sensitive language. The context sensitive grammar follows the following
rules:
Where the count of symbol in V is
less than or equal to T.
For example:
1. S → AT
2. T → xy
3. A → a
Type 2 Grammar is known as
Context Free Grammar. Context free languages are the languages which can be
represented by the context free grammar (CFG). Type 2 should be type 1. The
production rule is of the form
1. A → α
Where A is any single
non-terminal and is any combination of terminals and non-terminals.
For example:
1. A → aBb
2. A → b
3. B → a
Type 3 Grammar is known as
Regular Grammar. Regular languages are those languages which can be described
using regular expressions. These languages can be modeled by NFA or DFA.
Type 3 is most restricted form of
grammar. The Type 3 grammar should be Type 2 and Type 1. Type 3 should be in
the form of
1. V → T*V / T*
For example:
1. A → xy
L = {a | k is a prime number}
Let us assume L is regular.
-> Clearly L is infinite (there are infinitely many prime numbers). From the pumping lemma, there exists a number n such that any string w of length greater than n has a “repeatable” substring generating more strings in the language L.
Let us consider the first prime number p >= n.
For example,
if n was 50 we could use p = 53.
From the pumping lemma the string of length p has a “repeatable” substring. We will assume that this substring is of length k >= 1.
Hence:
Pumping lemma used to show that language is not regular.
What is pumping?
for regular expression
r = (a u b) (abb)* (bba u bbb), the string w= babbbbb pumps because we may decompose w into three sub strings.
w= b. abb. bbb
such that b(abb)i bbb is represented by r, for every i>= 0.
in this DFA.,
|v| >= 1
|uv| <=k
u vi w belongs to L, for all i>=0.
FLAT Syllabus( VR23-CSE- Vignan Institute of Technology and Science- An Autonomous Institution ): Click Here
Unit-1 : Hand Written Notes Click Here
Unit-2 : Hand Written Notes Click Here
Unit-3 : Hand Written Notes Click Here
Unit-4 : Hand Written Notes Click Here
New notes on Push Down Automata and Turing Machine Click Here
Unit-5 : Notes Click Here
Unit Wise Important Questions (Question Bank): Download
JNTUH FLAT Previous Questions: Download
Students blog for Happy Learning
Web Technologies Syllabus(R18-CSE-JNTUH): Click Here
Unit-1 : Notes Click Here
Unit-2 : Notes Click Here
Unit-3: Notes Click Here
Unit-4 : Notes Click Here
Unit-5 : Notes Click Here
Unit Wise Important Questions: Download
JNTUH Unit Wise Previous Questions: Download