University of Mumbai 2008-5th Sem B.E Electronics & Tele-Communication Engineering Computers s - Question Paper

"1 01

10 0'

1 10

010

⁰¹¹

0 01

(REVISED COURSE)

(3 Hours)

N.B.: (1) Question No. 1 is compulsory.    ...    .

(2)    Attempt any four questions out of remaining six questions.

(3)    Assume suitable data wherever required but justify them.

(4) Figures to the right indicate full marks.

1    idf Design a 8086 based microprocessor system with following specifications .- 12

⁸⁰⁸⁶ microprocessor working at 8 MHz.

OlfC32 KB of EPROM using 16 KB devices.    .

(tit) 64 KB of SRAM using 16 KB devices.

Exolain the design and show the memory map.

Explain with neat diagram the 16-bit memory interface (Odd and even 8-bit memory 8 X banks) of the 8086 microprocessor.

2    (a) Write a 8086 program that displays the binary powers of 2 (in decimal) on the 10

¹ \ video screen for the powers 0 through 7. Your display shows 2" = value for (b) Expand draw the internal structure of the 80 x 87 arithmetic coprocessor. 10

3    Explain and draw the control word format for the 8254 timer.

'    Explain the block diagram of 8255A and explain its BSR mode.

4    kff Explain in brief with one oxamplo-toe function of following instructions :

/    AS

so as

SCAS INTO FSQRT

ttlf eSplaJnvarfoLs data transfer modes supported by 8237 DMA controller.    10

5 (a) Write an Assembly Language Program (8086 program) to exchange the blocks 10 '    of 1 KB located at 0100 H and 0200 H, using string instructions,

(b) What do you mean by Bus arbitration ? When it is required 7 Explain different 10

types of arbitration scheme.

6. (ar' Explain Cascading of three 8259 A PICs using master slave configuration. 10

Differentiate between /    itf/Procedure and Macro - ' " ^T "

*    Minimum mode and maximum mode of 8086.

7 iafXiiscuss the control and status word format of Numeric coprocessor 8087. 10 bfWhat do you mean by multiprocessor system ? Explain the different multiprocessor 10

configurations supported by 8086 ?.

*********

Con. 5867-08.

(REVISED COURSE)

(3 Hours)    [Total Marks : 100

N.B. : (1) Question No. 1 is compulsory.

(2) Attempt any four questions from the remaining, questions.

1.    (a) Design the DFA for the language, contains strings in which leftmost 10 symbol differ from rightmost symbol. S is given { 0, 1 }.

Oaf What is Turing machine ? Explain different techniques for Turing 10 machine construction.

2.    (ajCompare and contrast Moore and Mealey machine. Design a Mealey 10 / machine to convert each occurrence of substring abb by aba. Z = { a, b }

(yf What is parsing ? What are the two different parsing methods ? 10 ' Explain their differences with examples.

3.    (a) Prove that it is undecidable whether a context free grammar is ambiguous.10 (b) Prove the variations and equivalence of the push down automata. 10

4.    Cstf State and prove pumping Lemma for context free languages.    10 tS Design a grammer for accepting an Even Palindrome over Z = { a, b }. 10

5.    (a) Design a Turing machine to Compute n !..     10

(b) Explain GNF with suitable example. 10

6. Write a program to translate a regular expression to finite automata. 10 Construct a NFA for the regular expression 01* + 1 and convert it 10 X to DFA.

7. Write a detail note on (any four) :

Post correspondence problem Halting problem Universal TM

(d) Myhill-Nerodes theorem Ambiguity resolution.

20

You are here: PAPER University of Mumbai 2008-5th Sem B.E Electronics & Tele-Communication Engineering Computers s - Question Paper

•  
• Top

• Skip to content