Karnaugh Map - Computer Architecture - Past Exam, Exams of Computer Architecture and Organization

Main points of this past exam are: Computer Architecture, Computer Applications, Technology, Boolean Algebra Expression, Karnaugh Map, Logic Circuit, Develop, Input Gates, Assembly Language Programme, Microprocessor

Typology: Exams

2012/2013

Uploaded on 03/27/2013

kaale
kaale ๐Ÿ‡ฎ๐Ÿ‡ณ

4.4

(7)

29 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Cork Institute of Technology
Bachelor of Science (Honours) in Computer Applications โ€“ Stage 1
(Bachelor of Science in Computer Applications โ€“ Stage 1)
(NFQ โ€“ Level 8)
Autumn 2005
Computer Architecture
(Time: 3 Hours)
Instructions
Answer any FOUR questions.
NO CALCULATORS ALLOWED.
Examiners: Mr. D. Simpson
Mr. E. A. Parslow
Mr. P. O Connor
Dr. D. Chambers
Q1). Given the truth table below
Find a reduced Boolean algebra expression using a Karnaugh map. (15 marks)
Simplify the expression using Boolean algebra and develop a logic circuit
using only four 2 input gates. (10 marks)
Q2) Referring to the attached assembly language programme listing for the 68000
microprocessor, answer the following:-
(a) Explain what is happening on lines 10 and 34. (6 marks)
(b) In general what is the term used for codes such as Equ and Org on lines 9 and 12 etc.?
What is the general purpose of such codes? (6marks)
(c) Explain the addressing modes on lines 17 and 27. (7 marks)
(d) Will this programme run? If not why not and provide corrections. (6marks)
Q3) (a) Perform the following number conversions:-
pf2

Partial preview of the text

Download Karnaugh Map - Computer Architecture - Past Exam and more Exams Computer Architecture and Organization in PDF only on Docsity!

Cork Institute of Technology

Bachelor of Science (Honours) in Computer Applications โ€“ Stage 1

(Bachelor of Science in Computer Applications โ€“ Stage 1)

(NFQ โ€“ Level 8)

Autumn 2005

Computer Architecture

(Time: 3 Hours)

Instructions Answer any FOUR questions. NO CALCULATORS ALLOWED.

Examiners: Mr. D. Simpson Mr. E. A. Parslow Mr. P. O Connor Dr. D. Chambers

Q1). Given the truth table below

Find a reduced Boolean algebra expression using a Karnaugh map. (15 marks) Simplify the expression using Boolean algebra and develop a logic circuit using only four 2 input gates. (10 marks)

Q2) Referring to the attached assembly language programme listing for the 68000 microprocessor, answer the following:- (a) Explain what is happening on lines 10 and 34. (6 marks) (b) In general what is the term used for codes such as Equ and Org on lines 9 and 12 etc.? What is the general purpose of such codes? (6marks) (c) Explain the addressing modes on lines 17 and 27. (7 marks) (d) Will this programme run? If not why not and provide corrections. (6marks)

Q3) (a) Perform the following number conversions:-

139 decimal to binary. 139 decimal to hexadecimal. 10110001 to decimal D21F hexadecimal to binary (8 marks)

(b) Perform the following calculations using unsigned binary:- 10101011 + 11011 + 1 10101011 โ€“ 111011 (6 marks)

For the following assume 8 bit 2โ€™s complement signed binary numbers:- Where and what is the sign bit? Perform the calculation decimal (34 โ€“ 96) in binary 2โ€™s complement and check your answer by converting the result back to decimal. Why use 2โ€™s complement at all? (11 marks)

Q4) Write technical notes on any two of the following:- (All sections carry equal marks). Implementation and operation of a circuit for the full adder. With the aid of a diagram briefly explain the organization of the Von-Neumann organization of the computer and the properties of its main constituent sections. The fetch/execute cycle. Any person from the history of computing. (25 marks)

Q5) Show with a diagram the programming model of the 68000 microprocessor. (8 marks) What are the functions of each of the registers? (10 marks) How is the 68000 similar to/different from the standard Von-Neumann organization? (7 marks)

Q6) (a) What is the function of memory in a computer? (5 marks) (b) Show with the aid of a diagram, how memory might be implemented and addressed using flip-flops and logic gates. (10 marks) (c) Why can memory slow down a computer, what can be done to alleviate the problem? (10 marks)