IIRM

Post Graduate Diploma in Management (PGDM)

Batch 2020-22

Semester I

End Term Examinations

Subject : Computer System Architecture and Design of Algorithms

Time : 3 Hours Total Marks: 100

PART A
Answer ALL Questions
5 * 8 = 40 Marks

1. Represent the floating point number (-138.121)10 in IEEE 754 single and
double precision format.
2. By using the laws of Boolean Algebra, simplify (A+C) (AD+AD) +AC+C.
3. Find the Maximum and Minimum values in the given array using Min-Max
approach.

9 -7 25 36 -1 56 3 72 80 -2

4. Find the minimal spanning tree for the following graph using
a. Prim’s Algorithm and
b. Kruskal’s Algorithm

Page 1
 IIRM
5. Multiplexers, or data selectors, may be used to select arbitrary truth table
function. Take for example the truth table shown beside a symbol for 16
channel multiplexer
Show the wire connection necessary to make the multiplexer output the
specified logic states in response to the data select (A, B, C and D) inputs.

A B C D Out

0 0 0 0 1
0 0 0 1 0
0 0 1 0 0
0 0 1 1 1
0 1 0 0 1
0 1 0 1 0
0 1 1 0 0
0 1 1 1 0
1 0 0 0 1
1 0 0 1 1
1 0 1 0 0
1 0 1 1 0
1 1 0 0 0
1 1 0 1 1
1 1 1 0 0
1 1 1 1 1

PART B

Answer ALL Questions

4 * 15 = 60 Marks

6. Sort the following array elements using Bubble sort, specify the number of
passes required and its time complexity.

55 56 23 18 45 33 15 62 3 25

7. Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an

initially empty Binary Search Tree. What is the inorder, preorder and post
order traversals sequences of the resultant tree. (Construct the trees).

Page 2
 IIRM
8. a) Use a Karnaugh map to generate a simple Boolean Expression for the
given Truth table, and draw a gate circuit equivalent to that expression:

A B C D Output

0 0 0 0 0

0 0 0 1 0

0 0 1 0 0

0 0 1 1 0

0 1 0 0 0

0 1 0 1 0

0 1 1 0 1

0 1 1 1 0

1 0 0 0 0

1 0 0 1 0

1 0 1 0 1

1 0 1 1 1

1 1 0 0 0

1 1 0 1 0

1 1 1 0 1

1 1 1 1 1

b) Deign a combinational circuit with three inputs and one output

i) The output is high when binary value of the input is less than 3, output
is low otherwise.
ii) The output is high when the binary value of the input is an odd
number.
9. Sort the following array using Heap sort.

1 12 9 5 6 10 15 2

End of paper

Page 3