Scribd
Upload
34 views4 pages

Scs1101 Course Outline

The document outlines the course SCS 1101: Introduction to Computer Science and Programming at the National University of Science and Technology, detailing its objectives, content, and assessment methods. Key topics include computer components, data representation, programming basics, algorithms, operating systems, and networking fundamentals. Students are expected to complete coursework and examinations, with specific requirements for attendance and academic integrity.

Uploaded by

tadiwamuneta30
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
34 views4 pages

Scs1101 Course Outline

The document outlines the course SCS 1101: Introduction to Computer Science and Programming at the National University of Science and Technology, detailing its objectives, content, and assessment methods. Key topics include computer components, data representation, programming basics, algorithms, operating systems, and networking fundamentals. Students are expected to complete coursework and examinations, with specific requirements for attendance and academic integrity.

Uploaded by

tadiwamuneta30
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

National University Of Science and Technology

Faculty of Applied Science


Department of Computer Science

Course Outline: SCS 1101

Course Name: Introduction to Computer science and programming

Re-Produced: Revised: 2023


Author: Mr.K.G.Mahute Contact Phone
0772857464
Contact email: [email protected]

Weighting Full Course


Hours/week Mondays 0800- 1700

Pre-requisite
Co-requisite

Synopsis :

Information Society, History of Computers: Data and Information, Number systems and
arithmetic, Data representation, Basic Computer Components:-CPU, I/O units, Storage;
Brief Concepts of Computer Languages and Programming Techniques: high/low level
languages, compiler, interpreter,grammar, recursion, simple data structures (arrays, lists,
trees, hash tables,queues & stacks), problem solving. Algorithms: Sorting, compression,
Numerical and encryption; Operating systems and its functions:- process and memory
management, I/O, Data Communication, Job Control; processing:-File structures,
organization and access, Databases; Fundamentals of Networks. A simple program,
initialization, printing, comments, keywords.

Description of the Course: This course discusses the fundamentals of computer


sciences and programming. Particular emphasis is placed on the understanding of how
computer systems represent data, relationships that exist within a computer system and
practical uses of computers in the society. Problem solving through use of programming
is also discussed in the course.
Course Objectives

By the end of the course students should be able to:


 Identify computer components and describe the environment for computerized
information production.
 Recommend a computational solution to a given problem
 Design a computer program to solve a given task
 Implement the designed program
 Explain the role computation can play in problem solving

Course Content

 Information Society
 Define knowledge society, information society (include examples)
 Define IT, ICT and Computer Science
 National ICT Policy (http://www.ictministry.gov.zw)

 History of Computers (Computer Generations)


 Computer generations
 Types of Computers
 Emerging Technologies

 Data Representation
 Bits, bytes
 Number systems: Binary, Decimal, Hexadecimal, Octal
 Number systems conversions

 Basic Computer Components:


 CPU
 I/O unit

 Brief Concepts of Computer Languages and Programming Techniques


 High/low level languages
 Compiler/ Interpreter
 Grammar: syntax and semantics
 Program design using flowcharts

 Programming basics
 Introduction to C programming
 Variables, Data types, Initialization, Comments, Keywords, Constants,
Assignment, Specifiers
 Programming constructs: sequence, branching, looping, recursion
 Arrays, functions and procedures
 Reading and writing into a file

 Problem solving Algorithms:


 Sorting
 Compression
 Numerical
 Encryption

 Operating System
 Functions
 Examples of operating systems

 Storage Systems
 Primary and secondary storage
 Databases – definition, advantages and disadvantages, examples of
DBMSs
 Cloud storage

 Fundamentals of Networks
 Wired and wireless networks
 Wired
o LAN and its components
o WAN and its components

Assessment

Course Work (25%) comprises:


 Written Assignments
 Tests
 Programming Assignments

Examination (75%)

NB:
 No student will be allowed into the Examination Hall without Coursework
 No plagiarism in assignments
 Students should attend at least 80% of all lectures
 Students with special requirements should consult with lecturers for any special
arrangements

Recommended Reading Lists


1. LAUDON, KC AND LAUDON J.P (9th Edition) Management Information
Systems: Managing the Digital firm, New Delhi: Prentice Hall, 2010
2. Curtin F. Tata, McGraw Hill (2008), McGraw Hill International Edn.
Information Technology: The Breaking Wave
3. Introduction to C, Kernighan and Ritchie
4. Problem Solving and Program Design in C (7th ed.) [Hanly & Koffman 2012-03-
04]

You might also like