Asymptotic Notations | Computer Algorithm | KopHub — KopHub

Chapters

On this page & study actions

Assessed progress

Sign in and complete the verified MCQs to track mastery.

Practice this topic Next topicRecurrence Relations and Solving Methods

Home/Sem 3/← Advanced Data Structures/Computer Algorithm/Asymptotic Notations

Unit 1: Computer Algorithm7 min read

Asymptotic Notations

Assessed progress

Sign in and complete the verified MCQs to track mastery.

Practice this topic Next topicRecurrence Relations and Solving Methods

Practice this subject

Continue to KopHub’s existing question and assessment experience.

PreviousPerformance Analysis: Space and Time Complexity Next Recurrence Relations and Solving Methods

CSE/SY Sem 3

Leaderboard Calendar Playground

CSE/SY Sem 3

Leaderboard Class Schedule Code Playground Settings

Appearance

Advanced Data Structures

6 Modules

Introduction to Algorithms and Pseudocode Recursive Algorithms Performance Analysis: Space and Time Complexity Asymptotic Notations Recurrence Relations and Solving Methods

Algorithmic Paradigms and Divide-and-Conquer Overview Binary Search Algorithm Finding Maximum and Minimum Elements Merge Sort Algorithm Quick Sort Algorithm

Binary Tree Fundamentals Advanced Tree Structures: BSTs, AVL, and Heaps Graph Definitions, Representations, and Traversals Minimum Spanning Tree Algorithms Shortest Path Algorithms

Content unavailableSoon

Greedy Method: General Principles and Machine Scheduling Greedy Method: Knapsack, Job Sequencing, and Optimal Storage Greedy Method: Optimal Merge Patterns and Huffman Codes Dynamic Programming: General Principles and Multistage Graphs Dynamic Programming: Knapsack, TSP, and Optimal Binary Search Trees

Introduction to P and NP Classes Understanding Polynomial Time Reductions NP-Completeness: Definition and Examples NP-Hardness and its Relationship with NP-CompletenessSoon

Advanced Data Structures

6 Modules

Introduction to Algorithms and Pseudocode Recursive Algorithms Performance Analysis: Space and Time Complexity Asymptotic Notations Recurrence Relations and Solving Methods

Algorithmic Paradigms and Divide-and-Conquer Overview Binary Search Algorithm Finding Maximum and Minimum Elements Merge Sort Algorithm Quick Sort Algorithm

Binary Tree Fundamentals Advanced Tree Structures: BSTs, AVL, and Heaps Graph Definitions, Representations, and Traversals Minimum Spanning Tree Algorithms Shortest Path Algorithms

Content unavailableSoon

Greedy Method: General Principles and Machine Scheduling Greedy Method: Knapsack, Job Sequencing, and Optimal Storage Greedy Method: Optimal Merge Patterns and Huffman Codes Dynamic Programming: General Principles and Multistage Graphs Dynamic Programming: Knapsack, TSP, and Optimal Binary Search Trees

Introduction to P and NP Classes Understanding Polynomial Time Reductions NP-Completeness: Definition and Examples NP-Hardness and its Relationship with NP-CompletenessSoon