vu mgt101 Mid Term Subjective Solved Past Paper No.2

vu mgt101 Financial Accounting Solved Past Papers

This subjective solved past paper is related to book/course code vu mgt101 Financial Accounting which belongs to vu organization. We have 4 past papers available related to the book/course Financial Accounting. This past paper has a total of 10 subjective questions belongs to topic Mid Term to get prepared. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to get prepared for exams by learning subjective questions online on NVAEducatio.

NVAEducation also facilitates users to download these solved past papers with an affordable prices. However, users are not enforced to pay for money, rather they can use credits to buy such stuff on NVAEducation. Users can earn credits for doing some little tasks and then you will be able to use that credits to buy solved past papers on NVAEducation.

Question 1: Write a structural RTL for Shift instruction for Uni-Bus data path implementation.
shiftr ra, rb, c1

Answer:

Be the first to post an answer to earn 100 credits.

Question 2: Write down one Advantage and Disadvantage of Microprogramming

Answer:

Advantages

Great sophistication in the user instruction set can be achieved for relatively low cost. Adding new instructions is cheap.

Disadvantages

For a simple machine, the extra hardware needed for the control store and sequencer may be more complex than hardwiring.

Question 3: Write the following statement of an Arithmetic Instruction using RTL. If op-code is 0, the instruction is "add?. The values in register rb and rc are added and the result is stored in register rc

Answer:

(op<4..0>=0) : R[ra] R[rb] + R[rc], (Page 109)

Question 4: Write the Structural RTL description for un-conditional jump instruction for uni-bus data path implementation.
jump [ra+c2]

Answer:

Be the first to post an answer to earn 100 credits.

Question 5: Write the structure RTL description for mov instruction

Answer:

In mov instruction the data in register rb, which is the source register, is to be moved in the register ra, which is the destination register. In first three steps, mov instruction is fetched. In step T3 the contents of register rb are placed in buffer register C through the ALSU unit while in step T4 the buffer register C transfers the data to register ra through internal uni-bus. (Page 164)

Question 6: Write the structure RTL description for shift instruction

Answer:

Shift instructions are rather complicated in the sense that they require extra hardware to hold and decrement the count. For an ALSU that can perform only single bit shifts, the data must be repeatedly cycled through the ALSU and the count decremented until it reaches zero. This approach presents some timing problems, which can be overcome by employing multiple-bit shifts using a barrel shifter. (Page 157)

Question 7: Calculate the complexity of the following sort procedure
sort( A[1..n] ) {
for i = 2 to n
do
for j = n downto i
do
if( A[j-1] > A[j] )
swap(A[j-1], A[j])
}

Answer:

Be the first to post an answer to earn 100 credits.

Question 8: Compute the edit distance and edit scripts for the strings "CRICKET" and "HOCKEY".

Answer:

Be the first to post an answer to earn 100 credits.

Question 9: Determine the complexity of an algorithm that measures the number of print statements in an algorithm that takes a positive integer n and prints 1 one time, 2 two times, 3 three times , ... , n n times.
That is
1
2 2
3 3 3
...
n n n n ... n (n times)
Note:There is no need to write Algorithm(Pseudo code)

Answer:

Be the first to post an answer to earn 100 credits.

Question 10: Develop an O(nlogn)-time algorithm that solves the following problem: Given an unsorted array of n real numbers and a real number x, decide whether there are two numbers y and z in this array such that x = y+z. The output of your algorithm should be "No" if no such numbers y and z exist; otherwise, it should report y and z. (Note that there may be more than one such pair of numbers. It is sufficient to report one of them.) Argue briefly why your algorithm takes O(nlogn) time.

Answer:

Be the first to post an answer to earn 100 credits.