Get premium membership and access revision papers, questions with answers as well as video lessons.

Comp 110: Introduction To Computer Science December 2008 Question Paper

Comp 110: Introduction To Computer Science December 2008

Course:Bachelor Of Computer Science

Institution: Kabarak University question papers

Exam Year:2008

COURSE CODE: COMP 110
COURSE TITLE: INTRODUCTION TO COMPUTER SCIENCE
STREAM: Y1S1

INSTRUCTIONS:
1. Attempt question one and any other two questions.
2. Question one carries 30 marks and the rest 20 each.
QUESTION ONE (30 MARKS)
(a) Distinguish between the following
(i) A computer and a microcomputer (2 Mks)
(ii) Central processing unit (CPU) and a microprocessor (2 Mks)
(iii) Hard ware and soft ware as applied to computers (2 Mks)
(b) With help of a block diagram, show the five major
components of a computer . (2.5 Mks)
(c) (i) Broadly classify soft ware. (1.5 Mks)
(ii) Give at least two soft ware package used in each category of c (i). (3 Mks)
(iii) What do you understand by the term CODE? (1mk)
(iv) What is a bus? Name three types of buses used in computers
and their application (1 mk)
(d) (i) Distinguish between a binary number and a binary-coded decimal number (2 Mks)
(ii) Express the decimal number 99
(a) In BCD (1 mk)
(b) As a binary number (1 mk)
(e) (i) What do you understand by the term digital? (1 mk)
(ii) Mention the four number systems used in digital electronics. (1 mk)
(iii) How many nibbles and bytes are in the following binary numbers
(a) 010101010111 (1 mk)
(b) 000010010001 (1 mk)
(c) 1111 (1 mk)
(f) Suppose a three-variable truth table has output for these conditions 000, 010, 110
(i) Derive the sum-of- product equation. (2 Mks)
(ii) Simplify the Boolean equation and draw the corresponding logic circuit. (2 Mks)
QUESTION TWO (20 MARKS)
(a) (i) What is Boolean algebra? (2 Mks)
(ii) Using an appropriate simple electrical circuit, generate a truth table for
(a) AND gate
(b) OR gate
(c) NOT gate
Show the symbol of the gate in each case (9 Mks)
(i) State the following Boolean laws
(a) Commutative law (3 Mks)
(b) Associative law (3 Mks)
(c) Distributive law (3 Mks)
QUESTION THREE (20 MARKS)
A computer memory can store thousands of binary instructions and data. A typical
Microcomputer has 65,536 addresses, each storing a byte. Suppose that the first five
addresses contain these bytes:
0011 1100 (4 Mks)
1100 1101 (4 Mks)
0101 0111 (4 Mks)
1111 0001 (4 Mks)
0001 1111 (4 Mks)
Covert these bytes to their Hexadecimal, Decimal, Exess-3 and Gray-code equivalence.
QUESTION FOUR (20 MARKS)
(a) (i) Express 768 in 15’s and 16’s complement and show their representation in binary
coded form (4 Mks)
(b) (ii) Obtain the 7’s and 8’s complement of the following octal numbers 770, 1263.
Show their representation in binary coded form (6 Mks)
(b) The binary numbers listed below have a sign bit in the most left position. Negative
numbers are in their 2’s complement form. Perform the arithmetic operations
indicated and leave the results, if negative, in signed 2’s complement form. Verify
your results
(ii) 001110 - 110010 (2 Mks)
(iii) 010101 + 111000 (2 Mks)
(iv) 11110001 + 00001111 (2 Mks)
(c) Add the following binary numbers and prove your answer
(i) 11110 (ii) 00111
00110 00111
? ? (4) Mks
QUESTION FIVE (20 MARKS)
(a) (i) Name the four steps that are used in reducing Boolean expressions. (2 Mks)
(ii) Show the logic circuit for
Y = AB + AB
Then, simplify the Boolean equation and the corresponding logic circuit. (8 Mks )
(b) What is a half-adder? A full- adder? (4 Mks)
Draw their block diagrams and give their corresponding truth tables (6 Mks)

Comp 110: Introduction To Computer Science December 2008 Question Paper

More Question Papers

Popular Exams

Mid Term Exams

End Term 1 Exams

End Term 3 Exams

Opener Exams

Full Set Exams