1

CSC 111 - Introductory Computer Science I (2 Credit Units– Core Course) Course Duration: Two hours per week for 15weeks (30 hours), as taught in 2010/2011 session Lecturer: Mabayoje, Modinat Abolore M.Sc. Computer Science (Ilorin), B.Sc. Computer Science (Ilorin), MCPN, MIAENG, MSAN. Department of Computer Science, Faculty of Communication & Information Sciences, University of Ilorin, llorin, Nigeria. E-mail: mabayoje.ma@unilorin.edu.ng, mmabayoje@yahoo.com Office Location: Block 10 Room F9 Faculty of Communication & Information Sciences, University of Ilorin, llorin, Nigeria. Consultation Hours: 12noon – 2pm (Mondays & Wednesdays) Course Content: To achieve the objectives of this course enumerated below, the lecture shall effectively teach related topics as Historical Development of Computer Systems (Analogue and Digital Computers), Basic Components of a Computer (e.g. the control Unit, ALU, Memory, I/O Systems, the system Bus) among others. This course will as well explore Number System (e.g. Binary, Octal, Hexadecimal, etc.), Boolean Algebra, karnaugh Map, Basic Logic, Gate and some simple Combinatorial Logic Circuits. Algorithm, Pseudocode and sample Programs written in different languages will be discussed as well. Course Description: This course gives students the basic knowledge of Computer Science as a course of study. It covers both theoretical and practical aspects of engineering, electronics, information theory, mathematics, logic and human behaviour. It will explore various issues of computer science and designs as well as operations and uses of computer in information processing. Justification This course prepares students as Computer Scientists. It gives them better understanding, ranging from Programming and Computer Architecture to Artificial Intelligence. It basically develops students as potential computer scientists that have understanding of various issues relating to computer designs, as well as computer uses and operation in related fields of knowledge and endeavors. Course Objectives At the end of this course students will be able to:

(i) understand Historical Development of Computer Systems. (ii) acquire knowledge concerning contributions of previous as well as contemporary

scientists to computer science. (iii) get acquaintance regarding immediate future of computer development. (iv) demonstrate an understanding in the advantages and characteristics of Computer (v) identify different computer Software and Hardware (internal and external) components

in relation to their functions.

2

(vi) explain Boolean algebra, Logic Gates and form various logic circuits. (vii) develop an Algorithm for solving some problems within their environments. (viii) design the program using diagrammatical representation(Flowchart). (ix) write simple programs on their own to solve problems. (x) perform various calculations in number systems.(such as in binary, octal, duodecimal,

hexadecimal etc.

Course Requirements Every student is mandated to attend the lectures and participate actively in class and group discussions, as well as in study group activities. All students will have to sign up for an e-mail account and be ready to research on the Internet for information on Introductory Computer Science I. Methods of Grading No Types of Grading Score (%) 1. Continuous Assignment(s) 10 2. Attendance, Class participation& discussions 10 3. On-line discussion 10 4. Comprehensive final examination 70 Total Score 100 Course Delivery Strategies and Practice Schedule The course strategy will be the traditional face to face teaching (Classroom Lectures) and group discussions/presentations. Students will be made to undergo weekly practices in form of ‘outside-the-lecture assignments’. Softcopy of such practices must be submitted by students for assessments before next contact. There will be provision for on-line discussion as well. LECTURE CONTENT Week 1: Historical Development of Computer Systems Objectives An indebt discussion on the history of Computer will be done. This will, among others include Characteristics of Computer, Advantages of Computer to the Society, Classification of Computers (i.e. according to Size, Purpose, Types, Technology.). Description First Hour (week 1) Historical Background of Computer Second Hour (week 1) Characteristics, Advantages and Classification of Computers Study Questions 1. What is a Computer? 2. Describe the timeline of Computer development up till present level. 3. What is the impact of Computer to human activities/society? 4. Mention at least three attributes of a computer scientist? 5. Give at least 5 examples of input and output devices? 6. What is an Operating System (OS)? State at least five functions of an OS?

3

7. What are the characteristics of computers 8. List and explain three main types of computers 9. Give three examples of digital devices

Reading List 1. French1,2 C.S. (2001). Introduction to Computer Science. London: Continuum. pp 5-

100.

2. Meyers3, Jeremy, A Short History of the Computer [Online] Available http://www.softlord.com/comp/

3. Thomas 1A. Stewart(1994), The information Age in Charts( pp10-100). Fortune. 4. Eyitayo1,2 A.O.(1999). Computer Studies for Beginners I (pp. 13-66). bounty Press

limited, Ibadan. 5. Donald 1,2Spencer, Webster’s New World Dictionary of Computer Terms.( 4th ed)

New York: Prentice Hall,1992. 6. Stephen1 Manes, The Life of a Computer User: One Frustration After Another San

lose Mercury News, November 24, 1996. p. 67, reprinted from New York Times. 7. Ralph 1M. Stair(2003). Computers in Today’s World (pp 251-333). McGraw-Hill

Company. London.. 8. Donald1,2 Spencer, 1976. Computer Science Mathematic (pp.6-45).A bell & Howell

Company , Ohio.. 9. Briam1 K. Wiliams(1999). Using Information Technology (pp.100-156).

Irwin/McGraw-Hill Company. London. 10. Bernstein1 J.(1963). The analytical Engine.Random .House, New York.

A popular introduction to computers, and discussion of the work of Babbage. Week 2: Basic Components of Computer. Objectives This particular class will discuss major parts of computers. Each unit of computer will be identified and their functions will be discussed. With the aid of diagrams, the class will discuss the relationship amongst identified computer components. Description First Hour (week 2) Diagrammatical Representation of Computer Second Hour (week 2) Identification of Components of computer and their full function Study Questions 1. Mention at least 5 Basic Elements that make up a computer system. 2. What is Data and Information? 3. What is a program? 4. Draw a typical computer system. 5. What is a register and mention its type? 6. List at least 5 examples of storage devices. 7. What are secondary or auxiliary memories? 8. What are the differences between main memory and secondary memory Reading List

4

1. Edward2,3 Separr, A General Outlook of Computer Components. Available in Microsoft Encarta 2008.(Software)

2. French1,2 C.S. (2001). Introduction to Computer Science. London: Continuum. pp 5-

100.

3. Meyers3, Jeremy, "A Short History of the Computer" [Online] Available http://www.softlord.com/comp/

4. Donald1,2 Spencer(1992) Webster’s New World Dictionary of Computer Terms, (4th ed).New York: Prentice Hall.

5. Stephen1 Manes, “The Life of a Computer User: One Frustration After Another,” San lose Mercury News, November 24, 1996. p. 67, reprinted from New York Times.

6. Briam1 K. Wiliams(1999). Using Information Technology (pp.100-156.) Irwin/McGraw-Hill Company. London.

7. Eyitayo1,2 A.O.(1999). Computer Studies for Beginners I (pp. 13-66).bounty Press limited, Ibadan..

8. Ralph1 M. Stair(2003). Computers in Today’s World (pp 251-333). McGraw-Hill Company. London.

Week 3: Algorithm Objectives This class will discuss Algorithm in detail. This will assist students on how to develop a set of rules that can be followed in solving any kind of problem. Description First Hour (week 3) Algorithm Second Hour (week 3) Some examples on how to develop a set of rules that can be followed in solving any kind of problem. Study Questions Write an algorithm for each of the following problems: 1. Average of three numbers. 2. To convert the distance between two points in meter to kilometer 3. Find the largest of three(3) positive numbers 4. Calculate the area of a rectangle 5. Based on your knowledge regarding this topic, write an algorithm to convert number in base 2 to base eight. Reading List 1. Shackelfold1 L. Russell, "Introduction to Computing and Algorithm” Wesley, June 4, 1998. pp. 2-25. 2. French1,2 C.S. (2001). Introduction to Computer Science. London: Continuum. pp 5-100.

3. Briam1 K. Wiliams(1999). “Using Information Technology” Irwin/McGraw-Hill Company. London.pp.100-156. 4.Eyitayo 1,2A.O.(1999). “Computer Studies for Beginners I” bounty Press limited, Ibadan. Pp. 13-66. 5. Ralph1 M. Stair(2003).” Computers in Today’s World” McGraw-Hill Company. London. pp 251-333.

5

6. Louia1 E.F. 1999. “Crash Course in PC and Microcontroller Technology”. Butterworth-heinemann, USA. Pp 45-132. Week 4: Flowchart Objectives The diagrammatical representation of algorithm will be discussed and some of functions of special symbols under flowchart will be identified. Description First Hour (week 4) Diagrammatical representation of algorithm(Flowchart) Second Hour (week 4) Functions of special symbols under flowchart Study Questions What is Flowchart representation of the following problems? 1. Average of three numbers. 2. Conversion of the distance between two points in meter to kilometer 3. Find the largest of three(3) positive numbers 4. Calculate the area of a rectangle 5. Identify six (6) symbols of flowchart with their functions.

Reading List 1. Shackelfold1 L. Russell, "Introduction to Computing and Algorithm” Wesley, June 4, 1998. pp. 2-25. 2. French1,2 C.S. (2001). Introduction to Computer Science. London: Continuum. pp 5-100.

3. Donald1 Spencer, (1992). Webster’s New World Dictionary of Computer Terms, 4th ed. New York: Prentice Hall. 4. Donald1 Spencer, (1976). “Computer Science Mathematic” A bell & Howell Company, Ohio.pp.6-45. 5. Eyitayo1,2 A.O. (1999). “Computer Studies for Beginners 1” Bounty Press Limited, Ibadan. Pp. 13-66. Week 5: Pseudo code Objectives This particular class will take students through a number of English-like structure examples of Algorithm. This class will teach students procedures involved in the designing of computer codes among others. Description First Hour (week 5) Pseudo code and the difference between an algorithm and Pseudo code? Second Hour (week 5) Number of examples to illustration pseudo code. Study Questions Design a pseudo code for the following: 1. Calculate the sum of the first 100 positive integers. 2. Calculate the average of three numbers. 3. Conversion of the distance between two points in meter to kilometer 4. Find the largest of three(3) positive numbers

6

5. Calculate the area of a rectangle 6. Write a pseudo code for calculation of the average of 20 numbers. Reading List 1. Shackelfold1 L. Russell, "Introduction to Computing and Algorithm” Wesley, June 4, 1998. pp. 2-25. 2. French1,2 C.S. (2001). Introduction to Computer Science. London: Continuum. pp 5-100.

3. Briam1 K. Wiliams(1999). “Using Information Technology” Irwin/McGraw-Hill Company. London.pp.100-156. 4.Eyitayo 1,2A.O.(1999). “Computer Studies for Beginners I” bounty Press limited, Ibadan. Pp. 13-66. 5. Ralph1 M. Stair(2003).” Computers in Today’s World” McGraw-Hill Company. London. pp 251-333.

Week 6: Number System Objectives To focus majorly on the introductory aspect of methods of counting (Number System). Actual computer machine language will be emphasized. Description: First Hour (week 6) Number System, Type of Number system. Second Hour (week 6) Number System conversion Study Questions 1. What do you understand by ‘Number System’ 2. Mention at least five examples of Number System. 3. What do you understand by ‘Balanced Ternary System’ 4. Give 2 examples of Quarter-Imaginary System 5. What is a bit? 6. What does the acronyms BCD and ASCII stand for? 7. Convert 225 in base 6 to base 3 Reading List 1. French1,2 C.S. (2001). Introduction to Computer Science. London: Continuum. pp 5-100.

2. Meyers3, Jeremy, "A Short History of the Computer" [Online] Available http://www.softlord.com/comp/ 3. Thomas 1A. Stewart, “The information Age in Charts,” Fortune, April 4, 1994, pp10-100. 4. Eyitayo1,2 A.O.(1999). “Computer Studies for Beginners I” bounty Press limited, Ibadan. Pp. 13-66. 5. Donald 1,2Spencer, Webster’s New World Dictionary of Computer Terms, 4th ed.(New York: Prentice Hall,1992). Week 7: Number System Conversion Objectives To discuss in details some calculations under number system. Examples of conversion of other number system to decimal, Decimal system to other numbers, Binary to Octal, Hex to Binary etc will be given and discussed.

7

Description First Hour (week 7) Conversion of other number system to decimal, Decimal system to other numbers Second Hour (week 7) Number System conversion of Binary to Octal, Hex to Binary Study Questions 1. Write an algorithm to convert from any base to base 10 2. Write a program with any programming language to convert from 10 to any base. 3. Give the result of the following operation in

(1) Binary (2) Octal (3) Decimal and (4) hexadecimal. 4. Add 11101 and 10110 5. Subtract 101 from 111 6. Write the product of 11101 and 10110 7. Divide 111 by 11 8. Give two compliment of 10111 and 10110 9. Convert the numbers in various base to base 10:

i. 11011 in base 2 ii. 243 in base 6 iii. 1012B base 16

Reading List 1. Eyitayo 1,2A.O.(1999). “Computer Studies for Beginners I” bounty Press limited, Ibadan. Pp. 13-66. 2. French1,2 C.S. (2001). Introduction to Computer Science. London: Continuum. pp 5-100.

3. Donald1 Spencer, 1976. “Computer Science Mathematic” A bell & Howell Company , Ohio.pp.6-45. 4. Ralph1 M. Stair(2003).” Computers in Today’s World” McGraw-Hill Company. London. pp 251-333. 5. Fleck1 G.(1973), “ A computer Perspectives.” Harvard Univ. Press, Cambridge, Massachusetts. Week 8: Boolean algebra Objectives The objectives are to introduce the students to algebra as being concerned with binary combinations Fundamental importance of Boolean Algebra to circuit design, function and other operation of computers will be adequately stated and explained to students. Description First Hour (week 8) Algebra Second Hour (week 8) Fundamental importance of Boolean algebra to circuit design, functions and other operation of computers Study Questions 1. What do you understand by Boolean algebra?

8

2. Discuss three (3) basic importance of Boolean Algebra to circuit design. Reading List 1. Edward2,3 Separr, ‘A General Outlook of Computer Components’. Available in Microsoft Encarta 2008.(Software) 2. French1,2 C.S. (2001). Introduction to Computer Science. London: Continuum. pp 5-100.

3. Briam1 K. Wiliams(1999). “Using Information Technology” Irwin/McGraw-Hill Company. London.pp.100-156. 4. Eyitayo1,2 A.O.(1999). “Computer Studies for Beginners I” bounty Press limited, Ibadan. Pp. 13-66. 5. Ralph1 M. Stair(2003).” Computers in Today’s World” McGraw-Hill Company. London. pp 251-333. Week 9: Karnuagh Objectives Under this topic discussion on Karnaugh map as providing a simple and straight-forward method of minimizing Boolean Expressions will be done. This class will explain a pictorial method of grouping expressions with common factors together; and therefore eliminating unwanted variables. Description First Hour (week 9) Discussion on Karnaugh map Second Hour (week 9) Method of minimizing Boolean Expressions and some examples Study Questions 1. In clear terms explain what you understand by “Karnaugh map” 2. State the advantage of karnaugh map over Boolean algebra 3. Draws 3, 4, or 5 variable Karnaugh Map 4. Minimize the following problems using the Karnaugh maps method. (a) Z = f(A,B,C) = + B + AB + AC (b) Z = f(A,B,C) = B + B + BC + A 5. Minimize the following problems using the Karnaugh maps method. (a) J= f(A,B,C) = A + + B + AB + AC (b) J= f(A,B,C) = B + B + BC + A Reading List 1. Eyitayo 1,2A.O.(1999). “Computer Studies for Beginners I” bounty Press limited, Ibadan pp. 13-66. 2. Donald1 Spencer, 1976. “Computer Science Mathematic” A bell & Howell Company , Ohio.pp.6-45. 3. Chalk 1B.S. (1996) “Computer Organization and Architecture ”Palgrave Houndmills, New York. 4. Edward2,3 Separr, ‘A General Outlook of Computer Components’. Available in Microsoft Encarta 2008.(Software) 5. French1,2 C.S. (2001). Introduction to Computer Science. London: Continuum. pp 5-100.

Week 10: Basic Logic

9

Objectives This class will in detail teach students Logic, the three basic logic states, functions and logic gate (AND, OR, and NOT). Description First Hour (week 10) Logic, basic logic states and functions. Second Hour (week 10) Truth table and importance of logic elements to computers Study Questions 1. What is logic? 2. Draw the truth table for AND, OR and NOT gates 3. What is the importance of logic elements to computers? 4. What are the major components of the CPU, and what is their relationship? 5. What are the differences between an ‘AND’, ‘OR’, and ‘NOT’ gates? Explain with truth table Reading List 1. Eyitayo 1,2A.O.(1999). “Computer Studies for Beginners I” bounty Press limited, Ibadan pp. 13-66. 2. Donald1 Spencer, 1976. “Computer Science Mathematic” A bell & Howell Company , Ohio.pp.6-45. 3. Chalk 1B.S. (1996) “Computer Organization and Architecture ”Palgrave Houndmills, New York. 4. Edward2,3 Separr, ‘A General Outlook of Computer Components’. Available in Microsoft Encarta 2008.(Software) 5. French1,2,4 C.S. (2001). Introduction to Computer Science. London: Continuum. pp 5-100.

Week 11: Computer Software Objectives This class will discuss the general aspects of Computer Software. The importance of computer software to the operation and manipulation of computer will be fully taught. Description First Hour (week 11) Computer Software, Types of Computer Software and their importance. Second Hour (week 11) Operating Systems, Translators and Utilities. Study Questions 1. Distinguish between system software and application software 2. List 5 examples of operating systems 3. List 5 examples of application programs 4. A computer without software is like a car without an engine. Do you agree with this

statement? 5. What is the importance of systems software to application software?

Reading List 1. Colin1 Ritchie(2003). “Operating Systems” TJ International, Cornwall, pp-5-120. 2. French1,2,4 C.S. (2001). Introduction to Computer Science. London: Continuum. pp 5-100.

10

3. Donald1,2 Spencer, Webster’s New World Dictionary of Computer Terms, 4th ed.(New York: Prentice Hall,1992). 4. Chalk1,2 B.S. (1996) “Com puter Organization and Architecture”Palgrave Houndmills, New York. 5. Eyitayo1,2 A.O.(1999). “Computer Studies for Beginners I” bounty Press limited, Ibadan. Pp. 13-66. 6. Louia1 E.F. 1999. “Crash Course in PC and Microcontroller Technology”. Butterworth-heinemann, USA. Pp 45-132. Week 12 and 13: Programming Languages Objectives During this contact, students will be introduced to computer programming languages. General ideas of various types of programming languages will be discussed. The Characteristics of Various levels of programming languages (Machine language, assembly language and high level languages) will be taught. This class will further put students through steps on how to write some sample programs in BASIC so that students would have an introductory experience in real computer programming. Description First Hour (week 12) Introduction to computer programming languages, types of programming languages Second Hour (week 12) How to write some sample programs in BASIC First Hour (week 13) Types of programming languages, the Characteristics of Various levels of programming languages Second Hour (week 13) More examples of programs in BASIC language, different between a compiler and an interpreter Study Questions 1. What language does a computer understand? 2. What is an assembler? 3. What is a high level language? 4. What is a translator? 5. Distinguish between a compiler and an interpreter 6. List 4 examples of programming languages 7. What are the essential features that distinguishing each generation of programming languages from the others? Reading List 1. Colin1 Ritchie(2003). “Operating Systems” TJ International, Cornwall, pp-5-120. 2. French1,2 C.S. (2001). Introduction to Computer Science. London: Continuum. pp 5-100.

3. Donald1,2 Spencer, Webster’s New World Dictionary of Computer Terms, 4th ed.(New York: Prentice Hall,1992). 4. Chalk1,2 B.S. (1996) “Com puter Organization and Architecture”Palgrave Houndmills, New York.

11

5. Eyitayo1,2 A.O.(1999). “Computer Studies for Beginners I” bounty Press limited, Ibadan. Pp. 13-66. 6. Louia1 E.F. 1999. “Crash Course in PC and Microcontroller Technology”. Butterworth-heinemann, USA. Pp 45-132. Week 14 and 15: Revision These weeks are meant for revision of topics and sub topics that have been discussed in the last thirteen weeks. Study questions that cover the whole course will be provided to students in order to know the level of their understanding of this course. Students are expected to ask any related questions to the course Revision Questions 1. What is a Computer? 2. Give at least 5 examples of input and output devices? 3. What is an Operating System (OS)? State at least five functions of an OS? 4. What are the characteristics of computers 5. List and explain three main types of computers 6. Mention at least 5 Basic Elements that make up a computer system. 7. What is Data and Information? 8. What is a program? 9. Draw a typical computer system. 10. What is a register and mention its type? 11. What are secondary or auxiliary memories? 12. Identify six (6) symbols of flowchart with their functions. 13. Calculate the sum of the first 100 positive integers. 14. Write a pseudo code for calculation of the average of 20 numbers. 15. What do you understand by ‘Number System’ 16. Mention at least five examples of Number System. 17. What do you understand by ‘Balanced Ternary System’ 18. What is a bit? 19. What does the acronyms BCD and ASCII stand for? 20. Convert 225 in base 7 to base 3 21. Give two compliments of 10111 and 10110 22. Convert the numbers in various base to base 10: iv. 11011 in base 2 v. 243 in base 6 vi. 1012B base 16 23. Minimize the following problems using the Karnaugh maps method. (a) Z = f(A,B,C) = + B + AB + AC (b) Z = f(A,B,C) = B + B + BC + A 24. Minimize the following problems using the Karnaugh maps method. (a) J= f(A,B,C) = A + + B + AB + AC (b) J= f(A,B,C) = B + B + BC + A 25. Distinguish between a compiler and an interpreter General Reading List 1. French1,2 C.S. (2001). Introduction to Computer Science. London: Continuum. pp 5-100.

2. Meyers3, Jeremy, "A Short History of the Computer" [Online] Available http://www.softlord.com/comp/

12

3. Eyitayo1,2 A.O.(1999). “Computer Studies for Beginners I” bounty Press limited, Ibadan. Pp. 13-66. LEGEND 1: Available in the University Library. 2: Available in local bookshops. 3. Available on the Web. 4: Available in the Departmental Library.