Advanced Search
Search Results
131 total results found
8. Function Examples and Applications
8.1 Menu-Driven Program #include <stdio.h> // Function prototypes void display_menu(void); int get_choice(void); void calculator_add(void); void calculator_multiply(void); void display_table(int num); int main() { int choice; do { displa...
9. Common Errors and Debugging
9.1 Function Declaration Errors Error 1: Missing Function Prototype // ERROR: Function used before declaration int main() { int result = add_numbers(5, 3); // Error: 'add_numbers' not declared return 0; } int add_numbers(int a, int b) { return a ...
Introduction
Module 6: Tree Author: YP Learning Objectives After completing this module, students are expected to be able to: Explain the basic concepts of Binary Tree and Binary Search Tree (BST). Implement basic operations on BST: insert, search, delete. Understand and ...
Tree Concept
1. Theoretical Background 1.1 Binary Tree A Binary Tree is a tree data structure where each node has at most two children (left and right). No special rules apply to the placement of node values. Used for representing hierarchies, data structures such as heap...
Introduction
Module 9: Advanced Graph Author: YP Learning Objectives After completing this module, students are expected to be able to: Explain the basic concepts of Graph (including adjacency list and adjacency matrix representation). Implement graph traversal using DFS ...
Graph Concept
1. Theory 1.1 Definition of Graph A Graph is a data structure consisting of: Vertex (node) → represents an object. Edge → represents the relationship between objects. Graphs can be: Directed or Undirected. Weighted or Unweighted. 1.2 Graph Representation ...