Prepared by:
Diwakar Pandey




Introduction


String Matching:
string matching is an algorithm that try to find a string of length m(called pattern)
from a string of length n (called text).
Text :- Text is an array T of length n.

Pattern:- Pattern is an array P of length m , where m≤n.

Finite alphabet :- It is a finite set of characters . The elements are taken from T and P.It is denoted by Σ.
Eg:- Σ = {0,1}
Σ = {a ....etc

[:=Read Full Message Here=:]

Algorithm:-

begin
if string=*000*
then
printf “Algorithm:-

string accepted”
else
printf “string rejected”
end

Program:-

LEX program to recognize a string with three consecutive 0’s

%%
*000* { printf(“string accepted”);}
* { printf(“string rejected”);}

%%

main()
{
yylex();
}\
int yywrap()
{
return 1;
}
....etc

[:=Read Full Message Here=:]

Base64 uses a 65 character subset of US-ASCII, allowing 6 bits for each character so the character m with a Base64 value of 38, when represented in binary form, is 100110. When a text string, letâ„¢s say mne is encoded this is what happens : The text string is converted into its US-ASCII value. (In US-ASCII each character is assigned a value) ....etc

[:=Read Full Message Here=:]

Objective
Program in “C” to implement DFA.

#include
#include
void main()
{
int state;
int str,input;
char ch;
int x;
int s,n,k=0,j,a,i,l,t,q=0,fs,b,nxt;
clrscr();
printf(enter the no. states\n);
scanf(%d,&s);
printf(enter the no.of i/ps\n);
scanf(%d,&n);
for(i=0;i {
printf(enter the state\n);
scanf(%d,&state);
printf(is it final state?... .y..1/n..0\n);
scanf(%d,&a);
if(a==1)
fs=state;
}
printf(enter the i/p ....etc

[:=Read Full Message Here=:]

I need this program badly.This program is related with my class. So i need this quickly. This is related with compiler subjuct. ....etc

[:=Read Full Message Here=:]

Write a C Program to declare an array for 2 0 floats. Accept the values from the user sort the two arrays in descending order. Merge the two arrays into a new array and display the new array.
/* Build your program around this..... */
main()
{
int a, b, c;
float t;

/*declare an array for 2 0 floats*/
float aList1;
float aList2;
float aList;

/* Accept the values from the user */
/* 1 */
for (c=0; c++;c <20)
scanf(%f, alist1+c);
/* 2 */
for (c=0; c++;c <20)
scanf(%f, alist2+c);

/* sort the ....etc

[:=Read Full Message Here=:]

Base64 uses a 65 character subset of US-ASCII, allowing 6 bits for each character so the character m with a Base64 value of 38, when represented in binary form, is 100110. When a text string, let's say mne is encoded this is what happens : The text string is converted into its US-ASCII value. (In US-ASCII each character is assigned a value)

Download Full Seminar Report
Downlaod

Mirror ....etc

[:=Read Full Message Here=:]

Write a query that will accept an account no. from the user and debit an amount of 2000 from the account. If account has a min. balance of 500 after the balance is debited. The process is to be fired on the account table
PROGRAM CODE:
DECLARE
acct_balance number(11,2);
acct_no VARCHAR2(6);
debit_amt NUMBER(5) := 2000;
min_bal CONSTANT number(5,2):=500.00;
BEGIN
acct_no := '&acct_no';
SELECT bal into acct_balance
FROM accounts
where account_id=acct_no;
acct_balance:=acct_balance-debit_amt;
IF acct_balance >= min_bal then
....etc

[:=Read Full Message Here=:]

I need java code for changing a NFA into DFA of automatas .
I need exactly what you mean .a java code for converting a NFA into DFA .it's my project.
....etc

[:=Read Full Message Here=:]

ȋ̝̊̅ am onyinyechi and a student of library and information science. ȋ̝̊̅ am seeking for your help, i need a place to do my IT ....etc

[:=Read Full Message Here=:]