6/24/2021 BUET CSE MSc Admission Test, April 2021 Part 3 of 4

BUET CSE MSc Admission Test, April

2021 Part 3 of 4

Part 3 of 4: There are 25 MCQ questions in this part. Answer all the questions.

Which of the following is an example of register relative addressing in an 8086

microprocessor?

MOV CL, [BX+4]

MOV [BX], CL

MOV AX, [BX + DI + 4]

MOV [BX+SI], BP

What will the contents of register AL look like after the following instructions are
executed?

FA and carry flag is set

0A and carry flag is reset

0A and carry flag is set

FA and carry flag is reset

https://docs.google.com/forms/d/e/1FAIpQLSfs7fWbZWHFecHad9Z6ArqqAnmhNKRCyzSy6e7x7EqcsinBEw/formResponse 1/12
6/24/2021 BUET CSE MSc Admission Test, April 2021 Part 3 of 4

What will be output function F (X, Y, Z) in the sum-of-minterms form? Assume X

as the most significant bit and Z as the least significant bit.

∑(0, 1, 2, 3)

∑(0, 2, 6, 7)

∑(2, 3)

∑(0, 1)

Which of the following pairs represents hardware interrupt in an 8086

microprocessor?

INT0 and INTR

NMI and INT5

INTR and NMI

INTA and NMI

https://docs.google.com/forms/d/e/1FAIpQLSfs7fWbZWHFecHad9Z6ArqqAnmhNKRCyzSy6e7x7EqcsinBEw/formResponse 2/12
6/24/2021 BUET CSE MSc Admission Test, April 2021 Part 3 of 4

A computer system has enough room to hold five programs in its main memory.
These programs are idle waiting for I/O half the time. What fraction of the CPU
time is wasted?

(0.2)^0.5

(0.5)^5

(0.5)^0.5

(0.2)^5

What is the size of a Direct-Mapped cache with 16 KB of data and 4-word blocks,
assuming a 32-bit address (byte addressable) and 32-bit words? There is a dirty
bit.

150 KB

148 KB

147 KB

149 KB

A majority circuit is a combinational circuit whose output is equal to 1 if the input

variables have more 1’s than 0’s. The output is 0 otherwise. What will be the
simplified Boolean equation for the output of a 3-input (a, b, c) majority circuit?

ab+bc+ac

abc

abc+ab+bc

abc+abc’+a’bc+ab’c

https://docs.google.com/forms/d/e/1FAIpQLSfs7fWbZWHFecHad9Z6ArqqAnmhNKRCyzSy6e7x7EqcsinBEw/formResponse 3/12
6/24/2021 BUET CSE MSc Admission Test, April 2021 Part 3 of 4

One of the main pitfalls of any greedy algorithm is trapping at local optima. This
problem can be efficiently tackled by

restarting the algorithm.

using simulated annealing in conjunction with greedy algorithm.

changing the cost function of greedy algorithm.

None of the above.

In an 8086 microprocessor, a memory location pointed by a segment address of

2000H and offset address of 1000H is written as 2000:1000. What is the
actual/physical memory location for 2000:1000?

12000

21000

2100

3000

Consider a 32-bit computer architecture and a byte addressable memory. Now

there is a jump instruction that takes an immediate address as part of the
instruction where the execution jumps directly. To give an example, if ‘j 2020h’ is
executed, the next instruction is fetched from the memory address 2020h. Each
instruction is 32 bit long and the opcode requires 4 bit. Up to which address can
it jump?

2^28 - 1

cannot be determined

depends on the current address

2^28

https://docs.google.com/forms/d/e/1FAIpQLSfs7fWbZWHFecHad9Z6ArqqAnmhNKRCyzSy6e7x7EqcsinBEw/formResponse 4/12
6/24/2021 BUET CSE MSc Admission Test, April 2021 Part 3 of 4

Suppose at a given period, four jobs have arrived with the following data.
Assume, a job waits 80% of the time for I/O while in memory. Now, calculate the
total amount of time needed for all four jobs to be completed.

31 min

37 min

46 min

24 min

Which of the following is not a feature of a microprocessor?

Built-in debugger program with interrupt capability

High computational capacity

Parallel I/O

Built-in memory and I/O components

https://docs.google.com/forms/d/e/1FAIpQLSfs7fWbZWHFecHad9Z6ArqqAnmhNKRCyzSy6e7x7EqcsinBEw/formResponse 5/12
6/24/2021 BUET CSE MSc Admission Test, April 2021 Part 3 of 4

Consider an artificial agent is operating in a partially observable and

nondeterministic environment. The most suitable agent type for such an
environment is

model-based reflex agents.

Goal-based agents.

Autonomous agents.

simple reflex agents.

Suppose we have the following instruction mix data and the cycles per
instruction in a multi-cycle architecture. How faster it is than a single cycle
version?

2 times

1.5 times

2.36 times

1.36 times

https://docs.google.com/forms/d/e/1FAIpQLSfs7fWbZWHFecHad9Z6ArqqAnmhNKRCyzSy6e7x7EqcsinBEw/formResponse 6/12
6/24/2021 BUET CSE MSc Admission Test, April 2021 Part 3 of 4

What is the next state equation for A(t+1) for the following circuit?

X(t)+A(t)

X’(t)

What is the overhead of a Direct-Mapped cache with 16 KB of data and 4-word

blocks, assuming a 32-bit address (word addressable) and 32-bit words?

13.51%

14.09%

12.93%

14.66%

https://docs.google.com/forms/d/e/1FAIpQLSfs7fWbZWHFecHad9Z6ArqqAnmhNKRCyzSy6e7x7EqcsinBEw/formResponse 7/12
6/24/2021 BUET CSE MSc Admission Test, April 2021 Part 3 of 4

What will be the simplified form of the following Boolean expression in terms of
the minimum number of literals: wx+ w x’+xyz’ + x’yz’ + xy’z’ + x’y’z’ + z?

w+z

In a multithreaded system, it takes 25 msec to get a request for work, dispatch it

and do the rest of the necessary processing assuming that the data needed are
in the block cache. Otherwise disk operation is needed. If a disk operation is
needed, an additional 75 ms is required, during which time the thread sleeps.
One-third of the time data needed are not in the block cache. How many
requests/sec can the server handle on average?

66.67

25.00

23.08

40.00

https://docs.google.com/forms/d/e/1FAIpQLSfs7fWbZWHFecHad9Z6ArqqAnmhNKRCyzSy6e7x7EqcsinBEw/formResponse 8/12
6/24/2021 BUET CSE MSc Admission Test, April 2021 Part 3 of 4

In a disk, disk requests come in to the disk driver for cylinders 10, 22, 20, 2, 40, 6
and 38. A seek takes 6 msec per cylinder moved. How much seek time in msec is
needed for the Elevator Algorithm, if the initial arm position is at cylinder 20
moving upward.

876

58

348

360

To improve the performance of adversarial search, we can use lookup table

rather than search

only at the beginning of a game.

only at the ending of a game.

both at the beginning and ending of a game.

None of the above.

https://docs.google.com/forms/d/e/1FAIpQLSfs7fWbZWHFecHad9Z6ArqqAnmhNKRCyzSy6e7x7EqcsinBEw/formResponse 9/12
6/24/2021 BUET CSE MSc Admission Test, April 2021 Part 3 of 4

Suppose we have the following instruction mix data and the cycles per
instruction in an architecture. Calculate the CPI.

3.8

4.12

4.4

Hybridization of local and global searches is suitable for

exploring and exploiting search space.

exploring search space.

exploiting search space.

None of the above.

https://docs.google.com/forms/d/e/1FAIpQLSfs7fWbZWHFecHad9Z6ArqqAnmhNKRCyzSy6e7x7EqcsinBEw/formResponse 10/12
6/24/2021 BUET CSE MSc Admission Test, April 2021 Part 3 of 4

A well-defined problem in AI has five components: initial state, a description of

the possible actions available, transition model, the goal test and path cost. The
most important component with respect to problem formulation is

initial state.

path cost.

Goal test.

None of the above.

Two concurrent processes, A and B, each need same three records, R1, R2, and
R3 in a database. If A asks for them in the order R2, R3, R1, then which of the
following order for B, is deadlock free?

R1, R3, R2

R3, R1, R2

R2, R1, R3

R3, R2, R1

https://docs.google.com/forms/d/e/1FAIpQLSfs7fWbZWHFecHad9Z6ArqqAnmhNKRCyzSy6e7x7EqcsinBEw/formResponse 11/12
6/24/2021 BUET CSE MSc Admission Test, April 2021 Part 3 of 4

Consider the following truth table for a 4-input priority encoder. What is the
priority order of the inputs?

1, 0, 3, 2

1, 2, 3, 4

4, 3, 2, 1

1, 2, 4, 3

Page 2 of 2

Back Submit

Never submit passwords through Google Forms.

This form was created inside of Department of Computer Science and Engineering, BUET. Report Abuse

 Forms

https://docs.google.com/forms/d/e/1FAIpQLSfs7fWbZWHFecHad9Z6ArqqAnmhNKRCyzSy6e7x7EqcsinBEw/formResponse 12/12