TUTORIAL IT

UNIVERSITY OF CALABAR
DEPARTMENT OF MATHS/STATISTICS & COMPUTER SCIENCE
COURSE: CSC 1101 – INTRODUCTION TO COMPUTER SCIENCE
DATE: Tuesday, 24th July, 2007

INSTRUCTIONS: ANSWER ANY FOUR (4) QUESTIONS

1. (a) The decision symbol is the only symbol of a flowchart with two exit points. What are these exit points? Illustrate with an example.
(b) The history of computer cannot be complete without Charles Babbage. Justify this statement.
(c) The stored program concept of John Von Neumann is very famous. What is it all about?


2. (a) I. Using appropriate examples, differentiate between one’s (1’s) complement and two’s (2’s) complement? Also, differentiate between LSB abd MSB in binary arithmetic, using an example to support your answer.
(b) I. Clearly differentiate between a microcomputer and an embedded computer.
II. Give an area of importance each of the hexadecimal and binary number systems respectively in computer technology.
(c) What is a microprocessor? Why is it very important when discussing generations of computer development?


3. (a) Describe the components of the central processing unit (control unit and ALU). Give four examples of Input devices and two examples of output devices as part of computer hardware.
(b) What is an operating system? Give two examples of a single-user operating system, and one example of a multi-user operating system.


4. (a) What makes computers different from other devices? Give three examples of devices with embedded computers.
(b) Add 11001011 to 10111011and convert your answer to one’s (1’s) complement.
(c) With the use of one example each, differentiate between a command and a statement in BASIC.


5. (a) Explain with examples the following BASIC terms:
I. Variables
II. Reserved words.
III. Identifier.
(b) Write a Basic program to add four numbers, A, B, C, D and display the result.


6. (a) Describe three basic types of translators that you know?
(b) Discuss with examples a categorization of computers according to their modes of operation.

UNIVERSITY OF CALABAR
DEPARTMENT OF MATHS/STATISTICS & COMPUTER SCIENCE
CSC 1101 – Introduction to Computer Science 2006/2007 Session
Instructions: Answer all questions Continuous Assessment 2 Time: 30 Mins

1. a. Justify why Charles Babbage is known as the father of modern computer.
b. Despite the cheapness of computer packages, most organizations still prefer customized software.

2. a. What major defects of the first generation computers gave rise to the second generation computers?
b. Mention the two persons who developed ENIAC and the place of development.

3. What are registers, as used in the ALU?

4. a. Why is the Binary number system so important in Computer Science?
b. What two major differences separate Auxiliary memory from Main memory?

UNIVERSITY OF CALABAR
DEPARTMENT OF MATHS/STATS. AND COMPUTER SCIENCE
2NDSEMESTER EXAMINATION 2011/2012 CSC1102: INTRO. TO COMPUTER SC. II
INSTRUCTION: ANSWER ANY FOUR QUESTIONS ATLEAST ONE FROM EACH SECTION
TIME:2HOURS


1a. In a class of M students, each student offers N courses. If M=20 and N=5 write a flowchart and a computer program in Basic programming language that will accept the following input data: (i) name of a student. (ii) Matric number of a student. (ii) scores for the N courses. Compute each student average score, and each student is given a pass status if his/her average score is greater than or equal to 50 otherwise the student is given a fail status. Output your result to the screen of the monitor.

1b. Comment briefly on any two control structures you have employed in your computer program in question 1a above.

1c. With the aid of a simple illustration differentiate between counted loop and conditional loop.


2a. Decline the term branching and comment briefly on any two types of branching known to you.

2b. Comment briefly on the various stages of program development known to you.

2ci. Define an array and comment briefly on its major properties.
2cii. Write an interactive basic program that will allow you to generate the elements of a two dimensional array of any data type known to you.


SECTION B

3a. Explain what you understand by the efficiency of algorithm
3b. What makes it necessary to study algorithm as a computer scientist?
3c. What makes an algorithm Z more efficient than another algorithm Y


4a. Consider two computers A and B. Computer A is faster and runs in insertion sort against a slower computer B running merge sort. They each must sort an array of two million JAMB candidates using their registration numbers. Suppose that computer A execute one and a half billion instruction per a second and computer B executes only fifteen million instruction per second. Suppose also that the insertion sort was coded by the best programmer ever, and the merge sort by an amateur programmer. If the code for insertion sort takes 2n2 instructions to sort n numbers and that of takes 65 n log n.

(a). Compute the time it will take computer A to sort the array.
(b). Compute the time it will take for computer B to sort the same array.
(c). Describe the speed of one over the other.
(d). Using the answers in (a) and (b), describe which of the two computers is more efficient, based on the algorithm they run.


SECTION C

5. (a) Give the steps involved in the insertion sort algorithm. Given the elements of the array j: using insertion sort, arrange the following items of the array with the iterator positioned at index 1. 61 48 34 82 48 57 89 45 70
(b). Describe the Bubble sort and Mergesort algorithms giving their worst case computational complexity. Give the general strategy for moving n disks from origin to destination in the Towers of Hanoi game.