Home > Uncategorized

Printers || Impact Printers || Non-Impact Printers

Printers Allow The Ability To Print Copies Of Documents Or Pictures On The Paper From A Computer. There Are Several Different Ways That A Computer Can Connect To A Printer. The Most Common Way Is By Using A USB Or Parallel Cable. This Is Called As A Local Connection. Because The Printer Is Directly

RAM (SIMM)

RAM(SIMM) - An Another Type Of Memory Module Is A SIMM.SIMM Stands For Single Inline Memory Module. A SIMM Is A Older Technology. And It Since Been Replaced With By The Much Faster DIMM(Dual Inline Memory Module) A SIMM Also Have Pins On Both Sides Like A DIMM. But In A SIMM The

Regular Expression Examples

Regular Expression Examples   Describe The Following Sets Of Regular Expressions {0,1,2}  {∧,ab} {abb,a,b} {∧,0,00,000....} {1,11,111,1111,......} How To Form Regular Expressions From Above Sets??   1.{0,1,2} This Is The Set Given Containing Symbols 0,1,2 That Means It Could Contain 0 Or 1 Or 2 These Are Symbols Contained In The Set.   In Regular Expression, It Can Be Written Like This R=0+1+2

Conversion Of E-NFA To NFA – Theory Of Computation

Conversion Of E-NFA To NFA - Theory Of Computation Example-1 ε-Closure (q0) - {q0,q1} ε-Closure (q1) - {q1} ε-Closure (q2) - {q2} ε-Closure (q3) - {q3,q1q2} 1)  Initial State - q0 2) Construction Of δ1 Note:- When We Convert ε-NFA To NFA, There Will Be No Change In Number Of States. This Is The Resultant Diagram. There Is No-Transition With 'ε"(Epsilon)

Construct The Minimal DFA Which Accept All Integers Which Are Divisible By ‘6’

Construct The Minimal DFA Which Accept All Integers Which Are Divisible By '6'   L={0,6,12,18,24......} For Binary Numbers, The Input Symbols Were 0,1 i,e Σ={0,1}   But Here In This Problem. We Are Seeing Integer Number System. Means Decimal Number System (0,1,2,3,4,5,6,7,8,9)   In Decimal Number System The Base Will Be 10, We All Know That.   Means 0-10, Any Number Can Come From

DFA Example : Construct Minimal Finite Automata That Accept All The Strings Of 0’s And 1’s Such That Exactly Two 0’s

Construct Minimal Finite Automata That Accept All The Strings Of 0's And 1's Such That i) Exactly Two 0's ii) Almost Two 0's iii) Atleast Two 0's   Solution There Σ={0,1} // Here In The Place Of a,b The Input Alphabets Are a,b   i) Exactly Two 0's Possible Strings :- {00,001,01011,100,1001....} // String Should Contain Exactly Two 0's Small String Is 00 Here