Birla Institute of Technology (BIT Mesra) 2004 MS Software Engineering Structured Programming - Question Paper

BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE, PILANI
DISTANCE LEARNING PROGRAMMES DIVISION
FIRST SEMESTER 2004-2005

MID SEMESTER TEST (Regular)

Course Number : SEPC ZC221
Course Title : Structured Programming


ques. 1.
a. Convert subsequent decimal numbers to 8-bit 2’s Complement binary numbers: (3)
i. 33
ii. -128

Answer: [1.5 per part.]
33: 00100001
-128: 10000000

b. Express –27 as a 2’s complement integer using eight bits, 16 bits and 32 bits. What does this illustrate with respect to property of sign extension as they pertain to 2’s complement representation. (2)

Answer: 11100101, 1111111111100101, 11111111111111111111111111100101.
This illustrates that Sign extension does not affect the value represented.

[1 mark for representation, and one mark for concluding on sign extension].

ques. 2.
a. Add the subsequent 4-bit 2’s complement binary numbers: 1100 + 0100.
Does it generate an overflow? Justify by translating the operands and outcomes into decimal. (3)

Answer: The operands translate to +4 & -4, and outcome is 0. In 2’s complement binary addition, value is 10000 i.e. there is a carry out. However, in 2’s complement arithmetic, carry is ignored

[1.5 marks for binary arithmetic and 1.5 for justifying].

b. “Levels of Transformation” are also referred to as levels of abstraction. Is it a reasonable characterization? If yes, provide an example. If not, why not? (2)

Answer: Yes. At every of the next higher levels, there is an abstraction. Eg. Programmers writing code in higher-level language do not have to bother about how it is taken care of in the ISA.

[1 mark for answer, and one mark for explanation].



ques. 3.
a. Fill in the truth table for the logical expression NOT (NOT (A) OR NOT (B)). What single logic gate has the identical truth table? (3)

Answer:
A B NOT(NOT(A) OR NOT(B))
0 0 0
0 one 0
1 0 0
1 one 1

The AND gate has the identical truth table.
[2 marks for truth table and one mark for single logic gate]

b. Explain meanings of terms Address Space and Addressability. (2)

Answer: Address Space is total no. of uniquely identifiable locations in memory. Addressability is no. of bits stored in every memory location.
[1 mark per bit.]

ques. 4.
a. Name the five components of the Von Neumann Model, and state the purpose for every component. (3)

Answer: subsequent are the Components of the Von Neumann Model:
(a) Memory: Storage of info (data/program)

Earning:   Approval pending.