Skip to main content
B.Sc. DegreeFaculty of Faculty of Computing & Information TechnologyComputer Science

Data Structures & Algorithms

Master Data Structures & Algorithms in University - Computer Science with this structured course, covering 8 modules and practice assessments.

Instructor
Created by PAMCET Learning Team
intermediate2 - 4 weeksEnglish

Course Overview

Master Data Structures & Algorithms in University - Computer Science with this structured course, covering 8 modules and practice assessments. Curriculum Structure & Core Modules: • 1. Abstract Data Types, Asymptotic Analysis & Recurrence Relations • 2. Linear Data Structures:...

What You'll Learn

  • Understand and apply the principles of Abstract Data Types
  • Work confidently through Arrays, Linked Lists and Their Operations and its practical applications
  • Analyse real-world scenarios involving Stacks and Queues
  • Develop applied skills in Trees, Binary Trees and Binary Search Trees
  • Critically evaluate approaches to Graphs and Graph Algorithms

Requirements

  • A foundational understanding of University - Computer Science concepts, from an introductory course or equivalent experience
  • 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. Computer Science 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
•
18h
Subtopic 1Document LectureOpen Access

Abstract Data Types, Data Abstraction & Mathematical Modeling of Data Structures

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

Module 1 • Subtopic 1
Subtopic 2Document Lecture

Asymptotic Analysis: Big-O, Big-Omega, Big-Theta Notations & Growth Rates

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

Module 1 • Subtopic 2
Subtopic 3Document Lecture

Recurrence Relations, The Master Theorem & Divide-and-Conquer Complexity

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

Module 1 • Subtopic 3
Subtopic 1Document Lecture

Contiguous Memory Arrays, Indexing Mechanics & Multi-Dimensional Representation

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

Module 2 • Subtopic 1
Subtopic 2Document Lecture

Dynamic Arrays, Geometric Resizing & Amortized Complexity Analysis

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

Module 2 • Subtopic 2
Subtopic 3Document Lecture

Sparse Matrices, Row-Major vs Column-Major Layouts & Compressed Sparse Representation

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

Module 2 • Subtopic 3
Subtopic 1Document Lecture

Singly Linked Lists: Pointer Manipulation, Insertion, Deletion & Traversal

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

Module 3 • Subtopic 1
Subtopic 2Document Lecture

Doubly Linked Lists, Sentinel Nodes & Two-Way Cursor Management

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

Module 3 • Subtopic 2
Subtopic 3Document Lecture

Circular Linked Lists, Skip Lists & Probabilistic Fast Searching

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

Module 3 • Subtopic 3
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 Trees, Binary Trees and Binary Search Trees

Module 4 • Formative Assessment
Subtopic 2Document Lecture

The Stack Abstract Data Type: LIFO Semantics, Array/Linked Implementations & Call Stack Emulation

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

Module 4 • Subtopic 2
Subtopic 3Document Lecture

Expression Parsing: Infix, Prefix, Postfix Conversion & Dijkstra's Shunting-Yard Algorithm

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

Module 4 • Subtopic 3
Subtopic 4Document Lecture

Queues and Double-Ended Queues: FIFO Semantics, Circular Buffers & Ring Buffer Systems

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

Module 4 • Subtopic 4
Subtopic 1Open 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 1•116 characters of authentic academic content
Subtopic 2Document Lecture

Elementary Sorting Algorithms: Bubble Sort, Selection Sort, Insertion Sort & Lower Bounds

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

Module 5 • Subtopic 2
Subtopic 3Document Lecture

Divide-and-Conquer Sorting: Mergesort, Quicksort, Pivot Selection & Invariant Analysis

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

Module 5 • Subtopic 3
Subtopic 4Document Lecture

Non-Comparison Sorting: Counting Sort, Radix Sort & Bucket Sort Algorithms

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

Module 5 • Subtopic 4
Subtopic 1Document Lecture

Priority Queues & Complete Binary Trees: Array-Based Heap Representation

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

Module 6 • Subtopic 1
Subtopic 2Document Lecture

Heap Operations: Sift-Up, Sift-Down, Linear-Time Heapify & In-Place Heapsort

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

Module 6 • Subtopic 2
Subtopic 3Document Lecture

Disjoint-Set Data Structures: Union-Find, Path Compression & Rank Union Heuristics

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

Module 6 • Subtopic 3
Subtopic 1Document Lecture

Binary Trees & Binary Search Trees (BST): Properties, In-Order Traversal & Tree Search

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

Module 7 • Subtopic 1
Subtopic 2Document Lecture

Self-Balancing Trees: AVL Tree Rotations, Balance Factors & Red-Black Tree Invariants

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

Module 7 • Subtopic 2
Subtopic 3Document Lecture

Multi-Way Search Trees: B-Trees, B+ Trees & Disk-Based External Storage Indexing

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

Module 7 • Subtopic 3
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 Searching Algorithms and Complexity

Module 8 • Formative Assessment
Subtopic 2Document Lecture

Graph Representation: Adjacency Matrices, Adjacency Lists & Topological Sorting

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

Module 8 • Subtopic 2
Subtopic 3Document Lecture

Graph Traversal: Breadth-First Search (BFS), Depth-First Search (DFS) & Connected Components

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

Module 8 • Subtopic 3
Subtopic 4Document Lecture

Shortest Paths & Spanning Trees: Dijkstra, Bellman-Ford, Prim & Kruskal Algorithms

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

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

Course Includes

8 Chapters
24 Lectures
2 - 4 weeks
Skill Level intermediate
Taught in English
Lifetime Access
Certification of Completion
Category: University - Computer Science
Share On

Download Syllabus & Study Guide

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

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