Skip to main content
ND DegreeFaculty of Faculty of Computing & Information TechnologyComputer Science

Data Structures (ND)

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

Instructor
Created by PAMCET Learning Team
beginner1 weekEnglish

Course Overview

Master Data Structures (ND) in University - Computer Science with this structured course, covering 8 modules and practice assessments. Curriculum Structure & Core Modules: • 1. Foundations of Data Structures, Abstract Data Types (ADTs) & Complexity Analysis • 2. Linear Data...

What You'll Learn

  • Understand and apply the principles of Introduction to Data Structures
  • Work confidently through Arrays and Linked Lists and its practical applications
  • Analyse real-world scenarios involving Stacks and Their Applications
  • Develop applied skills in Queues and Their Applications
  • Critically evaluate approaches to Trees and Binary Search Trees

Requirements

  • No prior University - Computer Science 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 ND 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 Lecture

Abstract Data Types (ADTs), Data Encapsulation and Memory Representation Fundamentals

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

Module 1 • Subtopic 1
Subtopic 2Document Lecture

Asymptotic Algorithmic Analysis: Big-O, Big-Omega, Big-Theta, Best/Worst/Average Cases

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

Module 1 • Subtopic 2
Subtopic 3Document Lecture

Contiguous vs. Non-Contiguous Memory Structures: Static Arrays, Dynamic Arrays and Cache Locality

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

Module 1 • Subtopic 3
Subtopic 1Document Lecture

Stacks (LIFO): Array and Linked Representations, Push/Pop Operations and Function Call Stacks

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

Module 2 • Subtopic 1
Subtopic 2Document Lecture

Applications of Stacks: Infix to Postfix/Prefix Conversion, Expression Evaluation and Backtracking

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

Module 2 • Subtopic 2
Subtopic 3Document Lecture

Queues (FIFO), Circular Queues, Deques and Priority Queues: Buffer Implementations

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

Module 2 • Subtopic 3
Subtopic 1Document Lecture

Singly Linked Lists: Node Anatomy, Pointer Linking, Insertion, Deletion and Traversal

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

Module 3 • Subtopic 1
Subtopic 2Document Lecture

Doubly Linked Lists and Circular Linked Lists: Bidirectional Traversal and Memory Overhead

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

Module 3 • Subtopic 2
Subtopic 3Document Lecture

Memory Management in Linked Structures: Dynamic Allocation, Memory Leaks and Garbage Collection

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

Module 3 • Subtopic 3
Subtopic 1Document Lecture

Tree Terminology, Hierarchical Structures, Binary Trees and Tree Traversals (Inorder, Preorder, Postorder)

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

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 Queues and Their Applications

Module 4 • Formative Assessment
Subtopic 3Document Lecture

Binary Search Trees (BST): Insertion, Search, Deletion Algorithms and Complexity Bounds

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

Module 4 • Subtopic 3
Subtopic 4Document Lecture

Self-Balancing Search Trees: AVL Trees, Tree Rotations and Height-Balance Maintenance

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

Module 4 • Subtopic 4
Subtopic 1Document Lecture

Binary Heaps: Min-Heap, Max-Heap, Array-Based Representation and Heap Properties

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

Module 5 • Subtopic 1
Subtopic 2Document Lecture

Heap Operations: Sift-Up, Sift-Down, Heapify in O(N) Time and Priority Queue Construction

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

Module 5 • Subtopic 2
Subtopic 3Document Lecture

Heap Sort: In-Place Algorithmic Complexity, Stability Analysis and Comparative Benchmarking

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•108 characters of authentic academic content
Subtopic 1Document Lecture

Hashing Foundations: Hash Functions, Keys, Buckets and Universal Hashing Properties

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

Module 6 • Subtopic 1
Subtopic 2Document Lecture

Collision Resolution Strategies: Chaining (Open Hashing) vs. Open Addressing (Linear, Quadratic, Double Hashing)

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

Module 6 • Subtopic 2
Subtopic 3Document Lecture

Dynamic Resizing, Rehashing, Load Factors and Cryptographic vs. Non-Cryptographic Hash Algorithms

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

Module 6 • Subtopic 3
Subtopic 1Document Lecture

Graph Terminology, Directed vs. Undirected Graphs, Adjacency Matrices and Adjacency Lists

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

Module 7 • Subtopic 1
Subtopic 2Document Lecture

Graph Traversal Algorithms: Breadth-First Search (BFS) and Depth-First Search (DFS)

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

Module 7 • Subtopic 2
Subtopic 3Document Lecture

Graph Applications: Cycle Detection, Topological Sorting (DAGs) and Shortest Paths (Dijkstra's Algorithm)

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

Module 7 • Subtopic 3
Subtopic 1Document Lecture

Comparison-Based Sorting: QuickSort, MergeSort, Complexity Limits and Algorithmic Stability

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

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 Sorting Algorithms

Module 8 • Formative Assessment
Subtopic 3Document Lecture

Linear-Time Sorting: Counting Sort, Radix Sort and Binary Searching in Static/Dynamic Arrays

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

Module 8 • Subtopic 3
Subtopic 4Document Lecture

Industrial Data Structure Selection: Production Trade-offs in Databases, OS Kernels and Network Routers

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 (ND)
Free$17.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 - Computer Science
Share On

Download Syllabus & Study Guide

Receive the full lecture syllabus, reading list, and milestone schedule for Data Structures (ND).

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

Data Structures (ND) — ND | PAMCET