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.
In the statement Write:/15(10) lfa1-lifnr. The values 15 and 11 can also be defined by variable. No, the value of 11 nad 15 is not described by variable.
Suppose that a process scheduling algorithm favors those processes that have used the least processor time in the recent past. Why will this algorithm favour I/O- bound processes,
how can we design a multiplier by using ASM chart and then design the data controller ?!!
Q Convert the following DECIMAL numbers into HEXADECIMAL, double check by converting the result HEXADECIMAL to DECIMAL. a) 24 b) 547.56
Define nondeterministic TM? Arbitrarily chooses move when more than one possibility exists Accepts if there is at least one computation that terminates in an acceptin
Procedure Level Here, parallelism is accessible in the form of parallel executable procedures. In this situation, the design of the algorithm plays a main role. For example eac
What are types of firewalls? There are conceptually two types of firewalls as: 1. Network Level 2. Application Level
Final Implementation of Object oriented modelling Final Implementation: At this phase, the final execution of classes and relationships developed while object design takes
Q. Explain about Butterfly permutation? Butterfly permutation: This kind of permutation is attained by interchanging the most significant bit in address with least significant
Q. Computational Fluid Dynamics? Computational Fluid Dynamics: CFD was a FORTRAN like language developed in the early 70s at "Computational Fluid Dynamics Branch of Ames Resear
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