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

Computer Science - Data Structures & Algorithms

Complete Computer Science - Data Structures & Algorithms course with lessons, quizzes and practical questions

Instructor
Created by PAMCET Learning Team
1 Student Enrolledintermediate1 weekEnglish

Course Overview

Complete Computer Science - Data Structures & Algorithms course with lessons, quizzes and practical questions Curriculum Structure & Core Modules: • 1. Mathematical Foundations, Asymptotic Analysis & Recurrence Relations • 2. Linear Data Structures: Arrays, Linked Lists &...

What You'll Learn

  • Understand and apply the core concepts and terminology of Computer Science - Data Structures & Algorithms
  • Build practical competence in University - Computer Science through structured coursework
  • Complete the full module sequence and assessments for Computer Science - Data Structures & Algorithms
  • Apply University - Computer Science knowledge to coursework, assignments and exam-style questions

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
•
0s
Subtopic 1Document LectureOpen Access~19 min read

Asymptotic Notations: Big-O, Big-Omega, Big-Theta, Growth of Functions, and Limits

Course Code: CSC 201 | Module 1: Mathematical Foundations & Asymptotic Analysis Asymptotic Notations: Big-O, Big-Omega, Big-Theta, Growth of Functions, and Limits An exhaustive examination of algorithm efficiency analysis, formal set-theoretic definitions of asymptotic bounding notations, limit ratios, complexity class hierarchies, and dominance ordering. 1. The Mathematical Foundations of Algorit...

Module 1 • Subtopic 1•16,058 characters of authentic academic content
Subtopic 2Document Lecture

Empirical Benchmarking, Operation Counting, Worst-Case, Average-Case, and Amortized Analysis

Course Code: CSC 201 | Module 1: Mathematical Foundations & Asymptotic Analysis Empirical Benchmarking, Operation Counting, Worst-Case, Average-Case, and Amortized Analysis An exhaustive engineering analysis of primitive operation counting, worst-case vs average-case complexity, probabilistic input distributions, and formal amortized analysis via aggregate, accounting, and potential methods. 1. Pr...

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

Recurrence Relations, Recursion Trees, and the Master Theorem for Divide-and-Conquer

Course Code: CSC 201 | Module 1: Mathematical Foundations & Asymptotic Analysis Recurrence Relations, Recursion Trees, and the Master Theorem for Divide-and-Conquer An exhaustive engineering analysis of recursive algorithm complexity, mathematical recurrence formulations, the substitution induction method, recursion tree summation, and the Master Theorem (CLRS). 1. Formulating Recurrence Relations...

Module 1 • Subtopic 3•15,513 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Assessment: Mathematical Foundations, Asymptotic Analysis & Recurrences

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

Test your knowledge of Week 1: Core Topics

Module 1 • Formative Assessment
Subtopic 1Document Lecture

Contiguous Arrays vs Pointer Lists: Dynamic Arrays, Amortized Geometric Resizing, and Memory Layout

Course Code: CSC 201 | Module 2: Linear Data Structures: Arrays & Linked Lists Contiguous Arrays vs Pointer Lists: Dynamic Arrays, Amortized Geometric Resizing, and Memory Layout An exhaustive engineering analysis of physical memory layouts, hardware cache lines, static vs dynamic arrays, geometric growth ratios, amortized analysis, and pointer indirection overheads. 1. Physical Memory Architectur...

Module 2 • Subtopic 1
Subtopic 2Document Lecture

Singly Linked Lists: Node Allocation, Pointer Manipulation, Insertion, Deletion, and Traversal

Course Code: CSC 201 | Module 2: Linear Data Structures: Arrays & Linked Lists Singly Linked Lists: Node Allocation, Pointer Manipulation, Insertion, Deletion, and Traversal An exhaustive engineering analysis of linked node architecture, heap pointer referencing, boundary insertions and deletions, in-place list reversal, and Floyd's cycle-finding algorithm. 1. The Node Abstraction and Non-Contiguo...

Module 2 • Subtopic 2
Subtopic 3Document LectureOpen Access~15 min read

Doubly Linked Lists and Circular Lists: Sentinel Nodes, Bi-Directional Navigation, and Memory Overheads

Course Code: CSC 201 | Module 2: Linear Data Structures: Arrays & Linked Lists Doubly Linked Lists and Circular Lists: Sentinel Nodes, Bi-Directional Navigation, and Memory Overheads An exhaustive engineering analysis of doubly linked node mechanics, dummy sentinel nodes, circular list topologies, round-robin schedulers, memory overheads, and the design of high-performance LRU caches. 1. Doubly Li...

Module 2 • Subtopic 3•12,311 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Assessment: Linear Data Structures, Array Resizing & Linked List Mechanics

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

Test your knowledge of Week 2: Core Topics

Module 2 • Formative Assessment
Subtopic 1Document Lecture

The Stack ADT: LIFO Mechanics, Array and Linked Implementations, Function Call Frames, and Memory Limits

Course Code: CSC 201 | Module 3: Restricted Access Linear Structures: Stacks, Queues & Deques The Stack ADT: LIFO Mechanics, Array and Linked Implementations, Function Call Frames, and Memory Limits An exhaustive engineering analysis of the Last-In, First-Out (LIFO) storage paradigm, formal Stack ADT contracts, contiguous array vs singly linked implementations, CPU call stack activation frames, an...

Module 3 • Subtopic 1
Subtopic 2Document Lecture

Parsing and Evaluation: Infix to Postfix Conversion, Operator Precedence Parsing, and Stack Calculators

Course Code: CSC 201 | Module 3: Restricted Access Linear Structures: Stacks, Queues & Deques Parsing and Evaluation: Infix to Postfix Conversion, Operator Precedence Parsing, and Stack Calculators An exhaustive engineering analysis of mathematical notation conventions, Dijkstra's Shunting-Yard algorithm, operator precedence and associativity, stack evaluation mechanics, and algebraic virtual mach...

Module 3 • Subtopic 2
Subtopic 3Document LectureOpen Access~16 min read

The Queue and Deque ADTs: FIFO Mechanics, Circular Buffers, Double-Ended Queues, and Task Scheduling

Course Code: CSC 201 | Module 3: Restricted Access Linear Structures: Stacks, Queues & Deques The Queue and Deque ADTs: FIFO Mechanics, Circular Buffers, Double-Ended Queues, and Task Scheduling An exhaustive engineering analysis of the First-In, First-Out (FIFO) queue contract, modular arithmetic circular array buffers, double-ended queues (Deques), operating system spoolers, and task scheduling...

Module 3 • Subtopic 3•12,814 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Assessment: Stacks, Queues, Expression Parsing & Buffer Architecture

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

Test your knowledge of Week 3: Core Topics

Module 3 • Formative Assessment
Subtopic 1Document Lecture

Tree Anatomy & Terminologies: Degrees, Depth, Height, Binary Trees, and Tree Traversal Algorithms

Course Code: CSC 201 | Module 4: Hierarchical Non-Linear Structures: Binary Trees & Balanced Search Trees Tree Anatomy & Terminologies: Degrees, Depth, Height, Binary Trees, and Tree Traversal Algorithms An exhaustive engineering analysis of hierarchical non-linear topologies, node degrees, tree heights, full vs complete trees, mathematical binary tree theorems, and depth-first/breadth-first trave...

Module 4 • Subtopic 1
Subtopic 2Document Lecture

Binary Search Trees (BST): Search, Insertion, Deletion via In-Order Successor, and Unbalanced Trees

Course Code: CSC 201 | Module 4: Hierarchical Non-Linear Structures: Binary Trees & Balanced Search Trees Binary Search Trees (BST): Search, Insertion, Deletion via In-Order Successor, and Unbalanced Trees An exhaustive engineering analysis of the Binary Search Tree ordering invariant, logarithmic search algorithms, node insertions, three-case node deletions, in-order successors, and worst-case pa...

Module 4 • Subtopic 2
Subtopic 3Document LectureOpen Access~18 min read

Self-Balancing Trees: AVL Trees, Balance Factors, Single/Double Rotations, and Logarithmic Guarantees

Course Code: CSC 201 | Module 4: Hierarchical Non-Linear Structures: Binary Trees & Balanced Search Trees Self-Balancing Trees: AVL Trees, Balance Factors, Single/Double Rotations, and Logarithmic Guarantees An exhaustive engineering analysis of self-balancing binary search trees, the AVL height-balance invariant, single and double tree rotations, balance factors, Fibonacci minimal trees, and O(lo...

Module 4 • Subtopic 3•14,458 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Assessment: Binary Trees, Binary Search Trees & AVL Rotations

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

Test your knowledge of Week 4: Core Topics

Module 4 • Formative Assessment
Subtopic 1Document Lecture

The Priority Queue ADT: Heap-Order Property, Complete Binary Trees, and Array Representation

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

Module 5 • Subtopic 1
Subtopic 2Document Lecture

Binary Min-Heaps and Max-Heaps: Sift-Up, Sift-Down, Insert, and Extract-Max Operations

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

Module 5 • Subtopic 2
Subtopic 3Document LectureOpen Access

Floyd's Heap Construction in Linear Time, In-Place Heapsort, and Priority Event Schedulers

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

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•135 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Assessment: Binary Heaps, Priority Queues & Heapsort Mechanics

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

Test your knowledge of Week 5: Core Topics

Module 5 • Formative Assessment
Subtopic 1Document Lecture

The Dictionary ADT & Hash Functions: Direct Addressing, Division Method, and Universal Hashing

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

Module 6 • Subtopic 1
Subtopic 2Document Lecture

Collision Resolution Strategies: Separate Chaining vs Open Addressing and Probing Techniques

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

Module 6 • Subtopic 2
Subtopic 3Document LectureOpen Access~17 min read

Load Factor Dynamics, Clustering Anomalies, Dynamic Resizing Rehashing, and Hash Digest Security

Course Code: CSC 201 | Module 6: Hash Tables, Hash Functions & Collision Resolution Load Factor Dynamics, Clustering Anomalies, Dynamic Resizing Rehashing, and Hash Digest Security A mathematical treatise on table load factor dynamics, expected search probe equations, dynamic geometric table doubling, amortized complexity, and cryptographic vs non-cryptographic digest security. 1. Load Factor Dyna...

Module 6 • Subtopic 3•14,004 characters of authentic academic content
Formative Assessment10 Points • 15 Mins

Assessment: Hash Functions, Collision Resolution & Load Factor Dynamics

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

Test your knowledge of Week 6: Core Topics

Module 6 • Formative Assessment
Subtopic 1Document Lecture

Graph Fundamentals: Directed, Undirected, Weighted Graphs, and Matrix vs List Representations

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

Module 7 • Subtopic 1
Subtopic 2Document Lecture

Fundamental Graph Traversals: Breadth-First Search (BFS), Depth-First Search (DFS), and Cycle Detection

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

Module 7 • Subtopic 2
Subtopic 3Document LectureOpen Access

Shortest Path Algorithms & Minimum Spanning Trees: Dijkstra, Prim, and Kruskal Algorithms

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

Module 7 • Subtopic 3
Formative Assessment10 Points • 15 Mins

Assessment: Graph Representations, BFS/DFS Traversals & Shortest Paths

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

Test your knowledge of Week 7: Core Topics

Module 7 • Formative Assessment
Subtopic 1Document Lecture

Comparison-Based Sorting: Quicksort Partitioning, Mergesort, and Omega(N log N) Lower Bound

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

Module 8 • Subtopic 1
Subtopic 2Document Lecture

Non-Comparison Sorting & Searching: Counting Sort, Radix Sort, Binary Search, and Exponential Search

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

Module 8 • Subtopic 2
Subtopic 3Document LectureOpen Access

Dynamic Programming & Greedy Paradigms: Optimal Substructure, Memoization, and Tabulation

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

Module 8 • Subtopic 3
Formative Assessment10 Points • 15 Mins

Assessment: Algorithmic Design Paradigms, Sorting Algorithms & Dynamic Programming

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

Test your knowledge of Week 8: Core Topics

Module 8 • Formative Assessment
Subtopic 5Open Access~3 min read

Final Assignment - Computer Science - Data Structures & Algorithms

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

Module 8 • Subtopic 5•75 characters of authentic academic content

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

Course Includes

8 Chapters
24 Lectures
1 week
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 Computer Science - Data Structures & Algorithms.

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

Computer Science - Data Structures & Algorithms — B.Sc. | PAMCET