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!
Let's attempt to answer a fundamental question: 'How does the Computer execute a Program?' Let's describe this with the help of an example from higher level language domain.
Problem: Write a program to add two numbers.
A sample C program (Assuming two fixed values of numbers as a = 5 and b = 2)
1. #include < stdio.h >
2. main ()
3. {
4. int a =5, b=2, c;
5. c= a+b;
6. printf ("\n The added value is: % d", c);
7. }
Program at line 4 states variables which will be equal to 3 memory locations that are a, b and c. At line 5 these variables are added along with at line 6 value of c is printed.
However how will these instructions be executed by CPU? First you have to compile this program to convert it to machine language. Though how will the machine instructions look like? Let's suppose a hypothetical instruction set of machines of a size of 16 binary digits (bits) data and instructions. Each one of the instruction of machine comprises two components: (a) Operation code which specifies the operation which is to be performed by instruction and (b) Address of operand in memory on that given operation is to be performed.
Let's further presume that size of operation code is supposed to be of six bits consequently rest 10 bits are for address of operand. Also the memory word size is presumed to be of 16 bits. Figure below shows instruction and data formats for this machine. To simplify our discussion let's present operation code employing Mnemonics such as ADD, LOAD, STORE and signed decimal values for data and decimal values of operand addresses.
There are basically two methods of copying: Photocopying This is a modified development of photography. It is quite expensive and slow and is not often used for routine rep
Canonical genetic algorithm - Mating: In such a scenario this continues until the number of offspring that is produced is the required number. Further this required number is
Explain Gray Code Ans. Gray Code 1. Extremely useful code. Also termed as reflected code. 2. All gray code is different from the preceding and succeeding codes thr
Define seek time and latency time. The time taken by the head to move to the appropriate cylinder or track is known as seek time. Once the head is at right track, it must wai
What is delegation? Delegation gives a proper mechanism to achieve the desired code reuse. The method is caught in the desired class and forwarded to another class for actual i
1. The missionaries and cannibals problem. Three missionaries and three cannibals are on the left river bank, with a boat that can hold one or two people. If on either side of the
Reassembling of IP fragments at the ultimate destination is advantageous. Give reasons. Needing the ultimate destination to reassemble the fragments has two major advantages. F
Define variants of Turing Machine? Variants are Non deterministic turing machine. Mutlitape turing machine. Enumerators
where should I work?
Explain bit pair recoding with an example? Ans: Bit pair recoding halves the maximum number of summands. Group the Booth-recoded multiplier bits in pairs and see the following
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