Course Outline (ITC)
Course Outline (ITC)
Course Outline (ITC)
Page 1 of 9
Introduction to Computing
INTRODUCTION TO COMPUTING
SYLLABUS
Effective Date: 17th December, 2021
Total Credits 4 Credit(s) (Class + Lab)
Co-requisite (s) None
Pre-requisite(s) None
Weekly Classes Schedule 3 Classes, 60 Min Each
Wajiha Batool (MPhil Computer Science.)
Instructor
[email protected]
Page 2 of 9
Introduction to Computing
Course Description
This is an introductory course in computer science discipline, introducing computing
environments, general application software, basic computing hardware, operating systems,
software applications and tools and computer usage concepts. Furthermore, introducing
software engineering and information technology concepts, within the broader domain of
computing. This course would allow the students to acquire a broad understanding of
computer science discipline.
1- Objectives
The objective of the course is to present a complete picture of the dynamic computer science
field. The specific objectives of this course include:
Built an appreciation for the fundamental concept in computing.
Familiarize the students with basic computer terminologies and emerging
technologies.
Enables students to use software applications in use today.
Lay the foundation necessary for advance study-level in computer science.
By studying it students will learn how computing impacts on their daily life.
Introduce social and legal issues of computer science.
3- Course Structure
1. Presentation by lecturer
2. Group discussion
3. Problem questions
4. Lab assignments
5. Quiz
Page 3 of 9
Introduction to Computing
4- Course Duration
5- Course style
In addition to the objectives of this course, students are expected to gain skills which
would be needed in the professional work environment. These skills include but not
limited to: Writing, Presentation, Decision Making and Teamwork.
8- Course Outline
The lecturers are supposed to complete the following topics/sub-topics before the mid/final
term examination as prescribed in the course outline below:
Week Contents
Lectures
No.
What is computer?
What does a computer do?
Information process cycle.
1 Detail discussions on Input, process, output and
storage activities of computer.
What is Data and information
Week 1 Why we need data and information?
Classification of computers (super, mainframe, mini
and microcomputers)
2
Types of computer (digital, analog and hybrid
computer)
History of Computers
3
Computer evolution to their present form.
1 Computer generations
Features of each generation
– Hardware used
– Language used
Page 4 of 9
Introduction to Computing
Number systems, non-positional and positional number
Week 2 system, Conversion from one number system to
2 another number system.
Decimal, Binary, Octal and Hexadecimal number
system.
Shortcut method of conversion
Binary to octal
3 Octal to binary
Binary to hexadecimal
Hexadecimal to binary
Computer codes
BCD
1 EBCDIC
ASSCII
Gray Code
Week 3 Computer arithmetic’s
Basic arithmetic operations using binary numbers
Addition
2
Multiplication
Subtraction.
Addition.
Computer Software, System S/W, Application S/W
3
Detail discussions on Computer Software (sub types)
Essential Components of computer i.e. Input devices,
1
System Unit and Output Devices
Computer System Architectures
2
Week 4 Computer hardware.
Detail discussion on System unit (CPU, ROM, RAM,
3 Cache etc)
Various sub-systems/building blocks of Microprocessor
Boolean Algebra
1 Binary operations
Truth Table of logical expressions
Boolean Identities
Week 5
De-Morgan’s Law
2
Minimization of Boolean Function
Complement of a Function
Logic Gates
3
AND, NAND, OR, NOR, XOR, XNOR and NOT Gate
Designing of Logic circuits using logic Gates
1
Combinational Circuit
Simplification of Boolean Expression
Standard forms of Boolean Expressions
Week 6 2
Sum-of-Products form
Product-of-Sums form
Exclusive-OR Gate
3 Design of Half-Adder
Design of Full-Adder
What is information technology
1
Components of information technology
Week 7 Review
2
3 Review
Page 5 of 9
Introduction to Computing
Introduction to designing techniques (Algorithms)
– Greedy Algorithm
1 – Deterministic Algorithm
– Randomized Algorithm
– The Brute Force strategy
Week 9
Building Blocks of an Algorithm and Flowcharts
2
designing (some more examples)
Algorithms flowcharts
3 Pseudo Code
Pros & Cons of Algorithms
Introduction to programming languages
Low Level Language
– Machine language
– Assembly language
1
High Level Language
– Procedural Languages
– Object oriented & Structured Languages
Language Processor
Introduction to Software Engineering(S/E)
Week 10
2 What is Software Engineering(S/E)
Major Goals of S/E
3 Software Development Methodologies
3 The Software Life Cycle Model
3 Development process
3 – Analysis
3 – Design
3 – Implementation
3 – Testing
– Deployment
Introduction to operating systems
Task Performed by an Operating Systems
Types of Operating systems
1 – Single user/personal computer operating
system
– Multiuser/network operating system
– Embedded operating system
Week 11
Introduction to Database Management system
2 Traditional File system
The database Models
Introduction to Basic networking concepts
Benefits of computer networking
3 Classification of Networks
– Classification by network geography.
– Classification by component roles
More on Basic networking concepts
Network topology
Networking devices
1
– Router
– Switch
Week 12
– Gateway etc
Internet and world wide web
2
Future of the web: Semantic Web
Web Design & Usability
3
Elements of web design elements.
1 Introduction to Artificial Intelligence
Intelligent Agents
The origin of artificial intelligence
Page 6 of 9
Introduction to Computing
Issues Raised by Artificial Intelligence
Week 13 2
Robotics
3 Introduction to Computer graphics
1 Introduction to Compiler
Cyber Crimes
– 07 February 2000
2 – Dos Attack: Cyber Crime
Week 14
– Viruses
– Other virus-like programs
Social and legal Issues of Computer
3 – Privacy & freedom
– Ethics codes & privacy laws
The Computing Profession
1 – IT: Information Technology
Week 15 – Organization: A collection of Teams
2 The Future of Computing
3 Review & Wrap-up
9- Assessment Criteria
You are expected to attend all lectures, seminars, tutorials, and lab sessions or any other
classroom activity. Where you fail to attend classes, you cannot expect the lecturer to
brief you on what you have missed. You are responsible for your attendance, not the
academic staff. Attendance at tutorials and lab sessions will be strictly monitored, and
failure to attend will be taken into account.
Page 7 of 9
Introduction to Computing
13.1- Copying of Copyright Material by Student
A condition of acceptance as a student is the obligation to abide by the University’s
policy on the copying of copyright material. This obligation covers photocopying of any
material using the University’s photocopying machines, and the recording off air, and
making subsequent copies, of radio or television broadcasts, and photocopying textbooks.
Students who flagrantly disregard University policy and copyright requirements will be
liable to disciplinary action under the Code of Conduct.
Students are encouraged to co-operate, but collusion is a form of cheating. Students may
use any sources (acknowledged of course) other than the assignments of fellow students.
Unless your Subject Leader informs you otherwise, the following guideline should be
used: Students may work together in obtaining references, discussing the content of the
references and discussing the assignment, but when they write, they must write alone.
To attain these qualities, the school recommends use of either the Harvard or American
Psychological Association style of referencing, both of which use the author/date.
Page 9 of 9
Introduction to Computing