Royal Electronics

16/09/2014

https://www.youtube.com/watch?v=otACzuXiVAE

Story- Direction :: Rajesh (Gayle) Producer: Hemanthkumar kolli Music & Background Score: Rajendra Raju Edited & VFX : Hemanth sai kumar Director Of Photogra...

27/08/2014

THE SHIELD of ROYAL ELECTRONICS

13/08/2014

CODD RULES in DBMS

Rule 1: Information rule
This rule states that all information (data), which is stored in the database, must be a value of some table cell. Everything in a database must be stored in table formats. This information can be user data or meta-data.

Rule 2: Guaranteed Access rule
This rule states that every single data element (value) is guaranteed to be accessible logically with combination of table-name, primary-key (row value) and attribute-name (column value). No other means, such as pointers, can be used to access data.

Rule 3: Systematic Treatment of NULL values
This rule states the NULL values in the database must be given a systematic treatment. As a NULL may have several meanings, i.e. NULL can be interpreted as one the following: data is missing, data is not known, data is not applicable etc.

Rule 4: Active online catalog
This rule states that the structure description of whole database must be stored in an online catalog, i.e. data dictionary, which can be accessed by the authorized users. Users can use the same query language to access the catalog which they use to access the database itself.

Rule 5: Comprehensive data sub-language rule
This rule states that a database must have a support for a language which has linear syntax which is capable of data definition, data manipulation and transaction management operations. Database can be accessed by means of this language only, either directly or by means of some application. If the database can be accessed or manipulated in some way without any help of this language, it is then a violation.

Rule 6: View updating rule
This rule states that all views of database, which can theoretically be updated, must also be updatable by the system.

Rule 7: High-level insert, update and delete rule
This rule states the database must employ support high-level insertion, updation and deletion. This must not be limited to a single row that is, it must also support union, intersection and minus operations to yield sets of data records.

Rule 8: Physical data independence
This rule states that the application should not have any concern about how the data is physically stored. Also, any change in its physical structure must not have any impact on application.

Rule 9: Logical data independence
This rule states that the logical data must be independent of its user’s view (application). Any change in logical data must not imply any change in the application using it. For example, if two tables are merged or one is split into two different tables, there should be no impact the change on user application. This is one of the most difficult rule to apply.

Rule 10: Integrity independence
This rule states that the database must be independent of the application using it. All its integrity constraints can be independently modified without the need of any change in the application. This rule makes database independent of the front-end application and its interface.

Rule 11: Distribution independence
This rule states that the end user must not be able to see that the data is distributed over various locations. User must also see that data is located at one site only. This rule has been proven as a foundation of distributed database systems.

Rule 12: Non-subversion rule
This rule states that if a system has an interface that provides access to low level records, this interface then must not be able to subvert the system and bypass security and integrity constraints.

06/08/2014

5th Sem 1 Mid Time Table

05/08/2014

27/07/2014

https://www.youtube.com/watch?v=YrSx0U4pvvA&hd=1

14/07/2014

Op codes

14/07/2014

Data transfering OPcodes

Opcode Operand Description

Copy from source to destination
MOV Rd, Rs This instruction copies the contents of the source
M, Rs register into the destination register; the contents of
Rd, M the source register are not altered. If one of the operands is a
memory location, its location is specified by the contents of
the HL registers.
Example: MOV B, C or MOV B, M

Move immediate 8-bit
MVI Rd, data The 8-bit data is stored in the destination register or
M, data memory. If the operand is a memory location, its location is
specified by the contents of the HL registers.
Example: MVI B, 57H or MVI M, 57H

Load accumulator
LDA 16-bit address The contents of a memory location, specified by a
16-bit address in the operand, are copied to the accumulator.
The contents of the source are not altered.
Example: LDA 2034H

Load accumulator indirect
LDAX B/D Reg. pair The contents of the designated register pair point to a memory
location. This instruction copies the contents of that memory
location into the accumulator. The contents of either the
register pair or the memory location are not altered.
Example: LDAX B

Load register pair immediate
LXI Reg. pair, 16-bit data The instruction loads 16-bit data in the register pair
designated in the operand.
Example: LXI H, 2034H or LXI H, XYZ

Load H and L registers direct
LHLD 16-bit address The instruction copies the contents of the memory location
pointed out by the 16-bit address into register L and copies
the contents of the next memory location into register H. The
contents of source memory locations are not altered.
Example: LHLD 2040H

Store accumulator direct
STA 16-bit address The contents of the accumulator are copied into the memory
location specified by the operand. This is a 3-byte instruction,
the second byte specifies the low-order address and the third
byte specifies the high-order address.
Example: STA 4350H

Store accumulator indirect
STAX Reg. pair The contents of the accumulator are copied into the memory
location specified by the contents of the operand (register
pair). The contents of the accumulator are not altered.
Example: STAX B

Store H and L registers direct
SHLD 16-bit address The contents of register L are stored into the memory location
specified by the 16-bit address in the operand and the contents
of H register are stored into the next memory location by
incrementing the operand. The contents of registers HL are
not altered. This is a 3-byte instruction, the second byte
specifies the low-order address and the third byte specifies the
high-order address.
Example: SHLD 2470H

Exchange H and L with D and E
XCHG none The contents of register H are exchanged with the contents of
register D, and the contents of register L are exchanged with
the contents of register E.
Example: XCHG

Copy H and L registers to the stack pointer
SPHL none The instruction loads the contents of the H and L registers into
the stack pointer register, the contents of the H register
provide the high-order address and the contents of the L
register provide the low-order address. The contents of the H
and L registers are not altered.
Example: SPHL

Exchange H and L with top of stack
XTHL none The contents of the L register are exchanged with the stack
location pointed out by the contents of the stack pointer
register. The contents of the H register are exchanged with
the next stack location (SP+1); however, the contents of the
stack pointer register are not altered.
Example: XTHL

Push register pair onto stack
PUSH Reg. pair The contents of the register pair designated in the operand are
copied onto the stack in the following sequence. The stack
pointer register is decremented and the contents of the high-
order register (B, D, H, A) are copied into that location. The
stack pointer register is decremented again and the contents of
the low-order register (C, E, L, flags) are copied to that
location.
Example: PUSH B or PUSH A

Pop off stack to register pair
POP Reg. pair The contents of the memory location pointed out by the stack
pointer register are copied to the low-order register (C, E, L,
status flags) of the operand. The stack pointer is incremented
by 1 and the contents of that memory location are copied to
the high-order register (B, D, H, A) of the operand. The stack
pointer register is again incremented by 1.
Example: POP H or POP A

Output data from accumulator to a port with 8-bit address
OUT 8-bit port address The contents of the accumulator are copied into the I/O port
specified by the operand.
Example: OUT F8H

Input data to accumulator from a port with 8-bit address
IN 8-bit port address The contents of the input port designated in the operand are
read and loaded into the accumulator.
Example: IN 8CH
s

03/07/2014

03/07/2014

Working of 8085 micro processor