Computer Applications Exam - Computer Systems, Cork Institute of Technology, Summer 2005, Exams of Computer System Design and Architecture

A computer science exam from the cork institute of technology, focusing on computer systems and number conversions, calculations, and the von-neumann organization of a computer. It includes questions related to binary and hexadecimal number conversions, binary calculations, 2's complement signed binary numbers, and the von-neumann architecture. Students are required to answer questions with no calculators and to show their workings.

Typology: Exams

2012/2013

Uploaded on 03/28/2013

bips
bips 🇮🇳

4.8

(5)

72 documents

1 / 3

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)
Summer 2005
Computer Systems
(Time: 3 Hours)
Answer any four questions
NO CALCULATORS ALLOWED
SHOW ALL WORKINGS Examiners: Mr. D. Simpson
Dr. D. Chambers
Mr. P. O’Connor
Mr. E. A. Parslow
Q1) (a) Perform the following number conversions:-
i) 254 decimal to binary.
ii) 254 decimal to hexadecimal.
iii) 1101011 binary to decimal.
iv) F2AC hexadecimal to binary. (8 marks)
(b) Perform the following calculations:- (assume unsigned binary numbers)
(i) 10101011 + 00011011
(ii) 10101011 00011011 (4 marks)
(c) For the following assume 8 bit 2’s complement signed binary numbers:-
(i) What is the largest positive number and largest negative number it
is possible to represent? Is 0 positive or negative?
(ii) Using 2’s complement, perform 43 – 100 and check your answer
by converting the result back to decimal. (13 marks)
pf3

Partial preview of the text

Download Computer Applications Exam - Computer Systems, Cork Institute of Technology, Summer 2005 and more Exams Computer System Design and Architecture 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)

Summer 2005

Computer Systems

(Time: 3 Hours)

Answer any four questionsNO CALCULATORS ALLOWED SHOW ALL WORKINGS Examiners: Mr. D. Simpson Dr. D. Chambers Mr. P. O’Connor Mr. E. A. Parslow

Q1) (a) Perform the following number conversions:- i) 254 decimal to binary. ii) 254 decimal to hexadecimal. iii) 1101011 binary to decimal. iv) F2AC hexadecimal to binary. (8 marks)

(b) Perform the following calculations:- (assume unsigned binary numbers) (i) 10101011 + 00011011 (ii) 10101011 – 00011011 (4 marks)

(c) For the following assume 8 bit 2’s complement signed binary numbers:- (i) What is the largest positive number and largest negative number it is possible to represent? Is 0 positive or negative? (ii) Using 2’s complement, perform 43 – 100 and check your answer by converting the result back to decimal. (13 marks)

Q2) With the aid of a diagram explain the Von-Neumann organization of a computer and the properties of its main constituent parts. What are the main strengths and weaknesses of the organization? (25 marks)

Q3) Referring to the attached assembly language programme for the 68000 microprocessor answer the following:- (a) What is symbolic addressing? Give two examples from the listing. (6 marks) (b) What are pseudo codes? Give two examples from the listing explaining their function. (6 marks) (c) Explain the addressing modes on lines 19 and 25. (6 marks) (d) Explain and correct the two errors detected. (7 marks)

Q4) Explain in detail the Fetch/Execute cycle and what happens when an instruction reads or writes data to memory. (25 marks)

Q5) Write technical notes on any two of the following. All sections carry equal marks. (a) The AND gate, NOR gate and D-type flip flop. (b) The programming model of the 68000 microprocessor. Explain the function of each register. (c) Any person from the History of Computing. (d) Von-Neumann bottleneck and its alleviation by the use of cache memory. (25 marks)

Q6. Using a logic equation, simplified via a Karnaugh Map, design a logic circuit to solve the following problem:- A car engine safety system is to prevent the engine from being started unless the drivers door is closed, the seat belt properly fastened and the motor-fault alarm is not set and the Mechanic’s Override switch is not set. A mechanic has an over-ride switch that if set enables them to start the engine no matter what the state of the door, or the seat-belt, but the motor-fault alarm must not be set. (25 marks)