Skip to main content
B.Sc. DegreeFaculty of Faculty of Social Sciences & MediaEconomics

Introduction to Computers (Economics)

Master Introduction to Computers (Economics) in University - Economics with this structured course, covering 8 modules and practice assessments.

Instructor
Created by PAMCET Learning Team
beginner1 weekEnglish

Course Overview

Master Introduction to Computers (Economics) in University - Economics with this structured course, covering 8 modules and practice assessments. Curriculum Structure & Core Modules: • 1. Introduction to Computer Systems & Algorithmic Thinking • 2. Programming Fundamentals:...

What You'll Learn

  • Understand and apply the principles of Computer Hardware Basics (Economics)
  • Work confidently through Operating Systems Overview (Economics) and its practical applications
  • Analyse real-world scenarios involving Spreadsheets for Economic Data
  • Develop applied skills in Word Processing for Reports
  • Critically evaluate approaches to Data Visualisation Basics

Requirements

  • No prior University - Economics knowledge required — this course starts from the fundamentals
  • A computer, tablet or smartphone with a stable internet connection
  • Willingness to commit regular study time to complete lessons, quizzes and assignments

Degree Programme Curriculum Context

This course is a curriculum unit of the B.Sc. Economics degree framework in Nigeria.

Earn Your Certificate

Showcase your skills with a certificate! Complete the course, submit your project, and earn your certificate. Here's a sample of what you'll receive to show off your accomplishments.

course-certificate
Lecture Board & Syllabus

Course Curriculum

Browse complete theoretical foundations, worked calculations, laboratory protocols, and board assessment questions under each topic.

Launch Course Reader →
8 Chapters
•
24 Lecture
•
0s
Subtopic 1Document LectureOpen Access~23 min read

Computer Systems Architecture & The Von Neumann Machine Paradigm

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Computer Systems Architecture & The Von Neumann Machine Paradigm Hardware-Software Hierarchy, Instruction Cycles, Bus Architectures, and Memory Hierarchies in Applied Computing 1. Theoretical Foundation & Conceptual Architecture The foundation of modern computational science and electronic data processing is anchored in the **Von Neumann Archite...

Module 1 • Subtopic 1•19,047 characters of authentic academic content
Subtopic 2Document Lecture

Algorithmic Thinking, Computational Problem Solving & Pseudocode Design

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Algorithmic Thinking, Computational Problem Solving & Pseudocode Design Formal Definition of an Algorithm, Structured Flowcharts, Stepwise Refinement, and Correctness Invariants 1. Theoretical Foundation & Conceptual Architecture The conceptual essence of computer science resides not in electronic circuitry or programming syntax, but in the form...

Module 1 • Subtopic 2
Subtopic 3Document Lecture

Binary Data Representation: Integers, Floating-Point IEEE 754 & Character Encodings

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Binary Data Representation: Integers, Floating-Point IEEE 754 & Character Encodings Two's Complement Arithmetic, Fixed-Point Scaling, IEEE 754 Standard, and Modern Text Encoding in Economic Systems 1. Theoretical Foundation & Conceptual Architecture All information processed by electronic computers—whether numerical economic time series, compile...

Module 1 • Subtopic 3
Subtopic 1Document Lecture

Variables, Primitive Data Types, Memory Allocation & Type Systems

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Variables, Primitive Data Types, Memory Allocation & Type Systems Memory Binding, Dynamic vs. Static Typing, Type Coercion, and Scope Rules in Applied Economic Programming 1. Theoretical Foundation & Conceptual Architecture In computer programming, a **Variable** is an abstraction that binds a human-readable symbolic identifier to a specific loc...

Module 2 • Subtopic 1
Subtopic 2Document Lecture

Control Structures: Conditional Selection, Multi-Way Branching & Boolean Algebra

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Control Structures: Conditional Selection, Multi-Way Branching & Boolean Algebra Short-Circuit Logical Evaluation, Nested Conditionals, Switch-Case Dispatch Tables, and Guard Clauses 1. Theoretical Foundation & Conceptual Architecture The defining capability that elevates an electronic computer above a mechanical adding machine is **Conditional...

Module 2 • Subtopic 2
Subtopic 3Document Lecture

Iterative Control Structures: Definite Loops, Indefinite Loops & State Accumulation

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Iterative Control Structures: Definite Loops, Indefinite Loops & State Accumulation For Loops, While Loops, Loop Termination Guarantees, Off-by-One Errors, and Nested Convergence Algorithms 1. Theoretical Foundation & Conceptual Architecture The ability to repeat a block of computational instructions rapidly and reliably across millions of data...

Module 2 • Subtopic 3
Subtopic 1Document Lecture

Object-Oriented Programming Foundations: Encapsulation, Classes & Object Instantiation

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Object-Oriented Programming Foundations: Encapsulation, Classes & Object Instantiation State Invariants, Information Hiding, Constructor Methods, and Instance Attribute Modeling in Software Architecture 1. Theoretical Foundation & Conceptual Architecture The evolution of software engineering methodologies over six decades was driven by an escala...

Module 3 • Subtopic 1
Subtopic 2Document Lecture

Inheritance, Polymorphism & Dynamic Method Dispatch

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Inheritance, Polymorphism & Dynamic Method Dispatch The Liskov Substitution Principle, Method Overriding, Abstract Base Classes, and Virtual Method Tables 1. Theoretical Foundation & Conceptual Architecture While encapsulation organizes software into modular objects, the true power of object-oriented architecture is realized through **Inheritanc...

Module 3 • Subtopic 2
Subtopic 3Document Lecture

Advanced OOP Design: Composition, Dunder Protocols & Structural Design Patterns

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Advanced OOP Design: Composition, Dunder Protocols & Structural Design Patterns Operator Overloading, Python Dunder Protocols, Factory and Strategy Patterns in Applied Computing 1. Theoretical Foundation & Conceptual Architecture Beyond basic classes and inheritance, professional software engineering leverages advanced object-oriented design pat...

Module 3 • Subtopic 3
Subtopic 1Document Lecture

Contiguous Memory Structures: Fixed Arrays, Dynamic Arrays & Memory Addressing

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Contiguous Memory Structures: Fixed Arrays, Dynamic Arrays & Memory Addressing Memory Row-Major Mapping, Amortized Geometric Resizing, Cache Line Spatial Locality, and Buffer Overflows 1. Theoretical Foundation & Conceptual Architecture At the foundation of all algorithmic data organization is the **Array**—the oldest, simplest, and most hardwar...

Module 4 • Subtopic 1
Formative Assessment10 Points • 15 Mins

Mid-Course Progress Assessment

Assessment Protocol:10 Total Points•70% Passing Threshold•15 Mins Time Limit•Bloom's Taxonomy: Analyze & Evaluate

Test your knowledge of Word Processing for Reports

Module 4 • Formative Assessment
Subtopic 3Document Lecture

Node-Based Data Structures: Singly & Doubly Linked Lists and Pointer Manipulation

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Node-Based Data Structures: Singly & Doubly Linked Lists and Pointer Manipulation Non-Contiguous Heap Allocation, Pointer References, O(1) Splicing vs. O(N) Traversal, and Sentinel Nodes 1. Theoretical Foundation & Conceptual Architecture While contiguous arrays provide unmatched O(1) random access, they suffer from two severe structural limitat...

Module 4 • Subtopic 3
Subtopic 4Document Lecture

Abstract Data Types: Stacks (LIFO), Queues (FIFO) & Ring Buffers

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Abstract Data Types: Stacks (LIFO), Queues (FIFO) & Ring Buffers Call Stack Frames, Parsing Syntax Trees, Breadth-First Search, Circular Buffers, and Asynchronous Event Pipelines 1. Theoretical Foundation & Conceptual Architecture In computer science, an **Abstract Data Type (ADT)** defines a mathematical model for data types where the behavior...

Module 4 • Subtopic 4
Subtopic 1Document Lecture

Foundations of Algorithm Analysis: Asymptotic Notations & the Master Theorem

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Foundations of Algorithm Analysis: Asymptotic Notations & the Master Theorem Big-O, Big-Omega, Big-Theta Formalisms, Recurrence Relations, and Divide-and-Conquer Complexity Bounds 1. Theoretical Foundation & Conceptual Architecture The mathematical foundations of computer science rest upon the rigorous discipline of **Algorithm Analysis**—the fo...

Module 5 • Subtopic 1
Subtopic 2Document Lecture

Divide-and-Conquer Sorting & Searching: MergeSort, QuickSort and Binary Search

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Divide-and-Conquer Sorting & Searching: MergeSort, QuickSort and Binary Search Divide-and-Conquer Paradigms, In-Place Partitioning, Average-Case vs. Worst-Case Pivoting, and Information-Theoretic Lower Bounds 1. Theoretical Foundation & Conceptual Architecture Among the foundational paradigms of computer science, **Divide-and-Conquer** stands as...

Module 5 • Subtopic 2
Subtopic 3Document Lecture

Advanced Algorithmic Paradigms: Dynamic Programming & Intractability

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Advanced Algorithmic Paradigms: Dynamic Programming & Intractability Overlapping Subproblems, Memoization vs. Tabulation, the Bellman Equation, and the P vs. NP Millennium Problem 1. Theoretical Foundation & Conceptual Architecture While divide-and-conquer effectively solves problems by combining disjoint subproblems, it fails catastrophically w...

Module 5 • Subtopic 3
Subtopic 4Open Access~3 min read

Mid-Semester Case Study & Research Paper

Sign in or enroll to access the full lecture notes and interactive reader.

Module 5 • Subtopic 4•125 characters of authentic academic content
Subtopic 1Document Lecture

Relational Database Foundations: Relational Algebra & Entity-Relationship Modeling

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Relational Database Foundations: Relational Algebra & Entity-Relationship Modeling Codd's Relational Formalism, Set-Theoretic Algebra, Chen's ER Notation, and Primary-Foreign Key Integrity Constraints 1. Theoretical Foundation & Conceptual Architecture In modern enterprise computing and quantitative economics, data is the vital lifeblood of inst...

Module 6 • Subtopic 1
Subtopic 2Document Lecture

Database Normalization & SQL Declarative Querying: 1NF to BCNF

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Database Normalization & SQL Declarative Querying: 1NF to BCNF Functional Dependencies, Armstrong's Axioms, Lossless-Join Decomposition, and SQL Data Manipulation Language 1. Theoretical Foundation & Conceptual Architecture A poorly designed relational database schema introduces severe structural pathologies that degrade system performance and c...

Module 6 • Subtopic 2
Subtopic 3Document Lecture

Transaction Processing, ACID Properties & Concurrency Control

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Transaction Processing, ACID Properties & Concurrency Control Two-Phase Locking (2PL), Conflict Serializability, B-Tree Indexing Architecture, and Write-Ahead Logging (WAL) 1. Theoretical Foundation & Conceptual Architecture In commercial banking, securities trading, and enterprise resource planning, database systems must process thousands of co...

Module 6 • Subtopic 3
Subtopic 1Document Lecture

Operating System Architecture: Kernel Structures, Dual-Mode Operation & System Calls

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Operating System Architecture: Kernel Structures, Dual-Mode Operation & System Calls Privilege Rings, Hardware Interrupts, Context Switching, POSIX System Calls, and Monolithic vs Microkernel Designs 1. Theoretical Foundation & Conceptual Architecture An **Operating System (OS)** represents the foundational software layer that bridges the physic...

Module 7 • Subtopic 1
Subtopic 2Document Lecture

Process Management, CPU Scheduling & Deadlock Synchronization

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Process Management, CPU Scheduling & Deadlock Synchronization Process Control Blocks, Round-Robin Scheduling, Gantt Charts, Coffman Deadlock Conditions, and Banker's Algorithm 1. Theoretical Foundation & Conceptual Architecture At the heart of multi-tasking computing lies the **Process**—defined as an active program in execution (Silberschatz, G...

Module 7 • Subtopic 2
Subtopic 3Document Lecture

Memory Architecture: Virtual Memory, Paging & Page Replacement

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Memory Architecture: Virtual Memory, Paging & Page Replacement Memory Management Units, Multi-Level Page Tables, Translation Lookaside Buffers, LRU Page Replacement, and Belady's Anomaly 1. Theoretical Foundation & Conceptual Architecture In early computing architectures, programs operated directly on physical RAM memory addresses. This primitiv...

Module 7 • Subtopic 3
Subtopic 1Document Lecture

Software Development Lifecycles: Waterfall, Agile & System Architecture

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Software Development Lifecycles: Waterfall, Agile & System Architecture Requirements Engineering, Scrum Sprints, User Stories, Architectural Patterns, and Technical Debt 1. Theoretical Foundation & Conceptual Architecture The discipline of **Software Engineering** emerged out of necessity during the NATO Software Engineering Conference in Garmis...

Module 8 • Subtopic 1
Formative Assessment10 Points • 15 Mins

Comprehensive End-of-Course Examination

Assessment Protocol:10 Total Points•70% Passing Threshold•15 Mins Time Limit•Bloom's Taxonomy: Analyze & Evaluate

Test your knowledge of Computer Ethics in Data Use

Module 8 • Formative Assessment
Subtopic 3Document Lecture

Software Quality Assurance: Testing, Verification & CI/CD Pipelines

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Software Quality Assurance: Testing, Verification & CI/CD Pipelines The Testing Pyramid, Test-Driven Development (TDD), Code Coverage Metrics, Static Analysis, and Automated CI/CD Pipelines 1. Theoretical Foundation & Conceptual Architecture Software correctness cannot be assumed; it must be systematically verified through rigorous **Software Qu...

Module 8 • Subtopic 3
Subtopic 4Document Lecture

Distributed Version Control, Git Internals & Capstone Computational Integration

NUC CCMAS Benchmark: CMP 101 | 100L Computer Science Distributed Version Control, Git Internals & Capstone Computational Integration Directed Acyclic Graphs, Content-Addressable Storage, SHA-1 Object Trees, Git Branching Workflows, and Economic Computing Synthesis 1. Theoretical Foundation & Conceptual Architecture In modern collaborative software engineering and empirical economic research, manag...

Module 8 • Subtopic 4

Instructor

PAMCET Learning Team

PAMCET Learning Team

Institutional Course Curation · PAMCET

The PAMCET Learning Team is the institutional curriculum and content group behind course publishing on this platform. PAMCET (Professional and Academic Management Centre for Education and Training) is operated by Digitpen Hub Ltd, a company registered in Lagos, Nigeria. Courses credited to the PAMCET Learning Team are structured, organized, and published centrally by the platform rather than authored by a single named individual instructor — each course's syllabus, learning outcomes, and content are reviewed before publication under this institutional account. For questions about a specific course or to report a content issue, please use the platform's Help & Support or Contact Us pages.

Qualifications:

PAMCET Learning Team — Institutional Course Curation, Digitpen Hub Ltd

My Skills:

  • Curriculum Curation
  • Course Content Review
  • Learning Outcome Design
  • Course Publishing & Quality Assurance
  • Platform Content Operations

Reviews

No reviews available
Introduction to Computers (Economics)
Free$12.99100% Off
Certificate available separately for $7 after completion

Course Includes

8 Chapters
24 Lectures
1 week
Skill Level beginner
Taught in English
Lifetime Access
Certification of Completion
Category: University - Economics
Share On

Download Syllabus & Study Guide

Receive the full lecture syllabus, reading list, and milestone schedule for Introduction to Computers (Economics).

By submitting, you agree to receive educational updates. You can unsubscribe anytime. Read our Privacy Policy.