Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Q. Explain about Registers?
A register is a group of flip-flops that store binary information and gates that controls when and how information is transferred to register. An n-bit register contains n flip-flops and stores n-bits of binary information. Two fundamental types of registers are: Shift register and Parallel registers.
A parallel register is one of simplest registers comprising a set of flip-flops which can be read or written concurrently. Figure demonstrates a 4-bit register with parallel input-output. Signal lines Io to I3 inputs to flip-flops that may be output of other arithmetic circuits such as multipliers so that data from different sources can be loaded in the register. It has one extra line known as clear line that can clear register completely. This register is known as a parallel register as all bits of register can be loaded in a single clock pulse.
Figure: 4-bit parallel register
A shift register is used for shifting data to left or right. A shift register operates in serial input-output mode it implies that data is entered in register one bit at a time from one end of register and can be read from other end as one bit at a time. Figure below demonstrates a 4-bit right shift register employing D logical shift functions.
Figure: 4-bit right - shift register
The six several application of stack in computer application is: 1. Conversion of infix to postfix notation and vice versa. 2. Evaluation of arithmetic expression. 3.
Current Pentium 4 based MPUs use Hyper-threading, but the next-generation cores, Woodcrest and Merom, Conroe will not. While some have alleged that this is because Hyper-threading
Write a program to convert the given Decimal number into its equivalent Binary number.
Q. Explain the odd-even transposition algorithm? The algorithm needs one 'for loop' beginning from I=1 to N it implies that N times and for every value of I, one 'for loop' of
In a single stage network: (A) There is no redundancy (B) There is redundancy (C) Alternative cross points are available (D) Alt
Principle of locality: Temporal base locality (locality in time):- If an item is referenced then it will tend to be referenced again soon. Spatial locality (local
Why don't we permit a minimum degree of t=1 for a B-tree? According to the definition of B-Tree, a B-Tree of order n means that every node in the tree has a maximum of n-1 keys
super string checker
Q. Advantages and Disadvantage of Message Passage Programming? Advantages of Message Passage Programming Portable It is less error prone Offers excellent
scan line seed fill algorithm program using opengl
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd