Computer Sciences

CS401 - Computer Architecture and Assembly Language Programming

2020-12-27T07:22:00.003-08:00

iAPX88 CS401 -> 14 Registers

MOV AX, 0X4C00 INT 0X21 CS401 -> Terminate

Obtain Physical Address of Stack CS401 -> SS:SP

SI or DI are used CS401 -> Indexed

Symbol associated to an instruction CS401 -> operand

Tells central processor to program CS401 -> Operation Code

Stack Pointer CS401 -> Top of stack

Check Bits of a number are set CS401 -> AND

Physical Memory CS401 -> 32 Bits

Output 1 both input 1 CS401 -> AND

Far Jump CS401 -> Absolute

B80500 CS401 -> B8

General Addressing CS401 -> Base+Index+Offset

Clear the value of AX register CS401 -> XOR AX, AX

BP Pointer CS401 -> Base

8085 CS401 -> 64 KB

Movement Data CS401 -> MOV

Bitwise logical operations CS401 -> AND, OR, XOR and NOT

Simplest form of addressing CS401 -> Immediate addressing

Flag .. produced a zero CS401 -> Zero

not depend on flags CS401 -> JCXZ

zero inserted .. carry flag CS401 -> both SHL and SAL

BH Register CS401 -> 16

correlation process .. uses table CS401 -> Interrupt Vector Table

Extended Shifting Algorithm CS401 -> 2

Interrupt number for NMI CS401 -> INT 2

Non-destructive AND operation CS401 -> AND

Direct Addressing the memory address CS401 -> Fixed

jump .. even parity CS401 -> JPE

Finite Automata (FA) and Push Down Automata (PDA) both are used to express the languages. The Finite Automata is deterministic and Push Down Automata is deterministic and as well as non-deterministic. You are required to give comments on the following statements: • Whether the PDA accepts all the languages that have been accepted by the FA? Yes or No, explain in either case with an example. • Whether the FA accepts all the languages that have been accepted by the PDA? Yes or No, explain in either case with an example.

2019-09-01T13:21:00.001-07:00

Yes, because FA is deterministic and PDA is both deterministic and as well as non-deterministic therefore PDA will accept all languages that would have accepted by FA. For example Regular Langrage r=(aa+bb+(ab+ba)(aa+bb)*(ab+ba))* would be accepted by both FA and PDA.
No, because although PDA is both non-deterministic as well as deterministic however FA is just deterministic. Therefore it is not possible for FA to accept all languages which are being accepted by PDA. PDA would accept non-regular languages which FA cannot. For example L = { ww | w ∈ {a, b }^* }

LOGIN PAGE GUI IN JAVA

2015-07-05T02:52:00.000-07:00

I can provide its code. If someone needs it write your email address in comments.

my "ORF finder project" java code

2011-08-05T05:18:00.001-07:00

i did ma project of java made tool of ORF FINDER with all graphics...if u wana it ....write ur email address below in comment section ..i ll send u in 2-3 days...

source code of"DNA to protein converter tool"made in JAVA

2011-08-03T03:23:00.000-07:00

i did my project in JAVA on "DNA to protein converter tool" if u need source code.write down ur email below in comments .i ll mail u in 2-3 days. cheers :)

Nussinov’s Algorithm

2011-07-24T02:11:00.001-07:00

go to this link

http://www.slideshare.net/xulkifal/rna-structure-prediction