Skip to main content
B.Eng DegreeFaculty of Faculty of Engineering & TechnologyComputer Engineering

CPE 212: Data Structures and Algorithms

Big-O complexity, linked lists, stacks, queues, trees, BST, AVL, heaps, hash tables, graphs, and dynamic programming.

Instructor
Created by PAMCET Learning Team
beginner2 - 4 weeksEnglish

Course Overview

Big-O complexity, linked lists, stacks, queues, trees, BST, AVL, heaps, hash tables, graphs, and dynamic programming. Curriculum Structure & Core Modules: • 1. Algorithm Analysis: Asymptotic Notation (Big-O, Omega, Theta) and Recurrence Relations • 2. Linear Data Structures:...

What You'll Learn

  • Calculate asymptotic time and space complexity using Big-O, Omega, and Theta notations.
  • Implement singly, doubly, and circular linked lists with dynamic memory allocation in C++.
  • Design stack and queue ADTs and apply them to expression evaluation and breadth-first search.
  • Implement balanced binary search trees (AVL/Red-Black), binary heaps, and priority queues.
  • Construct graph representations and implement Dijkstra's, Bellman-Ford, Prim's, and Kruskal's algorithms.

Requirements

  • Completion of CPE 211.

Degree Programme Curriculum Context

This course is a curriculum unit of the Bachelor of Engineering (B.Eng.) in Computer Engineering 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
•
16 Lecture
•
24h
Subtopic 1Document LectureOpen Access~3 min read

Algorithm Analysis: Asymptotic Notation (Big-O, Omega, Theta) and Recurrence Relations: Theoretical Foundations, Modeling & Architecture

CPE 212 • 200L &b

Module 1 • Subtopic 1•500 characters of authentic academic content
Subtopic 2Document LectureOpen Access~3 min read

Algorithm Analysis: Asymptotic Notation (Big-O, Omega, Theta) and Recurrence Relations: Computations, Implementation & Verification

CPE 212 • 200L &b

Module 1 • Subtopic 2•500 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 1 Formative Assessment: Algorithm Analysis: Asymptotic Notation (Big-O, Omega, Theta

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

Rigorous formative competency assessment for Chapter 1: Algorithm Analysis: Asymptotic Notation (Big-O, Omega, Theta) and Recurrence Relations. Aligned with NUC CCMAS and COREN OBE standards.

Module 1 • Formative Assessment
Subtopic 1Document LectureOpen Access~3 min read

Linear Data Structures: Dynamic Arrays, Amortized Time, and Singly/Doubly Linked Lists: Theoretical Foundations, Modeling & Architecture

CPE 212 • 200L &b

Module 2 • Subtopic 1•500 characters of authentic academic content
Subtopic 2Document LectureOpen Access~3 min read

Linear Data Structures: Dynamic Arrays, Amortized Time, and Singly/Doubly Linked Lists: Computations, Implementation & Verification

CPE 212 • 200L &b

Module 2 • Subtopic 2•500 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 2 Formative Assessment: Linear Data Structures: Dynamic Arrays, Amortized Time, and

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

Rigorous formative competency assessment for Chapter 2: Linear Data Structures: Dynamic Arrays, Amortized Time, and Singly/Doubly Linked Lists. Aligned with NUC CCMAS and COREN OBE standards.

Module 2 • Formative Assessment
Subtopic 1Document LectureOpen Access~3 min read

Stacks and Queues: Array/List Implementations, Infix-to-Postfix, and Circular Buffers: Theoretical Foundations, Modeling & Architecture

CPE 212 • 200L &b

Module 3 • Subtopic 1•500 characters of authentic academic content
Subtopic 2Document LectureOpen Access~3 min read

Stacks and Queues: Array/List Implementations, Infix-to-Postfix, and Circular Buffers: Computations, Implementation & Verification

CPE 212 • 200L &b

Module 3 • Subtopic 2•500 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 3 Formative Assessment: Stacks and Queues: Array/List Implementations, Infix-to-Post

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

Rigorous formative competency assessment for Chapter 3: Stacks and Queues: Array/List Implementations, Infix-to-Postfix, and Circular Buffers. Aligned with NUC CCMAS and COREN OBE standards.

Module 3 • Formative Assessment
Subtopic 1Document LectureOpen Access~3 min read

Trees and Binary Search Trees (BST): Traversals (Pre, In, Post, Level-order) and Operations: Theoretical Foundations, Modeling & Architecture

CPE 212 • 200L &b

Module 4 • Subtopic 1•500 characters of authentic academic content
Subtopic 2Document LectureOpen Access~3 min read

Trees and Binary Search Trees (BST): Traversals (Pre, In, Post, Level-order) and Operations: Computations, Implementation & Verification

CPE 212 • 200L &b

Module 4 • Subtopic 2•500 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 4 Formative Assessment: Trees and Binary Search Trees (BST): Traversals (Pre, In, Po

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

Rigorous formative competency assessment for Chapter 4: Trees and Binary Search Trees (BST): Traversals (Pre, In, Post, Level-order) and Operations. Aligned with NUC CCMAS and COREN OBE standards.

Module 4 • Formative Assessment
Subtopic 1Document LectureOpen Access~3 min read

Self-Balancing Trees: AVL Rotations, Red-Black Trees, and B-Tree Fundamentals: Theoretical Foundations, Modeling & Architecture

CPE 212 • 200L &b

Module 5 • Subtopic 1•500 characters of authentic academic content
Subtopic 2Document LectureOpen Access~3 min read

Self-Balancing Trees: AVL Rotations, Red-Black Trees, and B-Tree Fundamentals: Computations, Implementation & Verification

CPE 212 • 200L &b

Module 5 • Subtopic 2•500 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 5 Formative Assessment: Self-Balancing Trees: AVL Rotations, Red-Black Trees, and B-

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

Rigorous formative competency assessment for Chapter 5: Self-Balancing Trees: AVL Rotations, Red-Black Trees, and B-Tree Fundamentals. Aligned with NUC CCMAS and COREN OBE standards.

Module 5 • Formative Assessment
Subtopic 1Document LectureOpen Access~3 min read

Priority Queues and Heaps: Binary Heap, Heapify, and Heapsort Algorithm: Theoretical Foundations, Modeling & Architecture

CPE 212 • 200L &b

Module 6 • Subtopic 1•500 characters of authentic academic content
Subtopic 2Document LectureOpen Access~3 min read

Priority Queues and Heaps: Binary Heap, Heapify, and Heapsort Algorithm: Computations, Implementation & Verification

CPE 212 • 200L &b

Module 6 • Subtopic 2•500 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 6 Formative Assessment: Priority Queues and Heaps: Binary Heap, Heapify, and Heapsor

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

Rigorous formative competency assessment for Chapter 6: Priority Queues and Heaps: Binary Heap, Heapify, and Heapsort Algorithm. Aligned with NUC CCMAS and COREN OBE standards.

Module 6 • Formative Assessment
Subtopic 1Document LectureOpen Access~3 min read

Hash Tables: Hash Functions, Separate Chaining, Open Addressing (Linear/Quadratic Probing): Theoretical Foundations, Modeling & Architecture

CPE 212 • 200L &b

Module 7 • Subtopic 1•500 characters of authentic academic content
Subtopic 2Document LectureOpen Access~3 min read

Hash Tables: Hash Functions, Separate Chaining, Open Addressing (Linear/Quadratic Probing): Computations, Implementation & Verification

CPE 212 • 200L &b

Module 7 • Subtopic 2•500 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 7 Formative Assessment: Hash Tables: Hash Functions, Separate Chaining, Open Address

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

Rigorous formative competency assessment for Chapter 7: Hash Tables: Hash Functions, Separate Chaining, Open Addressing (Linear/Quadratic Probing). Aligned with NUC CCMAS and COREN OBE standards.

Module 7 • Formative Assessment
Subtopic 1Document LectureOpen Access~3 min read

Graph Algorithms: Representations (Matrix/List), BFS, DFS, Dijkstra's Shortest Path, and MST: Theoretical Foundations, Modeling & Architecture

CPE 212 • 200L &b

Module 8 • Subtopic 1•500 characters of authentic academic content
Subtopic 2Document LectureOpen Access~3 min read

Graph Algorithms: Representations (Matrix/List), BFS, DFS, Dijkstra's Shortest Path, and MST: Computations, Implementation & Verification

CPE 212 • 200L &b

Module 8 • Subtopic 2•500 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Chapter 8 Formative Assessment: Graph Algorithms: Representations (Matrix/List), BFS, DFS, D

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

Rigorous formative competency assessment for Chapter 8: Graph Algorithms: Representations (Matrix/List), BFS, DFS, Dijkstra's Shortest Path, and MST. Aligned with NUC CCMAS and COREN OBE standards.

Module 8 • Formative Assessment

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
CPE 212: Data Structures and Algorithms
Free$24.99100% Off
Certificate available separately for $7 after completion

Course Includes

8 Chapters
16 Lectures
2 - 4 weeks
Skill Level beginner
Taught in English
Lifetime Access
Certification of Completion
Category: University - Computer Engineering
Share On

Download Syllabus & Study Guide

Receive the full lecture syllabus, reading list, and milestone schedule for CPE 212: Data Structures and Algorithms.

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

CPE 212: Data Structures and Algorithms | PAMCET University — B.Eng | PAMCET